Publists | AC Group | TU Wien

Publications: Alexander Firbas

Tue, 22 Sep 2026 00:00:00 +0000

2026

[1]	Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, eds.), volume 374 of LIPIcs, pages 38:1–38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[2]	Not All Degree Constraints Are Created Equal when Computing Spanning Trees Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[3]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex]
[4]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[5]	Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin Nöllenburg Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex] [pdf]
[6]	Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin Nöllenburg 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]

2025

[1]	The complexity of cluster vertex splitting and company Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann Discrete Applied Mathematics, volume 365, pages 190–207, 2025. [bibtex] [doi]
[2]	Pathways to Tractability for Geometric Thickness Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. [bibtex] [doi]
[3]	Pathways to Tractability for Geometric Thickness (Best Paper Award) Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg 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álovic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. [bibtex] [pdf] [doi]
[4]	Structural Parameterizations of Simultaneous Planarity Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, eds.), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2024

[1]

The Complexity of Cluster Vertex Splitting and Company
Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
Theory and Practice of Computer Science (SOFSEM'24) (Henning Fernau, Serge Gaspers, Ralf Klasing, eds.), volume 14519 of LNCS, pages 226–239, 2024, Springer.
[bibtex] [doi]

Publications: Christian Hatschka

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2022

[1]

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos, Michael Kaufmann, eds.), volume 13453 of Lecture Notes in Computer Science, pages 98–113, 2022, Springer.
[bibtex] [pdf] [doi]

Publications: Enrico Iurlano

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximization Felix Odelga, Enrico Iurlano, Günther R. Raidl Proceedings of the Metaheuristics International Conference – MIC 2026, 2026, Springer. Note: To appear [bibtex] [pdf]
[2]	A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs Martin Wustinger, Enrico Iurlano, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization (Martin S. Krejca, Nelishia Pillay, eds.), volume 16522 of LNCS, pages 133–149, 2026, Springer. [bibtex] [pdf] [doi]
[3]	Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs Herbert Fleischner, Enrico Iurlano, Günther R. Raidl Proceedings of the 2026 Int. Conference on Network Optimization – INOC 2026 (Bernard Fortz, ed.), pages 17–20, 2026, OpenProceedings.org. [bibtex] [pdf] [doi]
[4]	SAT-Based Search for Minwise Independent Families Enrico Iurlano, Günther R. Raidl Parallel Problem Solving from Nature – PPSN XIX (Giovanni Iacca, Giorgia Nadizar, Anil Yaman, Doina Bucur, Antonio Della Cioppa, Ting Hu, Eric Medvet, Sarah L. Thomson, eds.), volume 16985 of LNCS, pages 433–449, 2026, Springer. [bibtex] [pdf] [doi]
[5]	Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problem Alexander Weissenfels, Enrico Iurlano, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2026 (Alexis Espino-Sánchez, Gabriele Salvatore de Blasio, Carmelo Rubén García, José Carlos Rodríguez, Mariam Quesada-Ojeda, Alexis Quesada-Arencibia, eds.), 2026, Springer. Note: To appear [bibtex] [pdf]
[6]	The Graph Burning Problem under Constrained Diffusion Enrico Iurlano, Günther R. Raidl, Marko Djukanović Advances in Optimization and Wildfire, Procedings of the First Optimization and Wildfire Conference (Filipe Alvelos, Isabel Martins, Ana Maria A. C. Rocha, eds.), pages 139–154, 2026, Springer. [bibtex] [pdf] [doi]
[7]	Pairwise Reflection Symmetry in Generalized Latin Rectangles Enrico Iurlano, Günther R. Raidl 2026. Note: arXiv:2606.28315 [cs.DM] [bibtex] [doi]

2025

[1]	Complexity of Positive Influence Domination on Partial Grids Enrico Iurlano, Günther R. Raidl Fundamentals of Computation Theory – 25th International Symposium (Artur Jeż, Jan Otop, eds.), volume 16106 of LNCS, pages 267–280, 2025, Springer. [bibtex] [pdf] [doi]
[2]	Tackling the Alpha-Domination Problem Heuristically Enrico Iurlano, Johannes Varga, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 148–156, 2025, Springer. [bibtex] [pdf] [doi]

2024

[1]	Signed Double Roman Domination on Cubic Graphs Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl Applied Mathematics and Computation, volume 471, pages 128612, 2024, Elsevier. [bibtex] [pdf] [doi]
[2]	A Simulated Annealing Based Approach for the Roman Domination Problem Jakob Greilhuber, Sophia Schober, Enrico Iurlano, Günther R. Raidl Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), volume 2016 of CCIS, pages 28–43, 2024, Springer. [bibtex] [pdf] [doi]

2023

[1]	Growth of the Perfect Sequence Covering Array Number Enrico Iurlano Designs, Codes and Cryptography, volume 91, number 4, pages 1487–1494, 2023, Springer. [bibtex] [pdf] [doi]

2022

[1]	Scrambling Permutations and Related Structures: Asymptotics and Constructions Enrico Iurlano 2022, Master's thesis, TU Wien, Institute of Discrete Mathematics and Geometry. Note: supervised by B. Gittenberger [pdf] [doi]

Publications: Florentina Voboril

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]

Streamliners for Answer Set Programming
Florentina Voboril, Martin Gebser, Stefan Szeider, Alice Tarzariol
Proceedings 42nd International Conference on Logic Programming, ICLP 2026, Lisbon, Portugal, 20-23rd July 2026 (Wolfgang Faber, Laura Giordano, Ricardo Rocha, Vítor Santos Costa, eds.), volume 450 of EPTCS, pages 236–255, 2026.
Note: Preprint: CoRR abs/2604.19251, https://arxiv.org/abs/2604.19251
[bibtex] [pdf] [doi]

2025

[1]	Generating Streamlining Constraints with Large Language Models Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider Journal of Artificial Intelligence Research, volume 84, pages 16:1–16:19, 2025. Note: Abstract reprint in AAAI 2026, page 39900 [bibtex]
[2]	Balancing Latin Rectangles with LLM-Generated Streamliners Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider 31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda, ed.), volume 340 of LIPIcs, pages 36:1–36:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider 2025 IEEE/ACM 1st International Workshop on Neuro-Symbolic Software Engineering (NSE), pages 17-22, 5 2025, IEEE. [bibtex] [pdf] [doi]

2023

[1]	Algorithms for Satisfiability Testing Florentina Voboril 9 2023, SKILL 2023, Gesellschaft für Informatik, Bonn. [bibtex]

2022

[1]	Initial Learning of Textual Programming at School: Evolution of Outreach Activities Martina Landman, Gerald Futschek, Svetlana Unkovic, Florentina Voboril OLYMPIADS IN INFORMATICS, pages 43–53, 1 2022. [bibtex] [pdf] [doi]
[2]	Computing Treewidth with Constraint Programming Florentina Voboril pages 115–126, 9 2022, SKILL 2022, Gesellschaft für Informatik, Bonn. [bibtex] [pdf]

Publications: Günther Raidl

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Annoyance Modeling in Cooperative Personnel Scheduling Christiane Attig, Johannes Varga, Tim Schrills, Tobias Rodemann, Günther Raidl 2026, AHFE Open Access. [bibtex] [doi]
[2]	Dataset of Electric Autonomous Dial-a-Ride Instances with Local Energy Communities and Electricity Tariffs Pedro Almeida, Steffen Limmer, Günther R. Raidl Data in Brief, volume 67, pages 113063, 2026. [bibtex] [doi]
[3]	Revisiting Large Neighborhood Search with On-the-Fly ChargingStation Insertion for the Electric Autonomous Dial-a-Ride Problem M. Bresich, Günther R. Raidl, Steffen Limmer ACM Transactions on Evolutionary Learning and Optimization, volume 6, number 2, pages 1–31, 2026. [bibtex] [pdf] [doi]
[4]	A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximization Felix Odelga, Enrico Iurlano, Günther R. Raidl Proceedings of the Metaheuristics International Conference – MIC 2026, 2026, Springer. Note: To appear [bibtex] [pdf]
[5]	A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs Martin Wustinger, Enrico Iurlano, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization (Martin S. Krejca, Nelishia Pillay, eds.), volume 16522 of LNCS, pages 133–149, 2026, Springer. [bibtex] [pdf] [doi]
[6]	A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problem Joan Salvà Soler, Günther R. Raidl Machine Learning, Optimization, and Data Science – LOD 2025, volume 16467 of LNCS, pages 1–16, 2026, Springer. [bibtex] [doi]
[7]	A Reinforcement Learning Guided Large Neighborhood Search for the Dynamic Electric Autonomous Dial-a-Ride Problem Laurenz Tomandl, Maria Bresich, Günther R. Raidl, Yi, Mei, Steffen Limmer, Tobias Rodemann Machine Learning, Optimization, and Data Science – LOD 2025 (Giuseppe Nicosia, Varunand Giesselbach, Sven Ojha, M. Panos Pardalos, Renato Umeton, La Malfa Emanuele, La Malfa Gabriele, eds.), volume 16467 of LNCS, pages 425-439, 2026, Springer. [bibtex] [doi]
[8]	Determining Destroy Sets in Large Neighborhood Search by Generative Flow Networks M. Bresich, Jingyi Peng, G. R. Raidl, S. Limmer Parallel Problem Solving from Nature – PPSN XIX, volume 16985 of LNCS, pages 265–281, 2026, Springer. [bibtex] [doi]
[9]	Learning to Predict User Replies in Interactive Job Scheduling Johannes Varga, Günther R. Raidl, Tobias Rodemann Machine Learning, Optimization, and Data Science – LOD 2025, volume 16467 of LNCS, pages 271–285, 2026, Springer. [bibtex] [doi]
[10]	Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs Herbert Fleischner, Enrico Iurlano, Günther R. Raidl Proceedings of the 2026 Int. Conference on Network Optimization – INOC 2026 (Bernard Fortz, ed.), pages 17–20, 2026, OpenProceedings.org. [bibtex] [pdf] [doi]
[11]	SAT-Based Search for Minwise Independent Families Enrico Iurlano, Günther R. Raidl Parallel Problem Solving from Nature – PPSN XIX (Giovanni Iacca, Giorgia Nadizar, Anil Yaman, Doina Bucur, Antonio Della Cioppa, Ting Hu, Eric Medvet, Sarah L. Thomson, eds.), volume 16985 of LNCS, pages 433–449, 2026, Springer. [bibtex] [pdf] [doi]
[12]	Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problem Alexander Weissenfels, Enrico Iurlano, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2026 (Alexis Espino-Sánchez, Gabriele Salvatore de Blasio, Carmelo Rubén García, José Carlos Rodríguez, Mariam Quesada-Ojeda, Alexis Quesada-Arencibia, eds.), 2026, Springer. Note: To appear [bibtex] [pdf]
[13]	The Graph Burning Problem under Constrained Diffusion Enrico Iurlano, Günther R. Raidl, Marko Djukanović Advances in Optimization and Wildfire, Procedings of the First Optimization and Wildfire Conference (Filipe Alvelos, Isabel Martins, Ana Maria A. C. Rocha, eds.), pages 139–154, 2026, Springer. [bibtex] [pdf] [doi]
[14]	Pairwise Reflection Symmetry in Generalized Latin Rectangles Enrico Iurlano, Günther R. Raidl 2026. Note: arXiv:2606.28315 [cs.DM] [bibtex] [doi]

2025

[1]	A Hybrid CMSA–Column Generation Approach to Variable-Sized Bin Packing Mehmet Anıl Akbay, Christian Blum, Günther R. Raidl ECAI 2025: 28th European Conference on Artificial Intelligence, volume 413 of Frontiers in Artificial Intelligence and Applications, pages 4790–4797, 2025. [bibtex] [doi]
[2]	A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problem Laurenz Tomandl, Thomas Jatschka, Günther Raidl, Tobias Rodemann Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 251–262, 2025, Springer. [bibtex] [doi]
[3]	Complexity of Positive Influence Domination on Partial Grids Enrico Iurlano, Günther R. Raidl Fundamentals of Computation Theory – 25th International Symposium (Artur Jeż, Jan Otop, eds.), volume 16106 of LNCS, pages 267–280, 2025, Springer. [bibtex] [pdf] [doi]
[4]	Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem William Huang, Yi Mei, Günther R. Raidl, Fangfang Zhang, Laurenz Tomandl, Steffen Limmer, Mengjie Zhang, Tobias Rodemann 2025 IEEE Congress on Evolutionary Computation (CEC), pages 1-8, 2025, IEEE. [bibtex] [pdf] [doi]
[5]	Improvements in Large Neighborhood Search for the Electric Autonomous Dial-a-Ride Problem Maria Bresich, Günther R. Raidl, Steffen Limmer Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 211–220, 2025, Springer. [bibtex] [pdf] [doi]
[6]	Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding Marc Huber, Günther R. Raidl, Christian Blum Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 236-250, 2025, Springer. [bibtex] [pdf] [doi]
[7]	Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime N. Frohner, G. R. Raidl Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 263–271, 2025, Springer. [bibtex] [pdf] [doi]
[8]	Selecting User Queries in Interactive Job Scheduling Johannes Varga, Günther R. Raidl, Tobias Rodemann Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 202–210, 2025, Springer. [bibtex] [pdf]
[9]	Tackling the Alpha-Domination Problem Heuristically Enrico Iurlano, Johannes Varga, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 148–156, 2025, Springer. [bibtex] [pdf] [doi]

2024

[1]	A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem Jaume Reixach, Christian Blum, Marko Djukanović, Günther R. Raidl IEEE Transactions on Evolutionary Computation, 2024. Note: early access [bibtex] [doi]
[2]	Exact methods for the Selective Assessment Routing Problem Joan Salvà Soler, Vera C. Hemmelmayr, Günther R. Raidl Central European Journal of Operations Research, 2024. [bibtex] [doi]
[3]	Scheduling Jobs Using Queries to Interactively Learn Human Availability Times Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann Computers \& Operations Research, volume 167, pages 106648, 2024. [bibtex] [doi]
[4]	Signed Double Roman Domination on Cubic Graphs Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl Applied Mathematics and Computation, volume 471, pages 128612, 2024, Elsevier. [bibtex] [pdf] [doi]
[5]	A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem Jaume Reixach, Christian Blum, Marko Djukanović, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2024 (T. Stützle, M. Wagner, eds.), volume 14632 of LNCS, pages 1–15, 2024, Springer. Note: best paper award winner [bibtex] [pdf] [doi]
[6]	A Simulated Annealing Based Approach for the Roman Domination Problem Jakob Greilhuber, Sophia Schober, Enrico Iurlano, Günther R. Raidl Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), volume 2016 of CCIS, pages 28–43, 2024, Springer. [bibtex] [pdf] [doi]
[7]	Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion Maria Bresich, Günther R. Raidl, Steffen Limmer Proceedings of the Genetic and Evolutionary Computation Conference, pages 142–150, 2024, Association for Computing Machinery. Note: best paper award winner of ECOM track [bibtex] [pdf] [doi]
[8]	Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem Maria Bresich, Johannes Varga, Günther R. Raidl, Steffen Limmer Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), pages 3–20, 2024, Springer. [bibtex] [pdf] [doi]
[9]	Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks Johannes Varga, Emil Karlsson, Günther R. Raidl, Elina Rönnberg, Fredrik Lindsten, Tobias Rodemann Machine Learning, Optimization, and Data Science. LOD 2023. (Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Gabriele La Malfa, Panos M. Pardalos, Umeton Renato, eds.), volume 14505 of lNCS, pages 24–38, 2024, Springer. [bibtex] [pdf] [doi]

2023

[1]	Large Neighborhood Search for Electric Vehicle Fleet Scheduling Steffen Limmer, Johannes Varga, Günther R. Raidl Energies, volume 16, number 12, 2023. [bibtex] [pdf] [doi]
[2]	A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning Thomas Jatschka, Tobias Rodemann, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), volume 13987 of LNCS, pages 50–65, 2023, Springer. [bibtex] [pdf] [doi]
[3]	A Policy-Based Learning Beam Search for Combinatorial Optimization Rupert Ettrich, Marc Huber, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), volume 13987 of LNCS, pages 130–145, 2023, Springer. Note: best paper award winner [bibtex] [pdf] [doi]
[4]	A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem Marc Huber, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2022 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 13789 of LNCS, pages 87-95, 2023, Springer. [bibtex] [pdf] [doi]
[5]	An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles Steffen Limmer, Johannes Varga, Günther R. Raidl EvoApplications 2023: Applications of Evolutionary Computation (J. Correia, S. Smith, R. Qaddoura, eds.), volume 13989 of LNCS, pages 3-18, 2023, Springer. [bibtex] [pdf] [doi]
[6]	Interactive Job Scheduling with Partially Known Personnel Availabilities Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann OLA 2023: Optimization and Learning (B. Dorronsoro, F. Chicano, G. Danoy, E.-G. Talbi, eds.), volume 1824 of Communications in Computer and Information Science, pages 236–247, 2023, Springer. [bibtex] [pdf] [doi]
[7]	Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines Nikolaus Frohner, Günther R. Raidl, Francisco Chicano pages 1941–1949, 2023, ACM Press. [bibtex] [doi]
[8]	Optimizing the positions of battery swapping stations – Pilot Studies and Layout Optimization Algorithm Tobias Rodemann, Hiroaki Kataoka, Thomas Jatschka, Günther R. Raidl, Steffen Limmer, Meguro Hiromu Proceedings to the 6th International Electric Vehicle Technology Conference, pages 20231015, 2023, JSAE. [bibtex] [pdf]

2022

[1]	Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet Johannes Varga, Günther R. Raidl, Steffen Limmer Access, volume 10, 2022. [bibtex] [pdf] [doi]
[2]	Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences Marko Djukanovic, Aleksandar Kartelj, Dragan Matić, Milana Grbić, Christian Blum, Günther R. Raidl Applied Soft Computing, volume 122, pages 108844, 2022. [bibtex] [pdf] [doi]
[3]	A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther Raidl Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Leslie Pérez Cáceres, Sébastien Verel, eds.), volume 13222 of LNCS, pages 127–142, 2022, Springer. Note: best paper award winner [bibtex] [pdf] [doi]
[4]	A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl 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érez Cáceres, Sébastien Vérel, eds.), volume 13222 of Lecture Notes in Computer Science, pages 127–142, 2022, Springer. [bibtex] [pdf] [doi]
[5]	A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications Thomas Jatschka, Tobias Rodemann, Günther R. Raidl Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Farouk Yalaoui, El-Ghazali Talbi, Grégoire Danoy, eds.), volume 1541 of CCIS, pages 3–17, 2022, Springer. [bibtex] [pdf]
[6]	A Learning Large Neighborhood Search for the Staff Rerostering Problem Fabio F. Oberweger, Günther R. Raidl, Elina Rönnberg, Marc Huber Integration of Constraint Programming, Artificial Intelligence, and Operations Research – CPAIOR 2022 (Pierre Schaus, ed.), volume 13292 of LNCS, pages 300–317, 2022, Springer. [bibtex] [pdf] [doi]
[7]	Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems Marc Huber, Günther R. Raidl Machine Learning, Optimization, and Data Science, LOD 2021 (Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Gabriele La Malfa, Giorgio Jansen, Panos M. Pardalos, Giovanni Giuffrida, Renato Umeton, eds.), volume 13164 of LNCS, pages 283–298, 2022, Springer. [bibtex] [pdf] [doi]
[8]	Parallel Beam Search for Combinatorial Optimization Nikolaus Frohner, Jan Gmys, Nourdine, Melab, Günther Raidl, El-ghazali Talbi Fifteenth International Symposium on Combinatorial Search (SoCS 2022), pages 273–275, 2022, AAAI. [bibtex] [pdf] [doi]
[9]	A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters Thomas Jatschka, Matthias Rauscher, Bernhard Kreutzer, Tobias Rodemann, Günther R. Raidl Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (Alexis Quesada-Arencibia, others, eds.), pages 32–33, February 2022. [bibtex] [pdf]
[10]	A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters Thomas Jatschka, Matthias Rauscher, Bernhard Kreutzer, Yusuke Okamoto, Tobias Rodemann, Günther R. Raidl Chapter in Computer Aided Systems Theory – EUROCAST 2022, volume 13789 of LNCS, pages 121-129, 2022, Springer. [bibtex] [pdf]
[11]	A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems Marc Huber, Günther R. Raidl Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 22–23, 2022. [bibtex] [pdf]
[12]	Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime N. Frohner, G. R. Raidl Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 20–21, 2022. [bibtex] [pdf]

2021

[1]	A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Thomas Jatschka, Günther R. Raidl, Tobias Rodemann Algorithms, volume 14, number 8, pages 232, 2021. [bibtex] [pdf] [doi]
[2]	A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Matthias Horn, Günther R. Raidl, Elina Rönnberg Annals of Operations Research, volume 302, pages 477–501, 2021. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf [bibtex] [pdf] [doi]
[3]	A-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem Matthias Horn, Johannes Maschler, Günther R. Raidl, Elina Rönnberg Computers \& Operations Research*, volume 126, number 105125, 2021. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf [bibtex] [doi]
[4]	Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Johannes Maschler, Günther R. Raidl Annals of Operations Research, volume 302, pages 407–531, 2021. [bibtex] [pdf]
[5]	Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers Benjamin Schaden, Thomas Jatschka, Steffen Limmer, Günther R. Raidl Energies, volume 14, number 22, 2021. [bibtex] [pdf] [doi]
[6]	Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings Bojan Nikolic, Aleksandar Kartelj, Marko Djukanovic, Milana Grbić, Christian Blum, Günther Raidl Mathematics, volume 9, number 13, 2021. [bibtex] [pdf] [doi]
[7]	Driver Shift Planning for an Online Store with Short Delivery Times Matthias Horn, Nikolaus Frohner, Günther R. Raidl Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 517–524, 2021. [bibtex] [pdf] [doi]
[8]	Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems Adrian Bracher, Nikolaus Frohner, Günther R. Raidl 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 283–298, 2021, Springer. [bibtex] [pdf] [doi]
[9]	Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems M. Horn, Günther R. Raidl 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 72–88, 2021, Springer. [bibtex] [pdf] [doi]
[10]	Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines Nikolaus Frohner, Matthias Horn, Günther R. Raidl Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 366-370, 2021. [bibtex] [pdf] [doi]
[11]	A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Thomas Jatschka, Günther Raidl, Tobias Rodemann 2021, Technical report AC-TR-21-006, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[12]	Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers Benjamin Schaden, Thomas Jatschka, Steffen Limmer, Günther Raidl 2021, Technical report AC-TR-21-014, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[13]	Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings Marko Djukanovic, Kartelj Aleksandar, Dragan, Matic, Milana Grbic, Christian Blum, Guenther Raidl 2021, Technical report AC-TR-21-008, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[14]	Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings Bojan Nikolic, Kartelj Aleksandar, Marko Djukanovic, Milana Grbic, Christian Blum, Guenther Raidl 2021, Technical report AC-TR-21-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2020

[1]	A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three Benedikt Klocker, Herbert Fleischner, Günther R. Raidl Applied Mathematics and Computation, volume 380, number 125233, 2020. [bibtex] [pdf] [doi]
[2]	A Model for Finding Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther R. Raidl Discrete Applied Mathematics, volume 228, pages 242–264, 2020. [bibtex] [pdf] [doi]
[3]	An A* Search Algorithm for the Constrained Longest Common Subsequence Problem Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum Information Processing Letters, volume 166, number 106041, 2020. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf [bibtex] [pdf] [doi]
[4]	An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem Martin Riedler, Thomas Jatschka, Johannes Maschler, Günther R. Raidl International Transactions in Operational Research, January 2020. [bibtex] [pdf] [doi]
[5]	Anytime Algorithms for the Longest Common Palindromic Subsequence Problem Marko Djukanovic, Günther R. Raidl, Christian Blum Computers \& Operations Research, volume 114, pages 104827, 2020, Elsevier. [bibtex] [doi]
[6]	Finding Longest Common Subsequences: New anytime A$^$ Search Results Marko Djukanovic, Günther R. Raidl, Christian Blum Applied Soft Computing*, volume 95, number 106400, 2020. [bibtex] [pdf]
[7]	Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günter R. Raidl Computers \& Operations Research, volume 125, number 105089, 2020. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf [bibtex] [pdf] [doi]
[8]	A Beam Search Approach to the Traveling Tournament Problem Nikolaus Frohner, Bernhard Neumann, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020 (Luís Paquete, Christine Zarges, eds.), volume 12102 of LNCS, pages 67–82, 2020, Springer. [bibtex] [pdf]
[9]	A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation Marko Djukanovic, Günther R Raidl, Christian Blum Proceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science (Giuseppe Nicosia, Panos Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 154–167, 2020, Springer. [bibtex] [pdf] [doi]
[10]	A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility Nikolaus Frohner, Günther R. Raidl Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2020: Volume I (Patrick De Causmaecker, Ender Özcan, Greet Vanden Berghe, eds.), 2020. [bibtex] [pdf]
[11]	A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem Thomas Kaufmann, Matthias Horn, Günther R. Raidl Proceedings of PPSN XVI: Parallel Problem Solving from Nature (Thomas Bäck, Mike Preuss, André Deutz, Hao Wang, Carola Doerr, Michael Emmerich, Heike Trautmann, eds.), volume 12270 of LNCS, pages 385–398, 2020, Springer. [bibtex] [doi]
[12]	Casual Employee Scheduling with Constraint Programming and Metaheuristics Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 279–287, 2020, Springer. [bibtex] [pdf]
[13]	Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem Matthias Horn, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 344–351, 2020, Springer. [bibtex] [pdf]
[14]	Distributing Battery Swapping Stations for Electric Scooters in an Urban Area Thomas Jatschka, Fabio F. Oberweger, Tobias Rodemann, Günther R. Raidl Optimization and Applications, Proceedings of OPTIMA~2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 150–165, 2020, Springer. [bibtex] [pdf] [doi]
[15]	Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Thomas Jatschka, Tobias Rodemann, Günther R. Raidl Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 738–750, 2020, Springer. [bibtex] [pdf]
[16]	Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers Nikolaus Frohner, Günther R. Raidl Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 445–457, 2020, Springer. [bibtex] [pdf]
[17]	On Solving a Generalized Constrained Longest Common Subsequence Problem Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 55–79, 2020, Springer. [bibtex] [pdf] [doi]
[18]	On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 134–149, 2020, Springer. [bibtex] [doi]
[19]	VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points Thomas Jatschka, Tobias Rodemann, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2019, volume 12013 of LNCS, pages 255–262, 2020, Springer. [bibtex] [pdf]
[20]	A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources Thomas Jatschka, Tobias Rodemann, Günther R. Raidl 09 2020, Presentation, CPAIOR2020. [bibtex] [pdf]
[21]	An A* Search Algorithm for the Constrained Longest Common Subsequence Problem Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum 2020, Technical report AC-TR-20-004, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[22]	Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther R. Raidl 2020, Technical report AC-TR-20-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2019

[1]	Job Sequencing with One Common and Multiple Secondary Resources: An A/Beam Search Based Anytime Algorithm Matthias Horn, Günther Raidl, Christian Blum Artificial Intelligence*, volume 277, number 103173, 2019. [bibtex] [doi]
[2]	A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem Christian Blum, Dhananjay Thiruvady, Andreas T. Ernst, Matthias Horn, Günther R. Raidl Proceedings of AI 2019: Advances in Artificial Intelligence (Jixue Liu, James Bailey, eds.), volume 11919 of LNCS, pages 549–560, 2019, Springer. [bibtex] [doi]
[3]	A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications Thomas Jatschka, Tobias Rodemann, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization (Arnaud Liefooghe, Luís Paquete, eds.), volume 11452 of LNCS, pages 1–16, 2019, Springer. [bibtex] [pdf]
[4]	A Heuristic Approach for Solving the Longest Common Square Subsequence Problem Marko Djukanovic, Günther R. Raidl, Christian Blum Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019), 2019. Note: accepted for presentation [bibtex] [pdf]
[5]	A Heuristic Approach for Solving the Longest Common Square Subsequence Problem Marko Djukanovic, Günther R. Raidl, Christian Blum Proceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 429-437, 2019, Springer. [bibtex] [doi]
[6]	A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems Christian Kloimüllner, Günther R. Raidl Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 184–200, 2019, Springer. [bibtex] [pdf] [doi]
[7]	A SAT Approach for Finding Sup-Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther R. Raidl Learning and Intelligent Optimization. LION~2019, volume 11968 of LNCS, pages 325–341, 2019, Springer. [bibtex] [pdf]
[8]	Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem Marko Djukanovic, Günther R. Raidl, Christian Blum Proceedings of LION~12 – the 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199–214, 2019, Springer. [bibtex] [doi]
[9]	Strategies for Iteratively Refining Layered Graph Models Martin Riedler, Mario Ruthmair, Günther R. Raidl Hybrid Metaheuristics: 11th International Workshop, HM 2019 (M. J. Blesa Aguilera, C. Blum, H. Gambini Santos, P. Pinacho-Davidson, J. Godoy del Campo, eds.), volume 11299 of LNCS, pages 46–62, 2019, Springer. [bibtex] [doi]
[10]	Towards Improving Merging Heuristics for Binary Decision Diagrams Nikolaus Frohner, Günther R. Raidl Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 30–45, 2019, Springer. [bibtex] [pdf]
[11]	A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three Benedikt Klocker, Herbert Fleischner, Günther R. Raidl 2019, Technical report AC-TR-19-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[12]	A Memetic Algorithm for Competitive Facility Location Problems Benjamin Biesinger, Bin Hu, Günther R. Raidl Chapter in Business and Consumer Analytics: New Ideas, pages 637–660, 2019, Springer. [bibtex] [pdf]
[13]	A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Matthias Horn, Günther Raidl, Elina Rönnberg 2019, Technical report AC-TR-19-002, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[14]	Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 78–79, 2019. [bibtex] [pdf]
[15]	Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem Matthias Horn, Günther R. Raidl Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 94–95, 2019. [bibtex] [pdf]
[16]	Finding Longest Common Subsequences: New A* Anytime Results Marko Djukanovic, Günther R. Raidl, Christian Blum 2019, Technical report AC-TR-19-008, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[17]	Metaheuristic Hybrids Günther R. Raidl, Jakob Puchinger, Christian Blum Chapter in Handbook of Metaheuristics (Michel Gendreau, Jean Yves Potvin, eds.), pages 385–417, 2019, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf [bibtex]
[18]	Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources Johannes Maschler, Günther Raidl 2019, Technical report AC-TR-19-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[19]	VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points Thomas Jatschka, Tobias Rodemann, Günther R. Raidl Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 70–71, February 2019. [bibtex] [pdf]

2018

[1]	A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands Benjamin Biesinger, Bin Hu, Günther R. Raidl Transportation Science, volume 52, number 3, pages 673–690, 2018. Note: previous technical report available at https://www.ac.tuwien.ac.at/files/tr/ac-tr-16-001.pdf [bibtex]
[2]	Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition Martin Riedler, Günther Raidl Computers \& Operations Research, volume 96, pages 30–54, 2018. [bibtex] [pdf] [doi]
[3]	An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows Matthias Horn, Günther R. Raidl, Elina Rönnberg PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 235–256, 2018. [bibtex] [pdf]
[4]	Finding Smooth Graphs with Small Independence Numbers Benedikt Klocker, Herbert Fleischner, Günther R. Raidl MOD~2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 527-539, 2018, Springer. [bibtex] [pdf]
[5]	GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection Airam Expósito, Günther R. Raidl, Julio Brito, José A. Moreno-Pérez Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 299-306, 2018, Springer. [bibtex] [pdf]
[6]	Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem Johannes Maschler, Günther R. Raidl PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 375–397, 2018. [bibtex] [pdf]
[7]	Semi-Automated Location Planning for Urban Bike-Sharing Systems Markus Straub, Christian Rudloff, Anita Graser, Christian Kloimüllner, Günther R. Raidl, Markus Pajones, Felix Beyer Proceedings of the 7th Transport Research Arena (TRA~2018), pages 1–10, 2018. [bibtex] [pdf]
[8]	Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Benedikt Klocker, Günther R Raidl Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 355-363, 2018, Springer. [bibtex] [pdf]
[9]	A Model for Finding Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther Raidl 2018, Technical report AC-TR-18-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[10]	A SAT Approach for Finding Sup-Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther Raidl 2018, Technical report AC-TR-18-010, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[11]	A*-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem Matthias Horn, Johannes Maschler, Günther Raidl, Elina Rönnberg 2018, Technical report AC-TR-18-011, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[12]	Anytime Algorithms for the Longest Common Palindromic Subsequence Problem Marko Djukanovic, Günther Raidl, Christian Blum 2018, Technical report AC-TR-18-012, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[13]	Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments Johannes Maschler, Günther Raidl 2018, Technical report AC-TR-18-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2017

[1]	Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition Christian Kloimüllner, Günther R. Raidl Networks, volume 69, number 3, pages 270–289, 2017. Note: previous technical report available at https://www.ac.tuwien.ac.at/files/pub/kloimuellner-17a.pdf [bibtex] [pdf] [doi]
[2]	Large Neighborhood Search for the Most Strings with Few Bad Columns Problem Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl Soft Computing, volume 21, number 17, pages 4901–4915, 2017. [bibtex] [pdf]
[3]	Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm Petrica C. Pop, Cosmin Sabo, Benjamin Biesinger, Bin Hu, Günther R. Raidl Carpathian Journal of Mathematics, volume 33, number 3, pages 365–371, 2017. [bibtex] [pdf]
[4]	A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem Johannes Maschler, Günther R. Raidl Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015 (Karl Franz Dörner, Ivana Ljubić, Georg Pflug, Gernot Tragler, eds.), pages 393–399, 2017, Springer. [bibtex] [pdf]
[5]	A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem Frederico Dusberger, Günther R. Raidl Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015 (Karl Franz Dörner, Ivana Ljubić, Georg Pflug, Gernot Tragler, eds.), pages 385–391, 2017, Springer. [bibtex] [pdf]
[6]	Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control Bong-Min Kim, Christian Kloimüllner, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization. EvoCOP~2017 (Bin Hu, Manuel López-Ibáñez, eds.), volume 10197 of LNCS, pages 91–107, 2017, Springer. [bibtex] [pdf]
[7]	GRASP and VNS for a Periodic VRP with Time Windows to Deal with Milk Collection Airam Expósito, Günther R. Raidl, Julio Brito, José A. Moreno-Pérez Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory – EUROCAST 2017 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 2017. [bibtex]
[8]	Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem Christian Kloimüllner, Günther R. Raidl Conference Proceedings of Learning and Intelligent Optimization Conference (LION~11) (Roberto Battiti, Dmitri Kvasov, Yaroslav Sergeyev, eds.), volume 10556 of LNCS, pages 1–16, 2017, Springer. [bibtex] [pdf] [doi]
[9]	Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment Matthias Horn, Günther R. Raidl, Christian Blum MOD~2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 506–518, 2017, Springer. [bibtex] [pdf]
[10]	Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments Johannes Maschler, Martin Riedler, Günther R. Raidl Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 106–107, 2017. [bibtex] [pdf]
[11]	Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Benedikt Klocker, Günther R Raidl Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 104–105, 2017. [bibtex] [pdf]
[12]	An Iterative Time-Bucket Refinement Algorithm for a High Resolution Resource-Constrained Project Scheduling Problem Martin Riedler, Thomas Jatschka, Johannes Maschler, Günther Raidl 2017, Technical report AC-TR-17-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2016

