Home | AC Group | TU Wien

FWF Cluster of Excellence: Bilateral Artificial Intelligence

Mon, 01 Jan 2024 00:00:00 +0000

🌐 Visit the official FWF Project Radar Page

The project Bilateral AI aims at lifting artificial intelligence (AI) to the next level. Current AI systems are in a sense narrow. They center on a specific application or task such as object or speech recognition. Our project will combine two of the most important types of AI which have been developed separately so far: symbolic and sub-symbolic AI. While symbolic AI works with clearly defined logical rules, sub-symbolic AI (such as ChatGPT) is based on training a machine with the help of large datasets to create intelligent behavior. This integration, resulting in a Broad AI, is intended to mirror something that humans do naturally: the simultaneous use of cognition and reasoning skills. But what exactly is Broad AI? As opposed to Narrow AI, which is characterized by task specific skills, Broad AI aims at solving a wide array of problems, rather than being limited to a single task or domain. By combining sub-symbolic AI (machine learning, ML) with symbolic AI (knowledge representation and reasoning, KRR), Bilateral AI provides the means to develop the foundations of the capabilities and skill acquisition for problem solving by a Broad AI. Harnessing the full potential of both symbolic and sub-symbolic approaches can open new avenues for AI that are better at solving new problems, adapting to a wide variety of environments, having better reasoning skills, and being more efficient in terms of both computation and data use. These key features allow for a vast range of use cases for Broad AI, starting with drug development and medicine, over planning and scheduling, to autonomous traffic management and recommendation systems. With fairness, transparency, and explainability as top priorities, developing Broad AI is also essential for addressing ethical concerns and ensuring a positive impact on our society. These concerns play a central role as cross-cutting aspect in our project. The Broad AI resulting from the bilateral AI approach would use its own sensory perceptions to perform abstractions and engage in a logical thinking process. The AI could then, for example, organize a trip, minimize carbon emissions, or renovate a house as cost- effectively and ecologically as possible. In other words, AI could perform complex planning taking all aspects into account. Sepp Hochreiter, Director of Research: Broad AI could potentially improve our everyday lives as well as system-relevant aspects and processes - such as energy, transportation and healthcare - by becoming more environmentally sustainable, efficient and resource-friendly.

Parameterized Graph Drawing

Sun, 01 Jan 2023 00:00:00 +0000

Funding organization: Vienna Science and Technology Fund, WWTF
Project number: ICT22-029 (Information and Communication Technology 2022)

Project Team

Robert Ganian (Principal Investigator)

Martin Nöllenburg (Principal Investigator)

Simon Dominik Fink (Postdoctoral Researcher)

Thomas Depian (PhD Student)

Alexander Firbas (PhD Student)

Research Statement

The project is centered around two well-established fields of information and communication technology: (1) graph drawing and visualization, which deals with the construction and analysis of geometric representations of graphs and networks subject to specific layout conventions, and (2) parameterized complexity analysis, which offers the tools to design efficient algorithms as well as lower bounds custom-tailored to the specific structural properties of relevant inputs. Recent advances have highlighted the huge potential for the application of parameterized techniques on graph drawing and visualization problems. The two PIs of this proposal – Robert Ganian and Martin Nöllenburg – have already spearheaded an initial push to bring the two fields closer together, and this proposal will allow them to bring these efforts into fruition by targeting and resolving some of the most prominent questions in this intersection.

The project focuses on developing the tools and frameworks that will facilitate the parameterized analysis of central problems in graph drawing and visualization. The work is split into four fundamental themes, covering Extension Problems, Linear and Layered Layouts, Geometric Graph Representations and Bridges to Network Visualization. The output of each theme will include not only new algorithms but also tight lower bounds and, where relevant, implementations, significantly advancing the state of the art in these increasingly prominent fields of research.

Publications: Alexander Firbas

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

⬅️ Zurück zum Profil

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]

Heuristic Optimization of Integrated Energy Systems – An Extension to the IESopt Framework

Sat, 01 Aug 2026 00:00:00 +0000

Lower Bounds and Algorithms for Covering Sequences of Subsets of a Finite Set

Sat, 01 Aug 2026 00:00:00 +0000

International and Organizational Activities

Thu, 05 Mar 2026 00:00:00 +0000

Günther Raidl’s International Organizational Activities

This is an almost complete list of all my international organizational activities.

