Demo Data from VLDB 2026 / reviewers in the wild / expert
Liz Faultersack
dblp:28/7568
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Graph data management · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › graph visualization
graph layout |
0.8 | 1 | 2024 | Improving Property Graph Layouts by Leveraging Attribute Similarity for Structurally Equivalent Nodes · IEEE VIS 2024 |
Graph data management › graph data model
property graph |
0.2 | 1 | 2024 | Improving Property Graph Layouts by Leveraging Attribute Similarity for Structurally Equivalent Nodes · IEEE VIS 2024 |
Methods — techniques the papers use, named apart from their topics
linear-time algorithm · 1.5attribute similarity ordering · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Improving Property Graph Layouts by Leveraging Attribute Similarity for Structurally Equivalent NodesabstractMany real-world networks contain structurally-equivalent nodes. These are defined as vertices that share the same set of neighboring nodes, making them interchangeable with a traditional graph layout approach. However, many real-world graphs also have properties associated with nodes, adding additional meaning to them. We present an approach for swapping locations of structurally-equivalent nodes in graph layout so that those with more similar properties have closer proximity to each other. This improves the usefulness of the visualization from an attribute perspective without negatively impacting the visualization from a structural perspective. We include an algorithm for finding these sets of nodes in linear time, as well as methodologies for ordering nodes based on their attribute similarity, which works for scalar, ordinal, multidimensional, and categorical data. Patrick Mackey, Jacob Miller 0001, Liz Faultersack |
IEEE VIS | 3 |
| 2009 | T3: Secure, Scalable, Distributed Data Movement and Remote System Control for Enterprise Level Cyber SecurityabstractEnterprise level cyber security requires the deployment, operation, and monitoring of many sensors across geographically dispersed sites. Communicating with the sensors to gather data and control behavior is a challenging task when the number of sensors is rapidly growing. This paper describes the system requirements, design, and implementation of T3, the third generation of our transport software that performs this task. T3 relies on open source software and open Internet standards. Data is encoded in MIME format messages and transported via NNTP, which provides scalability. OpenSSL and public key cryptography are used to secure the data. Robustness and ease of development are increased by defining an internal cryptographic API, implemented by modules in C, Perl, and Python. We are currently using T3 in a production environment. It is freely available to download and use for other projects. Gregory S. Thomas, Bill Nickless, David R. Thiede, Ian Gorton, Bill J. Pitre, Jason E. Christy, Liz Faultersack, Jeffery A. Mauth |
COMPSAC (2) | 7 |