[1]	A Memetic Algorithm for the Virtual Network Mapping Problem Johannes Inführ, Günther Raidl Journal of Heuristics, volume 22, number 4, pages 475–505, 2016. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/infuehr-14.pdf [bibtex] [doi]
[2]	A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design Christian Schauer, Günther R. Raidl Electronic Notes in Discrete Mathematics, volume 52, pages 189–196, 2016. Note: INOC 2015 – 7th International Network Optimization Conference [bibtex] [pdf] [doi]
[3]	An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands Benjamin Biesinger, Bin Hu, Günther R. Raidl Electronic Notes in Discrete Mathematics, volume 52, pages 245–252, 2016. Note: INOC 2015 – 7th International Network Optimization Conference [bibtex] [pdf]
[4]	Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem Christian Blum, Günther R. Raidl Optimization Letters, volume 10, number 1, pages 189–205, 2016. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/blum-15.pdf [bibtex]
[5]	Models and Algorithms for Competitive Facility Location Problems with Different Customer Behavior Benjamin Biesinger, Bin Hu, Günther Raidl Annals of Mathematics and Artificial Intelligence, volume 76, number 1, pages 93–119, 2016, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/biesinger-14b.pdf [bibtex]
[6]	New Developments in Metaheuristics and their Applications – Selected Extended Contributions from the 10th Metaheuristics International Conference (MIC~2013) Hoong Chuin Lau, Günther R. Raidl, Pascal Van Hentenryck Journal of Heuristics, volume 22, number 4, pages 359–363, 2016. [bibtex] [pdf] [doi]
[7]	Districting and Routing for Security Control Michael Prischink, Christian Kloimüllner, Benjamin Biesinger, Günther R. Raidl Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 87–103, 2016, Springer. [bibtex] [pdf]
[8]	Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers Benedikt Klocker, Herbert Fleischner, Günther R. Raidl Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 1–16, 2016, Springer. [bibtex] [pdf]
[9]	Particle Therapy Patient Scheduling: First Heuristic Approaches Johannes Maschler, Martin Riedler, Markus Stock, Günther R. Raidl PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling, pages 223–244, 2016. [bibtex] [pdf]
[10]	Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics Günther R. Raidl, Thomas Jatschka, Martin Riedler, Johannes Maschler Proceedings of Matheuristics 2016: 6th International Workshop on Model-Based Metaheuristics (T. Stützle, V. Maniezzo, eds.), pages 104–107, 2016. [bibtex] [pdf]
[11]	A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands Benjamin Biesinger, Bin Hu, Günther Raidl 2016, Technical report AC-TR-16-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[12]	Hybrid Metaheuristics – Powerful Tools for Optimization Christian Blum, Günther R. Raidl 2016, Springer. [bibtex] [pdf]
[13]	Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition Martin Riedler, Günther Raidl 2016, Technical report AC-TR-16-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2015

[1]	A Hybrid Genetic Algorithm with Solution Archive for the Discrete (r\|p)-Centroid Problem Benjamin Biesinger, Bin Hu, Günther Raidl Journal of Heuristics, volume 21, number 3, pages 391-431, 2015, Springer US. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/biesinger-14.pdf [bibtex] [doi]
[2]	Decomposition Based Hybrid Metaheuristics Günther R. Raidl European Journal of Operational Research, volume 244, pages 66-76, 2015. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-15.pdf [bibtex]
[3]	Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, Günther R. Raidl Central European Journal of Operations Research, volume 23, number 1, pages 89-113, 2015. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/hiermann-13.pdf [bibtex]
[4]	Numerical Optimisation of Electro-Hybrid Powertrains Thorsten Krenek, Christopher Bacher, Thomas Lauer, Günther R. Raidl MTZ Worldwide, volume 03, pages 46–52, March 2015, Springer. [bibtex]
[5]	Numerische Optimierung elektrifizierter Antriebsstränge Thorsten Krenek, Christopher Bacher, Thomas Lauer, Günther R. Raidl Motortechnische Zeitschrift (MTZ), volume 03, pages 66–74, March 2015, Springer. [bibtex]
[6]	PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems Marian Rainer-Harbach, Petrina Papazek, Günther R. Raidl, Bin Hu, Christian Kloimüllner Journal of Global Optimization, volume 63, number 3, pages 597-629, 2015, Springer. [bibtex] [pdf] [doi]
[7]	A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems Christian Kloimüllner, Petrina Papazek, Günther R. Raidl Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 125–126, 2015. [bibtex] [pdf]
[8]	A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problem Matthias Lanzinger, Benjamin Biesinger, Bin Hu, Günther R. Raidl Proceedings of the 11th Metaheuristics International Conference, pages 89/1–89/9, 2015. [bibtex] [pdf]
[9]	A New Solution Representation for the Firefighter Problem Bin Hu, Andreas Windbichler, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization – EvoCOP~2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 25–35, 2015, Springer. [bibtex] [pdf]
[10]	A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles Christopher Bacher, Günther R. Raidl, Thorsten Krenek Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, others, eds.), volume 9520 of LNCS, pages 425–432, 2015, Springer International Publishing Switzerland. [bibtex] [pdf]
[11]	A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size Frederico Dusberger, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 384–392, 2015, Springer. [bibtex] [pdf]
[12]	A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size Frederico Dusberger, Günther R. Raidl Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 109–110, 2015. [bibtex] [pdf]
[13]	A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands Benjamin Biesinger, Bin Hu, Günther R. Raidl Evolutionary Computation in Combinatorial Optimization – EvoCOP~2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 48–60, 2015, Springer. [bibtex] [pdf]
[14]	CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem Christian Schauer David Markvica, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 401–408, 2015, Springer. [bibtex]
[15]	Heuristic Approaches for the Probabilistic Traveling Salesman Problem Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 9520 of LNCS, pages 342–349, 2015, Springer International Publishing Switzerland. [bibtex] [pdf] [doi]
[16]	Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem Alan Tus, Andrea Rendl, Günther R. Raidl Conference Proceedings of Learning and Intelligent Optimization Conference (LION~9), volume 8994 of LNCS, pages 186-201, 2015, Springer. [bibtex]
[17]	On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl Proceedings of the 2015 International Symposium on Innovations in Intelligent Systems and Applications (INISTA) (David Camacho, others, eds.), pages 1-8, 2015, IEEE Xplore. [bibtex] [pdf]
[18]	On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem Christian Schauer, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 279-285, 2015, Springer. [bibtex]
[19]	Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search Frederico Dusberger, Günther R. Raidl The 3rd International Conference on Variable Neighborhood Search (VNS'14), volume 47 of Electronic Notes in Discrete Mathematics, pages 133–140, 2015, Elsevier. [bibtex] [pdf]
[20]	A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles Christopher Bacher, Günther R. Raidl Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia, others, eds.), pages 119–120, 2015. [bibtex] [pdf]
[21]	Heuristic Approaches for the Probabilistic Traveling Salesman Problem Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia, others, eds.), pages 99 – 100, 2015. [bibtex] [pdf]

2014

[1]	A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure Igor Grujicic, Günther R. Raidl, Andreas Schöbel, Gerhard Besau Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA~2014 (S. Lakusic, others, eds.), pages 691–696, 2014, Department of Transportation, University of Zagreb. [bibtex] [pdf]
[2]	A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem Frederico Dusberger, Günther R. Raidl Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 85–99, 2014, Springer. [bibtex] [pdf]
[3]	An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior Benjamin Biesinger, Bin Hu, Günther R. Raidl Conference Proceedings of Learning and Intelligent Optimization Conference (LION~8), volume 8426 of LNCS, pages 203–217, 2014, Springer. [bibtex] [pdf]
[4]	Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid Petrina Papazek, Christian Kloimüllner, Bin Hu, Günther R. Raidl Parallel Problem Solving from Nature – PPSN XIII (Thomas Bartz-Beielstein, Jürgen Branke, Bogdan Filipic, Jim Smith, eds.), volume 8672 of LNCS, pages 792–801, 2014, Springer. [bibtex] [pdf] [doi]
[5]	Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther~R.~Raidl Evolutionary Computation in Combinatorial Optimization – EvoCOP~2014 (Christian Blum, Gabriela Ochoa, eds.), volume 8600 of LNCS, pages 73–84, 2014, Springer. [bibtex] [pdf] [doi]
[6]	Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search T. Baumhauer, B. Hu Günther R. Raidl Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 149–156, 2014, Elsevier. [bibtex] [pdf]
[7]	Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem Günther R. Raidl, Thomas Baumhauer, Bin Hu Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 183–197, 2014, Springer. [bibtex] [pdf]
[8]	Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure Igor Grujicic, Günther R. Raidl, Andreas Schöbel Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 141–148, 2014, Elsevier. [bibtex] [pdf]
[9]	Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles Christopher Bacher, Thorsten Krenek, Günther R. Raidl Chapter in Applications of Evolutionary Computation (Anna I. Esparcia-Alcázar, Antonio M. Mora, eds.), pages 553-564, 2014, Springer. [bibtex] [pdf] [doi]

2013

[1]	Stabilizing Branch-and-Price for Constrained Tree Problems Markus Leitner, Mario Ruthmair, Günther R. Raidl Networks, volume 61, number 2, pages 150–170, 2013. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/leitner-11e.pdf [bibtex]
[2]	A Memetic Algorithm for the Partition Graph Coloring Problem Petrica C. Pop, Bin Hu, Günther R. Raidl Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 167–169, 2013. [bibtex] [pdf]
[3]	A Memetic Algorithm for the Virtual Network Mapping Problem Johannes Inführ, Günther R. Raidl Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 28/1–28/10, 2013. [bibtex] [pdf]
[4]	A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem Petrica C. Pop, Bin Hu, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 219–226, 2013, Springer. [bibtex] [pdf]
[5]	A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem Bin Hu, Werner Ölz, Günther R. Raidl Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 200–202, 2013. [bibtex] [pdf]
[6]	A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems Petrina Papazek, Günther~R.~Raidl, Marian Rainer-Harbach, Bin Hu Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 223–225, 2013. [bibtex] [pdf]
[7]	A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems Petrina Papazek, Günther R. Raidl, Marian Rainer-Harbach, Bin Hu Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 372–379, 2013, Springer. [bibtex] [pdf]
[8]	An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure Andreas Schöbel, Günther R. Raidl, Igor Grujicic, Gerhard Besau, Gottfried Schuster Proceedings of the 5th International Seminar on Railway Operations Modelling and Analysis – RailCopenhagen~2013, pages 765–774, 2013, IAROR. [bibtex] [pdf]
[9]	Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP~2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 121-132, 2013, Springer. [bibtex] [pdf]
[10]	Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations Günther R. Raidl, Bin Hu, Marian Rainer-Harbach, Petrina Papazek Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 130–143, 2013, Springer. [bibtex] [pdf]
[11]	Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem Peter Jahrmann, Günther R. Raidl Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 30/1–30/10, 2013. [bibtex] [pdf]
[12]	Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 380–387, 2013, Springer. [bibtex] [pdf]
[13]	GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem Johannes Inführ, Günther R. Raidl Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 159–173, 2013, Springer. [bibtex] [pdf]
[14]	Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 226–228, 2013. [bibtex] [pdf]
[15]	Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent Johannes Inführ, Günther R. Raidl Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP~2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 250-261, 2013, Springer. [bibtex] [pdf]
[16]	Using Optimized Virtual Network Embedding for Network Dimensioning Johannes Inführ, David Stezenbach, Matthias Hartmann, Kurt Tutschku, Günther R. Raidl Proceedings of Networked Systems 2013, pages 118–125, 2013, IEEE. [bibtex] [pdf]
[17]	A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables Michael Pimmer, Günther R. Raidl Chapter in Advances in Metaheuristics (Luca Di~Gaspero, Andrea Schaerf, Thomas Stützle, eds.), volume 53 of Operations Research/Computer Science Interfaces Series, pages 143–158, 2013, Springer. [bibtex] [pdf]
[18]	PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl 2013, Technical report TR 186–1–13–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]

2012

[1]	Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Clemens Nothegger, Alfred Mayer, Andreas Chwatal, Günther R. Raidl Annals of Operations Research, volume 194, number 1, pages 325–339, 2012. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/nothegger-12.pdf [bibtex]
[2]	A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair, Günther R. Raidl Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 351–358, 2012, Springer. [bibtex] [pdf]
[3]	A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Martin Berlakovich, Mario Ruthmair, Günther R. Raidl Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 256–263, 2012, Springer. [bibtex] [pdf]
[4]	A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem Martin Schwengerer, Sandro Pirkwieser, Günther R. Raidl Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2012 (J.-K. Hao, M. Middendorf, eds.), volume 7245 of LNCS, pages 13–24, 2012, Springer, Heidelberg. [bibtex] [pdf]
[5]	An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem Bin Hu, Günther R. Raidl Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 287–294, 2012, Springer. [bibtex] [pdf]
[6]	An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem Bin Hu, Günther R. Raidl Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO), pages 393–400, 2012, ACM Press. [bibtex] [pdf]
[7]	Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles Thorsten Krenek, Mario Ruthmair, Günther R. Raidl, Michael Planer Applications of Evolutionary Computation – EvoApplications~2012 (C. Di~Chio, others, eds.), volume 7248 of LNCS, pages 376–385, 2012, Springer, Heidelberg. [bibtex] [pdf]
[8]	Automatic Generation of 2-AntWars Players with Genetic Programming Johannes Inführ, Günther R. Raidl Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 248–255, 2012, Springer. [bibtex] [pdf]
[9]	Hybrid Heuristics for Multimodal Homecare Scheduling Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) (Nicolas Beldiceanu, Narendra Jussien, Éric Pinson, eds.), pages 339–355, 2012, Springer. [bibtex] [pdf]
[10]	Improved Packing and Routing of Vehicles with Compartments Sandro Pirkwieser, Günther~R. Raidl, Jens Gottlieb Computer Aided Systems Theory – EUROCAST 2011: 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6–11, 2011, Revised Selected Papers, Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 392–399, 2012, Springer. [bibtex] [pdf]
[11]	On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem Mario Ruthmair, Günther R. Raidl Proceedings of the 2nd International Symposium on Combinatorial Optimization (A.R. Mahjoub, others, eds.), volume 7422 of LNCS, pages 225–236, 2012, Springer. [bibtex] [pdf]
[12]	Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 295–302, 2012, Springer. [bibtex] [pdf]
[13]	Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design Christian Schauer, Günther R. Raidl Parallel Problem Solving from Nature–PPSN XII (C. A. Coello Coello, others, eds.), volume 7492 of LNCS, pages 458–467, 2012, Springer. [bibtex] [pdf]

2011

[1]	Branch-and-Cut-and-Price for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl Journal of Mathematical Modelling and Algorithms, volume 10, number 3, pages 245–267, 2011, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/leitner-10b.pdf [bibtex] [doi]
[2]	Hybrid Metaheuristics in Combinatorial Optimization: A Survey Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli Applied Soft Computing, volume 11, pages 4135–4151, 2011. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/blum-11.pdf [bibtex]
[3]	Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques Andreas Chwatal, Günther R. Raidl Advances in Operations Research, volume 2011, number 143732, pages 1–38, 2011. [bibtex] [pdf] [doi]
[4]	A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application Andreas M. Chwatal, Corina Thöni, Karin Oberlechner, Günther R. Raidl Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS) (M. Ganzha, others, eds.), pages 239–246, 2011, IEEE Digital Library. [bibtex] [pdf]
[5]	A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems Mario Ruthmair, Günther R. Raidl Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV) (O. Günlük, G.J. Woeginger, eds.), volume 6655 of LNCS, pages 376–388, 2011, Springer, Heidelberg. [bibtex] [pdf]
[6]	A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Martin Berlakovich, Mario Ruthmair, Günther R. Raidl Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 247–249, 2011. [bibtex] [pdf]
[7]	A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables Michael Pimmer, Günther R. Raidl Proceedings of the 9th Metaheuristics International Conference (Luca Di~Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 349–358, 2011. [bibtex] [pdf]
[8]	An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem Bin Hu, Günther R. Raidl Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 256–259, 2011. [bibtex] [pdf]
[9]	Automatic Generation of 2-AntWars Players with Genetic Programming Johannes Inführ, Günther R. Raidl Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 244–246, 2011. [bibtex] [pdf]
[10]	Improved Packing and Routing of Vehicles with Compartments Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 302–304, 2011. [bibtex] [pdf]
[11]	Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints Johannes Inführ, Günther R. Raidl Network Optimization: 5th International Conference, INOC 2011 (J. Pahl, T. Reiners, S. Voß, eds.), volume 6701 of LNCS, pages 105–117, 2011, Springer. [bibtex] [pdf]
[12]	Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem Markus Leitner, Mario Ruthmair, Günther R. Raidl Network Optimization: 5th International Conference, INOC 2011 (J. Pahl, T. Reiners, S. Voß, eds.), volume 6701 of LNCS, pages 124–138, June 2011, Springer. [bibtex] [pdf]
[13]	Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem Markus Leitner, Mario Ruthmair, Günther R. Raidl Proceedings of the VII ALIO/EURO – Workshop on Applied Combinatorial Optimization, pages 250–253, May 2011. [bibtex] [pdf]
[14]	Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb Proceedings of the 9th Metaheuristics International Conference (Luca Di~Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 679–681, 2011. [bibtex] [pdf]
[15]	Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair, Andreas Hubmer, Günther R. Raidl Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 285–287, 2011. [bibtex] [pdf]
[16]	Variable Neighborhood Search for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (A. Quesada-Arencibia, others, eds.), pages 261–263, 2011. [bibtex] [pdf]
[17]	On Stabilized Branch-and-Price for Constrained Tree Problems Markus Leitner, Mario Ruthmair, Günther R. Raidl 2011, Technical report TR 186–1–11–01, Vienna University of Technology. [bibtex] [pdf]

2010

[1]	The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search Bin Hu, Markus Leitner, Günther R. Raidl Networks, volume 55, number 3, pages 256–275, 2010. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/hu-07.pdf [bibtex]
[2]	The Multidimensional Knapsack Problem: Structure and Algorithms Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy INFORMS Journal on Computing, volume 22, number 2, pages 250–265, 2010. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-07.pdf [bibtex]
[3]	A Brief Survey on Hybrid Metaheuristics Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli Proceedings of BIOMA 2010 – 4th International Conference on Bioinspired Optimization Methods and their Applications (B. Filipic, J. Silc, eds.), pages 3–16, 2010. [bibtex] [pdf]
[4]	A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents Christian Schauer, Matthias Prandtstetter, Günther R. Raidl Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa, others, eds.), volume 6373 of LNCS, pages 103–117, 2010, Springer. [bibtex] [pdf]
[5]	A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem Anna Pagacz, Bin Hu, Günther R. Raidl 2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design (F. Xhafa, others, eds.), pages 356–361, 2010, Conference Publishing Services. [bibtex] [pdf]
[6]	Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive Günther R. Raidl, Bin Hu Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling, Peter Merz, eds.), volume 6022 of LNCS, pages 239–251, 2010, Springer. Note: best paper award winner [bibtex] [pdf]
[7]	Fitting Multi-Planet Transit Models to Photometric Time-Data Series by Evolution Strategies Andreas Chwatal, Günther R. Raidl GECCO~2010: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (Jürgen Branke, Martin Pelikan, eds.), pages 377–384, 2010, ACM Press. [bibtex] [pdf]
[8]	Matheuristics for the Periodic Vehicle Routing Problem with Time Windows Sandro Pirkwieser, Günther R. Raidl Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics, pages 83–95, 2010. [bibtex] [pdf]
[9]	Multilevel Variable Neighborhood Search for Periodic Routing Problems Sandro Pirkwieser, Günther R. Raidl Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling, Peter Merz, eds.), volume 6022 of LNCS, pages 226–238, 2010, Springer. [bibtex] [pdf]
[10]	Similarity Searching in Sequences of Complex Events Hannes Obweger, Martin Suntinger, Josef Schiefer, Günther R. Raidl Proceedings of the Fourth International Conference on Research Challenges in Information Science – RCIS 2010, pages 631–639, 2010, IEEE CPS. [bibtex] [pdf]
[11]	Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization Andreas M. Chwatal, Günther R. Raidl Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods, GEM~2010 (H. Arabnia, A. M. G. Solo, eds.), 2010, CSREA Press. [bibtex] [pdf]
[12]	Strong Lower Bounds for a Survivable Network Design Problem Markus Leitner, Günther R. Raidl ISCO 2010 – International Symposium on Combinatorial Optimization (M. Haouari, A. R. Mahjoub, eds.), volume 36 of Electronic Notes in Discrete Mathematics, pages 295–302, 2010, Elsevier. [bibtex] [pdf]
[13]	Trend-Based Similarity Search in Time-Series Data Martin Suntinger, Hannes Obweger, Josef Schiefer, Philip Limbeck, Günther R. Raidl Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications – DBKDA 2010, pages 97–106, 2010, IEEE CPS. [bibtex] [pdf]
[14]	Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair, Günther R. Raidl Parallel Problem Solving from Nature – PPSN XI, Part II (R. Schaefer, others, eds.), volume 6239 of LNCS, pages 391–400, 2010, Springer. [bibtex] [pdf]
[15]	Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problem Sandro Pirkwieser, Günther R. Raidl Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa, others, eds.), volume 6373 of LNCS, pages 174–189, 2010, Springer. [bibtex] [pdf]
[16]	Branch-and-Cut-and-Price for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl 2010, Technical report TR 186–1–10–01, Vienna University of Technology. [bibtex] [pdf]
[17]	Metaheuristic Hybrids Günther R. Raidl, Jakob Puchinger, Christian Blum Chapter in Handbook of Metaheuristics (Michel Gendreau, Jean Yves Potvin, eds.), volume 146 of International Series in Operations Research \& Management Science, pages 469–496, 2010, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-08a.pdf [bibtex]

2009

[1]	Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner Journal of Mathematical Modelling and Algorithms, volume 8, number 3, pages 293–334, 2009. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/chwatal-08a.pdf [bibtex]
[2]	A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows Sandro Pirkwieser, Günther~R. Raidl Proceedings of the International Network Optimization Conference 2009 (Maria Grazia Scutellà, others, eds.), 2009. [bibtex] [pdf]
[3]	A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse Matthias Prandtstetter, Günther R. Raidl, Thomas Misar Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2009 (Carlos Cotta, Peter Cowling, eds.), volume 5482 of LNCS, pages 25–36, 2009, Springer. [bibtex] [pdf]
[4]	A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair, Günther R. Raidl Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 244–246, 2009. [bibtex] [pdf]
[5]	A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem Mario Ruthmair, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 713–720, 2009, Springer. [bibtex] [pdf]
[6]	A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl Proceedings of the 8th Metaheuristics International Conference (Stefan Voss, Marco Caserta, eds.), 2009. [bibtex] [pdf]
[7]	A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem Bin Hu, Günther R. Raidl 9th International Conference on Hybrid Intelligent Systems – HIS~2009, pages 63–68, 2009. Note: best paper award winner [bibtex] [pdf]
[8]	Accelerating Column Generation for a Survivable Network Design Problem Markus Leitner, Günther R. Raidl, Ulrich Pferschy Proceedings of the International Network Optimization Conference 2009 (M. G. Scutellá, others, eds.), April 2009. [bibtex] [pdf]
[9]	Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques Sandro Pirkwieser, Günther~R. Raidl Proceedings of the 8th Metaheuristic International Conference (Stefan Voss, Marco Caserta, eds.), 2009. [bibtex] [pdf]
[10]	Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem Martin~Gruber, Günther~R.~Raidl Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 228–231, 2009. [bibtex] [pdf]
[11]	Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouses Ulrike Ritzinger, Matthias Prandtstetter, Günther R. Raidl Logistik Management: Systeme, Methoden, Integration (Stefan Voss, others, eds.), pages 279–298, 2009, Physica Verlag. [bibtex] [pdf]
[12]	Cooperative Hybrids for Combinatorial Optimization Günther R. Raidl Nature Inspired Cooperative Strategies for Optimization (NICSO 2008) (Natalio Krasnogor, others, eds.), volume 236 of Studies in Computational Intelligence, pages X, 2009, Springer. Note: abstract [bibtex]
[13]	Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances Martin Gruber, Günther R. Raidl GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl, others, eds.), pages 263–270, 2009, ACM Press. [bibtex] [pdf]
[14]	Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms Andreas M. Chwatal, Günther R. Raidl Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (A. Quesada-Arencibia, others, eds.), pages 222–225, 2009. [bibtex] [pdf]
[15]	Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms Andreas M. Chwatal, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 649–656, 2009, Springer. [bibtex] [pdf]
[16]	Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents Matthias Prandtstetter, Günther R. Raidl GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (Günther R. Raidl, others, eds.), pages 349–356, 2009, ACM Press. [bibtex] [pdf]
[17]	Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows Sandro Pirkwieser, Günther R. Raidl Hybrid Metaheuristics 2009 (M. J. Blesa, others, eds.), volume 5818 of LNCS, pages 175–189, 2009, Springer. [bibtex] [pdf]
[18]	Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation Andreas M. Chwatal, Nina Musil, Günther R. Raidl International Network Optimization Conference 2009 (Maria Grazia Scutellà, others, eds.), April 2009. [bibtex] [pdf]
[19]	Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search Jakob Walla, Mario Ruthmair, Günther R. Raidl Hybrid Metaheuristics 2009 (M. J. Blesa, others, eds.), volume 5818 of LNCS, pages 84–99, 2009, Springer. [bibtex] [pdf]
[20]	Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics Martin~Gruber, Günther~R.~Raidl Computer Aided Systems Theory – EUROCAST 2009 (R.~Moreno-Díaz, others, eds.), volume 5717 of LNCS, pages 665–672, 2009, Springer. [bibtex] [pdf]
[21]	(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo, T. Stützle, S. Voss, eds.), volume 10 of Annals of Information Systems, pages 209–230, 2009, Springer. [bibtex] [pdf]
[22]	Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl 2009, Technical report TR 186–1–09–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]
[23]	Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location Markus Leitner, Günther R. Raidl Chapter in Post-Conference Book of the Eight Metaheuristics International Conference – MIC 2009, 2009. Note: to appear [bibtex]
[24]	Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms Andreas M. Chwatal, Günther Wuchterl, Günther R. Raidl 02 2009, Poster presentation, First CoRoT International Symposium. [bibtex] [pdf]
[25]	Hybrid Metaheuristics Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli Chapter in CPAIOR 10th Anniversary (M. Milano, P. Van Hentenryck, eds.), 2009, Springer. Note: to appear [bibtex]
[26]	MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics Jakob Puchinger, Günther R. Raidl, Sandro Pirkwieser Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo, T. Stützle, S. Voss, eds.), volume 10 of Annals of Information Systems, pages 71–102, 2009, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-09.pdf [bibtex]

2008

[1]	An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem Matthias Prandtstetter, Günther R. Raidl European Journal of Operational Research, volume 191, number 3, pages 1004–1022, 2008. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/prandtstetter-05a.pdf [bibtex] [pdf]
[2]	Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search Jakob Puchinger, Günther R. Raidl Journal of Heuristics, volume 14, number 5, pages 457–472, 2008. [bibtex] [pdf]
[3]	Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem Bin Hu, Markus Leitner, Günther R. Raidl Journal of Heuristics, volume 14, number 5, pages 473–499, 2008. [bibtex] [pdf]
[4]	(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics (P. Hansen, others, eds.), 2008. [bibtex] [pdf]
[5]	A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Günther R. Raidl, Martin Gruber Numerical Analysis and Applied Mathematics (T. E. Simos, others, eds.), volume 1048 of AIP Conference Proceedings, pages 446–449, 2008, American Institute of Physics. [bibtex] [pdf]
[6]	A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows Sandro Pirkwieser, Günther~R. Raidl Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing (Caroline Prodhon, others, eds.), 2008. [bibtex] [pdf]
[7]	Combining Forces to Reconstruct Strip Shredded Text Documents Matthias Prandtstetter, Günther R. Raidl Hybrid Metaheuristics 2008 (M. J. Blesa, others, eds.), volume 5296 of LNCS, pages 175–189, 2008, Springer. [bibtex] [pdf]
[8]	Effective Neighborhood Structures for the Generalized Traveling Salesman Problem Bin Hu, Günther R. Raidl Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2008 (Jano van Hemert, Carlos Cotta, eds.), volume 4972 of LNCS, pages 36–47, 2008, Springer. Note: best paper award winner [bibtex] [pdf]
[9]	Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees Sandro Pirkwieser, Ruben Ruiz-Torrubiano, Günther R. Raidl BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations (J. Küng, K. Schneider, R. Wagner, eds.), volume 26 of Schriftenreihe Informatik, pages 115–124, 2008, Trauner Verlag. [bibtex] [pdf]
[10]	Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms Sandro Pirkwieser, Günther R. Raidl GECCO '08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (Maarten Keijzer, others, eds.), pages 323–330, 2008, ACM. [bibtex] [pdf]
[11]	Heuristic Cut Separation in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 261–264, 2008, IEEE Computer Society. [bibtex] [pdf]
[12]	Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks Markus Leitner, Günther R. Raidl Hybrid Metaheuristics 2008 (M. J. Blesa, others, eds.), volume 5296 of LNCS, pages 158–174, 2008, Springer. [bibtex] [pdf]
[13]	Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization Alfred Mayer, Clemens Nothegger, Andreas M. Chwatal, Günther R. Raidl Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (Edmund Burke, others, eds.), 2008. [bibtex] [pdf]
[14]	Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem Bin Hu, Günther R. Raidl Proceedings of the 8th International Conference on Hybrid Intelligent Systems – HIS~2008 (Fatos Xhafa, others, eds.), pages 73–77, 2008. [bibtex] [pdf]
[15]	Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem Markus Leitner, Günther R. Raidl Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 233–236, 2008, IEEE Computer Society. [bibtex] [pdf] [doi]
[16]	(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl 2008, Technical report TR 186–1–08–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]
[17]	A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta, J. van~Hemert, eds.), volume 153 of Studies in Computational Intelligence, pages 69–85, 2008, Springer. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf [bibtex] [pdf]
[18]	Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization Günther R. Raidl, Jakob Puchinger Chapter in Hybrid Metaheuristics – An Emergent Approach for Combinatorial Optimization (C. Blum, M. J. Blesa Augilera, A. Roli, M. Sampels, eds.), volume 114 of Studies in Computational Intelligence, pages 31–62, 2008, Springer. [bibtex] [pdf]
[19]	Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner September 2008, Technical report TR 186–1–08–01, Vienna University of Technology, Institute of Computer Graphics and Algorithms. [bibtex] [pdf]

2007

[1]	CyMATE: A New Tool for Methylation Analysis of Plant Genomic DNA after Bisulfite Sequencing Jennifer Hetzl, Andrea M. Foerster, Günther R. Raidl, Ortrun Mittelsten Scheid The Plant Journal, volume 51, number 3, pages 526–536, 2007. [bibtex]
[2]	Models and Algorithms for Three-Stage Two-Dimensional Bin Packing Jakob Puchinger, Günther R. Raidl European Journal of Operational Research, volume 183, number 3, pages 1304–1327, 2007. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/puchinger-04b.pdf [bibtex]
[3]	A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks Daniel Wanger, Ulrich Pferschy, Petra Mutzel, Günther R. Raidl, P.Bachhiesl Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz, ed.), pages 103/1–6, 2007. [bibtex] [pdf]
[4]	A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks Daniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl Operations Research Proceedings 2006 (Karl-Heinz Waldmann, Ulrike M. Stocker, eds.), 2007, Springer. [bibtex] [pdf]
[5]	Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger Evolutionary Computation in Combinatorial Optimization – EvoCOP~2007 (Carlos Cotta, Jano van~Hemert, eds.), volume 4446 of LNCS, pages 176–187, 2007, Springer. [bibtex] [pdf]
[6]	Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem Andreas Chwatal, Günther R. Raidl, Olivia Dietzel Proceedings of MIC2007, the 7th Metaheuristics International Conference, pages 105/1–3, 2007. [bibtex] [pdf]
[7]	Determining Orbital Elements of Extrasolar Planets by Evolution Strategies Andreas M. Chwatal, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2007 (R. Moreno-Díaz, others, eds.), volume 4739 of LNCS, pages 870–877, 2007, Springer. [bibtex] [pdf]
[8]	Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem Günther R. Raidl, Andreas Chwatal Numerical Analysis and Applied Mathematics (T. E. Simos, ed.), volume 936 of AIP Conference Proceedings, pages 444–447, 2007, American Institute of Physics. [bibtex] [pdf]
[9]	Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem Markus Leitner, Bin Hu, Günther R. Raidl Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz, ed.), pages 69/1–6, 2007. [bibtex] [pdf]
[10]	A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger 2007, Technical report TR 186–1–07–03, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]
[11]	The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search Bin Hu, Markus Leitner, Günther R. Raidl 2007, Technical report TR 186–1–07–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]
[12]	The Multidimensional Knapsack Problem: Structure and Algorithms Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy 2007, Technical report TR 186–1–07–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]

2006

[1]	Biased Mutation Operators for Subgraph-Selection Problems Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom IEEE Transactions on Evolutionary Computation, volume 10, number 2, pages 145–156, 2006, IEEE Press. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-05.pdf [bibtex]
[2]	Cleaning of Raw Peptide MS/MS Spectra: Improved Protein Identification Following Deconvolution of Multiply Charged Peaks, Isotope Clusters, and Removal of Background Noise Nedim Mujezinovic, G"\unther R. Raidl, James R. A. Hutchins, Jan-Michael Peters, Karl Mechtler, Frank Eisenhaber Proteomics, volume 6, number 19, pages 5117–5131, 2006, Wiley. [bibtex] [pdf]
[3]	A Unified View on Hybrid Metaheuristics Günther R. Raidl Proceedings of the Hybrid Metaheuristics Workshop (Francisco Almeida, others, eds.), volume 4030 of LNCS, pages 1–12, 2006, Springer. [bibtex] [pdf]
[4]	Evolutionary Approach to Constrained Minimum Spanning Tree Problem Anna Pagacz, Günther R. Raidl, Stanislaw Zawiślak Evolutionary Computation and Global Optimization 2006 (Jaroslawa Arabasa, ed.), pages 331–341, 2006. [bibtex] [pdf]
[5]	Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO Martin Gruber, Jano van Hemert, Günther R. Raidl Proceedings of the Genetic and Evolutionary Computation Conference – GECCO 2006 (Maarten Keijzer, others, eds.), pages 1187–1194, 2006, ACM. [bibtex] [pdf]
[6]	The Core Concept for the Multidimensional Knapsack Problem Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy Evolutionary Computation in Combinatorial Optimization – EvoCOP~2006 (Jens Gottlieb, Günther R. Raidl, eds.), volume 3906 of LNCS, pages 195–208, 2006, Springer. [bibtex] [pdf]
[7]	Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering Bin Hu, Günther R. Raidl Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics (Carlos Cotta, Antonio J. Fernandez, Jose E. Gallardo, eds.), 2006. [bibtex] [pdf]
[8]	Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search Jakob Puchinger, Günther R. Raidl 2006, Technical report TR 186–1–06–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]
[9]	Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem Bin Hu, Markus Leitner, Günther R. Raidl 2006, Technical report TR 186–1–06–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]

2005