Program committee member of the 14th International Conference on Swarm Intelligence (ANTS), Konstanz, Germany, October 2024.
Program committee member of the Metaheuristics International Conference (MIC 2024), Lorient, France, June 2024.
Reviewer for the University of Leuven for positions of research professors, December 2023.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2024 (EvoCOP 2024), Aberystwyth, Wales, April 2024.
Reviewer for the journal IEEE Transaction on Evolutionary Computation (TEVC), August 2023.
Reviewer for the journal Int. Transactions in Operational Research (ITOR), June 2023.
Program committee member of the 9th International Conference on Machine Learning, Optimization, and Data Science (LOD), Grasmere, Lake District, England, September 2023.
Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 19th International Conference on Computer Aided Systems Theory (EUROCAST), Gran Canaria, Spain, February 2024.
Reviewer for the Slovenian Research and Innovation Agency (ARRS), May 2023.
Reviewer for Deutsche Forschungsgemeinschaft (DFG), German Research Foundation), May 2023.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2023 (EvoCOP 2023), Brno, Czech Republic, April 2023.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2021 (EvoCOP 2022), Madrid, Spain, April 2022.
Reviewer for the Fund for Scientific Research - FNRS, Belgium, May 2023.
Reviewer for the Research Foundation Flanders, Belgium, January 2022.
Reviewer for the National Research and Development Agency, Chile, October 2021.
Program committee member for the 11th International Conference on Operations Research and Enterprise Systems (ICORES), online conference, February 2022.
Program committee member of the 13th World Congress on Nature & Biologically Inspired Computing (NaBIC), online, December 2021.
Program committee member of the International Conference on Hybrid Intelligent Systems (HIS), online, December 2021.
Reviewer for the journal Springer Nature Computer Science, August 2021.
Reviewer for the journal Neural Computing and Applications, July 2021.
Program committee member of the 6th International Conference on Machine Learning, Optimization, and Data Science (LOD), Grasmere, Lake District, England, October 2021.
Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 18th International Conference on Computer Aided Systems Theory (EUROCAST), Gran Canaria, Spain, February 2022.
Reviewer for the Journal Computers & Operations Research, June 2021.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2021 (EvoCOP 2021), Seville, Spain, April 2021.
Reviewer for the journal Int. Transactions in Operational Research (ITOR), December 2020.
Reviewer for the European Journal of Operational Research (EJOR), November 2020.
Program committee member for the 10th International Conference on Operations Research and Enterprise Systems (ICORES), online conference, February 2021.
Program Committee Member for the 8th International Conference on Variable Neighborhood Search (ICVNS2020), Abu Dhabi, U.A.E., October 2020.
Program committee member of the 1st International Workshop on Heuristic Search (HSI20) in conjunction with the Joint Conference on Artificial Intelligence (IJCAI), Yokohama, Japan, July 2020.
Program committee member of the International Joint Conference on Artificial Intelligence (IJCAI), Yokohama, Japan, July 2020.
Program committee member of the Evolutionary Combinatorial Optimization and Metaheuristics Track at the 2020 Genetic and Evolutionary Computation Conference (GECCO), Cancun, Mexico, July 2020.
Program committee member of the 6th International Conference on Machine Learning, Optimization, and Data Science (LOD), Siena, Italy, July 2020.
Program committee member of the 16th International Conference on Parallel Problem Solving from Nature (PPSN 2020), Leiden, The Netherlands, September 2020.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2020 (EvoCOP 2020), Seville, Spain, April 2020.
Program committee member of the International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR), Vienna, Austria, May 2020.
Program committee member for the 9th International Conference on Operations Research and Enterprise Systems (ICORES), Valetta, Malta, Portugal, February 2020.
Program committee member of the 12th International Conference on Swarm Intelligence (ANTS), Barcelona, Spain, October 2020.
Reviewer for the journal Evolutionary Computation, August 2019.
Reviewer for the journal Constraints, July 2019.
Associate Editor for ACM Transactions on Evolutionary Learning and Optimization, since June 2019.
Program Committee Member of the 11th International Conference on Evolutionary Computation Theory and Applications (ECTA), Vienna, Austria, September 2019.
Program committee member of the 5th International Conference on Machine Learning, Optimization, and Data Science (LOD), Siena, Italy, September 2019.
Co-Chair of the Metaheuristics Stream at Operations Research 2019 (OR 2019), Dresden, Germany, September 2019.
Program Committee Member for the 7th International Conference on Variable Neighborhood Search (ICVNS2019), Rabat, Morocco, October 2019.
Program committee member of the Evolutionary Combinatorial Optimization and Metaheuristics Track at the 2019 Genetic and Evolutionary Computation Conference (GECCO), Prague, Czech Republic, July 2019.
Program committee member of the Metaheuristics International Conference (MIC 2019), Cartagena, Colombia, July 2019.
Reviewer for the Swiss National Science Foundation, December 2018.
Reviewer for the 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Berlin, Germany, March 2019.
Reviewer for the journal OMEGA, September 2018.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2019 (EvoCOP 2019), Leipzig, Germany, April 2019.
Speaker at the Metaheuristcs Summer School 2018 (MESS), Acireale, Sicily, July 2018.
Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 17th International Conference on Computer Aided Systems Theory (EUROCAST), Gran Canaria, Spain, February 2018.
Program committee member of the 11th Workshop on Hybrid Metaheuristics (HM 2019), Conception, Chile, January 2019.
Steering committee member of EvoAPPS, the Int. Conference Series on Applications of Evolutionary Computation, since March 2018.
Reviewer for the Research Foundation Flanders, Belgium, March 2018.
Reviewer for the Central European Journal of Operations Research (CJOR), March 2018.
PhD examiner for the Unviersity of Antwerp, Belgium, May 2018.
Program committee member of the 4th International Conference on Machine Learning, Optimization, and Data Science (LOD), Volterra, Italy, September 2018.
Program committee member of the 2018 IEEE Congress on Evolutionary Computation (CEC 2018), Rio de Janeiro, Brazil, July 2018.
Program committee member of the 11th International Conference on Swarm Intelligence (ANTS), Rome, Italy, October 2018.
Program committee member of the 12th International Conference on Practice and Theory of Automated Time Tabling (PATAT 2018), Vienna, Austria, August 2018.
Program committee member of the 15th International Conference on Parallel Problem Solving from Nature (PPSN 2018), Coimbra, Portugal, September 2018.
Editorial board member of the Metaheuristics journal, Springer, since January 2018.
Program committee member of the Evolutionary Combinatorial Optimization and Metaheuristics Track at the 2018 Genetic and Evolutionary Computation Conference (GECCO), Kyoto, July 2018.
Program committee member of Matheuristics 2018, the International Workshop on Model Based Metaheuristics, Tours, France, June 2018.
Research proposal evaluator for the Cyprus Research Promotion Foundation (RPF), September 2017.
Program Committee Member for the 6th International Conference on Variable Neighborhood Search (ICVNS2018), Sithonia, Greece, October 2018.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2018 (EvoCOP 2018), Parma, Italy, April 2017.
Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Madeira, Portugal, January 2018.
Local Organization Committee member of the ALGO 2017 congress, Vienna, September 2017.
Reviewer for the 8th Int. Conference on Computational Logistics (ICCL 2017), Southampton, UK, October 2017.
Reviewer for the EURO Working Group on Transportation Meeting, Budapest, September 2017.
Reviewer for the Journal of Discrete Algorithms, April 2017.
Reviewer for the Research Foundation Flanders, Belgium, April 2017.
Reviewer for the Journal of Combinatorial Optimization, April 2017.
PhD examiner for the University of Adelaide, Australia, March 2017.
Reviewer for Int. Conf. on Optimization and Decision Science (ODS 2017), XLVII Meeting of AIRO, Sorrento, Italy, September 2017.
Program committee member of the Metaheuristics International Conference (MIC 2017), Barcelona, Spain, July 2017.
Reviewer for the Journal Computers & Operations Research, January 2017.
Program committee member of the 2017 IEEE Congress on Evolutionary Computation (CEC 2017), San Sebastian, Basque Country, June 2017.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2017 (EvoCOP 2017), Amsterdam, The Netherlands, April 2017.
Reviewer for the Journal International Transactions in Operational Research, November 2016.
Program committee member of the Generally Evolutionary Computation and Hybrids Track at the 2017 Genetic and Evolutionary Computation Conference (GECCO), Berlin, Germany, July 2016.
Reviewer for the 11th Conference and Workshops on Algorithms and Computation (WALCOM), Hsinchu, Japan, March 2017.
Referee for the Austrian Exchange Service (Österreichischen Austauschdienst), September 2016.
Reviewer for the Central European Journal of Operations Research, September 2016.
Reviewer for the Journal of Heuristics, August 2016.
Reviewer for the European Journal of Operational Research, August 2016.
Reviewer for the Journal Computers & Operations Research, August 2016.
Reviewer for the Journal Parallel and Distributed Systems, June 2016.
Program Committee Member for the 4nd International Conference on Variable Neighborhood Search (VNS2016), Malaga, Spain, October 2016.
Reviewer for the Journal of Heuristics, May 2016.
Reviewer for the Journal Transportation Research Part B, May 2016.
Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Porto, Portugal, February 2017.
Program committee member of the 5th International Conference on Computational Logistics (ICCL), Lisbon, Portugal, September 2016.
Reviewer for the Research Foundation Flanders, Belgium, March 2016.
Reviewer for 4th International Symposium on Combinatorial Optimization (ISCO), Salerno, Italy, May 2016.
Program committee member of the 2016 IEEE Congress on Evolutionary Computation (CEC), Vancouver, Canada., July 2016.
Program committee member of the 10th International Conference on Swarm Intelligence (ANTS), Brussels, Belgium, September 2016
Program committee member of the 6th International Workshop on Model Based Metaheuristics (Matheuristics), Brussels, Belgium, September 2016
Management Board Member of the EU COST Action CA15140 Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice (ImAppNIO), since January 2016
Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 16th International Conference on Computer Aided Systems Theory (EUROCAST), Gran Canaria, Spain, February 2017.
Reviewer for the Japan Society for the Promotion of Science (JSPS), January 2016
Program committee member of the 6th International Conference on Metaheuristics and Nature Inspired Computing (META'2016), Marrakech, Morocco, October 2016
Program committee member of the Second International Workshop on Machine learning, Optimization and big Data (MOD 2016), Volterra, Italy, August 2016
Program committee member of the Evolutionary and Combinatorial Optimization and Metaheuristic Track at the 2016 Genetic and Evolutionary Computation Conference (GECCO), Denver, Colorado, July 2016.
PhD referee for the Tel Aviv University, Israel, December 2015
Reviewer for the 2016 European Control Conference (ECC 2016), Aalborg, Denmark, December 2016
Reviewer for The Netherlands Organisation for Scientific Research (NWO, the Dutch Research Council), September 2015.
Steering committee and program committee member of the 10th Workshop on Hybrid Metaheuristics (HM 2016), Plymouth, UK, June 2016.
Reviewer for a staff promotion at the University of Adelaide, Australia, August 2015.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2015 (EvoCOP 2016), Porto, Portugal, March 2016.
PhD examiner for the University of Adelaide, Australia, April 2015.
Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Rome, Italy, February 2016.
Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Dubai, January 2015.
Program committee member of the Evolutionary and Combinatorial Optimization and Metaheuristic Track at the 2015 Genetic and Evolutionary Computation Conference (GECCO), Madrid, Spain, July 2015.
Program committee member of the 6th International Conference on Computational Logistics (ICCL), Delft, The Netherlands, September 2015.
Reviewer for the International Journal of Soft Computing and Networking (IJSCN), October 2014.
Reviewer for the journal Computers & Operations Research (COR), August 2014.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2015 (EvoCOP 2015), Copenhagen, Denmark, April 2015.
Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 15th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, February 2015.
Reviewer for the Slovenian Research Agency, August 2014.
Reviewer for the Danish Council for Independent Research (DFF-YDUN), July 2014.
Reviewer for the Journal Optimization Methods and Software, June 2014.
Program committee member of the 3rd Int. IFToMM Conference on Graph Modelling in Engineering (GME), Bielsko-Biala, Poland, September 2015.
Program committee member of the 5th International Conference on Computational Logistics (ICCL), Valparaíso, Chile, September 2014.
Program committee member of the Learning and Intelligent Optimization (LION9), Lille, France 2015.
Member of the advisory board of the Memetic Computing Lab (McLab) at the School of Computer Science, China University of Geosciences, since March 2014.
Reviewer for the Journal Transportation Science, April 2014.
Reviewer for the European Journal on Operational Research (EJOR), October 2014.
Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Dubai, UAE, January 2015.
Steering committee and program committee member of the 9th Workshop on Hybrid Metaheuristics (HM 2014), Hamburg, Germany, June 2014.
Reviewer for the 22nd European Conference for Information Systems (ECIS), Tel Aviv, June 2014.
Program Committee Member for the 3nd International Conference on Variable Neighborhood Search Metaheuristic, Djerba, Tunisia, October 2014.
Program committee member of the 4th International Conference on Metaheuristics and Nature Inspired Computing (META 14), Marakkech, Morocco, October 2014.
Program committee member of the 5th International Conference on Computational Logistics, September 2014.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2014 (EvoCOP 2014), Baeza, Spain, April 2014.
Program committee member of the Learning and Intelligent Optimization (LION8), Gainsville, Florida 2014.
Co-editor of the special issue on Metaheuristics of the Journal of Heuristics, August 2013.
Reviewer for the Journal of Heuristics, August 2013.
Co-Chair of the Evolutionary Combinatorial Optimization and Metaheuristics Track at the 2014 Genetic and Evolutionary Computation Conference (GECCO), Vancouver, Canada July 2014.
Reviewer for the journal BISE / Wirtschaftsinformatik, August 2013.
Reviewer for Computers & Operations Research, July 2013.
Program committee member for the International Conference on Operations Research and Enterprise Systems (ICORES), Angers, France, March 2014.
Reviewer for Networks, June 2013.
Executive Board member of ÖGOR, the Austrian Society of Operations Research, since January 2013.
Reviewer for the IMA Journal of Management Mathematics, March 2013.
Reviewer for the University of Antwerp for academic staff promotion, March 2013.
Reviewer for Transportation Science, March 2013.
Reviewer for the European Journal on Operational Research (EJOR), February 2013.
Reviewer for Networks, February 2013.
Program committee member of the 8th Workshop on Hybrid Metaheuristics (HM 2010), Ischia, Italy, May 2013.
Program committee member of The 1st IEEE International Workshop on Architecture, Design, Deployment and Management of Networks & Applications (ADMNET) at the 37th Annual International Computer Software & Applications Conference, Kyoto, Japan, July 2013.
Local Co-Organizer of EvoStar 2013, The Leading European Event on Bioinspired Computation, Vienna, Austria, April 2013.
Program Chair of the 10th Metaheuristic International Conference (MIC) 2013, Singapore, August 2013.
Co-Chair of the Workshop on Theory and Applications of Metaheuristic Algorithms at the 14th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, February 2013.
Reviewer for the Journal of Global Optimization, January 2013.
Reviewer for the International Network Optimization Conference (INOC) 2013, Tenerife, Spain, May 2013.
Program committee member of the Evolutionary & Metaheuristic Combinatorial Optimization Track at the 2012 Genetic and Evolutionary Computation Conference (GECCO), Amsterdam, The Netherlands, July 2013.
Program committee member of LION 7, the 7th Learning and Intelligent Optimization Conference, Catania, Italy, January 2013.
Reviewer for the Journal Soft Computing, September 2012
Reviewer for the Journal Flexible Services and Manufacturing, June 2012
Reviewer for the French Research National Agency (SPAHI), June 2012
Reviewer for the Journal of Combinatorial Optimization, June 2012
Program committee member of Matheuristics 2012, the Fourth International Workshop on Model Based Metaheuristics, Angra dos Reis, Rio de Janeiro, Brazil, September 2012
EvoStar Award for Outstanding Contribution to Evolutionary Computation in Europe, April 2012
Reviewer for the French Research National Agency (SPAHI), March 2012
External PhD reviewer for the Universitat Politecnica de Catalunya (UPC), Barcelona, Spain, February 2012
Program committee member of the 9th Int. Conf. on Simulated Evolution And Learning (SEAL 2012), Hanoi, Vientam, December 2012
Reviewer for a PhD thesis at the Universitat Politecnica de Catalunya (UPC), Barcelona, Spain, February 2012.
IEEE Computational Intelligence Society Emergent Technology Technical Committee Member (IEEE CIS ETTC), 2012.
Program committee member of the Evolutionary & Metaheuristic Combinatorial Optimization Track at the 2012 Genetic and Evolutionary Computation Conference (GECCO), Philadelphia, July 2012.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2012, Malaga, Spain, April 2012.
Reviewer for the Journal RAIRO - Operations Research, October 2011.
Program committee member of the 12th International Conference on Parallel Problem Solving from Nature (PPSN 2012), Taormina, Italy, September 2012.
Reviewer for the Journal Mathematical Methods of Operations Research, October 2011.
Program committee member of LION 6, the 6th Learning and Intelligent Optimization Conference, Paris, January 2012.
Program committee member of ANTS 2012, the 8th International Conference on Swarm Intelligence, Brussels, Belgium, September 2012.
Program Committee Member for the 2nd International Conference on Variable Neighborhood Search Metaheuristic, Montenegro, October 2012.
Reviewer for Deutsche Forschungsgemeinschaft (DFG, German Research Foundation), September 2011.
Reviewer for the Austrian Exchange Service (Österreichischen Austauschdienst), September 2011.
Committee member of the ÖGOR Bank Austria Unicredit Dissertationspreis (PhD dissertation award of the Austrian Operations Research Society), August 2011.
Reviewer for the IEEE Transactions on Evolutionary Computation, July 2011.
Reviewer for the Journal Natural Computing, June 2011.
Reviewer for the Journal Discrete Applied Mathematics, February 2011.
Program committee member of the 11th IEEE/IPSJ International Symposium on Applications and the Internet, Munich, Germany, July 2011.
Reviewer for the 10th International Symposium on Experimental Algorithms, Chania, Greece, May 2011.
Co-Chair of the 2nd Workshop on Heuristic Methods for the Design, Deployment, and Reliability of Networks and Network Applications (HEUNET 2011) in conjunction with the 11th IEEE/IPSJ Symposium on Applications & the Internet (SAINT 2011), Munich, Germany, July 2011.
Reviewer for the Journal Mathematical Programming Computation, January 2011.
Reviewer for the journal Mathematical Problems in Engineering, November 2010.
Reviewer for the Central European Journal of Operations Research, October 2010.
Advisory board member of the 25th (Jubilee) European Conference on Modelling and Simulation (ECMS) 2011, Cracow, Poland, June 2011.
Program committee member of the 9th Metaheuristics International Conference (MIC) 2011, Udine, Italy, July 2011.
Reviewer for the IEEE Transactions on Evolutionary Computation, August 2010.
Guest-Editor of the Special Issue on Intelligent Computational Tools for Routing in Distribution Planning of the Journal Advances in Decision Science, 2010.
Co-Chair of the Third International Workshop on Information Network Design at the International Conference on Intelligent Networking and Collaborative Systems (INCoS 2010), Thessaloniki, Greece, November 2010.
Co-Chair of the Evolutionary & Metaheuristic Combinatorial Optimization Track at the 2011 Genetic and Evolutionary Computation Conference (GECCO), Dublin, Ireland, July 2011.
Co-Chair of the Workshop on Heuristic Problem Solving at the 13th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, February 2011.
Reviewer for the Central European Journal of Operations Research, July 2010.
Program committee member of the Learning and Intelligent Optimization (LION5), Rome, Italy, January 2011.
Reviewer for a PhD thesis at the Brno University of Technology, Brno, Czech Republic, March 2010
Program committee member of the International Network Optimization Conference (INOC) 2011, Hamburg, Germany, 2011
Reviewer for the Journal of Heuristics, April 2010.
Reviewer for the journal Mathematical Methods of Operations Research, March 2010.
Reviewer for the journal OR Spectrum, February 2010.
Reviewer for the journal Information Sciences, February 2010.
Reviewer for the Journal Annals of Mathematics and Artificial Intelligence, November 2009.
Reviewer for the Journal Applied Computational Intelligence and Soft Computing, October 2009.
Reviewer for the Journal Computers and Operations Research, October 2009.
Program committee member of the 11th International Conference on Parallel Problem Solving From Nature (PPSN), Krakow, Poland, September 2010.
Program committee member of the Combinatorial Optimization and Metaheuristics Track at the Genetic and Evolutionary Computation Conference (GECCO) 2010, Portland, Oregon, July 2010.
Program committee member of the International Conference on Metaheuristics and Nature Inspired Computing (META10), Djerba Island, Tunisia, October 2010.
Program committee member of the International Conference on Intelligent Networking and Collaborative Systems (WIND09), Barcelona, Spain, November 2009.
Program committee member of the Learning and Intelligent Optimization (LION4), Venice, Italy, January 2010.
Reviewer for Optimization Methods and Software, February 2008.
Editor-in-Chief and Program Chair of GECCO 2009, the 11th Annual Conference on Genetic and Evolutionary Computation, ACM, Montreal, Canada, July 2009.
Co-Chair of the Workshop on Heuristic Problem Solving at the 12th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, February 2009.
Co-Chair of the Workshop on Heuristic Methods for the Design, Deployment, and Reliability of Networks and Network Applications (HEUNET 2008) at the 2008 International Symposium on Applications and the Internet, Turku, Finland, July 2008.
Program committee member of the 6th Int. Workshop on Hybrid Metaheuristics, Udine, Italy, October 2009.
Reviewer for the European Journal on Operational Research (EJOR), January 2008.
Program committee member of the workshop SLS 2009, Engineering Stochastic Local Search Algorithms - Designing, Implementing and Analyzing Effective Heuristics, Brussels, Belgium, September 2009.
Member of the editorial board of the Internatianal Journal of Artificial Evolution and Applications, Hindawi Publishing, invited November 2008.
Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Hawaii, March 2009.
Program committee member of the World Congress on Nature & Biologically Inspired Computing (NaBIC), Orissa, India, February 2009
Reviewer for the journal Theoretical Computer Science, Elsevier, August 2008.
Reviewer for the journal Algorithmica, June 2008.
Program Committee member of the International Conference on Metaheuristics and Nature Inspired Computing, Tunisia, October 2008
Program committee member of the Learning and Intelligent Optimization (LION3), Trento, January 2009.
Program committee member of the Workshop on Hybrid Metaheuristics, Malaga, Spain, October 2008.
Reviewer for the IEEE Transactions on Evolutionary Computation, January 2008.
Reviewer for the Journal Annals of Operations Research, January 2008.
Program committee member of the International Conference on Parallel Problem Solving from Nature (PPSN), Dortmund, Germany, September 2008.
Program committee member of the World Congress on Computational Intelligence, Hong Kong, June 2008.
Reviewer for the Journal Swarm Intelligence, November 2007.
Reviewer for the Journal Information Systems and Operational Research (INFOR), November 2007.
Program committee member of the European Workshop on Intelligent Computational Methods and Applied Mathematics (ICMAM2008), Cracow, March 2008.
Reviewer for the journal Algorithmica, November 2007.
Program committee member of the International Conference on Hybrid Intelligent Systems (HIS'08), Barcelona, Spain, September 2008.
Reviewer for the Computers & Operations Researc Journal, November 2007.
Reviewer for the INFORMS Journal on Computing, October 2007.
Program committee member of EvoPhD 2008, the second European Graduate Workshop on Evolutionary Computation, Napels, Italy, April 2008.
Program committee member of the Evolutionary Computation in Combinatorial Optimization Conference 2008 (EvoCOP 2008), Naples, Italy, April 2008.
Reviewer for the Journal Engineering Optimization, September 2007.
Reviewer for the Journal of Artificial Evolution and Applications, September 2007.
Associate editor of the International Journal of Metaheuristics, Inderscience, since October 2007.
Editorial board member of the journal Memetic Computing, Springer, since October 2007.
Reviewer for the Applied Artificial Intelligence (AAI) Journal, September 2007.
Program committee member of the 23. ACM Symposium on Applied Computing, Forteleza, Brazil, March 2008.
Program committee member of Matheuristics 2008, the Second International Workshop on Model Based Metaheuristics, Bertinoro, Italy, June 2008.
Reviewer for the IEEE Transactions on Evolutionary Computation, July 2007.
Program committee member of the Genetic and Evolutionary Computation Conference 2008, July 2008.
Reviewer for the European Journal of Operational Research, May 2007.
Program committee member of the 4th Workshop on Hybrid Metaheuristics (HM 2007), Dortmund, Germany, October 2007.
Reviewer for the Evolutionary Computation Journal, April 2007.
Program committee member for the special session Analysis of Genetic Representations and Operators (AGRO 2007) at the IEEE Conference on Evolutionary Computation, Singapore, September 2007.
Program committee member of MIC 2007, the 7th Metaheuristics International Conference, Montreal, Canada, June 2007.
Reviewer for the Journal of Heuristics, February 2007.
Program committee member of the 2nd Int. Workshop on Hybrid Artificial Intelligence Systems (HAIS 2007), November 2007.
Program committee member of the Evolution Artificielle conference, Tours, France, October 2007.
Reviewer for the Evolutionary Computation Journal, January 2007.
Member of the editorial board of the Journal of Artificial Evolution and Applications, Hindawi Publishing, since January 2007.
Reviewer for the IEEE Transactions on Evolutionary Computation, IEEE Press, January 2007.
Reviewer for the ACM Journal of Experimental Algorithms, December 2006.
Reviewer for the Slovak Research and Development Agency, December 2006.
Reviewer for the INFORMS Journal on Computing, October 2006.
Reviewer for the European Journal on Operational Research (EJOR), October 2006.
Reviewer for Networks (journal), special issue on trees, September 2006.
Program committee member of the Formal Theory Track at the Genetic and Evolutionary Computation Conference (GECCO) 2007, London, U.K., July 2007.
Program committee member of the workshop SLS 2007, Engineering Stochastic Local Search Algorithms - Designing, Implementing and Analyzing Effective Heuristics, Brussels, Belgium, September 2007.
Program committee member of the 1st IEEE Symposium on Foundations of Computational Intelligence (FOCI'07), Honolulu, Hawaii, April 2007.
Referee for the Austrian Exchange Service (Österreichischen Austauschdienst), since September 2006.
Program committee member of the 2006 International Conference on Hybrid Intelligent Systems (HIS), Auckland, New Zealand, December 2006.
Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Seoul, Korea, March 2007.
Program committee member of EvoPhD 2007, the second European Graduate Workshop on Evolutionary Computation, Valencia, Spain, April 2007.
Member of the scientific committee of IWINAC-2007, the 2nd Int. Work-Conference on the Interplay between Natural and Artificial Computation, 2007.
Reviewer for the Special Issue on Variable Neighborhood Search of the European Journal of Operational Research, 2006.
Reviewer for the post-conference publications of the Applications of Operational Research for Development (ORPA) 2005 Conference, 2006.
Founder and steering committee member of EvoCOP, the series of European Conferences on Evolutionary Computation in Combinatorial Optimization, since 2001.
Reviewer for the journal Theoretical Computer Science, Elsevier, since April 2006.
Advisory board member of the ECAI Workshop on Evolutionary Computation, Riva del Garda, August 2006.
Review panel member of the Academy of Finland, Research Council for Natural Sciences and Engineering, in the fields of computer science, since March 2006.
Reviewer for the the special issue “Bio-inspired Metaheuristics for Compbinatorial Optimization Problems” of the journal Computers and Operations Research, January 2006.
Reviewer for The Netherlands Organisation for Scientific Research (NWO, the Dutch Research Council), since February 2006.
Reviewer for the journal Computers & Industrial Engineering, Elsevier, since February 2006.
Reviewer for the First Conference on Operational Research Practice in Africa, ORPA 2005, post conference proceedings, 2005.
Program committee member of the 3rd Int. Workshop on Hybrid Metaheuristics, Gran Canaria, Spain, October 2006.
Reviewer for the Int. Journal of Computational Intelligence Research, since December 2005.
Reviewer for the journal Natural Computing, since October 2005.
Chair of the Evolutionary Computation in Combinatorial Optimization Conference 2006 (EvoCOP 2006), Budapest, Hungary, April 2004.
Program committee member of EvoPhD 2006, the first European Graduate Workshop on Evolutionary Computation, Budapest, Hungary, April 2006.
Program committee member of EvoComNet 2006, the third Workshop on Evolutionary Computation in Communications, Networks, and Connected Systems, Budapest, Hungary, April 2006.
Program committee member of the Ninth International Conference on Parallel Problem Solving from Nature, Reykjavic, Iceland, September 2006.
Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Dijon, France, April 2006.
Program committee member of the 2005 International Conference on Hybrid Intelligent Systems (HIS), Rio de Janeiro, Brazil, November 2005.
Reviewer for the Journal Discrete Optimization, since April 2003.
Program committee member of the International Conference on Machine Intelligence (ACIDCA-ICMI) 2005, Tozeur, Tunisia, November 2005.
Reviewer for the Journal of Operational Research Society (JORS), since March 2005.
Reviewer for the Journal of Mathematical Modelling and Algorithms, since March 2005.
Referee for the 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Orlando, FL, July 2005.
Program committee member of the 10th Online World Conference on Soft Computing in Industrial Applications, Cranfield University, U.K., September 2005.
Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Santa Fe, New Mexico, March 2005.
Reviewer for the ACM-SIAM Symposium on Discrete Algorithms 2005, Bancouver, British Columbia, January 2005.
Associate editor of the Evolutionary Computation Journal, MIT Press, since January 2006.
Program committee member of the 4th EU/ME Workshop on Design and Evaluation of Advanced Hybrid Metaheuristics, Nottingham. U.K., November 2004.
Program committee member of the 7th International Conference on Artificial Evolution, Lille, France, October 2005.
Program committee member of EvoComNet 2005, the second Workshop on Evolutionary Computation in Communications, Networks, and Connected Systems, Lausanne, Switzerland, April 2006.
Chair of the Evolutionary Combinatorial Optimization Track at the 2005 Genetic and Evolutionary Computation Conference (GECCO), Washington D.C., June 2005.
Technical co-chair of the 2005 IEEE Congress on Evolutionary Computation (CEC), Edinburgh, U.K., September 2005.
Chair of the Evolutionary Computation in Combinatorial Optimization 2005 Conference (EvoCOP 2005), Lausanne, Switzerland, April 2004.
Program committee member of the 2004 International Conference on Hybrid Intelligent Systems (HIS), Kitakyushu, Japan, December 2004.
Reviewer for the journal Machine Graphics & Vision, March 2004.
Program committee member of MIC 2005, the 6th Metaheuristics International Conference, Vienna, ia, August 2005.
Reviewer for the special issue of Computers and Operations Research on Logistics of Health Care Management, December 2003.
Reviewer for the INFORMS Journal on Computing, since December 2003
Program committee member of the Eigth International Conference on Parallel Problem Solving from Nature, Birmingham, U.K., September 2004.
Program committee member of the IEEE Congress on Evolutionary Computation 2004, Portland, Oregon, June 2004.
Reviewer for the European Journal of Operational Research, since August 2004.
Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Nicosia, Cyprus, March 2004.
Program committee member of EvoComNet 2004, the first Workshop on Evolutionary Computation in Communications, Networks, and Connected Systems, Coimbra, Portugal, April 2004.
Chair of the Evolutionary Computation in Combinatorial Optimization 2004 (EvoCOP 2004), Coimbra, Portugal, April 2004.
Chair of EvoWorkshops 2004, Coimbra, Portugal, April 2004.
Chair of the Fourth European Conference on Evolutionary Computation in Combinatorial Optimization 2004 (EvoCOP 2004), Coimbra, Portugal, April 2004.
Program committee member of the IEEE Congress on Evolutionary Computation 2003, Canberra, Australia, December 2003.
Reviewer for the Journal of Systemics, Cybernetics and Informatics, since Mai 2003.
Program committee member of the 30th Int. Colloquium on Automata, Languages, and Programming (ICALP 2003), Workshop on Fundamentals of Evolutionary Algorithms, Eindhoven, The Netherlands, July 2003.
Referee for the 7th World Multi-Conference on Systemics, Cybernetics and Informatics, Orlando, FL, July 2003.
Reviewer for the IMA Journal of Applied Mathematics, March 2003.
Program committee member of the 3rd International Conference on Hybrid Intelligent Systems (HIS 2003), Melbourne, Australia, December 2003.
Program committee member of the 2003 Workshop on Analysis and Design of Representations and Operators (ADoRO), Chicago, USA, July 2003.
Member of the organizing committee of the 2003 Workshop on Application of Hybrid Evolutionary Algorithms to NP-Complete Problems (EvoHybridNP), Chicago, USA, July 2003.
Program committee member of the 4th International Workshop on Memetic Algorithms (WOMA IV), Chicago, USA, July 2003.
Reviewer for the GRAPHIT2003 International Conference on Computer Graphics and Interactive Techniques in Australasia and South East Asia, Melbourne, Australia, February 2003.
Chair of EvoWorkshops 2003, proceedings editor, and chair of the Third European Workshop on Evolutionary Computation in Combinatorial Optimization 2003, Essex, U.K., April 2003.
Reviewer for the jubilee fund of the Austrian national bank (Jubiläumsfond der Österreichischen Nationalbank), 2002.
Program committee member of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Melbourne, FL, March 2003.
Reviewer for the Metaheuristics International Conference (MIC) 2001 book, May 2002.
Program committee member of the 2nd International Conference on Hybrid Intelligent Systems (HIS'02), Santiago, Chile, December 2002.
Program committee member of the Mendel 2002 International Conference on Soft Computing, Brno, Czech Republic, June 2002.
Reviewer for the Science Foundation Ireland, since November 2001.
Program committee member of the Workshop on Representations for Genetic and Evolutionary Algorithms 2002, New York, July 2002.
Program committee member of the Genetic and Evolutionary Computation Conference 2002, New York, July 2002.
Referee for the 15th European Conference on Artificial Intelligence, Lyon, France, July 2002.
Referee for the Journal of Heuristics, since September 2001.
Referee for Applied Mathematics Letters (journal), since June 2001.
Chair and proceeding’s editor of the Second European Workshop on Evolutionary Computation in Combinatorial Optimization 2002, Kinsale, Ireland, April 2002.
Referee for Operations Research (INFORMS journal), since May 2001.
Program committee member of the Seventh International Conference on Parallel Problem Solving from Nature, Granada, Spain, September 2002.
Program committee member of the IEEE Congress on Evolutionary Computation, Hawaii, May 2002.
Co-chair of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Madrid, Spain, March 2002.
Chair and proceeding’s editor of the First European Workshop on Evolutionary Computation in Combinatorial Optimization 2001, Como, Italy, April 2001.
Referee for the IEEE Transactions on Systems, Man, and Cybernetics (journal), IEEE Press, since March 2001.
Referee for the European Symposium on Algorithms 2001, Aarhus, Denmark, August 2001
Referee for the 5th World Multi-Conference on Systemics, Cybernetics and Informatics, Orlando, FL, July 2001.
Referee for the Information Processing Letters (journal), Elsevier, since December 2000.
Program committee member of the Genetic and Evolutionary Computation Conference 2001, San Francisco, CA, July 2001.
Program committee member of the Workshop on Representations and Operators for Network Problems at the Genetic and Evolutionary Computation Conference 2001, San Francisco, CA, July 2001.
Scientific board member of the 6th Online World Conference on Soft Computing in Industrial Applications, September 2001.
Program committee member of the IEEE Congress on Evolutionary Computation, Seoul, Korea, May 2001.
Referee for the IEEE Transactions on Evolutionary Computation (journal), IEEE Press, since September 2000.
Co-chair of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Las Vegas, NV, March 2001.
Program committee member of the International Symposium on Computational Intelligence, Kosice, Slovakia, September 2000.
Program committee member of the Genetic and Evolutionary Computation Conference, Las Vegas, NV, July 2000.
Referee for Information Science (journal), Elsevier Science, since May 2000.
Co-chair of the ACM Symposium on Applied Computing, Evolutionary Computation and Optimization Track, Como, Italy, March 2000.
Referee for The Computer Journal, Oxford University Press, since Dezember 1999.
Program committee member of the Genetic and Evolutionary Computation Conference, Orlando, Florida, July 1999.
Program committee member of the 3rd Int. Mendel Conference on Genetic Algorithms, Brno, Czech Republic, June 1999.
Referee for the Computer Animation 99 conference, 1999.
Associated node member of EvoNet (European Network of Excellence in Evolutionary Computation), since 1999.
Co-editor of the proceedings of the Int. Conference on Imaging Science, Systems, and Technology, Las Vegas, NV, July 1998.
Program committee member of the 7th International Conference on Intelligent Systems, Paris, France, July 1998.

⬅ Back to Günter Raidl’s Profile

Contact

Thu, 22 Jan 2026 00:00:00 +0000

$F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness

Thu, 01 Jan 2026 00:00:00 +0000

29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20–23, 2026

Thu, 01 Jan 2026 00:00:00 +0000

A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximization

Thu, 01 Jan 2026 00:00:00 +0000

A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs

Thu, 01 Jan 2026 00:00:00 +0000

A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problem

Thu, 01 Jan 2026 00:00:00 +0000

A Fixed-Parameter Algorithm for Extending Upward Planar Drawings

Thu, 01 Jan 2026 00:00:00 +0000

A General Theoretical Framework for Learning Smallest Interpretable Models

Thu, 01 Jan 2026 00:00:00 +0000

A Parameterized-Complexity Framework for Finding Local Optima

Thu, 01 Jan 2026 00:00:00 +0000

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs

Thu, 01 Jan 2026 00:00:00 +0000

A Reinforcement Learning Guided Large Neighborhood Search for the Dynamic Electric Autonomous Dial-a-Ride Problem

Thu, 01 Jan 2026 00:00:00 +0000

A structural complexity analysis of synchronous dynamical systems

Thu, 01 Jan 2026 00:00:00 +0000

Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Design

Thu, 01 Jan 2026 00:00:00 +0000

Algorithm Selection with Zero Domain Knowledge via Text Embeddings

Thu, 01 Jan 2026 00:00:00 +0000

Annoyance Modeling in Cooperative Personnel Scheduling

Thu, 01 Jan 2026 00:00:00 +0000

ARCOL: Aspect Ratio Constrained Orthogonal Layout

Thu, 01 Jan 2026 00:00:00 +0000

ASP-Bench: From Natural Language to Logic Programs

Thu, 01 Jan 2026 00:00:00 +0000

Backdoors to Satisfaction Continued

Thu, 01 Jan 2026 00:00:00 +0000

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet

Thu, 01 Jan 2026 00:00:00 +0000

Block Crossings in One-Sided Tanglegrams

Thu, 01 Jan 2026 00:00:00 +0000

Circle Graph 3-Coloring: Can Simplicity Beat SAT?

Thu, 01 Jan 2026 00:00:00 +0000

Clarity and Computational Efficiency of Orbital Boundary Labeling

Thu, 01 Jan 2026 00:00:00 +0000

Combined Network and Set Visualization with Hoop and Linear Diagrams

Thu, 01 Jan 2026 00:00:00 +0000

Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms

Thu, 01 Jan 2026 00:00:00 +0000

Computing Twin-Width via Treedepth and Vertex Integrity

Thu, 01 Jan 2026 00:00:00 +0000

ContReAct: A Feedback-Based Architecture for Continuous Agentic Operation

Thu, 01 Jan 2026 00:00:00 +0000

Coordinated Motion Planning Is FPT on Discretized Simple Polygons

Thu, 01 Jan 2026 00:00:00 +0000

CP-Agent: Agentic Constraint Programming

Thu, 01 Jan 2026 00:00:00 +0000

Dataset of Electric Autonomous Dial-a-Ride Instances with Local Energy Communities and Electricity Tariffs

Thu, 01 Jan 2026 00:00:00 +0000

Determining Destroy Sets in Large Neighborhood Search by Generative Flow Networks

Thu, 01 Jan 2026 00:00:00 +0000

Efficient reversal of transductions of sparse graph classes

Thu, 01 Jan 2026 00:00:00 +0000

Fair Correlation Clustering Meets Graph Parameters

Thu, 01 Jan 2026 00:00:00 +0000

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees

Thu, 01 Jan 2026 00:00:00 +0000

Formally Verified Graph Generation with SAT Modulo Symmetries and Lean

Thu, 01 Jan 2026 00:00:00 +0000

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem

Thu, 01 Jan 2026 00:00:00 +0000

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time

Thu, 01 Jan 2026 00:00:00 +0000

Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy

Thu, 01 Jan 2026 00:00:00 +0000

Graph Choosability via SAT: Beyond the Nullstellensatz

Thu, 01 Jan 2026 00:00:00 +0000

Learning to Predict User Replies in Interactive Job Scheduling

Thu, 01 Jan 2026 00:00:00 +0000

LLM-Guided Graph Generation for Structure-Based Local Improvement Methods

Thu, 01 Jan 2026 00:00:00 +0000

LLM-Guided Semantic Vtrees for SDD Compilation

Thu, 01 Jan 2026 00:00:00 +0000

Makespan Minimization in Split Learning: From Theory to Practice

Thu, 01 Jan 2026 00:00:00 +0000

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity

Thu, 01 Jan 2026 00:00:00 +0000

MaxSAT-Based Compression for Tsetlin Machines

Thu, 01 Jan 2026 00:00:00 +0000

Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies

Thu, 01 Jan 2026 00:00:00 +0000

Multidimensional Manhattan preferences

Thu, 01 Jan 2026 00:00:00 +0000

Neurosymbolic Discovery of Algebraic Graph Constructions

Thu, 01 Jan 2026 00:00:00 +0000

Not All Degree Constraints Are Created Equal when Computing Spanning Trees

Thu, 01 Jan 2026 00:00:00 +0000

OBDDs, SDDs, and Circuits of Bounded Width: Completeness Matters

Thu, 01 Jan 2026 00:00:00 +0000

On the Complexity of Extending Storylines

Thu, 01 Jan 2026 00:00:00 +0000

On the Recognition of Outerplanar Graphs with Queue Number 1

Thu, 01 Jan 2026 00:00:00 +0000

One-Sided Local Crossing Minimization

Thu, 01 Jan 2026 00:00:00 +0000

Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints

Thu, 01 Jan 2026 00:00:00 +0000

Pairwise Reflection Symmetry in Generalized Latin Rectangles

Thu, 01 Jan 2026 00:00:00 +0000

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy

Thu, 01 Jan 2026 00:00:00 +0000

Parameterized Complexity of Efficient Sortation

Thu, 01 Jan 2026 00:00:00 +0000

Perfect Rectangular Tilings with Two Colors

Thu, 01 Jan 2026 00:00:00 +0000

Point Set Embeddability with List Constraints

Thu, 01 Jan 2026 00:00:00 +0000

Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs

Thu, 01 Jan 2026 00:00:00 +0000

Realizing Planar Linkages in Polygonal Domains

Thu, 01 Jan 2026 00:00:00 +0000

Representing Hypergraphs by Point-Line Incidences

Thu, 01 Jan 2026 00:00:00 +0000

Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii

Thu, 01 Jan 2026 00:00:00 +0000

Revisiting Large Neighborhood Search with On-the-Fly ChargingStation Insertion for the Electric Autonomous Dial-a-Ride Problem

Thu, 01 Jan 2026 00:00:00 +0000

Routing few robots in a crowded network

Thu, 01 Jan 2026 00:00:00 +0000

SAT-Based Search for Minwise Independent Families

Thu, 01 Jan 2026 00:00:00 +0000

Search Space Reduction Through Machine Learning for the Electric Autonomous Dial-A-Ride Problem

Thu, 01 Jan 2026 00:00:00 +0000

Smart Cubing for Graph Search: A Comparative Study

Thu, 01 Jan 2026 00:00:00 +0000

Streamliners for Answer Set Programming

Thu, 01 Jan 2026 00:00:00 +0000

Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking

Thu, 01 Jan 2026 00:00:00 +0000

Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problem

Thu, 01 Jan 2026 00:00:00 +0000

Synthesizing Feature Extractors: An Agentic Approach for Algorithm Selection

Thu, 01 Jan 2026 00:00:00 +0000

The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern

Thu, 01 Jan 2026 00:00:00 +0000

The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern

Thu, 01 Jan 2026 00:00:00 +0000

The Complexity of Envy-Free Graph Cutting

Thu, 01 Jan 2026 00:00:00 +0000

The Complexity of Extending Fair Allocations of Indivisible Goods

Thu, 01 Jan 2026 00:00:00 +0000

The Graph Burning Problem under Constrained Diffusion

Thu, 01 Jan 2026 00:00:00 +0000

The Parameterized Complexity of Coordinated Motion Planning

Thu, 01 Jan 2026 00:00:00 +0000

The Parameterized Complexity Of Extending Stack Layouts

Thu, 01 Jan 2026 00:00:00 +0000

The Peculiarities of Extending Queue Layouts

Thu, 01 Jan 2026 00:00:00 +0000

The Story(line) So Far: A Survey on Storyline Visualization

Thu, 01 Jan 2026 00:00:00 +0000

Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks

Thu, 01 Jan 2026 00:00:00 +0000

Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms

Thu, 01 Jan 2026 00:00:00 +0000

Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms

Thu, 01 Jan 2026 00:00:00 +0000

Using $\beta$-proximity to Reduce Distortion in Bundled Graph Drawings

Thu, 01 Jan 2026 00:00:00 +0000

VIPR Certificate Construction from Black-Box ILP Solvers

Thu, 01 Jan 2026 00:00:00 +0000

Visualizing Treewidth

Thu, 01 Jan 2026 00:00:00 +0000

New PhD: Alexander Dobler

Thu, 11 Dec 2025 00:00:00 +0000

Alexander Dobler successfully defended his PhD thesis “Algorithmic Aspects of Ordering Problems in Information Visualization” on December 11, 2025. Congratulations, Dr. Dobler!

from left to right: Kathrin Hanauer (external committee member), Alexander Dobler, Martin Nöllenburg, Markus Chimani

Alexander was a PhD student in the Algorithms and Complexity Group and worked in the project Engineering Linear Ordering Algorithms for Optimizing Data Visualizations funded by WWTF . He was supervised by Martin Nöllenburg and his external thesis reviewers were Markus Chimani and Walter Didimo .

What Happens When Computers Go Quantum?

Thu, 04 Dec 2025 00:00:00 +0000

Hartmut Neven (Google Quantum AI) will give a talk titled What Happens When Computers Go Quantum?.

Date & Time: Thu, Dec 04 2025 at 15:30 Location: Luftpavillon, Karlsplatz 13, Hof 2

Click here for more details and registration

Herbert Fleischner (1944-2025)

Wed, 05 Nov 2025 00:00:00 +0000

We are deeply saddened by the passing of Herbert Fleischner, friend and colleague. Herbert was a distinguished graph theorist whose work, including the famous Fleischner’s theorem, shaped the field.

Herbert Fleischner, who passed away on October 7, 2025, in Vienna, was a mathematician whose work shaped our understanding of graph theory. Born in London on January 29, 1944, he moved to Vienna with his parents in 1946 and remained connected to the city throughout his life, even as his career took him across continents.

Herbert studied mathematics and physics at the University of Vienna under Nikolaus Hofreiter and Edmund Hlawka, earning his PhD in 1968. His dissertation focused on Eulerian and Hamiltonian graphs, topics that would define his research for decades. While Hlawka was his official supervisor, Herbert Izbicki provided the actual guidance, being a graph theorist himself.

His most influential contribution came early in his career. In 1971, he submitted a proof showing that the square of every two-connected graph contains a Hamiltonian cycle. Published in 1974, this result became known as Fleischner’s theorem and remains a cornerstone in graph theory. The elegance of the statement, which is simple to understand yet challenging to prove, captured something essential about the structure of graphs.

Another milestone in his research was solving Paul Erdős’s “Cycle plus Triangles” problem, work he accomplished in collaboration with Michael Stiebitz. That paper appeared in 1992 in a special issue honoring Julius Petersen. His Erdős number was 2.

Herbert’s career path was anything but conventional. After positions at SUNY Binghamton and a year at the Institute for Advanced Study in Princeton, he spent most of his professional life at the Austrian Academy of Sciences, from 1973 to 2002. However, he was always on the move, traveling to Memphis, MIT, and making multiple stays in Canada, as well as regularly visiting Texas A&M. In 2003, Herbert joined TU Wien, where he continued his research as the PI of projects from the Austrian Science Funds (FWF) as part of what is now the Algorithms and Complexity Group at the Institute of Logic and Computation. In total, Herbert secured four grants from the Austrian Science Fund (FWF), one while at the Austrian Academy of Sciences, where I collaborated as a PhD student, and three at TU Wien, in collaboration with my colleague Günther Raidl. Herbert worked on graph theoretical problems until his last days.

What set Herbert apart was his commitment to mathematics education in developing countries. From the late 1990s to 2012, he worked extensively with the University of Zimbabwe, serving as the main lecturer and project coordinator for an M.Sc. program in academic staff development (1997-1999, sponsored by UNESCO and the Austrian Development Cooperation), and subsequently making regular visits for teaching and supervision through 2012. He did similar work at the University of Dar es Salaam in Tanzania from 2003 to 2009. From 2001 to 2007, he chaired the Committee for Developing Countries of the European Mathematical Society, working to strengthen mathematical research and education where it was needed most.

He supervised nine PhD students. I was fortunate to be among them. Herbert was genuinely open to ideas and topics. Some of my best memories are standing with him in front of a blackboard, working through an argument together. He’d draw a graph, we’d discuss where it might lead, and he’d push for thoroughness: every case would be considered, and every detail would be checked. Those sessions taught me what mathematical thinking, where intuition meets precision, actually looks like.

He organized workshops on the Matthews-Sumner Conjecture with Zdeněk Ryjáček in the Czech Republic, bringing together researchers who shared his passion for cycle-related problems in graphs.

Herbert wrote two volumes on Eulerian graphs, published in 1990 and 1991, that became standard references. They were translated into Russian and Chinese, a testament to their lasting value. Over his career, he published more than 90 papers. He also found an unexpected connection between mathematics and art through his friendship with painter Robert Lettner. They collaborated on a series called “mutations,” where mathematical graphs were transformed into paintings.

Herbert spoke German, English, and Russian fluently. Beyond his professional achievements, he raised his son, Michael, born in 1974, as a single father during a time when this was uncommon. Later in life, he found happiness with his wife Renata, whom he married in 2005.

Herbert Fleischner spent his life building structures: mathematical structures in graph theory, educational structures in developing countries, collaborative structures across continents. He understood that mathematics isn’t just about theorems; it’s about creating communities where ideas can grow.

We’ll miss him.

Algorithms and Complexity Group, TU Wien

Three Contest Awards for Graph Drawing Student Teams

Fri, 26 Sep 2025 00:00:00 +0000

From September 24 to 26, the 33rd International Symposium on Graph Drawing and Network Visualization took place in Norrköping, Sweden. As every year, the conference hosted the Graph Drawing Contest , in which student teams from TU Wien participated in several categories as part of the Master course Graph Drawing Algorithms taught by Martin Nöllenburg .

Winning Team in the Creative Contest 2025: Guilherme Monteiro Oliveira, Florian Saß, Jakob Speitkamp (from left to right)

In the creative contest, participants were given a network and asked to design an appealing visualization that also reveals interesting insights into the underlying data. This year’s topic centered on the Netflix series Dark: Nodes in the graph represented events in the series with their involved characters, and edges captured the cause-and-effect relationships among them. In contrast to previous years, participants had the unique opportunity to design a 360° visualization that was displayed in Norrköping’s decision arena , a cylindrical 360-degree high-resolution display with a diameter of 6 meters. In this category, our student team of Florian Saß, Jakob Speitkamp, and Guilherme Monteiro Oliveira (supervised by Thomas Depian ) won the first prize for their submission “Journey of a Time Machine”.

“Journey of a Time Machine” displayed on the 360° screen of the decision arena

In the automatic live challenge, the task was to compute layouts for several different graphs of increasing size and complexity within a timeframe of one hour. The produced layouts had to use straight edges with the aim of minimizing the maximum number of crossings on any single edge. The participating teams designed and implemented their own highly efficient algorithms for this task prior to the contest and competed against each other in the live challenge. Again, our student teams (supervised by Simon D. Fink ) excelled with their respective software developed in the Graph Drawing Algorithms course: Christoph Weber won the second prize, and the team of Stefan Brandmair and Luca Marius Cobzaru reached third place.

Congratulations to all our successful students!

Winners of the 3rd place in the automatic live challenge: Stefan Brandmair and Luca Marius Cobzaru

Second Place in the PACE Challenge for a Team of AC Group Researchers

Fri, 19 Sep 2025 00:00:00 +0000

The Parameterized Algorithms and Computational Experiments (PACE) Challenge takes place annually as part of the International Symposium on Parameterized and Exact Computation (IPEC) to deepen the relationship between parameterized algorithms and practice. The results of the 2025 iteration were presented in Warsaw, Poland, as part of ALGO 2025 from September 15-19. PACE 2025 featured two classic algorithmic problems, Dominating Set and Hitting Set . In a total of four tracks, an exact as well as a heuristic one , practical solutions to these two NP-hard problems were solicited.

Second-place winners Simon D. Fink, Alexander Dobler, and Mathis Rocton (from left to right)

The solver submitted by Alexander Dobler , Simon D. Fink and Mathis Rocton made a very close second place in both exact tracks. Their code and more information on their solver can be found on GitHub, and the full standings can be found here .

Congratulations to our successful team!

COMSOC 2025 Begins - Computational Social Choice

Wed, 17 Sep 2025 00:00:00 +0000

September 17-19, 2025 · TU Wien, Vienna, Austria

Quick Facts

Find the full program and registration details on the official site:

Visit COMSOC 2025 Website Contact

Learning and Belief Revision: an Overview

Tue, 16 Sep 2025 00:00:00 +0000

Nina Gierasimczuk will give a talk titled Learning and Belief Revision: an Overview.

Date & Time: Tue, Sep 16 2025 at 17:30 Location: Online via Zoom

Click here for more details and registration

Axioms as rules in intuitionistic logic

Mon, 23 Jun 2025 00:00:00 +0000

Sara Negri will give a talk titled Axioms as rules in intuitionistic logic.

Date & Time: Mon, Jun 23 2025 at 17:00 Location: Online via Zoom

Click here for more details and registration

Best Paper Award and Honourable Mention at EuroVis 2025

Fri, 13 Jun 2025 00:00:00 +0000

Two papers co-authored by our ESPRIT fellow Sara Di Bartolomeo received awards during the EuroVis 2025 conference, held June 2-6 in Luxembourg. The Best Paper Award went to the paper " NODKANT: Exploring Constructive Network Physicalization " written by Sara together with her co-authors Daniel Paar, Henry Ehlers, Velitchko Filipov, Christina Stoiber, Wolfgang Aigner, Hsiang-Yun Wu, and Renata Raidou. This paper explores how constructing physical models of graph data can improve people’s understanding of complex information.

A second paper, " Optimizing Staircase Motifs in Biofabric Network Layouts ", written by Sara Di Bartolomeo , Markus Wallinger , and Martin Nöllenburg received an Honourable Mention Award as one of the top-3 full papers. This paper explores exact optimization algorithms for highlighting certain subgraph motifs in the novel BioFabric network visualization style.

Congratulations to all the award recipients!

Copyrights: Lugdivine Unfer

Markus Wallinger receives EuroVis PhD Award

Fri, 13 Jun 2025 00:00:00 +0000

Markus Wallinger , who did his PhD in the Algorithms and Complexity group in 2024, received the EuroVis PhD Award for his thesis " Exploring Graph-based Concepts for Balanced Information Density in Data Visualizations " last week during the EuroVis conference in Luxembourg. This year’s EuroVis PhD Award was awarded to three young researchers and recognizes outstanding dissertations in academic research and development on topics relevant to visualization. Markus’ thesis was supervised by Martin Nöllenburg and supported by the WWTF grant " Engineering Linear Ordering Algorithms for Optimizing Data Visualizations “. Markus is now a postdoctoral researcher at TU Munich . Congratulations!

Copyrights: Lugdivine Unfer

Towards Formalizing Cyclic Tableaux and Interpolation for PDL in Lean

Wed, 11 Jun 2025 00:00:00 +0000

Malvin Gattinger will give a talk titled Towards Formalizing Cyclic Tableaux and Interpolation for PDL in Lean.

Date & Time: Wed, Jun 11 2025 at 16:00 Location: Gußhausstraße 27-29, Seminar Room 127 (third floor)

Click here for more details and registration

Logic and Computation of Social Behavior

Wed, 19 Mar 2025 00:00:00 +0000

Sonja Smets will give a talk titled Logic and Computation of Social Behavior.

Date & Time: Wed, Mar 19 2025 at 17:00 Location: Online via Zoom

Click here for more details and registration

Denoising Diffusion-Based Evolutionary Algorithms – Exploring Hybridizations of Evolutionary Algorithms with Denoising Diffusion Models

Sat, 01 Mar 2025 00:00:00 +0000

Optimizing Elevator Control with a Destination Registration System

Sat, 01 Mar 2025 00:00:00 +0000

Codd’s Theorem for Databases over Semirings

Thu, 27 Feb 2025 00:00:00 +0000

Guillermo Badia will give a talk titled Codd’s Theorem for Databases over Semirings.

Date & Time: Thu, Feb 27 2025 at 17:00 Location: Favoritenstrasse 9-11, FAV Lecture Hall 2 (ground floor)

Click here for more details and registration

Classical versus Constructive: An Ecumenical Approach

Wed, 05 Feb 2025 00:00:00 +0000

Elaine Pimentel will give a talk titled Classical versus Constructive: An Ecumenical Approach.

Date & Time: Wed, Feb 05 2025 at 16:00 Location: Online via Zoom - link for registration below

Click here for more details and registration

Explanatory Proofs: From Logic to Mathematics

Fri, 24 Jan 2025 00:00:00 +0000

A talk titled Explanatory Proofs: From Logic to Mathematics.

Date & Time: Fri, Jan 24 2025 at 17:00 Location: Online via Zoom

Click here for more details and registration

Best Paper Award at SOFSEM 2025

Thu, 23 Jan 2025 00:00:00 +0000

Thomas Depian , Simon D. Fink , Alexander Firbas , Robert Ganian , and Martin Nöllenburg received the Best Paper Award for their paper Pathways to Tractability for Geometric Thickness [ arXiv ] at the 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) held in Bratislava, Slovakia from January 20-23, 2025.

Trustable Explainable AI -- A Redemption by Logic

Tue, 14 Jan 2025 00:00:00 +0000

Joao Marques-Silva will give a talk titled Trustable Explainable AI – A Redemption by Logic.

Date & Time: Tue, Jan 14 2025 at 17:00 Location: zoom and youtube

Click here for more details and registration

A Hybrid CMSA–Column Generation Approach to Variable-Sized Bin Packing

Wed, 01 Jan 2025 00:00:00 +0000

A Learning Twolevel Optimization Approach for the Demand Maximizing Battery Swapping Station Location Problem

Wed, 01 Jan 2025 00:00:00 +0000

A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots

Wed, 01 Jan 2025 00:00:00 +0000

A note on the complexity of one-sided crossing minimization of trees

Wed, 01 Jan 2025 00:00:00 +0000

A Structural Complexity Analysis of Hierarchical Task Network Planning

Wed, 01 Jan 2025 00:00:00 +0000

An Introduction to and Survey of Biological Network Visualization

Wed, 01 Jan 2025 00:00:00 +0000

Analyzing Reformulation Performance in Core-Guided MaxSAT Solving

Wed, 01 Jan 2025 00:00:00 +0000

Approximate Evaluation of Quantitative Second Order Queries

Wed, 01 Jan 2025 00:00:00 +0000

Balancing Latin Rectangles with LLM-Generated Streamliners

Wed, 01 Jan 2025 00:00:00 +0000

Better Extension Variables in DQBF via Independence

Wed, 01 Jan 2025 00:00:00 +0000

Breaking Symmetries in Quantified Graph Search: A Comparative Study

Wed, 01 Jan 2025 00:00:00 +0000

Bridging Language Models and Symbolic Solvers via the Model Context Protocol

Wed, 01 Jan 2025 00:00:00 +0000

Bundling-Aware Graph Drawing Revisited

Wed, 01 Jan 2025 00:00:00 +0000

Complexity of Positive Influence Domination on Partial Grids

Wed, 01 Jan 2025 00:00:00 +0000

Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity

Wed, 01 Jan 2025 00:00:00 +0000

Constrained Boundary Labeling

Wed, 01 Jan 2025 00:00:00 +0000

Crossing and Independent Families Among Polygons

Wed, 01 Jan 2025 00:00:00 +0000

Extracting Problem Structure with LLMs for Optimized SAT Local Search

Wed, 01 Jan 2025 00:00:00 +0000

F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness

Wed, 01 Jan 2025 00:00:00 +0000

Generating Streamlining Constraints with Large Language Models

Wed, 01 Jan 2025 00:00:00 +0000

Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem

Wed, 01 Jan 2025 00:00:00 +0000

Geometry Matters in Planar Storyplans

Wed, 01 Jan 2025 00:00:00 +0000

Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms

Wed, 01 Jan 2025 00:00:00 +0000

Improvements in Large Neighborhood Search for the Electric Autonomous Dial-a-Ride Problem

Wed, 01 Jan 2025 00:00:00 +0000

Introducing Fairness in Network Visualization

Wed, 01 Jan 2025 00:00:00 +0000

Large and Parallel Human Sorting Networks

Wed, 01 Jan 2025 00:00:00 +0000

Learning to Select Promising Initial Solutions for Large Neighborhood Search-Based Multi-Agent Path Finding

Wed, 01 Jan 2025 00:00:00 +0000

Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime

Wed, 01 Jan 2025 00:00:00 +0000

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms

Wed, 01 Jan 2025 00:00:00 +0000

Merge-Width and First-Order Model Checking

Wed, 01 Jan 2025 00:00:00 +0000

Metric Dimension and Geodetic Set Parameterized by Vertex Cover

Wed, 01 Jan 2025 00:00:00 +0000

Network Navigation with Online Delays is PSPACE-complete

Wed, 01 Jan 2025 00:00:00 +0000

On Minimizing Wiggle in Stacked Area Charts

Wed, 01 Jan 2025 00:00:00 +0000

On Planar Unit-Length Linear Linkages in Polygonal Domains

Wed, 01 Jan 2025 00:00:00 +0000

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity

Wed, 01 Jan 2025 00:00:00 +0000

Optimizing Staircase Motifs in Biofabric Network Layouts

Wed, 01 Jan 2025 00:00:00 +0000

Optimizing Wiggle in Storylines

Wed, 01 Jan 2025 00:00:00 +0000

PACE Solver Description: Bad Dominating Set Maker

Wed, 01 Jan 2025 00:00:00 +0000

Parameterized Algorithms for Multiagent Pathfinding on Trees

Wed, 01 Jan 2025 00:00:00 +0000

Parameterized Complexity in Machine Learning

Wed, 01 Jan 2025 00:00:00 +0000

Parameterized Complexity of Caching in Networks

Wed, 01 Jan 2025 00:00:00 +0000

Partial Level Planarity Parameterized by the Size of the Missing Graph

Wed, 01 Jan 2025 00:00:00 +0000

Passenger Decision-Making in Mass Transit Systems: Insights From Dual-Process Theories

Wed, 01 Jan 2025 00:00:00 +0000

Pathways to Tractability for Geometric Thickness

Wed, 01 Jan 2025 00:00:00 +0000

Pathways to Tractability for Geometric Thickness (Best Paper Award)

Wed, 01 Jan 2025 00:00:00 +0000

Planarizing Graphs and their Drawings by Vertex Splitting

Wed, 01 Jan 2025 00:00:00 +0000

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

Wed, 01 Jan 2025 00:00:00 +0000

Representing Hypergraphs by Point-Line Incidences

Wed, 01 Jan 2025 00:00:00 +0000

Routing Few Robots in a Crowded Network

Wed, 01 Jan 2025 00:00:00 +0000

SAT Modulo Symmetries: A Survey

Wed, 01 Jan 2025 00:00:00 +0000

Selecting User Queries in Interactive Job Scheduling

Wed, 01 Jan 2025 00:00:00 +0000

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Wed, 01 Jan 2025 00:00:00 +0000

StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Data

Wed, 01 Jan 2025 00:00:00 +0000

StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners

Wed, 01 Jan 2025 00:00:00 +0000

Structural Parameterizations of Simultaneous Planarity

Wed, 01 Jan 2025 00:00:00 +0000

Tackling the Alpha-Domination Problem Heuristically

Wed, 01 Jan 2025 00:00:00 +0000

The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators

Wed, 01 Jan 2025 00:00:00 +0000

The complexity of cluster vertex splitting and company

Wed, 01 Jan 2025 00:00:00 +0000

The Complexity of Extending Fair Allocations of Indivisible Goods

Wed, 01 Jan 2025 00:00:00 +0000

The complexity of optimizing atomic congestion

Wed, 01 Jan 2025 00:00:00 +0000

The Computational Complexity of Positive Non-Clashing Teaching in Graphs

Wed, 01 Jan 2025 00:00:00 +0000

The Peculiarities of Extending Queue Layouts

Wed, 01 Jan 2025 00:00:00 +0000

Training One-Dimensional Graph Neural Networks is NP-Hard

Wed, 01 Jan 2025 00:00:00 +0000

Transitions in Dynamic Point Labeling

Wed, 01 Jan 2025 00:00:00 +0000

Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach

Wed, 01 Jan 2025 00:00:00 +0000

Visualizing Treewidth

Wed, 01 Jan 2025 00:00:00 +0000

NL interface of PROLEG system and extracting normative sentences from German traffic judgements

Mon, 09 Dec 2024 00:00:00 +0000

Ken Satoh (NII Tokyo) will give a talk titled NL interface of PROLEG system and extracting normative sentences from German traffic judgements.

Date & Time: Mon, Dec 09 2024 at 14:30 Location: Favoritenstrasse 9-11, Seminar Room FAV 3 Zemanek

Click here for more details and registration

Markus Wallinger receives Award of Excellence for his PhD Thesis

Thu, 05 Dec 2024 00:00:00 +0000

Our former group member Markus Wallinger won the Award of Excellence by the Federal Ministry for Education, Science and Research . This state prize is awarded annually to 40 outstanding dissertations completed at all Austrian universities and in all subjects. Markus, as one of only four researchers of TU Wien, received this prestigious award on December 5, 2024 for his dissertation " Exploring Graph-based Concepts for Balanced Information Density in Data Visualizations “, supervised by Martin Nöllenburg . Markus is now a postdoctoral researcher at the Chair of Efficient Algorithms at TU Munich. Congratulations, Markus!

Thomas Depian receives State Prize for his Master's Thesis

Thu, 21 Nov 2024 00:00:00 +0000

Our group member Thomas Depian won the Appreciation Award given by the Federal Ministry for Education, Science and Research . This state prize is awarded annually to the best 55 Master graduates among each year’s about 16.000 graduates of all Austrian universities. In 2024 Thomas, as one of only two students of TU Wien, received this prestigious award for his Master’s thesis " Grouping and Ordering Constraints in Boundary Labeling “, supervised by Martin Nöllenburg . Thomas will present the results of his thesis at the 35th International Symposium on Algorithms and Computation (ISAAC'24) in Sydney, Australia in December 2024. Congratulations, Thomas!

An AlphaZero Agent for Just 4 Fun, a Non-Deterministic Game with Imperfect Information

Tue, 01 Oct 2024 00:00:00 +0000

Graph Neural Networks Meet Local Search for the Weighted Total Domination Problem

Tue, 01 Oct 2024 00:00:00 +0000

Strength Estimation in the Game of Go

Tue, 01 Oct 2024 00:00:00 +0000

Best Paper Award at GECCO 2024 for M. Bresich, G. Raidl, and S. Limmer

Wed, 24 Jul 2024 00:00:00 +0000

Maria Bresich, Günther Raidl, and Steffen Limmer received the best paper award at the 2024 Genetic and Evolutionary Computation Conference (GECCO 2024) for their contribution Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion . The conference took place in Melbourne, Australia, July 14-18, 2024.

Welcome to our Feodor Lynen Fellow Dr. Frank Sommer

Fri, 14 Jun 2024 00:00:00 +0000

On June 1, 2024, Dr. Frank Sommer has joined the Algorithms and Complexity group with a prestigious Feodor Lynen postdoc fellowship from the Alexander von Humboldt Foundation .

Frank has received his PhD in 2022 from Philipps-Universität Marburg in Germany, and has worked as a postdoc researcher at Friedrich-Schiller-Universität Jena in Germany. In his one-year project at TU Wien he will investigate machine learning models such as decision trees and neural networks by exploiting specific input structures leading to input parameters which can be assumed to be small in practice. Together with his host Dr. Manuel Sorge , they will initially tackle these problems in theory by studying the parameterized complexity of these problems. Afterwards, they plan to implement the most promising algorithms they discovered.

We thank TU Wien for supporting a part of Frank’s fellowship.

Esra Ceylan won the OCG Award 2024

Fri, 31 May 2024 00:00:00 +0000

Our best Master thesis awardee last year, Esra Ceylan , won the OCG award 2024 for her Master’s thesis, supervised by Jiehua Chen ! Congratulations!

The ceremony will take place at the Austrian Computer Science Day on June 14th:

https://acsd2024.univie.ac.at/program/

New PhD: Markus Wallinger

Fri, 26 Apr 2024 00:00:00 +0000

Markus Wallinger successfully defended his PhD thesis “Exploring Graph-based Concepts for Balanced Information Density in Data Visualizations” on April 26, 2024. Congratulations, Dr. Wallinger!

Markus was a PhD student in the Algorithms and Complexity Group and worked in the project Engineering Linear Ordering Algorithms for Optimizing Data Visualizations funded by WWTF . He was supervised by Martin Nöllenburg and his external thesis reviewers were Christophe Hurter and Stephen Kobourov . Markus will continue his academic path as a postdoc at TU Munich.

PhD completed by Soeren Terziadis

Tue, 09 Jan 2024 00:00:00 +0000

Soeren Terziadis successfully defended his PhD thesis “Algorithms for Schematic Representations” on January 9, 2024. Congratulations, Dr. Terziadis!

Soeren was a PhD student in the Algorithms and Complexity Group and was supervised by Martin Nöllenburg . His external thesis reviewers were Will Evans and Sabine Storandt . He is now a postdoctoral researcher at TU Eindhoven .

A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem

Mon, 01 Jan 2024 00:00:00 +0000

A General Theoretical Framework for Learning Smallest Interpretable Models

Mon, 01 Jan 2024 00:00:00 +0000

A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem

Mon, 01 Jan 2024 00:00:00 +0000

A Simulated Annealing Based Approach for the Roman Domination Problem

Mon, 01 Jan 2024 00:00:00 +0000

A Tight Subexponential-Time Algorithm for Two-Page Book Embedding

Mon, 01 Jan 2024 00:00:00 +0000

ASK-SAT: Alternating Symmetry-Breaking Combinatorial Search with SAT

Mon, 01 Jan 2024 00:00:00 +0000

Project Acronym: ASK-SAT (Alternating Symmetry-Breaking Combinatorial Search with SAT)

Funding organization: Austrian Science Fund (FWF)

Project number: P 36688

Grant DOI: 10.55776/P36688

Project Team

Topic

Many unsolved problems in discrete mathematics and extremal combinatorics can be stated as whether a combinatorial object with a particular property and size exists.

The project focuses on developing novel methods for answering such questions using the innovative Satisfiability Modulo Symmetries (SMS) technique. This approach departs from traditional exhaustive search strategies by dynamically identifying and excluding redundant sub-configurations, thus streamlining the search process while utilizing the power of solvers for the propositional satisfiability problem (SAT).

The project aims to extend the capabilities of SMS to effectively tackle the existence of objects whose defining property requires alternating quantifiers, which present unique challenges beyond the scope of conventional SAT methods. This involves integrating advanced computational tools, including quantified Boolean formulas and symmetry-reasoning technologies.

Through this research, the project aspires to advance the fields of automated reasoning and discrete mathematics.

Software

The software tool developed through the project is available via GitHub, the documentation via Read the Docs.

ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP

Mon, 01 Jan 2024 00:00:00 +0000

Backdoor DNFs

Mon, 01 Jan 2024 00:00:00 +0000

Balancing Bicycle Sharing Systems

Mon, 01 Jan 2024 00:00:00 +0000

Christian Kloimüllner
Petrina Papazek
Bin Hu
Günther Raidl

Public bicycle sharing systems are booming worldwide in many major
cities. Such systems augment public transport very well, are green
alternatives to motorized individual traffic, may decrease traffic jams
and parking problems in cities to a certain extent, and last but not
least are an incentive for sports and a significant contribution to
public health. Modern systems have automated rental stations
distributed over the (inner) districts of the city, and users can easily
rent bicycles and bring them back at any other stations.

For user acceptance it is essential to provide enough bicycles as well
as parking slots for returning them at any station at almost all time.
As the usage pattern typically is not symmetric, e.g., people tend to
rent bikes at topographically higher stations and return them to lower
stations, an active maintenance by regularly transporting bikes from
some stations to others is crucial.

Project partners:

Problem Definition

The balancing bike sharing systems (BBSS) problem consists of finding an optimal rebalancing plan for the operator that consists of

a route for each vehicle on duty and
loading instructions for each station on the route

so that the system is in a balanced condition afterwards, i.e., no station is overly full or empty.

Two basic problem variants are considered:

Static case: The rebalancing process is done when the system is not used (e.g., overnight). Initial and target station fill levels are given as constants.
Dynamic case: The system is rebalanced while in use. Station fill levels are time-dependent and estimated by empirical data.

Approaches

Exact approaches based on mixed integer programming:

Hop index model
Time index model

Construction heuristics:

Greedy heuristic
PILOT heuristic

Metaheuristic approaches:

Variable neighborhood search approach
GRASP approach
Hybrid of GRASP with Path Relinking

Problem instances which we are using for our work can be found here.

Boundary Labeling in a Circular Orbit

Mon, 01 Jan 2024 00:00:00 +0000

Bounding and Computing Obstacle Numbers of Graphs

Mon, 01 Jan 2024 00:00:00 +0000

Bundling-Aware Graph Drawing

Mon, 01 Jan 2024 00:00:00 +0000

Compilation and Fast Model Counting beyond CNF

Mon, 01 Jan 2024 00:00:00 +0000

Complete Solution Archives for Evolutionary Combinatorial Optimization

Mon, 01 Jan 2024 00:00:00 +0000

Benjamin Biesinger
Bin Hu
Günther Raidl

A common drawback of metaheuristic approaches, especially evolutionary algorithms (EAs) is that they usually do not keep track of the search history, and already evaluated solutions are often revisited. This leads to premature convergence, wasting resources for re-evaluations, and other malicious effects.

The solution archive (SA) is a concept for dealing with this problem. By attaching it to a classical EA, it enables detecting already evaluated candidate solutions and efficiently transforming them into similar but yet unvisited solutions, i.e., performing an “intelligent mutation”. The figure above illustrates the cooperation between the EA and the archive.

Application

Since this concept causes additional overhead for inserting and transforming solutions in the SA data structure, following conditions should hold in order to maximize the efficiency:

A compact solution representation keeps memory consumption for the archive low.
Problems with expensive solution evaluations benefit most from avoiding re-evaluations.
Problems with few feasibility constraints so that the transformation procedure can be kept simple.

Following combinatorial optimization problems were particularly successful with this approach:

Royal road functions
NK landscapes
Generalized minimum spanning tree problem
(r|p)-centroid problem and other competitive facility location problem

Computing Data-driven Multilinear Metro Maps

Mon, 01 Jan 2024 00:00:00 +0000

Computing Hive Plots: A Combinatorial Framework

Mon, 01 Jan 2024 00:00:00 +0000

Computing small Rainbow Cycle Numbers with SAT modulo Symmetries

Mon, 01 Jan 2024 00:00:00 +0000

Computing Twin-Width Parameterized by the Feedback Edge Number

Mon, 01 Jan 2024 00:00:00 +0000

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs

Mon, 01 Jan 2024 00:00:00 +0000

Constrained Boundary Labeling

Mon, 01 Jan 2024 00:00:00 +0000

Cooperative Optimization Approaches for Distributing Service Points

Mon, 01 Jan 2024 00:00:00 +0000

A joined research project from the Algorithms and Complexity Group, TU Wien, Austria, and Honda Research Institute, Germany

Project Team

Topic

For many business models an optimal distribution of service points in a customer community is needed. Examples are charging/battery swapping stations of electric vehicles, bicycle/car sharing stations, and repair stations. When planning such systems, estimating under which conditions which customer demand can be fulfilled is fundamental in order to design and evaluate possible solutions. To this end, demographic data is usually interlinked with geographic information, data on public transport, the street network, knowledge on manifold special locations etc. Usually, the whole process is challenging and error-prone. Customer demand information determined in such ways typically is vague, and not uncommonly a system built on such assumptions is not as effective as originally hoped for due to major deviations in reality.

To possibly improve this situation, we propose a cooperative optimization approach that incorporates potential users on a large scale and more tightly into the data acquisition as well as the optimization process. We confront the potential customers with certain location scenarios and ask them how these would suit his needs and how possibly these scenarios can be improved to fulfill more of his demand. This feedback is used to incrementally gain more knowledge about how much demand may be fulfilled under which conditions. New, more promising candidate location scenarios can then be derived and again be presented to the users. The process is iterated on a large scale with many potential users and many rounds until a satisfactory solution is reached.

The figure below depicts the components of the framework of our cooperative optimization approach and their interaction. The general framework consists of the following components: an evaluation component (EC), an optimization component (OC), a feedback component (FC), and a solution management component (SMC).

Cooperative Personnel Scheduling

Mon, 01 Jan 2024 00:00:00 +0000

a joined research project from the Algorithms and Complexity Group, TU Wien, Austria, and Honda Research Institute, Germany

Project Team

Topic

In classical personnel scheduling, the employees of a company are assigned their schedules, which determine at which times they work to fulfill some kind of demand. Our setting is slightly different. Each employee also referred to as a user, has some jobs to complete that need a specific resource. Only a limited amount of resources is available and only one job can use a resource at a time. Each job has to be assigned to a resource and a timespan in which the job is carried out. Furthermore, users will have preferences on when their jobs should be executed. These preferences have to be collected in some way. One possibility would be to let the employees specify their full preferences in the beginning. But this is tedious for the employees, error-prone and only allows for preferences that were explicitly considered when designing the algorithm.

In this project, we will develop and investigate a framework that learns these preferences over time through a limited amount of user interactions. The framework aims to construct schedules that respect employees’ preferences and are feasible with the given restrictions. While constructing the schedules it is allowed to ask the employees a limited number of questions regarding their preferences. The responses to these questions are used to model the employees’ preferences. The framework may also consider fairness, e.g. by balancing the number of user interactions among the employees. Research questions to answer include which algorithms work well for the occurring problems, how to model the employees’ preferences, and which kind of user interaction gives sufficient information on the preferences, without overwhelming the employees.

Counting Vanishing Matrix-Vector Products

Mon, 01 Jan 2024 00:00:00 +0000

Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)

Mon, 01 Jan 2024 00:00:00 +0000

Cutting and Packing Problems

Mon, 01 Jan 2024 00:00:00 +0000

Frederico Dusberger
Günther Raidl

Cutting and packing problems occur in a multitude of industrial or other real-world applications such as

glass, paper and steel cutting,
container or pallet loading,
VLSI design,
and many other applications.

Usually items have to be cut from raw material and waste should be minimized, or the number of bins/containers needed to pack given items has to be minimized. In our research we dealt (until now) with two-dimensional bin packing problems where only guillotineable cutting/packing patterns are allowed.

Another kind of packing problems are the so called Knapsack Problems. Where items with an associated profit have to be packed into one or more knapsacks, and the profit has to be maximized. There are several variants of knapsack problems, such as the classical knapsack problem, multiconstrained knapsack problems, multiple knapsack problems, and many others. In our research we mainly deal with multiconstrained knapsack problems.

Solving cutting and packing problems can be done in various ways, we developed metaheuristics and exact algorithms for dealing with those problems. Especially the combination of evolutionary algorithms with problem specific heuristics, local and global optimization techniques are considered. Please see also our page on metaheuristics and evolutionary computation and the page on hybrid optimization techniques.

Cycles on Graphs and Properties of Graphs with Special Cycle Structure

Mon, 01 Jan 2024 00:00:00 +0000

Doctoral College Logical Methods in Computer Science

Mon, 01 Jan 2024 00:00:00 +0000

Doctoral College Vienna Graduate School on Computational Optimization

Mon, 01 Jan 2024 00:00:00 +0000

Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs

Mon, 01 Jan 2024 00:00:00 +0000

Engineering Linear Ordering Algorithms for Optimizing Data Visualizations

Mon, 01 Jan 2024 00:00:00 +0000

Funding Organisation: Vienna Science and Technology Fund, WWTF
Project Number: ICT19-035
Duration: 07/2020 - 06/2024

Project Team

Alexander Dobler
Markus Wallinger
Jules Wulms
Martin Nöllenburg (Professor, Principal Investigator)

Alexander Dobler, Michael Stampfer, Martin Nöllenburg at the 20th anniversary of WWTF

Topic

Optimizing linear orderings of objects is a fundamental problem for many types of data visualizations ranging from graph layouts over geospatial data to abstract sets and sequences or time-series data. Yet a systematic investigation of algorithms for solving novel constrained and application-specific ordering problems that go beyond well-studied and NP-hard classic ordering problems is missing. Practical work in visualization often resorts to heuristics without rigorous performance and quality guarantees for solving these algorithmic problems. In this project we will take an algorithmic perspective on several different ordering problems in data visualization. In the algorithm engineering sense we want to cross the gap between fundamental theory and practical applications and aim to bring the benefit of rigorous formal methods into practically relevant implementations and at the same time define new algorithmic challenges inspired by recent visualization problems. On the one hand, we will investigate the complexity of new problem settings with special input configurations, structural constraints on feasible orderings, and dependencies between multiple objects and orderings. On the other hand, we will design and implement new and sufficiently scalable algorithms with formally proven performance guarantees to compute optimal and approximate solutions. We thoroughly evaluate the improvements over existing state-of-the-art heuristics in computational experiments and user studies.

Enumerating Minimal Solution Sets for Metric Graph Problems

Mon, 01 Jan 2024 00:00:00 +0000

eSLIM: Circuit Minimization with SAT Based Local Improvement

Mon, 01 Jan 2024 00:00:00 +0000

Exact Algorithms for Clustered Planarity with Linear Saturators

Mon, 01 Jan 2024 00:00:00 +0000

Exact methods for the Selective Assessment Routing Problem

Mon, 01 Jan 2024 00:00:00 +0000

Explaining Decisions in ML Models: A Parameterized Complexity Analysis

Mon, 01 Jan 2024 00:00:00 +0000

Exploiting New Types of Structure for Fixed Parameter Tractability

Mon, 01 Jan 2024 00:00:00 +0000

Funding Organisation: The Austrian Science Funds, FWF
Project Number: FWF P26696

Project Team

Eduard Eiben
Robert Ganian
Ramanujan Sridharan
Stefan Szeider (Principal Investigator)

Topic

Many important computational problems are intractable on general instances. However, realistic problem instances often contain a certain hidden structure that can be exploited to solve the problem efficiently. Such instances form a tractable class (or an island of tractability). Previous research has identified a large number of tractable classes for various NP-hard problems.

The aim of this project is to develop a rigorous framework for exploiting new kinds of structure on a wide range of problem inputs; in particular, this framework will be based on the established notion of a modulator to a tractable class of instances, which applies to problem instances that may be placed in a tractable class by a small number of local changes. The type of structure exploited by algorithms developed within the proposed research is fundamentally different from the structure exploited by known state-of-the-art approaches. This will allow us to handle natural instances where all presently known state-of-the-art approaches remain unfeasible.

Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable

Mon, 01 Jan 2024 00:00:00 +0000

First-Order Model Checking on Monadically Stable Graph Classes

Mon, 01 Jan 2024 00:00:00 +0000

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

Mon, 01 Jan 2024 00:00:00 +0000

Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes

Mon, 01 Jan 2024 00:00:00 +0000

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time

Mon, 01 Jan 2024 00:00:00 +0000

GdMetriX - A NetworkX Extension For Graph Drawing Metrics

Mon, 01 Jan 2024 00:00:00 +0000

Generating All Invertible Matrices by Row Operations

Mon, 01 Jan 2024 00:00:00 +0000

Graphs with at most two moplexes

Mon, 01 Jan 2024 00:00:00 +0000

Hard QBFs for Merge Resolution

Mon, 01 Jan 2024 00:00:00 +0000

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL

Mon, 01 Jan 2024 00:00:00 +0000

Hoop Diagrams: A Set Visualization Method

Mon, 01 Jan 2024 00:00:00 +0000

Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem

Mon, 01 Jan 2024 00:00:00 +0000

Human-centered Algorithm Engineering: Graph and Map Visualization

Mon, 01 Jan 2024 00:00:00 +0000

Funding Organisation: The Austrian Science Fund, FWF
Project Number: FWF P 31119
Duration: 11/2018 - 04/2023

Project Team

Sujoy Bhore
Jules Wulms
Guangping Li
Anaïs Villedieu
Martin Nöllenburg (Principal Investigator)

Topic

Human-centered algorithm engineering is an unconventional new paradigm in algorithmics that puts, for the first time, human factors into the focus of algorithm engineering, a methodology that is based on a cycle of design, analysis, implementation, and experimental evaluation of algorithms. Unlike other fields in computer science that investigate the interplay of humans and computers, our focus is on the symbiosis of human expert users and computers on the fundamental level of algorithms. We combine the mathematical accuracy and computational power of formal algorithmics with the creative power of the human mind in order to provide more effective and efficient algorithms for currently insufficiently solved and ill-defined algorithmic problems. Human-centered algorithms aim to produce solutions of better quality with faster overall performance, and higher user satisfaction. The project has two main goals: (i) establishing theoretical foundations, models of computation, and suitable evaluation methods and (ii) showing the practicality and benefits of the new paradigm for several prime examples of human-centered algorithmic problems that lack satisfying traditional algorithmic solutions in graph drawing and computational cartography.

Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension

Mon, 01 Jan 2024 00:00:00 +0000

Improved Circuit Minimization with Exact Synthesis

Mon, 01 Jan 2024 00:00:00 +0000

Improving Temporal Treemaps by Minimizing Crossings

Mon, 01 Jan 2024 00:00:00 +0000

Introducing Fairness in Graph Visualization

Mon, 01 Jan 2024 00:00:00 +0000

Introducing Fairness in Graph Visualization via Gradient Descent

Mon, 01 Jan 2024 00:00:00 +0000

Large-Scale Radio Therapy Scheduling

Mon, 01 Jan 2024 00:00:00 +0000

One of the most advanced medical centers for Ion Beam Therapy and Research in Europe is currently being built in Wiener Neustadt: MedAustron. The radiation therapies applied will use protons and carbon ions for cancer treatment. The first patient treatments are planned in 2016. In the full operational phase up to 1,200 people per year are expected to benefit from the international first class medicine offered by MedAustron.

Scheduling patient treatments with their large number of individual tasks and specific requirements in order to best utilize the available resources and treat patients as soon and smoothly as possible is a huge challenge. The Algorithms and Complexity Group collaborates with MedAustron in the development of advanced scheduling algorithms and their software implementation to fulfill these needs and to give as many cancer patients as possible a new opportunity.

Within the Algorithms and Complexity Group, Günther Raidl is leading this research effort.

Learning Small Decision Trees for Data of Low Rank-Width

Mon, 01 Jan 2024 00:00:00 +0000

Learning to Solve Dynamic Vehicle Routing Problems

Mon, 01 Jan 2024 00:00:00 +0000

a joined research project from the Algorithms and Complexity Group, TU Wien, Austria, and Honda Research Institute, Germany

Project Team

Topic

Vehicle routing - i.e., planning an optimal set of routes for a fleet of vehicles - is an intensely studied research area with enormous practical and raising relevance due to increasing mobility and transportation demand and new challenges coming, e.g., from increasing interest in shared mobility services and electric vehicles. The dial-a-ride problem (DARP), for example, is the problem of finding optimal tours of vehicles through different pickup and drop-off locations in order to serve a number of transportation requests, allowing different customers to share a vehicle. The electric autonomous dial-a-ride problem (E-ADARP) represents a challenging and practically relevant extension to the DARP, where electric autonomous vehicles are employed and their charging requirements have to be taken into consideration. Furthermore, not only classical objectives like total travel time have to be optimized, but user inconvenience also plays an important role. Thus, factors such as user excess ride time, which is due to detours because of the ride-sharing, have to be taken into account.

For such problems, heuristic optimization approaches are considered to be the means of choice due to a better scalability compared to exact approaches. In this project, we propose a heuristic framework based on large neighborhood search (LNS) to solve the E-ADARP, and we plan to tackle the issue of scalability by automatically designing, i.e., learning, efficient heuristics that either guide or possibly replace classical optimization techniques. We will investigate the usage of reinforcement learning with different machine learning models to dynamically select operators for the LNS from a set of possible operators during the optimization process. We intend to experimentally compare this approach to other learning techniques such as classical supervised learning, imitation learning, and Q learning.

Learning to Solve Quantified Boolean Formulas

Mon, 01 Jan 2024 00:00:00 +0000

Funding Organisation: Vienna Science and Technology Fund, WWTF
Project Number: ICT19-060
Duration: 05/2020 - 04/2023

Project Team

Franz Xaver Reichl
Leroy Chew
Friedrich Slivovsky
Stefan Szeider

Topic

Quantified Boolean Formulas (QBFs) can succinctly encode hard problems arising in planning, verification,
and synthesis, and the development of efficient procedures for evaluating QBFs (so-called QBF solvers)
will drive advances in all of these areas.

These applications require that QBF solvers not only decide whether a formula is true or false but also
output a witnessing strategy. For instance, when using QBF to solve a program synthesis problem, we
expect solvers to return the synthesized program. Our work on solver design and proof theory has
convinced us that strategies are at the heart of QBF research. However, the prevailing theoretical models of
QBF solvers as decision procedures or proof systems do not capture the fact that they need to compute
strategies. This project aims to develop a new, richer model of QBF solvers as strategy learning algorithms.

Software

Unique: A preprocessor for (D)QBF that computes unique Skolem and Herbrand functions (GitHub).
Pedant: A certifying DQBF solver based on definition extraction (GitHub).

Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion

Mon, 01 Jan 2024 00:00:00 +0000

Matheuristics: Hybrid Optimization Algorithms for Transportation Problems with Mutltiple Visits

Mon, 01 Jan 2024 00:00:00 +0000

Minimizing Corners in Colored Rectilinear Grids

Mon, 01 Jan 2024 00:00:00 +0000

Minimizing Switches in Cased Graph Drawings

Mon, 01 Jan 2024 00:00:00 +0000

Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem

Mon, 01 Jan 2024 00:00:00 +0000

MSCA COFUND Doctoral Programme LogiCS@TUWien

Mon, 01 Jan 2024 00:00:00 +0000

Multi-Criteria Optimization of FTTx Networks

Mon, 01 Jan 2024 00:00:00 +0000

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms

Mon, 01 Jan 2024 00:00:00 +0000

New Frontiers for Parameterized Complexity

Mon, 01 Jan 2024 00:00:00 +0000

Funding Organisation: The Austrian Science Fund, FWF
Duration: 1 September 2018 – 31 August 2022
Project Number: FWF P 31336

Project Team

Robert Ganian (Principal Investigator)
Thekla Hamm
Kirill Simonov
Viktoriia Korchemna

Research Statement

Many important computational problems are intractable on general instances. However, realistic problem instances often contain a certain hidden structure that can be exploited to solve the problem efficiently. The parameterized complexity paradigm provides the perfect tools and techniques to formalize, quantify and exploit various forms of structure in order to efficiently solve a plethora of NP-hard problems. This paradigm has been applied in many fundamental areas of computer science with great success, including graph algorithms, computational logic, boolean satisfiability, constraint satisfaction and others. However, there are prominent areas of computer science where we still lack a thorough understanding of the parameterized complexity of key computational problems.

This project aims at investigating the parameterized complexity of fundamental problems in two such high-impact areas: integer linear programming and machine learning. The obtained results will allow the design of efficient algorithms capable of exploiting various natural forms of structure in order to find exact solutions for NP-hard problems in these important areas of computer science. A secondary aim of the project is to apply newly obtained insights and advancements in other, including more traditional, frontiers of parameterized complexity research.

Non-Clashing Teaching Maps for Balls in Graphs

Mon, 01 Jan 2024 00:00:00 +0000

On Critical Node Problems with Vulnerable Vertices

Mon, 01 Jan 2024 00:00:00 +0000

On the Complexity of Community-aware Network~Sparsification

Mon, 01 Jan 2024 00:00:00 +0000

On the Complexity of the Storyplan Problem

Mon, 01 Jan 2024 00:00:00 +0000

Optimization Challenges in the Future Federated Internet

Mon, 01 Jan 2024 00:00:00 +0000

Overcoming Intractability in the Knowledge Compilation Map

Mon, 01 Jan 2024 00:00:00 +0000

PACE Solver Description: CRGone

Mon, 01 Jan 2024 00:00:00 +0000

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy

Mon, 01 Jan 2024 00:00:00 +0000

Parameterized Analysis in Artificial Intelligence

Mon, 01 Jan 2024 00:00:00 +0000

Funding organization: The Austrian Science Funds, FWF
Project number: Y 1329 START-Programm (ParAI)
Grant DOI: 10.55776/Y1329

Project Team

Picture credits: Soeren Nickel, 2020

Research Statement

Parameterized complexity theory is a well-established paradigm used for the fine-grained analysis of computational problems. Such analysis can provide efficient algorithms for these problems by exploiting subtle structural properties of relevant inputs, as well as powerful lower bounds that rule out efficient algorithms even for severely restricted instances. Parameterized complexity analysis has found great success across numerous fields of computer science, with notable examples including graph algorithms, computational geometry, database theory, computational logic and constraint satisfaction. In the highly prominent fields of artificial intelligence (AI) and machine learning (ML) – areas which have become an ubiquitous part of today’s society – we see a distinct lack of foundational research targeting the fine-grained, parameterized complexity of fundamental problems. The goal of this six-year project is to change this.

A Parameterized Toolbox for Problems in AI and ML

One main objective of this project is the development of new innovative tools and machinery that allows us to apply the parameterized complexity framework in this setting. Indeed, most of the existing tools developed in parameterized complexity theory are designed to work in the setting of discrete problems on graphs. On the other hand, many problems of interest in AI and ML do not admit straightforward graph representations and/or contain non-discrete components. The development of the required tools will then go hand in hand with obtaining new algorithms and matching lower bounds for the studied problems.

Parameterized Compilation

Mon, 01 Jan 2024 00:00:00 +0000

Funding Organisation: The Austrian Science Funds, FWF
Project Number: FWF P26200

Project Team

Simone Bova
Ronald de Haan
Neha Lodha
Stefan Szeider (Principal Investigator)

Topic

Knowledge compilation offers a compelling approach to coping with computationally hard problems. This line of research was initiated in the early 1990s, and since then has become a very active and progressing field. Knowledge compilation proceeds in two phases: In the first phase the input data is compiled into a new representation, which is then used in a second phase to execute a number of individual tasks efficiently. Ideally, one aims at a compilation that causes only a polynomial increase in space, and the classical theory of compilation offers theoretical tools to decide whether such a compilation is possible or not. However, systematic research shows that most relevant problems are not compilable with a polynomial increase in space. Hence, the classical theory cannot provide reasonable guarantees for these problems.

The goal of this project is to overcome this limit of classical knowledge compilation by utilizing structural aspects of problem inputs (such as as tree-likeness, degree of cyclicity, or backdoor size). As the key to this goal we propose to study knowledge compilation within the framework of parameterized complexity, which has become an important and successful research direction in algorithms and complexity. Parameterized complexity provides powerful methods and tools for exploiting structural aspects of problems and is therefore ideally suited for this purpose. Using parameters we can exploit structural aspects of the input in order to support the compilation. Hence we aim at positive results in terms of upper bounds for compilation space and compilation time for problems that are not compilable in the classical sense.

Events

Symposium on New Frontiers in Knowledge Compilation

This symposium was organised by Pierre Marquis and Stefan Szeider and held in Vienna, Austria, June 4-6, 2015. The aim of this symposium was to bring together researchers who work on knowledge compilation from various angles, including knowledge representation, constraints, theory of algorithms, complexity, machine learning, and databases, as well as researchers from related areas. Lectures and discussions have put all these different approaches into context and stimulated a fruitful exchange of ideas between researchers from different fields. The symposium had over 30 participants and featured several invited and contributed talks.

More information can be found on the symposium homepage.

Dagstuhl Seminar on Recent Trends in Knowledge Compilation

Stimulated by the success of the Symposium in Vienna, another larger meeting on this topic was organized by Adnan Darwiche (UCLA, US), Pierre Marquis (Artois University – Lens, FR), Dan Suciu (University of Washington – Seattle, US, and Stefan Szeider (TU Wien, AT). The seminar was held at Schloss Dagstuhl, Wadern, Germany, September 17-22, 2017,

The seminar had over 40 participants and featured several invited and contributed talks as well as a demo session and and open problems session.

Among others, the seminar was an excellent occasion for disseminating results of the project, in terms of several talks.

A report on the seminar has been published as Dagstuhl Report (Volume 7, Issue 9, 2018).

More information can be found on the seminar homepage.

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover

Mon, 01 Jan 2024 00:00:00 +0000

QBF Proofs and Certificates

Mon, 01 Jan 2024 00:00:00 +0000

Funding organization: Austrian Science Fund (FWF)

Project number: (ESP 197 ESPRIT-Programm)

Grant DOI: 10.55776/ESP197

Project Team

Leroy Chew
Stefan Szeider
Friedrich Slivovsky

Topic

Quantified Boolean Formulas (QBF) extends propositional logic. Solving a QBF is theoretically more difficult than solving a propositional SAT (satisfiability) problem. QBFs are canonically PSPACE complete, meaning solving them could be used to solve any PSPACE problem by proxy. In the last decade progress in QBF solving is being undertaken. Proof complexity is the main theoretical framework used to understand SAT and QBF solving. Proof systems use the same logical rules as sound solvers, the proof size can often be a lower bound of running time between proof systems and related solvers. Proof systems can also be used to certify the correctness of solvers. However certification of QBF solvers is not yet a common occurrence.

We wish to further study the landscape of QBF proof complexity, studying the existing QBF proof systems that have emerged to capturing the solvers over the last decade. We also wish to use knowledge of soundness and complexity to make minor and major modifications to QBF proof systems, that could be beneficial to theory and practice. Our hope is that such knowledge will be of use to the QBF solving community.

QBF proof systems arranged via p-simulation

QCDCL with cube learning or pure literal elimination - What is best?

Mon, 01 Jan 2024 00:00:00 +0000

REVEAL-AI: Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI

Mon, 01 Jan 2024 00:00:00 +0000

Funding organization: Vienna Science and Technology Fund (WWTF)
Call: Information and Communication Technologies (ICT- 19)
Project number: ICT19-065 (Reveal-AI)

Project Team

Wolfgang Dvorak
Markus Hecher
Matthias König
Vaidyanathan P. R.
Anna Rapberger
André Schidler
Stefan Szeider (PI)
Stefan Woltran (co-PI)

Topic

At the core of several critical areas of AI and reasoning are hard-to-solve computational problems, such as the processing of constraints, carrying out sound reasoning tasks, and the verification of the correctness of procedures and protocols. All these problems are in general intractable and pose a challenge to algorithm design, even more as today’s applications demand more extensive problem inputs be solved. This requires new and more robust algorithms to facilitate further progress in technological innovation. Fortunately, typical problem inputs tend to contain some form of hidden structure, as the problem data is usually the product of a process. This research project is about revealing this hidden structure and utilizing it for an efficient solution.

Revisiting Causal Discovery from a Complexity-Theoretic Perspective

Mon, 01 Jan 2024 00:00:00 +0000

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings

Mon, 01 Jan 2024 00:00:00 +0000

SAT backdoors: Depth beats size

Mon, 01 Jan 2024 00:00:00 +0000

SAT Modulo Symmetries for Graph Generation and Enumeration

Mon, 01 Jan 2024 00:00:00 +0000

SAT-based Decision Tree Learning for Large Data Sets

Mon, 01 Jan 2024 00:00:00 +0000

SAT-Based Tree Decomposition with Iterative Cascading Policy Selection

Mon, 01 Jan 2024 00:00:00 +0000

Satisfiability Modulo User Propagators

Mon, 01 Jan 2024 00:00:00 +0000

Scheduling Jobs Using Queries to Interactively Learn Human Availability Times

Mon, 01 Jan 2024 00:00:00 +0000

Should Decisions in QCDCL Follow Prefix Order?

Mon, 01 Jan 2024 00:00:00 +0000

Signed Double Roman Domination on Cubic Graphs

Mon, 01 Jan 2024 00:00:00 +0000

Slim Tree-Cut Width

Mon, 01 Jan 2024 00:00:00 +0000

SLIM: SAT Based Local Improvement

Mon, 01 Jan 2024 00:00:00 +0000

Funding organization: Austrian Science Fund (FWF)

Project number: (FWF P 32441)

Project Team

Stefan Szeider (PI)
André Schidler
P.R. Vaidyanathan

Topic

Many problems can be efficiently translated into the propositional satisfiability problem (SAT) and then solved with a powerful SAT solver or variants such as MaxSAT or QBF-SAT. In some cases, the translation causes a significant blow-up in size, so this one-shot translation is not feasible. In this project, we overcome this limitation by repeatedly translating small local parts of the problem instance to SAT, which allows us to scale the SAT solver’s power to large instances. We could successfully implement this approach for various critical computational problems, including learning the structure of a Bayesian network, inducing an interpretable decision tree, or minimizing a Boolean circuit.

Small unsatisfiable k-CNFs with bounded literal occurrence

Mon, 01 Jan 2024 00:00:00 +0000

Smash and grab: The 0*6 scoring game on graphs

Mon, 01 Jan 2024 00:00:00 +0000

Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks

Mon, 01 Jan 2024 00:00:00 +0000

Splitting Plane Graphs to Outerplanarity

Mon, 01 Jan 2024 00:00:00 +0000

STRIDES: Structure Identification with SAT

Mon, 01 Jan 2024 00:00:00 +0000

Project Acronym: STRIDES (Structure Identification with SAT)

Funding organization: Austrian Science Fund (FWF)

Project number: P 36420

Grant DOI: 10.55776/P36420

Project Team

Stefan Szeider (PI)
André Schidler
P.R. Vaidyanathan
Florentina Voboril

Topic

SAT is the famous propositional satisfiability problem. It asks to assign the variables of a propositional formula with truth values 0 and 1 such that the entire formula becomes true. SAT is generally considered intractable, but over the last twenty years, computer programs (SAT solvers) have been engineered that can solve the problem surprisingly fast. Numerous other hard problems can be translated to SAT and solved via SAT solvers. However, the translation to SAT often causes a significant increase in size, which limits the application of SAT solvers to small problem inputs.

The project aims at scaling the use of SAT solvers to large problem inputs by utilizing the recently introduced SAT-based Local Improvement Method (SLIM). It starts with an initial heuristic solution and repeatedly applies a SAT solver to small local parts of the input, overcoming the size limitation. The project will investigate using SLIM for problems that ask to find a specific hard-to-find structure in given data. Such structure identification problems arise in text data, large graphs and networks, and logical circuits. It will focus on methods for making the SLIM approach more efficient and finding general insights into its workings. The research is expected to lead to new theoretical and practical results.

Structure-guided Local Improvement for Maximum Satisfiability

Mon, 01 Jan 2024 00:00:00 +0000

SubModST: A Fast Generic Solver for Submodular~Maximization with Size Constraints

Mon, 01 Jan 2024 00:00:00 +0000

The Complexity of Cluster Vertex Splitting and Company

Mon, 01 Jan 2024 00:00:00 +0000

The Complexity of Fair Division of Indivisible Items with Externalities

Mon, 01 Jan 2024 00:00:00 +0000

The Complexity of Optimizing Atomic Congestion

Mon, 01 Jan 2024 00:00:00 +0000

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width

Mon, 01 Jan 2024 00:00:00 +0000

The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k $\geq$ 5

Mon, 01 Jan 2024 00:00:00 +0000

The Parameterized Complexity Landscape of the Unsplittable Flow Problem

Mon, 01 Jan 2024 00:00:00 +0000

The Parameterized Complexity of Extending Stack Layouts

Mon, 01 Jan 2024 00:00:00 +0000

The Parameterized Complexity Of Extending Stack Layouts

Mon, 01 Jan 2024 00:00:00 +0000

The Parameterized Complexity of Reasoning Problems

Mon, 01 Jan 2024 00:00:00 +0000

Reasoning, to derive conclusions from facts, is a fundamental task in Artificial Intelligence that arises in a wide range of applications from Robotics to Expert Systems. Different applications require different forms of reasoning such as Nonmonotonic Reasoning (e.g., reasoning under the presence of default as- sumptions), Constraint-Based Reasoning (reasoning with forbidden configurations), and Bayesian Reasoning (reasoning with uncertain data). All these forms of reasoning give rise to computational problems that can be solved algorithmically. The efficiency of algorithms has a direct impact on applications; for example, improved algorithms for Bayesian inference yield more accurate computer assisted medical diagnosis.

The aim of this project is to devise new efficient algorithms for reasoning problems and to gain new theoretical insights into the question of what makes a reasoning problem hard, and what makes it easy. We study reasoning problems within the framework of Parameterized Complexity, a new and rapidly emerging field of Algorithms and Complexity. Parameterized Complexity takes structural aspects of problem instances into account which are most significant for empirically observed problem-hardness. Most of the considered reasoning problems are intractable in general, but the real-world context of their origin provides structural information that can be made accessible to algorithms in form of parameters. This makes Parameterized Complexity an ideal setting for the analysis and efficient solution of these problems that we want to explore.

Two inputs for a reasoning problem: random (left) and realistic (right).

An Illustration: the picture above shows the visualizations of two inputs for a reasoning problem. The input to the left is a random input. The input to the right is a real-world input (from multiplier verification). Both inputs have approximately the same size in bits, however, evidently the real-world instance is somehow “structured”, whereas the random instance is not. The parameterized complexity approach allows to utilize this kind of structure to solve the problem efficiently.

Project Record

Project Title: The Parameterized Complexity of Reasoning Problems
Principle Investigator: Stefan Szeider
Funding Organization: European Research Council (ERC)
Project Type: ERC Starting Independent Researcher Grant
Project Volume: EUR 1.4 Mio
Project Duration: Jan 2010 - Dec 2014
Host Institution: Vienna University of Technology

Project Team

Simone Bova
Johannes Fichte
Robert Ganian
Ronald de Haan
Eva Nedoma
Friedrich Slivovsky
Stefan Szeider, project leader
Yue Chen
Serge Gaspers (University of NSW and NICTA, Australia)
Sebastian Ordyniak

de Haan, Fichte, Slivovsky, Gaspers, Ordyniak, Szeider, Bova, Ganian (from left to right)

The Power of Collaboration: Learning Large Bayesian Networks at Scale

Mon, 01 Jan 2024 00:00:00 +0000

Twin-Width Meets Feedback Edges and Vertex Integrity

Mon, 01 Jan 2024 00:00:00 +0000

Uncertainty in Humanities Network Visualization

Mon, 01 Jan 2024 00:00:00 +0000

Variable Dependencies of Quantified Boolean Formulas

Mon, 01 Jan 2024 00:00:00 +0000

Funding Organisation: The Austrian Science Fund, FWF
Project Number: FWF P 27721

Project Team

Friedrich Slivovsky
Tomas Peitl
Stefan Szeider (Professor, Principal Investigator)

Topic

The satisfiability problem of Quantified Boolean Formulas (QBF) offers succinct encodings for hard problems arising in areas such as formal verification and planning. This research project explores new ways to leverage independence of variables for QBF. The nesting of existential and universal quantifiers in Quantified Boolean Formulas can generate variable dependencies that are a serious obstacle to lifting successful techniques from propositional satisfiability to QBF. In some cases one can identify a variable dependency as spurious and conclude that the corresponding variables are in fact independent. This information can be used to significantly improve the performance of decision procedures, but deciding whether variables are independent is a highly intractable problem in itself.

The aim of this project is three-fold: (A) to advance the state of the art in detecting variable independence by developing new theory and improved algorithms for currently used methods; (B) to find new approaches to detecting and harnessing variable independence; (C) to extend the scope of successful techniques from QBF to more general problems.

Software

Research under Theme (B) has lead to the development of Qute (GitHub), a dependency learning QBF solver. Qute placed 3rd in the PCNF track and 4th in the Prenex non-CNF track of QBFEVAL'17.

Visualizing Extensions of Argumentation Frameworks as Layered Graphs

Mon, 01 Jan 2024 00:00:00 +0000

Informatics Awards 2023

Wed, 06 Dec 2023 00:00:00 +0000

The Algorithms and Complexity group was very successful at the Informatics Awards 2023 :

André Schidler won the Best Dissertation Award for his thesis Scalability for SAT-based Combinatorial Problem Solving (supervised by Stefan Szeider ).

Esra Ceylan won the Best Master Thesis Award for her thesis Optimal Seat Arrangement: Structure, Algorithms, and Complexity (supervised by Jiehua Chen).

Among the thirteen students who received a Bachelor of Honors award, five were supervised by professors of the Algorithms and Complexity group: Thomas Depian, Jakob Greilhuber, Michael Kiran Huber, Sophia Schober , and Florentina Voboril .

Congratulations to all awardees!

Jiehua Chen: promotion to tenured Associate Professor

Wed, 18 Oct 2023 00:00:00 +0000

After her successful tenure evaluation, our colleague Jiehua Chen has been promoted to an Associate Professor.

Hua joined the Algorithms and Complexity group at TU Wien in 2019. Her research interests include the (parameterized) complexity of, and the design and analysis for, combinatorial problems arising in contexts such as optimization problems related to graphs and hypergraphs and Computational Social Choice (computational problems around voting, domain restrictions, and preference-based stable matching problems).

Congratulations!

Successful Graph Drawing conference 2023 in Palermo

Sat, 23 Sep 2023 00:00:00 +0000

The 31st edition of the International Symposium on Graph Drawing and Network Visualization in Palermo, Italy, ended on September 22, 2023, with a large number of awards and prizes for members and students of the Algorithms and Complexity Group.

We congratulate Markus Wallinger and his co-authors Felix Klesen, Jacob Miller, Fabrizio Montecchiani, and Martin Nöllenburg for the best poster award 2023 on their poster “What happens at Dagstuhl? Uncovering Patterns through Visualization”.

Markus Chimani (PC co-chair), Jacob Miller, Felix Klesen, Martin Nöllenburg, Markus Wallinger, Fabrizio Montecchiani, and Michalis Bekos (PC co-chair).

Furthermore, the annual Graph Drawing Contest honored multiple contributions in the following categories:

Congratulations to all our successful students and team members!

Computational Optimization Approaches for Distributing Battery Exchange Stations for Electric Scooters

Fri, 01 Sep 2023 00:00:00 +0000

PhD completed by Anaïs Villedieu

Mon, 24 Jul 2023 00:00:00 +0000

Anaïs Villedieu successfully defended her PhD thesis “Engineering Human-in-the-loop Graph Drawing Algorithms” on July 24, 2023. Congratulations, Dr. Villedieu!

Anaïs was a PhD student in the FWF project " Human-centered Algorithm Engineering " and was supervised by Martin Nöllenburg . Her external thesis reviewers were Seokhee Hong and Philipp Kindermann .

The Silent (R)evolution of SAT

Thu, 01 Jun 2023 00:00:00 +0000

PhD completed by Andre Schidler

Wed, 31 May 2023 00:00:00 +0000

Congratulations to André Schidler , who successfully defended his PhD thesis " Scalability for SAT-based combinatorial problem solving " today.

Thanks to the evaluation committee: Armin Biere, Daniel Le Berre, João Marques-Silva, and Nysret Musliu.

PhD completed by Vaidyanathan P.R.

Fri, 12 May 2023 00:00:00 +0000

Congratulations to Vaidyanathan P.R. , who successfully defended his PhD thesis Scalable Bayesian Network Structure Learning using SAT-based Methods today.

Thanks to the evaluation committee (Christian Fermüller, Pekka Parviainen, Martina Seidl, and Sebastian Ordyniak).

PhD completed by Nikolaus Frohner

Thu, 11 May 2023 00:00:00 +0000

Congratulations to Nikolaus Frohner , who successfully defended his PhD thesis " Advancing State Space Search for Static and Dynamic Optimization by Parallelization and Learning " today.

Thanks to the evaluation committee: Christian Blum, Luca di Gaspero, Sophie Parragh, and Nysret Musliu.

A Learning Multilevel Optimization Approach for a Large Location Allocation Problem

Mon, 01 May 2023 00:00:00 +0000

Advancing State Space Search for Static and Dynamic Optimization by Parallelization and Learning

Mon, 01 May 2023 00:00:00 +0000

Best paper award at IEEE PacificVis 2023

Sat, 22 Apr 2023 00:00:00 +0000

Markus Wallinger , Alexander Dobler , and Martin Nöllenburg received the Best Paper Award for their paper LinSets.zip: Compressing Linear Set Diagram s at the 16th IEEE Pacific Visualization Symposium held in Seoul, Korea from April 18-21.

Best paper award at EvoCOP 2023

Fri, 14 Apr 2023 00:00:00 +0000

Rupert Ettrich, Marc Huber , and Günther Raidl received the Best Paper Award for their paper A Policy-Based Learning Beam Search for Combinatorial Optimization at the 23rd Europen Conference on Evolutionary Computation in Combinatorial Optimization held in Brno, Czech Republic, from April 12-14.

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets

Sun, 01 Jan 2023 00:00:00 +0000

A logic-based algorithmic meta-theorem for mim-width

Sun, 01 Jan 2023 00:00:00 +0000

A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning

Sun, 01 Jan 2023 00:00:00 +0000

A Parameterized Theory of PAC Learning

Sun, 01 Jan 2023 00:00:00 +0000

A Policy-Based Learning Beam Search for Combinatorial Optimization

Sun, 01 Jan 2023 00:00:00 +0000

A Polyhedral Perspective on Tropical Convolutions

Sun, 01 Jan 2023 00:00:00 +0000

A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem

Sun, 01 Jan 2023 00:00:00 +0000

A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture

Sun, 01 Jan 2023 00:00:00 +0000

A Structural Complexity Analysis of Synchronous Dynamical Systems

Sun, 01 Jan 2023 00:00:00 +0000

Algorithms for Satisfiability Testing

Sun, 01 Jan 2023 00:00:00 +0000

An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles

Sun, 01 Jan 2023 00:00:00 +0000

Are Hitting Formulas Hard for Resolution?

Sun, 01 Jan 2023 00:00:00 +0000

Block Crossings in One-Sided Tanglegrams

Sun, 01 Jan 2023 00:00:00 +0000

Circuit Minimization with Exact Synthesis: From QBF Back to SAT

Sun, 01 Jan 2023 00:00:00 +0000

Circuit Minimization with QBF-Based Exact Synthesis

Sun, 01 Jan 2023 00:00:00 +0000

Co-Certificate Learning with SAT Modulo Symmetries

Sun, 01 Jan 2023 00:00:00 +0000

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Sun, 01 Jan 2023 00:00:00 +0000

Computing Hive Plots: A Combinatorial Framework

Sun, 01 Jan 2023 00:00:00 +0000

Computing optimal hypertree decompositions with SAT

Sun, 01 Jan 2023 00:00:00 +0000

Computing twin-width with SAT and branch \& bound

Sun, 01 Jan 2023 00:00:00 +0000

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity

Sun, 01 Jan 2023 00:00:00 +0000

Crossing Minimization in Time Interval Storylines

Sun, 01 Jan 2023 00:00:00 +0000

CSP beyond tractable constraint languages

Sun, 01 Jan 2023 00:00:00 +0000

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs

Sun, 01 Jan 2023 00:00:00 +0000

Deterministic Constrained Multilinear Detection

Sun, 01 Jan 2023 00:00:00 +0000

Essentially Tight Kernels for (Weakly) Closed Graphs

Sun, 01 Jan 2023 00:00:00 +0000

Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond

Sun, 01 Jan 2023 00:00:00 +0000

Exact Algorithms for Group Closeness Centrality

Sun, 01 Jan 2023 00:00:00 +0000

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

Sun, 01 Jan 2023 00:00:00 +0000

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable

Sun, 01 Jan 2023 00:00:00 +0000

Fast Convolutions for Near-Convex Sequences

Sun, 01 Jan 2023 00:00:00 +0000

Faster Edge-Path Bundling Through Graph Spanners

Sun, 01 Jan 2023 00:00:00 +0000

First-Order Model Checking on Structurally Sparse Graph Classes

Sun, 01 Jan 2023 00:00:00 +0000

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs

Sun, 01 Jan 2023 00:00:00 +0000

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem

Sun, 01 Jan 2023 00:00:00 +0000

Group Activity Selection with Few Agent Types

Sun, 01 Jan 2023 00:00:00 +0000

Growth of the Perfect Sequence Covering Array Number

Sun, 01 Jan 2023 00:00:00 +0000

Hedonic diversity games: A complexity picture with more than two colors

Sun, 01 Jan 2023 00:00:00 +0000

Hybrid Approaches to Sports League Scheduling using Constraint Programming and Simulated Annealing

Sun, 01 Jan 2023 00:00:00 +0000

Hybrid Metaheuristics Based on Large Neighborhood Search and Mixed Integer Linear Programming for the Directed Feedback Vertex Set Problem

Sun, 01 Jan 2023 00:00:00 +0000

Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity

Sun, 01 Jan 2023 00:00:00 +0000

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes

Sun, 01 Jan 2023 00:00:00 +0000

Interactive Job Scheduling with Partially Known Personnel Availabilities

Sun, 01 Jan 2023 00:00:00 +0000

IPASIR-UP: User Propagators for CDCL

Sun, 01 Jan 2023 00:00:00 +0000

Large Neighborhood Search for Electric Vehicle Fleet Scheduling

Sun, 01 Jan 2023 00:00:00 +0000

Learning Small Decision Trees with Large Domain

Sun, 01 Jan 2023 00:00:00 +0000

LinSets.zip: Compressing Linear Set Diagrams

Sun, 01 Jan 2023 00:00:00 +0000

Maximizing Social Welfare in Score-Based Social Distance Games

Sun, 01 Jan 2023 00:00:00 +0000

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters

Sun, 01 Jan 2023 00:00:00 +0000

MosaicSets: Embedding Set Systems into Grid Graphs

Sun, 01 Jan 2023 00:00:00 +0000

Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines

Sun, 01 Jan 2023 00:00:00 +0000

Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs

Sun, 01 Jan 2023 00:00:00 +0000

MySemCloud: Semantic-aware Word Cloud Editing

Sun, 01 Jan 2023 00:00:00 +0000

New Complexity-Theoretic Frontiers of Tractability for Neural Network Training

Sun, 01 Jan 2023 00:00:00 +0000

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)

Sun, 01 Jan 2023 00:00:00 +0000

On Computing Optimal Tree Ensembles

Sun, 01 Jan 2023 00:00:00 +0000

On Families of Planar DAGs with Constant Stack Number

Sun, 01 Jan 2023 00:00:00 +0000

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model

Sun, 01 Jan 2023 00:00:00 +0000

On the Complexity of the Storyplan Problem

Sun, 01 Jan 2023 00:00:00 +0000

On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics

Sun, 01 Jan 2023 00:00:00 +0000

On the parameterized complexity of clustering problems for incomplete data

Sun, 01 Jan 2023 00:00:00 +0000

On the Upward Book Thickness Problem: Combinatorial and Complexity Results

Sun, 01 Jan 2023 00:00:00 +0000

Optimizing the positions of battery swapping stations – Pilot Studies and Layout Optimization Algorithm

Sun, 01 Jan 2023 00:00:00 +0000

PACE Solver Description: Touiouidth

Sun, 01 Jan 2023 00:00:00 +0000

Parameterized complexity of envy-free resource allocation in social networks

Sun, 01 Jan 2023 00:00:00 +0000

Planarizing Graphs and their Drawings by Vertex Splitting

Sun, 01 Jan 2023 00:00:00 +0000

Proven optimally-balanced Latin rectangles with SAT

Sun, 01 Jan 2023 00:00:00 +0000

Pseudorandom Finite Models

Sun, 01 Jan 2023 00:00:00 +0000

Sample compression schemes for balls in graphs

Sun, 01 Jan 2023 00:00:00 +0000

SAT-Based Generation of Planar Graphs

Sun, 01 Jan 2023 00:00:00 +0000

SAT-Boosted Tabu Search for Coloring Massive Graphs

Sun, 01 Jan 2023 00:00:00 +0000

Searching for smallest universal graphs and tournaments with SAT

Sun, 01 Jan 2023 00:00:00 +0000

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Sun, 01 Jan 2023 00:00:00 +0000

Splitting Plane Graphs to Outerplanarity

Sun, 01 Jan 2023 00:00:00 +0000

Splitting Vertices in 2-Layer Graph Drawings

Sun, 01 Jan 2023 00:00:00 +0000

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF

Sun, 01 Jan 2023 00:00:00 +0000

The Computational Complexity of Concise Hypersphere Classification

Sun, 01 Jan 2023 00:00:00 +0000

The Influence of Dimensions on the Complexity of Computing Decision Trees

Sun, 01 Jan 2023 00:00:00 +0000

The Parameterized Complexity of Coordinated Motion Planning

Sun, 01 Jan 2023 00:00:00 +0000

The Parameterized Complexity of Finding Concise Local Explanations

Sun, 01 Jan 2023 00:00:00 +0000

The Parameterized Complexity of Network Microaggregation

Sun, 01 Jan 2023 00:00:00 +0000

The Parameterized Complexity of s-Club with Triangle and Seed Constraints

Sun, 01 Jan 2023 00:00:00 +0000

Transitions in Dynamic Point Labeling

Sun, 01 Jan 2023 00:00:00 +0000

Untangling Circular Drawings: Algorithms and Complexity

Sun, 01 Jan 2023 00:00:00 +0000

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth

Sun, 01 Jan 2023 00:00:00 +0000

Worbel: Aggregating Point Labels into Word Clouds

Sun, 01 Jan 2023 00:00:00 +0000

Optimization of Container Transportation for Fixed-Schedule Block Trains with Optional Round Trips in Collaborative Logistics

Thu, 01 Dec 2022 00:00:00 +0000

New FWF ESPRIT Postdocs

Wed, 09 Nov 2022 00:00:00 +0000

Leroy Chew and Alexis de Colnet just joined the Algorithms and Complexity group as PIs of their own FWF ESPRIT Projects:

Congratulations to Leroy and Alexis for winning these competitively awarded project grants!

Best student paper award at DIAGRAMS 2022

Sat, 01 Oct 2022 00:00:00 +0000

Alexander Dobler received the Best Student Paper Award at the 13th International Conference on the Theory and Application of Diagrams (DIAGRAMS 2022) in Rome in September 2022 for his paper " On Computing Optimal Linear Diagrams “, co-authored with his PhD advisor Martin Nöllenburg .

Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution

Thu, 01 Sep 2022 00:00:00 +0000

Robert Ganian promoted to Associate Professor

Fri, 01 Jul 2022 00:00:00 +0000

Effective as of today, Robert Ganian is promoted to a tenured Associate Professor at the Algorithms and Complexity group. Congratulations, Robert!

Best paper award at EvoCOP 2022

Tue, 24 May 2022 00:00:00 +0000

Jonas Mayerhofer, Markus Kirchweger, Marc Huber, and Günther Raidl received the best paper award for their work A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation at the 22nd European Conference on Evolutionary Computation in Combinatorial Optimization being held in Madrid, Spain, in April 2022.

New PhD: Guangping Li

Fri, 13 May 2022 00:00:00 +0000

Guangping Li successfully defended her PhD thesis “An Algorithmic Study of Practical Map Labeling” on May 13, 2022. Congratulations, Dr. Li!

Guangping was a PhD student in the FWF project " Human-centered Algorithm Engineering " and was supervised by Martin Nöllenburg . Her external thesis reviewers were Kevin Buchin and Christian Schulz . Guangping has already started a postdoc position at TU Dortmund , Germany.

Minimizing Makespan in Flow Shops with a Reinforcement Learning Like Approach

Sun, 01 May 2022 00:00:00 +0000

A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters

Tue, 01 Feb 2022 00:00:00 +0000

Computational Optimization Approaches for Distributing Service Points for Mobility Applications and Smart Charging of Electric Vehicles

Tue, 01 Feb 2022 00:00:00 +0000

47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria

Sat, 01 Jan 2022 00:00:00 +0000

A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation

Sat, 01 Jan 2022 00:00:00 +0000

A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation

Sat, 01 Jan 2022 00:00:00 +0000

A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications

Sat, 01 Jan 2022 00:00:00 +0000

A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters

Sat, 01 Jan 2022 00:00:00 +0000

A Learning Large Neighborhood Search for the Staff Rerostering Problem

Sat, 01 Jan 2022 00:00:00 +0000

A Matheuristic for Battery Exchange Station Location Planning for Electric Scooters

Sat, 01 Jan 2022 00:00:00 +0000

A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems

Sat, 01 Jan 2022 00:00:00 +0000

A Reproducibility Study on User-centric MIR Research and Why it is Important

Sat, 01 Jan 2022 00:00:00 +0000

A SAT Approach to Twin-Width

Sat, 01 Jan 2022 00:00:00 +0000

A SAT Attack on Rota’s Basis Conjecture

Sat, 01 Jan 2022 00:00:00 +0000

A Unifying Framework for Characterizing and Computing Width Measures

Sat, 01 Jan 2022 00:00:00 +0000

Algorithmic Applications of Tree-Cut Width

Sat, 01 Jan 2022 00:00:00 +0000

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling

Sat, 01 Jan 2022 00:00:00 +0000

An efficient algorithm for counting Markov equivalent DAGs

Sat, 01 Jan 2022 00:00:00 +0000

Bounding and Computing Obstacle Numbers of Graphs

Sat, 01 Jan 2022 00:00:00 +0000

Colored cut games

Sat, 01 Jan 2022 00:00:00 +0000

Combinatorial and Algorithmic Aspects of Monadic Stability

Sat, 01 Jan 2022 00:00:00 +0000

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares

Sat, 01 Jan 2022 00:00:00 +0000

Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet

Sat, 01 Jan 2022 00:00:00 +0000

Computing Treewidth with Constraint Programming

Sat, 01 Jan 2022 00:00:00 +0000

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs

Sat, 01 Jan 2022 00:00:00 +0000

CSP Beyond Tractable Constraint Languages

Sat, 01 Jan 2022 00:00:00 +0000

Detours in Directed Graphs

Sat, 01 Jan 2022 00:00:00 +0000

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts

Sat, 01 Jan 2022 00:00:00 +0000

Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach

Sat, 01 Jan 2022 00:00:00 +0000

Exploiting \textdollarc\textdollar-Closure in Kernelization Algorithms for Graph Problems

Sat, 01 Jan 2022 00:00:00 +0000

Finding a Battleship of Uncertain Shape

Sat, 01 Jan 2022 00:00:00 +0000

Finding a Cluster in Incomplete Data

Sat, 01 Jan 2022 00:00:00 +0000

Fine-grained Complexity of Partial Minimum Satisfiability

Sat, 01 Jan 2022 00:00:00 +0000

FPT Approximation for Fair Minimum-Load Clustering

Sat, 01 Jan 2022 00:00:00 +0000

Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences

Sat, 01 Jan 2022 00:00:00 +0000

Hedonic Diversity Games: A Complexity Picture with More than Two Colors

Sat, 01 Jan 2022 00:00:00 +0000

How to Find a Good Explanation for Clustering?

Sat, 01 Jan 2022 00:00:00 +0000

Initial Learning of Textual Programming at School: Evolution of Outreach Activities

Sat, 01 Jan 2022 00:00:00 +0000

Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems

Sat, 01 Jan 2022 00:00:00 +0000

Learning Large Bayesian Networks with Expert Constraints

Sat, 01 Jan 2022 00:00:00 +0000

Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime

Sat, 01 Jan 2022 00:00:00 +0000

Longest Cycle above Erdős–Gallai Bound

Sat, 01 Jan 2022 00:00:00 +0000

Lossy Kernelization of Same-Size Clustering

Sat, 01 Jan 2022 00:00:00 +0000

Minimum Link Fencing

Sat, 01 Jan 2022 00:00:00 +0000

Mixed Labeling: Integrating Internal and External Labels

Sat, 01 Jan 2022 00:00:00 +0000

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth

Sat, 01 Jan 2022 00:00:00 +0000

Multi-level Area Balancing of Clustered Graphs

Sat, 01 Jan 2022 00:00:00 +0000

Multicriteria Optimization for Dynamic Demers Cartograms

Sat, 01 Jan 2022 00:00:00 +0000

Multidimensional Manhattan Preferences

Sat, 01 Jan 2022 00:00:00 +0000

On Computing Optimal Linear Diagrams

Sat, 01 Jan 2022 00:00:00 +0000

On Covering Segments with Unit Intervals

Sat, 01 Jan 2022 00:00:00 +0000

On Critical Node Problems with Vulnerable Vertices

Sat, 01 Jan 2022 00:00:00 +0000

On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations

Sat, 01 Jan 2022 00:00:00 +0000

PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT

Sat, 01 Jan 2022 00:00:00 +0000

Parallel Beam Search for Combinatorial Optimization

Sat, 01 Jan 2022 00:00:00 +0000

Parameterised Partially-Predrawn Crossing Number

Sat, 01 Jan 2022 00:00:00 +0000

Parameterized Algorithms for Queue Layouts

Sat, 01 Jan 2022 00:00:00 +0000

Parameterized Algorithms for Queue Layouts

Sat, 01 Jan 2022 00:00:00 +0000

Parameterized Algorithms for Upward Planarity

Sat, 01 Jan 2022 00:00:00 +0000

Pedant: A Certifying DQBF Solver

Sat, 01 Jan 2022 00:00:00 +0000

Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria

Sat, 01 Jan 2022 00:00:00 +0000

Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria

Sat, 01 Jan 2022 00:00:00 +0000

QCDCL with Cube Learning or Pure Literal Elimination - What is Best?

Sat, 01 Jan 2022 00:00:00 +0000

Recognizing Weighted and Seeded Disk Graphs

Sat, 01 Jan 2022 00:00:00 +0000

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs

Sat, 01 Jan 2022 00:00:00 +0000

Removing Popular Faces in Curve Arrangements

Sat, 01 Jan 2022 00:00:00 +0000

SAT Backdoors: Depth Beats Size

Sat, 01 Jan 2022 00:00:00 +0000

SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)

Sat, 01 Jan 2022 00:00:00 +0000

Scrambling Permutations and Related Structures: Asymptotics and Constructions

Sat, 01 Jan 2022 00:00:00 +0000

Shape-Guided Mixed Metro Map Layout

Sat, 01 Jan 2022 00:00:00 +0000

Should Decisions in QCDCL Follow Prefix Order?

Sat, 01 Jan 2022 00:00:00 +0000

Slim Tree-Cut Width

Sat, 01 Jan 2022 00:00:00 +0000

Sum-of-Products with Default Values: Algorithms and Complexity Results

Sat, 01 Jan 2022 00:00:00 +0000

Testing Upward Planarity of Partial 2-Trees

Sat, 01 Jan 2022 00:00:00 +0000

The Complexity of Envy-Free Graph Cutting

Sat, 01 Jan 2022 00:00:00 +0000

The Complexity of k-Means Clustering when Little is Known

Sat, 01 Jan 2022 00:00:00 +0000

The Complexity of Temporal Vertex Cover in Small-Degree Graphs

Sat, 01 Jan 2022 00:00:00 +0000

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width

Sat, 01 Jan 2022 00:00:00 +0000

The Parameterized Complexity of s-Club with Triangle and Seed Constraints

Sat, 01 Jan 2022 00:00:00 +0000

Threshold Treewidth and Hypertree Width

Sat, 01 Jan 2022 00:00:00 +0000

Towards Uniform Certification in QBF

Sat, 01 Jan 2022 00:00:00 +0000

Tractable Abstract Argumentation via Backdoor-Treewidth

Sat, 01 Jan 2022 00:00:00 +0000

Treelike Decompositions for Transductions of Sparse Graphs

Sat, 01 Jan 2022 00:00:00 +0000

Turbocharging Heuristics for Weak Coloring Numbers

Sat, 01 Jan 2022 00:00:00 +0000

Twin-width and generalized coloring numbers

Sat, 01 Jan 2022 00:00:00 +0000

Weighted Model Counting with Twin-Width

Sat, 01 Jan 2022 00:00:00 +0000

Exact and heuristic approaches for solving string problems from bioinformatics

Wed, 01 Dec 2021 00:00:00 +0000

A Learning Large Neighborhood Search for the Staff Rerostering Problem

Fri, 01 Oct 2021 00:00:00 +0000

Ipe Drawing & Presentation Guide

Fri, 01 Oct 2021 00:00:00 +0000

Ipe is an extensible vector graphics editor that natively renders LaTeX text and equations. It is widely used in our research group for creating publication-quality figures, academic posters, and conference presentation slides.

🎨 Templates & Tutorials

📄 Presentation Templates (ZIP) – Group-styled slide templates.
🖼️ Poster Template (ZIP) – Academic poster layout template.
🎓 Ipe Tutorial Slides (PDF) – Introductory tutorial slides by Soeren Terziadis.
🌐 Eindhoven Ipe Tricks – Collection of tips and tricks by the AGA group (TU Eindhoven).

🧩 Recommended Ipelets (Plugins)

Ipelets are Lua/C++ extensions that add powerful capabilities to Ipe. Install them by placing the .lua file in your local Ipelet directory (Help $\rightarrow$ Show configuration).

Presentation Ipelet – Creates Beamer-style boxes and presentation structures.
Decorator Ipelet – Provides decorative boxes and card containers for posters.
Pagenumbers Ipelet – Custom slide and page numbering.
Graph Ipelet – Drag and edit graph vertices while keeping connecting edges attached (Graph Mode: Ctrl+E).
Graph Drawing (TikZ) Ipelet – Automated graph drawing via TikZ algorithms.
Ipetools – CLI converters for SVG, PDF, and FIG to Ipe format.

🎨 Color Palettes & Utilities

🐍 Colors for Ipe (Python Script) – Script to generate Ipe .isy style sheets from ColorBrewer and iWantHue palettes.

💡 Pro-Tips & Techniques

Selection Behavior

Top-left to bottom-right: Selects an object only if its entire bounding box is inside the rectangle.
Bottom-right to top-left: Selects any object whose bounding box intersects the selection rectangle.

Top-left to bottom-right (selects blue circle)

Bottom-right to top-left (selects both)

Clipping Paths

To mask a figure or photo:

Group your objects (Ctrl+G).
Draw a rectangle (or polygon) over the grouped object.
Select both and choose Add Clipping Path from the context menu.

Angular Snap

Press F1 to place an angular origin (green star) at your cursor. When Angular Snap is enabled, drawing will snap to predefined angles relative to this origin. Rotate with F2, reset with Ctrl+F2, and hide with Ctrl+F1.

Outstanding results for TU Wien students at the 2021 Graph Drawing Contest

Fri, 24 Sep 2021 00:00:00 +0000

The 28th Annual Graph Drawing Contest , a long running tradition of the graph drawing research community, was held in conjunction with the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021), hosted in Tübingen from the 14th to the 17th of September, 2021. The contest is comprised of various categories. In the creative topics participants are provided with network data and tasked to design an informative but at the same time aesthetically pleasing layout of these networks.

