Demo Data from VLDB 2026 / reviewers in the wild / expert
Mershack Okoe
dblp:149/0936
· DBLP profile ↗
5ranked-venue papers
4as first author
1since 2021 · last 2025
0000-0002-0034-2209ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 since 2021Theory of computation · 1 · 1 first-author
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
2 papers |
Visualization and visual analytics · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
User interface design and tools · 77% Usability and user experience research · 23% |
Topics — the 5 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › graph visualization
adjacency matrix |
0.4 | 1 | 2019 | Node-Link or Adjacency Matrices: Old Question, New Insights · IEEE Trans. Vis. Comput. Graph. 2019 |
Visualization and visual analytics
graph visualization |
0.4 | 1 | 2019 | Node-Link or Adjacency Matrices: Old Question, New Insights · IEEE Trans. Vis. Comput. Graph. 2019 |
Visualization and visual analytics › graph visualization
node-link diagram |
0.4 | 1 | 2019 | Node-Link or Adjacency Matrices: Old Question, New Insights · IEEE Trans. Vis. Comput. Graph. 2019 |
Visualization and visual analytics › visualization evaluation
crowdsourced evaluation |
0.1 | 1 | 2019 | Node-Link or Adjacency Matrices: Old Question, New Insights · IEEE Trans. Vis. Comput. Graph. 2019 |
Visualization and visual analytics
visual analytics |
0.1 | 1 | 2019 | Node-Link or Adjacency Matrices: Old Question, New Insights · IEEE Trans. Vis. Comput. Graph. 2019 |
Methods — techniques the papers use, named apart from their topics
literate programming · 1.7javascript specification · 1.7qualitative feedback · 0.4crowdsourced study · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | VisUnit: Literate Visualisation Studies Assembled from Reusable Test-SuitesabstractWe make four contributions to lower the overhead of conducting visualisation user studies and promote the reuse and extension of their materials. (i) A declarative Javascript specification lets experimenters describe how studies are assembled from tested visualisations, datasets, tasks and chosen evaluation strategies. (ii) A VisUnit library translates these into sequences of visual stimuli and delivers them to participants. We move away from monolithic evaluation stimuli typical of previous work and construct studies around three ingredients – visual encodings, datasets, and tasks – that can be developed independently and recombined flexibly. (iii) This paves the way for developing benchmark data+tasks test-suites as independent, reusable resources to support multiple studies. (iv) Structuring user studies as “literate” visualisation notebooks brings together in the open all ingredients necessary for replication and scrutiny: formal design specification; underlying materials; participant-facing views; and narratives justifying design and supporting reuse. Radu Jianu, Aidan Slingsby, Dany Laksono, Mershack Okoe |
CHI | 4 |
| 2019 | Node-Link or Adjacency Matrices: Old Question, New InsightsabstractVisualizing network data is applicable in domains such as biology, engineering, and social sciences. We report the results of a study comparing the effectiveness of the two primary techniques for showing network data: node-link diagrams and adjacency matrices. Specifically, an evaluation with a large number of online participants revealed statistically significant differences between the two visualizations. Our work adds to existing research in several ways. First, we explore a broad spectrum of network tasks, many of which had not been previously evaluated. Second, our study uses two large datasets, typical of many real-life networks not explored by previous studies. Third, we leverage crowdsourcing to evaluate many tasks with many participants. This paper is an expanded journal version of a Graph Drawing (GD'17) conference paper. We evaluated a second dataset, added a qualitative feedback section, and expanded the procedure, results, discussion, and limitations sections. Mershack Okoe, Radu Jianu, Stephen G. Kobourov |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2017 | Revisited Experimental Comparison of Node-Link and Matrix Representations
Mershack Okoe, Radu Jianu, Stephen G. Kobourov |
GD | 1 |
| 2015 | GraphUnit: Evaluating Interactive Graph Visualizations Using CrowdsourcingabstractAbstract We present GraphUnit, a framework and online service that automates the process of designing, running and analyzing results of controlled user studies of graph visualizations by leveraging crowdsourcing and a set of evaluation modules based on a graph task taxonomy. User studies play an important role in visualization research but conducting them requires expertise and is time consuming. GraphUnit simplifies the evaluation process by allowing visualization designers to easily configure user studies for their web‐based graph visualizations, deploy them online, use Mechanical Turk to attract participants, collect user responses and store them in a database, and analyze incoming results automatically using appropriate statistical tools and graphs. We demonstrate the effectiveness of GraphUnit by replicating two published evaluation studies on network visualization, and showing that these studies could be configured in less than an hour. Finally, we discuss how GraphUnit can facilitate quick evaluations of alternative graph designs and thus encourage the frequent use of user studies to evaluate design decisions in iterative development processes. Mershack Okoe, Radu Jianu |
Comput. Graph. Forum | 1 |
| 2014 | A Gaze-enabled Graph Visualization to Improve Graph Reading TasksabstractAbstract Performing typical network tasks such as node scanning and path tracing can be difficult in large and dense graphs. To alleviate this problem we use eye‐tracking as an interactive input to detect tasks that users intend to perform and then produce unobtrusive visual changes that support these tasks. First, we introduce a novel fovea based filtering that dims out edges with endpoints far removed from a user's view focus. Second, we highlight edges that are being traced at any given moment or have been the focus of recent attention. Third, we track recently viewed nodes and increase the saliency of their neighborhoods. All visual responses are unobtrusive and easily ignored to avoid unintentional distraction and to account for the imprecise and low‐resolution nature of eye‐tracking. We also introduce a novel gaze‐correction approach that relies on knowledge about the network layout to reduce eye‐tracking error. Finally, we present results from a controlled user study showing that our methods led to a statistically significant accuracy improvement in one of two network tasks and that our gaze‐correction algorithm enables more accurate eye‐tracking interaction. Mershack Okoe, Sayeed Safayet Alam, Radu Jianu |
Comput. Graph. Forum | 1 |