Publists

Publications: Liana Khazaliya

⬅️ Zurück zum Profil


2025

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
J. Comput. Geom., 2025.
Note: to appear
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


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

Graph Choosability via SAT: Beyond the Nullstellensatz
The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026, 2026.
Note: To appear

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.
Note: Accepted at EuroVIS 2026. To appear.
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
Discrete and Computational Geometry, volume 75, pages 391-430, 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.
Realizing Planar Linkages in Polygonal Domains
International Workshop on Combinatorial Algorithms (IWOCA'26), 2026.
Note: To appear.
Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies
Pacific Visualization Symposium (PacificVis'26), 2026.
Note: To appear.
Block Crossings in One-Sided Tanglegrams
Algorithmica, volume 88, pages 20:1-20:30, 2026.
$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), 2026.
Note: To appear.
Using $\beta$-proximity to Reduce Distortion in Bundled Graph Drawings
EuroVis 2026 -- Short Papers, 2026, Eurographics Association.
Note: To appear.

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.
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: 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
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

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.
Publications: Robert Ganian

⬅️ 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
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award)
2026 Symposium on Simplicity in Algorithms, SOSA 2026, 2026, SIAM.
Note: to appear
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
Fair Correlation Clustering Meets Graph Parameters
Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026), 2026.
Note: to appear
The Complexity of Extending Fair Allocations of Indivisible Goods
Journal of Artificial Intelligence Research, 2026.
Note: to appear
Routing Few Robots in a Crowded Network
Journal of Computer and System Sciences, 2026.
Note: to appear
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
ACM Transactions on Algorithms, 2026.
Note: to appear
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.
The Parameterized Complexity of Coordinated Motion Planning
Discrete and Computational Geometry, 2026.
Note: to appear
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
Algorithmica, volume 88, number 1, pages 8, 2026.
A Structural Complexity Analysis of Synchronous Dynamical Systems
Artificial Intelligence, 2026.
Note: to appear
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
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
Makespan Minimization in Split Learning: From Theory to Practice
IEEE INFOCOM 2026 - IEEE Conference on Computer Communications, 2026.
Note: to appear
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
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
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

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
ACM Trans. Comput. Theory, volume 17, number 3, pages 18:1-18:42, 2025.
Crossing and Independent Families Among Polygons
19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada (Pat Morin and Eunjin Oh), volume 349 of LIPIcs, pages 11:1-11:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
J. Comput. Geom., 2025.
Note: to appear
A Structural Complexity Analysis of Hierarchical Task Network Planning
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2025, Montreal, Canada, August 16-22, 2025, pages 4391-4400, 2025, ijcai.org.
Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity
SIAM J. Discret. Math., 2025.
Note: to appear
The complexity of optimizing atomic congestion
Artif. Intell., volume 338, pages 104241, 2025.
The Complexity of Extending Fair Allocations of Indivisible Goods
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 13745-13753, 2025, AAAI Press.
Routing Few Robots in a Crowded Network
19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada (Pat Morin and Eunjin Oh), volume 349 of LIPIcs, pages 20:1-20:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Parameterized Algorithms for Multiagent Pathfinding on Trees
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2025, Detroit, MI, USA, May 19-23, 2025 (Sanmay Das and Ann Now\'e and Yevgeniy Vorobeychik), pages 584-592, 2025, International Foundation for Autonomous Agents and Multiagent Systems / ACM.
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.
Pathways to Tractability for Geometric Thickness (Best Paper Award)
SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part I (Rastislav Kr\'alovic and Vera Kurkov\'a), volume 15538 of Lecture Notes in Computer Science, pages 209-224, 2025, Springer.
Structural Parameterizations of Simultaneous Planarity
36th International Symposium on Algorithms and Computation, ISAAC 2025, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
The Peculiarities of Extending Queue Layouts
Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, 2025.
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit and Haim Kaplan and Sebastian Wild and Grzegorz Herman), volume 351 of LIPIcs, pages 15:1-15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
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.
Approximate Evaluation of Quantitative Second Order Queries
2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 664-677, June 2025, IEEE Computer Society.
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
41st International Symposium on Computational Geometry, SoCG 2025, June 23-27, 2025, Kanazawa, Japan (Oswin Aichholzer and Haitao Wang), volume 332 of LIPIcs, pages 44:1-44:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Parameterized Complexity in Machine Learning
Computer Science Review, 2025.
Note: to appear
Parameterized Complexity of Caching in Networks
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 11229-11237, 2025, AAAI Press.
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.
Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable
J. Computational Geometry, volume 15, number 2, pages 3-39, 2024.
The Complexity of Optimizing Atomic Congestion
Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada (Michael J. Wooldridge and Jennifer G. Dy and Sriraam Natarajan), pages 20044-20052, 2024, AAAI Press.
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs
J. Graph Algorithms Appl., volume 28, number 2, pages 131-150, 2024.
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
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 53:1-53:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
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.
The Parameterized Complexity Of Extending Stack Layouts
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner and Karsten Klein), volume 320 of LIPIcs, pages 12:1-12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Exact Algorithms for Clustered Planarity with Linear Saturators
35th International Symposium on Algorithms and Computation, ISAAC 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024.
Slim Tree-Cut Width
Algorithmica, volume 86, number 8, pages 2714-2738, 2024.
Revisiting Causal Discovery from a Complexity-Theoretic Perspective
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson), pages 3377-3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding
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 68:1-68:18, 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
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.
Bounding and Computing Obstacle Numbers of Graphs
SIAM J. Discret. Math., volume 38, number 2, pages 1537-1565, 2024.

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.
The Parameterized Complexity of Network Microaggregation
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams and Yiling Chen and Jennifer Neville), pages 6262-6270, 2023, AAAI Press.
Worbel: Aggregating Point Labels into Word Clouds
ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1-19:32, 2023.
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.
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
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 66-81, 2023, Springer.
A Parameterized Theory of PAC Learning
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams and Yiling Chen and Jennifer Neville), pages 6834-6841, 2023, AAAI Press.
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.
The Parameterized Complexity of Coordinated Motion Planning
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 28:1-28:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
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 16:1-16:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
A Structural Complexity Analysis of Synchronous Dynamical Systems
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams and Yiling Chen and Jennifer Neville), pages 6313-6321, 2023, AAAI Press.
Parameterized complexity of envy-free resource allocation in social networks
Artif. Intell., volume 315, pages 103826, 2023.
On the parameterized complexity of clustering problems for incomplete data
Journal of Computer and System Sciences, volume 134, pages 1-19, 2023.
The Computational Complexity of Concise Hypersphere Classification
Proceedings of the 40th International Conference on Machine Learning, ICML 2023, pages 9060-9070, 2023, PMLR.
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-14, 2023.
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands (Inge Li G\ortz and Martin Farach-Colton and Simon J. Puglisi and Grzegorz Herman), volume 274 of LIPIcs, pages 18:1-18:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Group Activity Selection with Few Agent Types
Algorithmica, volume 85, number 5, pages 1111-1155, 2023.
Hedonic diversity games: A complexity picture with more than two colors
Artif. Intell., volume 325, pages 104017, 2023.
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
Dagstuhl Reports, volume 13, number 4, pages 58-97, 2023.
Maximizing Social Welfare in Score-Based Social Distance Games
Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023 (Rineke Verbrugge), volume 379 of EPTCS, pages 272-286, 2023.

