Tootfinder

"Research on the construction and application of problem-method-oriented academic graph empowered by LLM" https://doi.org/10.1007/s10791-025-09675-2
"Nowadays, the volume of literature in each field is huge and is growing rapidly, which posts challenge to researchers’ lit…

NERVIS: An Interactive System for Graph-Based Exploration and Editing of Named Entities
Uro\v{s} \v{S}majdek, Ciril Bohak
https://arxiv.org/abs/2510.04971 https://

NERVIS: An Interactive System for Graph-Based Exploration and Editing of Named Entities
We present an interactive visualization system for exploring named entities and their relationships across document collections. The system is designed around a graph-based representation that integrates three types of nodes: documents, entity mentions, and entities. Connections capture two key relationship types: (i) identical entities across contexts, and (ii) co-locations of mentions within documents. Multiple coordinated views enable users to examine entity occurrences, discover clusters of…

PowerPlots: An Open Source Power Grid Visualization and Data Analysis Framework for Academic Research
Noah Rhodes
https://arxiv.org/abs/2510.05063 https://…

PowerPlots: An Open Source Power Grid Visualization and Data Analysis Framework for Academic Research
Data visualization is important for developing an understanding of a complex system. PowerPlots.jl is a data visualization tool for power grids, one of the most complex systems in the world. The design of PowerPlots.jl is intended to facilitate exploration of power grid data while performing research and to facilitate communication of research findings to an audience. Several tools created to support this software also facilitate analysis of power grid data by transforming the data into graph t…

GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs
Sefat Rahman, Tushar M. Athawale, Paul Rosen
https://arxiv.org/abs/2508.05524

GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs
Reeb graphs are an important tool for abstracting and representing the topological structure of a function defined on a manifold. We have identified three properties for faithfully representing Reeb graphs in a visualization. Namely, they should be constrained to the boundary, compact, and aligned with the function gradient. Existing algorithms for drawing Reeb graphs are agnostic to or violate these properties. In this paper, we introduce an algorithm to generate Reeb graph visualizations, cal…

Interactive Graph Visualization and TeamingRecommendation in an Interdisciplinary Project'sTalent Knowledge Graph
Jiawei Xu, Juichien Chen, Yilin Ye, Zhandos Sembay, Swathi Thaker, Pamela Payne-Foster, Jake Chen, Ying Ding
https://arxiv.org/abs/2508.19489

Interactive Graph Visualization and TeamingRecommendation in an Interdisciplinary Project'sTalent Knowledge Graph
Interactive visualization of large scholarly knowledge graphs combined with LLM reasoning shows promise butremains under-explored. We address this gap by developing an interactive visualization system for the Cell Map forAI Talent Knowledge Graph (28,000 experts and 1,179 biomedical datasets). Our approach integrates WebGLvisualization with LLM agents to overcome limitations of traditional tools such as Gephi, particularly for large-scaleinteractive node handling. Key functionalities include re…

Planar Stories of Graph Drawings: Algorithms and Experiments
Carla Binucci, Sabine Cornelsen, Walter Didimo, Seok-Hee Hong, Eleni Katsanou, Maurizio Patrignani, Antonios Symvonis, Samuel Wolf
https://arxiv.org/abs/2508.17532

Planar Stories of Graph Drawings: Algorithms and Experiments
We address the problem of computing a dynamic visualization of a geometric graph $G$ as a sequence of frames. Each frame shows only a portion of the graph but their union covers $G$ entirely. The two main requirements of our dynamic visualization are: $(i)$ guaranteeing drawing stability, so to preserve the user's mental map; $(ii)$ keeping the visual complexity of each frame low. To satisfy the first requirement, we never change the position of the vertices. Regarding the second requirement, w…

VizGen: Data Exploration and Visualization from Natural Language via a Multi-Agent AI Architecture
Sandaru Fernando, Imasha Jayarathne, Sithumini Abeysekara, Shanuja Sithamparanthan, Thushari Silva, Deshan Jayawardana
https://arxiv.org/abs/2509.22218