In this category TU Wien was represented by two submissions, both of which were created as part of the coursework for the lecture Graph Drawing Algorithms (taught by Martin Nöllenburg and Soeren Nickel ), with resounding success, winning a first and a joint second prize. Both groups chose the task of visualizing a graph of movie remakes by different directors out of the available data sets.

David Ammer, Thorsten Korpitsch and Simon Pointner won the first prize by choosing a design, which puts the focus of the visualization firmly on the movies and representing directors as spanning trees between movie nodes. Readability was automatically optimized, by minimizing crossings and edge lengths via simulated annealing. The design was praised for being intuitive and highly informative.

Najla Amira Ochoa Leonor and Daniela Martinez Duarte won the second prize with their multi-style visualization, utilizing a clustering of directors based on their influence. It shows high degree directors as meta-nodes depicting their remakes and original movies and an essential list of movies connecting them through a Steiner tree is highlighted. Beyond trying to explore structures not immediately visible in the data set, the design was lauded for being aesthetically pleasing.

In the manual live challenge category, contestants tried to optimize the polyline edge-length ratio of planar drawings on a fixed grid, wherein the group of Soeren Nickel , Anaïs Villedieu and Jules Wulms of the Algorithms and Complexity group won the third price.

Congratulations to all awardees!

Computational Methods for Fleet Scheduling in E-Mobility