[1]	Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem Günther R. Raidl, Jens Gottlieb Evolutionary Computation Journal, volume 13, number 4, pages 441–475, 2005. [bibtex] [pdf]
[2]	A New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl Proceedings of the 2nd International Network Optimization Conference 2005 (L Gouveia, C. Mourão, eds.), pages 178–185, 2005. [bibtex] [pdf]
[3]	A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem Matthias Prandtstetter, Günther R. Raidl Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. [bibtex] [pdf]
[4]	Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification Jakob Puchinger, Günther R. Raidl Proceedings of the First International Work-Conference on the Interplay Between Natural and Artificial Computation, Part II, volume 3562 of LNCS, pages 41–53, 2005, Springer. [bibtex] [pdf]
[5]	Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search Bin Hu, Markus Leitner, Günther R. Raidl Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. [bibtex] [pdf]
[6]	Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem Jakob Puchinger, Günther R. Raidl, Martin Gruber Proceedings of MIC2005, the 6th Metaheuristics International Conference, pages 775–780, 2005. [bibtex] [pdf]
[7]	Relaxation Guided Variable Neighborhood Search Jakob Puchinger, Günther R. Raidl Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. [bibtex] [pdf]
[8]	Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber, Günther R. Raidl Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005. [bibtex] [pdf]
[9]	An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem Matthias Prandtstetter, Günther R. Raidl 2005, Technical report TR 186–1–05–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]

2004

[1]	An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing Jakob Puchinger, Günther R. Raidl Parallel Problem Solving from Nature – PPSN~VIII (X. Yao et. al, ed.), volume 3242 of LNCS, pages 642–651, 2004, Springer. [bibtex] [pdf]
[2]	An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem Gabriele Koller, Günther R. Raidl Parallel Problem Solving from Nature – PPSN~VIII (Xin Yao, others, eds.), volume 3242 of LNCS, pages 302–311, 2004, Springer-Verlag. [bibtex] [pdf]
[3]	An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem G. R. Raidl, H. Feltl Proceedings of the 2003 ACM Symposium on Applied Computing (H. M. Haddadd, others, eds.), pages 990–995, 2004, ACM Press. [bibtex] [pdf]
[4]	Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem G.W.~Klau, I.~Ljubić, A.~Moser, P.~Mutzel, P.~Neuner, U.~Pferschy, G.~Raidl, R.~Weiskircher Genetic and Evolutionary Computation – GECCO 2004 (K.~ Deb, others, eds.), volume 3102 of LNCS, pages 1304–1315, 2004, Springer. [bibtex] [pdf]
[5]	Solving a Real-World Glass Cutting Problem Jakob Puchinger, Günther R. Raidl, Gabriele Koller Evolutionary Computation in Combinatorial Optimization – EvoCOP~2004 (Jens Gottlieb, Günther R. Raidl, eds.), volume 3004 of LNCS, pages 162–173, 2004, Springer. [bibtex] [pdf]
[6]	Biased Mutation Operators for Subgraph-Selection Problems Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom 2004, Technical report TR 186–1–04–06, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]
[7]	Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem Günther R. Raidl, Jens Gottlieb 2004, Technical report TR 186–1–04–05, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]
[8]	Models and Algorithms for Three-Stage Two-Dimensional Bin Packing Jakob Puchinger, Günther R. Raidl 2004, Technical report TR 186–1–04–04, Institute of Computer Graphics and Algorithms, Vienna University of Technology. [bibtex] [pdf]

2003

[1]	A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs I. Ljubić, G. R. Raidl Journal of Heuristics, volume 9, pages 401–427, 2003, Kluwer Academic Publishers. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/ljubic-02.pdf [bibtex]
[2]	Edge-Sets: An Effective Evolutionary Coding of Spanning Trees G. R. Raidl, B. A. Julstrom IEEE Transactions on Evolutionary Computation, volume 7, number 3, pages 225–239, 2003. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-01.pdf [bibtex]
[3]	A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem B. A. Julstrom, G. R. Raidl in 2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Design of Representations (A. Barry, F. Rothlauf, D. Thierens, others, eds.), pages 2–7, 2003. Note: best paper award winner of the workshop [bibtex] [pdf]
[4]	Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem G. R. Raidl, B. A. Julstrom Proceedings of the 2003 ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 747–752, 2003, ACM Press. [bibtex] [pdf]
[5]	Hybrid Evolutionary Algorithms for Combinatorial Optimization G. R. Raidl March 2003, Habilitation thesis at the Vienna University of Technology. [bibtex] [pdf]

2002

[1]	Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem G. R. Raidl, I. Ljubić Information Processing Letters, volume 82, number 1, pages 39–45, 2002. Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-02.pdf [bibtex]
[2]	A Memetic Algorithm for Vertex-Biconnectivity Augmentation S. Kersting, G. R. Raidl, I. Ljubić Applications of Evolutionary Computing: EvoWorkshops 2002 (S. Cagnoni, others, eds.), volume 2279 of LNCS, pages 102–111, 2002, Springer. [bibtex] [pdf]
[3]	Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges B. A. Julstrom, G. R. Raidl Proceedings of the 2002 ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 547–552, 2002, ACM Press. [bibtex] [pdf]
[4]	Letting Ants Labeling Point Features M. Schreyer, G. R. Raidl Proceedings of the 2002 IEEE Congress on Evolutionary Computation (D. Fogel, others, eds.), pages 1564–1569, 2002, IEEE Press. [bibtex] [pdf]
[5]	On Weight-Biased Mutation for Graph Problems Günther R. Raidl, Gabriele Kodydek, Bryant Julstrom Parallel Problem Solving from Nature – PPSN VII (J. J. Merelo Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacañas, H.-P. Schwefel, eds.), volume 2439 of LNCS, pages 204–213, 2002. [bibtex] [pdf]

2001

[1]	An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem I. Ljubić, G. R. Raidl Applications of Evolutionary Computing: EvoWorkshops 2001 (E. J.-W. Boers, others, eds.), volume 2037 of LNCS, pages 20–29, 2001, Springer. [bibtex] [pdf]
[2]	Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search J. Gottlieb, B. A. Julstrom, F. Rothlauf, G. R. Raidl Proceedings of the 2001 Genetic and Evolutionary Computation Conference (L. Spector, others, eds.), pages 343–350, 2001, Morgan Kaufmann. [bibtex] [pdf]
[3]	Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems B. A. Julstrom, G. R. Raidl Proceedings of the 16th ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 321–326, 2001, ACM Press. [bibtex] [pdf]

2000

[1]	A Hybrid GA for the Edge-Biconnectivity Augmentation Problem I. Ljubić, G. R. Raidl, J. Kratica Parallel Problem Solving from Nature – PPSN VI (K. Deb, others, eds.), volume 1917 of LNCS, pages 641–650, 2000, Springer. [bibtex] [pdf]
[2]	A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem G. R. Raidl, C. Drexel Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, pages 309–316, 2000. [bibtex] [pdf]
[3]	A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Günther R. Raidl, Bryant A. Julstrom Proceedings of the 2000 ACM Symposium on Applied Computing (J. Carroll, others, eds.), pages 440–445, 2000, ACM Press. [bibtex] [pdf]
[4]	An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem G. R. Raidl Proceedings of the 2000 IEEE Congress on Evolutionary Computation (C. Fonseca, others, eds.), pages 104–111, 2000, IEEE Press. [bibtex] [pdf]
[5]	The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search Jens Gottlieb, Günther R. Raidl Proceedings of the 2000 Genetic and Evolutionary Computation Conference (D. Whitley, others, eds.), pages 283–290, 2000, Morgan Kaufmann. [bibtex] [pdf]

1999

[1]	The Multiple Container Packing Problem: A Genetic Algorithm Approach with Weighted Codings Günther R. Raidl ACM SIGAPP Applied Computing Review, volume 7, number 2, pages 22–31, 1999, ACM Press. [bibtex] [pdf]
[2]	A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem Günther R. Raidl Proceedings of the 1999 ACM Symposium on Applied Computing (Janice Carroll, others, eds.), pages 291–296, 1999, ACM Press. [bibtex] [pdf]
[3]	An Evolutionary Approach to Point-Feature Label Placement Günther R. Raidl Proceedings of the 1999 Genetic and Evolutionary Computation Conference (Wolfgang Banzhaf, others, eds.), pages 807, 1999, Morgan Kaufmann. Note: short paper [bibtex] [pdf]
[4]	Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem Jens Gottlieb, Günther R. Raidl Proceedings of Artificial Evolution: Fourth European Conference (Cyril Fonlupt, others, eds.), volume 1829 of LNCS, pages 38–52, 1999, Springer. [bibtex] [pdf]
[5]	On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms Günther R. Raidl, Jens Gottlieb Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference (Scott Brave, Annie S. Wu, eds.), pages 204–211, 1999. [bibtex] [pdf]
[6]	Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem Günther R. Raidl Proceedings of the 1999 IEEE Congress on Evolutionary Computation (Peter J. Angeline, others, eds.), pages 596–603, 1999, IEEE Press. [bibtex] [pdf]

1998

[1]	A Genetic Algorithm for Labeling Point Features Günther R. Raidl Proceedings of the International Conference on Imaging Science, Systems and Technology (H.~R.~Arabnia, P.-C.~Chung, J.~B.~Farison, G.~R.~Raidl, M. Sarfraz, Z. Zhang, eds.), pages 189–196, 1998, CSREA Press. [bibtex] [pdf]
[2]	A Hybrid GP Approach for Numerically Robust Symbolic Regression Günther R. Raidl Proceedings of the 3rd Annual Genetic Programming Conference (J. Koza, others, eds.), pages 323–328, 1998, Morgan Kaufmann. [bibtex] [pdf]
[3]	An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem Günther R. Raidl Proceedings of the 5th IEEE International Conference on Evolutionary Computation (D. Fogel, others, eds.), pages 207–211, 1998, IEEE Press. [bibtex] [pdf]
[4]	Approximation with Evolutionary Optimized Tensor Product Bernstein Polynomials Günther R. Raidl, Christian Wurm Proceedings of the International Conference on Artificial Intelligence in Industry: From Theory to Practice (J. Sarnovsky, others, eds.), pages 247–256, 1998. [bibtex] [pdf]
[5]	Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks Günther R. Raidl, Gabriele Kodydek Proceedings of the International ICSC/IFAC Symposium on Neural Computation, pages 885–890, 1998. [bibtex] [pdf]
[6]	Genetic Algorithms for the Multiple Container Packing Problem Günther R. Raidl, Gabriele Kodydek Proceedings of the 5th International Conference on Parallel Problem Solving from Nature – PPSN V (Agoston E. Eiben, others, eds.), volume 1498 of LNCS, pages 875–884, 1998, Springer. [bibtex] [pdf]
[7]	Transforming an Analytically Defined Color Space to Match Psychophysically Gained Color Distances Ingeborg Tastl, Günther R. Raidl Proceedings of the SPIE's 10th International Symposium on Electronic Imaging: Science and Technology (G. B. Beretta, R. Eschbach, eds.), pages 98–106, 1998. [bibtex] [pdf]

1994

[1]	Progressives, adaptives Ray-Tracing von Bildern mit hoher zeitlicher Kohärenz Günther Raidl 1994, PhD thesis, Vienna University of Technology.

Unknown

[1]	Parallel Beam Search for Combinatorial Optimization Nikolaus Frohner, Jan Gmys, Nourdine, Melab, Günther Raidl, El-ghazali Talbi Workshop Proceedings of the International Conference on Parallel Processing (ICPP 2022), pages 1–8, ACM Press. [bibtex] [doi]

Publications: Hai Xia

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Design Hai Xia, Carla P. Gomes, Bart Selman, Stefan Szeider Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear; preprint: CoRR abs/2603.08322, https://arxiv.org/abs/2603.08322 [bibtex]
[2]	LLM-Guided Graph Generation for Structure-Based Local Improvement Methods Hai Xia, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear; preprint: CoRR abs/2608.13333, https://arxiv.org/abs/2608.13333 [bibtex]
[3]	Smart Cubing for Graph Search: A Comparative Study Markus Kirchweger, Hai Xia, Tomás Peitl, Stefan Szeider 32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 33:1–33:19, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: Preprint: CoRR abs/2501.17201, https://arxiv.org/abs/2501.17201 [bibtex] [pdf] [doi]
[4]	Synthesizing Feature Extractors: An Agentic Approach for Algorithm Selection Hai Xia, Carlos Ansótegui, Stefan Szeider Proceedings of the International Conference on Automated Machine Learning, AutoML 2026, September 28 – October 1, 2026, Ljubljana, Slovenia, 2026. Note: To appear; preprint: CoRR abs/2608.17170, https://arxiv.org/abs/2608.17170 [bibtex]

2025

[1]

An Introduction to and Survey of Biological Network Visualization
Henry Ehlers, Nicolas Brich, Jiacheng Yu, Michael Krone, Martin Nöllenburg, Hiroaki Natsukawa, Xiaoru Yuan, Hsiang-Yun Wu
Computers \& Graphics, volume 126, pages 104115, 2025.
[bibtex] [doi]

[2]

Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach
Carlos Ansótegui, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia
Computational Science - ICCS 2025 - 25th International Conference, Singapore, July 7-9, 2025, Proceedings, Part II (Michael H. Lees, Wentong Cai, Siew Ann Cheong, Yi Su, David Abramson, Jack J. Dongarra, Peter M. A. Sloot, eds.), volume 15904 of Lecture Notes in Computer Science, pages 35–49, 2025, Springer.
[bibtex] [pdf] [doi]

2024

[1]	SAT-Based Tree Decomposition with Iterative Cascading Policy Selection Hai Xia, Stefan Szeider AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 8191–8199, 2024, AAAI Press. [bibtex] [pdf] [doi]
[2]	The Power of Collaboration: Learning Large Bayesian Networks at Scale Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia 2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), pages 371-378, 2024. [bibtex] [doi]

2019

[1]	Short Plane Supports for Spatial Hypergraphs Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019. [bibtex] [doi]

2018

[1]

Short Plane Supports for Spatial Hypergraphs
Thom Casterman, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan
Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 53–66, 2018, Springer International Publishing.
[bibtex] [pdf] [doi]

Publications: Jan Niclas Dreier

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Efficient reversal of transductions of sparse graph classes Jan Dreier, Jakub Gajarský, Michał Pilipczuk 2026. [bibtex] [pdf]

2025

[1]	Approximate Evaluation of Quantitative Second Order Queries Jan Dreier, Robert Ganian, Thekla Hamm 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025, pages 664–677, 2025, IEEE. [bibtex] [pdf] [doi]
[2]	Merge-Width and First-Order Model Checking Jan Dreier, Szymon Toruńczyk Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC), pages 1944–1955, 2025, Association for Computing Machinery. [bibtex] [pdf] [doi]

2024

[1]	SAT backdoors: Depth beats size Jan Dreier, Sebastian Ordyniak, Stefan Szeider Journal of Computer and System Sciences, volume 142, pages 103520, 2024. [bibtex] [doi]
[2]	First-Order Model Checking on Monadically Stable Graph Classes Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michał Pilipczuk, Szymon Toruńczyk 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pages 21-30, 2024. [bibtex] [pdf] [doi]
[3]	Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes Jan Dreier, Nikolas Mählmann, Szymon Toruńczyk Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), pages 1550–1560, 2024. [bibtex] [pdf]

2023

[1]	CSP beyond tractable constraint languages Jan Dreier, Sebastian Ordyniak, Stefan Szeider Constraints, volume 28, number 3, pages 450–471, 2023. [bibtex] [pdf] [doi]
[2]	A logic-based algorithmic meta-theorem for mim-width Benjamin Bergougnoux, Jan Dreier, Lars Jaffke Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3282-3304, 2023. [bibtex] [pdf] [doi]
[3]	Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond Jan Dreier, Daniel Mock, Peter Rossmanith 31st Annual European Symposium on Algorithms (ESA 2023) (Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman, eds.), volume 274 of Leibniz International Proceedings in Informatics (LIPIcs), pages 43:1–43:17, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[4]	First-Order Model Checking on Structurally Sparse Graph Classes Jan Dreier, Nikolas Mählmann, Sebastian Siebertz Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 567-580, 2023, Association for Computing Machinery. [bibtex] [pdf] [doi]
[5]	Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany (Kousha Etessami, Uriel Feige, Gabriele Puppis, eds.), volume 261 of LIPIcs, pages 125:1–125:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[6]	Pseudorandom Finite Models Jan Dreier, Jamie Tucker-Foltz LICS, pages 1–13, 2023. [bibtex] [pdf] [doi]

2022

[1]	Twin-width and generalized coloring numbers Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond Discrete Mathematics, volume 345, number 3, pages 112746, 2022. [bibtex] [pdf] [doi]
[2]	Combinatorial and Algorithmic Aspects of Monadic Stability Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny 33rd International Symposium on Algorithms and Computation (ISAAC 2022) (Sang Won Bae, Heejin Park, eds.), volume 248 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1–11:17, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	CSP Beyond Tractable Constraint Languages Jan Dreier, Sebastian Ordyniak, Stefan Szeider 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (Christine Solnon, ed.), volume 235 of LIPIcs, pages 20:1–20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[4]	Model Checking on Interpretations of Classes of Bounded Local Cliquewidth Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Toruńczyk Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery. [bibtex] [pdf]
[5]	SAT Backdoors: Depth Beats Size Jan Dreier, Sebastian Ordyniak, Stefan Szeider 30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 46:1–46:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[6]	Treelike Decompositions for Transductions of Sparse Graphs Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michał Pilipczuk, Szymon Toruńczyk Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery. [bibtex] [pdf]

2021

[1]	Approximate Evaluation of First-Order Counting Queries Jan Dreier, Peter Rossmanith Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2021, SIAM. [bibtex] [pdf] [doi]
[2]	Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes Jan Dreier 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-13, 2021. Note: distinguished paper [bibtex] [doi]

2020

[1]	Complexity of independency and cliquy trees Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen Discr. Appl. Math., volume 272, pages 2–15, 2020. [bibtex] [pdf] [doi]
[2]	First-Order Model-Checking in Random Graphs and Complex Networks Jan Dreier, Philipp Kuinke, Peter Rossmanith 28th Annual European Symposium on Algorithms (ESA 2020), volume 173 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[3]	Hard Problems on Random Graphs Jan Dreier, Henri Lotze, Peter Rossmanith 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), volume 168 of Leibniz International Proceedings in Informatics (LIPIcs), pages 40:1–40:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[4]	Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size Jan Dreier, Philipp Kuinke, Peter Rossmanith Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), volume 176 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2019

[1]	Hardness of FO Model-Checking on Random Graphs Jan Dreier, Peter Rossmanith 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), volume 148 of LIPIcs, pages 11:1–11:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [doi]
[2]	Motif Counting in Preferential Attachment Graphs Jan Dreier, Peter Rossmanith 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), volume 150 of LIPIcs, pages 13:1–13:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	The Complexity of Packing Edge-Disjoint Paths Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), volume 148 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1–10:16, 2019, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. [bibtex] [pdf] [doi]

2018

[1]

Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applications
Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith
44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2018), volume 10706 of Lecture Notes in Computer Science, pages 125–136, 2018, Springer.
[bibtex] [pdf] [doi]

Publications: Jiehua Chen

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Multidimensional Manhattan preferences Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger Discrete Applied Mathematics, volume 395, pages 172–202, 2026. [bibtex] [doi]

2025

[1]	An Introduction to and Survey of Biological Network Visualization Henry Ehlers, Nicolas Brich, Jiacheng Yu, Michael Krone, Martin Nöllenburg, Hiroaki Natsukawa, Xiaoru Yuan, Hsiang-Yun Wu Computers \& Graphics, volume 126, pages 104115, 2025. [bibtex] [doi]

2022

[1]	Multidimensional Manhattan Preferences Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger Theoretical Informatics (LATIN'22) (Armando Castañeda, Francisco Rodríguez-Henríquez, eds.), volume 13568 of LNCS, pages 273–289, 2022, Springer. [bibtex] [doi]

2020

[1]	Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP Jiehua Chen, Robert Ganian, Thekla Hamm Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 146–152, 2020, ijcai.org. [bibtex] [pdf]

2017

[1]	How many variables are needed to express an existential positive query? Simone Bova, Hubie Chen Proceeding of the Twentieth International Conference on Database Theory (ICDT), March 21-24, 2017, Venice, Italy, 2017. Note: Best Paper Award [bibtex]

2015

[1]	The complexity of equivalence, entailment, and minimization in existential positive logic Simone Bova, Hubie Chen Journal of Computer and System Sciences, volume 81, number AC-TR-15-007, pages 443–457, 2015. [bibtex] [pdf]

2014

[1]	The Complexity of Width Minimization for Existential Positive Queries Simone Bova, Hubie Chen Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014., pages 235–244, 2014. [bibtex]

2013

[1]	Generic expression hardness results for primitive positive formula comparison Simone Bova, Hubie Chen, Matthew Valeriote Inf. Comput., volume 222, pages 108–120, 2013. [bibtex]

2012

[1]	On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas Simone Bova, Hubie Chen, Matthew Valeriote Theory Comput. Syst., volume 50, number 2, pages 329–353, 2012. [bibtex]
[2]	The Complexity of Planning Revisited - A Parameterized Analysis Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. [bibtex]

2011

[1]	Generic Expression Hardness Results for Primitive Positive Formula Comparison Simone Bova, Hubie Chen, Matthew Valeriote Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, pages 344–355, 2011. [bibtex]

Publications: Johannes Varga

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Annoyance Modeling in Cooperative Personnel Scheduling Christiane Attig, Johannes Varga, Tim Schrills, Tobias Rodemann, Günther Raidl 2026, AHFE Open Access. [bibtex] [doi]
[2]	Learning to Predict User Replies in Interactive Job Scheduling Johannes Varga, Günther R. Raidl, Tobias Rodemann Machine Learning, Optimization, and Data Science – LOD 2025, volume 16467 of LNCS, pages 271–285, 2026, Springer. [bibtex] [doi]

2025

[1]	Selecting User Queries in Interactive Job Scheduling Johannes Varga, Günther R. Raidl, Tobias Rodemann Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 202–210, 2025, Springer. [bibtex] [pdf]
[2]	Tackling the Alpha-Domination Problem Heuristically Enrico Iurlano, Johannes Varga, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 148–156, 2025, Springer. [bibtex] [pdf] [doi]

2024

[1]	Scheduling Jobs Using Queries to Interactively Learn Human Availability Times Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann Computers \& Operations Research, volume 167, pages 106648, 2024. [bibtex] [doi]
[2]	Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem Maria Bresich, Johannes Varga, Günther R. Raidl, Steffen Limmer Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), pages 3–20, 2024, Springer. [bibtex] [pdf] [doi]
[3]	Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks Johannes Varga, Emil Karlsson, Günther R. Raidl, Elina Rönnberg, Fredrik Lindsten, Tobias Rodemann Machine Learning, Optimization, and Data Science. LOD 2023. (Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Gabriele La Malfa, Panos M. Pardalos, Umeton Renato, eds.), volume 14505 of lNCS, pages 24–38, 2024, Springer. [bibtex] [pdf] [doi]

2023

[1]	Large Neighborhood Search for Electric Vehicle Fleet Scheduling Steffen Limmer, Johannes Varga, Günther R. Raidl Energies, volume 16, number 12, 2023. [bibtex] [pdf] [doi]
[2]	An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles Steffen Limmer, Johannes Varga, Günther R. Raidl EvoApplications 2023: Applications of Evolutionary Computation (J. Correia, S. Smith, R. Qaddoura, eds.), volume 13989 of LNCS, pages 3-18, 2023, Springer. [bibtex] [pdf] [doi]
[3]	Interactive Job Scheduling with Partially Known Personnel Availabilities Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann OLA 2023: Optimization and Learning (B. Dorronsoro, F. Chicano, G. Danoy, E.-G. Talbi, eds.), volume 1824 of Communications in Computer and Information Science, pages 236–247, 2023, Springer. [bibtex] [pdf] [doi]

2022

[1]	Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet Johannes Varga, Günther R. Raidl, Steffen Limmer Access, volume 10, 2022. [bibtex] [pdf] [doi]

2021

[1]	Computational Methods for Fleet Scheduling in E-Mobility Johannes Varga August 2021, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl [pdf]

Publications: Laurenz Tomandl

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]

A Reinforcement Learning Guided Large Neighborhood Search for the Dynamic Electric Autonomous Dial-a-Ride Problem
Laurenz Tomandl, Maria Bresich, Günther R. Raidl, Yi, Mei, Steffen Limmer, Tobias Rodemann
Machine Learning, Optimization, and Data Science – LOD 2025 (Giuseppe Nicosia, Varunand Giesselbach, Sven Ojha, M. Panos Pardalos, Renato Umeton, La Malfa Emanuele, La Malfa Gabriele, eds.), volume 16467 of LNCS, pages 425-439, 2026, Springer.
[bibtex] [doi]

2025

[1]	A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problem Laurenz Tomandl, Thomas Jatschka, Günther Raidl, Tobias Rodemann Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 251–262, 2025, Springer. [bibtex] [doi]
[2]	Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem William Huang, Yi Mei, Günther R. Raidl, Fangfang Zhang, Laurenz Tomandl, Steffen Limmer, Mengjie Zhang, Tobias Rodemann 2025 IEEE Congress on Evolutionary Computation (CEC), pages 1-8, 2025, IEEE. [bibtex] [pdf] [doi]

2023

[1]	A Learning Multilevel Optimization Approach for a Large Location Allocation Problem Laurenz Tomandl May 2023, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and T. Jatschka [pdf]

2022

[1]

A Reproducibility Study on User-centric MIR Research and Why it is Important
Peter Knees, Bruce Ferwerda, Andreas Rauber, Sebastian Strumbelj, Annabel Resch, Laurenz Tomandl, Valentin Bauer, Fung Yee Tang, Josip Bobinac, Amila Ceranic, Riad Dizdar
pages 764–771, 2022, International Society for Music Information Retrieval.
[bibtex] [pdf] [doi]

Publications: Liana Khazaliya

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2025

[1]

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, Jena, Germany, March 4-7, 2025 (Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, Kim Thang Nguyen, eds.), pages 33:1–33:20, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

[2]

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton
The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.
[bibtex] [pdf]

2024

[1]	Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg J. Computational Geometry, volume 15, number 2, pages 3–39, 2024. [bibtex] [doi]
[2]	Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width) Petr Hlinený, Liana Khazaliya 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 40:1–40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 66:1–66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2023

[1]	Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters Esther Galby, Liana Khazaliya, Fionn Mc~Inerney, Roohani Sharma, Prafullkumar Tale SIAM J. Discrete Math., 2023. Note: to appear [bibtex]
[2]	New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023. [bibtex] [doi]
[3]	Consistency Checking Problems: A Gateway to Parameterized Sample Complexity Robert Ganian, Liana Khazaliya, Kirill Simonov 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 18:1–18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[4]	Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[5]	Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[6]	Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov 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, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 203–217, 2023, Springer. [bibtex] [pdf] [doi]

Publications: Manuel Sorge

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks Robert Ganian, Frank Sommer, Manuel Sorge The Fourteenth International Conference on Learning Representations, ICLR 2026, 2026, OpenReview.net. Note: to appear [bibtex]

2025

[1]	Planarizing Graphs and their Drawings by Vertex Splitting Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms J. Computational Geometry, volume 16, number 1, pages 333–372, 2025. [bibtex] [doi]
[2]	The complexity of cluster vertex splitting and company Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann Discrete Applied Mathematics, volume 365, pages 190–207, 2025. [bibtex] [doi]
[3]	Optimal Decision Tree Pruning Revisited: Algorithms and Complexity Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13-19, 2025, 2025, OpenReview.net. [bibtex] [pdf]

2024

[1]

2023

[1]	On Computing Optimal Tree Ensembles Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA (Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, Jonathan Scarlett, eds.), volume 202 of Proceedings of Machine Learning Research, pages 17364–17374, 2023, PMLR. [bibtex] [pdf]
[2]	Planarizing Graphs and their Drawings by Vertex Splitting Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer. [bibtex] [pdf] [doi]
[3]	The Influence of Dimensions on the Complexity of Computing Decision Trees Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms Conference on Artificial Intelligence (AAAI'23) (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 8343–8350, 2023, AAAI Press. [bibtex] [doi]

2022

[1]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022. [bibtex] [pdf] [doi]
[2]	Turbocharging Heuristics for Weak Coloring Numbers Alexander Dobler, Manuel Sorge, Anaïs Villedieu European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 44:1–44:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]

2020

[1]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider 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. [bibtex] [pdf] [doi]
[2]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider 2020, Technical report AC-TR-20-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

Publications: Maria Bresich

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Revisiting Large Neighborhood Search with On-the-Fly ChargingStation Insertion for the Electric Autonomous Dial-a-Ride Problem M. Bresich, Günther R. Raidl, Steffen Limmer ACM Transactions on Evolutionary Learning and Optimization, volume 6, number 2, pages 1–31, 2026. [bibtex] [pdf] [doi]
[2]	A Reinforcement Learning Guided Large Neighborhood Search for the Dynamic Electric Autonomous Dial-a-Ride Problem Laurenz Tomandl, Maria Bresich, Günther R. Raidl, Yi, Mei, Steffen Limmer, Tobias Rodemann Machine Learning, Optimization, and Data Science – LOD 2025 (Giuseppe Nicosia, Varunand Giesselbach, Sven Ojha, M. Panos Pardalos, Renato Umeton, La Malfa Emanuele, La Malfa Gabriele, eds.), volume 16467 of LNCS, pages 425-439, 2026, Springer. [bibtex] [doi]
[3]	Determining Destroy Sets in Large Neighborhood Search by Generative Flow Networks M. Bresich, Jingyi Peng, G. R. Raidl, S. Limmer Parallel Problem Solving from Nature – PPSN XIX, volume 16985 of LNCS, pages 265–281, 2026, Springer. [bibtex] [doi]
[4]	Search Space Reduction Through Machine Learning for the Electric Autonomous Dial-A-Ride Problem M. Bresich, Günther R., Caspian Coleman, Pascal Welke, Steffen Limmer Machine Learning, Optimization, and Data Science – LOD 2025, volume 16467 of LNCS, pages 185–200, 2026, Springer. [bibtex] [doi]

2025

[1]

Improvements in Large Neighborhood Search for the Electric Autonomous Dial-a-Ride Problem
Maria Bresich, Günther R. Raidl, Steffen Limmer
Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 211–220, 2025, Springer.
[bibtex] [pdf] [doi]

2024

[1]	Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion Maria Bresich, Günther R. Raidl, Steffen Limmer Proceedings of the Genetic and Evolutionary Computation Conference, pages 142–150, 2024, Association for Computing Machinery. Note: best paper award winner of ECOM track [bibtex] [pdf] [doi]
[2]	Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem Maria Bresich, Johannes Varga, Günther R. Raidl, Steffen Limmer Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), pages 3–20, 2024, Springer. [bibtex] [pdf] [doi]

2023

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

Publications: Markus Kirchweger

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Formally Verified Graph Generation with SAT Modulo Symmetries and Lean Markus Kirchweger, Pablo Manrique, Stefan Szeider Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part I (Armin Biere, Carsten Lutz, Sara Negri, eds.), volume 16688 of Lecture Notes in Computer Science, pages 117–135, 2026, Springer. [bibtex] [pdf] [doi]
[2]	Graph Choosability via SAT: Beyond the Nullstellensatz Markus Kirchweger, Tomás Peitl, David Seka, Stefan Szeider Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 14269–14277, 2026, AAAI Press. [bibtex] [pdf] [doi]
[3]	Smart Cubing for Graph Search: A Comparative Study Markus Kirchweger, Hai Xia, Tomás Peitl, Stefan Szeider 32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 33:1–33:19, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: Preprint: CoRR abs/2501.17201, https://arxiv.org/abs/2501.17201 [bibtex] [pdf] [doi]

2025

[1]

Breaking Symmetries in Quantified Graph Search: A Comparative Study
Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider
AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 11246–11254, 2025, AAAI Press.
[bibtex] [pdf] [doi]

2024

[1]	SAT Modulo Symmetries for Graph Generation and Enumeration Markus Kirchweger, Stefan Szeider ACM Transactions on Computational Logic, volume 25, number 3, 2024. [bibtex] [doi]
[2]	Satisfiability Modulo User Propagators Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere Journal of Artificial Intelligence Research, volume 81, pages 989–1017, 2024. [bibtex] [pdf] [doi]
[3]	Computing small Rainbow Cycle Numbers with SAT modulo Symmetries Markus Kirchweger, Stefan Szeider The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex]

2023

[1]	A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture Markus Kirchweger, Tomáš Peitl, Stefan Szeider 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 13:1–13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[2]	Co-Certificate Learning with SAT Modulo Symmetries Markus Kirchweger, Tomáš Peitl, Stefan Szeider 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 [bibtex] [pdf] [doi]
[3]	IPASIR-UP: User Propagators for CDCL Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 8:1–8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [doi]
[4]	SAT-Based Generation of Planar Graphs Markus Kirchweger, Manfred Scheucher, Stefan Szeider The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 14:1–14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [doi]

2022

[1]	A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther Raidl Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Leslie Pérez Cáceres, Sébastien Verel, eds.), volume 13222 of LNCS, pages 127–142, 2022, Springer. Note: best paper award winner [bibtex] [pdf] [doi]
[2]	A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl 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érez Cáceres, Sébastien Vérel, eds.), volume 13222 of Lecture Notes in Computer Science, pages 127–142, 2022, Springer. [bibtex] [pdf] [doi]
[3]	A SAT Attack on Rota’s Basis Conjecture Markus Kirchweger, Manferd Scheucher, Stefan Szeider 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 4:1–4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2021

[1]	SAT Modulo Symmetries for Graph Generation Markus Kirchweger, Stefan Szeider Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel, ed.), pages 39:1–-39:17, 2021, Dagstuhl Publishing. [bibtex] [doi]

Publications: Marlene Gründel

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Bilateral Treewidth for QBF: Where Strategies and Resolution Meet Robert Ganian, Marlene Gründel 29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev, Stefan Szeider, eds.), volume 377 of LIPIcs, pages 16:1–16:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[2]	Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy Robert Ganian, Marlene Gründel, Simon Wietheger Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR. Note: to appear [bibtex]

Publications: Martin Kronegger

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2019

[1]	Parameterized Complexity of Asynchronous Border Minimization Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa Algorithmica, volume 81, number 1, pages 201–223, 2019. [bibtex] [pdf]

2015

[1]	Fixed-parameter Tractable Reductions to SAT for Planning Ronald de Haan, Martin Kronegger, Andreas Pfandler Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina, 2015. [bibtex] [pdf]
[2]	Parameterized Complexity of Asynchronous Border Minimization Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (Rahul Jain, Sanjay Jain, Frank Stephan, eds.), volume 9076 of Lecture Notes in Computer Science, pages 428–440, 2015, Springer. [bibtex] [pdf] [doi]
[3]	Variable-Deletion Backdoors to Planning Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. (Blai Bonet, Sven Koenig, eds.), pages 3305–3312, 2015, AAAI Press. [bibtex]

2014

[1]	Backdoors to Planning Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2300–2307, 2014, AAAI Press. [bibtex]