2022

Bounding and Computing Obstacle Numbers of Graphs
30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman), volume 244 of LIPIcs, pages 11:1-11:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos and Michael Kaufmann), volume 13453 of Lecture Notes in Computer Science, pages 98-113, 2022, Springer.
On Covering Segments with Unit Intervals
SIAM J. Discret. Math., volume 36, number 2, pages 1200-1230, 2022.
Parameterized Algorithms for Queue Layouts
J. Graph Algorithms Appl., volume 26, number 3, pages 335-352, 2022.
Parameterized Algorithms for Queue Layouts
J. Graph Algorithms Appl., volume 26, number 3, pages 335-352, 2022.
Parameterized Algorithms for Upward Planarity
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 26:1-26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Testing Upward Planarity of Partial 2-Trees
Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers (Patrizio Angelini and Reinhard von Hanxleden), volume 13764 of Lecture Notes in Computer Science, pages 175-187, 2022, Springer.
The Complexity of Envy-Free Graph Cutting
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt), pages 237-243, 2022, ijcai.org.
Finding a Cluster in Incomplete Data
30th Annual European Symposium on Algorithms (ESA 2022) (Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1-47:14, 2022, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
A Unifying Framework for Characterizing and Computing Width Measures
13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk and Emanuela Merelli and David P. Woodruff), volume 229 of LIPIcs, pages 66:1-66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Complexity of k-Means Clustering when Little is Known
International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri and Stefanie Jegelka and Le Song and Csaba Szepesv\'ari and Gang Niu and Sivan Sabato), volume 162 of Proceedings of Machine Learning Research, pages 6960-6987, 2022, PMLR.
Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 5034-5042, 2022, AAAI Press.
Sum-of-Products with Default Values: Algorithms and Complexity Results
Journal of Artificial Intelligence Research, volume 33, pages 535-552, 2022.
Algorithmic Applications of Tree-Cut Width
SIAM J. Discrete Math., volume 36, number 4, pages 2635-2666, 2022.
Slim Tree-Cut Width
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell and Jesper Nederlof), volume 249 of LIPIcs, pages 15:1-15:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria
Discr. Appl. Math., volume 312, pages 1-2, 2022.
Threshold Treewidth and Hypertree Width
Journal of Artificial Intelligence Research, volume 74, pages 1687-1713, 2022.
Weighted Model Counting with Twin-Width
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 15:1-15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
An efficient algorithm for counting Markov equivalent DAGs
Artificial Intelligence, volume 304, pages 103648, 2022.
Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria, volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2021