Sun, 01 Aug 2021 00:00:00 +0000

Jan Dreier receives a LICS'21 Distinguished Paper Award

Fri, 02 Jul 2021 00:00:00 +0000

Congratulations to Jan Dreier for his LICS 2021 Distinguished Paper Award for his paper Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes.

Here is a link to the video of his presentation.

Lecture at Austrian Parliament

Wed, 16 Jun 2021 00:00:00 +0000

Stefan Szeider and Martin Kronegger gave a lecture on Algorithms and Programming to members of the Austrian Parliament .

The lecture consisted of three parts and concluded with a Q&A session with the MPs and ended with a live programming demonstration.

The Algorithms lecture took place on June 15th, 2021, in the same venue where usually the plenary discussions of the Austrian parliament take place, the “great Redoutensaal,” a beautiful hall located in Vienna’s Hofburg.

This lecture was part of the Faculty of Informatic’s initiative Digitale Kompetenzen (digital competence), consisting of several lectures on computer science topics, to be held in July and September 2021.

Photos at curtesy of Parlamentsdirektion/Thomas Topf

Promotio Sub Auspiciis Praesidentis Rei Publica

Mon, 14 Jun 2021 00:00:00 +0000

Congratulations to our former students Martin Riedler and Tomas Peitl for receiving this outstanding award of a Promotio Sub Auspiciis Praesidentis Rei Publica (Doctoral graduation under the auspices of the Federal President). Each year, only a handful of doctoral students from Austria receive this special award, which requires excellent grades throughout secondary school, undergraduate and graduate studies.

We are specially proud that two students from our group receive this honour this year.

The ceremony took place with over year’s delay due to the Covid pandemic.

News post at TU Wien’s website.

Scheduling the Charging of Electric Vehicles with SOC-Dependent Maximum Charging Power

Thu, 01 Apr 2021 00:00:00 +0000

Randomized Construction Approaches to the Traveling Tournament Problem using Lower Bound Based Heuristics

Mon, 01 Mar 2021 00:00:00 +0000

A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications

Fri, 01 Jan 2021 00:00:00 +0000

A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications

Fri, 01 Jan 2021 00:00:00 +0000

A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

Fri, 01 Jan 2021 00:00:00 +0000

A*-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem

Fri, 01 Jan 2021 00:00:00 +0000

Approximate Evaluation of First-Order Counting Queries

Fri, 01 Jan 2021 00:00:00 +0000

Backdoor DNFs

Fri, 01 Jan 2021 00:00:00 +0000

Backdoor DNFs

Fri, 01 Jan 2021 00:00:00 +0000

Balanced Independent and Dominating Sets on Colored Interval Graphs

Fri, 01 Jan 2021 00:00:00 +0000

Certified DQBF Solving by Definition Extraction

Fri, 01 Jan 2021 00:00:00 +0000

Certified DQBF Solving by Definition Extraction

Fri, 01 Jan 2021 00:00:00 +0000

ClusterSets: Optimizing Planar Clusters in Categorical Point Data

Fri, 01 Jan 2021 00:00:00 +0000

Computing Kemeny Rankings from d-Euclidean Preferences

Fri, 01 Jan 2021 00:00:00 +0000

Computing Optimal Hypertree Decompositions with SAT

Fri, 01 Jan 2021 00:00:00 +0000

Crossing-Optimal Extension of Simple Drawings

Fri, 01 Jan 2021 00:00:00 +0000

Davis and Putnam Meet Henkin: Solving DQBF with Resolution

Fri, 01 Jan 2021 00:00:00 +0000

Davis and Putnam Meet Henkin: Solving DQBF with Resolution

Fri, 01 Jan 2021 00:00:00 +0000

Destroying Bicolored $P_3$s by Deleting Few Edges

Fri, 01 Jan 2021 00:00:00 +0000

Disjoint Box Covering in a Rectilinear Polygon

Fri, 01 Jan 2021 00:00:00 +0000

Driver Shift Planning for an Online Store with Short Delivery Times

Fri, 01 Jan 2021 00:00:00 +0000

Engineering an Efficient Boolean Functional Synthesis Engine

Fri, 01 Jan 2021 00:00:00 +0000

Enumerating connected induced subgraphs: Improved delay and experimental comparison

Fri, 01 Jan 2021 00:00:00 +0000

EPTAS for \emphk-means Clustering of Affine Subspaces

Fri, 01 Jan 2021 00:00:00 +0000

Essentially Tight Kernels For (Weakly) Closed Graphs

Fri, 01 Jan 2021 00:00:00 +0000

External Labeling: Fundamental Concepts and Algorithmic Techniques

Fri, 01 Jan 2021 00:00:00 +0000

Finding the Hardest Formulas for Resolution

Fri, 01 Jan 2021 00:00:00 +0000

Finding the Hardest Formulas for Resolution (Extended Abstract)

Fri, 01 Jan 2021 00:00:00 +0000

First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving

Fri, 01 Jan 2021 00:00:00 +0000

Fixed-Parameter Tractability

Fri, 01 Jan 2021 00:00:00 +0000

Fixed-Parameter Tractability

Fri, 01 Jan 2021 00:00:00 +0000

Geometric Planar Networks on Bichromatic Collinear Points

Fri, 01 Jan 2021 00:00:00 +0000

Graphs with two moplexes

Fri, 01 Jan 2021 00:00:00 +0000