Publications: Martin Nöllenburg

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	$F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Sara Di Bartolomeo IEEE Trans. Vis. Comput. Graph., volume 32, number 1, pages 747–757, 2026. [bibtex] [pdf] [doi]
[2]	ARCOL: Aspect Ratio Constrained Orthogonal Layout Zainab Alsuwaykit, Yousef Loay Rajeh, Alexandre Kouyoumdjian, Steve Kieffer, Dominik Engel, Sara Di Bartolomeo, Martin Nöllenburg, Ivan Viola Comput. Graph. Forum, 2026. [bibtex] [doi]
[3]	Block Crossings in One-Sided Tanglegrams Alexander Dobler, Martin Nöllenburg Algorithmica, volume 88, pages 20:1–20:30, 2026. [bibtex] [doi]
[4]	Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms Discrete and Computational Geometry, volume 75, pages 391–430, 2026. [bibtex] [doi]
[5]	Multidimensional Manhattan preferences Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger Discrete Applied Mathematics, volume 395, pages 172–202, 2026. [bibtex] [doi]
[6]	Representing Hypergraphs by Point-Line Incidences Alexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nöllenburg Discret. Math. Theor. Comput. Sci., volume 28, number 3, pages \#3:1–24, 2026. [bibtex] [pdf] [doi]
[7]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. [bibtex] [doi]
[8]	The Story(line) So Far: A Survey on Storyline Visualization Sara Di Bartolomeo, Alexander Dobler, Velitchko Filipov, Martin Nöllenburg, Henry Ehlers Comput. Graph. Forum, volume 45, number 3, 2026. [bibtex] [doi]
[9]	Visualizing Treewidth Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg J. Graph Algorithms Appl., volume 30, number 2, pages 199–235, 2026. [bibtex] [doi]
[10]	Clarity and Computational Efficiency of Orbital Boundary Labeling Markus Wallinger, Annika Bonerath, Soeren Terziadis, Jules Wulms, Martin Nöllenburg Pacific Visualization Symposium (PacificVis'26), pages 1–10, 2026. [bibtex] [doi]
[11]	Combined Network and Set Visualization with Hoop and Linear Diagrams Markus Wallinger, Peter Chapman, Martin Nöllenburg, Peter Rodgers, Andrew Blake Diagrammatic Representation and Inference (DIAGRAMS'26), 2026, Springer. Note: To appear. [bibtex]
[12]	Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies Alexander Dobler, Son Le Thanh, Martin Nöllenburg, Tino Weinkauf Pacific Visualization Symposium (PacificVis'26), pages 22–32, 2026. [bibtex] [doi]
[13]	On the Complexity of Extending Storylines Alexander Dobler, Siddharth Gupta, Philipp Kindermann, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex] [pdf]
[14]	One-Sided Local Crossing Minimization Panos Giannopoulos, Miriam Goetze, Grzegorz Gutowski, Maarten Löffler, Martin Nöllenburg, Yuto Okada, Jonathan Rollin, Birgit Vogtenhuber, Alexander Wolff Algorithms and Computation (ISAAC'26) (Nicole Megow, Lin Chen, eds.), volume 399 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear [bibtex] [doi]
[15]	Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints Thomas Depian, Thomas C. van Dijk, Martin Nöllenburg Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex] [pdf]
[16]	Realizing Planar Linkages in Polygonal Domains Thomas Depian, Carolina Haase, Martin Nöllenburg, André Schulz International Workshop on Combinatorial Algorithms (IWOCA'26) (F. Foucaud, A. Parreau, eds.), volume 16587 of LNCS, pages 251–265, 2026, Springer. [bibtex] [doi]
[17]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex]
[18]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[19]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. [bibtex] [doi]
[20]	Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin Nöllenburg Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex] [pdf]
[21]	Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin Nöllenburg 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[22]	Using $\beta$-proximity to Reduce Distortion in Bundled Graph Drawings Markus Wallinger, Tommaso Piselli, Alessandra Tappini, Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg EuroVis 2026 – Short Papers (Jan Byska, Alvitta Ottley, Manuela Waldner, eds.), 2026, Eurographics Association. [bibtex] [doi]

2025

[1]	An Introduction to and Survey of Biological Network Visualization Henry Ehlers, Nicolas Brich, Jiacheng Yu, Michael Krone, Martin Nöllenburg, Hiroaki Natsukawa, Xiaoru Yuan, Hsiang-Yun Wu Computers \& Graphics, volume 126, pages 104115, 2025. [bibtex] [doi]
[2]	Bundling-Aware Graph Drawing Revisited Markus Wallinger, Tommaso Piselli, Alessandra Tappini, Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg IEEE Trans. Vis. Comput. Graph., volume 31, number 12, pages 10828–10839, 2025. [bibtex] [doi]
[3]	Constrained Boundary Labeling Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger Comput. Geom. Theory Appl., volume 129, pages 102191, 2025. [bibtex] [doi]
[4]	Introducing Fairness in Network Visualization Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli, Stephen Wismath Information Sciences, volume 691, pages 121642, 2025. [bibtex] [doi]
[5]	Optimizing Staircase Motifs in Biofabric Network Layouts Sara Di Bartolomeo, Markus Wallinger, Martin Nöllenburg Comput. Graph. Forum, pages e70139, 2025. [bibtex] [doi]
[6]	Passenger Decision-Making in Mass Transit Systems: Insights From Dual-Process Theories Archana Prabhakar, Elise Grison, Simone Morgagni, Martin Nöllenburg, Valérie Gyselinck Applied Cognitive Psychology, volume 39, number 5, pages e70112, 2025. [bibtex] [doi]
[7]	Planarizing Graphs and their Drawings by Vertex Splitting Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms J. Computational Geometry, volume 16, number 1, pages 333–372, 2025. [bibtex] [doi]
[8]	StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Data Markus Wallinger, Annika Bonerath, Wouter Meulemans, Martin Nöllenburg, Stephen Kobourov, Alexander Wolff CoRR, 2025. [bibtex] [doi]
[9]	Transitions in Dynamic Point Labeling Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms Cartography and Geographic Information Science, pages 1–26, 2025. [bibtex] [doi]
[10]	Geometry Matters in Planar Storyplans Alexander Dobler, Maximilian Holzmüller, Martin Nöllenburg Graph Drawing and Network Visualization (GD'25) (Vida Dujmović, Fabrizio Montecchiani, eds.), volume 357 of LIPIcs, pages 27:1–27:9, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[11]	On Minimizing Wiggle in Stacked Area Charts Alexander Dobler, Martin Nöllenburg Algorithms and Data Structures (WADS'25) (Pat Morin, Eunjin Oh, eds.), volume 349 of LIPIcs, pages 22:1–22:14, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[12]	On Planar Unit-Length Linear Linkages in Polygonal Domains Thomas Depian, Carolina Haase, Martin Nöllenburg, André Schulz European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 55:1–55:9, 2025. [bibtex]
[13]	Optimizing Wiggle in Storylines Alexander Dobler, Tim Hegemann, Martin Nöllenburg, Alexander Wolff Graph Drawing and Network Visualization (GD'25) (Vida Dujmović, Fabrizio Montecchiani, eds.), volume 357 of LIPIcs, pages 39:1–39:17, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[14]	Partial Level Planarity Parameterized by the Size of the Missing Graph Thomas Depian, Simon D. Fink, Boris Klemz, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. [bibtex]
[15]	Pathways to Tractability for Geometric Thickness Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. [bibtex] [doi]
[16]	Pathways to Tractability for Geometric Thickness (Best Paper Award) Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg 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álovic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. [bibtex] [pdf] [doi]
[17]	Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael Goodrich, Martin Nöllenburg Algorithms and Data Structures (WADS'25) (Pat Morin, Eunjin Oh, eds.), volume 349 of LIPIcs, pages 14:1–14:22, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[18]	Representing Hypergraphs by Point-Line Incidences Alexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 241–254, 2025, Springer. [bibtex] [doi]
[19]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. [bibtex] [pdf] [doi]
[20]	Visualizing Treewidth Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg Graph Drawing and Network Visualization (GD'25) (Vida Dujmović, Fabrizio Montecchiani, eds.), volume 357 of LIPIcs, pages 17:1–17:20, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[21]	F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Sara Di Bartolomeo 2025, Technical report AC-TR-25-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2024

[1]	Computing Data-driven Multilinear Metro Maps Martin Nöllenburg, Soeren Terziadis The Cartographic Journal, pages 1–16, 2024. [bibtex] [doi]
[2]	Computing Hive Plots: A Combinatorial Framework Martin Nöllenburg, Markus Wallinger J. Graph Algorithms Appl., volume 28, number 2, pages 101–129, 2024. [bibtex] [doi]
[3]	Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg J. Computational Geometry, volume 15, number 2, pages 3–39, 2024. [bibtex] [doi]
[4]	Improving Temporal Treemaps by Minimizing Crossings Alexander Dobler, Martin Nöllenburg Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024. [bibtex] [doi]
[5]	On the Complexity of the Storyplan Problem Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis J. Computer and Systems Sciences, volume 139, pages 103466, 2024. [bibtex] [doi]
[6]	Splitting Plane Graphs to Outerplanarity Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu J. Graph Algorithms Appl., volume 28, number 3, pages 31–48, 2024. [bibtex] [doi]
[7]	Uncertainty in Humanities Network Visualization Melanie Conroy, Christina Gillmann, Francis Harvey, Tamara Mchedlidze, Sara Irina Fabrikant, Florian Windhager, Gerik Scheuermann, Timothy R. Tangherlini, Christopher N. Warren, Scott B. Weingart, Malte Rehbein, Katy Börner, Kimmo Elo, Stefan Jänicke, Andreas Kerren, Martin Nöllenburg, Tim Dwyer, Øyvind Eide, Stephen Kobourov, Gregor Betz Frontiers in Communication, volume 8, pages 1305137, 2024. [bibtex] [doi]
[8]	Visualizing Extensions of Argumentation Frameworks as Layered Graphs Martin Nöllenburg, Christian Pirker, Anna Rapberger, Stefan Woltran, Jules Wulms CoRR, volume abs/2409.05457, 2024. [bibtex] [doi]
[9]	Boundary Labeling in a Circular Orbit Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 22:1–22:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[10]	Bundling-Aware Graph Drawing Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 15:1–15:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[11]	Constrained Boundary Labeling Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 26:1–26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[12]	Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms Computational Geometry (SoCG'24) (Wolfgang Mulzer, Jeff M. Phillips, eds.), volume 293 of LIPIcs, pages 19:1–19:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[13]	GdMetriX - A NetworkX Extension For Graph Drawing Metrics Martin Nöllenburg, Sebastian Röder, Markus Wallinger Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 45:1–45:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract [bibtex] [doi]
[14]	Hoop Diagrams: A Set Visualization Method Peter Rodgers, Peter Chapman, Andrew Blake, Martin Nöllenburg, Markus Wallinger, Alexander Dobler Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer. [bibtex] [doi]
[15]	Introducing Fairness in Graph Visualization Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 49:1–49:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract [bibtex] [doi]
[16]	Introducing Fairness in Graph Visualization via Gradient Descent Fabrizio Montecchiani, Giuseppe Liotta, Martin Nöllenburg, Seok-Hee Hong, Tommaso Piselli Machine Learning Methods in Visualisation for Big Data (MLVis'24) (Daniel Archambault, Ian Nabney, Jaakko Peltonen, eds.), pages 1–5, 2024, Eurographics Association. [bibtex] [doi]
[17]	Minimizing Switches in Cased Graph Drawings Robert Ganian, Martin Nöllenburg, Sebastian Röder Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 43:1–43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract [bibtex] [doi]
[18]	Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 31:1–31:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[19]	The Parameterized Complexity of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[20]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2023

[1]	Faster Edge-Path Bundling Through Graph Spanners Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen Computer Graphics Forum, volume 42, number 6, pages e14789, 2023. [bibtex] [doi]
[2]	LinSets.zip: Compressing Linear Set Diagrams Markus Wallinger, Alexander Dobler, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875–2887, 2023. [bibtex] [doi]
[3]	MosaicSets: Embedding Set Systems into Grid Graphs Peter Rottmann, Markus Wallinger, Annika Bonerath, Sven Gedicke, Martin Nöllenburg, Jan-Henrik Haunert IEEE Trans. Visualization and Computer Graphics, 2023. [bibtex] [pdf]
[4]	New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023. [bibtex] [doi]
[5]	On the Upward Book Thickness Problem: Combinatorial and Complexity Results Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg European J. Combinatorics, volume 110, pages 103662, 2023. [bibtex] [doi]
[6]	Splitting Vertices in 2-Layer Graph Drawings Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger IEEE Computer Graphics and Applications, volume 43, number 3, pages 24–35, 2023. [bibtex] [doi]
[7]	Untangling Circular Drawings: Algorithms and Complexity Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu Comput. Geom. Theory Appl., volume 111, 2023. [bibtex] [doi]
[8]	Worbel: Aggregating Point Labels into Word Clouds Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1–19:32, 2023. [bibtex] [doi]
[9]	Block Crossings in One-Sided Tanglegrams Alexander Dobler, Martin Nöllenburg Algorithms and Data Structures (WADS'23) (Pat Morin, Subhash Suri, eds.), volume 14079 of LNCS, pages 386–400, 2023, Springer. [bibtex] [pdf] [doi]
[10]	Computing Hive Plots: A Combinatorial Framework Martin Nöllenburg, Markus Wallinger Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14466 of LNCS, pages 153–169, 2023, Springer. [bibtex] [pdf] [doi]
[11]	Crossing Minimization in Time Interval Storylines Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs Villedieu, Jules Wulms European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer, Carlos Seara, eds.), pages 36:1–36:7, 2023. [bibtex] [pdf]
[12]	Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[13]	Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[14]	MySemCloud: Semantic-aware Word Cloud Editing Michael Huber, Martin Nöllenburg, Anaïs Villedieu Pacific Visualization Symposium (PacificVis'23), pages 147–156, 2023. [bibtex] [pdf] [doi]
[15]	On Families of Planar DAGs with Constant Stack Number Martin Nöllenburg, Sergey Pupyrev Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14465 of LNCS, pages 135–151, 2023, Springer. [bibtex] [pdf] [doi]
[16]	On the Complexity of the Storyplan Problem Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 304–318, 2023, Springer. [bibtex] [doi]
[17]	Planarizing Graphs and their Drawings by Vertex Splitting Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer. [bibtex] [pdf] [doi]
[18]	Splitting Plane Graphs to Outerplanarity Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu Algorithms and Computation (WALCOM'23) (Bertrand M. T. Lin, Chun-Cheng Lin, Giuseppe Liotta, eds.), volume 13973 of LNCS, 2023, Springer. [bibtex] [pdf] [doi]
[19]	Transitions in Dynamic Point Labeling Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms Geographic Information Science (GIScience'23) (Roger Beecham, Jed A. Long, Dianna Smith, Qunshan Zhao, Sarah Wise, eds.), volume 277 of LIPIcs, pages 2:1–2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2022

[1]	An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Sujoy Bhore, Guangping Li, Martin Nöllenburg ACM J. Experimental Algorithmics, volume 27, pages 1.8:1–1.8:36, 2022. [bibtex] [doi]
[2]	Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313–323, 2022. [bibtex] [doi]
[3]	Mixed Labeling: Integrating Internal and External Labels Ladislav Čmolík, Václav Pavlovec, Hsiang-Yun Wu, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848–1861, 2022. [bibtex] [pdf] [doi]
[4]	Multi-level Area Balancing of Clustered Graphs Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682–2696, 2022. [bibtex] [doi]
[5]	Multicriteria Optimization for Dynamic Demers Cartograms Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376–2387, 2022. Note: TVCG Replicability Stamp [bibtex] [doi]
[6]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. [bibtex] [pdf] [doi]
[7]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. [bibtex] [doi]
[8]	Recognizing Weighted and Seeded Disk Graphs Boris Klemz, Martin Nöllenburg, Roman Prutkin J. Computational Geometry, volume 13, number 1, pages 327–376, 2022. [bibtex] [doi]
[9]	Shape-Guided Mixed Metro Map Layout Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu Computer Graphics Forum, volume 41, number 7, pages 495–506, 2022. [bibtex] [doi]
[10]	Minimum Link Fencing Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu Algorithms and Computation (ISAAC'22) (Sang Won Bae, Heejin Park, eds.), volume 248 of LIPIcs, pages 34:1–34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[11]	Multidimensional Manhattan Preferences Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger Theoretical Informatics (LATIN'22) (Armando Castañeda, Francisco Rodríguez-Henríquez, eds.), volume 13568 of LNCS, pages 273–289, 2022, Springer. [bibtex] [doi]
[12]	On Computing Optimal Linear Diagrams Alexander Dobler, Martin Nöllenburg Diagrammatic Representation and Inference (DIAGRAMS'22) (Valeria Giardino, Sven Linker, Richard Burns, Francesco Bellucci, Jean-Michel Boucheix, Petrucio Viana, eds.), volume 13462 of LNAI, pages 20–36, 2022, Springer. [bibtex] [pdf] [doi]

2021

[1]	ClusterSets: Optimizing Planar Clusters in Categorical Point Data Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff Computer Graphics Forum, volume 40, number 3, pages 471–481, 2021. [bibtex] [pdf] [doi]
[2]	Geometric Planar Networks on Bichromatic Collinear Points Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg Theoretical Computer Science, volume 895, pages 124–136, 2021. [bibtex] [doi]
[3]	Labeling Nonograms: Boundary Labeling for Curve Arrangements Fabian Klute, Maarten Löffler, Martin Nöllenburg Comput. Geom. Theory Appl., volume 98, pages 101791, 2021. [bibtex] [doi]
[4]	MetroSets: Visualizing Sets as Metro Maps Ben Jacobsen, Markus Wallinger, Stephen Kobourov, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021. [bibtex] [pdf] [doi]
[5]	On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg J. Graph Algorithms Appl., 2021. [bibtex] [pdf]
[6]	On the Readability of Abstract Set Visualizations Markus Wallinger, Ben Jacobsen, Stephen Kobourov, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821–2832, 2021. [bibtex] [doi]
[7]	Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021. [bibtex] [doi]
[8]	Balanced Independent and Dominating Sets on Colored Interval Graphs Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'21) (Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence Wong, eds.), volume 12607 of LNCS, pages 89–103, 2021, Springer. [bibtex] [doi]
[9]	Disjoint Box Covering in a Rectilinear Polygon Sujoy Bhore, Guangping Li, Martin Nöllenburg, Jules Wulms European Workshop on Computational Geometry (EuroCG'21), pages 71:1–71:7, 2021. [bibtex] [pdf]
[10]	Layered Area-Proportional Rectangle Contact Representation Martin Nöllenburg, Anaïs Villedieu, Jules Wulms Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 318–326, 2021, Springer. [bibtex] [doi]
[11]	On the Upward Book Thickness Problem: Combinatorial and Complexity Results Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 242–256, 2021, Springer. [bibtex] [pdf] [doi]
[12]	Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 304–317, 2021, Springer. [bibtex] [pdf] [doi]
[13]	Untangling Circular Drawings: Algorithms and Complexity Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu Algorithms and Computation (ISAAC'21) (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 19:1–19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[14]	Worbel: Aggregating Point Labels into Word Clouds Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM. [bibtex] [pdf] [doi]
[15]	External Labeling: Fundamental Concepts and Algorithmic Techniques Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg 2021, Morgan \& Claypool. [bibtex] [doi]

2020

[1]	A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives Hsiang-Yun Wu, Benjamin Niedermann, Shigeo Takahashi, Maxwell J. Roberts, Martin Nöllenburg Computer Graphics Forum, volume 39, number 3, pages 619–646, 2020. [bibtex] [pdf] [doi]
[2]	A Unified Model and Algorithms for Temporal Map Labeling Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Algorithmica, volume 82, pages 2709–2736, 2020. [bibtex] [doi]
[3]	Parameterized Algorithms for Book Embedding Problems Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020. [bibtex] [doi]
[4]	Placing Labels in Road Maps: Algorithms and Complexity Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Algorithmica, volume 82, pages 1881–1908, 2020. [bibtex] [doi]
[5]	Route Schematization with Landmarks Marcelo Galvão, Jakub Krukar, Martin Nöllenburg, Angela Schwering J. Spatial Information Science, volume 21, 2020. [bibtex] [pdf] [doi]
[6]	An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Sujoy Bhore, Guangping Li, Martin Nöllenburg Algorithms (ESA'20) (Fabrizio Grandoni, Peter Sanders, Grzegorz Herman, eds.), volume 173 of LIPIcs, pages 19:1–19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[7]	Balanced Independent and Dominating Sets on Colored Interval Graphs Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg European Workshop on Computational Geometry (EuroCG'20), pages 66:1–66:6, 2020. [bibtex] [pdf]
[8]	Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[9]	Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[10]	Extending Partial 1-Planar Drawings Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg Automata, Languages, and Programming (ICALP'20) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[11]	Extending Partial 1-Planar Drawings Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[12]	Geometric Planar Networks on Bichromatic Points Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg Algorithms and Discrete Applied Mathematics (CALDAM'20) (Manoj Changat, Sandip Das, eds.), volume 12016 of LNCS, pages 79–91, 2020, Springer. [bibtex] [pdf] [doi]
[13]	Labeling Nonograms Maarten Löffler, Martin Nöllenburg European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020. [bibtex] [pdf]
[14]	Layered Fan-Planar Graph Drawings Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi Raftopoulou Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 14:1–14:13, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[15]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer. [bibtex] [pdf] [doi]
[16]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber, Pavel Valtr, eds.), volume 12590 of Lecture Notes in Computer Science, pages 40–54, 2020, Springer. [bibtex] [pdf]
[17]	The Turing Test for Graph Drawing Algorithms Helen C. Purchase, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 466–481, 2020, Springer. [bibtex] [pdf] [doi]
[18]	Towards Data-Driven Multilinear Metro Maps Soeren Nickel, Martin Nöllenburg Diagrammatic Representation and Inference (DIAGRAMS'20) (Ahti-Veikko Pietarinen, Peter Chapman, Leonie Bosveld de Smet, Valeria Giardino, James Corter, Sven Linker, eds.), volume 12169 of LNAI, pages 153–161, 2020, Springer. [bibtex] [pdf] [doi]
[19]	Crossing Layout in Non-planar Graphs Martin Nöllenburg Chapter in Beyond Planar Graphs (Seok-Hee Hong, Takeshi Tokuyama, eds.), pages 187–209, 2020, Springer Nature Singapore. [bibtex] [doi]

2019

[1]	External Labeling Techniques: A Taxonomy and Survey Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg Computer Graphics Forum, volume 38, number 3, pages 833–860, 2019. [bibtex] [pdf] [doi]
[2]	Guidelines for Experimental Algorithmics: A Case Study in Network Analysis Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas Algorithms, volume 12, number 7, pages 127:1–127:37, 2019. [bibtex] [pdf] [doi]
[3]	Lombardi Drawings of Knots and Links Philipp Kindermann, Stephen Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber J. Computational Geometry, volume 10, number 1, pages 444–476, 2019. [bibtex] [doi]
[4]	Metabopolis: scalable network layout for biological pathway diagrams in urban map style Hsiang-Yun Wu, Martin Nöllenburg, Filipa L. Sousa, Ivan Viola BMC Bioinformatics, volume 20, pages 187, 2019. [bibtex] [doi]
[5]	Minimizing crossings in constrained two-sided circular graph layouts Fabian Klute, Martin Nöllenburg J. Computational Geometry, volume 10, number 2, pages 45–69, 2019. [bibtex] [doi]
[6]	On the Readability of Leaders in Boundary Labeling Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Information Visualization, volume 18, number 1, pages 110–132, 2019. [bibtex] [doi]
[7]	Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses Aleksandar Nesic, Matthias Blaicher, Tobias Hoose, Andreas Hofmann, Matthias Lauermann, Yasar Kutuvantavida, Martin Nöllenburg, Sebastian Randel, Wolfgang Freude, Christian Koos Optics Express, volume 27, number 12, pages 17402–17425, 2019. [bibtex] [doi]
[8]	Planar Drawings of Fixed-Mobile Bigraphs Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis Tollis Theoretical Computer Science, volume 795, pages 408–419, 2019. [bibtex] [doi]
[9]	Short Plane Supports for Spatial Hypergraphs Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019. [bibtex] [doi]
[10]	Computing Stable Demers Cartograms Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 46–60, 2019, Springer. [bibtex] [pdf] [doi]
[11]	Exploring Semi-Automatic Map Labeling Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM. [bibtex] [pdf] [doi]
[12]	Maximizing Ink in Partial Edge Drawings of k-plane Graphs Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 323–336, 2019, Springer. [bibtex] [pdf] [doi]
[13]	Mixed Linear Layouts: Complexity, Heuristics, and Experiments Philipp de Col, Fabian Klute, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 460–467, 2019, Springer. [bibtex] [pdf] [doi]
[14]	On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 147–161, 2019, Springer. [bibtex] [pdf] [doi]
[15]	On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 147–161, 2019, Springer. [bibtex] [pdf]
[16]	Parameterized Algorithms for Book Embedding Problems Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 365–378, 2019, Springer. [bibtex] [pdf] [doi]
[17]	Parameterized Algorithms for Book Embedding Problems Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 365–378, 2019, Springer. [bibtex] [pdf]

2018

[1]	Drawing Large Graphs by Multilevel Maxent-Stress Optimization Henning Meyerhenke, Martin Nöllenburg, Christian Schulz IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814–1827, 2018. [bibtex] [doi]
[2]	Planar and poly-arc Lombardi drawings Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg J. Computational Geometry, volume 9, number 1, pages 328–355, 2018. [bibtex] [doi]
[3]	Scalable Set Visualizations (Dagstuhl Seminar 17332) Yifan Hu, Luana Micallef, Martin Nöllenburg, Peter Rodgers Dagstuhl Reports, volume 7, number 8, pages 1–22, 2018. [bibtex] [doi]
[4]	A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola Eurographics Conference on Visualization (EuroVis'18) – Posters (Anna Puig, Renata Raidou, eds.), pages 57–59, 2018. [bibtex] [doi]
[5]	Experimental Evaluation of Book Drawing Algorithms Jonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 224–238, 2018, Springer. [bibtex] [pdf] [doi]
[6]	Lombardi Drawings of Knots and Links Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 113–126, 2018, Springer. [bibtex] [pdf] [doi]
[7]	Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts Fabian Klute, Martin Nöllenburg Computational Geometry (SoCG'18) (Bettina Speckmann, Csaba D. Tóth, eds.), pages 53:1–53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[8]	Minimzing Wiggles in Storyline Visualizations Theresa Fröschl, Martin Nöllenburg Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 585–587, 2018, Springer. [bibtex] [pdf]
[9]	Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity Evmorfia Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi Raftopoulou, Alexander Wolff Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 509–523, 2018, Springer International Publishing. [bibtex] [pdf] [doi]
[10]	Planar Drawings of Fixed-Mobile Bigraphs Michael Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 426–439, 2018, Springer. [bibtex] [pdf] [doi]
[11]	Planar L-Drawings of Directed Graphs Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 465–478, 2018, Springer. [bibtex] [pdf] [doi]
[12]	Short Plane Supports for Spatial Hypergraphs Thom Casterman, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 53–66, 2018, Springer International Publishing. [bibtex] [pdf] [doi]
[13]	Towards Characterizing Strict Outerconfluent Graphs Fabian Klute, Martin Nöllenburg Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 612–614, 2018, Springer. [bibtex] [pdf]
[14]	Graph Visualization Yifan Hu, Martin Nöllenburg Chapter in Encyclopedia of Big Data Technologies (Sherif Sakr, Albert Zomaya, eds.), 2018, Springer International Publishing. [bibtex] [pdf] [doi]

2017

[1]	Euclidean Greedy Drawings of Trees Martin Nöllenburg, Roman Prutkin Discrete and Computational Geometry, volume 58, number 3, pages 543–579, 2017. [bibtex] [doi]
[2]	Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Martin Nöllenburg, Roman Prutkin, Ignaz Rutter International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121–158, 2017. [bibtex] [doi]
[3]	Progress on Partial Edge Drawings Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff J. Graph Algorithms Appl., volume 21, number 4, pages 757–786, 2017. [bibtex] [doi]
[4]	Minimizing crossings in constrained two-sided circular graph layouts Fabian Klute, Martin Nöllenburg European Workshop on Computational Geometry (EuroCG'17), pages 265–268, April 2017. [bibtex] [pdf]
[5]	Radial Contour Labeling with Straight Leaders Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter IEEE Pacific Visualization Symposium (PacificVis'17), pages 295–304, 2017. [bibtex] [pdf] [doi]
[6]	Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd Ujwal Gadiraju, Sebastian Möller, Martin Nöllenburg, Dietmar Saupe, Sebastian Egger-Lampl, Daniel Archambault, Brian Fisher Chapter in Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments (Daniel Archambault, Helen Purchase, Tobias Hoßfeld, eds.), volume 10264 of LNCS, pages 6–26, 2017, Springer International Publishing. [bibtex] [doi]

2016

[1]	Adjacency-Preserving Spatial Treemaps Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira J. Computational Geometry, volume 7, number 1, pages 100-122, 2016. [bibtex] [pdf]
[2]	Consistent Labeling of Rotating Maps Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter J. Computational Geometry, volume 7, number 1, pages 308–331, 2016. [bibtex] [pdf]
[3]	Evaluation of Labeling Strategies for Rotating Maps Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1–1.4:21, 2016. [bibtex] [pdf] [doi]
[4]	Extending Convex Partial Drawings of Graphs Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter Algorithmica, volume 76, number 1, pages 47–67, 2016. [bibtex] [doi]
[5]	Mixed Map Labeling Maarten Löffler, Martin Nöllenburg, Frank Staals J. Spatial Information Science, volume 13, pages 3–32, 2016. [bibtex] [doi]
[6]	On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs Martin Nöllenburg, Roman Prutkin, Ignaz Rutter J. Computational Geometry, volume 7, number 1, pages 47–69, 2016. [bibtex] [pdf]
[7]	Strict Confluent Drawing David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek J. Computational Geometry, volume 7, number 1, pages 22–46, 2016. [bibtex] [pdf]
[8]	An Algorithmic Framework for Labeling Road Maps Benjamin Niedermann, Martin Nöllenburg Geographic Information Science (GIScience '16) (Jennifer A. Miller, David O'Sullivan, Nancy Wiegand, eds.), volume 9927 of LNCS, pages 308–322, 2016, Springer International Publishing. [bibtex] [pdf] [doi]
[9]	Software Visualization via Hierarchic Micro/Macro Layouts Martin Nöllenburg, Ignaz Rutter, Alfred Schuhmacher Information Visualization Theory and Applications (IVAPP'16) (Lars Linsen, Alexandru C. Telea, eds.), pages 153–160, 2016, SciTePress. [bibtex] [doi]
[10]	Temporal Map Labeling: A New Unified Framework with Experiments Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1–23:10, 2016. [bibtex] [pdf] [doi]

2015

[1]	Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052) Ulrik Brandes, Irene Finocchi, Martin Nöllenburg, Aaron Quigley Dagstuhl Reports, volume 5, number 1, pages 243–258, 2015. [bibtex] [pdf] [doi]
[2]	Many-to-One Boundary Labeling with Backbones Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015. [bibtex] [pdf] [doi]
[3]	Multi-Row Boundary-Labeling Algorithms for Panorama Images Andreas Gemsa, Jan-Henrik Haunert, Martin Nöllenburg ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1–1:30, 2015. [bibtex] [pdf] [doi]
[4]	Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 231–244, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[5]	Drawing Large Graphs by Multilevel Maxent-Stress Optimization Henning Meyerhenke, Martin Nöllenburg, Christian Schulz Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 30–43, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[6]	Label Placement in Road Maps Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 221–234, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[7]	Mixed Map Labeling Maarten Löffler, Martin Nöllenburg, Frank Staals Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 339–351, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[8]	On Minimizing Crossings in Storyline Visualizations Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 192–198, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[9]	On the Readability of Boundary Labeling Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 515–527, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[10]	Operating Power Grids with Few Flow Control Buses Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner Future Energy Systems (e-Energy'15), pages 289–294, 2015, ACM. [bibtex] [pdf] [doi]
[11]	Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Martin Nöllenburg, Roman Prutkin, Ignaz Rutter Algorithms and Computation (ISAAC'15) (Khaled Elbassioni, Kazuhisa Makino, eds.), volume 9472 of LNCS, pages 637–649, 2015, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[12]	Recognizing Weighted Disk Contact Graphs Boris Klemz, Martin Nöllenburg, Roman Prutkin Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 433–446, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[13]	Towards Realistic Flow Control in Power Grid Operation Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner, Franziska Wegner Energy Informatics (EI'15) (Sebastian Gottwalt, Lukas König, Hartmut Schmeck, eds.), volume 9424 of LNCS, pages 192–199, 2015, Springer International Publishing. [bibtex] [doi]
[14]	Towards Realistic Pedestrian Route Planning Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, Dorothea Wagner Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'15) (Giuseppe F. Italiano, Marie Schmidt, eds.), volume 48 of OpenAccess Series in Informatics (OASIcs), pages 1–15, 2015, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. [bibtex] [pdf] [doi]

2014

[1]	On d-regular schematization of embedded paths Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter Comput. Geom. Theory Appl., volume 47, number 3A, pages 381–406, 2014. [bibtex] [doi]
[2]	A survey on automated metro map layout methods Martin Nöllenburg Schematic Mapping Workshop, April 2014. [bibtex] [pdf]
[3]	Evaluation of Labeling Strategies for Rotating Maps Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter Experimental Algorithms (SEA'14) (Joachim Gudmundsson, J. Katajainen, eds.), volume 8504 of LNCS, pages 235–246, 2014, Springer International Publishing. [bibtex] [pdf] [doi]
[4]	Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg Algorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), volume 8503 of LNCS, pages 253–264, 2014, Springer International Publishing. [bibtex] [doi]
[5]	On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs Martin Nöllenburg, Roman Prutkin, Ignaz Rutter Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 476–487, 2014, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[6]	PIGRA – A Tool for Pixelated Graph Representations Thomas Bläsius, Fabian Klute, Benjamin Niedermann, Martin Nöllenburg Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 513–514, 2014, Springer Berlin Heidelberg. Note: Poster abstract [bibtex] [pdf]
[7]	Semantic Word Cloud Representations: Hardness and Approximation Algorithms Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff Theoretical Informatics (LATIN'14) (Alfredo Viola, ed.), volume 8392 of LNCS, pages 514–525, 2014, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[8]	Simultaneous Embeddability of Two Partitions Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 64–75, 2014, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[9]	Scalability Considerations for Multivariate Graph Visualization T. J. Jankun-Kelly, Tim Dwyer, Danny Holten, Christophe Hurter, Martin Nöllenburg, Chris Weaver, Kai Xu Chapter in Multivariate Network Visualization (Andreas Kerren, Helen C. Purchase, Matthew O. Ward, eds.), volume 8380 of LNCS, pages 207–235, 2014, Springer International Publishing. [bibtex] [doi]

2013

[1]	Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151) Stephen Kobourov, Martin Nöllenburg, Monique Teillaud Dagstuhl Reports, volume 3, number 4, pages 34–68, 2013. [bibtex] [pdf] [doi]
[2]	Drawing Trees with Perfect Angular Resolution and Polynomial Area Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg Discrete and Computational Geometry, volume 49, number 2, pages 157–182, 2013. [bibtex] [doi]
[3]	Edge-weighted contact representations of planar graphs Martin Nöllenburg, Roman Prutkin, Ignaz Rutter J. Graph Algorithms Appl., volume 17, number 4, pages 441–473, 2013. [bibtex] [doi]
[4]	Optimal 3D Angular Resolution for Low-Degree Graphs David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg J. Graph Algorithms Appl., volume 17, number 3, pages 173–200, 2013. [bibtex] [doi]
[5]	Circular-Arc Cartograms Jan-Hinrich Kämper, Stephen G. Kobourov, Martin Nöllenburg IEEE Pacific Visualization Symposium (PacificVis'13), pages 1–8, 2013, IEEE. [bibtex] [pdf] [doi]
[6]	Drawing Metro Maps using Bézier Curves Martin Fink, Herman Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg. [bibtex] [doi]
[7]	Drawing Planar Graphs with a Prescribed Inner Face Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 316–327, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[8]	Edge-weighted contact representations of planar graphs Martin Nöllenburg, Roman Prutkin, Ignaz Rutter Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 224–235, 2013, Springer Berlin Heidelberg. [bibtex] [doi]
[9]	Euclidean Greedy Drawings of Trees Martin Nöllenburg, Roman Prutkin Algorithms (ESA'13) (H. L. Bodlaender, G. F. Italiano, eds.), volume 8125 of LNCS, pages 767–778, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[10]	Many-to-One Boundary Labeling with Backbones Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[11]	On The Usability of Lombardi Graph Drawings Helen C. Purchase, John Hamer, Martin Nöllenburg, Stephen G. Kobourov Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 451–462, 2013, Springer Berlin Heidelberg. [bibtex] [doi]
[12]	Planar Lombardi Drawings of Outerpaths Maarten Löffler, Martin Nöllenburg Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 561–562, 2013, Springer Berlin Heidelberg. Note: Poster abstract [bibtex] [doi]
[13]	Progress on Partial Edge Drawings Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 67–78, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[14]	Strict Confluent Drawing David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 352–363, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[15]	Trajectory-Based Dynamic Map Labeling Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Algorithms and Computation (ISAAC'13) (Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam, eds.), volume 8283 of LNCS, pages 413–423, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[16]	Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 460–471, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[17]	Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor Jan Christoph Athenstädt, Robert Görke, Marcus Krug, Martin Nöllenburg Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 553–554, 2013, Springer Berlin Heidelberg. Note: Poster abstract [bibtex] [doi]

2012

[1]	Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes Jinhee Chun, Natsuda Kaothanthong, Ryosei Kasai, Matias Korman, Takeshi Tokuyama, Martin Nöllenburg Computer Vision and Image Understanding, volume 116, number 7, pages 803–814, 2012. [bibtex] [doi]
[2]	Cover Contact Graphs Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, Alexander Wolff J. Computational Geometry, volume 3, number 1, pages 102–131, 2012. [bibtex] [pdf]
[3]	Drawing (Complete) Binary Tanglegrams Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo Silveira, Alexander Wolff Algorithmica, volume 62, number 1–2, pages 309–332, 2012. [bibtex] [doi]
[4]	Lombardi Drawings of Graphs Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg J. Graph Algorithms Appl., volume 16, number 1, pages 85–108, 2012. [bibtex] [doi]

2011

[1]	Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming Martin Nöllenburg, Alexander Wolff IEEE Trans. Visualization and Computer Graphics, volume 17, number 5, pages 626-641, 2011. [bibtex] [doi]
[2]	Adjacency-Preserving Spatial Treemaps Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 159–170, 2011, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[3]	Automatic Generation of Route Sketches Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 391–392, 2011, Springer Berlin Heidelberg. Note: Poster abstract [bibtex] [doi]
[4]	Boundary-Labeling Algorithms for Panorama Images Andreas Gemsa, Jan-Henrik Haunert, Martin Nöllenburg Advances in Geographic Information Systems (SIGSPATIAL'11), pages 289–298, 2011, ACM. [bibtex] [pdf] [doi]
[5]	Connecting Two Trees with Optimal Routing Cost Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner Canadian Conference on Computational Geometry (CCCG '11), pages 43–47, 2011, University of Toronto. [bibtex] [pdf]
[6]	Consistent Labeling of Rotating Maps Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 451–462, 2011, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[7]	Drawing Trees with Perfect Angular Resolution and Polynomial Area Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 183–194, 2011, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[8]	Lombardi Drawings of Graphs Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 195–207, 2011, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[9]	On d-regular Schematization of Embedded Paths Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of LNCS, pages 260–271, 2011, Springer Berlin Heidelberg. [bibtex] [doi]
[10]	Optimal 3D Angular Resolution for Low-Degree Graphs David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 208-219, 2011, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[11]	Sliding Labels for Dynamic Point Labeling Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter Canadian Conference on Computational Geometry (CCCG '11), pages 205–210, 2011, University of Toronto. [bibtex] [pdf]

2010

[1]	Boundary Labeling with Octilinear Leaders Michael Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis Algorithmica, volume 57, pages 436–461, 2010. [bibtex] [doi]
[2]	Optimizing Active Ranges for Consistent Dynamic Map Labeling Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff Comput. Geom. Theory Appl., volume 43, number 3, pages 312–328, 2010. [bibtex] [doi]
[3]	An Improved Algorithm for the Metro-Line Crossing Minimization Problem Martin Nöllenburg Graph Drawing (GD'09) (David Eppstein, Emden R. Gansner, eds.), volume 5849 of LNCS, pages 381–392, 2010, Springer Berlin Heidelberg. [bibtex] [doi]
[4]	Dynamic One-Sided Boundary Labeling Martin Nöllenburg, Valentin Polishchuk, Mikko Sysikaski Advances in Geographic Information Systems (SIGSPATIAL'10), pages 310–319, 2010, ACM. [bibtex] [pdf] [doi]
[5]	Path Schematization for Route Sketches Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor Algorithm Theory (SWAT'10) (H. Kaplan, ed.), volume 6139 of LNCS, pages 285–296, 2010, Springer Berlin Heidelberg. [bibtex] [doi]
[6]	Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling Maarten Löffler, Martin Nöllenburg Canadian Conference on Computational Geometry (CCCG '10), pages 203–206, 2010, University of Manitoba. [bibtex] [pdf]
[7]	Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität Martin Nöllenburg Chapter in Ausgezeichnete Informatikdissertationen 2009 (Steffen Hölldobler, ed.), volume D-10 of Lecture Notes in Informatics (LNI), 2010, Gesellschaft für Informatik e.V. (GI). [bibtex]

2009

[1]	Algorithms for Multi-Criteria Boundary Labeling Marc Benkert, Herman Haverkort, Moritz Kroll, Martin Nöllenburg J. Graph Algorithms Appl., volume 13, number 3, pages 289-317, 2009. [bibtex] [doi]
[2]	Consistent Digital Rays Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama Discrete and Computational Geometry, volume 42, number 3, pages 359–378, 2009. [bibtex] [doi]
[3]	Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff Graph Drawing (GD'08) (Ioannis G. Tollis, Maurizio Patrignani, eds.), volume 5417 of LNCS, pages 324–335, 2009, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[4]	Drawing Binary Tanglegrams: An Experimental Evaluation Martin Nöllenburg, Markus Völker, Alexander Wolff, Danny Holten Algorithm Engineering and Experiments (ALENEX'09) (Irene Finocchi, John Hershberger, eds.), pages 106–119, 2009, SIAM. [bibtex] [pdf] [doi]
[5]	Network Visualization: Algorithms, Applications, and Complexity Martin Nöllenburg February 2009, PhD thesis, Fakultät für Informatik, Universität Karlsruhe (TH). [pdf]

2008

[1]	Morphing Polylines: A Step Towards Continuous Generalization Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert Computers, Environment and Urban Systems, volume 32, number 4, pages 248–260, 2008. [bibtex] [doi]
[2]	Algorithms for Multi-Criteria One-Sided Boundary Labeling Marc Benkert, Herman Haverkort, Moritz Kroll, Martin Nöllenburg Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 243–254, 2008, Springer Berlin Heidelberg. [bibtex] [doi]
[3]	Boundary Labeling with Octilinear Leaders Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis Algorithm Theory (SWAT'08) (Joachim Gudmundsson, ed.), volume 5124 of LNCS, pages 234–245, 2008, Springer Berlin Heidelberg. [bibtex] [doi]
[4]	Consistent Digital Rays Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama Computational Geometry (SoCG'08), pages 355–364, 2008, ACM. [bibtex] [pdf] [doi]
[5]	Cover Contact Graphs Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, Martin Nöllenburg, José Ramon Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, Alexander Wolff Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 171–182, 2008, Springer Berlin Heidelberg. [bibtex] [doi]
[6]	Optimizing Active Ranges for Consistent Dynamic Map Labeling Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff Computational Geometry (SoCG'08), pages 10–19, 2008, ACM. [bibtex] [pdf] [doi]

2007

[1]	Improved Algorithms for Length-Minimal One-Sided Boundary Labeling Marc Benkert, Martin Nöllenburg European Workshop on Computational Geometry (EuroCG'07), pages 190–193, March 2007. [bibtex]
[2]	Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff Graph Drawing (GD'06) (M. Kaufmann, D. Wagner, eds.), volume 4372 of LNCS, pages 270-281, 2007, Springer-Verlag. [bibtex] [doi]
[3]	Morphing Polygonal Lines: A Step Towards Continuous Generalization Damian Merrick, Martin Nöllenburg, Alexander Wolff, Marc Benkert Geographic Information Science Research Conference UK (GISRUK'07) (Adam Winstanley, ed.), pages 390–399, 2007. [bibtex] [pdf]
[4]	Geographic Visualization Martin Nöllenburg Chapter in Human-Centered Visualization Environments (Andreas Kerren, Achim Ebert, Joerg Meyer, eds.), volume 4417 of LNCS, pages 257-294, 2007, Springer Berlin Heidelberg. [bibtex] [doi]

2006

[1]	A Mixed-Integer Program for Drawing High-Quality Metro Maps Martin Nöllenburg, Alexander Wolff Graph Drawing (GD'05) (Patrick Healy, Nikola S. Nikolov, eds.), volume 3843 of LNCS, pages 321–333, 2006, Springer Berlin Heidelberg. [bibtex] [doi]

2005

[1]	Automated Drawing of Metro Maps Martin Nöllenburg August 2005, Master's thesis, Fakultät für Informatik, Universität Karlsruhe (TH). [pdf]
[2]	Automated Drawing of Metro Maps Martin Nöllenburg 2005, Technical report 2005-25, Fakultät für Informatik, Universität Karlsruhe. [bibtex] [doi]

2004

[1]	Validation in the Cluster Analysis of Gene Expression Data Jens Jäkel, Martin Nöllenburg Workshop Fuzzy-Systeme und Computational Intelligence (R. Mikut, M. Reischl, eds.), pages 13-32, 2004, Universitätsverlag Karlsruhe. [bibtex] [pdf]

Publications: Mathis Teva Rocton

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]

Computing Twin-Width via Treedepth and Vertex Integrity
Robert Ganian, Mathis Rocton
43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026 (Meena Mahajan, Florin Manea, Annabelle McIver, Kim Thang Nguyen, eds.), volume 364 of LIPIcs, pages 42:1–42:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

2025

[1]	Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity Jakub Balabán, Robert Ganian, Mathis Rocton SIAM J. Discret. Math., volume 39, number 4, pages 2102–2141, 2025. [bibtex] [pdf] [doi]
[2]	PACE Solver Description: Bad Dominating Set Maker Alexander Dobler, Simon Dominik Fink, Mathis Rocton 20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal, Erik Jan van Leeuwen, eds.), pages 35:1–35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	The Computational Complexity of Positive Non-Clashing Teaching in Graphs Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. [bibtex] [pdf]
[4]	Training One-Dimensional Graph Neural Networks is NP-Hard Robert Ganian, Mathis Rocton, Simon Wietheger The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. [bibtex] [pdf]

2024

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

2023

[1]	New Complexity-Theoretic Frontiers of Tractability for Neural Network Training Cornelius Brand, Robert Ganian, Mathis Rocton 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. [bibtex]
[2]	PACE Solver Description: Touiouidth Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Rocton Parameterized and Exact Computation (IPEC'2023) (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 38:1–38:4, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [doi]

Publications: Pablo Manrique Merchan

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]

Formally Verified Graph Generation with SAT Modulo Symmetries and Lean
Markus Kirchweger, Pablo Manrique, Stefan Szeider
Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part I (Armin Biere, Carsten Lutz, Sara Negri, eds.), volume 16688 of Lecture Notes in Computer Science, pages 117–135, 2026, Springer.
[bibtex] [pdf] [doi]

Publications: Phuc Hung Hoang

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	A Parameterized-Complexity Framework for Finding Local Optima Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz 17th Innovations in Theoretical Computer Science Conference, ITCS 2026, Bocconi University, Milan, Italy, January 27-30, 2026 (Shubhangi Saraf, ed.), volume 362 of LIPIcs, pages 66:1–66:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[2]	Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, eds.), volume 374 of LIPIcs, pages 38:1–38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity Robert Ganian, Hung P. Hoang, Simon Wietheger Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 19108–19116, 2026, AAAI Press. [bibtex] [pdf] [doi]
[4]	Not All Degree Constraints Are Created Equal when Computing Spanning Trees Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[5]	Parameterized Complexity of Efficient Sortation Robert Ganian, Hung Hoang, Simon Wietheger 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]

2024

[1]	Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy Algorithmica, volume 86, number 7, pages 2250–2288, 2024. [bibtex] [pdf] [doi]
[2]	Generating All Invertible Matrices by Row Operations Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 35:1–35:14, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k $\geq$ 5 Sophia Heimann, Hung P. Hoang, Stefan Hougardy 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 84:1–84:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

Publications: Robert Ganian

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	A structural complexity analysis of synchronous dynamical systems Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna Artif. Intell., volume 351, pages 104472, 2026. [bibtex] [pdf] [doi]
[2]	From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Algorithmica, volume 88, number 1, pages 8, 2026. [bibtex] [pdf] [doi]
[3]	Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan ACM Transactions on Algorithms, 2026. Note: to appear [bibtex]
[4]	Routing few robots in a crowded network Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan J. Comput. Syst. Sci., volume 157, pages 103753, 2026. [bibtex] [pdf] [doi]
[5]	The Complexity of Envy-Free Graph Cutting Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak Artificial Intelligence, 2026. Note: to appear [bibtex]
[6]	The Complexity of Extending Fair Allocations of Indivisible Goods Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis J. Artif. Intell. Res., volume 86, 2026. [bibtex] [pdf] [doi]
[7]	The Parameterized Complexity of Coordinated Motion Planning Eduard Eiben, Robert Ganian, Iyad Kanj Discrete and Computational Geometry, 2026. Note: to appear [bibtex]
[8]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. [bibtex] [doi]
[9]	A Fixed-Parameter Algorithm for Extending Upward Planar Drawings Vera Chekan, Robert Ganian, Viktoriia Korchemna 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[10]	A Parameterized-Complexity Framework for Finding Local Optima Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz 17th Innovations in Theoretical Computer Science Conference, ITCS 2026, Bocconi University, Milan, Italy, January 27-30, 2026 (Shubhangi Saraf, ed.), volume 362 of LIPIcs, pages 66:1–66:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[11]	A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs Ajaykrishnan E S, Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan 2026 Symposium on Simplicity in Algorithms, SOSA 2026, Vancouver, BC, Canada, January 12-14, 2026 (Sepehr Assadi, Eva Rotenberg, eds.), pages 65–80, 2026, SIAM. [bibtex] [pdf] [doi]
[12]	Bilateral Treewidth for QBF: Where Strategies and Resolution Meet Robert Ganian, Marlene Gründel 29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev, Stefan Szeider, eds.), volume 377 of LIPIcs, pages 16:1–16:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[13]	Circle Graph 3-Coloring: Can Simplicity Beat SAT? Robert Ganian, Philipp Mauve, Vaishali Surianarayanan 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[14]	Computing Twin-Width via Treedepth and Vertex Integrity Robert Ganian, Mathis Rocton 43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026 (Meena Mahajan, Florin Manea, Annabelle McIver, Kim Thang Nguyen, eds.), volume 364 of LIPIcs, pages 42:1–42:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[15]	Coordinated Motion Planning Is FPT on Discretized Simple Polygons Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, eds.), volume 374 of LIPIcs, pages 75:1–75:13, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[16]	Fair Correlation Clustering Meets Graph Parameters Johannes Blaha, Robert Ganian, Katharina Gillig, Jonathan Højlev, Simon Wietheger Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026), 2026. Note: to appear [bibtex]
[17]	Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, eds.), volume 374 of LIPIcs, pages 38:1–38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[18]	Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy Robert Ganian, Marlene Gründel, Simon Wietheger Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR. Note: to appear [bibtex]
[19]	Makespan Minimization in Split Learning: From Theory to Practice Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari IEEE INFOCOM 2026 - IEEE Conference on Computer Communications, Tokyo, Japan, May 18-21, 2026, pages 1–10, 2026, IEEE. [bibtex] [pdf] [doi]
[20]	Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity Robert Ganian, Hung P. Hoang, Simon Wietheger Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 19108–19116, 2026, AAAI Press. [bibtex] [pdf] [doi]
[21]	Not All Degree Constraints Are Created Equal when Computing Spanning Trees Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[22]	Parameterized Complexity of Efficient Sortation Robert Ganian, Hung Hoang, Simon Wietheger 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[23]	Perfect Rectangular Tilings with Two Colors Robert Ganian, Phillip Keldenich, Maarten Löffler, Gert Meijer, Ids de Vlas, Alexandra Weinberger Oswin Aichholzer, Carola Wenk 37th International Symposium on Algorithms and Computation, ISAAC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[24]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex]
[25]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[26]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. [bibtex] [doi]
[27]	Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks Robert Ganian, Frank Sommer, Manuel Sorge The Fourteenth International Conference on Learning Representations, ICLR 2026, 2026, OpenReview.net. Note: to appear [bibtex]
[28]	Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin Nöllenburg Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex] [pdf]
[29]	Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin Nöllenburg 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]

2025

[1]	Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity Jakub Balabán, Robert Ganian, Mathis Rocton SIAM J. Discret. Math., volume 39, number 4, pages 2102–2141, 2025. [bibtex] [pdf] [doi]
[2]	Parameterized Complexity in Machine Learning Robert Ganian Computer Science Review, 2025. Note: to appear [bibtex]
[3]	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen ACM Trans. Comput. Theory, volume 17, number 3, pages 18:1–18:42, 2025. [bibtex] [pdf] [doi]
[4]	The complexity of optimizing atomic congestion Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney Artif. Intell., volume 338, pages 104241, 2025. [bibtex] [pdf] [doi]
[5]	A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan 41st International Symposium on Computational Geometry, SoCG 2025, June 23-27, 2025, Kanazawa, Japan (Oswin Aichholzer, Haitao Wang, eds.), volume 332 of LIPIcs, pages 44:1–44:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[6]	A Structural Complexity Analysis of Hierarchical Task Network Planning Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger 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. [bibtex] [pdf] [doi]
[7]	Approximate Evaluation of Quantitative Second Order Queries Jan Dreier, Robert Ganian, Thekla Hamm 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025, pages 664–677, 2025, IEEE. [bibtex] [pdf] [doi]
[8]	Crossing and Independent Families Among Polygons Anna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada 19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada (Pat Morin, Eunjin Oh, eds.), volume 349 of LIPIcs, pages 11:1–11:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[9]	Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman, eds.), volume 351 of LIPIcs, pages 15:1–15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex] [pdf] [doi]
[10]	Parameterized Algorithms for Multiagent Pathfinding on Trees Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2025, Detroit, MI, USA, May 19-23, 2025 (Sanmay Das, Ann Nowé, Yevgeniy Vorobeychik, eds.), pages 584–592, 2025, International Foundation for Autonomous Agents and Multiagent Systems / ACM. [bibtex] [pdf] [doi]
[11]	Parameterized Complexity of Caching in Networks Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 11229–11237, 2025, AAAI Press. [bibtex] [pdf] [doi]
[12]	Partial Level Planarity Parameterized by the Size of the Missing Graph Thomas Depian, Simon D. Fink, Boris Klemz, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. [bibtex]
[13]	Pathways to Tractability for Geometric Thickness Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. [bibtex] [doi]
[14]	Pathways to Tractability for Geometric Thickness (Best Paper Award) Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg 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álovic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. [bibtex] [pdf] [doi]
[15]	Routing Few Robots in a Crowded Network Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan 19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada (Pat Morin, Eunjin Oh, eds.), volume 349 of LIPIcs, pages 20:1–20:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[16]	Structural Parameterizations of Simultaneous Planarity Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, eds.), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[17]	The Complexity of Extending Fair Allocations of Indivisible Goods Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith, Stavros D. Ioannidis AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 13745–13753, 2025, AAAI Press. [bibtex] [pdf] [doi]
[18]	The Computational Complexity of Positive Non-Clashing Teaching in Graphs Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. [bibtex] [pdf]
[19]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. [bibtex] [pdf] [doi]
[20]	Training One-Dimensional Graph Neural Networks is NP-Hard Robert Ganian, Mathis Rocton, Simon Wietheger The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. [bibtex] [pdf]

2024

[1]	Bounding and Computing Obstacle Numbers of Graphs Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff SIAM J. Discret. Math., volume 38, number 2, pages 1537–1565, 2024. [bibtex] [pdf] [doi]
[2]	Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg J. Computational Geometry, volume 15, number 2, pages 3–39, 2024. [bibtex] [doi]
[3]	Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager J. Graph Algorithms Appl., volume 28, number 2, pages 131–150, 2024. [bibtex] [pdf] [doi]
[4]	Graphs with at most two moplexes Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic Journal of Graph Theory, 2024, Wiley Online Library. [bibtex]
[5]	Slim Tree-Cut Width Robert Ganian, Viktoriia Korchemna Algorithmica, volume 86, number 8, pages 2714–2738, 2024. [bibtex] [pdf] [doi]
[6]	The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024. [bibtex] [pdf] [doi]
[7]	A Tight Subexponential-Time Algorithm for Two-Page Book Embedding Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 68:1–68:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[8]	Computing Twin-Width Parameterized by the Feedback Edge Number Jakub Balabán, Robert Ganian, Mathis Rocton 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, eds.), volume 289 of LIPIcs, pages 7:1–7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[9]	Exact Algorithms for Clustered Planarity with Linear Saturators Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi 35th International Symposium on Algorithms and Computation, ISAAC 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex]
[10]	Minimizing Switches in Cased Graph Drawings Robert Ganian, Martin Nöllenburg, Sebastian Röder Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 43:1–43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract [bibtex] [doi]
[11]	Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 53:1–53:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[12]	Revisiting Causal Discovery from a Complexity-Theoretic Perspective Robert Ganian, Viktoriia Korchemna, Stefan Szeider Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3377–3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track [bibtex] [doi]
[13]	The Complexity of Optimizing Atomic Congestion Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc~Inerney 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, Jennifer G. Dy, Sriraam Natarajan, eds.), pages 20044–20052, 2024, AAAI Press. [bibtex] [pdf] [doi]
[14]	The Parameterized Complexity Landscape of the Unsplittable Flow Problem Robert Ganian, Mathis Rocton, Daniel Unterberger Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Král, Martin Milanic, eds.), volume 14760 of Lecture Notes in Computer Science, pages 220–235, 2024, Springer. [bibtex] [pdf] [doi]
[15]	The Parameterized Complexity of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[16]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[17]	Twin-Width Meets Feedback Edges and Vertex Integrity Jakub Balabán, Robert Ganian, Mathis Rocton 19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United Kingdom (Édouard Bonnet, Pawel Rzazewski, eds.), volume 321 of LIPIcs, pages 3:1–3:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2023

[1]	Group Activity Selection with Few Agent Types Robert Ganian, Sebastian Ordyniak, C. S. Rahul Algorithmica, volume 85, number 5, pages 1111–1155, 2023. [bibtex] [pdf] [doi]
[2]	Hedonic diversity games: A complexity picture with more than two colors Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchy Artif. Intell., volume 325, pages 104017, 2023. [bibtex] [pdf] [doi]
[3]	New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023. [bibtex] [doi]
[4]	On the parameterized complexity of clustering problems for incomplete data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Journal of Computer and System Sciences, volume 134, pages 1–19, 2023. [bibtex] [doi]
[5]	Parameterized complexity of envy-free resource allocation in social networks Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak Artif. Intell., volume 315, pages 103826, 2023. [bibtex] [pdf] [doi]
[6]	Worbel: Aggregating Point Labels into Word Clouds Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1–19:32, 2023. [bibtex] [doi]
[7]	A Parameterized Theory of PAC Learning Cornelius Brand, Robert Ganian, Kirill Simonov 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, Yiling Chen, Jennifer Neville, eds.), pages 6834–6841, 2023, AAAI Press. [bibtex] [pdf]
[8]	A Structural Complexity Analysis of Synchronous Dynamical Systems Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna 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, Yiling Chen, Jennifer Neville, eds.), pages 6313–6321, 2023, AAAI Press. [bibtex] [pdf]
[9]	Consistency Checking Problems: A Gateway to Parameterized Sample Complexity Robert Ganian, Liana Khazaliya, Kirill Simonov 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 18:1–18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[10]	Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[11]	Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[12]	Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager 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, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 66–81, 2023, Springer. [bibtex] [pdf] [doi]
[13]	From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 16:1–16:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[14]	Maximizing Social Welfare in Score-Based Social Distance Games Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023 (Rineke Verbrugge, ed.), volume 379 of EPTCS, pages 272–286, 2023. [bibtex] [pdf] [doi]
[15]	New Complexity-Theoretic Frontiers of Tractability for Neural Network Training Cornelius Brand, Robert Ganian, Mathis Rocton 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. [bibtex]
[16]	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, Erik Jan van Leeuwen 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands (Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman, eds.), volume 274 of LIPIcs, pages 18:1–18:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[17]	Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–14, 2023. [bibtex] [pdf] [doi]
[18]	The Computational Complexity of Concise Hypersphere Classification Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Proceedings of the 40th International Conference on Machine Learning, ICML 2023, pages 9060–9070, 2023, PMLR. [bibtex] [pdf]
[19]	The Parameterized Complexity of Coordinated Motion Planning Eduard Eiben, Robert Ganian, Iyad Kanj 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 28:1–28:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[20]	The Parameterized Complexity of Network Microaggregation Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov 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, Yiling Chen, Jennifer Neville, eds.), pages 6262–6270, 2023, AAAI Press. [bibtex] [pdf]

2022

[1]	Algorithmic Applications of Tree-Cut Width Robert Ganian, Eun Jung Kim, Stefan Szeider SIAM J. Discrete Math., volume 36, number 4, pages 2635–2666, 2022. [bibtex] [pdf] [doi]
[2]	An efficient algorithm for counting Markov equivalent DAGs Robert Ganian, Thekla Hamm, Topi Talvitie Artificial Intelligence, volume 304, pages 103648, 2022. [bibtex] [pdf] [doi]
[3]	On Covering Segments with Unit Intervals Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj SIAM J. Discret. Math., volume 36, number 2, pages 1200–1230, 2022. [bibtex] [pdf] [doi]
[4]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. [bibtex] [pdf] [doi]
[5]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. [bibtex] [doi]
[6]	Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria Robert Ganian, Jan Kratochvíl, Stefan Szeider Discr. Appl. Math., volume 312, pages 1–2, 2022. [bibtex] [pdf]
[7]	Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider Journal of Artificial Intelligence Research, volume 33, pages 535–552, 2022. [bibtex] [pdf]
[8]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022. [bibtex] [pdf] [doi]
[9]	A Unifying Framework for Characterizing and Computing Width Measures Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex]
[10]	Bounding and Computing Obstacle Numbers of Graphs Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 11:1–11:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[11]	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos, Michael Kaufmann, eds.), volume 13453 of Lecture Notes in Computer Science, pages 98–113, 2022, Springer. [bibtex] [pdf] [doi]
[12]	Finding a Cluster in Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[13]	Hedonic Diversity Games: A Complexity Picture with More than Two Colors Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 5034–5042, 2022, AAAI Press. [bibtex] [pdf]
[14]	Parameterized Algorithms for Upward Planarity Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 26:1–26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[15]	Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria Stefan Szeider, Robert Ganian, Alexandra Silva 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. [bibtex] [pdf]
[16]	Slim Tree-Cut Width Robert Ganian, Viktoriia Korchemna 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell, Jesper Nederlof, eds.), volume 249 of LIPIcs, pages 15:1–15:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[17]	Testing Upward Planarity of Partial 2-Trees Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of Lecture Notes in Computer Science, pages 175–187, 2022, Springer. [bibtex] [pdf] [doi]
[18]	The Complexity of Envy-Free Graph Cutting Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 237–243, 2022, ijcai.org. [bibtex] [pdf] [doi]
[19]	The Complexity of k-Means Clustering when Little is Known Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, Sivan Sabato, eds.), volume 162 of Proceedings of Machine Learning Research, pages 6960–6987, 2022, PMLR. [bibtex] [pdf]
[20]	The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, eds.), volume 229 of LIPIcs, pages 66:1–66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[21]	Weighted Model Counting with Twin-Width Robert Ganian, Filip Pokrývka, Andre Schidler, Kirill Simonov, Stefan Szeider 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 15:1–15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2021

[1]	Measuring what matters: A hybrid approach to dynamic programming with treewidth Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon J. Comput. Syst. Sci., volume 121, pages 57–75, 2021. [bibtex] [pdf]
[2]	New Width Parameters for SAT and Sharp-SAT Robert Ganian, Stefan Szeider Artificial Intelligence, volume 295, pages 103460, 2021. [bibtex] [pdf] [doi]
[3]	On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg J. Graph Algorithms Appl., 2021. [bibtex] [pdf]
[4]	On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Robert Ganian, Fabian Klute, Sebastian Ordyniak Algorithmica, volume 83, number 1, pages 297–336, 2021. [bibtex] [pdf]
[5]	On Structural Parameterizations of the Edge Disjoint Paths Problem Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan Algorithmica, volume 83, number 6, pages 1605–1637, 2021. [bibtex] [pdf]
[6]	Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021. [bibtex] [doi]
[7]	The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints Pavel Dvořák, Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak Artificial Intelligence, 2021. [bibtex] [pdf]
[8]	The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths Robert Ganian, Sebastian Ordyniak Algorithmica, volume 83, number 2, pages 726–752, 2021. [bibtex] [pdf]
[9]	Towards a Polynomial Kernel for Directed Feedback Vertex Set Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan Algorithmica, volume 83, number 5, pages 1201–1221, 2021. [bibtex] [pdf]
[10]	Crossing-Optimal Extension of Simple Drawings Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal, Emanuela Merelli, James Worrell, eds.), volume 198 of LIPIcs, pages 72:1–72:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[11]	Graphs with two moplexes Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, 2021, Elsevier. [bibtex] [pdf]
[12]	The Complexity of Bayesian Network Learning: Revisiting the Superstructure Robert Ganian, Viktoriia Korchemna 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, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, eds.), pages 430–442, 2021. [bibtex] [pdf]
[13]	The Complexity of Object Association in Multiple Object Tracking Robert Ganian, Thekla Hamm, Sebastian Ordyniak Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388–1396, 2021, AAAI Press. [bibtex] [pdf]
[14]	The Parameterized Complexity of Clustering Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296–7304, 2021, AAAI Press. [bibtex] [pdf]
[15]	The Parameterized Complexity of Connected Fair Division Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou, ed.), pages 139–145, 2021, ijcai.org. [bibtex] [pdf]
[16]	Worbel: Aggregating Point Labels into Word Clouds Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM. [bibtex] [pdf] [doi]
[17]	Worbel: Aggregating Point Labels into Word Clouds Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nollenburg, Jules Wulms Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021. [bibtex] [pdf]
[18]	The Parameterized Complexity of Clustering Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 2021, Technical report AC-TR-21-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2020

[1]	Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada Derek G. Corneil, Robert Ganian, Andrzej Proskurowski Discr. Appl. Math., volume 278, pages 1–2, 2020. [bibtex]
[2]	On Existential MSO and Its Relation to ETH Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1–22:32, 2020. [bibtex] [pdf] [doi]
[3]	Parameterized Algorithms for Book Embedding Problems Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020. [bibtex] [doi]
[4]	Using decomposition-parameters for QBF: Mind the prefix! Eduard Eiben, Robert Ganian, Sebastian Ordyniak J. Comput. Syst. Sci., volume 110, pages 1–21, 2020. [bibtex] [pdf]
[5]	An Efficient Algorithm for Counting Markov Equivalent DAGs Robert Ganian, Thekla Hamm, Topi Talvitie The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136–10143, 2020, AAAI Press. [bibtex] [pdf]
[6]	Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[7]	Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[8]	Extending Partial 1-Planar Drawings Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg Automata, Languages, and Programming (ICALP'20) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[9]	Extending Partial 1-Planar Drawings Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[10]	Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Robert Ganian, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020. [bibtex] [pdf]
[11]	On Covering Segments with Unit Intervals Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Christophe Paul, Markus Bläser, eds.), volume 154 of LIPIcs, pages 13:1–13:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf]
[12]	On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906–3913, 2020, AAAI Press. [bibtex] [pdf]
[13]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer. [bibtex] [pdf] [doi]
[14]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber, Pavel Valtr, eds.), volume 12590 of Lecture Notes in Computer Science, pages 40–54, 2020, Springer. [bibtex] [pdf]
[15]	Parameterized Complexity of Envy-Free Resource Allocation in Social Networks Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 7135–7142, 2020, AAAI Press. [bibtex] [pdf]
[16]	Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP Jiehua Chen, Robert Ganian, Thekla Hamm Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 146–152, 2020, ijcai.org. [bibtex] [pdf]
[17]	The Complexity Landscape of Resource-Constrained Scheduling Robert Ganian, Thekla Hamm, Guillaume Mescoff Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 1741–1747, 2020, ijcai.org. [bibtex] [pdf]
[18]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider 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. [bibtex] [pdf] [doi]
[19]	Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Robert Ganian, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2020, Technical report AC-TR-20-011, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[20]	On the Parameterized Complexity of Clustering Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 2020, Technical report AC-TR-20-002, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[21]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider 2020, Technical report AC-TR-20-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2019

[1]	Counting linear extensions: Parameterizations by treewidth Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak Algorithmica, 2019. [bibtex] [pdf]
[2]	On the Complexity Landscape of Connected f-Factor Problems Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan Algorithmica, volume 81, number 6, pages 2606–2632, 2019. [bibtex] [pdf]
[3]	Parameterized Complexity of Asynchronous Border Minimization Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa Algorithmica, volume 81, number 1, pages 201–223, 2019. [bibtex] [pdf]
[4]	Shrub-Depth: Capturing Height of Dense Graphs Robert Ganian, Petr Hlinen\' y, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez Logical Methods in Computer Science, 2019. [bibtex] [pdf]
[5]	Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey Robert Ganian, Sebastian Ordyniak Algorithms, volume 12, number 12, pages 248, 2019. [bibtex] [pdf]
[6]	A Join-Based Hybrid Parameter for Constraint Satisfaction Robert Ganian, Sebastian Ordyniak, Stefan Szeider Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex, Simon de Givry, eds.), volume 11802 of Lecture Notes in Computer Science, pages 195–212, 2019, Springer Verlag. [bibtex] [pdf] [doi]
[7]	Group Activity Selection with Few Agent Types Robert Ganian, Sebastian Ordyniak, C. S. Rahul 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (Michael A. Bender, Ola Svensson, Grzegorz Herman, eds.), pages 48:1–48:16, 2019. [bibtex] [pdf]
[8]	Integer Programming and Incidence Treedepth Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings (Andrea Lodi, Viswanath Nagarajan, eds.), volume 11480 of Lecture Notes in Computer Science, pages 194–204, 2019, Springer. [bibtex] [pdf]
[9]	Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen, eds.), pages 42:1–42:15, 2019. [bibtex] [pdf]
[10]	On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 147–161, 2019, Springer. [bibtex] [pdf] [doi]
[11]	On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 147–161, 2019, Springer. [bibtex] [pdf]
[12]	Parameterized Algorithms for Book Embedding Problems Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 365–378, 2019, Springer. [bibtex] [pdf] [doi]
[13]	Parameterized Algorithms for Book Embedding Problems Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 365–378, 2019, Springer. [bibtex] [pdf]
[14]	SAT-Encodings for Treecut Width and Treedepth Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov, Henning Meyerhenke, eds.), pages 117–129, 2019, SIAM. [bibtex] [pdf] [doi]
[15]	Solving integer quadratic programming via explicit and structural restrictions Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 (Pascal Van Hentenryck, Zhi-Hua Zhou, eds.), pages 1477–1484, 2019. [bibtex] [pdf]
[16]	The Parameterized Complexity of Cascading Portfolio Scheduling Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Emily B. Fox, Roman Garnett, eds.), pages 7666–7676, 2019. [bibtex] [pdf]
[17]	The Power of Cut-Based Parameters for Computing Edge Disjoint Paths Robert Ganian, Sebastian Ordyniak Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers (Ignasi Sau, Dimitrios M. Thilikos, eds.), pages 190–204, 2019. [bibtex] [pdf]
[18]	A Join-Based Hybrid Parameter for Constraint Satisfaction Robert Ganian, Sebastian Ordyniak, Stefan Szeider 2019, Technical report AC-TR-19-006, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[19]	SAT-Encodings for Treecut Width and Treedepth Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider 2019, Technical report AC-TR-19-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[20]	The Parameterized Complexity of Cascading Portfolio Scheduling Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider 2019, Technical report AC-TR-19-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2018

