Publists

Publications: Liana Khazaliya

⬅️ Zurück zum Profil


2025

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, Jena, Germany, March 4-7, 2025 (Olaf Beyersdorff and Michal Pilipczuk and Elaine Pimentel and Kim Thang Nguyen), pages 33:1-33:20, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.

2024

Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable
J. Computational Geometry, volume 15, number 2, pages 3-39, 2024.
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 66:1-66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)
35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Juli\'an Mestre and Anthony Wirth), volume 322 of LIPIcs, pages 40:1-40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2023

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Computational Geometry (SoCG'23) (Chambers, Erin W. and Gudmundsson, Joachim), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers and Joachim Gudmundsson), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos and Markus Chimani), volume 14466 of Lecture Notes in Computer Science, pages 203-217, 2023, Springer.
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra and Magnus Wahlström), volume 285 of LIPIcs, pages 18:1-18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
SIAM J. Discrete Math., 2023.
Note: to appear
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
Dagstuhl Reports, volume 13, number 4, pages 58-97, 2023.
Publications: Manuel Sorge

⬅️ Zurück zum Profil


2026

Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks
The Fourteenth International Conference on Learning Representations, ICLR 2026, 2026, OpenReview.net.
Note: to appear

2025

The complexity of cluster vertex splitting and company
Discrete Applied Mathematics, volume 365, pages 190-207, 2025.
Optimal Decision Tree Pruning Revisited: Algorithms and Complexity
Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13-19, 2025, 2025, OpenReview.net.
Planarizing Graphs and their Drawings by Vertex Splitting
J. Computational Geometry, volume 16, number 1, pages 333-372, 2025.

2024

The Complexity of Cluster Vertex Splitting and Company
Theory and Practice of Computer Science (SOFSEM'24) (Henning Fernau and Serge Gaspers and Ralf Klasing), volume 14519 of LNCS, pages 226-239, 2024, Springer.

2023

The Influence of Dimensions on the Complexity of Computing Decision Trees
Conference on Artificial Intelligence (AAAI'23) (Brian Williams and Yiling Chen and Jennifer Neville), pages 8343-8350, 2023, AAAI Press.
On Computing Optimal Tree Ensembles
International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA (Andreas Krause and Emma Brunskill and Kyunghyun Cho and Barbara Engelhardt and Sivan Sabato and Jonathan Scarlett), volume 202 of Proceedings of Machine Learning Research, pages 17364-17374, 2023, PMLR.
Planarizing Graphs and their Drawings by Vertex Splitting
Graph Drawing and Network Visualization (GD'22) (Angelini, Patrizio and von Hanxleden, Reinhard), volume 13764 of LNCS, pages 232-246, 2023, Springer.

2022

Turbocharging Heuristics for Weak Coloring Numbers
European Symposium on Algorithms (ESA 2022) (Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz), volume 244 of LIPIcs, pages 44:1-44:18, 2022, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Threshold Treewidth and Hypertree Width
Journal of Artificial Intelligence Research, volume 74, pages 1687-1713, 2022.

2020

Threshold Treewidth and Hypertree Width
Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898-1904, 2020.
Threshold Treewidth and Hypertree Width
2020, Technical report AC-TR-20-005, Algorithms and Complexity Group, TU Wien.
Publications: Maria Bresich

⬅️ Zurück zum Profil


2026

A Reinforcement Learning Guided Large Neighborhood Search for the Dynamic Electric Autonomous Dial-a-Ride Problem
Machine Learning, Optimization, and Data Science (Nicosia, Giuseppe and Ojha, Varun and Giesselbach, Sven and Pardalos, M. Panos and Umeton, Renato and Emanuele, La Malfa and Gabriele, La Malfa), pages 425-439, 2026, Springer Nature Switzerland.

2025

Improvements in Large Neighborhood Search for the Electric Autonomous Dial-A-Ride Problem
Computer Aided Systems Theory -- EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-D\'iaz, Roberto), volume 15172 of LNCS, pages 211-220, 2025, Springer.
Revisiting Large Neighborhood Search with On-the-Fly Charging Station Insertion for the Electric Autonomous Dial-a-Ride Problem
ACM Transactions on Evolutionary Learning and Optimization, 2025, Association for Computing Machinery.
Note: Just Accepted

2024

Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem
Metaheuristics and Nature Inspired Computing (Dorronsoro, Bernab\'e and Ellaia, Rachid and Talbi, El-Ghazali), pages 3-20, 2024, Springer.
Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion
Proceedings of the Genetic and Evolutionary Computation Conference, pages 142-150, 2024, Association for Computing Machinery.
Note: best paper award winner of ECOM track

2023

Hybrid Metaheuristics Based on Large Neighborhood Search and Mixed Integer Linear Programming for the Directed Feedback Vertex Set Problem
January 2023, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and J. Varga
Publications: Markus Kirchweger

⬅️ Zurück zum Profil


2026

Formally Verified Graph Generation with SAT modulo Symmetries and Lean
Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Part of FLoC 2026, July 26--29, 2026, 2026, Springer.
Note: To appear
Graph Choosability via SAT: Beyond the Nullstellensatz
Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig and Chad Jenkins and Matthew E. Taylor), pages 14269-14277, 2026, AAAI Press.
Smart Cubing for Graph Search: A Comparative Study
32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20--23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 33:1-33:19, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: Preprint: CoRR abs/2501.17201, https://arxiv.org/abs/2501.17201

2025

Breaking Symmetries in Quantified Graph Search: A Comparative Study
AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh and Julie Shah and Zico Kolter), pages 11246-11254, 2025, AAAI Press.

2024

SAT Modulo Symmetries for Graph Generation and Enumeration
ACM Transactions on Computational Logic, volume 25, number 3, 2024.
Computing small Rainbow Cycle Numbers with SAT modulo Symmetries
The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Satisfiability Modulo User Propagators
Journal of Artificial Intelligence Research, volume 81, pages 989-1017, 2024.

2023

IPASIR-UP: User Propagators for CDCL
The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan and Friedrich Slivovsky), volume 271 of LIPIcs, pages 8:1-8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Co-Certificate Learning with SAT Modulo Symmetries
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 1944-1953, 2023, ijcai.org.
Note: Main Track
A SAT Solver's Opinion on the Erdős-Faber-Lov\'asz Conjecture
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy (Meena Mahajan and Friedrich Slivovsky), volume 271 of LIPIcs, pages 13:1-13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
SAT-Based Generation of Planar Graphs
The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan and Friedrich Slivovsky), volume 271 of LIPIcs, pages 14:1-14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2022