VizGen: Data Exploration and Visualization from Natural Language via a Multi-Agent AI Architecture
Data visualization is essential for interpreting complex datasets, yet traditional tools often require technical expertise, limiting accessibility. VizGen is an AI-assisted graph generation system that empowers users to create meaningful visualizations using natural language. Leveraging advanced NLP and LLMs like Claude 3.7 Sonnet and Gemini 2.0 Flash, it translates user queries into SQL and recommends suitable graph types. Built on a multi-agent architecture, VizGen handles SQL generation, gra…

Parallel Algorithms for the One Sided Crossing Minimization Problem
Bogdan-Ioan Popa, Adrian-Marius Dumitran, Livia Magureanu
https://arxiv.org/abs/2509.23706 https://

Parallel Algorithms for the One Sided Crossing Minimization Problem
The One Sided Crossing Minimization (OSCM) problem is an optimization problem in graph drawing that aims to minimize the number of edge crossings in bipartite graph layouts. It has practical applications in areas such as network visualization and VLSI (Very Large Scale Integration) design, where reducing edge crossings improves the arrangement of circuit components and their interconnections. Despite the rise of multi-core systems, the parallelization of exact and fixed-parameter tractable (FPT…

GRAFT: GRaPH and Table Reasoning for Textual Alignment -- A Benchmark for Structured Instruction Following and Visual Reasoning
Abhigya Verma, Sriram Puttagunta, Seganrasan Subramanian, Sravan Ramachandran
https://arxiv.org/abs/2508.15690

GRAFT: GRaPH and Table Reasoning for Textual Alignment -- A Benchmark for Structured Instruction Following and Visual Reasoning
GRAFT is a structured multimodal benchmark for evaluating models on instruction-following, visual reasoning, and visual-textual alignment tasks. It features programmatically generated charts and synthetically rendered tables, created with Python visualization libraries to ensure control over data semantics, structure, and clarity. Each GRAFT instance pairs a chart or table image with a systematically generated, multi-step analytical question based solely on visual content. Answers are provided …

A Modular PyTheus Quantum Network Interpreter: Automated Analysis and Visualization of Optimized Quantum Architectures
S. K. Rithvik
https://arxiv.org/abs/2507.12997

A Modular PyTheus Quantum Network Interpreter: Automated Analysis and Visualization of Optimized Quantum Architectures
We present a modular interpreter for PyTheus-optimized quantum networks that automatically analyzes and visualizes complex quantum architectures discovered through automated optimization. The interpreter addresses the critical challenge of understanding machine-designed quantum networks by providing robust algorithms for functional role identification, graph-theoretical analysis, and physically meaningful visualization across the major classes of PyTheus-generated networks. Our interpreter acce…

Word2VecGD: Neural Graph Drawing with Cosine-Stress Optimization
Minglai Yang, Reyan Ahmed
https://arxiv.org/abs/2509.17333 https://arxiv.org/pdf/2509.1733…

Word2VecGD: Neural Graph Drawing with Cosine-Stress Optimization
We propose a novel graph visualization method leveraging random walk-based embeddings to replace costly graph-theoretical distance computations. Using word2vec-inspired embeddings, our approach captures both structural and semantic relationships efficiently. Instead of relying on exact shortest-path distances, we optimize layouts using cosine dissimilarities, significantly reducing computational overhead. Our framework integrates differentiable stress optimization with stochastic gradient desce…

Visualizing Treewidth
Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin N\"ollenburg
https://arxiv.org/abs/2508.19935 https://arx…

Visualizing Treewidth
A witness drawing of a graph is a visualization that clearly shows a given property of a graph. We study and implement various drawing paradigms for witness drawings to clearly show that graphs have bounded pathwidth or treewidth. Our approach draws the tree decomposition or path decomposition as a tree of bags, with induced subgraphs shown in each bag, and with ''tracks'' for each graph vertex connecting its copies in multiple bags. Within bags, we optimize the vertex layout to avoid crossings…