[1]	A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion Eduard Eiben, Robert Ganian, O-joung Kwon Journal of Computer and System Sciences, volume 97, pages 121–146, 2018. [bibtex] [pdf]
[2]	Meta-kernelization using well-structured modulators Eduard Eiben, Robert Ganian, Stefan Szeider Discr. Appl. Math., volume 248, pages 153–167, 2018. [bibtex] [pdf] [doi]
[3]	On the complexity of rainbow coloring problems Eduard Eiben, Robert Ganian, Juho Lauri Discr. Appl. Math., volume 246, pages 38–48, 2018. [bibtex] [pdf]
[4]	Solving Problems on Graphs of High Rank-Width Eduard Eiben, Robert Ganian, Stefan Szeider Algorithmica, volume 80, number 2, pages 742–771, 2018. [bibtex] [pdf] [doi]
[5]	The complexity landscape of decompositional parameters for ILP Robert Ganian, Sebastian Ordyniak Artificial Intelligence, volume 257, pages 61–71, 2018. [bibtex] [pdf]
[6]	A Structural Approach to Activity Selection Eduard Eiben, Robert Ganian, Sebastian Ordyniak Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 203–209, 2018, ijcai.org. [bibtex] [pdf]
[7]	On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Robert Ganian, Fabian Klute, Sebastian Ordyniak 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 33:1–33:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [bibtex] [pdf]
[8]	Parameterized Algorithms for the Matrix Completion Problem Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 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 [bibtex] [pdf]
[9]	Small Resolution Proofs for QBF using Dependency Treewidth Eduard Eiben, Robert Ganian, Sebastian Ordyniak 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 28:1–28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [bibtex] [pdf]
[10]	Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas, Éric Grégoire, Miltiadis Alamaniotis, eds.), pages 733–737, 2018, IEEE. [bibtex] [pdf] [doi]
[11]	Unary Integer Linear Programming with Structural Restrictions Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 1284–1290, 2018, ijcai.org. [bibtex] [pdf]
[12]	Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider 2018, Technical report AC-TR-18-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2017

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