Towards a Polynomial Kernel for Directed Feedback Vertex Set
Algorithmica, volume 83, number 5, pages 1201-1221, 2021.
Worbel: Aggregating Point Labels into Word Clouds
Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256-267, 2021, ACM.
Worbel: Aggregating Point Labels into Word Clouds
Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021.
The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints
Artificial Intelligence, 2021.
The Parameterized Complexity of Connected Fair Division
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou), pages 139-145, 2021, ijcai.org.
Graphs with two moplexes
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, 2021, Elsevier.
Graphs with at most two moplexes
Journal of Graph Theory, 2021, Wiley Online Library.
Measuring what matters: A hybrid approach to dynamic programming with treewidth
J. Comput. Syst. Sci., volume 121, pages 57-75, 2021.
The Parameterized Complexity of Clustering Incomplete Data
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296-7304, 2021, AAAI Press.
The Parameterized Complexity of Clustering Incomplete Data
2021, Technical report AC-TR-21-007, Algorithms and Complexity Group, TU Wien.
On Strict (Outer-)Confluent Graphs
J. Graph Algorithms Appl., 2021.
The Complexity of Object Association in Multiple Object Tracking
Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388-1396, 2021, AAAI Press.
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Algorithmica, volume 83, number 1, pages 297-336, 2021.
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual (Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan), pages 430-442, 2021.
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
Algorithmica, volume 83, number 2, pages 726-752, 2021.
On Structural Parameterizations of the Edge Disjoint Paths Problem
Algorithmica, volume 83, number 6, pages 1605-1637, 2021.
New Width Parameters for SAT and Sharp-SAT
Artificial Intelligence, volume 295, pages 103460, 2021.
Crossing-Optimal Extension of Simple Drawings
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal and Emanuela Merelli and James Worrell), volume 198 of LIPIcs, pages 72:1-72:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
Dagstuhl Reports, volume 11, number 6, pages 82-123, 2021.

2020