Hardness and Optimality in QBF Proof Systems Modulo NP

Fri, 01 Jan 2021 00:00:00 +0000

Labeling Nonograms: Boundary Labeling for Curve Arrangements

Fri, 01 Jan 2021 00:00:00 +0000

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes

Fri, 01 Jan 2021 00:00:00 +0000

Layered Area-Proportional Rectangle Contact Representation

Fri, 01 Jan 2021 00:00:00 +0000

Learning fast-inference Bayesian networks

Fri, 01 Jan 2021 00:00:00 +0000

Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems

Fri, 01 Jan 2021 00:00:00 +0000

Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems

Fri, 01 Jan 2021 00:00:00 +0000

Measuring what matters: A hybrid approach to dynamic programming with treewidth

Fri, 01 Jan 2021 00:00:00 +0000

MetroSets: Visualizing Sets as Metro Maps

Fri, 01 Jan 2021 00:00:00 +0000

Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

Fri, 01 Jan 2021 00:00:00 +0000

New Width Parameters for SAT and Sharp-SAT

Fri, 01 Jan 2021 00:00:00 +0000

On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications

Fri, 01 Jan 2021 00:00:00 +0000

On Strict (Outer-)Confluent Graphs

Fri, 01 Jan 2021 00:00:00 +0000

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

Fri, 01 Jan 2021 00:00:00 +0000

On Structural Parameterizations of the Edge Disjoint Paths Problem

Fri, 01 Jan 2021 00:00:00 +0000

On the Readability of Abstract Set Visualizations

Fri, 01 Jan 2021 00:00:00 +0000

On the Upward Book Thickness Problem: Combinatorial and Complexity Results

Fri, 01 Jan 2021 00:00:00 +0000

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)

Fri, 01 Jan 2021 00:00:00 +0000

Parameterized Complexity of Feature Selection for Categorical Data Clustering

Fri, 01 Jan 2021 00:00:00 +0000

Parameterized Complexity of Small Decision Tree Learning

Fri, 01 Jan 2021 00:00:00 +0000

Parameterized Complexity of Small Decision Tree Learning

Fri, 01 Jan 2021 00:00:00 +0000

Parameterized k-Clustering: Tractability island

Fri, 01 Jan 2021 00:00:00 +0000

Preventing Small (s,t)Cuts by Protecting Edges

Fri, 01 Jan 2021 00:00:00 +0000

Proof Complexity of Symbolic QBF Reasoning

Fri, 01 Jan 2021 00:00:00 +0000

Proof Complexity of Symbolic QBF Reasoning

Fri, 01 Jan 2021 00:00:00 +0000

Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines

Fri, 01 Jan 2021 00:00:00 +0000

SAT Modulo Symmetries for Graph Generation

Fri, 01 Jan 2021 00:00:00 +0000

SAT-based Decision Tree Learning for Large Data Sets

Fri, 01 Jan 2021 00:00:00 +0000

SAT-based Decision Tree Learning for Large Data Sets

Fri, 01 Jan 2021 00:00:00 +0000

Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers

Fri, 01 Jan 2021 00:00:00 +0000

Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers

Fri, 01 Jan 2021 00:00:00 +0000

Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings

Fri, 01 Jan 2021 00:00:00 +0000

Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings

Fri, 01 Jan 2021 00:00:00 +0000

Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings

Fri, 01 Jan 2021 00:00:00 +0000

Stable Visual Summaries for Trajectory Collections

Fri, 01 Jan 2021 00:00:00 +0000

Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths

Fri, 01 Jan 2021 00:00:00 +0000

The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints

Fri, 01 Jan 2021 00:00:00 +0000

The Complexity of Bayesian Network Learning: Revisiting the Superstructure

Fri, 01 Jan 2021 00:00:00 +0000

The Complexity of Object Association in Multiple Object Tracking

Fri, 01 Jan 2021 00:00:00 +0000

The Parameterized Complexity of Clustering Incomplete Data

Fri, 01 Jan 2021 00:00:00 +0000

The Parameterized Complexity of Clustering Incomplete Data

Fri, 01 Jan 2021 00:00:00 +0000

The Parameterized Complexity of Connected Fair Division

Fri, 01 Jan 2021 00:00:00 +0000

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths

Fri, 01 Jan 2021 00:00:00 +0000

Towards a Polynomial Kernel for Directed Feedback Vertex Set

Fri, 01 Jan 2021 00:00:00 +0000

Turbocharging Treewidth-Bounded Bayesian Network Structure Learning

Fri, 01 Jan 2021 00:00:00 +0000

Two new Mixed-Integer Linear Programming Models for Solving the Multidimensional Multi-Way Number Partitioning Problem

Fri, 01 Jan 2021 00:00:00 +0000

Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs

Fri, 01 Jan 2021 00:00:00 +0000

Untangling Circular Drawings: Algorithms and Complexity

Fri, 01 Jan 2021 00:00:00 +0000

Worbel: Aggregating Point Labels into Word Clouds

Fri, 01 Jan 2021 00:00:00 +0000

Worbel: Aggregating Point Labels into Word Clouds

Fri, 01 Jan 2021 00:00:00 +0000

Martin Nöllenburg: promotion to Full Professor

Thu, 17 Dec 2020 00:00:00 +0000

By December 1st, 2020, our colleague Martin Nöllenburg has been promoted to Full Professor for Graph and Geometric Algorithms.

Martin has joined the Algorithms and Complexity group at TU Wien in September 2015 and was promoted to Associated professor in 2017. His research interests include graph algorithms, in particular for graph drawing and network visualization, computational geometry, in particular algorithms for cartography and geovisualization, as well as algorithm engineering and combinatorial optimization.

See here 5 Questions with … Martin Nöllenburg from last year.

Congratulations!

Casual Employee Scheduling with Constraint Programming and Metaheuristics

Sun, 01 Nov 2020 00:00:00 +0000

Martin Kronegger wins the Best Teaching Award 2020

Fri, 23 Oct 2020 00:00:00 +0000

Congratulations to Martin Kronegger who received a Best Teaching Award 2020 from TU Wien.

The Algorithms and Complexity group is very happy about Martin’s engagement in the Algorithms and Data Structures course, which received a nomination for the Best Distance Learning Award 2020 for its digitalisation of the course during the COVID-19 restrictions in Spring 2020.

Welcome to our Feodor Lynen Fellow Dr. Manuel Sorge

Mon, 12 Oct 2020 00:00:00 +0000

On October 1, 2020, Dr. Manuel Sorge has joined the Algorithms and Complexity group with a prestigious Feodor Lynen postdoc fellowship from the Alexander von Humboldt Foundation .

Manuel has received his PhD in 2016 from TU Berlin and has worked as a postdoc researcher at Ben-Gurion University in Beer Sheva, Israel and at Warsaw University, Poland. In his two-year project at TU Wien he will investigate network analysis and visualization problems by exploiting knowledge about inherent structures of complex networks, such as their structural sparsity or properties of overlapping clusters. Together with his host Martin Nöllenburg , they will employ a mix of theoretical and practical methods to understand the fine-grained complexity of the studied computational problems and design, analyze and experimentally evaluate new suitable algorithms.

We thank TU Wien for supporting a part of Manuel’s fellowship.

TU Wien students excel at the 2020 Graph Drawing Contest

Thu, 01 Oct 2020 00:00:00 +0000

The 27th annual Graph Drawing Contest , held (virtually) in conjunction with the 28th International Symposium on Graph Drawing and Network Visualization (GD) in Vancouver on September 15-18, 2020 was a big success for our TU Wien graph drawing students, winning the first prize in both creative categories, as well as one second prize and one third prize. Three out of these four layouts were created as part of the coursework for the lecture Graph Drawing Algorithms (taught by Martin Nöllenburg and Soeren Nickel ).

The 2020 contest comprised two creative topics: the first data set was a small-scale social network of 43 chieftains and farmers and their interactions from the Icelandic Hrafnkel Saga, the second data set a larger relationship network of thousands of artists, bands, and record labels in K-Pop music. Participants were free to design an informative but at the same time aesthetically pleasing layout of these networks.

Tamara Drucks, Moritz Leidinger, and Giulio Pace won the first prize with their idea of showing the Hrafnkel Saga as a spiral-shaped storyline layout embedded on a map of Iceland. The second place went to the team of Fabian Jogl, Melanie Paschinger, and Adrian Chmurovic, who used a layered graph layout on concentric half circles to show the actors and events of the saga.

In the second category, Rupert Ettrich, Julian Haumer, and Samantha Fuchs won the first prize for their Map of K-Pop Stars as a collaboration network of artists and bands grouped by their record labels in the visual style of a celestial chart (or star map). The third place went to Markus Wallinger and Hsiang-Yun Wu who used a matrix of hive plots to highlight several different aspects of the data set.

Congratulations to all awardees!

Best Paper Award at CP'2020

Fri, 11 Sep 2020 00:00:00 +0000

Tomáš Peitl and Stefan Szeider won the Best Paper Award at the main track of CP'2020 , the 26th International Conference on Principles and Practice of Constraint Programming, for their paper: " Finding the Hardest Formulas for Resolution “.

Congratulations!

In the paper, a resolution -based method (CDCL SAT solver) is used to find the hardest formulas for resolution , which constitutes a self reference as greatly illustrated by MC Escher in his lithograph “Drawing Hands (1948).

Abstract: A CNF formula is harder than another CNF formula with the same number of clauses if it requires a longer resolution proof. The resolution hardness numbers give for m=1,2,…m=1,2,… the length of a shortest proof of a hardest formula on m clauses. We compute the first ten resolution hardness numbers, along with the corresponding hardest formulas. We achieve this by a candidate filtering and symmetry breaking search scheme for limiting the number of potential candidates for formulas and an efficient SAT encoding for computing a shortest resolution proof of a given candidate formula.

An open access version of the paper is available as a technical report

Robert Ganian receives an FWF START prize

Wed, 17 Jun 2020 00:00:00 +0000

Robert Ganian who receives an FWF START Prize for his project Parameterized Analysis in Artificial Intelligence .

The FWF START prize is comparable in competitiveness and funding to an ERC starting grant.

Out of 111 applications over all scientific disciplines, 7 START prizes where awarded.

Congratulations!

Solving a Generalized Constrained Longest Common Subsequence Problem

Mon, 01 Jun 2020 00:00:00 +0000

Combinatorial Optimization Approaches for Graph Construction Problems

Wed, 01 Apr 2020 00:00:00 +0000

New PhD: Fabian Klute

Mon, 16 Mar 2020 00:00:00 +0000

Fabian Klute successfully defended his PhD thesis " Avoiding Crossings in Non-Planar Graph Layouts " on March 13, 2020. Congratulations!

Fabian was supervised by Martin Nöllenburg . His thesis reviewers were Fabrizio Frati and Stephen Kobourov . Fabian is now a postdoc at Utrecht University .

New PhD: Benedikt Klocker

Tue, 03 Mar 2020 00:00:00 +0000

Benedikt Klocker successfully defended his PhD thesis “Combinatorial Optimization Approaches for Graph Construction Problems” on March 25, 2020. Congratulations!

Benedikt was supervised by Günther Raidl and co-supervised by Herbert Fleischner.

Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots

Sun, 01 Mar 2020 00:00:00 +0000

Soeren Nickel wins the Distinguished Young Alumn Award

Mon, 27 Jan 2020 00:00:00 +0000

Soeren Nickel , who recently joined the Algorithms and Complexity Group as a PhD student, won the Distinguished Young Alumn Award at the 29th EPILOG event of the Faculty of Informatics. With this award the Faculty of Informatics honors Soeren’s outstanding Master thesis " Generating Stable Demers and Iso-Hexagon Cartograms " as well as his excellent EPILOG presentation.

Martin Nöllenburg, Awardee Soeren Nickel, Vice Dean of Academic Affairs Stefan Woltran, and Dean Gerti Kappel. Photo credits: © Amélie Chapalain

Soeren’s thesis, supervised by Martin Nöllenburg , presents algorithms and complexity results for computing value-by-area square and hexagon cartograms to display spatiotemporal data as a highly abstract map. It has already been presented at the International Symposium on Graph Drawing and Network Visualization (GD) 2019.

Congratulations to Soeren for this prestigious award!

A Beam Search Approach to the Traveling Tournament Problem

Wed, 01 Jan 2020 00:00:00 +0000

A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation

Wed, 01 Jan 2020 00:00:00 +0000

A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility

Wed, 01 Jan 2020 00:00:00 +0000

A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth

Wed, 01 Jan 2020 00:00:00 +0000

A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth

Wed, 01 Jan 2020 00:00:00 +0000

A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources

Wed, 01 Jan 2020 00:00:00 +0000

A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three

Wed, 01 Jan 2020 00:00:00 +0000

A Model for Finding Transition-Minors

Wed, 01 Jan 2020 00:00:00 +0000

A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives

Wed, 01 Jan 2020 00:00:00 +0000

A Time Leap Challenge for SAT-Solving

Wed, 01 Jan 2020 00:00:00 +0000

A Unified Model and Algorithms for Temporal Map Labeling

Wed, 01 Jan 2020 00:00:00 +0000

A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem

Wed, 01 Jan 2020 00:00:00 +0000

An A* Search Algorithm for the Constrained Longest Common Subsequence Problem

Wed, 01 Jan 2020 00:00:00 +0000

An A* Search Algorithm for the Constrained Longest Common Subsequence Problem

Wed, 01 Jan 2020 00:00:00 +0000

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling

Wed, 01 Jan 2020 00:00:00 +0000

An Efficient Algorithm for Counting Markov Equivalent DAGs

Wed, 01 Jan 2020 00:00:00 +0000

An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem

Wed, 01 Jan 2020 00:00:00 +0000

Anytime Algorithms for the Longest Common Palindromic Subsequence Problem

Wed, 01 Jan 2020 00:00:00 +0000

Balanced Independent and Dominating Sets on Colored Interval Graphs

Wed, 01 Jan 2020 00:00:00 +0000

Breaking Symmetries with RootClique and LexTopsort

Wed, 01 Jan 2020 00:00:00 +0000

Breaking Symmetries with RootClique and LexTopsort

Wed, 01 Jan 2020 00:00:00 +0000

Building Large k-Cores from Sparse Graphs

Wed, 01 Jan 2020 00:00:00 +0000

Casual Employee Scheduling with Constraint Programming and Metaheuristics

Wed, 01 Jan 2020 00:00:00 +0000

Colored Cut Games

Wed, 01 Jan 2020 00:00:00 +0000

Complexity of independency and cliquy trees

Wed, 01 Jan 2020 00:00:00 +0000

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Wed, 01 Jan 2020 00:00:00 +0000

Computing Optimal Hypertree Decompositions

Wed, 01 Jan 2020 00:00:00 +0000

Computing Optimal Hypertree Decompositions

Wed, 01 Jan 2020 00:00:00 +0000

Crossing Layout in Non-planar Graphs

Wed, 01 Jan 2020 00:00:00 +0000

Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem

Wed, 01 Jan 2020 00:00:00 +0000

Distributing Battery Swapping Stations for Electric Scooters in an Urban Area

Wed, 01 Jan 2020 00:00:00 +0000

Exploiting c-Closure in Kernelization Algorithms for Graph Problems

Wed, 01 Jan 2020 00:00:00 +0000

Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications

Wed, 01 Jan 2020 00:00:00 +0000

Extending Nearly Complete 1-Planar Drawings in Polynomial Time

Wed, 01 Jan 2020 00:00:00 +0000

Extending Nearly Complete 1-Planar Drawings in Polynomial Time

Wed, 01 Jan 2020 00:00:00 +0000

Extending Partial 1-Planar Drawings

Wed, 01 Jan 2020 00:00:00 +0000

Extending Partial 1-Planar Drawings

Wed, 01 Jan 2020 00:00:00 +0000

Finding Longest Common Subsequences: New anytime A$^*$ Search Results

Wed, 01 Jan 2020 00:00:00 +0000

Finding the Hardest Formulas for Resolution

Wed, 01 Jan 2020 00:00:00 +0000

Finding the Hardest Formulas for Resolution

Wed, 01 Jan 2020 00:00:00 +0000

First-Order Model-Checking in Random Graphs and Complex Networks

Wed, 01 Jan 2020 00:00:00 +0000

FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems

Wed, 01 Jan 2020 00:00:00 +0000

Fixed-Parameter Tractability of Dependency QBF with Structural Parameters

Wed, 01 Jan 2020 00:00:00 +0000

Fixed-Parameter Tractability of Dependency QBF with Structural Parameters

Wed, 01 Jan 2020 00:00:00 +0000

Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada

Wed, 01 Jan 2020 00:00:00 +0000

Formalizing Graph Trail Properties in Isabelle/HOL

Wed, 01 Jan 2020 00:00:00 +0000

Formalizing Graph Trail Properties in Isabelle/HOL

Wed, 01 Jan 2020 00:00:00 +0000

Geometric Planar Networks on Bichromatic Points

Wed, 01 Jan 2020 00:00:00 +0000

Hard Problems on Random Graphs

Wed, 01 Jan 2020 00:00:00 +0000

Hard QBFs for Merge Resolution

Wed, 01 Jan 2020 00:00:00 +0000

Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing

Wed, 01 Jan 2020 00:00:00 +0000

Labeling Nonograms

Wed, 01 Jan 2020 00:00:00 +0000

Layered Fan-Planar Graph Drawings

Wed, 01 Jan 2020 00:00:00 +0000

Low-Rank Binary Matrix Approximation in Column-Sum Norm

Wed, 01 Jan 2020 00:00:00 +0000

Manipulating Districts to Win Elections: Fine-Grained Complexity

Wed, 01 Jan 2020 00:00:00 +0000

Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size

Wed, 01 Jan 2020 00:00:00 +0000

MaxSAT-Based Postprocessing for Treedepth

Wed, 01 Jan 2020 00:00:00 +0000

MaxSAT-Based Postprocessing for Treedepth

Wed, 01 Jan 2020 00:00:00 +0000

Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers

Wed, 01 Jan 2020 00:00:00 +0000

Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness

Wed, 01 Jan 2020 00:00:00 +0000

On Covering Segments with Unit Intervals

Wed, 01 Jan 2020 00:00:00 +0000

On Existential MSO and Its Relation to ETH

Wed, 01 Jan 2020 00:00:00 +0000

On Solving a Generalized Constrained Longest Common Subsequence Problem

Wed, 01 Jan 2020 00:00:00 +0000

On the Parameterized Complexity of Clustering

Wed, 01 Jan 2020 00:00:00 +0000

On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank

Wed, 01 Jan 2020 00:00:00 +0000

On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences

Wed, 01 Jan 2020 00:00:00 +0000

Parameterized Algorithms for Book Embedding Problems

Wed, 01 Jan 2020 00:00:00 +0000

Parameterized algorithms for Module Map problems

Wed, 01 Jan 2020 00:00:00 +0000

Parameterized Algorithms for Queue Layouts

Wed, 01 Jan 2020 00:00:00 +0000

Parameterized Algorithms for Queue Layouts

Wed, 01 Jan 2020 00:00:00 +0000

Parameterized Complexity of Envy-Free Resource Allocation in Social Networks

Wed, 01 Jan 2020 00:00:00 +0000

Placing Labels in Road Maps: Algorithms and Complexity

Wed, 01 Jan 2020 00:00:00 +0000

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs

Wed, 01 Jan 2020 00:00:00 +0000

Route Schematization with Landmarks

Wed, 01 Jan 2020 00:00:00 +0000

Short Q-Resolution Proofs with Homomorphisms

Wed, 01 Jan 2020 00:00:00 +0000

Short Q-Resolution Proofs with Homomorphisms

Wed, 01 Jan 2020 00:00:00 +0000

Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem

Wed, 01 Jan 2020 00:00:00 +0000

Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem

Wed, 01 Jan 2020 00:00:00 +0000

Solving the Steiner Tree Problem with few Terminals

Wed, 01 Jan 2020 00:00:00 +0000

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP

Wed, 01 Jan 2020 00:00:00 +0000

String Factorizations Under Various Collision Constraints

Wed, 01 Jan 2020 00:00:00 +0000

Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths

Wed, 01 Jan 2020 00:00:00 +0000

The Complexity Landscape of Resource-Constrained Scheduling

Wed, 01 Jan 2020 00:00:00 +0000

The Turing Test for Graph Drawing Algorithms

Wed, 01 Jan 2020 00:00:00 +0000

Threshold Treewidth and Hypertree Width

Wed, 01 Jan 2020 00:00:00 +0000

Threshold Treewidth and Hypertree Width

Wed, 01 Jan 2020 00:00:00 +0000

Towards Data-Driven Multilinear Metro Maps

Wed, 01 Jan 2020 00:00:00 +0000

Towards Faster Reasoners by Using Transparent Huge Pages

Wed, 01 Jan 2020 00:00:00 +0000

Using decomposition-parameters for QBF: Mind the prefix!

Wed, 01 Jan 2020 00:00:00 +0000

VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points

Wed, 01 Jan 2020 00:00:00 +0000

A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem

Sun, 01 Dec 2019 00:00:00 +0000

Partial Edge Drawings (PED)

Thu, 01 Aug 2019 00:00:00 +0000

Partial Edge Drawing (PED) is a drawing style for non-planar graphs, in which edges are drawn only partially as pairs of opposing stubs on the respective end-vertices to reduce edge crossings and visual clutter.

In the research paper “Maximizing Ink in Partial Edge Drawings of 1-planar and k-plane Graphs”, we explore the maximization of ink in PED and symmetric PED drawings.

🛠️ Software & Source Code

The development version of the tool used in the experiments of the paper is open source and available on Bitbucket:

Bitbucket Repository: Partial Edge Drawing

👥 Contacts & Authors

For questions regarding the tool or the research paper, please contact:

Perfect Pseudo Matchings on Snarks

Wed, 01 May 2019 00:00:00 +0000

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Mon, 01 Apr 2019 00:00:00 +0000

A Heuristic Approach to Aircraft Trajectory Optimization with Constraints

Fri, 01 Mar 2019 00:00:00 +0000

Algorithmic Approaches for Optimization Problems in Bike Sharing and Security Control

Fri, 01 Mar 2019 00:00:00 +0000

Automated Calculation of Optimal Adjustment Parameters for Myoelectric Hand Prostheses

Fri, 01 Mar 2019 00:00:00 +0000

Patient Scheduling in Particle Therapy

Fri, 01 Mar 2019 00:00:00 +0000

VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points

Fri, 01 Feb 2019 00:00:00 +0000

A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem

Tue, 01 Jan 2019 00:00:00 +0000

A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications

Tue, 01 Jan 2019 00:00:00 +0000

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem

Tue, 01 Jan 2019 00:00:00 +0000

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem

Tue, 01 Jan 2019 00:00:00 +0000

A Join-Based Hybrid Parameter for Constraint Satisfaction

Tue, 01 Jan 2019 00:00:00 +0000

A Join-Based Hybrid Parameter for Constraint Satisfaction

Tue, 01 Jan 2019 00:00:00 +0000

A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three

Tue, 01 Jan 2019 00:00:00 +0000

A Memetic Algorithm for Competitive Facility Location Problems

Tue, 01 Jan 2019 00:00:00 +0000

A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems

Tue, 01 Jan 2019 00:00:00 +0000

A SAT Approach for Finding Sup-Transition-Minors

Tue, 01 Jan 2019 00:00:00 +0000

A SAT Approach to Branchwidth

Tue, 01 Jan 2019 00:00:00 +0000

A SAT Approach to Branchwidth

Tue, 01 Jan 2019 00:00:00 +0000

A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

Tue, 01 Jan 2019 00:00:00 +0000

Approximation Algorithms for BalancedCC Multiwinner Rules

Tue, 01 Jan 2019 00:00:00 +0000

Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization

Tue, 01 Jan 2019 00:00:00 +0000

Combining Resolution-Path Dependencies with Dependency Learning

Tue, 01 Jan 2019 00:00:00 +0000

Combining Resolution-Path Dependencies with Dependency Learning

Tue, 01 Jan 2019 00:00:00 +0000

Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy

Tue, 01 Jan 2019 00:00:00 +0000

Computing Stable Demers Cartograms

Tue, 01 Jan 2019 00:00:00 +0000

Counting linear extensions: Parameterizations by treewidth

Tue, 01 Jan 2019 00:00:00 +0000

Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem

Tue, 01 Jan 2019 00:00:00 +0000

Dependency Learning for QBF

Tue, 01 Jan 2019 00:00:00 +0000

Destroying Bicolored $P_3$s by Deleting Few Edges

Tue, 01 Jan 2019 00:00:00 +0000

Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks

Tue, 01 Jan 2019 00:00:00 +0000

Efficient Segment Folding is Hard

Tue, 01 Jan 2019 00:00:00 +0000

Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison

Tue, 01 Jan 2019 00:00:00 +0000

Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

Tue, 01 Jan 2019 00:00:00 +0000

Exact Approaches for Network Design Problems with Relays

Tue, 01 Jan 2019 00:00:00 +0000

Exploring Semi-Automatic Map Labeling

Tue, 01 Jan 2019 00:00:00 +0000

External Labeling Techniques: A Taxonomy and Survey

Tue, 01 Jan 2019 00:00:00 +0000

Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time

Tue, 01 Jan 2019 00:00:00 +0000

Finding Longest Common Subsequences: New A* Anytime Results

Tue, 01 Jan 2019 00:00:00 +0000

Group Activity Selection with Few Agent Types

Tue, 01 Jan 2019 00:00:00 +0000

Guidelines for Experimental Algorithmics: A Case Study in Network Analysis

Tue, 01 Jan 2019 00:00:00 +0000

Hardness of FO Model-Checking on Random Graphs

Tue, 01 Jan 2019 00:00:00 +0000

Integer Programming and Incidence Treedepth

Tue, 01 Jan 2019 00:00:00 +0000

Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm

Tue, 01 Jan 2019 00:00:00 +0000

Lombardi Drawings of Knots and Links

Tue, 01 Jan 2019 00:00:00 +0000

Long-Distance Q-Resolution with Dependency Schemes

Tue, 01 Jan 2019 00:00:00 +0000

Maximizing Ink in Partial Edge Drawings of k-plane Graphs

Tue, 01 Jan 2019 00:00:00 +0000

Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth

Tue, 01 Jan 2019 00:00:00 +0000

Metabopolis: scalable network layout for biological pathway diagrams in urban map style

Tue, 01 Jan 2019 00:00:00 +0000

Metaheuristic Hybrids

Tue, 01 Jan 2019 00:00:00 +0000

Minimizing crossings in constrained two-sided circular graph layouts

Tue, 01 Jan 2019 00:00:00 +0000

Mixed Linear Layouts: Complexity, Heuristics, and Experiments

Tue, 01 Jan 2019 00:00:00 +0000

Motif Counting in Preferential Attachment Graphs

Tue, 01 Jan 2019 00:00:00 +0000

Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

Tue, 01 Jan 2019 00:00:00 +0000

On Strict (Outer-)Confluent Graphs

Tue, 01 Jan 2019 00:00:00 +0000

On Strict (Outer-)Confluent Graphs

Tue, 01 Jan 2019 00:00:00 +0000

On the Complexity Landscape of Connected f-Factor Problems

Tue, 01 Jan 2019 00:00:00 +0000

On the Parameterized Complexity of (k,s)-SAT

Tue, 01 Jan 2019 00:00:00 +0000

On the Readability of Leaders in Boundary Labeling

Tue, 01 Jan 2019 00:00:00 +0000

Parameterized Algorithms for Book Embedding Problems

Tue, 01 Jan 2019 00:00:00 +0000

Parameterized Algorithms for Book Embedding Problems

Tue, 01 Jan 2019 00:00:00 +0000

Parameterized Complexity of Asynchronous Border Minimization

Tue, 01 Jan 2019 00:00:00 +0000

Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses

Tue, 01 Jan 2019 00:00:00 +0000

Planar Drawings of Fixed-Mobile Bigraphs

Tue, 01 Jan 2019 00:00:00 +0000

Proof Complexity of Fragments of Long-Distance Q-resolution

Tue, 01 Jan 2019 00:00:00 +0000

Proof Complexity of Fragments of Long-Distance Q-resolution

Tue, 01 Jan 2019 00:00:00 +0000

Refined Complexity of PCA with Outliers

Tue, 01 Jan 2019 00:00:00 +0000

SAT-Encodings for Treecut Width and Treedepth

Tue, 01 Jan 2019 00:00:00 +0000

SAT-Encodings for Treecut Width and Treedepth

Tue, 01 Jan 2019 00:00:00 +0000

Short Plane Supports for Spatial Hypergraphs

Tue, 01 Jan 2019 00:00:00 +0000

Shrub-Depth: Capturing Height of Dense Graphs

Tue, 01 Jan 2019 00:00:00 +0000

Snarks with Special Spanning Trees

Tue, 01 Jan 2019 00:00:00 +0000

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey

Tue, 01 Jan 2019 00:00:00 +0000

Solving integer quadratic programming via explicit and structural restrictions

Tue, 01 Jan 2019 00:00:00 +0000

Strategies for Iteratively Refining Layered Graph Models

Tue, 01 Jan 2019 00:00:00 +0000

The Complexity of Packing Edge-Disjoint Paths

Tue, 01 Jan 2019 00:00:00 +0000

The Parameterized Complexity of Cascading Portfolio Scheduling

Tue, 01 Jan 2019 00:00:00 +0000

The Parameterized Complexity of Cascading Portfolio Scheduling

Tue, 01 Jan 2019 00:00:00 +0000

The Power of Cut-Based Parameters for Computing Edge Disjoint Paths

Tue, 01 Jan 2019 00:00:00 +0000

Towards Improving Merging Heuristics for Binary Decision Diagrams

Tue, 01 Jan 2019 00:00:00 +0000

Advances in Decomposition Approaches for Mixed Integer Linear Programming

Thu, 01 Nov 2018 00:00:00 +0000

Methods for Intraday Scheduling in Particle Therapy

Thu, 01 Nov 2018 00:00:00 +0000

Local Search Methods for the Particle Therapy Patient Scheduling Problem

Sat, 01 Sep 2018 00:00:00 +0000

Monero Chross-Chain Traceability

Sat, 01 Sep 2018 00:00:00 +0000

fraSMT

Sun, 26 Aug 2018 00:00:00 +0000

Bounded fractional hypertree width (fhtw) is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Bounded fhtw generalizes other structural properties like bounded induced width and bounded hypertree width.

FraSMT is the first practical algorithm for computing the fhtw and its associated structural decomposition. FraSMT is based on an efficient encoding of the decomposition problem to SMT (SAT modulo Theory) with Linear Arithmetic as implemented in the SMT solver Z3. The encoding is further strengthened by preprocessing and symmetry breaking methods.

Downloads

The fraSMT tool can be downloaded from this GitHub page.

Benchmark instances can be downloaded from this Zenodo page.

Team

Markus Hecher
Johannes Fichte
Neha Lodha
Stefan Szeider

Publications

1 result


2018
[1]	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] [pdf] [doi]

Parallel Hybrid Metaheuristics for Solving the Firefighter Problem Using the GPU

Fri, 01 Jun 2018 00:00:00 +0000

Two-Sided Circular Layouts

Fri, 01 Jun 2018 00:00:00 +0000

Two-Sided Circular Layouts are an algorithmic technique for enhancing circular graph drawings by finding a set of edges to be drawn as curves in the outer face of the circle, significantly reducing interior edge crossings.

This work was presented at SoCG ‘18:

Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Fabian Klute and Martin Nöllenburg
34th International Symposium on Computational Geometry (SoCG 2018). DOI: 10.4230/LIPIcs.SoCG.2018.53

📊 Visual Comparison

From left to right:

Standard circular layout generated with OGDF.
Two-sided layout with crossing-free edges in the outer face ((k = 0)).
Two-sided layout with up to one crossing per edge in the outer face ((k = 1)).

💾 Code & Test Instances

📦 Download Source Code (two_sided.tar.gz)
Includes a qmake project file. The easiest way to build and run the tool is using the QtCreator IDE.
🗂️ Download Benchmark Instances (instances.tar.gz)

📄 Abstract

Circular graph layout is a popular drawing style, in which vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is NP-hard. One way to allow for fewer crossings in practice are two-sided layouts that draw some edges as curves in the exterior of the circle. In fact, one- and two-sided circular layouts are equivalent to one-page and two-page book drawings, i.e., graph layouts with all vertices placed on a line (the spine) and edges drawn in one or two distinct half-planes (the pages) bounded by the spine.

In this paper we study the problem of minimizing the crossings for a fixed cyclic vertex order by computing an optimal (k)-plane set of exteriorly drawn edges for (k \ge 1), extending the previously studied case (k=0). We show that this relates to finding bounded-degree maximum-weight induced subgraphs of circle graphs, which is a graph-theoretic problem of independent interest. We show NP-hardness for arbitrary (k), present an efficient algorithm for (k=1), and generalize it to an explicit XP-time algorithm for any fixed (k). For the practically interesting case (k=1) we implemented our algorithm and present experimental results that confirm its applicability.

BranchLIS

Wed, 24 Jan 2018 00:00:00 +0000

Various decomposition techniques have proven to be useful for efficient solving of many hard problems, e.g., the #P-complete problem of counting models for a propositional formula, albeit there is an exponential dependency on the width measures that are associated with these decompositions. Therefore, it is of interest to obtain decompositions of small width. There are various exact methods, approximations, and heuristics which allow us to compute the decompositions. The exact methods can be only used for very small problem instances and are generally slow, whereas the approximations and heuristic methods are usually fast but far off from the optimal widths. SAT-based local improvements try to use the speed of the heuristics and use exact methods to get better upper bounds for a given width parameter.

Branch decomposition is a prominent method for structurally decomposing a graph, hypergraph or CNF formula. The width of a branch decomposition provides a measure of how well the object is decomposed. We propose BranchLIS, a SAT approach to finding branch decompositions of small width.

SAT Encoding for Branchwidth

The core of our approach is an efficient SAT encoding which determines with a single SAT-call whether a given hypergraph admits a branch decomposition of a certain width. For our encoding, we developed a novel partition-based characterization of branch decomposition. Using this encoding we can obtain optimal widths for small instances as well as an upper bound for larger instances.

SAT-based Local Improvement for Branchwidth

The encoding size imposes a limit on the size of the input hypergraph. In order to break through this barrier and to scale the SAT approach to larger instances, we developed a new heuristic approach (BranchLIS) where the SAT encoding is used to locally improve a given candidate decomposition until a fixed-point is reached. This new method scales now to instances with several thousands of vertices and edges.

Downloads

The source code can be downloaded from GitHub. BranchLIS is written in Python2.7 and requires Python library Networkx. BranchLIS can also be used for visualizing the graphs and their decomposition (requires matplotlib).

Team

Neha Lodha
Sebastian Ordyniak
Stefan Szeider

Developer

Neha Lodha

Publications

2 results


2017
[2]	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]
2016
[1]	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] [doi]

A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands

Mon, 01 Jan 2018 00:00:00 +0000

A Model for Finding Transition-Minors

Mon, 01 Jan 2018 00:00:00 +0000

A SAT Approach for Finding Sup-Transition-Minors

Mon, 01 Jan 2018 00:00:00 +0000

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion

Mon, 01 Jan 2018 00:00:00 +0000

A Structural Approach to Activity Selection

Mon, 01 Jan 2018 00:00:00 +0000

A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways

Mon, 01 Jan 2018 00:00:00 +0000

A*-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem

Mon, 01 Jan 2018 00:00:00 +0000

An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows

Mon, 01 Jan 2018 00:00:00 +0000

An SMT Approach to Fractional Hypertree Width

Mon, 01 Jan 2018 00:00:00 +0000

An SMT Approach to Fractional Hypertree Width

Mon, 01 Jan 2018 00:00:00 +0000

Anytime Algorithms for the Longest Common Palindromic Subsequence Problem

Mon, 01 Jan 2018 00:00:00 +0000

Drawing Large Graphs by Multilevel Maxent-Stress Optimization

Mon, 01 Jan 2018 00:00:00 +0000

Exact approaches for the directed network design problem with relays

Mon, 01 Jan 2018 00:00:00 +0000

Exact approaches for the directed network design problem with relays

Mon, 01 Jan 2018 00:00:00 +0000

Experimental Evaluation of Book Drawing Algorithms

Mon, 01 Jan 2018 00:00:00 +0000

Finding Smooth Graphs with Small Independence Numbers

Mon, 01 Jan 2018 00:00:00 +0000

Graph Visualization

Mon, 01 Jan 2018 00:00:00 +0000

GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection

Mon, 01 Jan 2018 00:00:00 +0000

Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applications

Mon, 01 Jan 2018 00:00:00 +0000

Lombardi Drawings of Knots and Links

Mon, 01 Jan 2018 00:00:00 +0000

Meta-kernelization using well-structured modulators

Mon, 01 Jan 2018 00:00:00 +0000

Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts

Mon, 01 Jan 2018 00:00:00 +0000

Minimzing Wiggles in Storyline Visualizations

Mon, 01 Jan 2018 00:00:00 +0000

Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem

Mon, 01 Jan 2018 00:00:00 +0000

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

Mon, 01 Jan 2018 00:00:00 +0000

On the complexity of rainbow coloring problems

Mon, 01 Jan 2018 00:00:00 +0000

On the Parameterized Complexity of (k,s)-SAT

Mon, 01 Jan 2018 00:00:00 +0000

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Mon, 01 Jan 2018 00:00:00 +0000

Parameterized Algorithms for Module Map Problems

Mon, 01 Jan 2018 00:00:00 +0000

Parameterized Algorithms for the Matrix Completion Problem

Mon, 01 Jan 2018 00:00:00 +0000

Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments

Mon, 01 Jan 2018 00:00:00 +0000

Planar and poly-arc Lombardi drawings

Mon, 01 Jan 2018 00:00:00 +0000

Planar Drawings of Fixed-Mobile Bigraphs

Mon, 01 Jan 2018 00:00:00 +0000

Planar L-Drawings of Directed Graphs

Mon, 01 Jan 2018 00:00:00 +0000

Polynomial-Time Validation of QCDCL Certificates

Mon, 01 Jan 2018 00:00:00 +0000

Polynomial-Time Validation of QCDCL Certificates

Mon, 01 Jan 2018 00:00:00 +0000

Portfolio Solvers for QDIMACS and QCIR

Mon, 01 Jan 2018 00:00:00 +0000

Portfolio-Based Algorithm Selection for Circuit QBFs

Mon, 01 Jan 2018 00:00:00 +0000

Portfolio-Based Algorithm Selection for Circuit QBFs

Mon, 01 Jan 2018 00:00:00 +0000

Portfolio-Based Algorithm Selection for Circuit QBFs

Mon, 01 Jan 2018 00:00:00 +0000

QBF Encodings of Chess Problems

Mon, 01 Jan 2018 00:00:00 +0000

Scalable Set Visualizations (Dagstuhl Seminar 17332)

Mon, 01 Jan 2018 00:00:00 +0000

Semi-Automated Location Planning for Urban Bike-Sharing Systems

Mon, 01 Jan 2018 00:00:00 +0000

Short Plane Supports for Spatial Hypergraphs

Mon, 01 Jan 2018 00:00:00 +0000

Small Resolution Proofs for QBF using Dependency Treewidth

Mon, 01 Jan 2018 00:00:00 +0000

Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition

Mon, 01 Jan 2018 00:00:00 +0000

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Mon, 01 Jan 2018 00:00:00 +0000

Solving Problems on Graphs of High Rank-Width

Mon, 01 Jan 2018 00:00:00 +0000

Sum-of-Products with Default Values: Algorithms and Complexity Results

Mon, 01 Jan 2018 00:00:00 +0000

Sum-of-Products with Default Values: Algorithms and Complexity Results

Mon, 01 Jan 2018 00:00:00 +0000

The complexity landscape of decompositional parameters for ILP

Mon, 01 Jan 2018 00:00:00 +0000

Towards Characterizing Strict Outerconfluent Graphs

Mon, 01 Jan 2018 00:00:00 +0000

Unary Integer Linear Programming with Structural Restrictions

Mon, 01 Jan 2018 00:00:00 +0000

Qute: A Dependency Learning QBF Solver

Thu, 30 Nov 2017 00:00:00 +0000

Quantified Boolean Formulas, or QBFs, augment propositional formulas with existential and universal quantification over truth values. QBFs can succinctly encode problems arising in areas such as formal verification and synthesis.

For instance, if (\phi(X, Y)) specifies a system’s desired input/output behavior (with inputs (X) and outputs (Y)), the QBF (\Phi = \forall X \exists Y \phi (X, Y)) is true if there is a system implementing this specification. In general, the value of a variable (y \in Y) can depend on the values of all variables (x \in X), but in practice (y) often depends only on a small subset of (X). Such information on variable dependencies can significantly reduce the search space that QBF solvers must consider, but unfortunately deciding whether (y) depends on (x) is as hard as evaluating a QBF. Some solvers rely on so-called dependency schemes to over-approximate the set of variable dependencies, but the resulting approximation tends to be coarse and frequently coincides with the set of syntactic dependencies.

As part of our project on variable dependencies of QBFs we developed Qute, a QBF solver that obtains information on variable dependencies on the fly. Qute assumes that variable (y) is independent of variable (x) until it runs into a problem that suggests otherwise, in which case the pair ((x, y)) is added to a database of dependencies that must be observed. Experiments show that Qute typically only learns a small fraction of a formula’s syntactic dependencies, which results in improved propagation and a more freedom for decision heuristics.

Awards

Qute placed 3rd in the PCNF track of QBFEVAL'17.

Download

Qute is open source and available from GitHub. Qute is written in C++14.

Team

Developers

fslivovsky
Tomas Peitl

Publications

1 result


2017
[1]	Dependency learning for QBF 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]

An Iterative Time-Bucket Refinement Algorithm for High Resolution Scheduling Problems

Sun, 01 Oct 2017 00:00:00 +0000

Minimizing crossings in constrained two-sided circular graph layouts

Sat, 01 Apr 2017 00:00:00 +0000

A Linear-Time Parameterized Algorithm for Node Unique Label Cover

Sun, 01 Jan 2017 00:00:00 +0000

A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem

Sun, 01 Jan 2017 00:00:00 +0000

A SAT Approach to Branchwidth

Sun, 01 Jan 2017 00:00:00 +0000

A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem

Sun, 01 Jan 2017 00:00:00 +0000

An Iterative Time-Bucket Refinement Algorithm for a High Resolution Resource-Constrained Project Scheduling Problem

Sun, 01 Jan 2017 00:00:00 +0000

Backdoor Sets for CSP

Sun, 01 Jan 2017 00:00:00 +0000

Backdoor Trees for Answer Set Programming

Sun, 01 Jan 2017 00:00:00 +0000

Backdoor Treewidth for SAT

Sun, 01 Jan 2017 00:00:00 +0000

Backdoor Treewidth for SAT

Sun, 01 Jan 2017 00:00:00 +0000

Backdoors into heterogeneous classes of SAT and CSP

Sun, 01 Jan 2017 00:00:00 +0000

Circuit Treewidth, Sentential Decision, and Query Compilation

Sun, 01 Jan 2017 00:00:00 +0000

Combining Treewidth and Backdoors for CSP

Sun, 01 Jan 2017 00:00:00 +0000

Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures

Sun, 01 Jan 2017 00:00:00 +0000

Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure

Sun, 01 Jan 2017 00:00:00 +0000

Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd

Sun, 01 Jan 2017 00:00:00 +0000

Dependency Learning for QBF

Sun, 01 Jan 2017 00:00:00 +0000

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting

Sun, 01 Jan 2017 00:00:00 +0000

Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control

Sun, 01 Jan 2017 00:00:00 +0000

Euclidean Greedy Drawings of Trees

Sun, 01 Jan 2017 00:00:00 +0000

Faster exact algorithms for some terminal set problems

Sun, 01 Jan 2017 00:00:00 +0000

Free Weak Nilpotent Minimum Algebras

Sun, 01 Jan 2017 00:00:00 +0000

Free Weak Nilpotent Minimum Algebras

Sun, 01 Jan 2017 00:00:00 +0000

Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition

Sun, 01 Jan 2017 00:00:00 +0000

Going Beyond Primal Treewidth for (M)ILP

Sun, 01 Jan 2017 00:00:00 +0000

GRASP and VNS for a Periodic VRP with Time Windows to Deal with Milk Collection

Sun, 01 Jan 2017 00:00:00 +0000

Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries

Sun, 01 Jan 2017 00:00:00 +0000

Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem

Sun, 01 Jan 2017 00:00:00 +0000

Hitting (Selected) Odd Cycles

Sun, 01 Jan 2017 00:00:00 +0000

How many variables are needed to express an existential positive query?

Sun, 01 Jan 2017 00:00:00 +0000

Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment

Sun, 01 Jan 2017 00:00:00 +0000

Kernelization using structural parameters on sparse graph classes

Sun, 01 Jan 2017 00:00:00 +0000

Large Neighborhood Search for the Most Strings with Few Bad Columns Problem

Sun, 01 Jan 2017 00:00:00 +0000

Linear Representation of Transversal Matroids and Gammoids parameterized by rank

Sun, 01 Jan 2017 00:00:00 +0000

Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts

Sun, 01 Jan 2017 00:00:00 +0000

Long-Distance Q-Resolution with Dependency Schemes

Sun, 01 Jan 2017 00:00:00 +0000

Lossy kernelization

Sun, 01 Jan 2017 00:00:00 +0000

Metric Dimension of Bounded Tree-length Graphs

Sun, 01 Jan 2017 00:00:00 +0000

New Width Parameters for Model Counting

Sun, 01 Jan 2017 00:00:00 +0000

New Width Parameters for Model Counting

Sun, 01 Jan 2017 00:00:00 +0000

On Structural Parameterizations of the Edge Disjoint Paths Problem

Sun, 01 Jan 2017 00:00:00 +0000

On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances

Sun, 01 Jan 2017 00:00:00 +0000

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances

Sun, 01 Jan 2017 00:00:00 +0000

Parameterized Complexity Classes Beyond Para-NP

Sun, 01 Jan 2017 00:00:00 +0000

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs

Sun, 01 Jan 2017 00:00:00 +0000

Pareto Optimal Allocation under Uncertain Preferences (Extended Abstract)

Sun, 01 Jan 2017 00:00:00 +0000

Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments

Sun, 01 Jan 2017 00:00:00 +0000

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

Sun, 01 Jan 2017 00:00:00 +0000

Path-Contractions, Edge Deletions and Connectivity Preservation

Sun, 01 Jan 2017 00:00:00 +0000

Progress on Partial Edge Drawings

Sun, 01 Jan 2017 00:00:00 +0000

Radial Contour Labeling with Straight Leaders

Sun, 01 Jan 2017 00:00:00 +0000

Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381)

Sun, 01 Jan 2017 00:00:00 +0000

Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable

Sun, 01 Jan 2017 00:00:00 +0000

SAT-Based Local Improvement for Finding Tree Decompositions of Small Width

Sun, 01 Jan 2017 00:00:00 +0000

SAT-Based Local Improvement for Finding Tree Decompositions of Small Width

Sun, 01 Jan 2017 00:00:00 +0000

SAT-Encodings for Special Treewidth and Pathwidth

Sun, 01 Jan 2017 00:00:00 +0000

SAT-Encodings for Special Treewidth and Pathwidth

Sun, 01 Jan 2017 00:00:00 +0000

Saving Critical Nodes with Firefighters is FPT

Sun, 01 Jan 2017 00:00:00 +0000

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Sun, 01 Jan 2017 00:00:00 +0000

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints

Sun, 01 Jan 2017 00:00:00 +0000

Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm

Sun, 01 Jan 2017 00:00:00 +0000

Stable Matching with Uncertain Pairwise Preferences

Sun, 01 Jan 2017 00:00:00 +0000

The Treewidth of Proofs

Sun, 01 Jan 2017 00:00:00 +0000

The Treewidth of Proofs

Sun, 01 Jan 2017 00:00:00 +0000

Towards a Polynomial Kernel for Directed Feedback Vertex Set

Sun, 01 Jan 2017 00:00:00 +0000

Metaheuristics for the Districting and Routing Problem for Security Control

Sun, 01 May 2016 00:00:00 +0000

Complete Solution Archives for Evolutionary Combinatorial Optimization: Application to a Competitive Facility Location and Stochastic Vehicle Routing Problem

Fri, 01 Apr 2016 00:00:00 +0000

Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem

Tue, 01 Mar 2016 00:00:00 +0000

A Branch-and-Bound Approach for the Constrained k-Staged 2-Dimensional Cutting Stock Problem

Fri, 01 Jan 2016 00:00:00 +0000

A Faster Parameterized Algorithm for Group Feedback Edge Set

Fri, 01 Jan 2016 00:00:00 +0000

A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands

Fri, 01 Jan 2016 00:00:00 +0000

A Memetic Algorithm for the Virtual Network Mapping Problem

Fri, 01 Jan 2016 00:00:00 +0000

A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design

Fri, 01 Jan 2016 00:00:00 +0000

A New Perspective on FO Model Checking of Dense Graph Classes

Fri, 01 Jan 2016 00:00:00 +0000

A Parameterized Algorithm for Mixed-Cut

Fri, 01 Jan 2016 00:00:00 +0000

A Parameterized Study of Maximum Generalized Pattern Matching Problems

Fri, 01 Jan 2016 00:00:00 +0000

A SAT Approach to Branchwidth

Fri, 01 Jan 2016 00:00:00 +0000

A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion

Fri, 01 Jan 2016 00:00:00 +0000

Adjacency-Preserving Spatial Treemaps

Fri, 01 Jan 2016 00:00:00 +0000

An Algorithmic Framework for Labeling Road Maps

Fri, 01 Jan 2016 00:00:00 +0000

An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands

Fri, 01 Jan 2016 00:00:00 +0000

Are There Any Good Digraph Measures?

Fri, 01 Jan 2016 00:00:00 +0000

Backdoors for Linear Temporal Logic

Fri, 01 Jan 2016 00:00:00 +0000

Backdoors to q-Horn

Fri, 01 Jan 2016 00:00:00 +0000

Backdoors to Tractable Valued CSP

Fri, 01 Jan 2016 00:00:00 +0000

Clique-Width and Directed Width Measures for Answer-Set Programming

Fri, 01 Jan 2016 00:00:00 +0000

Complexity and monotonicity results for domination games

Fri, 01 Jan 2016 00:00:00 +0000

Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation

Fri, 01 Jan 2016 00:00:00 +0000

Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem

Fri, 01 Jan 2016 00:00:00 +0000

Consistent Labeling of Rotating Maps

Fri, 01 Jan 2016 00:00:00 +0000

Counting Linear Extensions: Parameterizations by Treewidth

Fri, 01 Jan 2016 00:00:00 +0000

Directed elimination games

Fri, 01 Jan 2016 00:00:00 +0000

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting

Fri, 01 Jan 2016 00:00:00 +0000

Districting and Routing for Security Control

Fri, 01 Jan 2016 00:00:00 +0000

Edge-Editing to a Dense and a Sparse Graph Class

Fri, 01 Jan 2016 00:00:00 +0000

Evaluation of Labeling Strategies for Rotating Maps

Fri, 01 Jan 2016 00:00:00 +0000

Extending Convex Partial Drawings of Graphs

Fri, 01 Jan 2016 00:00:00 +0000

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers

Fri, 01 Jan 2016 00:00:00 +0000

FO Model Checking of Interval Graphs

Fri, 01 Jan 2016 00:00:00 +0000

Hybrid Metaheuristics – Powerful Tools for Optimization

Fri, 01 Jan 2016 00:00:00 +0000

Knowledge Compilation Meets Communication Complexity

Fri, 01 Jan 2016 00:00:00 +0000

Long Distance Q-Resolution with Dependency Schemes

Fri, 01 Jan 2016 00:00:00 +0000

Meta-Kernelization with Structural Parameters

Fri, 01 Jan 2016 00:00:00 +0000

Mixed Map Labeling

Fri, 01 Jan 2016 00:00:00 +0000

Model Checking Existential Logic on Partially Ordered Sets

Fri, 01 Jan 2016 00:00:00 +0000

Model Counting for CNF Formulas of Bounded Modular Treewidth

Fri, 01 Jan 2016 00:00:00 +0000

Models and Algorithms for Competitive Facility Location Problems with Different Customer Behavior

Fri, 01 Jan 2016 00:00:00 +0000

New Developments in Metaheuristics and their Applications – Selected Extended Contributions from the 10th Metaheuristics International Conference (MIC~2013)

Fri, 01 Jan 2016 00:00:00 +0000

On Existential MSO and its Relation to ETH

Fri, 01 Jan 2016 00:00:00 +0000

On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs

Fri, 01 Jan 2016 00:00:00 +0000

On the Complexity Landscape of Connected f-factor Problems

Fri, 01 Jan 2016 00:00:00 +0000

Parameterized Complexity in the Polynomial Hierarchy

Fri, 01 Jan 2016 00:00:00 +0000

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation

Fri, 01 Jan 2016 00:00:00 +0000

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics

Fri, 01 Jan 2016 00:00:00 +0000

Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation

Fri, 01 Jan 2016 00:00:00 +0000

Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation

Fri, 01 Jan 2016 00:00:00 +0000

Partially Polynomial Kernels for Set Cover and Test Cover

Fri, 01 Jan 2016 00:00:00 +0000

Particle Therapy Patient Scheduling: First Heuristic Approaches

Fri, 01 Jan 2016 00:00:00 +0000

Polynomial-Time Construction of Optimal MPI Derived Datatype Trees

Fri, 01 Jan 2016 00:00:00 +0000

Positive and Negative Results for Parameterized Compilability

Fri, 01 Jan 2016 00:00:00 +0000

Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16)

Fri, 01 Jan 2016 00:00:00 +0000

Quantified Conjunctive Queries on Partially Ordered Sets

Fri, 01 Jan 2016 00:00:00 +0000

Quantifier reordering for QBF

Fri, 01 Jan 2016 00:00:00 +0000

SDDs Are Exponentially More Succinct than OBDDs

Fri, 01 Jan 2016 00:00:00 +0000

SOBRA - Shielding Optimization for BRAchytherapy

Fri, 01 Jan 2016 00:00:00 +0000

Software Visualization via Hierarchic Micro/Macro Layouts

Fri, 01 Jan 2016 00:00:00 +0000

Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition

Fri, 01 Jan 2016 00:00:00 +0000

Soundness of Q-resolution with dependency schemes

Fri, 01 Jan 2016 00:00:00 +0000

Stable Matching with Uncertain Linear Preferences

Fri, 01 Jan 2016 00:00:00 +0000

Strict Confluent Drawing

Fri, 01 Jan 2016 00:00:00 +0000

Strong Parameterized Deletion: Bipartite Graphs

Fri, 01 Jan 2016 00:00:00 +0000

Succinctness of Languages for Judgment Aggregation

Fri, 01 Jan 2016 00:00:00 +0000

Temporal Map Labeling: A New Unified Framework with Experiments

Fri, 01 Jan 2016 00:00:00 +0000

The Complexity Landscape of Decompositional Parameters for ILP

Fri, 01 Jan 2016 00:00:00 +0000

Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics

Fri, 01 Jan 2016 00:00:00 +0000

Tree-depth and vertex-minors

Fri, 01 Jan 2016 00:00:00 +0000

Using Decomposition-Parameters for QBF: Mind the Prefix!

Fri, 01 Jan 2016 00:00:00 +0000

Visibility Based Obstacle Placing – Automated Obstacle Placing Based on Circularity

Fri, 01 Jan 2016 00:00:00 +0000

Solving the Travelling Thief Problem with an Evolutionary Algorithm

Tue, 01 Sep 2015 00:00:00 +0000

Electric Vehicles Recharge Scheduling with Logic-Based Benders Decomposition

Wed, 01 Jul 2015 00:00:00 +0000

Optimization Approaches for Recreational Bicycle Tour Planning

Wed, 01 Apr 2015 00:00:00 +0000

Numerical Optimisation of Electro-Hybrid Powertrains

Sun, 01 Mar 2015 00:00:00 +0000

Numerische Optimierung elektrifizierter Antriebsstränge

Sun, 01 Mar 2015 00:00:00 +0000

Problem Instances

Tue, 24 Feb 2015 00:00:00 +0000

Electric Autonomous Dial-a-Ride Problem

Contact: Maria Bresich and/or Günther Raidl

The E-ADARP benchmark instances including a description of their format as originally introduced and provided in Bongiovanni et al. (2019) can be found here.

Graph Burning Problem

Contact: Enrico Iurlano and/or Günther Raidl

Computational results referred to in the preprint [Iurlano, Raidl, and Djukanovic 2025] can be found here.
A description of the instance format can be found here here.

Interactive Job Scheduling Problem

Contact: Johannes Varga and/or Günther Raidl

The IJSP instance set can be found here.
The instance set with real-world availabilities can be found here.

A description of the instance format can be found here.

The samples for the Bayesian Learning can be found here.
Their format is described here.

Roman Domination Problem

Instance sets for different graph classes can be found here.
Experimental results for the instance sets can be found here.
A description of the instance format can be found here.

1 result


2024
[1]	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]

Contact: Enrico Iurlano and/or Günther Raidl

EV Fleet Charging and Allocation Problem

Contact: Johannes Varga and/or Günther Raidl

The EVFCAP instance set can be found here.
The reduced EVFCAP instance set can be found here.

A description of the instance format can be found here.

EV charging scheduling problem with SOC-dependent maximum charging power

Contact: Thomas Jatschka and/or Günther Raidl

Individual EVS-SOC instances can be found here.
Rolling horizon EVS-SOC instances can be found here.

A description of the instance format can be found here.

Searching for Stable Fixed-Edge Graphs - Instances and Source Code

Contact: Benedikt Klocker and/or Günther Raidl
Instance Set 1 (3-connected 3-regular planar graphs with minimum degree three) can be found here.
Instance Set 2 (after inserting some random degree two vertices into 3-connected 3-regular planar graphs with minimum degree three) can be found here.
Instance Set 3 (random potential candidate graphs for minimal counter example, grouped by number of faces) can be found here.

All instance files are in g6-format see here for a description of the format.

The source code for the program to check if a graph contains a SFE-cycle can be found here.

Snarks which do not contain perfect pseudo-matching whose contraction leads to planar/K5-minor-free/SUD-K5-minor-free graphs

In the following we will provide a collection of all snarks with up to 32 vertices that do not contain a planarizing perfect pseudo-matching. For the definition of this property and also the terminology which will be used in the following see [1]. The algorithm used to check the properties is described in [2]. Furthermore, a collection of all snarks with up to 32 vertices provided by the House of Graphs was used.

The following table lists for each snark size (number of vertices) from 26 to 32 the total number of such snarks, the number of snarks which do not have a planarizing perfect pseudo-matching but do have a perfect pseudo-matching whose contraction leads to a K5-minor-free graph [no pppm], the number of snarks which do not have a perfect pseudo matching whose contraction leads to a K5-minor-free graph but have one whose contraction leads to a SUD-K5-minor-free graph [no k5mfppm], and the number of snarks which do not have a perfect pseudo matching whose contraction leads to a SUD-K5-minor-free graph but have one whose contraction leads to a graph containing a compatible circuit decomposition [no sk5mfppm].

You can download the list of all such snarks by pressing on the link of the appropriate cell. The graphs are listed one per line in the graph6 format, see Brendan McKay’s website for a formal definition.

Every snark with up to 24 vertices contains a planarizing perfect pseudo-matching. Furthermore, all snarks with up to 32 vertices contain a perfect pseudo-matching whose contraction leads to a graph containinga compatible circuit decomposition.

size	total number of snarks	no pppm	no k5mfppm	no sk5mfppm
26	1297	2	0	0
28	12517	45	15	0
30	139854	933	578	33
32	1764950	24268	18537	1062

3 results


2019
[3]	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]
2018
[2]	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]
[1]	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]

Anytime Algorithms For Solving the Longest Common Palindromic Subsequence Problem (LCPS):

Contact: Marko Djukanovic and/or Günther Raidl
Instances for the 2-LCPS problem can be found here.
The supplementary file of this research can be found here.

Battery Swapping Station Location Problem (BSSLP)

Contact: Thomas Jatschka, Günther Raidl
Instances for the EVTeC 2023 can be found here.

Service Point Distribution Problem (SPDP)

Contact: Thomas Jatschka, Günther Raidl
Instances for the EvoCOP 2019 can be found here.
Instances for the LOD 2019 are available here.
GPSPDP instances are available here.

Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources (PC-JSOCMSR)

Contact: Matthias Horn, Johannes Maschler, Günther Raidl
Instances for the PC-JSOCMSR problem can be found here. For details on the instance format see the included description. The following publications consider these benchmark instances: 6 results


2021
[6]	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]	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]	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]
2019
[3]	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]
2018
[2]	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]
[1]	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]

String Problems

The Longest Common Subsequence Problem (LCSP)

Contact: Marc Huber and/or Günther Raidl
Instances for LCSP (LOD 2021) can be found here.

The Longest Common Palindromic Subsequence Problem (LCPSP)

Contact: Marko Djukanovic and/or Günther Raidl
Instances for LCPSP (provided by Christian Blum ) can be found here.

The Constraint Longest Common Subsequence Problem (CLCSP)

Contact: Marc Huber and/or Günther Raidl
Instances for CLCSP (LOD 2021) can be found here.

The Shortest Common Supersequence Problem (SCSP)

Contact: Marc Huber and/or Günther Raidl
Instances and results for SCSP (EvoCOP 2022) can be found here.

Particle Therapy Patient Scheduling

Contact: Johannes Maschler, Martin Riedler, Günther Raidl

Particle Therapy Patient Scheduling Problem (PTPSP)

Instances for PTPSP can be found here. For details on the instance format and the applied preprocessing see the included description. The following publications consider these benchmark instances: 3 results


2018
[3]	Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments Johannes Maschler, Günther R. Raidl International Transactions in Operational Research, 2018. [bibtex] [pdf] [doi]
[2]	Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments Johannes Maschler, Martin Riedler, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2017, Part I, pages 364–372, 2018, Springer. [bibtex] [pdf] [doi]
2017
[1]	An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem Johannes Maschler, Thomas Hackl, Martin Riedler, Günther R. Raidl Proceedings of the 12th Metaheuristics International Conference, pages 465–474, 2017. [bibtex] [pdf]

First instances for PTPSP including a description of the used file format can be found here. Updated instances and results can be found here. These benchmark instances have been considered by 1 result


2016
[1]	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]

Simplified Intraday Particle Therapy Patient Scheduling Problem (SI-PTPSP)

The instances can be found here. For details on the instance format see the included README file.
The following publication considers these test instances:

1 result


2020
[1]	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, jan 2020. [bibtex] [pdf] [doi]

Job Sequencing with One Common and Multiple Secondary Resources (JSOCMSR)

Instances for the JSOCMSR can be found here

Districting and Routing Problem for Security Control

Contact: Benjamin Biesinger, Christian Kloimüllner

Instances for the published results can be found here.

Dial-a-Ride Problem

Contact: Martin Riedler, Günther Raidl

Instances including a description of the used file format can be found here.

Network Design Problem with Relays

Contact: Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair

Instances including a description of the used file format can be found here.
Further instances from the literature can be found at https://sites.psu.edu/auk3/research/test-problems/.

Directed Network Design Problem with Relays

Contact: Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair

The modified instances by Cabral et al. are available here.
Our newly generated Euclidean instances can be found here.
The used instance format is described in format-description.txt.
The instances by Konak can be retrieved at https://sites.psu.edu/auk3/research/test-problems/.

Rooted Delay-Constrained Minimum Spanning Tree Problems

Contact: Mario Ruthmair

C++-Code for reading instance format
complete instance graphs with 100, 200, 500, 1000 nodes and random integer edge costs and delays in [1,99]

Consensus Tree Problem

Contact: Sandro Pirkwieser

instances based on real data
new artificially generated instances
new artificially generated small instances

Periodic Vehicle Routing Problem with Time Windows

Contact: Sandro Pirkwieser

We created instances based on Solomon’s VRPTW instances with 100 customers:

planning period of four days
planning period of six days
planning period of eight days

Of the newly created instances with a planning horizon of four days we generated smaller ones for the exact approaches:

having 36 customers
having 50 customers

Periodic Vehicle Routing Problem and Periodic Traveling Salesman Problem

Contact: Sandro Pirkwieser

We created larger instances having 336 to 576 customers and a planning horizon of four or six days

instances for the pvrp
instances for the ptsp

Vehicle Routing Problem with Compartments

Contact: Sandro Pirkwieser

benchmark instances of Derigs et al. available here
modified petrol benchmark instances of Derigs et al. exhibiting a harder packing subproblem

Bi-level Vehicle Routing Problem

Contact: Günther R. Raidl, Bin Hu

Full result table of “Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search”

Contact: Christian Kloimüllner, Petrina Papazek

The homepage of the Balancing Bicylce Sharing System (BBSS) project can be found here.

Our instances are based on real data from Citybike Wien. We got information about 92 stations which contain fill levels at different time in the system, capacity of stations, geographic coordinates, and traveling times between stations.

We constructed instances which contain:

capacity,
initial fill level,
target fill level of stations,
traveling times, and
(user) demand values for dynamic rebalancing.

Furthermore, our instances have different size of stations, namely, 10, 20, 30, 60, 90, 120, 180, 240, 300, 400, 500, 600 and 700. Thus, we got a set of artificial stations from our partner, the AIT (Austrian Institute of Technology), which extend the real data we got from Citybike Wien. In particular, we choose the stations for our instances randomly from a set of 92 real stations plus 664 artificial stations.

For the following set of instances we took a snapshot from the system of Citybike Wien to derive initial fill levels for the stations. Furthermore, we set the target value of stations to be 50% of their capacities. We used exactly one depot and also one travel time matrix and the demands for the stations are derived randomly for eight different time points.

bench2: Benchmark instances based on data from Citybike Wien (used in [1-3, 6])

In EVOCOP-2013 results we list complete computational results based on bench 2 for comparing our auxilary algroithms for deriving loading operations described in [2013,4].

The next benchmark instances contain (user) demand values for the real stations which we got from our partner, the AIT. For the artificial stations we calculated random demand values according to a Beta distribution.

Moreover, we adopted the initial fill levels and target values. The initial fill levels for the artificial stations have been calculated the same way like we did it for the demands, i.e., such that the distribution of the fill levels for artificial stations is similar to that one of the real stations. The target values were set according to their demand. For stations with a high bike demand we set the target value to be 75% of the stations capacity, for stations with a high slot demand to 25% and if both, the bike- as well as the slot demand, are similar we set their target value to 50% of the capacity.

Additionally, we provided four different travel time matrices which show the traveling time at 4:30 am, 8:00 am, 12:00 pm, as well as 6:15 pm.

bench3: Benchmark instances with advanced initial and target fill levels and time-varying travel times (used in [4,5])

Publications using these benchmark instances

7 results


2019
[7]	Algorithmic Approaches for Optimization Problems in Bike Sharing and Security Control Christian Kloimüllner mar 2019, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by Günther R. Raidl [bibtex] [pdf]
2015
[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]
2014
[5]	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]
[4]	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]
2013
[3]	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]
[2]	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]
[1]	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]

Mulitmodal Home-Healthcare Scheduling (MHS) Problem

Contact: Günther R. Raidl, Matthias Prandtstetter

Competitive Facility Location Problems

Contact: Benjamin Biesinger, Bin Hu, Günther R. Raidl

Multi Layer Hierarchical Ring Network Design Problem

Contact: Christian Schauer, Günther R. Raidl

Two Dimensional Pre-Marshalling Problem

Contact: Günther Raidl Benchmark instances for the Two Dimensional Pre-Marshalling Problem (2D-PMP) with 4,6,8,10,12,and 14 columns width, 4 stacks height and 50% and 75% fullness ratio. By combining these parameters we obtain a total of 612=12 categories of instances. Each category contains 50 instances. The instances were generated using the instance generator found at (https://sites.google.com/site/gciports/premarshalling-problem/bay-generator) provided by:

Exposito-Izquierdo, C., Melian-Batista, B., Moreno-Vega, M.: Pre-marshalling problem: Heuristic solution method and instances generator. Expert Systems with Applications 39(9) (2012) 8337-8349

File names are encoded using the following key: instance_w_h_c_x.txt

w - width
h - height
c - number of containers within bay (defined by fullness ratio)
x - instance number within category

Generalized Vehicle Routing Problem with Stochastic Demands

Contact: Benjamin Biesinger, Bin Hu, Günther R. Raidl

Benchmark instances for the Generalized Vehicle Routing Problem with Stochastic Demands based on the instances for the GVRP (http://www.personal.soton.ac.uk/tb12v07/gvrp.html) using the same format. In the demand section the expected demand d for each cluster is listed along with a number x. This number determines the possible demand values which are given by D={d-ceil(x*d),…,d+ceil(x*d)} and each demand value has equal probability 1 / |D|.
Full result tables of “A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands”, accepted by the EvoCOP 2015 coference.

Virtual Network Mapping Problem

(Contact: Johannes Inführ, Günther Raidl)

Benchmark Set for the VNMP

VNMP Benchmark Set

Solutions Achieved by Heuristic and Exact Approaches

Benchmark Set for the VNMP-DRL

Data Supplement for EvoCOP 2013

Data Supplement

Problem Instances

Tue, 24 Feb 2015 00:00:00 +0000

Electric Autonomous Dial-a-Ride Problem

Contact: Maria Bresich and/or Günther Raidl

The E-ADARP benchmark instances including a description of their format as originally introduced and provided in Bongiovanni et al. (2019) can be found here.

Graph Burning Problem

Contact: Enrico Iurlano and/or Günther Raidl

Computational results referred to in the preprint [Iurlano, Raidl, and Djukanovic 2025] can be found here.
A description of the instance format can be found here here.

Interactive Job Scheduling Problem

Contact: Johannes Varga and/or Günther Raidl

The IJSP instance set can be found here.
The instance set with real-world availabilities can be found here.

A description of the instance format can be found here.

The samples for the Bayesian Learning can be found here.
Their format is described here.

Roman Domination Problem

Instance sets for different graph classes can be found here.
Experimental results for the instance sets can be found here.
A description of the instance format can be found here.

1 result


2024
[1]	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]

Contact: Enrico Iurlano and/or Günther Raidl

EV Fleet Charging and Allocation Problem

Contact: Johannes Varga and/or Günther Raidl

The EVFCAP instance set can be found here.
The reduced EVFCAP instance set can be found here.

A description of the instance format can be found here.

EV charging scheduling problem with SOC-dependent maximum charging power

Contact: Thomas Jatschka and/or Günther Raidl

Individual EVS-SOC instances can be found here.
Rolling horizon EVS-SOC instances can be found here.

A description of the instance format can be found here.

Searching for Stable Fixed-Edge Graphs - Instances and Source Code

All instance files are in g6-format see here for a description of the format.

The source code for the program to check if a graph contains a SFE-cycle can be found here.

Snarks which do not contain perfect pseudo-matching whose contraction leads to planar/K5-minor-free/SUD-K5-minor-free graphs

size	total number of snarks	no pppm	no k5mfppm	no sk5mfppm
26	1297	2	0	0
28	12517	45	15	0
30	139854	933	578	33
32	1764950	24268	18537	1062

3 results


2019
[3]	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]
2018
[2]	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]
[1]	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]

Anytime Algorithms For Solving the Longest Common Palindromic Subsequence Problem (LCPS):

Contact: Marko Djukanovic and/or Günther Raidl
Instances for the 2-LCPS problem can be found here.
The supplementary file of this research can be found here.

Battery Swapping Station Location Problem (BSSLP)

Contact: Thomas Jatschka, Günther Raidl
Instances for the EVTeC 2023 can be found here.

Service Point Distribution Problem (SPDP)

Contact: Thomas Jatschka, Günther Raidl
Instances for the EvoCOP 2019 can be found here.
Instances for the LOD 2019 are available here.
GPSPDP instances are available here.

Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources (PC-JSOCMSR)


2021
[6]	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]	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]	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]
2019
[3]	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]
2018
[2]	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]
[1]	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]

String Problems

The Longest Common Subsequence Problem (LCSP)

Contact: Marc Huber and/or Günther Raidl
Instances for LCSP (LOD 2021) can be found here.

The Longest Common Palindromic Subsequence Problem (LCPSP)

Contact: Marko Djukanovic and/or Günther Raidl
Instances for LCPSP (provided by Christian Blum ) can be found here.

The Constraint Longest Common Subsequence Problem (CLCSP)

Contact: Marc Huber and/or Günther Raidl
Instances for CLCSP (LOD 2021) can be found here.

The Shortest Common Supersequence Problem (SCSP)

Contact: Marc Huber and/or Günther Raidl
Instances and results for SCSP (EvoCOP 2022) can be found here.

Particle Therapy Patient Scheduling

Contact: Johannes Maschler, Martin Riedler, Günther Raidl

Particle Therapy Patient Scheduling Problem (PTPSP)


2018
[3]	Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments Johannes Maschler, Günther R. Raidl International Transactions in Operational Research, 2018. [bibtex] [pdf] [doi]
[2]	Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments Johannes Maschler, Martin Riedler, Günther R. Raidl Computer Aided Systems Theory – EUROCAST 2017, Part I, pages 364–372, 2018, Springer. [bibtex] [pdf] [doi]
2017
[1]	An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem Johannes Maschler, Thomas Hackl, Martin Riedler, Günther R. Raidl Proceedings of the 12th Metaheuristics International Conference, pages 465–474, 2017. [bibtex] [pdf]