2016

[1]	Are There Any Good Digraph Measures? Robert Ganian, Petr Hlinen\' y, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar Journal of Combinatorial Theory, Series B, volume 116, pages 250–286, 2016. [bibtex]
[2]	FO Model Checking of Interval Graphs Robert Ganian, Petr Hlinen\' y, Daniel Kr\' al, Jan Obdrzálek, Jarett Schwartz, Jakub Teska Logical Methods in Computer Science, volume 11, number 4, 2016. [bibtex] [pdf]
[3]	Meta-Kernelization with Structural Parameters Robert Ganian, Friedrich Slivovsky, Stefan Szeider Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016. [bibtex] [pdf] [doi]
[4]	Model Checking Existential Logic on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider ACM Transactions on Computational Logic, volume 17, number 2, 2016. [bibtex] [doi]
[5]	Quantified Conjunctive Queries on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider Theoretical Computer Science, volume 618, pages 72–84, 2016. [bibtex] [pdf] [doi]
[6]	A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eduard Eiben, Robert Ganian, O-joung Kwon Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of LIPIcs, pages 34:1–34:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [bibtex] [pdf]
[7]	Backdoors to Tractable Valued CSP Robert Ganian, M.S. Ramanujan, Stefan Szeider Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher, ed.), volume 9892 of Lecture Notes in Computer Science, pages 233–250, 2016, Springer Verlag. [bibtex] [pdf] [doi]
[8]	Counting Linear Extensions: Parameterizations by Treewidth Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak 24th European Symposium of Algorithms, ESA 2016, volume 57 of LIPIcs, pages 39:1–39:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [bibtex] [pdf]
[9]	Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Robert Ganian, M. S. Ramanujan, Stefan Szeider 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. [bibtex] [pdf] [doi]
[10]	On Existential MSO and its Relation to ETH Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1–42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. [bibtex] [pdf] [doi]
[11]	On the Complexity Landscape of Connected f-factor Problems Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C.S. Rahul, Ramanujan M. S. Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), pages 41:1–41:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [bibtex] [pdf]
[12]	Polynomial-Time Construction of Optimal MPI Derived Datatype Trees Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 638–647, 2016, IEEE Computer Society. [bibtex] [pdf] [doi]
[13]	The Complexity Landscape of Decompositional Parameters for ILP Robert Ganian, Sebastian Ordyniak Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 710–716, 2016, AAAI Press. [bibtex] [pdf]
[14]	Using Decomposition-Parameters for QBF: Mind the Prefix! Eduard Eiben, Robert Ganian, Sebastian Ordyniak Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 964–970, 2016, AAAI Press. [bibtex] [pdf]

2015

[1]	Improving Vertex Cover as a Graph Parameter Robert Ganian Discrete Mathematics \& Theoretical Computer Science, volume 17, number 2, pages 77–100, 2015. [bibtex]
[2]	Algorithmic Applications of Tree-Cut Width Robert Ganian, Eun Jung Kim, Stefan Szeider 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. [bibtex] [pdf] [doi]
[3]	Community Structure Inspired Algorithms for SAT and \#SAT Robert Ganian, Stefan Szeider 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule, Sean Weaver, eds.), pages 223-237, 2015, Springer Verlag. [bibtex] [pdf] [doi]
[4]	Meta-Kernelization using Well-Structured Modulators Eduard Eiben, Robert Ganian, Stefan Szeider Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt, Iyad A. Kanj, eds.), volume 43 of LIPIcs, pages 114–126, 2015. [bibtex] [pdf] [doi]
[5]	On the Complexity of Rainbow Coloring Problems Eduard Eiben, Robert Ganian, Juho Lauri Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers (Zsuzsanna Lipták, William F. Smyth, eds.), pages 209–220, 2015. [bibtex] [pdf] [doi]
[6]	Parameterized Complexity of Asynchronous Border Minimization Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (Rahul Jain, Sanjay Jain, Frank Stephan, eds.), volume 9076 of Lecture Notes in Computer Science, pages 428–440, 2015, Springer. [bibtex] [pdf] [doi]
[7]	Solving Problems on Graphs of High Rank-Width Eduard Eiben, Robert Ganian, Stefan Szeider Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314–326, 2015, Springer Verlag. [bibtex] [pdf] [doi]

2014

[1]	Digraph width measures in parameterized algorithmics Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith Discrete Applied Mathematics, volume 168, pages 88–107, 2014. [bibtex]
[2]	Lower bounds on the complexity of MSO1 model-checking Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar J. Comput. Syst. Sci., volume 80, number 1, pages 180–194, 2014. [bibtex]
[3]	Model checking existential logic on partially ordered sets Simone Bova, Robert Ganian, Stefan Szeider 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, Dale Miller, eds.), pages 21:1–21:10, 2014, ACM. [bibtex] [pdf] [doi]
[4]	Quantified Conjunctive Queries on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 122–134, 2014, Springer Verlag. [bibtex] [pdf] [doi]

2013

[1]	A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width Robert Ganian, Petr Hlinený, Jan Obdrzálek Eur. J. Comb., volume 34, number 3, pages 680–701, 2013. [bibtex]
[2]	Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Robert Ganian, Petr Hlinený, Jan Obdrzálek Fundam. Inform., volume 123, number 1, pages 59–76, 2013. [bibtex]
[3]	Cops-and-robbers: remarks and problems Michel Boyer, Sif El Harti, Amal El Ouarari, Robert Ganian, Tomas Gavenciak, Gena Hahn, Carsten Moldenauer, Ignaz Rutter, Benoit Theriault, Martin Vatshelle Journal of Combinatorial Mathematics and Combinatorial Computing, volume 85, pages 141–159, 2013. [bibtex]
[4]	Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes Robert Ganian, Jan Obdrzálek 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. [bibtex]
[5]	FO Model Checking of Interval Graphs Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska 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. [bibtex]
[6]	Meta-kernelization with Structural Parameters Robert Ganian, Friedrich Slivovsky, Stefan Szeider Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 457-468, 2013, Springer Verlag. [bibtex] [doi]

2012

[1]	Lower Bounds on the Complexity of MSO1 Model-Checking Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar 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. [bibtex]
[2]	When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai 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. [bibtex]

2011

[1]	Clique-width: When Hard Does Not Mean Impossible Robert Ganian, Petr Hlinený, Jan Obdrzálek 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. [bibtex]
[2]	New Results on the Complexity of the Max- and Min-Rep Problems Robert Ganian SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, volume 6543 of Lecture Notes in Computer Science, pages 238–247, 2011, Springer. [bibtex]
[3]	Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics Robert Ganian 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. [bibtex]

2010

[1]	On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width Robert Ganian, Petr Hlinený Discrete Applied Mathematics, volume 158, number 7, pages 851–867, 2010. [bibtex]
[2]	Are There Any Good Digraph Width Measures? Robert Ganian, Petr Hliněný, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar 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. [bibtex]
[3]	Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Robert Ganian, Petr Hlinený, Jan Obdrzálek 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. [bibtex]
[4]	New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes Robert Ganian, Petr Hlinený SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings, volume 5901 of Lecture Notes in Computer Science, pages 428–439, 2010, Springer. [bibtex]
[5]	Thread Graphs, Linear Rank-Width and Their Algorithmic Applications Robert Ganian 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. [bibtex]

2009

[1]	Better Polynomial Algorithms on Graphs of Bounded Rank-Width Robert Ganian, Petr Hliněný Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pages 266–277, 2009, Springer. [bibtex]
[2]	On Digraph Width Measures in Parameterized Algorithmics Robert Ganian, Petr Hliněný, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith 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. [bibtex]
[3]	The Parameterized Complexity of Oriented Colouring Robert Ganian 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. [bibtex]

2008

[1]	Automata approach to graphs of bounded rank-width Robert Ganian, Petr Hlinený Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA 2008, September 13-15, 2008, Nagoya, Japan, pages 4–15, 2008, College Publications. [bibtex]

Publications: Sara Di Bartolomeo

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	$F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Sara Di Bartolomeo IEEE Trans. Vis. Comput. Graph., volume 32, number 1, pages 747–757, 2026. [bibtex] [pdf] [doi]
[2]	ARCOL: Aspect Ratio Constrained Orthogonal Layout Zainab Alsuwaykit, Yousef Loay Rajeh, Alexandre Kouyoumdjian, Steve Kieffer, Dominik Engel, Sara Di Bartolomeo, Martin Nöllenburg, Ivan Viola Comput. Graph. Forum, 2026. [bibtex] [doi]
[3]	The Story(line) So Far: A Survey on Storyline Visualization Sara Di Bartolomeo, Alexander Dobler, Velitchko Filipov, Martin Nöllenburg, Henry Ehlers Comput. Graph. Forum, volume 45, number 3, 2026. [bibtex] [doi]

2025

[1]	Optimizing Staircase Motifs in Biofabric Network Layouts Sara Di Bartolomeo, Markus Wallinger, Martin Nöllenburg Comput. Graph. Forum, pages e70139, 2025. [bibtex] [doi]
[2]	F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Sara Di Bartolomeo 2025, Technical report AC-TR-25-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

Publications: Simon Dominik Fink

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. [bibtex] [doi]
[2]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex]
[3]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[4]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. [bibtex] [doi]

2025

[1]	Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman, eds.), volume 351 of LIPIcs, pages 15:1–15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex] [pdf] [doi]
[2]	PACE Solver Description: Bad Dominating Set Maker Alexander Dobler, Simon Dominik Fink, Mathis Rocton 20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal, Erik Jan van Leeuwen, eds.), pages 35:1–35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	Partial Level Planarity Parameterized by the Size of the Missing Graph Thomas Depian, Simon D. Fink, Boris Klemz, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. [bibtex]
[4]	Pathways to Tractability for Geometric Thickness Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. [bibtex] [doi]
[5]	Pathways to Tractability for Geometric Thickness (Best Paper Award) Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg 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álovic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. [bibtex] [pdf] [doi]
[6]	Structural Parameterizations of Simultaneous Planarity Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, eds.), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[7]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. [bibtex] [pdf] [doi]

2024

[1]

The Parameterized Complexity of Extending Stack Layouts
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

[2]

The Parameterized Complexity Of Extending Stack Layouts
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

2015

[1]	Many-to-One Boundary Labeling with Backbones Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015. [bibtex] [pdf] [doi]

2013

[1]	Drawing Metro Maps using Bézier Curves Martin Fink, Herman Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg. [bibtex] [doi]
[2]	Many-to-One Boundary Labeling with Backbones Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]

Publications: Simon Wietheger

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Fair Correlation Clustering Meets Graph Parameters Johannes Blaha, Robert Ganian, Katharina Gillig, Jonathan Højlev, Simon Wietheger Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026), 2026. Note: to appear [bibtex]
[2]	Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy Robert Ganian, Marlene Gründel, Simon Wietheger Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR. Note: to appear [bibtex]
[3]	Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity Robert Ganian, Hung P. Hoang, Simon Wietheger Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 19108–19116, 2026, AAAI Press. [bibtex] [pdf] [doi]
[4]	Parameterized Complexity of Efficient Sortation Robert Ganian, Hung Hoang, Simon Wietheger 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]

2025

[1]	A Structural Complexity Analysis of Hierarchical Task Network Planning Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger 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. [bibtex] [pdf] [doi]
[2]	Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms Simon Wietheger, Benjamin Doerr Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025 (Bogdan Filipic, ed.), pages 85–86, 2025, ACM. [bibtex] [pdf] [doi]
[3]	Training One-Dimensional Graph Neural Networks is NP-Hard Robert Ganian, Mathis Rocton, Simon Wietheger The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. [bibtex] [pdf]

2024

[1]

Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem
Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger
Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024 (Xiaodong Li, Julia Handl, eds.), pages 27–28, 2024, ACM.
[bibtex] [pdf] [doi]

[2]

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
Simon Wietheger, Benjamin Doerr
Parallel Problem Solving from Nature - PPSN XVIII - 18th International Conference, PPSN 2024, Hagenberg, Austria, September 14-18, 2024, Proceedings, Part IV (Michael Affenzeller, Stephan M. Winkler, Anna V. Kononova, Heike Trautmann, Tea Tusar, Penousal Machado, Thomas Bäck, eds.), volume 15151 of Lecture Notes in Computer Science, pages 153–168, 2024, Springer.
[bibtex] [pdf] [doi]

Publications: Stefan Szeider

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	A General Theoretical Framework for Learning Smallest Interpretable Models Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider Artificial Intelligence, volume 350, pages 104441, 2026. [bibtex] [pdf] [doi]
[2]	Backdoors to Satisfaction Continued Serge Gaspers, Stefan Szeider Computer Science Review, volume 60, pages 100868, 2026. [bibtex] [pdf] [doi]
[3]	From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Algorithmica, volume 88, number 1, pages 8, 2026. [bibtex] [pdf] [doi]
[4]	OBDDs, SDDs, and Circuits of Bounded Width: Completeness Matters Alexis De Colnet, Sebastian Ordyniak, Stefan Szeider Artificial Intelligence, volume 351, pages 104458, 2026. [bibtex] [pdf] [doi]
[5]	Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Design Hai Xia, Carla P. Gomes, Bart Selman, Stefan Szeider Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear; preprint: CoRR abs/2603.08322, https://arxiv.org/abs/2603.08322 [bibtex]
[6]	Algorithm Selection with Zero Domain Knowledge via Text Embeddings Stefan Szeider Proceedings of the International Conference on Automated Machine Learning, AutoML 2026, September 28 – October 1, 2026, Ljubljana, Slovenia, 2026. Note: To appear; preprint: CoRR abs/2604.19753, https://arxiv.org/abs/2604.19753 [bibtex]
[7]	ASP-Bench: From Natural Language to Logic Programs Stefan Szeider Proceedings of the 2nd IEEE/ACM International Workshop on Neuro-Symbolic Software Engineering (NSE '26), pages 1–8, 2026, ACM. Note: Preprint: CoRR abs/2602.01171, https://arxiv.org/abs/2602.01171. Extended abstract in Proceedings 42nd International Conference on Logic Programming, ICLP 2026, EPTCS 450, pages 104–118, https://doi.org/10.4204/EPTCS.450.10 [bibtex] [pdf] [doi]
[8]	Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms Sebastian Ordyniak, Mateusz Rychlicki, Stefan Szeider Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 24622–24629, 2026, AAAI Press. [bibtex] [pdf] [doi]
[9]	ContReAct: A Feedback-Based Architecture for Continuous Agentic Operation Stefan Szeider Proceedings of the 2026 International Workshop on Agentic Engineering (AGENT '26), pages 56–62, 2026, ACM. [bibtex] [pdf] [doi]
[10]	CP-Agent: Agentic Constraint Programming Stefan Szeider Proceedings of the 3rd International Workshop on Large Language Models for Code (LLM4Code '26), pages 6–13, 2026, ACM. Note: Preprint: CoRR abs/2508.07468, https://arxiv.org/abs/2508.07468 [bibtex] [pdf] [doi]
[11]	Formally Verified Graph Generation with SAT Modulo Symmetries and Lean Markus Kirchweger, Pablo Manrique, Stefan Szeider Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part I (Armin Biere, Carsten Lutz, Sara Negri, eds.), volume 16688 of Lecture Notes in Computer Science, pages 117–135, 2026, Springer. [bibtex] [pdf] [doi]
[12]	Graph Choosability via SAT: Beyond the Nullstellensatz Markus Kirchweger, Tomás Peitl, David Seka, Stefan Szeider Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 14269–14277, 2026, AAAI Press. [bibtex] [pdf] [doi]
[13]	LLM-Guided Graph Generation for Structure-Based Local Improvement Methods Hai Xia, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear; preprint: CoRR abs/2608.13333, https://arxiv.org/abs/2608.13333 [bibtex]
[14]	LLM-Guided Semantic Vtrees for SDD Compilation Alexis de Colnet, Stefan Szeider Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear [bibtex]
[15]	MaxSAT-Based Compression for Tsetlin Machines Stefan Szeider Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, July 6–11, 2026, Seoul, South Korea, 2026. Note: To appear [bibtex]
[16]	Neurosymbolic Discovery of Algebraic Graph Constructions David Seka, Stefan Szeider Proceedings of the 20th Conference on Neurosymbolic Learning and Reasoning (NeSy 2026), 2026. Note: To appear; preprint: CoRR abs/2608.08118, https://arxiv.org/abs/2608.08118 [bibtex]
[17]	Smart Cubing for Graph Search: A Comparative Study Markus Kirchweger, Hai Xia, Tomás Peitl, Stefan Szeider 32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 33:1–33:19, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: Preprint: CoRR abs/2501.17201, https://arxiv.org/abs/2501.17201 [bibtex] [pdf] [doi]
[18]	Streamliners for Answer Set Programming Florentina Voboril, Martin Gebser, Stefan Szeider, Alice Tarzariol Proceedings 42nd International Conference on Logic Programming, ICLP 2026, Lisbon, Portugal, 20-23rd July 2026 (Wolfgang Faber, Laura Giordano, Ricardo Rocha, Vítor Santos Costa, eds.), volume 450 of EPTCS, pages 236–255, 2026. Note: Preprint: CoRR abs/2604.19251, https://arxiv.org/abs/2604.19251 [bibtex] [pdf] [doi]
[19]	Synthesizing Feature Extractors: An Agentic Approach for Algorithm Selection Hai Xia, Carlos Ansótegui, Stefan Szeider Proceedings of the International Conference on Automated Machine Learning, AutoML 2026, September 28 – October 1, 2026, Ljubljana, Slovenia, 2026. Note: To appear; preprint: CoRR abs/2608.17170, https://arxiv.org/abs/2608.17170 [bibtex]
[20]	VIPR Certificate Construction from Black-Box ILP Solvers Stefan Szeider 32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 52:1–52:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2025

[1]	Generating Streamlining Constraints with Large Language Models Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider Journal of Artificial Intelligence Research, volume 84, pages 16:1–16:19, 2025. Note: Abstract reprint in AAAI 2026, page 39900 [bibtex]
[2]	Analyzing Reformulation Performance in Core-Guided MaxSAT Solving André Schidler, Stefan Szeider 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland (Jeremias Berg, Jakob Nordström, eds.), volume 341 of LIPIcs, pages 26:1–26:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	Balancing Latin Rectangles with LLM-Generated Streamliners Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider 31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda, ed.), volume 340 of LIPIcs, pages 36:1–36:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[4]	Breaking Symmetries in Quantified Graph Search: A Comparative Study Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 11246–11254, 2025, AAAI Press. [bibtex] [pdf] [doi]
[5]	Bridging Language Models and Symbolic Solvers via the Model Context Protocol Stefan Szeider 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland (Jeremias Berg, Jakob Nordström, eds.), volume 341 of LIPIcs, pages 30:1–30:12, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[6]	Extracting Problem Structure with LLMs for Optimized SAT Local Search André Schidler, Stefan Szeider SOCS 2025, The 18th International Symposium on Combinatorial Search. August 12-15, 2025. University of Glasgow, Scotland, United Kingdom, 2025. [bibtex] [pdf]
[7]	Large and Parallel Human Sorting Networks Stefan Szeider Creative Mathematical Sciences Communication (Henning Fernau, Inge Schwank, Jacqueline Staub, eds.), pages 194–204, 2025, Springer Nature Switzerland. [bibtex] [doi]
[8]	Optimal Decision Tree Pruning Revisited: Algorithms and Complexity Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13-19, 2025, 2025, OpenReview.net. [bibtex] [pdf]
[9]	SAT Modulo Symmetries: A Survey Stefan Szeider Satisfiability Checking and Symbolic Computation, 10th International Workshop, SC-Square 2025, Stuttgart, Germany, August 2, 2025, co-located with CADE 2025, volume 4116 of CEUR Workshop Proceedings, pages 1–11, 2025, CEUR-WS.org. [bibtex] [pdf]
[10]	StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider 2025 IEEE/ACM 1st International Workshop on Neuro-Symbolic Software Engineering (NSE), pages 17-22, 5 2025, IEEE. [bibtex] [pdf] [doi]
[11]	The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators Tianwei Zhang, Stefan Szeider 31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda, ed.), volume 340 of LIPIcs, pages 39:1–39:19, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[12]	Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach Carlos Ansótegui, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia Computational Science - ICCS 2025 - 25th International Conference, Singapore, July 7-9, 2025, Proceedings, Part II (Michael H. Lees, Wentong Cai, Siew Ann Cheong, Yi Su, David Abramson, Jack J. Dongarra, Peter M. A. Sloot, eds.), volume 15904 of Lecture Notes in Computer Science, pages 35–49, 2025, Springer. [bibtex] [pdf] [doi]

2024

[1]	Backdoor DNFs Sebastian Ordyniak, Andre Schidler, Stefan Szeider Journal of Computer and System Sciences, volume 144, pages 103547, 2024. [bibtex] [doi]
[2]	SAT backdoors: Depth beats size Jan Dreier, Sebastian Ordyniak, Stefan Szeider Journal of Computer and System Sciences, volume 142, pages 103520, 2024. [bibtex] [doi]
[3]	SAT Modulo Symmetries for Graph Generation and Enumeration Markus Kirchweger, Stefan Szeider ACM Transactions on Computational Logic, volume 25, number 3, 2024. [bibtex] [doi]
[4]	SAT-based Decision Tree Learning for Large Data Sets André Schidler, Stefan Szeider Journal of Artificial Intelligence Research, volume 80, pages 875–918, 2024. [bibtex]
[5]	Satisfiability Modulo User Propagators Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere Journal of Artificial Intelligence Research, volume 81, pages 989–1017, 2024. [bibtex] [pdf] [doi]
[6]	A General Theoretical Framework for Learning Smallest Interpretable Models Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 10662–10669, 2024, AAAI Press. [bibtex] [pdf] [doi]
[7]	ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP Leroy Chew, Alexis de Colnet, Stefan Szeider Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 253–263, 8 2024. [bibtex] [pdf] [doi]
[8]	Compilation and Fast Model Counting beyond CNF Alexis de Colnet, Stefan Szeider, Tianwei Zhang Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3315–3323, 8 2024, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track [bibtex] [doi]
[9]	Computing small Rainbow Cycle Numbers with SAT modulo Symmetries Markus Kirchweger, Stefan Szeider The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex]
[10]	eSLIM: Circuit Minimization with SAT Based Local Improvement Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1–23:14, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[11]	Explaining Decisions in ML Models: A Parameterized Complexity Analysis Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 563–573, 8 2024. [bibtex] [pdf] [doi]
[12]	Hardness of Random Reordered Encodings of Parity for Resolution and CDCL Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 7978–7986, 2024, AAAI Press. [bibtex] [pdf] [doi]
[13]	Learning Small Decision Trees for Data of Low Rank-Width Konrad Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 10476–10483, 2024, AAAI Press. [bibtex] [pdf] [doi]
[14]	Revisiting Causal Discovery from a Complexity-Theoretic Perspective Robert Ganian, Viktoriia Korchemna, Stefan Szeider Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3377–3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track [bibtex] [doi]
[15]	SAT-Based Tree Decomposition with Iterative Cascading Policy Selection Hai Xia, Stefan Szeider AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 8191–8199, 2024, AAAI Press. [bibtex] [pdf] [doi]
[16]	Small unsatisfiable k-CNFs with bounded literal occurrence Tianwei Zhang, Tomáš Peitl, Stefan Szeider 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[17]	Structure-guided Local Improvement for Maximum Satisfiability André Schidler, Stefan Szeider The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex]
[18]	The Power of Collaboration: Learning Large Bayesian Networks at Scale Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia 2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), pages 371-378, 2024. [bibtex] [doi]
[19]	Improved Circuit Minimization with Exact Synthesis Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider 2024, Technical report AC-TR-24-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2023

[1]	Are Hitting Formulas Hard for Resolution? Tomáš Peitl, Stefan Szeider Discr. Appl. Math., volume 337, pages 173–184, 2023. [bibtex] [doi]
[2]	Computing optimal hypertree decompositions with SAT André Schidler, Stefan Szeider Artificial Intelligence, volume 325, pages 104015, 2023. [bibtex] [pdf] [doi]
[3]	CSP beyond tractable constraint languages Jan Dreier, Sebastian Ordyniak, Stefan Szeider Constraints, volume 28, number 3, pages 450–471, 2023. [bibtex] [pdf] [doi]
[4]	On the parameterized complexity of clustering problems for incomplete data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Journal of Computer and System Sciences, volume 134, pages 1–19, 2023. [bibtex] [doi]
[5]	SAT-Boosted Tabu Search for Coloring Massive Graphs Andre Schidler, Stefan Szeider J. Exp. Algorithmics, volume 2825, number 1.5, pages 1–19, 2023. [bibtex] [doi]
[6]	The Silent (R)evolution of SAT Johannes K. Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider Communications of the ACM, volume 66, number 6, pages 64–72, June 2023. [bibtex] [doi]
[7]	A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture Markus Kirchweger, Tomáš Peitl, Stefan Szeider 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 13:1–13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[8]	Circuit Minimization with Exact Synthesis: From QBF Back to SAT Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider Proceedings of the 32nd International Workshop on Logic \& Synthesis (IWLS), 2023. [bibtex]
[9]	Circuit Minimization with QBF-Based Exact Synthesis Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider 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, Yiling Chen, Jennifer Neville, eds.), pages 4087–4094, 2023, AAAI Press. [bibtex] [pdf] [doi]
[10]	Co-Certificate Learning with SAT Modulo Symmetries Markus Kirchweger, Tomáš Peitl, Stefan Szeider 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 [bibtex] [pdf] [doi]
[11]	Computing twin-width with SAT and branch \& bound Andre Schidler, Stefan Szeider The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind, ed.), pages 2013–2021, 2023, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track [bibtex] [pdf] [doi]
[12]	From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 16:1–16:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[13]	Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity Johannes K. Fichte, Markus Hecher, Stefan Szeider 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, Yiling Chen, Jennifer Neville, eds.), pages 6363–6371, 2023, AAAI Press. [bibtex] [pdf] [doi]
[14]	IPASIR-UP: User Propagators for CDCL Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 8:1–8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [doi]
[15]	Learning Small Decision Trees with Large Domain Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind, ed.), pages 3184–3192, 2023, International Joint Conferences on Artificial Intelligence Organization. Note: Main Track [bibtex] [pdf] [doi]
[16]	Proven optimally-balanced Latin rectangles with SAT Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 48:1–48:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[17]	SAT-Based Generation of Planar Graphs Markus Kirchweger, Manfred Scheucher, Stefan Szeider The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 14:1–14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [doi]
[18]	Searching for smallest universal graphs and tournaments with SAT Tianwei Zhang, Stefan Szeider Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 39:1–39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[19]	The Computational Complexity of Concise Hypersphere Classification Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Proceedings of the 40th International Conference on Machine Learning, ICML 2023, pages 9060–9070, 2023, PMLR. [bibtex] [pdf]
[20]	The Parameterized Complexity of Finding Concise Local Explanations Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 3312–3320, 2023, ijcai.org. [bibtex] [pdf] [doi]

2022

[1]	Algorithmic Applications of Tree-Cut Width Robert Ganian, Eun Jung Kim, Stefan Szeider SIAM J. Discrete Math., volume 36, number 4, pages 2635–2666, 2022. [bibtex] [pdf] [doi]
[2]	Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria Robert Ganian, Jan Kratochvíl, Stefan Szeider Discr. Appl. Math., volume 312, pages 1–2, 2022. [bibtex] [pdf]
[3]	Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider Journal of Artificial Intelligence Research, volume 33, pages 535–552, 2022. [bibtex] [pdf]
[4]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022. [bibtex] [pdf] [doi]
[5]	A SAT Approach to Twin-Width André Schidler, Stefan Szeider Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments (Cynthia A. Phillips, Bettina Speckmann, eds.), pages 67–77, 2022, SIAM. [bibtex] [doi]
[6]	A SAT Attack on Rota’s Basis Conjecture Markus Kirchweger, Manferd Scheucher, Stefan Szeider 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 4:1–4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[7]	CSP Beyond Tractable Constraint Languages Jan Dreier, Sebastian Ordyniak, Stefan Szeider 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (Christine Solnon, ed.), volume 235 of LIPIcs, pages 20:1–20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[8]	Finding a Cluster in Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[9]	Learning Large Bayesian Networks with Expert Constraints Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider 38th Conference on Uncertainty in Artificial Intelligence (UAI 2022), Eindhoven, Netherlands, August 1–5, 2022 (James Cussens, Kun Zhang, eds.), pages 180:1592–1601, 2022. [bibtex]
[10]	Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria Stefan Szeider, Robert Ganian, Alexandra Silva 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. [bibtex] [pdf]
[11]	SAT Backdoors: Depth Beats Size Jan Dreier, Sebastian Ordyniak, Stefan Szeider 30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 46:1–46:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[12]	Tractable Abstract Argumentation via Backdoor-Treewidth Wolfgang Dvorak, Markus Hecher, Matthias König, Andre Schidler, Stefan Szeider, Stefan Woltran Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pages 5608–5615, 2022, AAAI Press. [bibtex] [pdf]
[13]	Weighted Model Counting with Twin-Width Robert Ganian, Filip Pokrývka, Andre Schidler, Kirill Simonov, Stefan Szeider 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 15:1–15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2021

[1]	Finding the Hardest Formulas for Resolution Tomáš Peitl, Stefan Szeider Journal of Artificial Intelligence Research, volume 72, pages 69–97, 2021. Note: Conference Award Track, best paper CP 2020 [bibtex] [doi]
[2]	New Width Parameters for SAT and Sharp-SAT Robert Ganian, Stefan Szeider Artificial Intelligence, volume 295, pages 103460, 2021. [bibtex] [pdf] [doi]
[3]	Backdoor DNFs Sebastian Ordyniak, Andre Schidler, Stefan Szeider Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 1403–1409, 2021. [bibtex] [doi]
[4]	Certified DQBF Solving by Definition Extraction Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 499–517, 2021, Springer. [bibtex] [pdf] [doi]
[5]	Computing Optimal Hypertree Decompositions with SAT Andre Schidler, Stefan Szeider Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), 2021. [bibtex] [doi]
[6]	Finding the Hardest Formulas for Resolution (Extended Abstract) Tomáš Peitl, Stefan Szeider Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 4814–4818, 2021. Note: Sister Conferences Best Papers [bibtex] [doi]
[7]	Learning fast-inference Bayesian networks Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems (M. Ranzato, A. Beygelzimer, K. Nguyen, P.S. Liang, J.W. Vaughan, Y. Dauphin, eds.), pages 17852–17863, 2021. [bibtex] [pdf]
[8]	Parameterized Complexity of Small Decision Tree Learning Sebastian Ordyniak, Stefan Szeider Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 6454–6462, 2021, AAAI Press. [bibtex] [pdf]
[9]	SAT Modulo Symmetries for Graph Generation Markus Kirchweger, Stefan Szeider Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel, ed.), pages 39:1–-39:17, 2021, Dagstuhl Publishing. [bibtex] [doi]
[10]	SAT-based Decision Tree Learning for Large Data Sets André Schidler, Stefan Szeider Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3904–3912, 2021, AAAI Press. [bibtex] [pdf]
[11]	The Parameterized Complexity of Clustering Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296–7304, 2021, AAAI Press. [bibtex] [pdf]
[12]	Turbocharging Treewidth-Bounded Bayesian Network Structure Learning Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3895–3903, 2021, AAAI Press. [bibtex] [pdf]
[13]	Backdoor DNFs Sebastian Ordyniak, André Schidler, Stefan Szeider 2021, Technical report AC-TR-21-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[14]	Certified DQBF Solving by Definition Extraction Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider 2021, Technical report AC-TR-21-010, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[15]	Fixed-Parameter Tractability Marko Samer, Stefan Szeider Chapter in Handbook of Satisfiability, 2nd Edition (Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, eds.), pages 693–736, 2021, IOS Press. [bibtex] [pdf] [doi]
[16]	Fixed-Parameter Tractability Marko Samer, Stefan Szeider 2021, Technical report AC-TR-21-004, Algorithms and Complexity Group, TU Wien. Note: Chapter 17, Handbook of Satisfiability, 2nd Edition, 2021 [bibtex] [pdf]
[17]	Parameterized Complexity of Small Decision Tree Learning Sebastian Ordyniak, André Schidler, Stefan Szeider 2021, Technical report AC-TR-21-002, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[18]	SAT-based Decision Tree Learning for Large Data Sets André Schidler, Stefan Szeider 2021, Technical report AC-TR-21-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[19]	The Parameterized Complexity of Clustering Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 2021, Technical report AC-TR-21-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2020