On Covering Segments with Unit Intervals
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Christophe Paul and Markus Bläser), volume 154 of LIPIcs, pages 13:1-13:17, 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.
Parameterized Algorithms for Queue Layouts
Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber and Pavel Valtr), volume 12590 of Lecture Notes in Computer Science, pages 40-54, 2020, Springer.
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere), pages 146-152, 2020, ijcai.org.
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada
Discr. Appl. Math., volume 278, pages 1-2, 2020.
On Existential MSO and Its Relation to ETH
ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1-22:32, 2020.
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.
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 7135-7142, 2020, AAAI Press.
Extending Nearly Complete 1-Planar Drawings in Polynomial Time
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza and Daniel Kr\'al'), volume 170 of LIPIcs, pages 31:1-31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Using decomposition-parameters for QBF: Mind the prefix!
J. Comput. Syst. Sci., volume 110, pages 1-21, 2020.
Extending Partial 1-Planar Drawings
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (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.
The Complexity Landscape of Resource-Constrained Scheduling
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere), pages 1741-1747, 2020, ijcai.org.
An Efficient Algorithm for Counting Markov Equivalent DAGs
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136-10143, 2020, AAAI Press.
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7--12, 2020, New York, pages 3906-3913, 2020, AAAI Press.
On the Parameterized Complexity of Clustering
2020, Technical report AC-TR-20-002, Algorithms and Complexity Group, TU Wien.
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese and Esra Erdem and Michael Thielscher), pages 392-402, 2020.
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
2020, Technical report AC-TR-20-011, Algorithms and Complexity Group, TU Wien.
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.

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.
Parameterized Algorithms for Book Embedding Problems
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault and Csaba D. T\'oth), volume 11904 of Lecture Notes in Computer Science, pages 365-378, 2019, Springer.
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen), pages 42:1-42:15, 2019.
The Parameterized Complexity of Cascading Portfolio Scheduling
Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alch\'e-Buc and Emily B. Fox and Roman Garnett), pages 7666-7676, 2019.
The Parameterized Complexity of Cascading Portfolio Scheduling
2019, Technical report AC-TR-19-009, Algorithms and Complexity Group, TU Wien.
Solving integer quadratic programming via explicit and structural restrictions
The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 (Pascal Van Hentenryck and Zhi-Hua Zhou), pages 1477-1484, 2019.
Counting linear extensions: Parameterizations by treewidth
Algorithmica, 2019.
Integer Programming and Incidence Treedepth
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings (Andrea Lodi and Viswanath Nagarajan), volume 11480 of Lecture Notes in Computer Science, pages 194-204, 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.
On Strict (Outer-)Confluent Graphs
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault and Csaba D. T\'oth), volume 11904 of Lecture Notes in Computer Science, pages 147-161, 2019, Springer.
Shrub-Depth: Capturing Height of Dense Graphs
Logical Methods in Computer Science, 2019.
Parameterized Complexity of Asynchronous Border Minimization
Algorithmica, volume 81, number 1, pages 201-223, 2019.
SAT-Encodings for Treecut Width and Treedepth
Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov and Henning Meyerhenke), pages 117-129, 2019, SIAM.
SAT-Encodings for Treecut Width and Treedepth
2019, Technical report AC-TR-19-001, Algorithms and Complexity Group, TU Wien.
On the Complexity Landscape of Connected f-Factor Problems
Algorithmica, volume 81, number 6, pages 2606-2632, 2019.
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de N\'uria, Spain, June 19-21, 2019, Revised Papers (Ignasi Sau and Dimitrios M. Thilikos), pages 190-204, 2019.
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Algorithms, volume 12, number 12, pages 248, 2019.
A Join-Based Hybrid Parameter for Constraint Satisfaction
Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex and Simon de Givry), volume 11802 of Lecture Notes in Computer Science, pages 195-212, 2019, Springer Verlag.
A Join-Based Hybrid Parameter for Constraint Satisfaction
2019, Technical report AC-TR-19-006, Algorithms and Complexity Group, TU Wien.
Group Activity Selection with Few Agent Types
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (Michael A. Bender and Ola Svensson and Grzegorz Herman), pages 48:1-48:16, 2019.