2016
[1]	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]

Simplified Intraday Particle Therapy Patient Scheduling Problem (SI-PTPSP)

The instances can be found here. For details on the instance format see the included README file.
The following publication considers these test instances:

1 result


2020
[1]	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, jan 2020. [bibtex] [pdf] [doi]

Job Sequencing with One Common and Multiple Secondary Resources (JSOCMSR)

Instances for the JSOCMSR can be found here

Districting and Routing Problem for Security Control

Contact: Benjamin Biesinger, Christian Kloimüllner

Instances for the published results can be found here.

Dial-a-Ride Problem

Contact: Martin Riedler, Günther Raidl

Instances including a description of the used file format can be found here.

Network Design Problem with Relays

Contact: Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair

Instances including a description of the used file format can be found here.
Further instances from the literature can be found at https://sites.psu.edu/auk3/research/test-problems/.

Directed Network Design Problem with Relays

Contact: Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair

Rooted Delay-Constrained Minimum Spanning Tree Problems

Contact: Mario Ruthmair

C++-Code for reading instance format
complete instance graphs with 100, 200, 500, 1000 nodes and random integer edge costs and delays in [1,99]

Consensus Tree Problem

Contact: Sandro Pirkwieser

instances based on real data
new artificially generated instances
new artificially generated small instances

Periodic Vehicle Routing Problem with Time Windows

Contact: Sandro Pirkwieser

We created instances based on Solomon’s VRPTW instances with 100 customers:

planning period of four days
planning period of six days
planning period of eight days

Of the newly created instances with a planning horizon of four days we generated smaller ones for the exact approaches:

having 36 customers
having 50 customers

Periodic Vehicle Routing Problem and Periodic Traveling Salesman Problem

Contact: Sandro Pirkwieser

We created larger instances having 336 to 576 customers and a planning horizon of four or six days

instances for the pvrp
instances for the ptsp

Vehicle Routing Problem with Compartments

Contact: Sandro Pirkwieser

benchmark instances of Derigs et al. available here
modified petrol benchmark instances of Derigs et al. exhibiting a harder packing subproblem

Bi-level Vehicle Routing Problem

Contact: Günther R. Raidl, Bin Hu

Full result table of “Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search”

Contact: Christian Kloimüllner, Petrina Papazek

The homepage of the Balancing Bicylce Sharing System (BBSS) project can be found here.

We constructed instances which contain:

capacity,
initial fill level,
target fill level of stations,
traveling times, and
(user) demand values for dynamic rebalancing.

bench2: Benchmark instances based on data from Citybike Wien (used in [1-3, 6])

In EVOCOP-2013 results we list complete computational results based on bench 2 for comparing our auxilary algroithms for deriving loading operations described in [2013,4].

Additionally, we provided four different travel time matrices which show the traveling time at 4:30 am, 8:00 am, 12:00 pm, as well as 6:15 pm.

bench3: Benchmark instances with advanced initial and target fill levels and time-varying travel times (used in [4,5])

Publications using these benchmark instances

7 results


2019
[7]	Algorithmic Approaches for Optimization Problems in Bike Sharing and Security Control Christian Kloimüllner mar 2019, PhD thesis, Institute of Logic and Computation, TU Wien. Note: supervised by Günther R. Raidl [bibtex] [pdf]
2015
[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]
2014
[5]	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]
[4]	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]
2013
[3]	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]
[2]	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]
[1]	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]

Mulitmodal Home-Healthcare Scheduling (MHS) Problem

Contact: Günther R. Raidl, Matthias Prandtstetter

Competitive Facility Location Problems

Contact: Benjamin Biesinger, Bin Hu, Günther R. Raidl

Multi Layer Hierarchical Ring Network Design Problem

Contact: Christian Schauer, Günther R. Raidl

Two Dimensional Pre-Marshalling Problem

Exposito-Izquierdo, C., Melian-Batista, B., Moreno-Vega, M.: Pre-marshalling problem: Heuristic solution method and instances generator. Expert Systems with Applications 39(9) (2012) 8337-8349

File names are encoded using the following key: instance_w_h_c_x.txt

w - width
h - height
c - number of containers within bay (defined by fullness ratio)
x - instance number within category

Generalized Vehicle Routing Problem with Stochastic Demands

Contact: Benjamin Biesinger, Bin Hu, Günther R. Raidl

Benchmark instances for the Generalized Vehicle Routing Problem with Stochastic Demands based on the instances for the GVRP (http://www.personal.soton.ac.uk/tb12v07/gvrp.html) using the same format. In the demand section the expected demand d for each cluster is listed along with a number x. This number determines the possible demand values which are given by D={d-ceil(x*d),…,d+ceil(x*d)} and each demand value has equal probability 1 / |D|.
Full result tables of “A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands”, accepted by the EvoCOP 2015 coference.

Virtual Network Mapping Problem

(Contact: Johannes Inführ, Günther Raidl)

Benchmark Set for the VNMP

VNMP Benchmark Set

Solutions Achieved by Heuristic and Exact Approaches

Benchmark Set for the VNMP-DRL

Data Supplement for EvoCOP 2013

Data Supplement

A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems

Thu, 01 Jan 2015 00:00:00 +0000

A complete parameterized complexity analysis of bounded planning

Thu, 01 Jan 2015 00:00:00 +0000

A Dichotomy Result for Ramsey Quantifiers

Thu, 01 Jan 2015 00:00:00 +0000

A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problem

Thu, 01 Jan 2015 00:00:00 +0000

A Hybrid Genetic Algorithm with Solution Archive for the Discrete (r|p)-Centroid Problem

Thu, 01 Jan 2015 00:00:00 +0000

A New Solution Representation for the Firefighter Problem

Thu, 01 Jan 2015 00:00:00 +0000

A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles

Thu, 01 Jan 2015 00:00:00 +0000

A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles

Thu, 01 Jan 2015 00:00:00 +0000

A SAT Approach to Clique-Width

Thu, 01 Jan 2015 00:00:00 +0000

A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size

Thu, 01 Jan 2015 00:00:00 +0000

A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size

Thu, 01 Jan 2015 00:00:00 +0000

A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands

Thu, 01 Jan 2015 00:00:00 +0000

Algorithmic Applications of Tree-Cut Width

Thu, 01 Jan 2015 00:00:00 +0000

An Overview of Non-Uniform Parameterized Complexity

Thu, 01 Jan 2015 00:00:00 +0000

Backdoors to Normality for Disjunctive Logic Programs

Thu, 01 Jan 2015 00:00:00 +0000

Backdoors to Tractable Answer Set Programming

Thu, 01 Jan 2015 00:00:00 +0000

Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem

Thu, 01 Jan 2015 00:00:00 +0000

Community Structure Inspired Algorithms for SAT and \#SAT

Thu, 01 Jan 2015 00:00:00 +0000

Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young

Thu, 01 Jan 2015 00:00:00 +0000

Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young

Thu, 01 Jan 2015 00:00:00 +0000

Computing secure sets in graphs using answer set programming

Thu, 01 Jan 2015 00:00:00 +0000

CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem

Thu, 01 Jan 2015 00:00:00 +0000

Decomposition Based Hybrid Metaheuristics

Thu, 01 Jan 2015 00:00:00 +0000

Drawing Large Graphs by Multilevel Maxent-Stress Optimization

Thu, 01 Jan 2015 00:00:00 +0000

Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052)

Thu, 01 Jan 2015 00:00:00 +0000

Exact Approaches for Network Design Problems with Relays

Thu, 01 Jan 2015 00:00:00 +0000

Faster Parameterized Algorithms for Deletion to Split Graphs

Thu, 01 Jan 2015 00:00:00 +0000

First-Order Queries on Finite Abelian Groups

Thu, 01 Jan 2015 00:00:00 +0000

Fixed-parameter Tractable Reductions to SAT for Planning

Thu, 01 Jan 2015 00:00:00 +0000

FO Model Checking on Posets of Bounded Width

Thu, 01 Jan 2015 00:00:00 +0000

Heuristic Approaches for the Probabilistic Traveling Salesman Problem

Thu, 01 Jan 2015 00:00:00 +0000

Heuristic Approaches for the Probabilistic Traveling Salesman Problem

Thu, 01 Jan 2015 00:00:00 +0000

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning

Thu, 01 Jan 2015 00:00:00 +0000

Improving Vertex Cover as a Graph Parameter

Thu, 01 Jan 2015 00:00:00 +0000

Label Placement in Road Maps

Thu, 01 Jan 2015 00:00:00 +0000

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set

Thu, 01 Jan 2015 00:00:00 +0000

Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP

Thu, 01 Jan 2015 00:00:00 +0000

Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP

Thu, 01 Jan 2015 00:00:00 +0000

Many-to-One Boundary Labeling with Backbones

Thu, 01 Jan 2015 00:00:00 +0000

Meta-Kernelization using Well-Structured Modulators

Thu, 01 Jan 2015 00:00:00 +0000

Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem

Thu, 01 Jan 2015 00:00:00 +0000

Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem

Thu, 01 Jan 2015 00:00:00 +0000

Metric Dimension of Bounded Width Graphs

Thu, 01 Jan 2015 00:00:00 +0000

Mixed Map Labeling

Thu, 01 Jan 2015 00:00:00 +0000

Multi-Row Boundary-Labeling Algorithms for Panorama Images

Thu, 01 Jan 2015 00:00:00 +0000

On Compiling CNFs into Structured Deterministic DNNFs

Thu, 01 Jan 2015 00:00:00 +0000

On Compiling Structured CNFs to OBDDs

Thu, 01 Jan 2015 00:00:00 +0000

On finding optimal polytrees

Thu, 01 Jan 2015 00:00:00 +0000

On Minimizing Crossings in Storyline Visualizations

Thu, 01 Jan 2015 00:00:00 +0000

On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics

Thu, 01 Jan 2015 00:00:00 +0000

On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem

Thu, 01 Jan 2015 00:00:00 +0000

On the Complexity of Rainbow Coloring Problems

Thu, 01 Jan 2015 00:00:00 +0000

On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids

Thu, 01 Jan 2015 00:00:00 +0000

On the Readability of Boundary Labeling

Thu, 01 Jan 2015 00:00:00 +0000

On the Subexponential-Time Complexity of CSP

Thu, 01 Jan 2015 00:00:00 +0000

Operating Power Grids with Few Flow Control Buses

Thu, 01 Jan 2015 00:00:00 +0000

Parameterized Algorithms for Parity Games

Thu, 01 Jan 2015 00:00:00 +0000

Parameterized and subexponential-time complexity of satisfiability problems and applications

Thu, 01 Jan 2015 00:00:00 +0000

Parameterized Complexity of Asynchronous Border Minimization

Thu, 01 Jan 2015 00:00:00 +0000

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation

Thu, 01 Jan 2015 00:00:00 +0000

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics

Thu, 01 Jan 2015 00:00:00 +0000

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

Thu, 01 Jan 2015 00:00:00 +0000

PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems

Thu, 01 Jan 2015 00:00:00 +0000

Recognizing Weighted Disk Contact Graphs

Thu, 01 Jan 2015 00:00:00 +0000

Reconfiguration on Sparse Graphs

Thu, 01 Jan 2015 00:00:00 +0000

Solving d-SAT via Backdoors to Small Treewidth

Thu, 01 Jan 2015 00:00:00 +0000

Solving Problems on Graphs of High Rank-Width

Thu, 01 Jan 2015 00:00:00 +0000

Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search

Thu, 01 Jan 2015 00:00:00 +0000

Solving the Multi-Objective Steiner Tree Problem with Resources

Thu, 01 Jan 2015 00:00:00 +0000

The complexity of equivalence, entailment, and minimization in existential positive logic

Thu, 01 Jan 2015 00:00:00 +0000

Towards Realistic Flow Control in Power Grid Operation

Thu, 01 Jan 2015 00:00:00 +0000

Towards Realistic Pedestrian Route Planning

Thu, 01 Jan 2015 00:00:00 +0000

Variable-Deletion Backdoors to Planning

Thu, 01 Jan 2015 00:00:00 +0000

Heuristic Solution Approaches for the Two Dimensional Pre-Marshalling Problem

Sun, 01 Jun 2014 00:00:00 +0000

Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework

Thu, 01 May 2014 00:00:00 +0000

A survey on automated metro map layout methods

Tue, 01 Apr 2014 00:00:00 +0000

A Hybrid Algorithm for the Partition Coloring Problem

Sat, 01 Feb 2014 00:00:00 +0000

Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows

Sat, 01 Feb 2014 00:00:00 +0000

Finding Longest Common Subsequences by GPU-Based Parallel Ant Colony Optimization

Sat, 01 Feb 2014 00:00:00 +0000

A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure

Wed, 01 Jan 2014 00:00:00 +0000

A Parameterized Study of Maximum Generalized Pattern Matching Problems

Wed, 01 Jan 2014 00:00:00 +0000

A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem

Wed, 01 Jan 2014 00:00:00 +0000

An Efficient Variable Neighborhood Search Solving a Robust Dynamic Facility Location Problem in Emergency Service Network

Wed, 01 Jan 2014 00:00:00 +0000

An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior

Wed, 01 Jan 2014 00:00:00 +0000

Backdoors into Heterogeneous Classes of SAT and CSP

Wed, 01 Jan 2014 00:00:00 +0000

Backdoors to Planning

Wed, 01 Jan 2014 00:00:00 +0000

Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid

Wed, 01 Jan 2014 00:00:00 +0000

Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case

Wed, 01 Jan 2014 00:00:00 +0000

Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search

Wed, 01 Jan 2014 00:00:00 +0000

Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy

Wed, 01 Jan 2014 00:00:00 +0000

Digraph width measures in parameterized algorithmics

Wed, 01 Jan 2014 00:00:00 +0000

Evaluation of Labeling Strategies for Rotating Maps

Wed, 01 Jan 2014 00:00:00 +0000

Faster Existential FO Model Checking on Posets

Wed, 01 Jan 2014 00:00:00 +0000

Faster Parameterized Algorithms Using Linear Programming

Wed, 01 Jan 2014 00:00:00 +0000

Finite Integer Index of Pathwidth and Treewidth

Wed, 01 Jan 2014 00:00:00 +0000

Fixed-Parameter Tractable Reductions to SAT

Wed, 01 Jan 2014 00:00:00 +0000

Guarantees and limits of preprocessing in constraint satisfaction and reasoning

Wed, 01 Jan 2014 00:00:00 +0000

Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts

Wed, 01 Jan 2014 00:00:00 +0000

Lower bounds on the complexity of MSO1 model-checking

Wed, 01 Jan 2014 00:00:00 +0000

Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams

Wed, 01 Jan 2014 00:00:00 +0000

Model checking existential logic on partially ordered sets

Wed, 01 Jan 2014 00:00:00 +0000

On d-regular schematization of embedded paths

Wed, 01 Jan 2014 00:00:00 +0000

On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs

Wed, 01 Jan 2014 00:00:00 +0000

On the Kernelization Complexity of String Problems

Wed, 01 Jan 2014 00:00:00 +0000

Parameterized Algorithms to Preserve Connectivity

Wed, 01 Jan 2014 00:00:00 +0000

Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications

Wed, 01 Jan 2014 00:00:00 +0000

Parameterized Approximations via d-Skew-Symmetric Multicut

Wed, 01 Jan 2014 00:00:00 +0000

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation

Wed, 01 Jan 2014 00:00:00 +0000

PIGRA – A Tool for Pixelated Graph Representations

Wed, 01 Jan 2014 00:00:00 +0000

Quantified Conjunctive Queries on Partially Ordered Sets

Wed, 01 Jan 2014 00:00:00 +0000

Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles

Wed, 01 Jan 2014 00:00:00 +0000

Scalability Considerations for Multivariate Graph Visualization

Wed, 01 Jan 2014 00:00:00 +0000

Semantic Word Cloud Representations: Hardness and Approximation Algorithms

Wed, 01 Jan 2014 00:00:00 +0000

Simultaneous Embeddability of Two Partitions

Wed, 01 Jan 2014 00:00:00 +0000

Small Unsatisfiable Subsets in Constraint Satisfaction

Wed, 01 Jan 2014 00:00:00 +0000

Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem

Wed, 01 Jan 2014 00:00:00 +0000

Subexponential Time Complexity of CSP with Global Constraints

Wed, 01 Jan 2014 00:00:00 +0000

The Complexity of Width Minimization for Existential Positive Queries

Wed, 01 Jan 2014 00:00:00 +0000

The Parameterized Complexity of Reasoning Problems Beyond NP

Wed, 01 Jan 2014 00:00:00 +0000

Tractable answer-set programming with weight constraints: bounded treewidth is not enough

Wed, 01 Jan 2014 00:00:00 +0000

Unification and Projectivity in De Morgan and Kleene Algebras

Wed, 01 Jan 2014 00:00:00 +0000

Variable Dependencies and Q-Resolution

Wed, 01 Jan 2014 00:00:00 +0000

Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure

Wed, 01 Jan 2014 00:00:00 +0000

Vertex Exponential Algorithms for Connected f-Factors

Wed, 01 Jan 2014 00:00:00 +0000

Balancing Bike Sharing Systems

Sun, 01 Dec 2013 00:00:00 +0000

The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays

Sun, 01 Dec 2013 00:00:00 +0000

Two-Phase Local Search for the Bi-objective Connected Facility Location Problem

Sun, 01 Dec 2013 00:00:00 +0000

Optimization Challenges of the Future Federated Internet

Tue, 01 Oct 2013 00:00:00 +0000

Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems

Thu, 01 Aug 2013 00:00:00 +0000

Metaheuristic Optimization of Electro-Hybrid Powertrains Using Machine Learning Techniques

Thu, 01 Aug 2013 00:00:00 +0000

Critical Links Detection using CUDA

Mon, 01 Apr 2013 00:00:00 +0000

Selective Graph Coloring Problem

Mon, 01 Apr 2013 00:00:00 +0000

Metaheuristics for the Regenerator Location Problem

Fri, 01 Mar 2013 00:00:00 +0000

A Memetic Algorithm for the Partition Graph Coloring Problem

Tue, 01 Jan 2013 00:00:00 +0000

A Memetic Algorithm for the Virtual Network Mapping Problem

Tue, 01 Jan 2013 00:00:00 +0000

A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem

Tue, 01 Jan 2013 00:00:00 +0000

A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem

Tue, 01 Jan 2013 00:00:00 +0000

A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems

Tue, 01 Jan 2013 00:00:00 +0000

A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems

Tue, 01 Jan 2013 00:00:00 +0000

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

Tue, 01 Jan 2013 00:00:00 +0000

A SAT Approach to Clique-Width

Tue, 01 Jan 2013 00:00:00 +0000

A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables

Tue, 01 Jan 2013 00:00:00 +0000

A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width

Tue, 01 Jan 2013 00:00:00 +0000

An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure

Tue, 01 Jan 2013 00:00:00 +0000

Backdoors to Abduction

Tue, 01 Jan 2013 00:00:00 +0000

Backdoors to Normality for Disjunctive Logic Programs

Tue, 01 Jan 2013 00:00:00 +0000

Backdoors to q-Horn

Tue, 01 Jan 2013 00:00:00 +0000

Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach

Tue, 01 Jan 2013 00:00:00 +0000

Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations

Tue, 01 Jan 2013 00:00:00 +0000

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width

Tue, 01 Jan 2013 00:00:00 +0000

Capturing Structure in Hard Combinatorial Problems

Tue, 01 Jan 2013 00:00:00 +0000

Circular-Arc Cartograms

Tue, 01 Jan 2013 00:00:00 +0000

Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem

Tue, 01 Jan 2013 00:00:00 +0000

Cops-and-robbers: remarks and problems

Tue, 01 Jan 2013 00:00:00 +0000

Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151)

Tue, 01 Jan 2013 00:00:00 +0000

Drawing Metro Maps using Bézier Curves

Tue, 01 Jan 2013 00:00:00 +0000

Drawing Planar Graphs with a Prescribed Inner Face

Tue, 01 Jan 2013 00:00:00 +0000

Drawing Trees with Perfect Angular Resolution and Polynomial Area

Tue, 01 Jan 2013 00:00:00 +0000

Edge-weighted contact representations of planar graphs

Tue, 01 Jan 2013 00:00:00 +0000

Edge-weighted contact representations of planar graphs

Tue, 01 Jan 2013 00:00:00 +0000

Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents

Tue, 01 Jan 2013 00:00:00 +0000

Euclidean Greedy Drawings of Trees

Tue, 01 Jan 2013 00:00:00 +0000

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes

Tue, 01 Jan 2013 00:00:00 +0000

Faster Exact Algorithms for Some Terminal Set Problems

Tue, 01 Jan 2013 00:00:00 +0000

Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints

Tue, 01 Jan 2013 00:00:00 +0000

FO Model Checking of Interval Graphs

Tue, 01 Jan 2013 00:00:00 +0000

Generic expression hardness results for primitive positive formula comparison

Tue, 01 Jan 2013 00:00:00 +0000

GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem

Tue, 01 Jan 2013 00:00:00 +0000

Hardness of r-dominating set on Graphs of Diameter (r + 1)

Tue, 01 Jan 2013 00:00:00 +0000

Kernelization Using Structural Parameters on Sparse Graph Classes

Tue, 01 Jan 2013 00:00:00 +0000

Local Backbones

Tue, 01 Jan 2013 00:00:00 +0000

Many-to-One Boundary Labeling with Backbones

Tue, 01 Jan 2013 00:00:00 +0000

Meta-kernelization with Structural Parameters

Tue, 01 Jan 2013 00:00:00 +0000

Model Counting for CNF Formulas of Bounded Modular Treewidth

Tue, 01 Jan 2013 00:00:00 +0000

Model Counting for Formulas of Bounded Clique-Width

Tue, 01 Jan 2013 00:00:00 +0000

On the Subexponential Time Complexity of CSP

Tue, 01 Jan 2013 00:00:00 +0000

On The Usability of Lombardi Graph Drawings

Tue, 01 Jan 2013 00:00:00 +0000

Optimal 3D Angular Resolution for Low-Degree Graphs

Tue, 01 Jan 2013 00:00:00 +0000

Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers

Tue, 01 Jan 2013 00:00:00 +0000

Parameterized Complexity and Kernel Bounds for Hard Planning Problems

Tue, 01 Jan 2013 00:00:00 +0000

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs

Tue, 01 Jan 2013 00:00:00 +0000

Parameterized Complexity Results for Exact Bayesian Network Structure Learning

Tue, 01 Jan 2013 00:00:00 +0000

Parameterized Complexity Results for Plan Reuse

Tue, 01 Jan 2013 00:00:00 +0000

Partially Polynomial Kernels for Set Cover and Test Cover

Tue, 01 Jan 2013 00:00:00 +0000

PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems

Tue, 01 Jan 2013 00:00:00 +0000

Planar Lombardi Drawings of Outerpaths

Tue, 01 Jan 2013 00:00:00 +0000

Polynomial space hardness without disjunction property

Tue, 01 Jan 2013 00:00:00 +0000

Proceedings of the 10th Metaheuristics International Conference

Tue, 01 Jan 2013 00:00:00 +0000

Progress on Partial Edge Drawings

Tue, 01 Jan 2013 00:00:00 +0000

Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive

Tue, 01 Jan 2013 00:00:00 +0000

Revisiting Space in Proof Complexity: Treewidth and Pathwidth

Tue, 01 Jan 2013 00:00:00 +0000

Satisfiability of acyclic and almost acyclic CNF formulas

Tue, 01 Jan 2013 00:00:00 +0000

Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent

Tue, 01 Jan 2013 00:00:00 +0000

Stabilizing Branch-and-Price for Constrained Tree Problems

Tue, 01 Jan 2013 00:00:00 +0000

Strict Confluent Drawing

Tue, 01 Jan 2013 00:00:00 +0000

Strong Backdoors to Bounded Treewidth SAT

Tue, 01 Jan 2013 00:00:00 +0000

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation

Tue, 01 Jan 2013 00:00:00 +0000

The Parameterized Complexity of Constraint Satisfaction and Reasoning

Tue, 01 Jan 2013 00:00:00 +0000

Trajectory-Based Dynamic Map Labeling

Tue, 01 Jan 2013 00:00:00 +0000

Upper and Lower Bounds for Weak Backdoor Set Detection

Tue, 01 Jan 2013 00:00:00 +0000

Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings

Tue, 01 Jan 2013 00:00:00 +0000

Using Optimized Virtual Network Embedding for Network Dimensioning

Tue, 01 Jan 2013 00:00:00 +0000

Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor

Tue, 01 Jan 2013 00:00:00 +0000

Extending the Gecode Framework with Interval Constraint Programming

Mon, 01 Oct 2012 00:00:00 +0000

Improving the Protein Identification Performance in High-Resolution Mass Spectrometry Data

Mon, 01 Oct 2012 00:00:00 +0000

The Vehicle Routing Problem with Compartments

Mon, 01 Oct 2012 00:00:00 +0000

Solving Multimodal Resource Constrained Project Scheduling Problems

Sat, 01 Sep 2012 00:00:00 +0000

Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents

Tue, 01 May 2012 00:00:00 +0000

Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation

Tue, 01 May 2012 00:00:00 +0000

Metaheuristics for a Multimodal Home-Health Care Scheduling Problem

Tue, 01 May 2012 00:00:00 +0000

On Solving Constrained Tree Problems and an Adaptive Layers Framework

Tue, 01 May 2012 00:00:00 +0000

A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Sun, 01 Jan 2012 00:00:00 +0000

A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Sun, 01 Jan 2012 00:00:00 +0000

A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem

Sun, 01 Jan 2012 00:00:00 +0000

Abstract Argumentation via Monadic Second Order Logic

Sun, 01 Jan 2012 00:00:00 +0000

Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes

Sun, 01 Jan 2012 00:00:00 +0000

An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem

Sun, 01 Jan 2012 00:00:00 +0000

An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem

Sun, 01 Jan 2012 00:00:00 +0000

Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles

Sun, 01 Jan 2012 00:00:00 +0000

Augmenting tractable fragments of abstract argumentation

Sun, 01 Jan 2012 00:00:00 +0000

Automatic Generation of 2-AntWars Players with Genetic Programming

Sun, 01 Jan 2012 00:00:00 +0000

Backdoors to Acyclic SAT

Sun, 01 Jan 2012 00:00:00 +0000

Backdoors to Satisfaction

Sun, 01 Jan 2012 00:00:00 +0000

Backdoors to Tractable Answer-Set Programming

Sun, 01 Jan 2012 00:00:00 +0000

Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012

Sun, 01 Jan 2012 00:00:00 +0000

Computing Resolution-Path Dependencies in Linear Time

Sun, 01 Jan 2012 00:00:00 +0000

Cover Contact Graphs

Sun, 01 Jan 2012 00:00:00 +0000

Description Logic Based Reasoning on Programming Languages

Sun, 01 Jan 2012 00:00:00 +0000

Don't Be Strict in Local Search!

Sun, 01 Jan 2012 00:00:00 +0000

Drawing (Complete) Binary Tanglegrams

Sun, 01 Jan 2012 00:00:00 +0000

Editing graphs to satisfy degree constraints: a parameterized approach

Sun, 01 Jan 2012 00:00:00 +0000

Finite RDP-algebras: duality, coproducts and logic

Sun, 01 Jan 2012 00:00:00 +0000

Hybrid Heuristics for Multimodal Homecare Scheduling

Sun, 01 Jan 2012 00:00:00 +0000

Improved Packing and Routing of Vehicles with Compartments

Sun, 01 Jan 2012 00:00:00 +0000

k-Gap Interval Graphs

Sun, 01 Jan 2012 00:00:00 +0000

Lewis Dichotomies in Many-Valued Logics

Sun, 01 Jan 2012 00:00:00 +0000

Lombardi Drawings of Graphs

Sun, 01 Jan 2012 00:00:00 +0000

Lower Bounds on the Complexity of MSO1 Model-Checking

Sun, 01 Jan 2012 00:00:00 +0000

LP can be a cure for Parameterized Problems

Sun, 01 Jan 2012 00:00:00 +0000

On Finding Optimal Polytrees

Sun, 01 Jan 2012 00:00:00 +0000

On graph contractions and induced minors

Sun, 01 Jan 2012 00:00:00 +0000

On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem

Sun, 01 Jan 2012 00:00:00 +0000

On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas

Sun, 01 Jan 2012 00:00:00 +0000

Parameterized Algorithms for Even Cycle Transversal

Sun, 01 Jan 2012 00:00:00 +0000

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

Sun, 01 Jan 2012 00:00:00 +0000

Parameterized Tractability of Multiway Cut with Parity Constraints

Sun, 01 Jan 2012 00:00:00 +0000

Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization

Sun, 01 Jan 2012 00:00:00 +0000

Strong Backdoors to Nested Satisfiability

Sun, 01 Jan 2012 00:00:00 +0000

The Complexity of Planning Revisited - A Parameterized Analysis

Sun, 01 Jan 2012 00:00:00 +0000

Valued-Based Argumentation for Tree-like Value Graphs

Sun, 01 Jan 2012 00:00:00 +0000

Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location

Sun, 01 Jan 2012 00:00:00 +0000

Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design

Sun, 01 Jan 2012 00:00:00 +0000

When Trees Grow Low: Shrubs and Fast MSO1

Sun, 01 Jan 2012 00:00:00 +0000

A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem

Thu, 01 Sep 2011 00:00:00 +0000

Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem

Thu, 01 Sep 2011 00:00:00 +0000

Heuristic Methods for the Hop Constrained Survivable Network Design Problem

Thu, 01 Sep 2011 00:00:00 +0000

Branch-and-Price for the Steiner Tree Problem with Revenues, Budget and Hop Constraints

Mon, 01 Aug 2011 00:00:00 +0000

Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten

Fri, 01 Jul 2011 00:00:00 +0000

Optimierung der periodischen Tourenplanung in der Müllentsorgung

Fri, 01 Jul 2011 00:00:00 +0000

Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus

Fri, 01 Jul 2011 00:00:00 +0000

Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem

Wed, 01 Jun 2011 00:00:00 +0000

Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem

Sun, 01 May 2011 00:00:00 +0000

A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application

Sat, 01 Jan 2011 00:00:00 +0000

A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems

Sat, 01 Jan 2011 00:00:00 +0000

A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Sat, 01 Jan 2011 00:00:00 +0000

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

Sat, 01 Jan 2011 00:00:00 +0000

A probabilistic approach to problems parameterized above or below tight bounds

Sat, 01 Jan 2011 00:00:00 +0000

A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables

Sat, 01 Jan 2011 00:00:00 +0000

Adjacency-Preserving Spatial Treemaps

Sat, 01 Jan 2011 00:00:00 +0000

Algorithms and Complexity Results for Persuasive Argumentation

Sat, 01 Jan 2011 00:00:00 +0000

An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem

Sat, 01 Jan 2011 00:00:00 +0000

Augmenting Tractable Fragments of Abstract Argumentation

Sat, 01 Jan 2011 00:00:00 +0000

Automatic Generation of 2-AntWars Players with Genetic Programming

Sat, 01 Jan 2011 00:00:00 +0000

Automatic Generation of Route Sketches

Sat, 01 Jan 2011 00:00:00 +0000

Backdoors to Acyclic SAT

Sat, 01 Jan 2011 00:00:00 +0000

Backdoors to Satisfaction

Sat, 01 Jan 2011 00:00:00 +0000

Backdoors to Tractable Answer-Set Programming

Sat, 01 Jan 2011 00:00:00 +0000

Boundary-Labeling Algorithms for Panorama Images

Sat, 01 Jan 2011 00:00:00 +0000

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Sat, 01 Jan 2011 00:00:00 +0000

Clique-width: When Hard Does Not Mean Impossible

Sat, 01 Jan 2011 00:00:00 +0000

Connecting Two Trees with Optimal Routing Cost

Sat, 01 Jan 2011 00:00:00 +0000

Consistent Labeling of Rotating Maps

Sat, 01 Jan 2011 00:00:00 +0000

Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming

Sat, 01 Jan 2011 00:00:00 +0000

Drawing Trees with Perfect Angular Resolution and Polynomial Area

Sat, 01 Jan 2011 00:00:00 +0000

Generic Expression Hardness Results for Primitive Positive Formula Comparison

Sat, 01 Jan 2011 00:00:00 +0000

Hybrid Metaheuristics in Combinatorial Optimization: A Survey

Sat, 01 Jan 2011 00:00:00 +0000

Improved Packing and Routing of Vehicles with Compartments

Sat, 01 Jan 2011 00:00:00 +0000

Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints

Sat, 01 Jan 2011 00:00:00 +0000

Kernels for Global Constraints

Sat, 01 Jan 2011 00:00:00 +0000

Limits of Preprocessing

Sat, 01 Jan 2011 00:00:00 +0000

Lombardi Drawings of Graphs

Sat, 01 Jan 2011 00:00:00 +0000

Monadic Second Order Logic on Graphs with Local Cardinality Constraints

Sat, 01 Jan 2011 00:00:00 +0000

New Results on the Complexity of the Max- and Min-Rep Problems

Sat, 01 Jan 2011 00:00:00 +0000

On d-regular Schematization of Embedded Paths

Sat, 01 Jan 2011 00:00:00 +0000

On Stabilized Branch-and-Price for Constrained Tree Problems

Sat, 01 Jan 2011 00:00:00 +0000

On the complexity of some colorful problems parameterized by treewidth

Sat, 01 Jan 2011 00:00:00 +0000

Optimal 3D Angular Resolution for Low-Degree Graphs

Sat, 01 Jan 2011 00:00:00 +0000

Parameterized Proof Complexity

Sat, 01 Jan 2011 00:00:00 +0000

Paths, Flowers and Vertex Cover

Sat, 01 Jan 2011 00:00:00 +0000

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)

Sat, 01 Jan 2011 00:00:00 +0000

Sliding Labels for Dynamic Point Labeling

Sat, 01 Jan 2011 00:00:00 +0000

Solving MAX-r-SAT above a tight lower bound

Sat, 01 Jan 2011 00:00:00 +0000

Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques

Sat, 01 Jan 2011 00:00:00 +0000

Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments

Sat, 01 Jan 2011 00:00:00 +0000

The parameterized complexity of k-flip local search for SAT and MAX SAT

Sat, 01 Jan 2011 00:00:00 +0000

The Parameterized Complexity of Local Consistency

Sat, 01 Jan 2011 00:00:00 +0000

Tractable cases of the extended global cardinality constraint

Sat, 01 Jan 2011 00:00:00 +0000

Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics

Sat, 01 Jan 2011 00:00:00 +0000

Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Sat, 01 Jan 2011 00:00:00 +0000

Variable Neighborhood Search for Capacitated Connected Facility Location

Sat, 01 Jan 2011 00:00:00 +0000

A Timeslot-Based Heuristic Approach to Construct High-School Timetables

Wed, 01 Dec 2010 00:00:00 +0000

Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem

Wed, 01 Sep 2010 00:00:00 +0000

Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods

Sun, 01 Aug 2010 00:00:00 +0000

Automatic Generation of 2-AntWars Players with Genetic Programming

Thu, 01 Jul 2010 00:00:00 +0000

Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem

Thu, 01 Jul 2010 00:00:00 +0000

On the Minimum Label Spanning Tree Problem: Solution Methods and Applications

Sat, 01 May 2010 00:00:00 +0000

Reconstructing Cross-Cut Shredded Documents by means of Evolutionary Algorithms

Sat, 01 May 2010 00:00:00 +0000

Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods

Sat, 01 May 2010 00:00:00 +0000

Compressing Fingerprint Templates by Solving the k-Node Minimum Label Spanning Arborescence Problem by Branch-and-Price

Mon, 01 Feb 2010 00:00:00 +0000

Heuristic methods for solving two Generalized Network Problems

Mon, 01 Feb 2010 00:00:00 +0000

A Brief Survey on Hybrid Metaheuristics

Fri, 01 Jan 2010 00:00:00 +0000

A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents

Fri, 01 Jan 2010 00:00:00 +0000

A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem

Fri, 01 Jan 2010 00:00:00 +0000

Algorithms and Complexity Results for Exact Bayesian Structure Learning

Fri, 01 Jan 2010 00:00:00 +0000

Algorithms and Complexity Results for Persuasive Argumentation

Fri, 01 Jan 2010 00:00:00 +0000

Algorithms for propositional model counting

Fri, 01 Jan 2010 00:00:00 +0000

An Improved Algorithm for the Metro-Line Crossing Minimization Problem

Fri, 01 Jan 2010 00:00:00 +0000

Are There Any Good Digraph Width Measures?

Fri, 01 Jan 2010 00:00:00 +0000

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width

Fri, 01 Jan 2010 00:00:00 +0000

Boundary Labeling with Octilinear Leaders

Fri, 01 Jan 2010 00:00:00 +0000

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Fri, 01 Jan 2010 00:00:00 +0000