[1]	On Existential MSO and Its Relation to ETH Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1–22:32, 2020. [bibtex] [pdf] [doi]
[2]	A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 267–276, 2020, Springer Verlag. [bibtex]
[3]	A Time Leap Challenge for SAT-Solving Johannes K. Fichte, Markus Hecher, Stefan Szeider Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 267–285, 2020, Springer Verlag. [bibtex]
[4]	Breaking Symmetries with RootClique and LexTopsort Johannes K. Fichte, Markus Hecher, Stefan Szeider Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 286–303, 2020, Springer Verlag. [bibtex]
[5]	Computing Optimal Hypertree Decompositions André Schidler, Stefan Szeider Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments (Guy Blelloch, Irene Finocchi, eds.), pages 1–11, 2020, SIAM. [bibtex]
[6]	Finding the Hardest Formulas for Resolution Tomáš Peitl, Stefan Szeider Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 514–530, 2020, Springer Verlag. Note: Best Paper Award [bibtex]
[7]	Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Robert Ganian, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020. [bibtex] [pdf]
[8]	Formalizing Graph Trail Properties in Isabelle/HOL Laura Kovács, Hanna Lachnitt, Stefan Szeider Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings (Christoph Benzmüller, Bruce R. Miller, eds.), volume 12236 of Lecture Notes in Computer Science, pages 190–205, 2020, Springer Verlag. [bibtex]
[9]	MaxSAT-Based Postprocessing for Treedepth Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 478–495, 2020, Springer Verlag. [bibtex] [doi]
[10]	On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906–3913, 2020, AAAI Press. [bibtex] [pdf]
[11]	Short Q-Resolution Proofs with Homomorphisms Ankit Shukla, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 412–428, 2020, Springer Verlag. [bibtex]
[12]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider 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. [bibtex] [pdf] [doi]
[13]	A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth Friedrich Slivovsky, Stefan Szeider 2020, Technical report AC-TR-20-006, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[14]	Breaking Symmetries with RootClique and LexTopsort Johannes K. Fichte, Markus Hecher, Stefan Szeider 2020, Technical report AC-TR-20-010, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[15]	Computing Optimal Hypertree Decompositions André Schidler, Stefan Szeider 2020, Technical report AC-TR-20-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[16]	Finding the Hardest Formulas for Resolution Tomáš Peitl, Stefan Szeider 2020, Technical report AC-TR-20-008, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[17]	Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Robert Ganian, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2020, Technical report AC-TR-20-011, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[18]	Formalizing Graph Trail Properties in Isabelle/HOL Laura Kovács, Hanna Lachnitt, Stefan Szeider 2020, Technical report AC-TR-20-012, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[19]	MaxSAT-Based Postprocessing for Treedepth Vaidyanathan P. R., Stefan Szeider 2020, Technical report AC-TR-20-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[20]	On the Parameterized Complexity of Clustering Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 2020, Technical report AC-TR-20-002, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[21]	Short Q-Resolution Proofs with Homomorphisms Ankit Shukla, Friedrich Slivovsky, Stefan Szeider 2020, Technical report AC-TR-20-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[22]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider 2020, Technical report AC-TR-20-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2019

[1]	A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1–15:24, 2019. [bibtex] [pdf] [doi]
[2]	Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy Ronald de Haan, Stefan Szeider MDPI Algorithms, volume 12, number 9, pages 1–28, 2019. [bibtex] [doi]
[3]	Dependency Learning for QBF Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Journal of Artificial Intelligence Research, volume 65, pages 180–208, 2019. [bibtex] [pdf] [doi]
[4]	Long-Distance Q-Resolution with Dependency Schemes Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. [bibtex] [pdf] [doi]
[5]	On the Parameterized Complexity of (k,s)-SAT Daniël~Paulusma, Stefan Szeider Information Processing Letters, volume 143, pages 34–36, 2019. [bibtex] [doi]
[6]	A Join-Based Hybrid Parameter for Constraint Satisfaction Robert Ganian, Sebastian Ordyniak, Stefan Szeider Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex, Simon de Givry, eds.), volume 11802 of Lecture Notes in Computer Science, pages 195–212, 2019, Springer Verlag. [bibtex] [pdf] [doi]
[7]	Combining Resolution-Path Dependencies with Dependency Learning Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 306–318, 2019, Springer Verlag. [bibtex] [doi]
[8]	Proof Complexity of Fragments of Long-Distance Q-resolution Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag. [bibtex] [doi]
[9]	SAT-Encodings for Treecut Width and Treedepth Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov, Henning Meyerhenke, eds.), pages 117–129, 2019, SIAM. [bibtex] [pdf] [doi]
[10]	The Parameterized Complexity of Cascading Portfolio Scheduling Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Emily B. Fox, Roman Garnett, eds.), pages 7666–7676, 2019. [bibtex] [pdf]
[11]	A Join-Based Hybrid Parameter for Constraint Satisfaction Robert Ganian, Sebastian Ordyniak, Stefan Szeider 2019, Technical report AC-TR-19-006, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[12]	A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider 2019, Technical report AC-TR-19-010, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[13]	Combining Resolution-Path Dependencies with Dependency Learning Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2019, Technical report AC-TR-19-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[14]	Proof Complexity of Fragments of Long-Distance Q-resolution Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2019, Technical report AC-TR-19-004, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[15]	SAT-Encodings for Treecut Width and Treedepth Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider 2019, Technical report AC-TR-19-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[16]	The Parameterized Complexity of Cascading Portfolio Scheduling Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider 2019, Technical report AC-TR-19-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2018

[1]	Meta-kernelization using well-structured modulators Eduard Eiben, Robert Ganian, Stefan Szeider Discr. Appl. Math., volume 248, pages 153–167, 2018. [bibtex] [pdf] [doi]
[2]	Solving Problems on Graphs of High Rank-Width Eduard Eiben, Robert Ganian, Stefan Szeider Algorithmica, volume 80, number 2, pages 742–771, 2018. [bibtex] [pdf] [doi]
[3]	An SMT Approach to Fractional Hypertree Width Johannes K. Fichte, Markus Hecher, Neha Lodha, Stefan Szeider Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 109–127, 2018, Springer Verlag. [bibtex] [doi]
[4]	Parameterized Algorithms for the Matrix Completion Problem Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider 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 [bibtex] [pdf]
[5]	Polynomial-Time Validation of QCDCL Certificates Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK (Olaf Beyersdorff, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 253–269, 2018, Springer Verlag. [bibtex] [pdf] [doi]
[6]	Portfolio-Based Algorithm Selection for Circuit QBFs Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 195–209, 2018, Springer Verlag. [bibtex] [doi]
[7]	Portfolio-Based Algorithm Selection for Circuit QBFs Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider QBF Workshop, 2018. [bibtex]
[8]	Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas, Éric Grégoire, Miltiadis Alamaniotis, eds.), pages 733–737, 2018, IEEE. [bibtex] [pdf] [doi]
[9]	An SMT Approach to Fractional Hypertree Width Johannes K. Fichte, Markus Hecher, Neha Lodha, Stefan Szeider 2018, Technical report AC-TR-18-006, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[10]	On the Parameterized Complexity of (k,s)-SAT Daniël~Paulusma, Stefan Szeider 2018, Technical report AC-TR-18-008, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[11]	Polynomial-Time Validation of QCDCL Certificates Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2018, Technical report AC-TR-18-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[12]	Portfolio Solvers for QDIMACS and QCIR Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2018. Note: QBF Evaluation at SAT [bibtex]
[13]	Portfolio-Based Algorithm Selection for Circuit QBFs Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2018, Technical report AC-TR-18-004, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[14]	Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider 2018, Technical report AC-TR-18-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2017

[1]	Backdoors into heterogeneous classes of SAT and CSP Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Journal of Computer and System Sciences, volume 85, pages 38–56, 2017. [bibtex] [pdf] [doi]
[2]	Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Robert Ganian, M. S. Ramanujan, Stefan Szeider ACM Transactions on Algorithms, volume 13, number AC-TR-17-016, pages 29:1–29:32, 2017. [bibtex] [pdf] [doi]
[3]	On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances Ronald de Haan, Iyad Kanj, Stefan Szeider ACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017. [bibtex] [doi]
[4]	Parameterized Complexity Classes Beyond Para-NP Ronald de Haan, Stefan Szeider Journal of Computer and System Sciences, volume 87, number AC-TR-17-004, pages 16–57, 2017. [bibtex] [pdf] [doi]
[5]	The Treewidth of Proofs Moritz Müller, Stefan Szeider Information and Computation, volume 255, pages 147–164, 2017. [bibtex] [doi]
[6]	A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 4894–4898, 2017, ijcai.org. Note: Sister Conference Best Paper Track [bibtex] [pdf] [doi]
[7]	Backdoor Trees for Answer Set Programming Johannes Klaus Fichte, Stefan Szeider Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017, Espoo, Finland, July 3, 2017. (Bart Bogaerts, Amelia Harrison, eds.), volume 1868 of CEUR Workshop Proceedings, 2017, CEUR-WS.org. [bibtex] [pdf]
[8]	Backdoor Treewidth for SAT Robert Ganian, M. S. Ramanujan, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 20–37, 2017, Springer Verlag. [bibtex] [pdf] [doi]
[9]	Circuit Treewidth, Sentential Decision, and Query Compilation Simone Bova, Stefan Szeider Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017 (Emanuel Sallinger, Jan Van den Bussche, Floris Geerts, eds.), pages 233–246, 2017, ACM. [bibtex] [pdf] [doi]
[10]	Combining Treewidth and Backdoors for CSP Robert Ganian, M. S. Ramanujan, Stefan Szeider 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. [bibtex] [pdf] [doi]
[11]	Long-Distance Q-Resolution with Dependency Schemes Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 298–313, 2017, Springer Verlag. [bibtex] [pdf] [doi]
[12]	New Width Parameters for Model Counting Robert Ganian, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 38–52, 2017, Springer Verlag. [bibtex] [pdf] [doi]
[13]	Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable M. S. Ramanujan, Stefan Szeider Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3929–3935, 2017. [bibtex] [pdf]
[14]	SAT-Based Local Improvement for Finding Tree Decompositions of Small Width Johannes K. Fichte, Neha Lodha, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 401–411, 2017, Springer Verlag. [bibtex] [doi]
[15]	SAT-Encodings for Special Treewidth and Pathwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 429–445, 2017, Springer Verlag. [bibtex] [pdf] [doi]
[16]	Backdoor Sets for CSP Serge Gaspers, Sebastian Ordyniak, Stefan Szeider Chapter in The Constraint Satisfaction Problem: Complexity and Approximability (Andrei A. Krokhin, Stanislav Zivny, eds.), volume 7 of Dagstuhl Follow-Ups, pages 137–157, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [bibtex] [pdf] [doi]
[17]	Backdoor Treewidth for SAT Robert Ganian, M. S. Ramanujan, Stefan Szeider 2017, Technical report AC-TR-17-014, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[18]	Dependency Learning for QBF Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2017, Technical report AC-TR-17-011, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[19]	New Width Parameters for Model Counting Robert Ganian, Stefan Szeider 2017, Technical report AC-TR-17-013, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[20]	On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances Ronald de Haan, Iyad Kanj, Stefan Szeider 2017, Technical report AC-TR-17-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[21]	SAT-Based Local Improvement for Finding Tree Decompositions of Small Width Johannes K. Fichte, Neha Lodha, Stefan Szeider 2017, Technical report AC-TR-17-015, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[22]	SAT-Encodings for Special Treewidth and Pathwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider 2017, Technical report AC-TR-17-012, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[23]	The Treewidth of Proofs Moritz Müller, Stefan Szeider 2017, Technical report AC-TR-17-010, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2016

[1]	Backdoors to q-Horn Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider Algorithmica, volume 74, number 1, pages 540–557, 2016. [bibtex] [pdf] [doi]
[2]	Meta-Kernelization with Structural Parameters Robert Ganian, Friedrich Slivovsky, Stefan Szeider Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016. [bibtex] [pdf] [doi]
[3]	Model Checking Existential Logic on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider ACM Transactions on Computational Logic, volume 17, number 2, 2016. [bibtex] [doi]
[4]	Model Counting for CNF Formulas of Bounded Modular Treewidth Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider Algorithmica, volume 76, number 1, pages 168–194, 2016. [bibtex] [pdf] [doi]
[5]	Quantified Conjunctive Queries on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider Theoretical Computer Science, volume 618, pages 72–84, 2016. [bibtex] [pdf] [doi]
[6]	Quantifier reordering for QBF Friedrich Slivovsky, Stefan Szeider Journal of Automated Reasoning, volume 56, number 4, pages 459–477, 2016. [bibtex] [pdf] [doi]
[7]	Soundness of Q-resolution with dependency schemes Friedrich Slivovsky, Stefan Szeider Theoretical Computer Science, volume 612, pages 83–101, 2016. [bibtex] [pdf] [doi]
[8]	A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 179–195, 2016, Springer Verlag. [bibtex] [pdf] [doi]
[9]	Backdoors to Tractable Valued CSP Robert Ganian, M.S. Ramanujan, Stefan Szeider Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher, ed.), volume 9892 of Lecture Notes in Computer Science, pages 233–250, 2016, Springer Verlag. [bibtex] [pdf] [doi]
[10]	Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Robert Ganian, M. S. Ramanujan, Stefan Szeider 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. [bibtex] [pdf] [doi]
[11]	Long Distance Q-Resolution with Dependency Schemes Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 500–518, 2016, Springer Verlag. [bibtex] [pdf] [doi]
[12]	On Existential MSO and its Relation to ETH Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1–42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. [bibtex] [pdf] [doi]
[13]	Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics Ronald de Haan, Stefan Szeider Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral, James P. Delgrande, Frank Wolter, eds.), pages 453–462, 2016, AAAI Press. [bibtex] [pdf]
[14]	Polynomial-Time Construction of Optimal MPI Derived Datatype Trees Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 638–647, 2016, IEEE Computer Society. [bibtex] [pdf] [doi]
[15]	Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Ulle Endriss, Ronald de Haan, Stefan Szeider 2016, Technical report AC-TR-16-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[16]	Positive and Negative Results for Parameterized Compilability Simone Bova, Ronald de Haan, Neha Lodha, Stefan Szeider 2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2015

[1]	A complete parameterized complexity analysis of bounded planning Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider Journal of Computer and System Sciences, volume 81, number 7, pages 1311–1332, 2015. [bibtex] [pdf] [doi]
[2]	A SAT Approach to Clique-Width Marijn Heule, Stefan Szeider ACM Transactions on Computational Logic, volume 16, number 3, pages 24, 2015. [bibtex] [pdf] [doi]
[3]	Backdoors to Normality for Disjunctive Logic Programs Johannes Klaus Fichte, Stefan Szeider ACM Transactions on Computational Logic, volume 17, number 1, 2015. [bibtex] [doi]
[4]	Backdoors to Tractable Answer Set Programming Johannes Klaus Fichte, Stefan Szeider Artificial Intelligence, volume 220, pages 64–103, 3 2015. [bibtex] [doi]
[5]	On finding optimal polytrees Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider Theoretical Computer Science, volume 592, pages 49–58, 2015. [bibtex] [pdf] [doi]
[6]	On the Subexponential-Time Complexity of CSP Ronald de Haan, Iyad A. Kanj, Stefan Szeider Journal of Artificial Intelligence Research, volume 52, pages 203–234, 2015. [bibtex] [pdf] [doi]
[7]	Parameterized and subexponential-time complexity of satisfiability problems and applications Iyad A. Kanj, Stefan Szeider Theoretical Computer Science, volume 607, pages 282–295, 2015. [bibtex] [pdf] [doi]
[8]	Algorithmic Applications of Tree-Cut Width Robert Ganian, Eun Jung Kim, Stefan Szeider 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. [bibtex] [pdf] [doi]
[9]	Community Structure Inspired Algorithms for SAT and \#SAT Robert Ganian, Stefan Szeider 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule, Sean Weaver, eds.), pages 223-237, 2015, Springer Verlag. [bibtex] [pdf] [doi]
[10]	Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP Ronald de Haan, Stefan Szeider SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings, volume 8939 of Lecture Notes in Computer Science, pages 217–229, 1 2015, Springer Verlag. [bibtex] [pdf] [doi]
[11]	Meta-Kernelization using Well-Structured Modulators Eduard Eiben, Robert Ganian, Stefan Szeider Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt, Iyad A. Kanj, eds.), volume 43 of LIPIcs, pages 114–126, 2015. [bibtex] [pdf] [doi]
[12]	Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Ulle Endriss, Ronald de Haan, Stefan Szeider Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems (Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, Edith Elkind, eds.), pages 127–136, 2015, IFAAMAS/ACM. [bibtex] [pdf]
[13]	Solving Problems on Graphs of High Rank-Width Eduard Eiben, Robert Ganian, Stefan Szeider Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314–326, 2015, Springer Verlag. [bibtex] [pdf] [doi]
[14]	Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP Ronald de Haan, Stefan Szeider 2015, Technical report AC-TR-15-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[15]	Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics Ronald de Haan, Stefan Szeider 2015, Technical report AC-TR-15-002, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2014

[1]	Guarantees and limits of preprocessing in constraint satisfaction and reasoning Serge Gaspers, Stefan Szeider Artificial Intelligence, volume 216, pages 1-19, 2014. [bibtex] [doi]
[2]	Tractable answer-set programming with weight constraints: bounded treewidth is not enough Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran Theory Pract. Log. Program., volume 14, number 2, pages 141-164, 2014. [bibtex] [doi]
[3]	Backdoors into Heterogeneous Classes of SAT and CSP Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27-31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2652-2658, 2014, AAAI Press. [bibtex]
[4]	Fixed-Parameter Tractable Reductions to SAT Ronald de Haan, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Uwe Egly, Carsten Sinz, eds.), volume 8561 of Lecture Notes in Computer Science, pages 85-102, 2014, Springer Verlag. [bibtex] [pdf] [doi]
[5]	Model checking existential logic on partially ordered sets Simone Bova, Robert Ganian, Stefan Szeider 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, Dale Miller, eds.), pages 21:1–21:10, 2014, ACM. [bibtex] [pdf] [doi]
[6]	Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications Iyad A. Kanj, Stefan Szeider Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, eds.), volume 8881 of Lecture Notes in Computer Science, pages 637–651, 2014, Springer Verlag. [bibtex] [pdf] [doi]
[7]	Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Ulle Endriss, Ronald de Haan, Stefan Szeider Proceedings of ComSoc'14, Fifth International Workshop on Computational Social Choice Pittsburgh, Pennsylvania, June 23-25, 2014, pages 127–136, 2014. [bibtex] [pdf]
[8]	Quantified Conjunctive Queries on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 122–134, 2014, Springer Verlag. [bibtex] [pdf] [doi]
[9]	Small Unsatisfiable Subsets in Constraint Satisfaction Ronald de Haan, Iyad A. Kanj, Stefan Szeider 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014, pages 429–436, 2014, IEEE. [bibtex] [pdf] [doi]
[10]	Subexponential Time Complexity of CSP with Global Constraints Ronald de Haan, Iyad A. Kanj, Stefan Szeider Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings (Barry O'Sullivan, ed.), volume 8656 of Lecture Notes in Computer Science, pages 272-288, 2014, Springer Verlag. [bibtex] [pdf] [doi]
[11]	The Parameterized Complexity of Reasoning Problems Beyond NP Ronald de Haan, Stefan Szeider Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 (Chitta Baral, Giuseppe De Giacomo, Thomas Eiter, eds.), pages 82–91, 2014, AAAI Press. [bibtex] [pdf]
[12]	Variable Dependencies and Q-Resolution Friedrich Slivovsky, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Carsten Sinz, Uwe Egly, eds.), volume 8561 of Lecture Notes in Computer Science, pages 269–284, 2014, Springer Verlag. [bibtex] [doi]
[13]	Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy Ronald de Haan, Stefan Szeider 2014, Technical report TR14-143, Electronic Colloquium on Computational Complexity (ECCC). [bibtex] [pdf]

2013

[1]	Parameterized Complexity Results for Exact Bayesian Network Structure Learning Sebastian Ordyniak, Stefan Szeider Journal of Artificial Intelligence Research, volume 46, pages 263-302, 2013. [bibtex] [doi]
[2]	Satisfiability of acyclic and almost acyclic CNF formulas Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider Theoretical Computer Science, volume 481, pages 85-99, 2013. [bibtex] [doi]
[3]	A SAT Approach to Clique-Width Marijn Heule, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 318-334, 2013, Springer Verlag. [bibtex] [doi]
[4]	Backdoors to Abduction Andreas Pfandler, Stefan Rümmele, Stefan Szeider Proceedings of IJCAI 2013, the 23th International Joint Conference on Artificial Intelligence, August 3-9, 2013, Beijing, China, 2013. [bibtex]
[5]	Backdoors to Normality for Disjunctive Logic Programs Johannes Klaus Fichte, Stefan Szeider Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 320-337, 2013, The AAAI Press. [bibtex]
[6]	Backdoors to q-Horn Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 67-79, 2013, Leibniz-Zentrum fuer Informatik. [bibtex] [doi]
[7]	Capturing Structure in Hard Combinatorial Problems Stefan Szeider 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013, pages 897-898, 2013. Note: invited keynote talk [bibtex] [doi]
[8]	Local Backbones Ronald de Haan, Iyad A. Kanj, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 377-393, 2013, Springer Verlag. [bibtex] [pdf] [doi]
[9]	Meta-kernelization with Structural Parameters Robert Ganian, Friedrich Slivovsky, Stefan Szeider Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 457-468, 2013, Springer Verlag. [bibtex] [doi]
[10]	Model Counting for CNF Formulas of Bounded Modular Treewidth Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 55-66, 2013, Leibniz-Zentrum fuer Informatik. [bibtex] [doi]
[11]	Model Counting for Formulas of Bounded Clique-Width Friedrich Slivovsky, Stefan Szeider Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam, eds.), volume 8283 of Lecture Notes in Computer Science, pages 677-687, 2013, Springer Verlag. [bibtex] [doi]
[12]	On the Subexponential Time Complexity of CSP Iyad Kanj, Stefan Szeider Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 459-465, 2013, The AAAI Press. [bibtex]
[13]	Parameterized Complexity and Kernel Bounds for Hard Planning Problems Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (Paul G. Spirakis, Maria J. Serna, eds.), volume 7878 of Lecture Notes in Computer Science, pages 13-24, 2013, Springer Verlag. [bibtex] [doi]
[14]	Parameterized Complexity Results for Plan Reuse Ronald de Haan, Anna Roubickova, Stefan Szeider Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 224-231, 2013, The AAAI Press. [bibtex] [pdf]
[15]	Revisiting Space in Proof Complexity: Treewidth and Pathwidth Moritz Müller, Stefan Szeider Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 704-716, 2013, Springer Verlag. [bibtex] [doi]
[16]	Strong Backdoors to Bounded Treewidth SAT Serge Gaspers, Stefan Szeider 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 489-498, 2013, IEEE Computer Society. [bibtex] [doi]
[17]	The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers (Elizabeth Black, Sanjay Modgil, Nir Oren, eds.), volume 8306 of Lecture Notes in Computer Science, pages 158-175, 2013, Springer Verlag. [bibtex] [doi]
[18]	The Parameterized Complexity of Constraint Satisfaction and Reasoning Stefan Szeider Applications of Declarative Programming and Knowledge Management - 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers (Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf, eds.), volume 7773 of Lecture Notes in Computer Science, pages 27-37, 2013, Springer Verlag. [bibtex] [doi]
[19]	Upper and Lower Bounds for Weak Backdoor Set Detection Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 394-402, 2013, Springer Verlag. [bibtex] [doi]

2012

[1]	Augmenting tractable fragments of abstract argumentation Dvorák, Sebastian Ordyniak, Stefan Szeider Artificial Intelligence, volume 186, pages 157-173, 2012. [bibtex] [doi]
[2]	Editing graphs to satisfy degree constraints: a parameterized approach Luke Mathieson, Stefan Szeider Journal of Computer and System Sciences, volume 78, number 1, pages 179-191, 2012. [bibtex] [doi]
[3]	On graph contractions and induced minors Pim van 't Hof, Marcin Kamiński, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos Discr. Appl. Math., volume 160, number 6, pages 799-809, 2012. [bibtex] [doi]
[4]	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo Algorithmica, volume 64, number 1, pages 112-125, 2012. [bibtex] [doi]
[5]	Abstract Argumentation via Monadic Second Order Logic Wolfgang Dvorák, Stefan Szeider, Stefan Woltran Scalable Uncertainty Management - 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012. Proceedings (Eyke Hüllermeier, Sebastian Link, Thomas Fober, Bernhard Seeger, eds.), volume 7520 of Lecture Notes in Computer Science, pages 85-98, 2012, Springer Verlag. [bibtex] [doi]
[6]	Backdoors to Acyclic SAT Serge Gaspers, Stefan Szeider Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I (Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, eds.), volume 7391 of Lecture Notes in Computer Science, pages 363-374, 2012, Springer Verlag. [bibtex] [doi]
[7]	Backdoors to Satisfaction Serge Gaspers, Stefan Szeider The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday (Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx, eds.), volume 7370 of Lecture Notes in Computer Science, pages 287-317, 2012, Springer Verlag. [bibtex] [doi]
[8]	Computing Resolution-Path Dependencies in Linear Time Friedrich Slivovsky, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 58-71, 2012, Springer Verlag. [bibtex] [doi]
[9]	Don't Be Strict in Local Search! Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. [bibtex]
[10]	k-Gap Interval Graphs Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings (David Fernández-Baca, ed.), volume 7256 of Lecture Notes in Computer Science, pages 350-361, 2012, Springer Verlag. [bibtex] [doi]
[11]	On Finding Optimal Polytrees Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. [bibtex]
[12]	Strong Backdoors to Nested Satisfiability Serge Gaspers, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 72-85, 2012, Springer Verlag. [bibtex] [doi]
[13]	The Complexity of Planning Revisited - A Parameterized Analysis Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press. [bibtex]
[14]	Backdoors to Tractable Answer-Set Programming Johannes Klaus Fichte, Stefan Szeider 2012, Technical report 1104.2788, Arxiv.org. Note: Extended and updated version of a paper that appeared in the proceedings of IJCAI 2011, the 22nd International Joint Conference on Artificial Intelligence [bibtex]

2011

[1]	A probabilistic approach to problems parameterized above or below tight bounds Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo Journal of Computer and System Sciences, volume 77, number 2, pages 422-429, 2011. [bibtex] [pdf] [doi]
[2]	Algorithms and Complexity Results for Persuasive Argumentation Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider Artificial Intelligence, volume 175, pages 1722-1736, 2011. [bibtex]
[3]	Monadic Second Order Logic on Graphs with Local Cardinality Constraints Stefan Szeider ACM Transactions on Computational Logic, volume 12, number 2, pages article 12, 2011. [bibtex] [doi]
[4]	On the complexity of some colorful problems parameterized by treewidth Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen Information and Computation, volume 209, number 2, pages 143-153, 2011. [bibtex]
[5]	Parameterized Proof Complexity Stefan S. Dantchev, Barnaby Martin, Stefan Szeider Computational Complexity, volume 20, number 1, pages 51-85, 2011. [bibtex] [doi]
[6]	Solving MAX-r-SAT above a tight lower bound Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo Algorithmica, volume 61, number 3, pages 638-655, 2011. [bibtex] [doi]
[7]	The parameterized complexity of k-flip local search for SAT and MAX SAT Stefan Szeider Discrete Optim., volume 8, number 1, pages 139-145, 2011. [bibtex]
[8]	Tractable cases of the extended global cardinality constraint Marko Samer, Stefan Szeider Constraints, volume 16, number 1, pages 1-24, 2011. [bibtex] [doi]
[9]	Augmenting Tractable Fragments of Abstract Argumentation Sebastian Ordyniak, Stefan Szeider Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 1033-1038, 2011, AAAI Press/IJCAI. [bibtex]
[10]	Backdoors to Tractable Answer-Set Programming Johannes Klaus Fichte, Stefan Szeider Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 863-868, 2011, AAAI Press/IJCAI. [bibtex]
[11]	Kernels for Global Constraints Serge Gaspers, Stefan Szeider IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 (Toby Walsh, ed.), pages 540-545, 2011, IJCAI/AAAI. [bibtex]
[12]	Limits of Preprocessing Stefan Szeider Proceedings of the Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011, pages 93-98, 2011, AAAI Press, Menlo Park, California. [bibtex] [pdf]
[13]	Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings (Karem A. Sakallah, Laurent Simon, eds.), volume 6695 of Lecture Notes in Computer Science, pages 47-60, 2011, Springer Verlag. [bibtex] [doi]
[14]	The Parameterized Complexity of Local Consistency Serge Gaspers, Stefan Szeider Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011) (Jimmy Ho-Man Lee, ed.), volume 6876 of Lecture Notes in Computer Science, pages 302-316, 2011, Springer Verlag. [bibtex] [pdf]
[15]	Backdoors to Acyclic SAT Serge Gaspers, Stefan Szeider 10 2011, Technical report 1110.6384, Arxiv.org. [bibtex]
[16]	Backdoors to Satisfaction Serge Gaspers, Stefan Szeider 10 2011, Technical report 1110.6387, Arxiv.org. [bibtex]

2010

[1]	Algorithms for propositional model counting Marko Samer, Stefan Szeider J. Discrete Algorithms, volume 8, number 1, pages 50-64, 2010. [bibtex] [pdf] [doi]
[2]	Constraint satisfaction with bounded treewidth revisited Marko Samer, Stefan Szeider Journal of Computer and System Sciences, volume 76, number 2, pages 103-114, 2010. [bibtex] [pdf]
[3]	Algorithms and Complexity Results for Exact Bayesian Structure Learning Sebastian Ordyniak, Stefan Szeider Proceedings of UAI 2010, The 26th Conference on Uncertainty in Artificial Intelligence, Catalina Island, California, USA, July 8-11, 2010 (Peter Grünwald, Peter Spirtes, eds.), 2010, AUAI Press, Corvallis, Oregon. [bibtex]
[4]	Algorithms and Complexity Results for Persuasive Argumentation Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo R. Simari, eds.), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 311-322, 2010. [bibtex]
[5]	On Contracting Graphs to Fixed Pattern Graphs Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings (Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe, eds.), volume 5901 of Lecture Notes in Computer Science, pages 503-514, 2010, Springer Verlag. [bibtex] [doi]
[6]	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings (Venkatesh Raman, Saket Saurabh, eds.), volume 6478 of Lecture Notes in Computer Science, pages 158-169, 2010, Springer Verlag. [bibtex] [doi]
[7]	Reasoning in Argumentation Frameworks of Bounded Clique-Width Dvorák, Stefan Szeider, Stefan Woltran Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo R. Simari, eds.), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 219-230, 2010. [bibtex]
[8]	Satisfiability of Acyclic and Almost Acyclic CNF Formulas Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India (Kamal Lodaya, Meena Mahajan, eds.), volume 8 of LIPIcs, pages 84-95, 2010, Leibniz-Zentrum fuer Informatik. [bibtex]
[9]	Solving MAX-r-SAT Above a Tight Lower Bound Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 (Moses Charikar, ed.), pages 511-517, 2010, SIAM. [bibtex] [doi]
[10]	Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010 (Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski, eds.), 2010, AAAI Press. [bibtex]

2009

[1]	Backdoor sets of quantified Boolean formulas Marko Samer, Stefan Szeider Journal of Automated Reasoning, volume 42, number 1, pages 77–97, 2009. [bibtex] [pdf] [doi]
[2]	Clique-width is NP-complete Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider SIAM J. Discrete Math., volume 23, number 2, pages 909-939, 2009. [bibtex] [pdf]
[3]	Covering graphs with few complete bipartite subgraphs Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider Theoretical Computer Science, volume 410, number 21-23, pages 2045-2053, 2009. [bibtex] [pdf] [doi]
[4]	Matched Formulas and Backdoor Sets Stefan Szeider J on Satisfiability, Boolean Modeling and Computation, volume 6, pages 1-12, 2009. [bibtex] [pdf]
[5]	A Probabilistic Approach to Problems Parameterized above or below Tight Bounds Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers (Jianer Chen, Fedor V. Fomin, eds.), volume 5917 of Lecture Notes in Computer Science, pages 234-245, 2009, Springer Verlag. [bibtex]
[6]	The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings (Oliver Kullmann, ed.), volume 5584 of Lecture Notes in Computer Science, pages 276-283, 2009, Springer Verlag. [bibtex]

2008

[1]	Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems Georg Gottlob, Stefan Szeider The Computer Journal, volume 51, number 3, pages 303-325, 2008. Note: Survey paper [bibtex] [pdf] [doi]
[2]	Fixed-parameter complexity of minimum profile problems Gregory Gutin, Stefan Szeider, Anders Yeo Algorithmica, volume 52, number 2, pages 133-152, 2008. [bibtex] [pdf]
[3]	Backdoor Trees Marko Samer, Stefan Szeider AAAI 08, Twenty-Third Conference on Artificial Intelligence, Chicago, Illinois, July 13-17, 2008, pages 363-368, 2008, AAAI Press. [bibtex] [pdf]
[4]	Monadic Second Order Logic on Graphs with Local Cardinality Constraints Stefan Szeider Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, volume 5162 of Lecture Notes in Computer Science, pages 601-612, 2008, Springer Verlag. [bibtex]
[5]	Not So Easy Problems For Tree Decomposable Graphs (invited talk) Stefan Szeider ICDM 2008, International Conference on Discrete Mathematics, June 6-10, 2008, Mysore, India, Proceedings, pages 161-171, 2008. [bibtex] [pdf]
[6]	Parameterized Graph Editing with Chosen Vertex Degrees Luke Mathieson, Stefan Szeider Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings (Boting Yang, Ding-Zhu Du, Cao An Wang, eds.), volume 5165 of Lecture Notes in Computer Science, pages 13-22, 2008, Springer Verlag. [bibtex] [doi]
[7]	The Parameterized Complexity of Regular Subgraph Problems and Generalizations Luke Mathieson, Stefan Szeider Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland, P. Manyem, eds.), volume 77 of Conferences in Research and Practice in Information Technology, pages 79-86, 2008, Australian Computer Society. [bibtex]
[8]	Tractable Cases of the Extended Global Cardinality Constraint Marko Samer, Stefan Szeider Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland, P. Manyem, eds.), volume 77 of Conferences in Research and Practice in Information Technology, pages 67-74, 2008, Australian Computer Society. [bibtex]
[9]	Parameterized SAT Stefan Szeider Chapter in Encyclopedia of Algorithms (Ming-Yang Kao, ed.), 2008, Springer Verlag. [bibtex]

2007

[1]	Solving \#SAT using Vertex Covers Naomi Nishimura, Prabhakar Ragde, Stefan Szeider Acta Informatica, volume 44, number 7-8, pages 509-523, 2007. [bibtex] [pdf]
[2]	The Linear Arrangement Problem Parameterized Above Guaranteed Value Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo Theory Comput. Syst., volume 41, pages 521-538, 2007. [bibtex] [pdf]
[3]	Algorithms for Propositional Model Counting Marko Samer, Stefan Szeider Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, October 15-19, 2007 Yerevan, Armenia, volume 4790 of Lecture Notes in Computer Science, pages 484-498, 2007, Springer Verlag. [bibtex]
[4]	Backdoor Sets of Quantified Boolean Formulas Marko Samer, Stefan Szeider Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva, K. A. Sakallah, eds.), volume 4501 of Lecture Notes in Computer Science, pages 230–243, 2007. [bibtex]
[5]	Covering Graphs with Few Complete Bipartite Subgraphs Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings (Vikraman Arvind, Sanjiva Prasad, eds.), volume 4855 of Lecture Notes in Computer Science, pages 340-351, 2007, Springer Verlag. [bibtex] [doi]
[6]	Matched Formulas and Backdoor Sets Stefan Szeider Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva, K. A. Sakallah, eds.), volume 4501 of Lecture Notes in Computer Science, pages 94-99, 2007. [bibtex]
[7]	On the Complexity of Some Colorful Problems Parameterized by Treewidth Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen Proceedings of COCOA 2007, Combinatorial Optimization and Applications, First International Conference, Xi'an, China, August 14-16, 2007, volume 4616 of Lecture Notes in Computer Science, pages 366-377, 2007, Springer Verlag. [bibtex]
[8]	Parameterized Proof Complexity Stefan Dantchev, Barnaby Martin, Stefan Szeider Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, pages 150-160, 2007, IEEE Press. [bibtex] [doi]
[9]	Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk) Stefan Szeider Proceedings of SymCon'07, Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, satellite workshop of CP 2007, September 23, 2007, Providence, RI, USA (B. Benhamou, ed.), pages 5-8, 2007. [bibtex] [pdf]