2018

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Journal of Computer and System Sciences, volume 97, pages 121-146, 2018.
On the complexity of rainbow coloring problems
Discr. Appl. Math., volume 246, pages 38-48, 2018.
Small Resolution Proofs for QBF using Dependency Treewidth
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28--March 3, 2018, Caen, France (Rolf Neidermeier and Brigitte Vall\' ee), volume 96 of LIPIcs, pages 28:1-28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Solving Problems on Graphs of High Rank-Width
Algorithmica, volume 80, number 2, pages 742-771, 2018.
Meta-kernelization using well-structured modulators
Discr. Appl. Math., volume 248, pages 153-167, 2018.
Unary Integer Linear Programming with Structural Restrictions
Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 1284-1290, 2018, ijcai.org.
A Structural Approach to Activity Selection
Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 203-209, 2018, ijcai.org.
Parameterized Algorithms for the Matrix Completion Problem
Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10--15, 2018, pages 1642-1651, 2018, JMLR.org.
Note: ISSN: 1938-7228
Sum-of-Products with Default Values: Algorithms and Complexity Results
Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas and \'Eric Gr\'egoire and Miltiadis Alamaniotis), pages 733-737, 2018, IEEE.
Sum-of-Products with Default Values: Algorithms and Complexity Results
2018, Technical report AC-TR-18-007, Algorithms and Complexity Group, TU Wien.
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28--March 3, 2018, Caen, France (Rolf Neidermeier and Brigitte Vall\' ee), volume 96 of LIPIcs, pages 33:1-33:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
The complexity landscape of decompositional parameters for ILP
Artificial Intelligence, volume 257, pages 61-71, 2018.

2017

Towards a Polynomial Kernel for Directed Feedback Vertex Set
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark (Kim G. Larsen and Hans L. Bodlaender and Jean-Fran\ccois Raskin), volume 83 of LIPIcs, pages 36:1-36:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Going Beyond Primal Treewidth for (M)ILP
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 815-821, 2017.
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra), pages 607-613, 2017, ijcai.org.
On Structural Parameterizations of the Edge Disjoint Paths Problem
28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand (Yoshio Okamoto and Takeshi Tokuyama), volume 92 of LIPIcs, pages 36:1-36:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Backdoor Treewidth for SAT
2017, Technical report AC-TR-17-014, Algorithms and Complexity Group, TU Wien.
Combining Treewidth and Backdoors for CSP
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer and Vall\' ee), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1-36:17, 2017, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
ACM Transactions on Algorithms, volume 13, number AC-TR-17-016, pages 29:1-29:32, 2017.
Backdoor Treewidth for SAT
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers and Toby Walsh), volume 10491 of Lecture Notes in Computer Science, pages 20-37, 2017, Springer Verlag.
New Width Parameters for Model Counting
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers and Toby Walsh), volume 10491 of Lecture Notes in Computer Science, pages 38-52, 2017, Springer Verlag.
New Width Parameters for Model Counting
2017, Technical report AC-TR-17-013, Algorithms and Complexity Group, TU Wien.

2016

Model Checking Existential Logic on Partially Ordered Sets
ACM Transactions on Computational Logic, volume 17, number 2, 2016.
Quantified Conjunctive Queries on Partially Ordered Sets
Theoretical Computer Science, volume 618, pages 72-84, 2016.
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier), volume 58 of LIPIcs, pages 34:1-34:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Using Decomposition-Parameters for QBF: Mind the Prefix!
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans and Michael P. Wellman), pages 964-970, 2016, AAAI Press.
Counting Linear Extensions: Parameterizations by Treewidth
24th European Symposium of Algorithms, ESA 2016, volume 57 of LIPIcs, pages 39:1-39:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
On Existential MSO and its Relation to ETH
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1-42:14, 2016, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
Are There Any Good Digraph Measures?
Journal of Combinatorial Theory, Series B, volume 116, pages 250-286, 2016.
FO Model Checking of Interval Graphs
Logical Methods in Computer Science, volume 11, number 4, 2016.
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees
2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 638-647, 2016, IEEE Computer Society.
The Complexity Landscape of Decompositional Parameters for ILP
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans and Michael P. Wellman), pages 710-716, 2016, AAAI Press.
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1670-1681, 2016.
Backdoors to Tractable Valued CSP
Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher), volume 9892 of Lecture Notes in Computer Science, pages 233-250, 2016, Springer Verlag.
Meta-Kernelization with Structural Parameters
Journal of Computer and System Sciences, volume 82, number 2, pages 333-346, 2016.
On the Complexity Landscape of Connected f-factor Problems
Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier), pages 41:1-41:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