A SAT Attack on Rota’s Basis Conjecture
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel and Ofer Strichman), volume 236 of LIPIcs, pages 4:1-4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Evolutionary Computation in Combinatorial Optimization -- EvoCOP 2022 (P\'erez C\'aceres, Leslie and Verel, S\'ebastien), volume 13222 of LNCS, pages 127-142, 2022, Springer.
Note: best paper award winner
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Evolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings (Leslie P\'erez C\'aceres and S\'ebastien V\'erel), volume 13222 of Lecture Notes in Computer Science, pages 127-142, 2022, Springer.

2021

SAT Modulo Symmetries for Graph Generation
Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel), pages 39:1–-39:17, 2021, Dagstuhl Publishing.
Publications: Marlene Gründel

⬅️ Zurück zum Profil


2026

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy
Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR.
Note: to appear
Publications: Martin Kronegger

⬅️ Zurück zum Profil


2019

Parameterized Complexity of Asynchronous Border Minimization
Algorithmica, volume 81, number 1, pages 201-223, 2019.

2015

Fixed-parameter Tractable Reductions to SAT for Planning
Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25--31, 2015, Buenos Aires, Argentina, 2015.
Parameterized Complexity of Asynchronous Border Minimization
Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (Rahul Jain and Sanjay Jain and Frank Stephan), volume 9076 of Lecture Notes in Computer Science, pages 428-440, 2015, Springer.
Variable-Deletion Backdoors to Planning
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. (Blai Bonet and Sven Koenig), pages 3305-3312, 2015, AAAI Press.

2014

Backdoors to Planning
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Qu\'ebec City, Qu\'ebec, Canada. (Carla E. Brodley and Peter Stone), pages 2300-2307, 2014, AAAI Press.
Publications: Martin Nöllenburg

⬅️ Zurück zum Profil


2026

ARCOL: Aspect Ratio Constrained Orthogonal Layout
Comput. Graph. Forum, 2026.
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
Discrete and Computational Geometry, volume 75, pages 391-430, 2026.
The Story(line) So Far: A Survey on Storyline Visualization
Comput. Graph. Forum, volume 45, number 3, 2026.
Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints
Graph Drawing and Network Visualization (GD'26) (Löffler, Maarten and Miksch, Silvia), volume 396 of LIPIcs, 2026, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Note: To appear.
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen and Michael Lampis), 2026, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Note: To appear.
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
The Parameterized Complexity Of Extending Stack Layouts
Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026.
The Peculiarities of Extending Queue Layouts
Graph-Theoretic Concepts in Computer Science (WG'25) (Fernau, Henning and Kindermann, Philipp), volume 16124 of LNCS, pages 177-191, 2026, Springer.
On the Complexity of Extending Storylines
Graph Drawing and Network Visualization (GD'26) (Löffler, Maarten and Miksch, Silvia), volume 396 of LIPIcs, 2026, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Note: To appear.
Realizing Planar Linkages in Polygonal Domains
International Workshop on Combinatorial Algorithms (IWOCA'26) (Foucaud, F. and Parreau, A.), volume 16587 of LNCS, pages 251-265, 2026, Springer.
Representing Hypergraphs by Point-Line Incidences
Discret. Math. Theor. Comput. Sci., volume 28, number 3, pages \#3:1-24, 2026.
Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies
Pacific Visualization Symposium (PacificVis'26), pages 22-32, 2026.
Block Crossings in One-Sided Tanglegrams
Algorithmica, volume 88, pages 20:1-20:30, 2026.
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
Graph Drawing and Network Visualization (GD'26) (Löffler, Maarten and Miksch, Silvia), volume 396 of LIPIcs, 2026, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Note: To appear.
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
$F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness
IEEE Trans. Vis. Comput. Graph., volume 32, number 1, pages 747-757, 2026.
Clarity and Computational Efficiency of Orbital Boundary Labeling
Pacific Visualization Symposium (PacificVis'26), pages 1-10, 2026.
Combined Network and Set Visualization with Hoop and Linear Diagrams
Diagrammatic Representation and Inference (DIAGRAMS'26), 2026, Springer.
Note: To appear.
Using $\beta$-proximity to Reduce Distortion in Bundled Graph Drawings
EuroVis 2026 -- Short Papers (Byska, Jan and Ottley, Alvitta and Waldner, Manuela), 2026, Eurographics Association.

2025

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
Algorithms and Data Structures (WADS'25) (Morin, Pat and Oh, Eunjin), volume 349 of LIPIcs, pages 14:1-14:22, 2025, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Visualizing Treewidth
Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 17:1-17:20, 2025, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Pathways to Tractability for Geometric Thickness
Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Kr\'alovic and Vera Kurkov\'a), volume 15538 of LNCS, pages 209-224, 2025, Springer.
Partial Level Planarity Parameterized by the Size of the Missing Graph
European Workshop on Computational Geometry (EuroCG'25) (Kratochvíl, Jan and Liotta, Giuseppe), pages 50:1-50:10, 2025.
Geometry Matters in Planar Storyplans
Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 27:1-27:9, 2025, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
On Planar Unit-Length Linear Linkages in Polygonal Domains
European Workshop on Computational Geometry (EuroCG'25) (Kratochvíl, Jan and Liotta, Giuseppe), pages 55:1-55:9, 2025.
Optimizing Wiggle in Storylines
Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 39:1-39:17, 2025, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Representing Hypergraphs by Point-Line Incidences
Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Kr\'alovic and Vera Kurkov\'a), volume 15538 of LNCS, pages 241-254, 2025, Springer.
Transitions in Dynamic Point Labeling
Cartography and Geographic Information Science, pages 1-26, 2025.
On Minimizing Wiggle in Stacked Area Charts
Algorithms and Data Structures (WADS'25) (Morin, Pat and Oh, Eunjin), volume 349 of LIPIcs, pages 22:1-22:14, 2025, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Constrained Boundary Labeling
Comput. Geom. Theory Appl., volume 129, pages 102191, 2025.
Optimizing Staircase Motifs in Biofabric Network Layouts
Comput. Graph. Forum, pages e70139, 2025.
An Introduction to and Survey of Biological Network Visualization
Computers \& Graphics, volume 126, pages 104115, 2025.
Introducing Fairness in Network Visualization
Information Sciences, volume 691, pages 121642, 2025.
Planarizing Graphs and their Drawings by Vertex Splitting
J. Computational Geometry, volume 16, number 1, pages 333-372, 2025.
Passenger Decision-Making in Mass Transit Systems: Insights From Dual-Process Theories
Applied Cognitive Psychology, volume 39, number 5, pages e70112, 2025.
F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness
2025, Technical report AC-TR-25-001, Algorithms and Complexity Group, TU Wien.
StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Data
CoRR, 2025.
Bundling-Aware Graph Drawing Revisited
IEEE Trans. Vis. Comput. Graph., volume 31, number 12, pages 10828-10839, 2025.

2024

Bundling-Aware Graph Drawing
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 15:1-15:19, 2024, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
On the Complexity of the Storyplan Problem
J. Computer and Systems Sciences, volume 139, pages 103466, 2024.
Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable
J. Computational Geometry, volume 15, number 2, pages 3-39, 2024.
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
Computational Geometry (SoCG'24) (Mulzer, Wolfgang and Phillips, Jeff M.), volume 293 of LIPIcs, pages 19:1-19:16, 2024, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Boundary Labeling in a Circular Orbit
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 22:1-22:17, 2024, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Uncertainty in Humanities Network Visualization
Frontiers in Communication, volume 8, pages 1305137, 2024.
The Parameterized Complexity of Extending Stack Layouts
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 12:1-12:17, 2024, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 31:1-31:19, 2024, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Improving Temporal Treemaps by Minimizing Crossings
Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024.
Constrained Boundary Labeling
Algorithms and Computation (ISAAC'24) (Mestre, Julian and Wirth, Anthony), volume 322 of LIPIcs, pages 26:1-26:16, 2024, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Minimizing Switches in Cased Graph Drawings
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 43:1-43:3, 2024, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Note: Poster abstract
Splitting Plane Graphs to Outerplanarity
J. Graph Algorithms Appl., volume 28, number 3, pages 31-48, 2024.
Introducing Fairness in Graph Visualization
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 49:1-49:3, 2024, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Note: Poster abstract
Introducing Fairness in Graph Visualization via Gradient Descent
Machine Learning Methods in Visualisation for Big Data (MLVis'24) (Archambault, Daniel and Nabney, Ian and Peltonen, Jaakko), pages 1-5, 2024, Eurographics Association.
Visualizing Extensions of Argumentation Frameworks as Layered Graphs
CoRR, volume abs/2409.05457, 2024.
GdMetriX - A NetworkX Extension For Graph Drawing Metrics
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 45:1-45:3, 2024, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Note: Poster abstract
Computing Data-driven Multilinear Metro Maps
The Cartographic Journal, pages 1-16, 2024.
Computing Hive Plots: A Combinatorial Framework
J. Graph Algorithms Appl., volume 28, number 2, pages 101-129, 2024.
Hoop Diagrams: A Set Visualization Method
Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer.

2023

Splitting Vertices in 2-Layer Graph Drawings
IEEE Computer Graphics and Applications, volume 43, number 3, pages 24-35, 2023.
On the Complexity of the Storyplan Problem
Graph Drawing and Network Visualization (GD'22) (Angelini, Patrizio and von Hanxleden, Reinhard), volume 13764 of LNCS, pages 304-318, 2023, Springer.
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
European J. Combinatorics, volume 110, pages 103662, 2023.
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Computational Geometry (SoCG'23) (Chambers, Erin W. and Gudmundsson, Joachim), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Worbel: Aggregating Point Labels into Word Clouds
ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1-19:32, 2023.
Untangling Circular Drawings: Algorithms and Complexity
Comput. Geom. Theory Appl., volume 111, 2023.
Transitions in Dynamic Point Labeling
Geographic Information Science (GIScience'23) (Roger Beecham and Long, Jed A. and Dianna Smith and Qunshan Zhao and Sarah Wise), volume 277 of LIPIcs, pages 2:1-2:19, 2023, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Block Crossings in One-Sided Tanglegrams
Algorithms and Data Structures (WADS'23) (Morin, Pat and Suri, Subhash), volume 14079 of LNCS, pages 386-400, 2023, Springer.
Crossing Minimization in Time Interval Storylines
European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer and Carlos Seara), pages 36:1-36:7, 2023.
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
Dagstuhl Reports, volume 13, number 4, pages 58-97, 2023.
Splitting Plane Graphs to Outerplanarity
Algorithms and Computation (WALCOM'23) (Lin, Bertrand M. T. and Lin, Chun-Cheng and Liotta, Giuseppe), volume 13973 of LNCS, 2023, Springer.
MySemCloud: Semantic-aware Word Cloud Editing
Pacific Visualization Symposium (PacificVis'23), pages 147-156, 2023.
On Families of Planar DAGs with Constant Stack Number
Graph Drawing and Network Visualization (GD'23) (Bekos, Michael and Chimani, Markus), volume 14465 of LNCS, pages 135-151, 2023, Springer.
Planarizing Graphs and their Drawings by Vertex Splitting
Graph Drawing and Network Visualization (GD'22) (Angelini, Patrizio and von Hanxleden, Reinhard), volume 13764 of LNCS, pages 232-246, 2023, Springer.
Computing Hive Plots: A Combinatorial Framework
Graph Drawing and Network Visualization (GD'23) (Bekos, Michael and Chimani, Markus), volume 14466 of LNCS, pages 153-169, 2023, Springer.
MosaicSets: Embedding Set Systems into Grid Graphs
IEEE Trans. Visualization and Computer Graphics, 2023.
Faster Edge-Path Bundling Through Graph Spanners
Computer Graphics Forum, volume 42, number 6, pages e14789, 2023.
LinSets.zip: Compressing Linear Set Diagrams
IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875-2887, 2023.

2022

Parameterized Algorithms for Queue Layouts
J. Graph Algorithms Appl., volume 26, number 3, pages 335-352, 2022.
Minimum Link Fencing
Algorithms and Computation (ISAAC'22) (Bae, Sang Won and Park, Heejin), volume 248 of LIPIcs, pages 34:1-34:14, 2022, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
ACM J. Experimental Algorithmics, volume 27, pages 1.8:1-1.8:36, 2022.
Shape-Guided Mixed Metro Map Layout
Computer Graphics Forum, volume 41, number 7, pages 495-506, 2022.
Multidimensional Manhattan Preferences
Theoretical Informatics (LATIN'22) (Castañeda, Armando and Rodríguez-Henríquez, Francisco), volume 13568 of LNCS, pages 273-289, 2022, Springer.
Mixed Labeling: Integrating Internal and External Labels
IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848-1861, 2022.
On Computing Optimal Linear Diagrams
Diagrammatic Representation and Inference (DIAGRAMS'22) (Giardino, Valeria and Linker, Sven and Burns, Richard and Bellucci, Francesco and Boucheix, Jean-Michel and Viana, Petrucio), volume 13462 of LNAI, pages 20-36, 2022, Springer.
Recognizing Weighted and Seeded Disk Graphs
J. Computational Geometry, volume 13, number 1, pages 327-376, 2022.
Multicriteria Optimization for Dynamic Demers Cartograms
IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376-2387, 2022.
Note: TVCG Replicability Stamp
Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313-323, 2022.
Multi-level Area Balancing of Clustered Graphs
IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682-2696, 2022.

2021

Geometric Planar Networks on Bichromatic Collinear Points
Theoretical Computer Science, volume 895, pages 124-136, 2021.
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 242-256, 2021, Springer.
Worbel: Aggregating Point Labels into Word Clouds
Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256-267, 2021, ACM.
Balanced Independent and Dominating Sets on Colored Interval Graphs
Theory and Practice of Computer Science (SOFSEM'21) (Bureš, Tomáš and Dondi, Riccardo and Gamper, Johann and Guerrini, Giovanna and Jurdziński, Tomasz and Pahl, Claus and Sikora, Florian and Wong, Prudence), volume 12607 of LNCS, pages 89-103, 2021, Springer.
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 304-317, 2021, Springer.
Untangling Circular Drawings: Algorithms and Complexity
Algorithms and Computation (ISAAC'21) (Ahn, Hee-Kap and Sadakane, Kunihiko), volume 212 of LIPIcs, pages 19:1-19:17, 2021, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Disjoint Box Covering in a Rectilinear Polygon
European Workshop on Computational Geometry (EuroCG'21), pages 71:1-71:7, 2021.
External Labeling: Fundamental Concepts and Algorithmic Techniques
2021, Morgan \& Claypool.
On Strict (Outer-)Confluent Graphs
J. Graph Algorithms Appl., 2021.
ClusterSets: Optimizing Planar Clusters in Categorical Point Data
Computer Graphics Forum, volume 40, number 3, pages 471-481, 2021.
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
Dagstuhl Reports, volume 11, number 6, pages 82-123, 2021.
MetroSets: Visualizing Sets as Metro Maps
IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257-1267, 2021.
Labeling Nonograms: Boundary Labeling for Curve Arrangements
Comput. Geom. Theory Appl., volume 98, pages 101791, 2021.
Layered Area-Proportional Rectangle Contact Representation
Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 318-326, 2021, Springer.
On the Readability of Abstract Set Visualizations
IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821-2832, 2021.

2020

Geometric Planar Networks on Bichromatic Points
Algorithms and Discrete Applied Mathematics (CALDAM'20) (Changat, Manoj and Das, Sandip), volume 12016 of LNCS, pages 79-91, 2020, Springer.
Layered Fan-Planar Graph Drawings
Mathematical Foundations of Computer Science (MFCS'20) (Esparza, Javier and Král', Daniel), volume 170 of LIPIcs, pages 14:1-14:13, 2020, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Parameterized Algorithms for Book Embedding Problems
J. Graph Algorithms Appl., volume 24, number 4, pages 603-620, 2020.
Parameterized Algorithms for Queue Layouts
Graph Drawing and Network Visualization (GD'20) (Auber, David and Valtr, Pavel), volume 12590 of LNCS, pages 40-54, 2020, Springer.
Balanced Independent and Dominating Sets on Colored Interval Graphs
European Workshop on Computational Geometry (EuroCG'20), pages 66:1-66:6, 2020.
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Algorithms (ESA'20) (Grandoni, Fabrizio and Sanders, Peter and Herman, Grzegorz), volume 173 of LIPIcs, pages 19:1-19:24, 2020, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Mathematical Foundations of Computer Science (MFCS'20) (Esparza, Javier and Král', Daniel), volume 170 of LIPIcs, pages 31:1-31:16, 2020, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
Extending Partial 1-Planar Drawings
Automata, Languages, and Programming (ICALP'20) (Artur Czumaj and Anuj Dawar and Emanuela Merelli), volume 168 of LIPIcs, pages 43:1-43:19, 2020, Schloss Dagstuhl--Leibniz-Zentrum für Informatik.
Route Schematization with Landmarks
J. Spatial Information Science, volume 21, 2020.
Placing Labels in Road Maps: Algorithms and Complexity
Algorithmica, volume 82, pages 1881-1908, 2020.
A Unified Model and Algorithms for Temporal Map Labeling
Algorithmica, volume 82, pages 2709-2736, 2020.
Labeling Nonograms
European Workshop on Computational Geometry (EuroCG'20), pages 71:1-71:8, 2020.
Crossing Layout in Non-planar Graphs
Chapter in Beyond Planar Graphs (Hong, Seok-Hee and Tokuyama, Takeshi), pages 187-209, 2020, Springer Nature Singapore.
Towards Data-Driven Multilinear Metro Maps
Diagrammatic Representation and Inference (DIAGRAMS'20) (Pietarinen, Ahti-Veikko and Chapman, Peter and Bosveld de Smet, Leonie and Giardino, Valeria and Corter, James and Linker, Sven), volume 12169 of LNAI, pages 153-161, 2020, Springer.
The Turing Test for Graph Drawing Algorithms
Graph Drawing and Network Visualization (GD'20) (Auber, David and Valtr, Pavel), volume 12590 of LNCS, pages 466-481, 2020, Springer.
A Survey on Transit Map Layout -- from Design, Machine, and Human Perspectives
Computer Graphics Forum, volume 39, number 3, pages 619-646, 2020.

2019

Guidelines for Experimental Algorithmics: A Case Study in Network Analysis
Algorithms, volume 12, number 7, pages 127:1-127:37, 2019.
Planar Drawings of Fixed-Mobile Bigraphs
Theoretical Computer Science, volume 795, pages 408-419, 2019.
Parameterized Algorithms for Book Embedding Problems
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 365-378, 2019, Springer.
External Labeling Techniques: A Taxonomy and Survey
Computer Graphics Forum, volume 38, number 3, pages 833-860, 2019.
On the Readability of Leaders in Boundary Labeling
Information Visualization, volume 18, number 1, pages 110-132, 2019.
Short Plane Supports for Spatial Hypergraphs
J. Graph Algorithms Appl., volume 23, number 3, pages 463-498, 2019.
Mixed Linear Layouts: Complexity, Heuristics, and Experiments
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 460-467, 2019, Springer.
On Strict (Outer-)Confluent Graphs
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 147-161, 2019, Springer.
Exploring Semi-Automatic Map Labeling
Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13-22, 2019, ACM.
Maximizing Ink in Partial Edge Drawings of k-plane Graphs
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 323-336, 2019, Springer.
Lombardi Drawings of Knots and Links
J. Computational Geometry, volume 10, number 1, pages 444-476, 2019.
Minimizing crossings in constrained two-sided circular graph layouts
J. Computational Geometry, volume 10, number 2, pages 45-69, 2019.
Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses
Optics Express, volume 27, number 12, pages 17402-17425, 2019.
Computing Stable Demers Cartograms
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 46-60, 2019, Springer.
Metabopolis: scalable network layout for biological pathway diagrams in urban map style
BMC Bioinformatics, volume 20, pages 187, 2019.

2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
Graph Drawing and Network Visualization (GD'18) (Biedl, Therese and Kerren, Andreas), volume 11282 of LNCS, pages 509-523, 2018, Springer International Publishing.
Planar Drawings of Fixed-Mobile Bigraphs
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 426-439, 2018, Springer.
Planar L-Drawings of Directed Graphs
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 465-478, 2018, Springer.
Short Plane Supports for Spatial Hypergraphs
Graph Drawing and Network Visualization (GD'18) (Biedl, Therese and Kerren, Andreas), volume 11282 of LNCS, pages 53-66, 2018, Springer International Publishing.
Planar and poly-arc Lombardi drawings
J. Computational Geometry, volume 9, number 1, pages 328-355, 2018.
Minimzing Wiggles in Storyline Visualizations
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 585-587, 2018, Springer.
Scalable Set Visualizations (Dagstuhl Seminar 17332)
Dagstuhl Reports, volume 7, number 8, pages 1-22, 2018.
Graph Visualization
Chapter in Encyclopedia of Big Data Technologies (Sakr, Sherif and Zomaya, Albert), 2018, Springer International Publishing.
Lombardi Drawings of Knots and Links
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 113-126, 2018, Springer.
Experimental Evaluation of Book Drawing Algorithms
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 224-238, 2018, Springer.
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Computational Geometry (SoCG'18) (Speckmann, Bettina and Tóth, Csaba D.), pages 53:1-53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Towards Characterizing Strict Outerconfluent Graphs
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 612-614, 2018, Springer.
Drawing Large Graphs by Multilevel Maxent-Stress Optimization
IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814-1827, 2018.
A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways
Eurographics Conference on Visualization (EuroVis'18) -- Posters (Puig, Anna and Raidou, Renata), pages 57-59, 2018.

2017

Progress on Partial Edge Drawings
J. Graph Algorithms Appl., volume 21, number 4, pages 757-786, 2017.
Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd
Chapter in Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments (Archambault, Daniel and Purchase, Helen and Hoßfeld, Tobias), volume 10264 of LNCS, pages 6-26, 2017, Springer International Publishing.
Minimizing crossings in constrained two-sided circular graph layouts
European Workshop on Computational Geometry (EuroCG'17), pages 265-268, April 2017.
Radial Contour Labeling with Straight Leaders
IEEE Pacific Visualization Symposium (PacificVis'17), pages 295-304, 2017.
Euclidean Greedy Drawings of Trees
Discrete and Computational Geometry, volume 58, number 3, pages 543-579, 2017.
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
International Journal of Computational Geometry and Applications, volume 27, number 1--2, pages 121-158, 2017.

2016

Adjacency-Preserving Spatial Treemaps
J. Computational Geometry, volume 7, number 1, pages 100-122, 2016.
Temporal Map Labeling: A New Unified Framework with Experiments
Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1-23:10, 2016.
Strict Confluent Drawing
J. Computational Geometry, volume 7, number 1, pages 22-46, 2016.
Consistent Labeling of Rotating Maps
J. Computational Geometry, volume 7, number 1, pages 308-331, 2016.
Evaluation of Labeling Strategies for Rotating Maps
ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1-1.4:21, 2016.
Mixed Map Labeling
J. Spatial Information Science, volume 13, pages 3-32, 2016.
Extending Convex Partial Drawings of Graphs
Algorithmica, volume 76, number 1, pages 47-67, 2016.
An Algorithmic Framework for Labeling Road Maps
Geographic Information Science (GIScience '16) (Miller, Jennifer A. and O'Sullivan, David and Wiegand, Nancy), volume 9927 of LNCS, pages 308-322, 2016, Springer International Publishing.
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
J. Computational Geometry, volume 7, number 1, pages 47-69, 2016.
Software Visualization via Hierarchic Micro/Macro Layouts
Information Visualization Theory and Applications (IVAPP'16) (Linsen, Lars and Telea, Alexandru C.), pages 153-160, 2016, SciTePress.

2015

Towards Realistic Pedestrian Route Planning
Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'15) (Italiano, Giuseppe F. and Schmidt, Marie), volume 48 of OpenAccess Series in Informatics (OASIcs), pages 1-15, 2015, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
Many-to-One Boundary Labeling with Backbones
J. Graph Algorithms Appl., volume 19, number 3, pages 779-816, 2015.
Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052)
Dagstuhl Reports, volume 5, number 1, pages 243-258, 2015.
On the Readability of Boundary Labeling
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 515-527, 2015, Springer International Publishing.
Multi-Row Boundary-Labeling Algorithms for Panorama Images
ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1-1:30, 2015.
Label Placement in Road Maps
Algorithms and Complexity (CIAC'15) (Paschos, V. Th. and Widmayer, Peter), volume 9079 of LNCS, pages 221-234, 2015, Springer International Publishing.
Recognizing Weighted Disk Contact Graphs
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 433-446, 2015, Springer International Publishing.
On Minimizing Crossings in Storyline Visualizations
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 192-198, 2015, Springer International Publishing.
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 231-244, 2015, Springer International Publishing.
Operating Power Grids with Few Flow Control Buses
Future Energy Systems (e-Energy'15), pages 289-294, 2015, ACM.
Mixed Map Labeling
Algorithms and Complexity (CIAC'15) (Paschos, V. Th. and Widmayer, Peter), volume 9079 of LNCS, pages 339-351, 2015, Springer International Publishing.
Towards Realistic Flow Control in Power Grid Operation
Energy Informatics (EI'15) (Gottwalt, Sebastian and König, Lukas and Schmeck, Hartmut), volume 9424 of LNCS, pages 192-199, 2015, Springer International Publishing.
Drawing Large Graphs by Multilevel Maxent-Stress Optimization
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 30-43, 2015, Springer International Publishing.
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
Algorithms and Computation (ISAAC'15) (Elbassioni, Khaled and Makino, Kazuhisa), volume 9472 of LNCS, pages 637-649, 2015, Springer Berlin Heidelberg.

2014

Simultaneous Embeddability of Two Partitions
Graph Drawing (GD'14) (Duncan, Christian A. and Symvonis, Antonios), volume 8871 of LNCS, pages 64-75, 2014, Springer Berlin Heidelberg.
Semantic Word Cloud Representations: Hardness and Approximation Algorithms
Theoretical Informatics (LATIN'14) (Viola, Alfredo), volume 8392 of LNCS, pages 514-525, 2014, Springer Berlin Heidelberg.
PIGRA -- A Tool for Pixelated Graph Representations
Graph Drawing (GD'14) (Duncan, Christian A. and Symvonis, Antonios), volume 8871 of LNCS, pages 513-514, 2014, Springer Berlin Heidelberg.
Note: Poster abstract
On d-regular schematization of embedded paths
Comput. Geom. Theory Appl., volume 47, number 3A, pages 381-406, 2014.
Evaluation of Labeling Strategies for Rotating Maps
Experimental Algorithms (SEA'14) (Gudmundsson, Joachim and Katajainen, J.), volume 8504 of LNCS, pages 235-246, 2014, Springer International Publishing.
Scalability Considerations for Multivariate Graph Visualization
Chapter in Multivariate Network Visualization (Kerren, Andreas and Purchase, Helen C. and Ward, Matthew O.), volume 8380 of LNCS, pages 207-235, 2014, Springer International Publishing.
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
Algorithm Theory (SWAT'14) (Ravi, R. and Gørtz, I. L.), volume 8503 of LNCS, pages 253-264, 2014, Springer International Publishing.
A survey on automated metro map layout methods
Schematic Mapping Workshop, April 2014.
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
Graph Drawing (GD'14) (Duncan, Christian A. and Symvonis, Antonios), volume 8871 of LNCS, pages 476-487, 2014, Springer Berlin Heidelberg.

2013

Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 553-554, 2013, Springer Berlin Heidelberg.
Note: Poster abstract
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 460-471, 2013, Springer Berlin Heidelberg.
Many-to-One Boundary Labeling with Backbones
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 244-255, 2013, Springer Berlin Heidelberg.
Progress on Partial Edge Drawings
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 67-78, 2013, Springer Berlin Heidelberg.
Drawing Trees with Perfect Angular Resolution and Polynomial Area
Discrete and Computational Geometry, volume 49, number 2, pages 157-182, 2013.
Strict Confluent Drawing
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 352-363, 2013, Springer Berlin Heidelberg.
Optimal 3D Angular Resolution for Low-Degree Graphs
J. Graph Algorithms Appl., volume 17, number 3, pages 173-200, 2013.
Drawing Metro Maps using Bézier Curves
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 463-474, 2013, Springer Berlin Heidelberg.
Trajectory-Based Dynamic Map Labeling
Algorithms and Computation (ISAAC'13) (Cai, Leizhen and Cheng, Siu-Wing and Lam, Tak-Wah), volume 8283 of LNCS, pages 413-423, 2013, Springer Berlin Heidelberg.
Circular-Arc Cartograms
IEEE Pacific Visualization Symposium (PacificVis'13), pages 1-8, 2013, IEEE.
Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151)
Dagstuhl Reports, volume 3, number 4, pages 34-68, 2013.
Planar Lombardi Drawings of Outerpaths
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 561-562, 2013, Springer Berlin Heidelberg.
Note: Poster abstract
Drawing Planar Graphs with a Prescribed Inner Face
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 316-327, 2013, Springer Berlin Heidelberg.
Euclidean Greedy Drawings of Trees
Algorithms (ESA'13) (Bodlaender, H. L. and Italiano, G. F.), volume 8125 of LNCS, pages 767-778, 2013, Springer Berlin Heidelberg.
Edge-weighted contact representations of planar graphs
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 224-235, 2013, Springer Berlin Heidelberg.
Edge-weighted contact representations of planar graphs
J. Graph Algorithms Appl., volume 17, number 4, pages 441-473, 2013.
On The Usability of Lombardi Graph Drawings
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 451-462, 2013, Springer Berlin Heidelberg.

2012

Cover Contact Graphs
J. Computational Geometry, volume 3, number 1, pages 102-131, 2012.
Drawing (Complete) Binary Tanglegrams
Algorithmica, volume 62, number 1--2, pages 309-332, 2012.
Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
Computer Vision and Image Understanding, volume 116, number 7, pages 803-814, 2012.
Lombardi Drawings of Graphs
J. Graph Algorithms Appl., volume 16, number 1, pages 85-108, 2012.

2011

Adjacency-Preserving Spatial Treemaps
Algorithms and Data Structures (WADS'11) (Dehne, Frank and Iacono, John and Sack, Jörg-Rüdiger), volume 6844 of LNCS, pages 159-170, 2011, Springer Berlin Heidelberg.
Drawing Trees with Perfect Angular Resolution and Polynomial Area
Graph Drawing (GD'10) (Brandes, Ulrik and Cornelsen, Sabine), volume 6502 of LNCS, pages 183-194, 2011, Springer Berlin Heidelberg.
Lombardi Drawings of Graphs
Graph Drawing (GD'10) (Brandes, Ulrik and Cornelsen, Sabine), volume 6502 of LNCS, pages 195-207, 2011, Springer Berlin Heidelberg.
Optimal 3D Angular Resolution for Low-Degree Graphs
Graph Drawing (GD'10) (Brandes, Ulrik and Cornelsen, Sabine), volume 6502 of LNCS, pages 208-219, 2011, Springer Berlin Heidelberg.
Boundary-Labeling Algorithms for Panorama Images
Advances in Geographic Information Systems (SIGSPATIAL'11), pages 289-298, 2011, ACM.
Automatic Generation of Route Sketches
Graph Drawing (GD'10) (Brandes, Ulrik and Cornelsen, Sabine), volume 6502 of LNCS, pages 391-392, 2011, Springer Berlin Heidelberg.
Note: Poster abstract
On d-regular Schematization of Embedded Paths
Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of LNCS, pages 260-271, 2011, Springer Berlin Heidelberg.
Consistent Labeling of Rotating Maps
Algorithms and Data Structures (WADS'11) (Dehne, Frank and Iacono, John and Sack, Jörg-Rüdiger), volume 6844 of LNCS, pages 451-462, 2011, Springer Berlin Heidelberg.
Sliding Labels for Dynamic Point Labeling
Canadian Conference on Computational Geometry (CCCG '11), pages 205-210, 2011, University of Toronto.
Connecting Two Trees with Optimal Routing Cost
Canadian Conference on Computational Geometry (CCCG '11), pages 43-47, 2011, University of Toronto.
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
IEEE Trans. Visualization and Computer Graphics, volume 17, number 5, pages 626-641, 2011.

2010

Boundary Labeling with Octilinear Leaders
Algorithmica, volume 57, pages 436-461, 2010.
Optimizing Active Ranges for Consistent Dynamic Map Labeling
Comput. Geom. Theory Appl., volume 43, number 3, pages 312-328, 2010.
Path Schematization for Route Sketches
Algorithm Theory (SWAT'10) (Kaplan, H.), volume 6139 of LNCS, pages 285-296, 2010, Springer Berlin Heidelberg.
Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling
Canadian Conference on Computational Geometry (CCCG '10), pages 203-206, 2010, University of Manitoba.
An Improved Algorithm for the Metro-Line Crossing Minimization Problem
Graph Drawing (GD'09) (Eppstein, David and Gansner, Emden R.), volume 5849 of LNCS, pages 381-392, 2010, Springer Berlin Heidelberg.
Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität
Chapter in Ausgezeichnete Informatikdissertationen 2009 (Hölldobler, Steffen), volume D-10 of Lecture Notes in Informatics (LNI), 2010, Gesellschaft für Informatik e.V. (GI).
Dynamic One-Sided Boundary Labeling
Advances in Geographic Information Systems (SIGSPATIAL'10), pages 310-319, 2010, ACM.

2009

Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
Graph Drawing (GD'08) (Tollis, Ioannis G. and Patrignani, Maurizio), volume 5417 of LNCS, pages 324-335, 2009, Springer Berlin Heidelberg.
Algorithms for Multi-Criteria Boundary Labeling
J. Graph Algorithms Appl., volume 13, number 3, pages 289-317, 2009.
Consistent Digital Rays
Discrete and Computational Geometry, volume 42, number 3, pages 359-378, 2009.
Network Visualization: Algorithms, Applications, and Complexity
February 2009, PhD thesis, Fakultät für Informatik, Universität Karlsruhe (TH).
Drawing Binary Tanglegrams: An Experimental Evaluation
Algorithm Engineering and Experiments (ALENEX'09) (Finocchi, Irene and Hershberger, John), pages 106-119, 2009, SIAM.

2008

Cover Contact Graphs
Graph Drawing (GD'07) (Hong, Seok-Hee and Nishizeki, Takao), volume 4875 of LNCS, pages 171-182, 2008, Springer Berlin Heidelberg.
Algorithms for Multi-Criteria One-Sided Boundary Labeling
Graph Drawing (GD'07) (Hong, Seok-Hee and Nishizeki, Takao), volume 4875 of LNCS, pages 243-254, 2008, Springer Berlin Heidelberg.
Boundary Labeling with Octilinear Leaders
Algorithm Theory (SWAT'08) (Gudmundsson, Joachim), volume 5124 of LNCS, pages 234-245, 2008, Springer Berlin Heidelberg.
Optimizing Active Ranges for Consistent Dynamic Map Labeling
Computational Geometry (SoCG'08), pages 10-19, 2008, ACM.
Consistent Digital Rays
Computational Geometry (SoCG'08), pages 355-364, 2008, ACM.
Morphing Polylines: A Step Towards Continuous Generalization
Computers, Environment and Urban Systems, volume 32, number 4, pages 248-260, 2008.

2007

Improved Algorithms for Length-Minimal One-Sided Boundary Labeling
European Workshop on Computational Geometry (EuroCG'07), pages 190-193, March 2007.
Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps
Graph Drawing (GD'06) (Kaufmann, M. and Wagner, D.), volume 4372 of LNCS, pages 270-281, 2007, Springer-Verlag.
Morphing Polygonal Lines: A Step Towards Continuous Generalization
Geographic Information Science Research Conference UK (GISRUK'07) (Winstanley, Adam), pages 390-399, 2007.
Geographic Visualization
Chapter in Human-Centered Visualization Environments (Kerren, Andreas and Ebert, Achim and Meyer, Joerg), volume 4417 of LNCS, pages 257-294, 2007, Springer Berlin Heidelberg.

2006

A Mixed-Integer Program for Drawing High-Quality Metro Maps
Graph Drawing (GD'05) (Healy, Patrick and Nikolov, Nikola S.), volume 3843 of LNCS, pages 321-333, 2006, Springer Berlin Heidelberg.

2005

Automated Drawing of Metro Maps
August 2005, Master's thesis, Fakultät für Informatik, Universität Karlsruhe (TH).
Automated Drawing of Metro Maps
2005, Technical report 2005-25, Fakultät für Informatik, Universität Karlsruhe.

2004

Validation in the Cluster Analysis of Gene Expression Data
Workshop Fuzzy-Systeme und Computational Intelligence (Mikut, R. and Reischl, M.), pages 13-32, 2004, Universitätsverlag Karlsruhe.
Publications: Mathis Teva Rocton

⬅️ Zurück zum Profil


2026

Computing Twin-Width via Treedepth and Vertex Integrity
43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

2025

Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity
SIAM J. Discret. Math., 2025.
Note: to appear
PACE Solver Description: Bad Dominating Set Maker
20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal and Erik Jan van Leeuwen), pages 35:1-35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.
Training One-Dimensional Graph Neural Networks is NP-Hard
The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.

2024

Computing Twin-Width Parameterized by the Feedback Edge Number
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (Olaf Beyersdorff and Mamadou Moustapha Kant\'e and Orna Kupferman and Daniel Lokshtanov), volume 289 of LIPIcs, pages 7:1-7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Twin-Width Meets Feedback Edges and Vertex Integrity
19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United Kingdom (\'Edouard Bonnet and Pawel Rzazewski), volume 321 of LIPIcs, pages 3:1-3:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Parameterized Complexity Landscape of the Unsplittable Flow Problem
Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Kr\'al and Martin Milanic), volume 14760 of Lecture Notes in Computer Science, pages 220-235, 2024, Springer.

2023

PACE Solver Description: Touiouidth
Parameterized and Exact Computation (IPEC'2023) (Neeldhara Misra and Magnus Wahlström), volume 285 of LIPIcs, pages 38:1-38:4, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training
Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023.
Publications: Pablo Manrique Merchan

⬅️ Zurück zum Profil


2026

Formally Verified Graph Generation with SAT modulo Symmetries and Lean
Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Part of FLoC 2026, July 26--29, 2026, 2026, Springer.
Note: To appear
Publications: Phuc Hung Hoang

⬅️ Zurück zum Profil


2026

Coordinated Motion Planning is FPT on Discretized Simple Polygons
53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Not All Degree Constraints Are Created Equal when Computing Spanning Trees
21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
A Parameterized-Complexity Framework for Finding Local Optima
17th Innovations in Theoretical Computer Science Conference, ITCS 2026, 2026.
Note: to appear
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
AAAI-26, Sponsored by the Association for the Advancement of Artificial Intelligence, 2026, AAAI Press.
Note: to appear
Parameterized Complexity of Efficient Sortation
51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

2024

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
Algorithmica, volume 86, number 7, pages 2250-2288, 2024.
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(\geq\) 5
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 84:1-84:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Generating All Invertible Matrices by Row Operations
35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Juli\'an Mestre and Anthony Wirth), volume 322 of LIPIcs, pages 35:1-35:14, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.