2006

[1]	A note on unsatisfiable k-CNF formulas with few occurrences per variable Shlomo Hoory, Stefan Szeider SIAM J. Discrete Math., volume 20, number 2, pages 523-528, 2006. [bibtex] [pdf]
[2]	On Finding Short Resolution Refutations and Small Unsatisfiable Subsets Michael R. Fellows, Stefan Szeider, Graham Wrightson Theoretical Computer Science, volume 351, number 3, pages 351-359, 2006. [bibtex] [pdf]
[3]	Clique-width Minimization is NP-hard Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider Proceedings of STOC 2006; the 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, pages 354–362, 2006, ACM. [bibtex] [doi]
[4]	Constraint satisfaction with bounded treewidth revisited Marko Samer, Stefan Szeider Proceedings of CP 2006 , Twelfth International Conference on Principles and Practice of Constraint Programming, September 24-29, 2006, Nantes, France, volume 4204 of Lecture Notes in Computer Science, pages 499-513, 2006. Note: Full version appeared in Constraints [bibtex]
[5]	Fixed-Parameter Complexity of Minimum Profile Problems Gregory Gutin, Anders Yeo, Stefan Szeider Proceedings of IWPEC 2006, 2nd International Workshop on Parameterized and Exact Computation, volume 4169 of Lecture Notes in Computer Science, pages 60-71, 2006, Springer Verlag. [bibtex]
[6]	Solving \#SAT using Vertex Covers Naomi Nishimura, Prabhakar Ragde, Stefan Szeider Proceedings of SAT 2006, Ninth International Conference on Theory and Applications of Satisfiability Testing, August 12-15, 2006, Seattle, Washington, USA, volume 4121 of Lecture Notes in Computer Science, pages 396-409, 2006. [bibtex]
[7]	The Linear Arrangement Problem Parameterized Above Guaranteed Value Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings (Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano, eds.), volume 3998 of Lecture Notes in Computer Science, pages 356-367, 2006, Springer Verlag. [bibtex] [doi]

2005

[1]	Backdoor Sets for DLL Subsolvers Stefan Szeider Journal of Automated Reasoning, volume 35, number 1-3, pages 73-88, 2005. Note: Reprinted as Chapter 4 of the book SAT 2005 - Satisfiability Research in the Year 2005, edited by E. Giunchiglia and T. Walsh, Springer Verlag, 2006 [bibtex] [pdf]
[2]	Computing unsatisfiable k-SAT instances with few occurrences per variable Shlomo Hoory, Stefan Szeider Theoretical Computer Science, volume 337, number 1-3, pages 347-359, 2005. Note: Supplementary material is available at https://www.ac.tuwien.ac.at/files/pub/HoorySzeider05.tar.gz [bibtex] [pdf]
[3]	Generalizations of matched CNF formulas Stefan Szeider Ann. Math. Artif. Intell., volume 43, number 1-4, pages 223-238, 2005. [bibtex] [pdf]
[4]	On Edge-Colored Graphs Covered by Properly Colored Cycles Herbert Fleischner, Stefan Szeider Graphs and Combinatorics, volume 21, number 3, pages 301-206, 2005. [bibtex] [pdf]
[5]	The Complexity of Resolution with Generalized Symmetry Rules Stefan Szeider Theory Comput. Syst., volume 38, number 2, pages 171-188, 2005. [bibtex] [pdf]

2004

[1]	Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Stefan Szeider Journal of Computer and System Sciences, volume 69, number 4, pages 656-674, 2004. [bibtex] [pdf] [doi]
[2]	On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors Stefan Szeider Ars Combinatoria, volume 73, pages 53-64, 2004. [bibtex] [pdf]
[3]	Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable Shlomo Hoory, Stefan Szeider SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004. [bibtex]
[4]	Detecting Backdoor Sets with Respect to Horn and Binary Clauses Naomi Nishimura, Prabhakar Ragde, Stefan Szeider Proceedings of SAT 2004 (Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May, 2004, Vancouver, BC, Canada), pages 96-103, 2004. [bibtex] [pdf]
[5]	On Finding Short Resolution Refutations and Small Unsatisfiable Subsets Michael R. Fellows, Stefan Szeider, Graham Wrightson 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004) (Rod Downey, Michael Fellows, Frank Dehne, eds.), volume 3162 of Lecture Notes in Computer Science, pages 223-234, 2004, Springer. [bibtex]
[6]	On fixed-parameter tractable parameterizations of SAT Stefan Szeider Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers (Enrico Giunchiglia, Armando Tacchella, eds.), volume 2919 of Lecture Notes in Computer Science, pages 188-202, 2004, Springer Verlag. [bibtex] [pdf]
[7]	The Parameterized Complexity of SAT Backdoors Stefan Szeider Computing: The Australasian Theory Symposium (CATS 2004) (Mike Atkinson, ed.), pages 252-261, 2004. Note: Informal Proceedings [bibtex]

2003

[1]	Finding paths in graphs avoiding forbidden transitions Stefan Szeider Discr. Appl. Math., volume 126, number 2-3, pages 239-251, 2003. [bibtex] [pdf] [doi]
[2]	Homomorphisms of Conjunctive Normal Forms Stefan Szeider Discr. Appl. Math., volume 130, number 2, pages 351-365, 2003. [bibtex] [pdf]
[3]	Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Stefan Szeider Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03) (T. Warnow, B. Zhu, eds.), volume 2697 of Lecture Notes in Computer Science, pages 548-558, 2003, Springer Verlag. [bibtex]
[4]	The complexity of resolution with generalized symmetry rules Stefan Szeider Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS'03) (Helmut Alt, Michel Habib, eds.), volume 2607 of Lecture Notes in Computer Science, pages 475-486, 2003. [bibtex]
[5]	Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Stefan Szeider 2003, Technical report TR03-002, Revision~1, Electronic Colloquium on Computational Complexity (ECCC). [bibtex] [pdf]

2002

[1]	Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference Herbert Fleischner, Oliver Kullmann, Stefan Szeider Theoretical Computer Science, volume 289, number 1, pages 503-516, 2002. [bibtex] [pdf]
[2]	Generalizations of matched CNF formulas Stefan Szeider Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002) Cincinnati, Ohio, USA, May 6-9, 2002 (John Franco, ed.), pages 292-307, 5 2002. [bibtex]

2001

[1]	NP-Completeness of Refutability by Literal-Once Resolution Stefan Szeider IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning (R. Goré, A. Leitsch, T. Nipkow, eds.), volume 2083 of Lecture Notes in Artificial Intelligence, pages 168-181, 2001, Springer Verlag. [bibtex]
[2]	Conjunctive Normal Forms with Bounded Deficiency Stefan Szeider 9 2001, PhD thesis, University of Vienna.

Publications: Thomas Depian

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. [bibtex] [doi]
[2]	Visualizing Treewidth Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg J. Graph Algorithms Appl., volume 30, number 2, pages 199–235, 2026. [bibtex] [doi]
[3]	On the Recognition of Outerplanar Graphs with Queue Number 1 Michael A. Bekos, Thomas Depian, Stefan Felsner, Michael Kaufmann, Philipp Kindermann, Fabrizio Montecchiani, Maria Eleni Pavlidi, Alexandra Weinberger, Alexander Wolff, Johannes Zink Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex] [pdf]
[4]	Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints Thomas Depian, Thomas C. van Dijk, Martin Nöllenburg Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex] [pdf]
[5]	Point Set Embeddability with List Constraints Thomas Depian, Joseph Dorfer, Boris Klemz, Matthias Pfretzschner, Lena Schlipf Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex] [pdf]
[6]	Realizing Planar Linkages in Polygonal Domains Thomas Depian, Carolina Haase, Martin Nöllenburg, André Schulz International Workshop on Combinatorial Algorithms (IWOCA'26) (F. Foucaud, A. Parreau, eds.), volume 16587 of LNCS, pages 251–265, 2026, Springer. [bibtex] [doi]
[7]	Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii Thomas Depian, Frank Sommer European Symposium on Algorithms (ESA'26) (Seth Pettie, Philip Bille, Sabine Storandt, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex] [pdf]
[8]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex]
[9]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[10]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. [bibtex] [doi]

2025

[1]	Constrained Boundary Labeling Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger Comput. Geom. Theory Appl., volume 129, pages 102191, 2025. [bibtex] [doi]
[2]	Transitions in Dynamic Point Labeling Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms Cartography and Geographic Information Science, pages 1–26, 2025. [bibtex] [doi]
[3]	Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman, eds.), volume 351 of LIPIcs, pages 15:1–15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex] [pdf] [doi]
[4]	On Planar Unit-Length Linear Linkages in Polygonal Domains Thomas Depian, Carolina Haase, Martin Nöllenburg, André Schulz European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 55:1–55:9, 2025. [bibtex]
[5]	Partial Level Planarity Parameterized by the Size of the Missing Graph Thomas Depian, Simon D. Fink, Boris Klemz, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. [bibtex]
[6]	Pathways to Tractability for Geometric Thickness Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. [bibtex] [doi]
[7]	Pathways to Tractability for Geometric Thickness (Best Paper Award) Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg 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álovic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. [bibtex] [pdf] [doi]
[8]	Structural Parameterizations of Simultaneous Planarity Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, eds.), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[9]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. [bibtex] [pdf] [doi]
[10]	Visualizing Treewidth Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg Graph Drawing and Network Visualization (GD'25) (Vida Dujmović, Fabrizio Montecchiani, eds.), volume 357 of LIPIcs, pages 17:1–17:20, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[11]	Network Navigation with Online Delays is PSPACE-complete Thomas Depian, Christoph Kern, Sebastian Röder, Soeren Terziadis, Markus Wallinger Chapter in Studierendenkonferenz Informatik (SKILL 2023), pages 195–206, 2025, Gesellschaft für Informatik e.V.. [bibtex] [doi]

2024

[1]	Constrained Boundary Labeling Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 26:1–26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[2]	Minimizing Corners in Colored Rectilinear Grids Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms Algorithms and Computation (WALCOM'24) (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of LNCS, pages 134–148, 2024, Springer. [bibtex] [doi]
[3]	The Parameterized Complexity of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[4]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2023

[1]

Transitions in Dynamic Point Labeling
Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms
Geographic Information Science (GIScience'23) (Roger Beecham, Jed A. Long, Dianna Smith, Qunshan Zhao, Sarah Wise, eds.), volume 277 of LIPIcs, pages 2:1–2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

Publications: Tianwei Zhang

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2025

[1]

Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem
William Huang, Yi Mei, Günther R. Raidl, Fangfang Zhang, Laurenz Tomandl, Steffen Limmer, Mengjie Zhang, Tobias Rodemann
2025 IEEE Congress on Evolutionary Computation (CEC), pages 1-8, 2025, IEEE.
[bibtex] [pdf] [doi]

[2]

The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators
Tianwei Zhang, Stefan Szeider
31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda, ed.), volume 340 of LIPIcs, pages 39:1–39:19, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

2024

[1]

Compilation and Fast Model Counting beyond CNF
Alexis de Colnet, Stefan Szeider, Tianwei Zhang
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3315–3323, 8 2024, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
[bibtex] [doi]

[2]

Small unsatisfiable k-CNFs with bounded literal occurrence
Tianwei Zhang, Tomáš Peitl, Stefan Szeider
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]

2023

[1]

Searching for smallest universal graphs and tournaments with SAT
Tianwei Zhang, Stefan Szeider
Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 39:1–39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

Publications: Tomas Peitl

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Graph Choosability via SAT: Beyond the Nullstellensatz Markus Kirchweger, Tomás Peitl, David Seka, Stefan Szeider Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 14269–14277, 2026, AAAI Press. [bibtex] [pdf] [doi]
[2]	Smart Cubing for Graph Search: A Comparative Study Markus Kirchweger, Hai Xia, Tomás Peitl, Stefan Szeider 32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 33:1–33:19, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: Preprint: CoRR abs/2501.17201, https://arxiv.org/abs/2501.17201 [bibtex] [pdf] [doi]
[3]	Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking Leroy Chew, Tomás Peitl 29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev, Stefan Szeider, eds.), volume 377 of LIPIcs, pages 11:1–11:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2025

[1]	Better Extension Variables in DQBF via Independence Leroy Chew, Tomás Peitl 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, Glasgow, Scotland, August 12-15, 2025 (Jeremias Berg, Jakob Nordström, eds.), volume 341 of LIPIcs, pages 11:1–11:24, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[2]	Breaking Symmetries in Quantified Graph Search: A Comparative Study Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 11246–11254, 2025, AAAI Press. [bibtex] [pdf] [doi]

2024

[1]	Hard QBFs for Merge Resolution Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl, Gaurav Sood ACM Trans. Comput. Theory, volume 16, number 2, pages 6:1–6:24, 2024. [bibtex] [pdf] [doi]
[2]	QCDCL with cube learning or pure literal elimination - What is best? Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff Artif. Intell., volume 336, pages 104194, 2024. [bibtex] [pdf] [doi]
[3]	Should Decisions in QCDCL Follow Prefix Order? Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff J. Autom. Reason., volume 68, number 1, pages 5, 2024. [bibtex] [pdf] [doi]
[4]	Small unsatisfiable k-CNFs with bounded literal occurrence Tianwei Zhang, Tomáš Peitl, Stefan Szeider 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]

2023

[1]	Are Hitting Formulas Hard for Resolution? Tomáš Peitl, Stefan Szeider Discr. Appl. Math., volume 337, pages 173–184, 2023. [bibtex] [doi]
[2]	A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture Markus Kirchweger, Tomáš Peitl, Stefan Szeider 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 13:1–13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	Co-Certificate Learning with SAT Modulo Symmetries Markus Kirchweger, Tomáš Peitl, Stefan Szeider 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 [bibtex] [pdf] [doi]

2022

[1]	Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl ACM Transactions on Computational Logic, sep 2022, Association for Computing Machinery. [bibtex] [doi]
[2]	QCDCL with Cube Learning or Pure Literal Elimination - What is Best? Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 1781–1787, 2022, ijcai.org. Note: Distinguished Paper Award [bibtex] [pdf] [doi]
[3]	Should Decisions in QCDCL Follow Prefix Order? Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 11:1–11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]

2021

[1]	Finding the Hardest Formulas for Resolution Tomáš Peitl, Stefan Szeider Journal of Artificial Intelligence Research, volume 72, pages 69–97, 2021. Note: Conference Award Track, best paper CP 2020 [bibtex] [doi]
[2]	Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl Electron. Colloquium Comput. Complex., pages 135, 2021. [bibtex] [pdf]
[3]	Davis and Putnam Meet Henkin: Solving DQBF with Resolution Joshua Blinkhorn, Tomáš Peitl, Friedrich Slivovsky Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 30–46, 2021, Springer. [bibtex] [pdf] [doi]
[4]	Finding the Hardest Formulas for Resolution (Extended Abstract) Tomáš Peitl, Stefan Szeider Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 4814–4818, 2021. Note: Sister Conferences Best Papers [bibtex] [doi]
[5]	Davis and Putnam Meet Henkin: Solving DQBF with Resolution Joshua Blinkhorn, Tomáš Peitl, Friedrich Slivovsky 2021, Technical report AC-TR-21-012, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2020

[1]	Finding the Hardest Formulas for Resolution Tomáš Peitl, Stefan Szeider Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 514–530, 2020, Springer Verlag. Note: Best Paper Award [bibtex]
[2]	Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Robert Ganian, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020. [bibtex] [pdf]
[3]	Hard QBFs for Merge Resolution Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl, Gaurav Sood 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference) (Nitin Saxena, Sunil Simon, eds.), volume 182 of LIPIcs, pages 12:1–12:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[4]	Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 394–411, 2020, Springer Verlag. [bibtex] [pdf]
[5]	Finding the Hardest Formulas for Resolution Tomáš Peitl, Stefan Szeider 2020, Technical report AC-TR-20-008, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[6]	Fixed-Parameter Tractability of Dependency QBF with Structural Parameters Robert Ganian, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2020, Technical report AC-TR-20-011, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2019

[1]	Dependency Learning for QBF Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Journal of Artificial Intelligence Research, volume 65, pages 180–208, 2019. [bibtex] [pdf] [doi]
[2]	Long-Distance Q-Resolution with Dependency Schemes Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019. [bibtex] [pdf] [doi]
[3]	Combining Resolution-Path Dependencies with Dependency Learning Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 306–318, 2019, Springer Verlag. [bibtex] [doi]
[4]	Proof Complexity of Fragments of Long-Distance Q-resolution Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag. [bibtex] [doi]
[5]	Combining Resolution-Path Dependencies with Dependency Learning Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2019, Technical report AC-TR-19-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[6]	Proof Complexity of Fragments of Long-Distance Q-resolution Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2019, Technical report AC-TR-19-004, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2018

[1]	Polynomial-Time Validation of QCDCL Certificates Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK (Olaf Beyersdorff, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 253–269, 2018, Springer Verlag. [bibtex] [pdf] [doi]
[2]	Portfolio-Based Algorithm Selection for Circuit QBFs Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 195–209, 2018, Springer Verlag. [bibtex] [doi]
[3]	Portfolio-Based Algorithm Selection for Circuit QBFs Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider QBF Workshop, 2018. [bibtex]
[4]	Polynomial-Time Validation of QCDCL Certificates Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2018, Technical report AC-TR-18-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[5]	Portfolio Solvers for QDIMACS and QCIR Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2018. Note: QBF Evaluation at SAT [bibtex]
[6]	Portfolio-Based Algorithm Selection for Circuit QBFs Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider 2018, Technical report AC-TR-18-004, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[7]	QBF Encodings of Chess Problems Tomáš Peitl 2018, Technical report AC-TR-18-013, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2017

[1]

Long-Distance Q-Resolution with Dependency Schemes
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 298–313, 2017, Springer Verlag.
[bibtex] [pdf] [doi]

[2]

Dependency Learning for QBF
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
2017, Technical report AC-TR-17-011, Algorithms and Complexity Group, TU Wien.
[bibtex] [pdf]

2016

[1]

Long Distance Q-Resolution with Dependency Schemes
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 500–518, 2016, Springer Verlag.
[bibtex] [pdf] [doi]

Supervised Theses: Enrico Iurlano

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Lower Bounds and Algorithms for Covering Sequences of Subsets of a Finite Set Alexander Weissenfels August 2026, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and E. Iurlano [pdf]

Supervised Theses: Günther Raidl

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2026

[1]	Heuristic Optimization of Integrated Energy Systems – An Extension to the IESopt Framework Martin Wustinger August 2026, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and M. Prandtstetter [pdf]
[2]	Lower Bounds and Algorithms for Covering Sequences of Subsets of a Finite Set Alexander Weissenfels August 2026, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and E. Iurlano [pdf]

2025

[1]	Denoising Diffusion-Based Evolutionary Algorithms – Exploring Hybridizations of Evolutionary Algorithms with Denoising Diffusion Models Joan Salva Soler March 2025, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl [pdf]
[2]	Optimizing Elevator Control with a Destination Registration System Jonas Kompauer March 2025, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and M. Bresich [pdf]

2024

[1]	An AlphaZero Agent for Just 4 Fun, a Non-Deterministic Game with Imperfect Information Peter Neubauer October 2024, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and Daniel Obszelka [pdf]
[2]	Graph Neural Networks Meet Local Search for the Weighted Total Domination Problem Alexander Simunics October 2024, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and J. Varga [pdf]
[3]	Strength Estimation in the Game of Go Peter Neubauer October 2024, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl [pdf]

2023

[1]	A Learning Multilevel Optimization Approach for a Large Location Allocation Problem Laurenz Tomandl May 2023, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and T. Jatschka [pdf]
[2]	Advancing State Space Search for Static and Dynamic Optimization by Parallelization and Learning Nikolaus Frohner May 2023, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G.~R.~Raidl [pdf]
[3]	Computational Optimization Approaches for Distributing Battery Exchange Stations for Electric Scooters Bernhard Kreutzer September 2023, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and T. Jatschka [pdf]
[4]	Hybrid Approaches to Sports League Scheduling using Constraint Programming and Simulated Annealing Bernhard Neumann January 2023, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and N. Frohner [pdf]
[5]	Hybrid Metaheuristics Based on Large Neighborhood Search and Mixed Integer Linear Programming for the Directed Feedback Vertex Set Problem Maria Bresich January 2023, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and J. Varga [pdf]

2022

[1]	A Matheuristic for Battery Exchange Station Location Planning for Electric Scooters Matthias Rauscher January 2022, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and T. Jatschka [pdf]
[2]	Computational Optimization Approaches for Distributing Service Points for Mobility Applications and Smart Charging of Electric Vehicles Thomas Jatschka February 2022, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G.~R.~Raidl and T. Rodemann [pdf]
[3]	Minimizing Makespan in Flow Shops with a Reinforcement Learning Like Approach Jonas Mayerhofer May 2022, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and Marc Huber [pdf]
[4]	Optimization of Container Transportation for Fixed-Schedule Block Trains with Optional Round Trips in Collaborative Logistics Lukas Felician Krasel December 2022, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl, G. Brandstätter, and U. Ritzinger [pdf]

2021

[1]	Computational Methods for Fleet Scheduling in E-Mobility Johannes Varga August 2021, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl [pdf]
[2]	Exact and heuristic approaches for solving string problems from bioinformatics Marko Djukanovic December 2021, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G.~R.~Raidl [pdf] [doi]
[3]	Randomized Construction Approaches to the Traveling Tournament Problem using Lower Bound Based Heuristics Giulio Pace March 2021, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and N. Frohner [pdf]
[4]	Scheduling the Charging of Electric Vehicles with SOC-Dependent Maximum Charging Power Benjamin Schaden April 2021, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and T. Jatschka [pdf]

2020

[1]	Combinatorial Optimization Approaches for Graph Construction Problems Benedikt Klocker April 2020, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by Günther~R.~Raidl [pdf]
[2]	Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots Simeon Kuran March 2020, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and A. Chwatal [pdf]
[3]	Solving a Generalized Constrained Longest Common Subsequence Problem Christoph Berger June 2020, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and M. Djukanovic [pdf]

2019

[1]	A Heuristic Approach to Aircraft Trajectory Optimization with Constraints Andreas Windbichler March 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl [pdf]
[2]	Algorithmic Approaches for Optimization Problems in Bike Sharing and Security Control Christian Kloimüllner March 2019, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by Günther~R.~Raidl [pdf]
[3]	Automated Calculation of Optimal Adjustment Parameters for Myoelectric Hand Prostheses Sigrid Gerger March 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl [pdf]
[4]	Patient Scheduling in Particle Therapy Johannes Maschler March 2019, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G.~R.~Raidl [pdf]
[5]	Perfect Pseudo Matchings on Snarks Benjamin Schwendinger May 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl [pdf]

2018

[1]	Advances in Decomposition Approaches for Mixed Integer Linear Programming Martin Riedler November 2018, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by G.~R.~Raidl [pdf]
[2]	Local Search Methods for the Particle Therapy Patient Scheduling Problem Thomas Hackl September 2018, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and J. Maschler [pdf]
[3]	Methods for Intraday Scheduling in Particle Therapy Michael Höfler November 2018, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and J. Maschler [pdf]
[4]	Monero Chross-Chain Traceability Abraham Hinteregger September 2018, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl [pdf]
[5]	Parallel Hybrid Metaheuristics for Solving the Firefighter Problem Using the GPU Gajo Gajic June 2018, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and C. Bacher [pdf]

2017

[1]	An Iterative Time-Bucket Refinement Algorithm for High Resolution Scheduling Problems Thomas Jatschka October 2017, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl, M. Riedler, and J. Maschler [pdf]

2016

[1]	A Branch-and-Bound Approach for the Constrained k-Staged 2-Dimensional Cutting Stock Problem Bernhard Bonigl January 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and F. Dusberger [pdf]
[2]	Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem Franz Leberl March 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and F. Dusberger [pdf]
[3]	Complete Solution Archives for Evolutionary Combinatorial Optimization: Application to a Competitive Facility Location and Stochastic Vehicle Routing Problem Benjamin Biesinger April 2016, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~R.~Raidl and B.~Hu [pdf]
[4]	Metaheuristics for the Districting and Routing Problem for Security Control Michael Prischink May 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl, B. Biesinger, and C. Kloimüllner [pdf]
[5]	Visibility Based Obstacle Placing – Automated Obstacle Placing Based on Circularity Carina Schwab January 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and R. Schaffranek [pdf]

2015

[1]	Electric Vehicles Recharge Scheduling with Logic-Based Benders Decomposition Katharina Ölsböck July 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and M. Riedler [pdf]
[2]	Optimization Approaches for Recreational Bicycle Tour Planning Benedikt Klocker April 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by M. Prandtstetter and G. Raidl [pdf]
[3]	Solving the Multi-Objective Steiner Tree Problem with Resources Georg Brandstätter January 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by M. Leitner, M. Ruthmair, and G. Raidl [pdf]
[4]	Solving the Travelling Thief Problem with an Evolutionary Algorithm Christoph Wachter September 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by G. Raidl and B. Hu [pdf]

2014

[1]	A Hybrid Algorithm for the Partition Coloring Problem Gilbert Fritz February 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[2]	Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows Dietmar Trummer February 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[3]	Finding Longest Common Subsequences by GPU-Based Parallel Ant Colony Optimization David Markvica February 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[4]	Heuristic Solution Approaches for the Two Dimensional Pre-Marshalling Problem Alan Tus June 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[5]	Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework Patrick Klaffenboeck May 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]

2013

[1]	Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems Markus Putzenlechner August 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and D.~Ljubic [pdf]
[2]	Balancing Bike Sharing Systems Andreas Pinter December 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[3]	Critical Links Detection using CUDA Thomas Schnabl April 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and B.~Hu [pdf]
[4]	Metaheuristic Optimization of Electro-Hybrid Powertrains Using Machine Learning Techniques Christopher Bacher August 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and T.~Krenek. \textbf3rd price Johann Puch Innovation Award 2013 (Magna Steyr) [pdf]
[5]	Metaheuristics for the Regenerator Location Problem Peter Jahrmann March 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[6]	Optimization Challenges of the Future Federated Internet Inführ, Johannes October 2013, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~R.~Raidl and K.~Tutschku [pdf]
[7]	Selective Graph Coloring Problem Claus-Dieter Volko April 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and B.~Hu [pdf]
[8]	The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays Roman Karl December 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl, M.~Leitner, and M. Ruthmair [pdf]
[9]	Two-Phase Local Search for the Bi-objective Connected Facility Location Problem Thomas Petelin December 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Leitner [pdf]

2012

[1]	Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents Benjamin Biesinger May 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and C.~Schauer and B.~Hu [pdf]
[2]	Extending the Gecode Framework with Interval Constraint Programming Ivan Ivezić October 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and L.~Di~Gaspero [pdf]
[3]	Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation Sandro Pirkwieser May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~R.~Raidl and K.~F.~Dörner [pdf]
[4]	Improving the Protein Identification Performance in High-Resolution Mass Spectrometry Data Frederico Dusberger October 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl, K.~Mechtler, and P.~Pichler [pdf]
[5]	Metaheuristics for a Multimodal Home-Health Care Scheduling Problem Gerhard Hiermann May 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and J. Puchinger [pdf]
[6]	On Solving Constrained Tree Problems and an Adaptive Layers Framework Ruthmair, Mario pages 187, May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~R.~Raidl and U.~Pferschy [pdf]
[7]	Solving Multimodal Resource Constrained Project Scheduling Problems Martin Sturm September 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[8]	The Vehicle Routing Problem with Compartments Philipp Gebhard October 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and S.~Pirkwieser [pdf]

2011

[1]	A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem Thomas Seidl September 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Ruthmair [pdf]
[2]	Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten Thomas Winkler July 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and C.~Schauer [pdf]
[3]	Branch-and-Price for the Steiner Tree Problem with Revenues, Budget and Hop Constraints Markus Sinnl August 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Leitner [pdf]
[4]	Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem Christian Gruber September 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and B.~Hu [pdf]
[5]	Heuristic Methods for the Hop Constrained Survivable Network Design Problem Gernot Fritz September 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Leitner [pdf]
[6]	Optimierung der periodischen Tourenplanung in der Müllentsorgung Karl-Michael Edlinger July 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Ruthmair [pdf]
[7]	Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus Thorsten Krenek July 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Ruthmair [pdf]

2010

[1]	A Timeslot-Based Heuristic Approach to Construct High-School Timetables Michael Pimmer December 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and B.~Melian [pdf]
[2]	Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-Price Corinna Thöni February 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and A.~Chwatal [pdf]
[3]	Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem Mika Sonnleitner September 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and B.~Hu [pdf]
[4]	Heuristic methods for solving two Generalized Network Problems Anna Pagacz February 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and B.~Hu [pdf]
[5]	Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem Martin Berlakovich July 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Ruthmair [pdf]
[6]	On the Minimum Label Spanning Tree Problem: Solution Methods and Applications Andreas Chwatal May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~R.~Raidl and U.~Pferschy [pdf]
[7]	Reconstructing Cross-Cut Shredded Documents by means of Evolutionary Algorithms C. Schauer May 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Prandtstetter [pdf]
[8]	Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods Karin Oberlechner August 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and A.~Chwatal [pdf]
[9]	Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods Markus Leitner May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~R.~Raidl and U.~Pferschy [pdf]

2009

[1]	Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungen Thomas Misar April 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Prandtstetter [pdf]
[2]	Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das Generalized Minimum Spanning Tree-Problem Markus Wolf July 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and B.~Hu [pdf]
[3]	Enhancing a Genetic Algorithm by a Complete Solution Archive Based on a Trie Data Structure Andrej Sramko February 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms. Note: supervised by G.~Raidl [pdf]
[4]	Event Based Similarity Search and its Applications in Business Analytics Martin Suntinger March 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms. Note: supervised by G.~Raidl [pdf]
[5]	Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem Martin Gruber May 2009, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[6]	Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing Jakob Walla April 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Ruthmair [pdf]
[7]	Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents Matthias Prandtstetter December 2009, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[8]	Similarity Searching in Complex Business Events and Sequences thereof Hannes Obweger March 2009, Master's thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms. Note: supervised by G.~Raidl [pdf]

2008

[1]	A Complete Archive Genetic Algorithm for the Multidimensional Knapsack Problem Stephan Zaubzer May 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[2]	An Incremental Dynamic Programming Approach for Multidimensional Allocation Problems Christoph Bonitz May 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[3]	Combinatorial Optimization for the Compression of Biometric Templates Olivia Dietzel May 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and A.~Chwatal [pdf]
[4]	Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung Nina Musil December 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphic s and Algorithms. Note: supervised by G.~Raidl and A.~Chwatal [pdf]
[5]	Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen Franz Berger September 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Prandtstetter [pdf]
[6]	Evaluation and Reconstruction of Strip-Shredded Text Documents Wolfgang Morandell May 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Prandtstetter [pdf]
[7]	Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpräferenzen Ulrike Ritzinger December 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Prandtstetter [pdf]
[8]	Hybrid Metaheuristics for Generalized Network Design Problems Bin Hu December 2008, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~R.~Raidl and U.~Pferschy [pdf]
[9]	Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems Ferdinand Zaubzer May 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M. Gruber [pdf]
[10]	Parallel Variable Neighborhood Search for the Car Sequencing Problem Markus Knausz October 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Prandtstetter [pdf]
[11]	Reconstructing Borders of Manually Torn Paper Scheets Using Integer Linear Programming Peter Schüller January 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Prandtstetter [pdf]
[12]	Webbasierte Darstellung großer Datenmengen als Pivot-Tabelle mithilfe ressourcenoptimierter Aggregationsverfahren Anna Katarzyna Potocka October 2008, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M. Gruber [pdf]

2007

[1]	Algorithmic Approaches to the String Barcoding Problem Philipp Neuner October 2007, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[2]	Improved Protein Identification After Fast Elimination of Non-Interpretable Peptide MS/MS Spectra and Noise Reduction Nedim Mujezinovic May 2007, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and F.~Eisenhaber [pdf]
[3]	Map-Matching und Wegsuche in einem geografischen Informationssystem Andreas Braumann December 2007, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl
[4]	Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks Thomas Bucsics March 2007, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and D.~Wagner [pdf]
[5]	Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem Peter Putz October 2007, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]

2006

[1]	A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem Sandro Pirkwieser October 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and J.~Puchinger [pdf]
[2]	An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem Boris Kopinitsch January 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and M.~Gruber [pdf]
[3]	Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen Andreas Chwatal January 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[4]	Cluster Planarity Testing for the Case of Not Necessarily Connected Clusters Robert Beibl December 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl, R. Weiskircher, and M. Percan [pdf]
[5]	Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems Jakob Puchinger January 2006, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~R.~Raidl and U.~Pferschy [pdf]
[6]	Solving Two Generalized Network Design Problems with Exact and Heuristic Methods Markus Leitner May 2006, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and B.~Hu [pdf]

2005

[1]	An Application of Dijkstra's Algorithm for a (On-Board) Route (Re-)Planning Module Grégoire Verlut July 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and J.~Puchinger, in cooperation with the European Aeronautic Defence and Space Company (EADS), Munich, Germany
[2]	An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problem Daniel Lichtenberger March 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and J.~Puchinger [pdf]
[3]	Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristiken David Fischinger August 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and W.~Stöcher, Profactor Produktionsforschungs GmbH, Steyr, Austria
[4]	Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem Daniel Wagner August 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[5]	Exact and Heuristic Methods for Solving the Car Sequencing Problem Matthias Prandtstetter August 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and B.~Hu [pdf]
[6]	Multiple Structural RNA Alignment with Affine Gap Costs Based on Lagrangian Relaxation Veronika Gamper August 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and G.~Klau [pdf]
[7]	Option Pricing by Means of Genetic Programming Andreas Heigl February 2005, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]

2004

[1]	An Alignment Graph based Evolutionary Algorithm for the Multiple Sequence Alignment Problem Stefan Leopold February 2004, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and G.~Koller [pdf]
[2]	Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem G"unther Gruber November 2004, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]

2003

[1]	Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems Sandor Alexander Kersting September 2003, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[2]	Ein Genetischer Algorithmus für das Generalized Assignment Problem Harald Feltl April 2003, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl [pdf]
[3]	Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem Janosch Fauster May 2003, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and G. Koller [pdf]
[4]	Verfahren zur Lösung eines Glasverschnittproblems Jakob Puchinger May 2003, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. Note: supervised by G.~Raidl and G. Koller [pdf]

Supervised Theses: Johannes Varga

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2024

[1]	Graph Neural Networks Meet Local Search for the Weighted Total Domination Problem Alexander Simunics October 2024, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and J. Varga [pdf]

2023

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

Supervised Theses: Maria Bresich

Tue, 22 Sep 2026 00:00:00 +0000

⬅️ Zurück zum Profil

2025

[1]	Optimizing Elevator Control with a Destination Registration System Jonas Kompauer March 2025, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl and M. Bresich [pdf]