2015

On the Complexity of Rainbow Coloring Problems
Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers (Zsuzsanna Lipták and William F. Smyth), pages 209-220, 2015.
Solving Problems on Graphs of High Rank-Width
Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314-326, 2015, Springer Verlag.
Meta-Kernelization using Well-Structured Modulators
Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt and Iyad A. Kanj), volume 43 of LIPIcs, pages 114-126, 2015.
Improving Vertex Cover as a Graph Parameter
Discrete Mathematics \& Theoretical Computer Science, volume 17, number 2, pages 77-100, 2015.
Algorithmic Applications of Tree-Cut Width
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235 of Lecture Notes in Computer Science, pages 348-360, 2015, Springer Verlag.
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.
Community Structure Inspired Algorithms for SAT and \#SAT
18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule and Sean Weaver), pages 223-237, 2015, Springer Verlag.

2014

Model checking existential logic on partially ordered sets
Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 (Thomas A. Henzinger and Dale Miller), pages 21:1-21:10, 2014, ACM.
Quantified Conjunctive Queries on Partially Ordered Sets
Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan and Pinar Heggernes), volume 8894 of Lecture Notes in Computer Science, pages 122-134, 2014, Springer Verlag.
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics, volume 168, pages 88-107, 2014.
Lower bounds on the complexity of MSO1 model-checking
J. Comput. Syst. Sci., volume 80, number 1, pages 180-194, 2014.

2013

Cops-and-robbers: remarks and problems
Journal of Combinatorial Mathematics and Combinatorial Computing, volume 85, pages 141-159, 2013.
FO Model Checking of Interval Graphs
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, volume 7966 of Lecture Notes in Computer Science, pages 250-262, 2013, Springer.
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Fundam. Inform., volume 123, number 1, pages 59-76, 2013.
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
Eur. J. Comb., volume 34, number 3, pages 680-701, 2013.
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, volume 8288 of Lecture Notes in Computer Science, pages 164-177, 2013, Springer.
Meta-kernelization with Structural Parameters
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee and Jiri Sgall), volume 8087 of Lecture Notes in Computer Science, pages 457-468, 2013, Springer Verlag.

2012

Lower Bounds on the Complexity of MSO1 Model-Checking
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, volume 14 of LIPIcs, pages 326-337, 2012, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
When Trees Grow Low: Shrubs and Fast MSO1
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, volume 7464 of Lecture Notes in Computer Science, pages 419-430, 2012, Springer.

2011

New Results on the Complexity of the Max- and Min-Rep Problems
SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nov\'y Smokovec, Slovakia, January 22-28, 2011. Proceedings, volume 6543 of Lecture Notes in Computer Science, pages 238-247, 2011, Springer.
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers, volume 7112 of Lecture Notes in Computer Science, pages 259-271, 2011, Springer.
Clique-width: When Hard Does Not Mean Impossible
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, volume 9 of LIPIcs, pages 404-415, 2011, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

2010

Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, volume 6460 of Lecture Notes in Computer Science, pages 38-42, 2010, Springer.
Are There Any Good Digraph Width Measures?
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, volume 6478 of Lecture Notes in Computer Science, pages 135-146, 2010, Springer.
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Ml\'yn, Czech Republic, January 23-29, 2010. Proceedings, volume 5901 of Lecture Notes in Computer Science, pages 428-439, 2010, Springer.
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics, volume 158, number 7, pages 851-867, 2010.
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, volume 8 of LIPIcs, pages 73-83, 2010, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

2009

The Parameterized Complexity of Oriented Colouring
Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2009, November 13-15, 2009, Prestige Hotel, Znojmo, Czech Republic, 2009, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
On Digraph Width Measures in Parameterized Algorithmics
Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, volume 5917 of Lecture Notes in Computer Science, pages 185-197, 2009, Springer.
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravic\'i, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pages 266-277, 2009, Springer.

2008

Automata approach to graphs of bounded rank-width
Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan, pages 4-15, 2008, College Publications.