Constraint satisfaction with bounded treewidth revisited

Fri, 01 Jan 2010 00:00:00 +0000

Dynamic One-Sided Boundary Labeling

Fri, 01 Jan 2010 00:00:00 +0000

Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive

Fri, 01 Jan 2010 00:00:00 +0000

Fitting Multi-Planet Transit Models to Photometric Time-Data Series by Evolution Strategies

Fri, 01 Jan 2010 00:00:00 +0000

Hybrid Metaheuristics, 7th Int. Workshop, HM 2010

Fri, 01 Jan 2010 00:00:00 +0000

Matheuristics for the Periodic Vehicle Routing Problem with Time Windows

Fri, 01 Jan 2010 00:00:00 +0000

Metaheuristic Hybrids

Fri, 01 Jan 2010 00:00:00 +0000

Multilevel Variable Neighborhood Search for Periodic Routing Problems

Fri, 01 Jan 2010 00:00:00 +0000

New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes

Fri, 01 Jan 2010 00:00:00 +0000

On Contracting Graphs to Fixed Pattern Graphs

Fri, 01 Jan 2010 00:00:00 +0000

On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width

Fri, 01 Jan 2010 00:00:00 +0000

On the Kernelization Complexity of Colorful Motifs

Fri, 01 Jan 2010 00:00:00 +0000

Optimizing Active Ranges for Consistent Dynamic Map Labeling

Fri, 01 Jan 2010 00:00:00 +0000

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

Fri, 01 Jan 2010 00:00:00 +0000

Path Schematization for Route Sketches

Fri, 01 Jan 2010 00:00:00 +0000

Reasoning in Argumentation Frameworks of Bounded Clique-Width

Fri, 01 Jan 2010 00:00:00 +0000

Satisfiability of Acyclic and Almost Acyclic CNF Formulas

Fri, 01 Jan 2010 00:00:00 +0000

Schauder Hats for the Two-Variable Fragment of BL

Fri, 01 Jan 2010 00:00:00 +0000

Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling

Fri, 01 Jan 2010 00:00:00 +0000

Similarity Searching in Sequences of Complex Events

Fri, 01 Jan 2010 00:00:00 +0000

Solving MAX-r-SAT Above a Tight Lower Bound

Fri, 01 Jan 2010 00:00:00 +0000

Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization

Fri, 01 Jan 2010 00:00:00 +0000

Strong Lower Bounds for a Survivable Network Design Problem

Fri, 01 Jan 2010 00:00:00 +0000

The coherence of Łukasiewicz assessments is NP-complete

Fri, 01 Jan 2010 00:00:00 +0000

The free n-generated BL-algebra

Fri, 01 Jan 2010 00:00:00 +0000

The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search

Fri, 01 Jan 2010 00:00:00 +0000

The Multidimensional Knapsack Problem: Structure and Algorithms

Fri, 01 Jan 2010 00:00:00 +0000

Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings

Fri, 01 Jan 2010 00:00:00 +0000

Thread Graphs, Linear Rank-Width and Their Algorithmic Applications

Fri, 01 Jan 2010 00:00:00 +0000

Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough

Fri, 01 Jan 2010 00:00:00 +0000

Trend-Based Similarity Search in Time-Series Data

Fri, 01 Jan 2010 00:00:00 +0000

Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Fri, 01 Jan 2010 00:00:00 +0000

Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problem

Fri, 01 Jan 2010 00:00:00 +0000

Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität

Fri, 01 Jan 2010 00:00:00 +0000

Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents

Tue, 01 Dec 2009 00:00:00 +0000

Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das Generalized Minimum Spanning Tree-Problem

Wed, 01 Jul 2009 00:00:00 +0000

Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem

Fri, 01 May 2009 00:00:00 +0000

Accelerating Column Generation for a Survivable Network Design Problem

Wed, 01 Apr 2009 00:00:00 +0000

Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungen

Wed, 01 Apr 2009 00:00:00 +0000

Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing

Wed, 01 Apr 2009 00:00:00 +0000

Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation

Wed, 01 Apr 2009 00:00:00 +0000

Event Based Similarity Search and its Applications in Business Analytics

Sun, 01 Mar 2009 00:00:00 +0000

Similarity Searching in Complex Business Events and Sequences thereof

Sun, 01 Mar 2009 00:00:00 +0000

Enhancing a Genetic Algorithm by a Complete Solution Archive Based on a Trie Data Structure

Sun, 01 Feb 2009 00:00:00 +0000

Network Visualization: Algorithms, Applications, and Complexity

Sun, 01 Feb 2009 00:00:00 +0000

(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Thu, 01 Jan 2009 00:00:00 +0000

A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows

Thu, 01 Jan 2009 00:00:00 +0000

A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse

Thu, 01 Jan 2009 00:00:00 +0000

A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Thu, 01 Jan 2009 00:00:00 +0000

A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Thu, 01 Jan 2009 00:00:00 +0000

A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location

Thu, 01 Jan 2009 00:00:00 +0000

A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem

Thu, 01 Jan 2009 00:00:00 +0000

A Probabilistic Approach to Problems Parameterized above or below Tight Bounds

Thu, 01 Jan 2009 00:00:00 +0000

Algorithms for Multi-Criteria Boundary Labeling

Thu, 01 Jan 2009 00:00:00 +0000

Applications of Finite Duality to Locally Finite Varieties of BL-Algebras

Thu, 01 Jan 2009 00:00:00 +0000

Backdoor sets of quantified Boolean formulas

Thu, 01 Jan 2009 00:00:00 +0000

Better Polynomial Algorithms on Graphs of Bounded Rank-Width

Thu, 01 Jan 2009 00:00:00 +0000

Boosting a Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows by ILP Techniques

Thu, 01 Jan 2009 00:00:00 +0000

Clique-width is NP-complete

Thu, 01 Jan 2009 00:00:00 +0000

Cluster-Based (Meta-)Heuristics for the Euclidean Bounded Diameter Minimum Spanning Tree Problem

Thu, 01 Jan 2009 00:00:00 +0000

Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location

Thu, 01 Jan 2009 00:00:00 +0000

Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location

Thu, 01 Jan 2009 00:00:00 +0000

Computing Optimized Stock (Re-)Placements in Last-In, First-Out Warehouses

Thu, 01 Jan 2009 00:00:00 +0000

Consistent Digital Rays

Thu, 01 Jan 2009 00:00:00 +0000

Cooperative Hybrids for Combinatorial Optimization

Thu, 01 Jan 2009 00:00:00 +0000

Covering graphs with few complete bipartite subgraphs

Thu, 01 Jan 2009 00:00:00 +0000

Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability

Thu, 01 Jan 2009 00:00:00 +0000

Drawing Binary Tanglegrams: An Experimental Evaluation

Thu, 01 Jan 2009 00:00:00 +0000

Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances

Thu, 01 Jan 2009 00:00:00 +0000

Fitting Multi-Planet Transit Models to CoRoT Time-Data Series by Evolutionary Algorithms

Thu, 01 Jan 2009 00:00:00 +0000

Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms

Thu, 01 Jan 2009 00:00:00 +0000

Fitting Rectangular Signals to Time Series Data by Metaheuristic Algorithms

Thu, 01 Jan 2009 00:00:00 +0000

GECCO~2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation

Thu, 01 Jan 2009 00:00:00 +0000

Hybrid Metaheuristics

Thu, 01 Jan 2009 00:00:00 +0000

Matched Formulas and Backdoor Sets

Thu, 01 Jan 2009 00:00:00 +0000

Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents

Thu, 01 Jan 2009 00:00:00 +0000

MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics

Thu, 01 Jan 2009 00:00:00 +0000

Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows

Thu, 01 Jan 2009 00:00:00 +0000

On Digraph Width Measures in Parameterized Algorithmics

Thu, 01 Jan 2009 00:00:00 +0000

Soft Constraints Processing over Divisible Residuated Lattices

Thu, 01 Jan 2009 00:00:00 +0000

Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search

Thu, 01 Jan 2009 00:00:00 +0000

Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates

Thu, 01 Jan 2009 00:00:00 +0000

Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics

Thu, 01 Jan 2009 00:00:00 +0000

The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete

Thu, 01 Jan 2009 00:00:00 +0000

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT

Thu, 01 Jan 2009 00:00:00 +0000

The Parameterized Complexity of Oriented Colouring

Thu, 01 Jan 2009 00:00:00 +0000

Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung

Mon, 01 Dec 2008 00:00:00 +0000

Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpräferenzen

Mon, 01 Dec 2008 00:00:00 +0000

Hybrid Metaheuristics for Generalized Network Design Problems

Mon, 01 Dec 2008 00:00:00 +0000

Parallel Variable Neighborhood Search for the Car Sequencing Problem

Wed, 01 Oct 2008 00:00:00 +0000

Webbasierte Darstellung großer Datenmengen als Pivot-Tabelle mithilfe ressourcenoptimierter Aggregationsverfahren

Wed, 01 Oct 2008 00:00:00 +0000

Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen

Mon, 01 Sep 2008 00:00:00 +0000

Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates

Mon, 01 Sep 2008 00:00:00 +0000

A Complete Archive Genetic Algorithm for the Multidimensional Knapsack Problem

Thu, 01 May 2008 00:00:00 +0000

An Incremental Dynamic Programming Approach for Multidimensional Allocation Problems

Thu, 01 May 2008 00:00:00 +0000

Combinatorial Optimization for the Compression of Biometric Templates

Thu, 01 May 2008 00:00:00 +0000

Evaluation and Reconstruction of Strip-Shredded Text Documents

Thu, 01 May 2008 00:00:00 +0000

Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems

Thu, 01 May 2008 00:00:00 +0000

(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem

Tue, 01 Jan 2008 00:00:00 +0000

(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Tue, 01 Jan 2008 00:00:00 +0000

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem

Tue, 01 Jan 2008 00:00:00 +0000

A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Tue, 01 Jan 2008 00:00:00 +0000

A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows

Tue, 01 Jan 2008 00:00:00 +0000

Algorithms for Multi-Criteria One-Sided Boundary Labeling

Tue, 01 Jan 2008 00:00:00 +0000

An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem

Tue, 01 Jan 2008 00:00:00 +0000

Automata approach to graphs of bounded rank-width

Tue, 01 Jan 2008 00:00:00 +0000

Backdoor Trees

Tue, 01 Jan 2008 00:00:00 +0000

Boundary Labeling with Octilinear Leaders

Tue, 01 Jan 2008 00:00:00 +0000

Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search

Tue, 01 Jan 2008 00:00:00 +0000

Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization

Tue, 01 Jan 2008 00:00:00 +0000

Combining Forces to Reconstruct Strip Shredded Text Documents

Tue, 01 Jan 2008 00:00:00 +0000

Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem

Tue, 01 Jan 2008 00:00:00 +0000

Consistent Digital Rays

Tue, 01 Jan 2008 00:00:00 +0000

Cover Contact Graphs

Tue, 01 Jan 2008 00:00:00 +0000

Effective Neighborhood Structures for the Generalized Traveling Salesman Problem

Tue, 01 Jan 2008 00:00:00 +0000

Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees

Tue, 01 Jan 2008 00:00:00 +0000

Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms

Tue, 01 Jan 2008 00:00:00 +0000

Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems

Tue, 01 Jan 2008 00:00:00 +0000

Fixed-parameter complexity of minimum profile problems

Tue, 01 Jan 2008 00:00:00 +0000

Heuristic Cut Separation in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Tue, 01 Jan 2008 00:00:00 +0000

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

Tue, 01 Jan 2008 00:00:00 +0000

Monadic Second Order Logic on Graphs with Local Cardinality Constraints

Tue, 01 Jan 2008 00:00:00 +0000

Morphing Polylines: A Step Towards Continuous Generalization

Tue, 01 Jan 2008 00:00:00 +0000

Not So Easy Problems For Tree Decomposable Graphs (invited talk)

Tue, 01 Jan 2008 00:00:00 +0000

Optimizing Active Ranges for Consistent Dynamic Map Labeling

Tue, 01 Jan 2008 00:00:00 +0000

Parameterized Graph Editing with Chosen Vertex Degrees

Tue, 01 Jan 2008 00:00:00 +0000

Parameterized SAT

Tue, 01 Jan 2008 00:00:00 +0000

Proof search in Hájek's basic logic

Tue, 01 Jan 2008 00:00:00 +0000

Reconstructing Borders of Manually Torn Paper Scheets Using Integer Linear Programming

Tue, 01 Jan 2008 00:00:00 +0000

Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization

Tue, 01 Jan 2008 00:00:00 +0000

Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem

Tue, 01 Jan 2008 00:00:00 +0000

The Parameterized Complexity of Regular Subgraph Problems and Generalizations

Tue, 01 Jan 2008 00:00:00 +0000

Tractable Cases of the Extended Global Cardinality Constraint

Tue, 01 Jan 2008 00:00:00 +0000

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

Tue, 01 Jan 2008 00:00:00 +0000

Map-Matching und Wegsuche in einem geografischen Informationssystem

Sat, 01 Dec 2007 00:00:00 +0000

Algorithmic Approaches to the String Barcoding Problem

Mon, 01 Oct 2007 00:00:00 +0000

Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem

Mon, 01 Oct 2007 00:00:00 +0000

Improved Protein Identification After Fast Elimination of Non-Interpretable Peptide MS/MS Spectra and Noise Reduction

Tue, 01 May 2007 00:00:00 +0000

Improved Algorithms for Length-Minimal One-Sided Boundary Labeling

Thu, 01 Mar 2007 00:00:00 +0000

Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks

Thu, 01 Mar 2007 00:00:00 +0000

A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks

Mon, 01 Jan 2007 00:00:00 +0000

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem

Mon, 01 Jan 2007 00:00:00 +0000

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks

Mon, 01 Jan 2007 00:00:00 +0000

Algorithms for Propositional Model Counting

Mon, 01 Jan 2007 00:00:00 +0000

Backdoor Sets of Quantified Boolean Formulas

Mon, 01 Jan 2007 00:00:00 +0000

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem

Mon, 01 Jan 2007 00:00:00 +0000

Compressing Fingerprint Templates by Solving an Extended Minimum Label Spanning Tree Problem

Mon, 01 Jan 2007 00:00:00 +0000

Covering Graphs with Few Complete Bipartite Subgraphs

Mon, 01 Jan 2007 00:00:00 +0000

CyMATE: A New Tool for Methylation Analysis of Plant Genomic DNA after Bisulfite Sequencing

Mon, 01 Jan 2007 00:00:00 +0000

Determining Orbital Elements of Extrasolar Planets by Evolution Strategies

Mon, 01 Jan 2007 00:00:00 +0000

Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem

Mon, 01 Jan 2007 00:00:00 +0000

Geographic Visualization

Mon, 01 Jan 2007 00:00:00 +0000

Matched Formulas and Backdoor Sets

Mon, 01 Jan 2007 00:00:00 +0000

Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps

Mon, 01 Jan 2007 00:00:00 +0000

Models and Algorithms for Three-Stage Two-Dimensional Bin Packing

Mon, 01 Jan 2007 00:00:00 +0000

Morphing Polygonal Lines: A Step Towards Continuous Generalization

Mon, 01 Jan 2007 00:00:00 +0000

On the Complexity of Some Colorful Problems Parameterized by Treewidth

Mon, 01 Jan 2007 00:00:00 +0000

Parameterized Proof Complexity

Mon, 01 Jan 2007 00:00:00 +0000

Solving \#SAT using Vertex Covers

Mon, 01 Jan 2007 00:00:00 +0000

The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search

Mon, 01 Jan 2007 00:00:00 +0000

The Linear Arrangement Problem Parameterized Above Guaranteed Value

Mon, 01 Jan 2007 00:00:00 +0000

The Multidimensional Knapsack Problem: Structure and Algorithms

Mon, 01 Jan 2007 00:00:00 +0000

Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem

Mon, 01 Jan 2007 00:00:00 +0000

Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk)

Mon, 01 Jan 2007 00:00:00 +0000

Cluster Planarity Testing for the Case of Not Necessarily Connected Clusters

Fri, 01 Dec 2006 00:00:00 +0000

A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem

Sun, 01 Oct 2006 00:00:00 +0000

Solving Two Generalized Network Design Problems with Exact and Heuristic Methods

Mon, 01 May 2006 00:00:00 +0000

A Mixed-Integer Program for Drawing High-Quality Metro Maps

Sun, 01 Jan 2006 00:00:00 +0000

A note on unsatisfiable k-CNF formulas with few occurrences per variable

Sun, 01 Jan 2006 00:00:00 +0000

A Unified View on Hybrid Metaheuristics

Sun, 01 Jan 2006 00:00:00 +0000

An Ant Colony Optimisation Algorithm for the Bounded Diameter Minimum Spanning Tree Problem

Sun, 01 Jan 2006 00:00:00 +0000

Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen

Sun, 01 Jan 2006 00:00:00 +0000

Biased Mutation Operators for Subgraph-Selection Problems

Sun, 01 Jan 2006 00:00:00 +0000

Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search

Sun, 01 Jan 2006 00:00:00 +0000

Cleaning of Raw Peptide MS/MS Spectra: Improved Protein Identification Following Deconvolution of Multiply Charged Peaks, Isotope Clusters, and Removal of Background Noise

Sun, 01 Jan 2006 00:00:00 +0000

Clique-width Minimization is NP-hard

Sun, 01 Jan 2006 00:00:00 +0000

Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems

Sun, 01 Jan 2006 00:00:00 +0000

Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem

Sun, 01 Jan 2006 00:00:00 +0000

Constraint satisfaction with bounded treewidth revisited

Sun, 01 Jan 2006 00:00:00 +0000

Evolutionary Approach to Constrained Minimum Spanning Tree Problem

Sun, 01 Jan 2006 00:00:00 +0000

Evolutionary Computation in Combinatorial Optimization – EvoCOP~2006

Sun, 01 Jan 2006 00:00:00 +0000

Fixed-Parameter Complexity of Minimum Profile Problems

Sun, 01 Jan 2006 00:00:00 +0000

Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO

Sun, 01 Jan 2006 00:00:00 +0000

On Finding Short Resolution Refutations and Small Unsatisfiable Subsets

Sun, 01 Jan 2006 00:00:00 +0000

Solving \#SAT using Vertex Covers

Sun, 01 Jan 2006 00:00:00 +0000

The Core Concept for the Multidimensional Knapsack Problem

Sun, 01 Jan 2006 00:00:00 +0000

The Linear Arrangement Problem Parameterized Above Guaranteed Value

Sun, 01 Jan 2006 00:00:00 +0000

Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering

Sun, 01 Jan 2006 00:00:00 +0000

Automated Drawing of Metro Maps

Mon, 01 Aug 2005 00:00:00 +0000

Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristiken

Mon, 01 Aug 2005 00:00:00 +0000

Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem

Mon, 01 Aug 2005 00:00:00 +0000

Exact and Heuristic Methods for Solving the Car Sequencing Problem

Mon, 01 Aug 2005 00:00:00 +0000

Multiple Structural RNA Alignment with Affine Gap Costs Based on Lagrangian Relaxation

Mon, 01 Aug 2005 00:00:00 +0000

An Application of Dijkstra's Algorithm for a (On-Board) Route (Re-)Planning Module

Fri, 01 Jul 2005 00:00:00 +0000

An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problem

Tue, 01 Mar 2005 00:00:00 +0000

Option Pricing by Means of Genetic Programming

Tue, 01 Feb 2005 00:00:00 +0000

A New 0–1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem

Sat, 01 Jan 2005 00:00:00 +0000

A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem

Sat, 01 Jan 2005 00:00:00 +0000

An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem

Sat, 01 Jan 2005 00:00:00 +0000

Automated Drawing of Metro Maps

Sat, 01 Jan 2005 00:00:00 +0000

Backdoor Sets for DLL Subsolvers

Sat, 01 Jan 2005 00:00:00 +0000

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification

Sat, 01 Jan 2005 00:00:00 +0000

Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search

Sat, 01 Jan 2005 00:00:00 +0000

Computing unsatisfiable k-SAT instances with few occurrences per variable

Sat, 01 Jan 2005 00:00:00 +0000

Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem

Sat, 01 Jan 2005 00:00:00 +0000

Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Sat, 01 Jan 2005 00:00:00 +0000

Evolutionary Computation in Combinatorial Optimization – EvoCOP~2005

Sat, 01 Jan 2005 00:00:00 +0000

Generalizations of matched CNF formulas

Sat, 01 Jan 2005 00:00:00 +0000

On Edge-Colored Graphs Covered by Properly Colored Cycles

Sat, 01 Jan 2005 00:00:00 +0000

Proceedings of the 2005 IEEE Congress on Evolutionary Computation

Sat, 01 Jan 2005 00:00:00 +0000

Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2005

Sat, 01 Jan 2005 00:00:00 +0000

Relaxation Guided Variable Neighborhood Search

Sat, 01 Jan 2005 00:00:00 +0000

The Complexity of Resolution with Generalized Symmetry Rules

Sat, 01 Jan 2005 00:00:00 +0000

Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem

Sat, 01 Jan 2005 00:00:00 +0000

Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem

Mon, 01 Nov 2004 00:00:00 +0000

An Alignment Graph based Evolutionary Algorithm for the Multiple Sequence Alignment Problem

Sun, 01 Feb 2004 00:00:00 +0000

An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective Approach for 2D Bin Packing

Thu, 01 Jan 2004 00:00:00 +0000

An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem

Thu, 01 Jan 2004 00:00:00 +0000

An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem

Thu, 01 Jan 2004 00:00:00 +0000

Applications of Evolutionary Computing: EvoWorkshops 2004

Thu, 01 Jan 2004 00:00:00 +0000

Biased Mutation Operators for Subgraph-Selection Problems

Thu, 01 Jan 2004 00:00:00 +0000

Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem

Thu, 01 Jan 2004 00:00:00 +0000

Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable

Thu, 01 Jan 2004 00:00:00 +0000

Detecting Backdoor Sets with Respect to Horn and Binary Clauses

Thu, 01 Jan 2004 00:00:00 +0000

Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Thu, 01 Jan 2004 00:00:00 +0000

Evolutionary Computation in Combinatorial Optimization – EvoCOP~2004

Thu, 01 Jan 2004 00:00:00 +0000

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Thu, 01 Jan 2004 00:00:00 +0000

Models and Algorithms for Three-Stage Two-Dimensional Bin Packing

Thu, 01 Jan 2004 00:00:00 +0000

On Finding Short Resolution Refutations and Small Unsatisfiable Subsets

Thu, 01 Jan 2004 00:00:00 +0000

On fixed-parameter tractable parameterizations of SAT

Thu, 01 Jan 2004 00:00:00 +0000

On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors

Thu, 01 Jan 2004 00:00:00 +0000

Solving a Real-World Glass Cutting Problem

Thu, 01 Jan 2004 00:00:00 +0000

Special Issue on Evolutionary Computation in Combinatorial Optimization

Thu, 01 Jan 2004 00:00:00 +0000

The Parameterized Complexity of SAT Backdoors

Thu, 01 Jan 2004 00:00:00 +0000

Validation in the Cluster Analysis of Gene Expression Data

Thu, 01 Jan 2004 00:00:00 +0000

Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems

Mon, 01 Sep 2003 00:00:00 +0000

Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem

Thu, 01 May 2003 00:00:00 +0000

Verfahren zur Lösung eines Glasverschnittproblems

Thu, 01 May 2003 00:00:00 +0000

Ein Genetischer Algorithmus für das Generalized Assignment Problem

Tue, 01 Apr 2003 00:00:00 +0000

Hybrid Evolutionary Algorithms for Combinatorial Optimization

Sat, 01 Mar 2003 00:00:00 +0000

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

Wed, 01 Jan 2003 00:00:00 +0000

A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem

Wed, 01 Jan 2003 00:00:00 +0000

Applications of Evolutionary Computing: EvoWorkshops 2003

Wed, 01 Jan 2003 00:00:00 +0000

Edge-Sets: An Effective Evolutionary Coding of Spanning Trees

Wed, 01 Jan 2003 00:00:00 +0000

Finding paths in graphs avoiding forbidden transitions

Wed, 01 Jan 2003 00:00:00 +0000

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem

Wed, 01 Jan 2003 00:00:00 +0000

Homomorphisms of Conjunctive Normal Forms

Wed, 01 Jan 2003 00:00:00 +0000

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Wed, 01 Jan 2003 00:00:00 +0000

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Wed, 01 Jan 2003 00:00:00 +0000

The complexity of resolution with generalized symmetry rules

Wed, 01 Jan 2003 00:00:00 +0000

A Memetic Algorithm for Vertex-Biconnectivity Augmentation

Tue, 01 Jan 2002 00:00:00 +0000

Applications of Evolutionary Computing: EvoWorkshops 2002

Tue, 01 Jan 2002 00:00:00 +0000

Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem

Tue, 01 Jan 2002 00:00:00 +0000

Generalizations of matched CNF formulas

Tue, 01 Jan 2002 00:00:00 +0000

Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges

Tue, 01 Jan 2002 00:00:00 +0000

Letting Ants Labeling Point Features

Tue, 01 Jan 2002 00:00:00 +0000

On Weight-Biased Mutation for Graph Problems

Tue, 01 Jan 2002 00:00:00 +0000

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

Tue, 01 Jan 2002 00:00:00 +0000

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

Mon, 01 Jan 2001 00:00:00 +0000

Applications of Evolutionary Computing: EvoWorkshops 2001

Mon, 01 Jan 2001 00:00:00 +0000

Conjunctive Normal Forms with Bounded Deficiency

Mon, 01 Jan 2001 00:00:00 +0000

NP-Completeness of Refutability by Literal-Once Resolution

Mon, 01 Jan 2001 00:00:00 +0000

Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search

Mon, 01 Jan 2001 00:00:00 +0000

Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems

Mon, 01 Jan 2001 00:00:00 +0000

A Hybrid GA for the Edge-Biconnectivity Augmentation Problem

Sat, 01 Jan 2000 00:00:00 +0000

A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem

Sat, 01 Jan 2000 00:00:00 +0000

A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

Sat, 01 Jan 2000 00:00:00 +0000

An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

Sat, 01 Jan 2000 00:00:00 +0000

The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search

Sat, 01 Jan 2000 00:00:00 +0000

A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem

Fri, 01 Jan 1999 00:00:00 +0000

An Evolutionary Approach to Point-Feature Label Placement

Fri, 01 Jan 1999 00:00:00 +0000

Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem

Fri, 01 Jan 1999 00:00:00 +0000

On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms

Fri, 01 Jan 1999 00:00:00 +0000

The Multiple Container Packing Problem: A Genetic Algorithm Approach with Weighted Codings

Fri, 01 Jan 1999 00:00:00 +0000

Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem

Fri, 01 Jan 1999 00:00:00 +0000

A Genetic Algorithm for Labeling Point Features

Thu, 01 Jan 1998 00:00:00 +0000

A Hybrid GP Approach for Numerically Robust Symbolic Regression

Thu, 01 Jan 1998 00:00:00 +0000

An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem

Thu, 01 Jan 1998 00:00:00 +0000

Approximation with Evolutionary Optimized Tensor Product Bernstein Polynomials

Thu, 01 Jan 1998 00:00:00 +0000

Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks

Thu, 01 Jan 1998 00:00:00 +0000

Genetic Algorithms for the Multiple Container Packing Problem

Thu, 01 Jan 1998 00:00:00 +0000

Proceedings of the International Conference on Imaging Science, Systems, and Technology

Thu, 01 Jan 1998 00:00:00 +0000

Transforming an Analytically Defined Color Space to Match Psychophysically Gained Color Distances

Thu, 01 Jan 1998 00:00:00 +0000

Progressives, adaptives Ray-Tracing von Bildern mit hoher zeitlicher Kohärenz

Sat, 01 Jan 1994 00:00:00 +0000

Algorithmic Extensions of Dirac's Theorem

Thu, 01 Jan 1970 00:00:00 +0000

Lossy Kernels for Hitting Subgraphs

Thu, 01 Jan 1970 00:00:00 +0000

On the Parameterized Complexity of Simultaneous Deletion Problems

Thu, 01 Jan 1970 00:00:00 +0000

Parallel Beam Search for Combinatorial Optimization

Thu, 01 Jan 1970 00:00:00 +0000

Mon, 01 Jan 0001 00:00:00 +0000

🚀 Mini-Guide: Adding New Team Members (Authors)

Whenever a new colleague joins the group, a local profile directory must be created so that TISS data and publications can be automatically linked and synced.

1. Directory Structure

Create a new subdirectory inside content/authors/, named after the official TU Login (e.g., content/authors/mmustermann/).

2. Basic `_index.md` Template

Inside that directory, create an _index.md file with the following minimal frontmatter:

---
title: Max Mustermann
tiss_id: "13660717"
user_groups:
- PhD Students
---

⚠️ Critical Details

title: First and last name without academic titles (e.g., omit Dr. or Dipl.-Ing.)
tiss_id: Extremely Important: Enter the TISS OID (e.g., 13660717) here *(The shorter TISS-ID will NOT work because the API relies strictly on the OID)
user_groups: Must contain at least one initial target group (PhD Students, Postdocs, or Scientific Staff) *(The sync_tiss.py script will only manage group assignments if one of these default groups is already present)

3. Data Synchronization & Sorting

After creating the file, simply run the automated update pipeline:

just update-data

What happens automatically:

sync_tiss.py queries the TISS API, fills in room numbers, phone numbers, ORCID, titles, email addresses, and adjusts the group assignment (PhD Student/Postdoc)[cite: 4].
sort_team.py reads all profile directories and re-sorts all team members alphabetically by last name[cite: 3].

Mon, 01 Jan 0001 00:00:00 +0000

📝 Guide: How to Update Your Profile Page

Each staff member can customize their own profile page.

Your file is located at:

content/authors/YOUR_USERNAME/_index.md

⚠️ Important: Some fields are synchronized automatically with TISS.
Manual changes to these fields will be overwritten.

🔄 Automatically Managed Fields (TISS Sync)

The following information is synchronized regularly from TISS and must not be edited manually:

Name
Academic titles
Email
Phone number
Room number
Office hours
TISS profile link
ORCID (if present in TISS)

If any of this information is incorrect, please update it in your TISS profile.

✏️ Fields You Can Edit

Everything else in your _index.md file can be customized.

Position / Role

Your role appears below your name.

role: "PhD Student & Project Assistant"

If left empty, nothing will be displayed.

Short Bio

A short summary (1-2 sentences) used in list views.

bio: Jane Doe is a PhD student researching graph algorithms.

Research Interests

Displayed as bullet points on your profile page.

interests:
- Parameterized Complexity
- Graph Drawing
- Combinatorial Optimization

Group Membership

Defines how you appear in staff listings.

Typical options:

Professors
Postdocs
PhD Students
Administration

Example:

user_groups:
- PhD Students

Icons linking to external profiles can be added in the social: section.

social:
- icon: google-scholar
icon_pack: ai
link: 'https://scholar.google.com/citations?user=...'
- icon: github
icon_pack: fab
link: 'https://github.com/janedoe'
- icon: orcid
icon_pack: ai
link: 'https://orcid.org/0000-...'
- icon: dblp
icon_pack: ai
link: 'https://dblp.org/pid/312/1234.html'
label: 'DBLP'
- icon: globe
icon_pack: fas
link: 'https://www.janedoe.com'

⚠️ Some icons (Email, Phone, TISS profile) are added automatically by the system.

🖼️ Profile Picture

To update your profile picture:

Place a square image in your profile folder
Name the file exactly:

avatar.jpg

The system will automatically crop it.

✍️ Biography Text

The full biography is written below the second --- line in the file.

Markdown formatting is supported.

Example:

## Biography
Jane Doe joined the Algorithms and Complexity Group in 2024.
Her research focuses on parameterized algorithms and graph drawing.

🔗 Internal Links and Mentions

When linking to content within the website, use Hugo shortcodes instead of hardcoded URLs.
This ensures links remain valid even if the URL structure changes.

For internal pages such as research areas or projects, use ref:

Check out our [Algorithms Research Area](https://ac.tuwien.ac.at/research/).

You can also use ref to link to a person’s profile page:

[Prof. Robert Ganian](https://ac.tuwien.ac.at/team/robert-ganian/)

Alternatively, for people within the institute, you can use the mention shortcode:

Robert Ganian

In short: use ref for internal pages in general, and use either ref or mention when referring to colleagues.

📚 Publications & Projects

You do not need to add publications or projects manually.

They are generated automatically from the central repository.

Publications

Publications are parsed from the central BibTeX database.

If your name appears in the BibTeX entry:

author = {Jane Doe and ...}

the system automatically links the publication to your profile.

Projects

Projects are associated through metadata fields in the central publication/project database.

No manual action is required in your profile file.

📚 Icon Reference

When adding icons, use the following icon sets.

Academic Icons

For research platforms like Google Scholar or ORCID:

https://jpswalsh.github.io/academicons/

Use:

icon_pack: ai

For GitHub, LinkedIn, Twitter, etc.

https://fontawesome.com/search?o=r&m=free&f=brands

Use:

icon_pack: fab

General Icons

For websites or generic icons.

https://fontawesome.com/search?o=r&m=free&s=solid

Use:

icon_pack: fas

🧩 Example Template

---
title: Jane Doe
tiss_id: '123456'
room: HC0401
phone: +43 1 58801 12345
email: jane.doe@tuwien.ac.at
role: "PhD Student & Project Assistant"
bio: Jane Doe is a PhD student researching graph algorithms.
interests:
- Parameterized Complexity
- Graph Drawing
user_groups:
- PhD Students
social:
- icon: google-scholar
icon_pack: ai
link: 'https://scholar.google.com/citations?user=...'
- icon: github
icon_pack: fab
link: 'https://github.com/janedoe'
---
## Biography
Jane Doe joined the Algorithms and Complexity Group in 2024.

If something breaks, you can revert the changes in Git.

Forschungsgruppe Algorithms and Complexity (AC)

Mon, 01 Jan 0001 00:00:00 +0000

(For information in English please visit the homepage)

Auf dieser Seite werden Informationen auf Deutsch bereitgestellt.

Die Forschungsgruppe Algorithms and Complexity (kurz AC) ist Teil des Instituts für Logic and Computation der Fakultät für Informatik an der Technischen Universität Wien (TU Wien) und wird von Univ.-Prof. Dr. Stefan Szeider geleitet.

Eine Liste der Mitarbeiterinnen und Mitarbeiter der Gruppe kann unter folgendem Link gefunden werden: Team

Forschung

In der Forschung befasst sich die AC-Forschungsgruppe besonders mit der Entwicklung und Analyse von effizienten Algorithmen für schwere Berechnungsprobleme, die in den verschiedensten Anwendungsbereichen der Informatik (von künstlicher Intelligenz über Optimierung bis hin zu Netzwerken) auftreten. Algorithmische Probleme werden auch auf ihre grundsätzliche Komplexität hin theoretisch untersucht.

Weitere Informationen zu aktuellen Forschungsprojekten und Publikationen finden Sie hier:

Lehre

Die AC-Forschungsgruppe engagiert sich intensiv in der universitären Lehre, sowohl im Bachelor- als auch im Masterstudium. Unter anderem ist die Gruppe für die Grundlehrveranstaltung Algorithmen und Datenstrukturen verantwortlich, die für alle Bachelorstudierenden des ersten Studienjahres verpflichtend ist und jährlich von über 500 Studierenden besucht wird. Es werden darüber hinaus Lehrveranstaltungen zu speziellen fortgeschrittenen Themen sowie Projekt- und Seminararbeiten angeboten.

Das aktuelle Lehrangebot der AC-Forschungsgruppe finden Sie unter: Lehrveranstaltungen (Courses)

Die Gruppe betreut zudem zahlreiche Nachwuchswissenschaftlerinnen und Nachwuchswissenschaftler im Rahmen von Bachelor-, Master- und Doktoratsarbeiten (Theses).

Kontaktinfo

Die AC-Forschungsgruppe ist in einem Institutsgebäude der TU Wien an der Ecke Favoritenstraße / Taubstummengasse im 4. Wiener Gemeindebezirk untergebracht.

Adresse, Anfahrtsplan und Kontaktinformationen finden Sie unter: Kontakt (Contact)

Schlagwörter

Algorithmen, Komplexität, Graphen, Netzwerke, Optimierung, Heuristiken, geometrische Algorithmen, Datenstrukturen, Logikprobleme, Erfüllbarkeit, parametrisierte Algorithmen, Metaheuristik, SAT-Problem, quantifizierte Boolesche Formeln, künstliche Intelligenz, obere Schranken, untere Schranken, Transportlogistik, maschinelles Lernen, Graphzeichnen, Visualisierung, Handhabbarkeit, Algorithmen zur kollektiven Entscheidungsfindung, Algorithmen für erklärbare Entscheidungsfindung, probabilistische graphische Modelle.

Research

Mon, 01 Jan 0001 00:00:00 +0000