Search

The Graph Burning Problem under Constrained Diffusion

Discrete and Computational Geometry, 2026.
Note: to appear

Enrico Iurlano, Günther Raidl, Djukanović, Marko

Advances in Optimization and Wildfire (Alvelos, Filipe and Martins, Isabel and Rocha, Ana Maria A. C.), pages 139-154, 2026, Springer.

The Complexity of Extending Fair Allocations of Indivisible Goods

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

Journal of Artificial Intelligence Research, 2026.
Note: to appear

Weissenfels, Alexander, Enrico Iurlano, Günther Raidl

pages 1-15, 2026.
Note: preprint

Routing Few Robots in a Crowded Network

Realizing Planar Linkages in Polygonal Domains

Journal of Computer and System Sciences, 2026.
Note: to appear

Thomas Depian, Haase, Carolina, Martin Nöllenburg, Schulz, André

International Workshop on Combinatorial Algorithms (IWOCA'26), 2026.
Note: To appear.

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

Fleischner, Herbert, Enrico Iurlano, Günther Raidl

Proceedings of the 12th International Network Optimization Conference, INOC 2026, Liège, Belgium (Fortz, Bernard), pages 17-20, 2026, OpenProceedings.org.

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy

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

ACM Transactions on Algorithms, 2026.
Note: to appear

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

Artificial Intelligence, volume 351, pages 104458, 2026.

Dobler, Alexander, Le Thanh, Son, Martin Nöllenburg, Weinkauf, Tino

Pacific Visualization Symposium (PacificVis'26), 2026.
Note: To appear.

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity

Makespan Minimization in Split Learning: From Theory to Practice

AAAI-26, Sponsored by the Association for the Advancement of Artificial Intelligence, 2026, AAAI Press.
Note: to appear

Graph Choosability via SAT: Beyond the Nullstellensatz

IEEE INFOCOM 2026 - IEEE Conference on Computer Communications, 2026.
Note: to appear

Markus Kirchweger, Tomas Peitl, David Seka, Stefan Szeider

The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026, 2026.
Note: To appear

Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy

Robert Ganian, Marlene Gründel

Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR.
Note: to appear

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time

Bhore, Sujoy, Martin Nöllenburg, Tóth, Csaba D., Wulms, Jules

Discrete and Computational Geometry, volume 75, pages 391-430, 2026.

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

Fair Correlation Clustering Meets Graph Parameters

Algorithmica, volume 88, number 1, pages 8, 2026.

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

Efficient reversal of transductions of sparse graph classes

Jan Niclas Dreier, Jakub Gajarský, Michał Pilipczuk

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, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Coordinated Motion Planning is FPT on Discretized Simple Polygons

Narek Bojikian, Alexander Firbas, Robert Ganian, Phuc Hung Hoang, Krisztina Szilagyi

53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Computing Twin-Width via Treedepth and Vertex Integrity

Robert Ganian, Mathis Teva Rocton

43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms

Ordyniak, Sebastian, Rychlicki, Mateusz, Stefan Szeider

The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026, 2026.
Note: To appear

Complexity of Positive Influence Domination on Partial Grids

Enrico Iurlano, Günther Raidl

Fundamentals of Computation Theory—25th International Symposium (Jeż, Artur and Otop, Jan), volume 16106 of LNCS, pages 267-280, 2026, Springer.

Clarity and Computational Efficiency of Orbital Boundary Labeling

Wallinger, Markus, Bonerath, Annika, Terziadis, Soeren, Wulms, Jules, Martin Nöllenburg

Pacific Visualization Symposium (PacificVis'26), 2026.
Note: To appear.

Block Crossings in One-Sided Tanglegrams

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet

Algorithmica, volume 88, pages 20:1-20:30, 2026.

Robert Ganian, Marlene Gründel

29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Backdoors to Satisfaction Continued

ARCOL: Aspect Ratio Constrained Orthogonal Layout

Computer Science Review, volume 60, pages 100868, 2026.

Zainab Alsuwaykit, Yousef Loay Rajeh, Alexandre Kouyoumdjian, Kieffer, Steve, Engel, Dominik, Sara Di Bartolomeo, Martin Nöllenburg, Viola, Ivan

Comput. Graph. Forum, 2026.
Note: Accepted at EuroVIS 2026. To appear.

A Structural Complexity Analysis of Synchronous Dynamical Systems

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award)

Artificial Intelligence, 2026.
Note: to appear

Ajaykrishnan E S, Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan

2026 Symposium on Simplicity in Algorithms, SOSA 2026, 2026, SIAM.
Note: to appear

A Parameterized-Complexity Framework for Finding Local Optima

A General Theoretical Framework for Learning Smallest Interpretable Models

17th Innovations in Theoretical Computer Science Conference, ITCS 2026, 2026.
Note: to appear

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

Artificial Intelligence, volume 350, pages 104441, 2026.

Wustinger, Martin, Enrico Iurlano, Günther Raidl

Evolutionary Computation in Combinatorial Optimization (Krejca, Martin S. and Pillay, Nelishia), volume 16522 of LNCS, pages 133-149, 2026, Springer.

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

Odelga, Felix, Enrico Iurlano, Günther Raidl

pages 1-15, 2026.
Note: preprint accepted for MIC 2026

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

Piselli, Tommaso, Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Sara Di Bartolomeo

IEEE Trans. Vis. Comput. Graph., volume 32, number 1, pages 747-757, 2026.

Approximate Evaluation of Quantitative Second Order Queries

Jan Niclas Dreier, Robert Ganian, Hamm, Thekla

2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 664-677, June 2025, IEEE Computer Society.

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

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

Visualizing Treewidth

Chiu, Alvin, Thomas Depian, Eppstein, David, Goodrich, Michael T., Martin Nöllenburg

Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 17:1-17:20, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

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

Transitions in Dynamic Point Labeling

Computational Science - ICCS 2025 - 25th International Conference, Singapore, July 7-9, 2025, Proceedings, Part II (Michael H. Lees and Wentong Cai and Siew Ann Cheong and Yi Su and David Abramson and Jack J. Dongarra and Peter M. A. Sloot), volume 15904 of Lecture Notes in Computer Science, pages 35-49, 2025, Springer.

Thomas Depian, Li, Guangping, Martin Nöllenburg, Wulms, Jules

Cartography and Geographic Information Science, pages 1-26, 2025.

Training One-Dimensional Graph Neural Networks is NP-Hard

The Peculiarities of Extending Queue Layouts

The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.

Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg

Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, 2025.

The Computational Complexity of Positive Non-Clashing Teaching in Graphs

The complexity of optimizing atomic congestion

The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.

The Complexity of Extending Fair Allocations of Indivisible Goods

Artif. Intell., volume 338, pages 104241, 2025.

The complexity of cluster vertex splitting and company

AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh and Julie Shah and Zico Kolter), pages 13745-13753, 2025, AAAI Press.

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.

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

Tackling the Alpha-Domination Problem Heuristically

31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda), volume 340 of LIPIcs, pages 39:1-39:19, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Enrico Iurlano, Johannes Varga, Günther Raidl

Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 148-156, 2025, Springer.

Structural Parameterizations of Simultaneous Planarity

Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter

36th International Symposium on Algorithms and Computation, ISAAC 2025, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

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

Florentina Voboril, Peruvemba Ramaswamy, Vaidyanathan, Stefan Szeider

2025 IEEE/ACM 1st International Workshop on Neuro-Symbolic Software Engineering (NSE), pages 17-22, 5 2025, IEEE.

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

SAT-Based Search for Minwise Independent Families

ACM Trans. Comput. Theory, volume 17, number 3, pages 18:1-18:42, 2025.

Enrico Iurlano, Günther Raidl

Note: preprint

SAT Modulo Symmetries: A Survey

Routing Few Robots in a Crowded Network

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.

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

19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada (Pat Morin and Eunjin Oh), volume 349 of LIPIcs, pages 20:1-20:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Maria Bresich, Günther Raidl, Limmer, Steffen

ACM Transactions on Evolutionary Learning and Optimization, 2025, Association for Computing Machinery.
Note: Just Accepted

Representing Hypergraphs by Point-Line Incidences

Dobler, Alexander, Kobourov, Stephen G., Mondal, Debajyoti, Martin Nöllenburg

Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic and Vera Kurková), volume 15538 of LNCS, pages 241-254, 2025, Springer.

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

Caroppo, Susanna, Da Lozzo, Giordano, Di Battista, Giuseppe, Goodrich, Michael, Martin Nöllenburg

Algorithms and Data Structures (WADS'25) (Morin, Pat and Oh, Eunjin), volume 349 of LIPIcs, pages 14:1-14:22, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Planarizing Graphs and their Drawings by Vertex Splitting

Martin Nöllenburg, Manuel Sorge, Terziadis, Soeren, Villedieu, Anaïs, Wu, Hsiang-Yun, Wulms, Jules

J. Computational Geometry, volume 16, number 1, pages 333-372, 2025.

Pathways to Tractability for Geometric Thickness (Best Paper Award)

Alexander Firbas

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 and Vera Kurková), volume 15538 of Lecture Notes in Computer Science, pages 209-224, 2025, Springer.

Pathways to Tractability for Geometric Thickness

Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg

Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic and Vera Kurková), volume 15538 of LNCS, pages 209-224, 2025, Springer.

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

Prabhakar, Archana, Grison, Elise, Morgagni, Simone, Martin Nöllenburg, Gyselinck, Valérie

Applied Cognitive Psychology, volume 39, number 5, pages e70112, 2025.

Partial Level Planarity Parameterized by the Size of the Missing Graph

Thomas Depian, Simon Dominik Fink, Klemz, Boris, Robert Ganian, Martin Nöllenburg, Sieper, Marie Diana

European Workshop on Computational Geometry (EuroCG'25) (Kratochvíl, Jan and Liotta, Giuseppe), pages 50:1-50:10, 2025.

Parameterized Complexity of Caching in Networks

Parameterized Complexity in Machine Learning

Parameterized Algorithms for Multiagent Pathfinding on Trees

Computer Science Review, 2025.
Note: to appear

PACE Solver Description: Bad Dominating Set Maker

Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2025, Detroit, MI, USA, May 19-23, 2025 (Sanmay Das and Ann Nowé and Yevgeniy Vorobeychik), pages 584-592, 2025, International Foundation for Autonomous Agents and Multiagent Systems / ACM.

Optimizing Wiggle in Storylines

20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal and Erik Jan van Leeuwen), pages 35:1-35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Dobler, Alexander, Hegemann, Tim, Martin Nöllenburg, Wolff, Alexander

Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 39:1-39:17, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Optimizing Staircase Motifs in Biofabric Network Layouts

Sara Di Bartolomeo, Wallinger, Markus, Martin Nöllenburg

Comput. Graph. Forum, pages e70139, 2025.

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity

Manuel Sorge

Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13-19, 2025, 2025, OpenReview.net.

On Planar Unit-Length Linear Linkages in Polygonal Domains

Thomas Depian, Haase, Carolina, Martin Nöllenburg, Schulz, André

European Workshop on Computational Geometry (EuroCG'25) (Kratochvíl, Jan and Liotta, Giuseppe), pages 55:1-55:9, 2025.

On Minimizing Wiggle in Stacked Area Charts

Network Navigation with Online Delays is PSPACE-complete

Algorithms and Data Structures (WADS'25) (Morin, Pat and Oh, Eunjin), volume 349 of LIPIcs, pages 22:1-22:14, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Thomas Depian, Kern, Christoph, Röder, Sebastian, Terziadis, Soeren, Wallinger, Markus

Chapter in Studierendenkonferenz Informatik (SKILL 2023), pages 195-206, 2025, Gesellschaft für Informatik e.V..

Metric Dimension and Geodetic Set Parameterized by Vertex Cover

Merge-Width and First-Order Model Checking

42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, Jena, Germany, March 4-7, 2025 (Olaf Beyersdorff and Michal Pilipczuk and Elaine Pimentel and Kim Thang Nguyen), pages 33:1-33:20, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Jan Niclas Dreier, Toruńczyk, Szymon

Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC), pages 1944–1955, 2025, Association for Computing Machinery.

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms

Thomas Depian, Simon Dominik Fink, Robert Ganian, Vaishali Surianarayanan

33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit and Haim Kaplan and Sebastian Wild and Grzegorz Herman), volume 351 of LIPIcs, pages 15:1-15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

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

Frohner, Nikolaus, Günther Raidl

Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 263-271, 2025, Springer.

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

Huber, Marc, Günther Raidl, Blum, Christian

Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 236-250, 2025, Springer.

Large and Parallel Human Sorting Networks

Introducing Fairness in Network Visualization

Creative Mathematical Sciences Communication (Fernau, Henning and Schwank, Inge and Staub, Jacqueline), pages 194-204, 2025, Springer Nature Switzerland.

Eades, Peter, Hong, Seok-Hee, Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Piselli, Tommaso, Wismath, Stephen

Information Sciences, volume 691, pages 121642, 2025.

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

Maria Bresich, Günther Raidl, Limmer, Steffen

Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 211-220, 2025, Springer.

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

Simon Wietheger

Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025 (Bogdan Filipic), pages 85-86, 2025, ACM.

Geometry Matters in Planar Storyplans

Dobler, Alexander, Holzmüller, Maximilian, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 27:1-27:9, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

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

Huang, William, Mei, Yi, Günther Raidl, Tianwei Zhang, Laurenz Tomandl, Limmer, Steffen, Rodemann, Tobias

2025 IEEE Congress on Evolutionary Computation (CEC), pages 1-8, 2025, IEEE.

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.

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.

Extracting Problem Structure with LLMs for Optimized SAT Local Search

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable

SOCS 2025, The 18th International Symposium on Combinatorial Search. August 12-15, 2025. University of Glasgow, Scotland, United Kingdom, 2025.

Crossing and Independent Families Among Polygons

J. Comput. Geom., 2025.
Note: to appear

Constrained Boundary Labeling

19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada (Pat Morin and Eunjin Oh), volume 349 of LIPIcs, pages 11:1-11:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Thomas Depian, Martin Nöllenburg, Terziadis, Soeren, Wallinger, Markus

Comput. Geom. Theory Appl., volume 129, pages 102191, 2025.

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

Jakub Balabán, Robert Ganian, Mathis Teva Rocton

SIAM J. Discret. Math., 2025.
Note: to appear

Bundling-Aware Graph Drawing Revisited

Wallinger, Markus, Piselli, Tommaso, Tappini, Alessandra, Archambault, Daniel, Liotta, Giuseppe, Martin Nöllenburg

IEEE Trans. Vis. Comput. Graph., volume 31, number 12, pages 10828-10839, 2025.

Bridging Language Models and Symbolic Solvers via the Model Context Protocol

Breaking Symmetries in Quantified Graph Search: A Comparative Study

28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland (Jeremias Berg and Jakob Nordström), volume 341 of LIPIcs, pages 30:1-30:12, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Markus Kirchweger

Better Extension Variables in DQBF via Independence

Balancing Latin Rectangles with LLM-Generated Streamliners

28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, Glasgow, Scotland, August 12-15, 2025 (Jeremias Berg and Jakob Nordström), volume 341 of LIPIcs, pages 11:1-11:24, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Florentina Voboril

31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda), volume 340 of LIPIcs, pages 36:1-36:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Analyzing Reformulation Performance in Core-Guided MaxSAT Solving

An Introduction to and Survey of Biological Network Visualization

28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland (Jeremias Berg and Jakob Nordström), volume 341 of LIPIcs, pages 26:1-26:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Ehlers, Henry, Brich, Nicolas, Jiehua Chen, Krone, Michael, Martin Nöllenburg, Natsukawa, Hiroaki, Hai Xia, Wu, Hsiang-Yun

Computers & Graphics, volume 126, pages 104115, 2025.

A Structural Complexity Analysis of Hierarchical Task Network Planning

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

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.

Alexander Dobler

Information Processing Letters, volume 190, pages 106575, 2025.

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

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

41st International Symposium on Computational Geometry, SoCG 2025, June 23-27, 2025, Kanazawa, Japan (Oswin Aichholzer and Haitao Wang), volume 332 of LIPIcs, pages 44:1-44:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Laurenz Tomandl, Jatschka, Thomas, Günther Raidl, Rodemann, Tobias

Computer Aided Systems Theory – EUROCAST 2024 (Quesada-Arencibia, Alexis and Affenzeller, Michael and Moreno-Díaz, Roberto), volume 15172 of LNCS, pages 251-262, 2025, Springer.

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

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

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

Visualizing Extensions of Argumentation Frameworks as Layered Graphs

Martin Nöllenburg, Pirker, Christian, Rapberger, Anna, Woltran, Stefan, Wulms, Jules

CoRR, volume abs/2409.05457, 2024.

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.

Twin-Width Meets Feedback Edges and Vertex Integrity

The Power of Collaboration: Learning Large Bayesian Networks at Scale

19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United Kingdom (Édouard Bonnet and Pawel Rzazewski), volume 321 of LIPIcs, pages 3:1-3:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Ramaswamy, Vaidyanathan Peruvemba, Stefan Szeider, Hai Xia

2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), pages 371-378, 2024.

The Parameterized Complexity Of Extending Stack Layouts

Simon Dominik Fink

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner and Karsten Klein), volume 320 of LIPIcs, pages 12:1-12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

The Parameterized Complexity of Extending Stack Layouts

Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 12:1-12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

The Parameterized Complexity Landscape of the Unsplittable Flow Problem

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

Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Král and Martin Milanic), volume 14760 of Lecture Notes in Computer Science, pages 220-235, 2024, Springer.

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

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 84:1-84:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

The Complexity of Optimizing Atomic Congestion

ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024.

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 and Jennifer G. Dy and Sriraam Natarajan), pages 20044-20052, 2024, AAAI Press.

The Complexity of Fair Division of Indivisible Items with Externalities

Argyrios Deligkas and Eduard Eiben and Viktoriia Korchemna and Simon Schierreich

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 and Serge Gaspers and Ralf Klasing), volume 14519 of LNCS, pages 226-239, 2024, Springer.

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

Henning Martin Woydt, Christian Komusiewicz, Frank Sommer

32nd Annual European Symposium on Algorithms (ESA 2024), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Structure-guided Local Improvement for Maximum Satisfiability

Splitting Plane Graphs to Outerplanarity

The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Gronemann, Martin, Martin Nöllenburg, Villedieu, Anaïs

J. Graph Algorithms Appl., volume 28, number 3, pages 31-48, 2024.

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

Johannes Varga, Karlsson, Emil, Günther Raidl, R\n̈nberg, Elina, Lindsten, Fredrik, Rodemann, Tobias

Machine Learning, Optimization, and Data Science. LOD 2023. (Nicosia, Giuseppe and Ojha, Varun and La Malfa, Emanuele and La Malfa, Gabriele and Pardalos, Panos M. and Umeton Renato), volume 14505 of lNCS, pages 24-38, 2024, Springer.

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

Éric Duchêne and Valentin Gledel and Sylvain Gravier and Fionn Mc Inerney and Mehdi Mhalla and Aline Parreau

Theor. Comput. Sci., volume 990, pages 114417, 2024.

Small unsatisfiable k-CNFs with bounded literal occurrence

Tianwei Zhang, Tomas Peitl, Stefan Szeider

27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Chakraborty, Supratik and Jiang, Jie-Hong Roland), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1-31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Slim Tree-Cut Width

Signed double Roman domination on cubic graphs

Algorithmica, volume 86, number 8, pages 2714-2738, 2024.

Enrico Iurlano, Zec, Tatjana, Djukanović, Marko, Günther Raidl

Applied Mathematics and Computation, volume 471, pages 128612, 2024, Elsevier.

Should Decisions in QCDCL Follow Prefix Order?

Selecting User Queries in Interactive Job Scheduling

J. Autom. Reason., volume 68, number 1, pages 5, 2024.

Johannes Varga, Günther Raidl, Todemann, Tobias

19th International Conference on Computer Aided Systems Theory, 2024, Springer.
Note: to appear

Scheduling Jobs Using Queries to Interactively Learn Human Availability Times

Johannes Varga, Günther Raidl, Rönnberg, Elina, Rodemann, Tobias

Computers & Operations Research, 2024.

Satisfiability Modulo User Propagators

Markus Kirchweger

Journal of Artificial Intelligence Research, volume 81, pages 989-1017, 2024.

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 and Sriraam Natarajan), pages 8191-8199, 2024, AAAI Press.

SAT-based Decision Tree Learning for Large Data Sets

SAT Modulo Symmetries for Graph Generation and Enumeration

Journal of Artificial Intelligence Research, volume 80, pages 875-918, 2024.

Markus Kirchweger, Stefan Szeider

ACM Transactions on Computational Logic, volume 25, number 3, 2024.

SAT backdoors: Depth beats size

Jan Niclas Dreier, Sebastian Ordyniak, Stefan Szeider

Journal of Computer and System Sciences, volume 142, pages 103520, 2024.

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings

Dobler, Alexander, Jünger, Michael, Jünger, Paul J., Meffert, Julian, Mutzel, Petra, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 31:1-31:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

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), pages 3377-3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track

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

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

Artif. Intell., volume 336, pages 104194, 2024.

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 66:1-66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

PACE Solver Description: CRGone

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 53:1-53:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Alexander Dobler

Parameterized and Exact Computation (IPEC'2024) (Édouard Bonnet and Pawel Rzazewski), volume 321 of LIPIcs, pages 29:1-29:4, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

On the Complexity of the Storyplan Problem

Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Symvonis, Antonios

J. Computer and Systems Sciences, volume 139, pages 103466, 2024.

On the Complexity of Community-aware Network~Sparsification

Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer

49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

On Critical Node Problems with Vulnerable Vertices

Jannik Schestag and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer

JGAA, volume 28, number 1, pages 1-26, 2024.

Non-Clashing Teaching Maps for Balls in Graphs

Jérémie Chalopin and Victor Chepoi and Fionn Mc Inerney and Sébastien Ratel

The Thirty Seventh Annual Conference on Learning Theory, June 30 - July 3, 2023, Edmonton, Canada (Shipra Agrawal and Aaron Roth), volume 247 of Proceedings of Machine Learning Research, pages 840-875, 2024, PMLR.

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms

Simon Wietheger

Parallel Problem Solving from Nature - PPSN XVIII - 18th International Conference, PPSN 2024, Hagenberg, Austria, September 14-18, 2024, Proceedings, Part IV (Michael Affenzeller and Stephan M. Winkler and Anna V. Kononova and Heike Trautmann and Tea Tusar and Penousal Machado and Thomas Bäck), volume 15151 of Lecture Notes in Computer Science, pages 153-168, 2024, Springer.

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

Maria Bresich, Johannes Varga, Günther Raidl, Limmer, Steffen

Metaheuristics and Nature Inspired Computing (Dorronsoro, Bernabé and Ellaia, Rachid and Talbi, El-Ghazali), pages 3-20, 2024, Springer.

Minimizing Switches in Cased Graph Drawings

Robert Ganian, Martin Nöllenburg, Röder, Sebastian

Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 43:1-43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract

Minimizing Corners in Colored Rectilinear Grids

Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms

Algorithms and Computation (WALCOM'24) (Ryuhei Uehara and Katsuhisa Yamanaka and Hsu-Chun Yen), volume 14549 of LNCS, pages 134-148, 2024, Springer.

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

Maria Bresich, Günther Raidl, Limmer, Steffen

Proceedings of the Genetic and Evolutionary Computation Conference, pages 142-150, 2024, Association for Computing Machinery.
Note: best paper award winner of ECOM track

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 and Sriraam Natarajan), pages 10476-10483, 2024, AAAI Press.

Introducing Fairness in Graph Visualization via Gradient Descent

Montecchiani, Fabrizio, Liotta, Giuseppe, Martin Nöllenburg, Hong, Seok-Hee, Piselli, Tommaso

Machine Learning Methods in Visualisation for Big Data (MLVis'24) (Archambault, Daniel and Nabney, Ian and Peltonen, Jaakko), pages 1-5, 2024, Eurographics Association.

Introducing Fairness in Graph Visualization

Hong, Seok-Hee, Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Piselli, Tommaso

Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 49:1-49:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract

Improving Temporal Treemaps by Minimizing Crossings

Improved Circuit Minimization with Exact Synthesis

Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024.

Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider

2024, Technical report AC-TR-24-001, Algorithms and Complexity Group, TU Wien.

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

Valentin Bartier and Oscar Defrain and Fionn Mc Inerney

Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings (Adele Anna Rescigno and Ugo Vaccaro), volume 14764 of Lecture Notes in Computer Science, pages 111-125, 2024, Springer.

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

Simon Wietheger

Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024 (Xiaodong Li and Julia Handl), pages 27-28, 2024, ACM.

Hoop Diagrams: A Set Visualization Method

Rodgers, Peter, Chapman, Peter, Blake, Andrew, Martin Nöllenburg, Wallinger, Markus, Dobler, Alexander

Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer.

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 and Sriraam Natarajan), pages 7978-7986, 2024, AAAI Press.

Hard QBFs for Merge Resolution

Generating All Invertible Matrices by Row Operations

ACM Trans. Comput. Theory, volume 16, number 2, pages 6:1-6:24, 2024.

GdMetriX - A NetworkX Extension For Graph Drawing Metrics

35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre and Anthony Wirth), volume 322 of LIPIcs, pages 35:1-35:14, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Martin Nöllenburg, Röder, Sebastian, Wallinger, Markus

Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 45:1-45:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time

Bhore, Sujoy, Martin Nöllenburg, Tóth, Csaba D., Wulms, Jules

Computational Geometry (SoCG'24) (Mulzer, Wolfgang and Phillips, Jeff M.), volume 293 of LIPIcs, pages 19:1-19:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

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

Jan Niclas Dreier, Mählmann, Nikolas, Toru\ŉczyk, Szymon

Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), pages 1550-1560, 2024.

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

First-Order Model Checking on Monadically Stable Graph Classes

J. Graph Algorithms Appl., volume 28, number 2, pages 131-150, 2024.

Jan Niclas Dreier, Eleftheriadis, Ioannis, Mählmann, Nikolas, McCarty, Rose, Pilipczuk, Michał, Toruńczyk, Szymon

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pages 21-30, 2024.

Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable

Bhore, Sujoy, Robert Ganian, Liana Khazaliya, Montecchiani, Fabrizio, Martin Nöllenburg

J. Computational Geometry, volume 15, number 2, pages 3-39, 2024.

Explaining Decisions in ML Models: A Parameterized Complexity Analysis

Ordyniak, Sebastian, Paesani, Giacomo and Rychlicki, Mateusz, Stefan Szeider

Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 563-573, 8 2024.

Exact methods for the Selective Assessment Routing Problem

Salvà Soler, Joan, Hemmelmayr, Vera C., Günther Raidl

Central European Journal of Operations Research, 2024.

Exact Algorithms for Clustered Planarity with Linear Saturators

Da Lozzo, Giordano, Robert Ganian, Gupta, Siddharth, Mohar, Bojan, Ordyniak, Sebastian, Zehavi, Meirav

35th International Symposium on Algorithms and Computation, ISAAC 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

eSLIM: Circuit Minimization with SAT Based Local Improvement

Franz-Xaver Reichl, Stefan Szeider

27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Chakraborty, Supratik and Jiang, Jie-Hong Roland), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1-23:14, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Enumerating Minimal Solution Sets for Metric Graph Problems

Benjamin Bergougnoux and Oscar Defrain and Fionn Mc Inerney

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

Niels Grüttemeier and Philipp Heinrich Keßler, Christian Komusiewicz and Frank Sommer

JOCO, 2024.
Note: to appear

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

Counting Vanishing Matrix-Vector Products

35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre and Anthony Wirth), volume 322 of LIPIcs, pages 40:1-40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Cornelius Brand and Viktoriia Korchemna and Kirill Simonov and Michael Skotnica

WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings (Ryuhei Uehara and Katsuhisa Yamanaka and Hsu-Chun Yen), volume 14549 of Lecture Notes in Computer Science, pages 335-349, 2024, Springer.

Constrained Boundary Labeling

Thomas Depian, Martin Nöllenburg, Terziadis, Soeren, Wallinger, Markus

Algorithms and Computation (ISAAC'24) (Mestre, Julian and Wirth, Anthony), volume 322 of LIPIcs, pages 26:1-26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

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

Computing Twin-Width Parameterized by the Feedback Edge Number

Algorithmica, volume 86, number 7, pages 2250-2288, 2024.

Jakub Balabán, Robert Ganian, Mathis Teva Rocton

41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (Olaf Beyersdorff and Mamadou Moustapha Kanté and Orna Kupferman and Daniel Lokshtanov), volume 289 of LIPIcs, pages 7:1-7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Computing Hive Plots: A Combinatorial Framework

Martin Nöllenburg, Wallinger, Markus

J. Graph Algorithms Appl., volume 28, number 2, pages 101-129, 2024.

Computing Data-driven Multilinear Metro Maps

Martin Nöllenburg, Terziadis, Soeren

The Cartographic Journal, pages 1-16, 2024.

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), pages 3315-3323, 8 2024, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track

Bundling-Aware Graph Drawing

Archambault, Daniel, Liotta, Giuseppe, Martin Nöllenburg, Piselli, Tommaso, Tappini, Alessandra, Wallinger, Markus

Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 15:1-15:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Bounding and Computing Obstacle Numbers of Graphs

Boundary Labeling in a Circular Orbit

SIAM J. Discret. Math., volume 38, number 2, pages 1537-1565, 2024.

Bonerath, Annika, Martin Nöllenburg, Terziadis, Soeren, Wallinger, Markus, Wulms, Jules

Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 22:1-22:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Backdoor DNFs

Sebastian Ordyniak, Andre Schidler, Stefan Szeider

Journal of Computer and System Sciences, volume 144, pages 103547, 2024.

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

Chew, Leroy, De Colnet, Alexis, Stefan Szeider

Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 253-263, 8 2024.

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

A Simulated Annealing Based Approach for the Roman Domination Problem

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 68:1-68:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Greilhuber, Jakob, Schober, Sophia, Enrico Iurlano, Günther Raidl

Metaheuristics and Nature Inspired Computing (Dorronsoro, Bernabé and Ellaia, Rachid and Talbi, El-Ghazali), volume 2016 of CCIS, pages 28-43, 2024, Springer.

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

Reixach, Jaume, Blum, Christian, Djukanović, Marko, Günther Raidl

Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2024 (T. Stützle and M. Wagner), volume 14632 of LNCS, pages 1-15, 2024, Springer.
Note: best paper award winner

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 and Sriraam Natarajan), pages 10662-10669, 2024, AAAI Press.

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

Reixach, Jaume, Blum, Christian, Djukanović, Marko, Günther Raidl

IEEE Transactions on Evolutionary Computation, 2024.
Note: early access

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

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.

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

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

Worbel: Aggregating Point Labels into Word Clouds

Bhore, Sujoy, Robert Ganian, Li, Guangping, Martin Nöllenburg, Wulms, Jules

ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1-19:32, 2023.

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

Untangling Circular Drawings: Algorithms and Complexity

Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos and Markus Chimani), volume 14466 of Lecture Notes in Computer Science, pages 203-217, 2023, Springer.

Bhore, Sujoy, Li, Guangping, Martin Nöllenburg, Rutter, Ignaz, Wu, Hsiang-Yun

Comput. Geom. Theory Appl., volume 111, 2023.

Transitions in Dynamic Point Labeling

Thomas Depian, Li, Guangping, Martin Nöllenburg, Wulms, Jules

Geographic Information Science (GIScience'23) (Roger Beecham and Long, Jed A. and Dianna Smith and Qunshan Zhao and Sarah Wise), volume 277 of LIPIcs, pages 2:1-2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

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

Jaroslav Garvardt and Christian Komusiewicz and Frank Sommer

TCSys, volume 67, number 5, pages 1050-1081, 2023.

The Parameterized Complexity of Network Microaggregation

The Parameterized Complexity of Finding Concise Local Explanations

Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams and Yiling Chen and Jennifer Neville), pages 6262-6270, 2023, AAAI Press.

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.

The Parameterized Complexity of Coordinated Motion Planning

The Influence of Dimensions on the Complexity of Computing Decision Trees

39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers and Joachim Gudmundsson), volume 258 of LIPIcs, pages 28:1-28:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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 and Yiling Chen and Jennifer Neville), pages 8343-8350, 2023, AAAI Press.

The Computational Complexity of Concise Hypersphere Classification

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

Proceedings of the 40th International Conference on Machine Learning, ICML 2023, pages 9060-9070, 2023, PMLR.

Splitting Vertices in 2-Layer Graph Drawings

Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-14, 2023.

Ahmed, Reyan, Angelini, Patrizio, Bekos, Michael A., Di Battista, Giuseppe, Kaufmann, Michael, Kindermann, Philipp, Kobourov, Stephen, Martin Nöllenburg, Symvonis, Antonios, Villedieu, Anaïs, Wallinger, Markus

IEEE Computer Graphics and Applications, volume 43, number 3, pages 24-35, 2023.

Splitting Plane Graphs to Outerplanarity

Gronemann, Martin, Martin Nöllenburg, Villedieu, Anaïs

Algorithms and Computation (WALCOM'23) (Lin, Bertrand M. T. and Lin, Chun-Cheng and Liotta, Giuseppe), volume 13973 of LNCS, 2023, Springer.

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 and Martin Farach-Colton and Simon J. Puglisi and Grzegorz Herman), volume 274 of LIPIcs, pages 18:1-18:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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), volume 280 of LIPIcs, pages 39:1-39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

SAT-Boosted Tabu Search for Coloring Massive Graphs

Andre Schidler, Stefan Szeider

J. Exp. Algorithmics, volume 2825, number 1.5, pages 1-19, 2023.

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 and Friedrich Slivovsky), volume 271 of LIPIcs, pages 14:1-14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Sample compression schemes for balls in graphs

Jérémie Chalopin, Victor Chepoi, Fionn Mc~Inerney, Sébastien Ratel, Yann Vaxès

SIAM J. Discrete Math., 2023.
Note: to appear

Pseudorandom Finite Models

Proven optimally-balanced Latin rectangles with SAT

LICS, pages 1-13, 2023.

Planarizing Graphs and their Drawings by Vertex Splitting

Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap), volume 280 of LIPIcs, pages 48:1-48:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Martin Nöllenburg, Manuel Sorge, Terziadis, Soeren, Villedieu, Anaïs, Wu, Hsiang-Yun, Wulms, Jules

Graph Drawing and Network Visualization (GD'22) (Angelini, Patrizio and von Hanxleden, Reinhard), volume 13764 of LNCS, pages 232-246, 2023, Springer.

Parameterized complexity of envy-free resource allocation in social networks

PACE Solver Description: Touiouidth

Artif. Intell., volume 315, pages 103826, 2023.

Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Teva Rocton

Parameterized and Exact Computation (IPEC'2023) (Neeldhara Misra and Magnus Wahlström), volume 285 of LIPIcs, pages 38:1-38:4, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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

On the Upward Book Thickness Problem: Combinatorial and Complexity Results

Proceedings to the 6th International Electric Vehicle Technology Conference, pages 20231015, 2023, JSAE.

Bhore, Sujoy, Da Lozzo, Giordano, Montecchiani, Fabrizio, Martin Nöllenburg

European J. Combinatorics, volume 110, pages 103662, 2023.

On the parameterized complexity of clustering problems for incomplete data

On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics

Journal of Computer and System Sciences, volume 134, pages 1-19, 2023.

Christian Komusiewicz and Jannis Schramek and Frank Sommer

SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023 (Jonathan W. Berry and David B. Shmoys and Lenore Cowen and Uwe Naumann), pages 13-24, 2023, SIAM.

On the Complexity of the Storyplan Problem

Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Martin Nöllenburg, Symvonis, Antonios

Graph Drawing and Network Visualization (GD'22) (Angelini, Patrizio and von Hanxleden, Reinhard), volume 13764 of LNCS, pages 304-318, 2023, Springer.

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

Matthias Bentert and Jannik Schestag and Frank Sommer

18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra and Magnus Wahlström), volume 285 of LIPIcs, pages 4:1-4:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

On Families of Planar DAGs with Constant Stack Number

Martin Nöllenburg, Pupyrev, Sergey

Graph Drawing and Network Visualization (GD'23) (Bekos, Michael and Chimani, Markus), volume 14465 of LNCS, pages 135-151, 2023, Springer.

On Computing Optimal Tree Ensembles

Manuel Sorge

International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA (Andreas Krause and Emma Brunskill and Kyunghyun Cho and Barbara Engelhardt and Sivan Sabato and Jonathan Scarlett), volume 202 of Proceedings of Machine Learning Research, pages 17364-17374, 2023, PMLR.

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

Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg, Zehavi, Meirav, Liana Khazaliya

Dagstuhl Reports, volume 13, number 4, pages 58-97, 2023.

New Complexity-Theoretic Frontiers of Tractability for Neural Network Training

MySemCloud: Semantic-aware Word Cloud Editing

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.

Huber, Michael, Martin Nöllenburg, Villedieu, Anaïs

Pacific Visualization Symposium (PacificVis'23), pages 147-156, 2023.

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

Emmanuel Arrighi and Niels Grüttemeier and Nils Morawietz and Frank Sommer and Petra Wolf

SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings (Leszek Gasieniec), volume 13878 of Lecture Notes in Computer Science, pages 283-297, 2023, Springer.

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

Nikolaus Frohner, Günther Raidl, Francisco Chicano

pages 1941-1949, 2023, ACM Press.

MosaicSets: Embedding Set Systems into Grid Graphs

Rottmann, Peter, Wallinger, Markus, Bonerath, Annika, Gedicke, Sven, Martin Nöllenburg, Haunert, Jan-Henrik

IEEE Trans. Visualization and Computer Graphics, 2023.

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

Maximizing Social Welfare in Score-Based Social Distance Games

LinSets.zip: Compressing Linear Set Diagrams

Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023 (Rineke Verbrugge), volume 379 of EPTCS, pages 272-286, 2023.

Wallinger, Markus, Dobler, Alexander, Martin Nöllenburg

IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875-2887, 2023.

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), pages 3184-3192, 2023, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track

Large Neighborhood Search for Electric Vehicle Fleet Scheduling

Limmer, Steffen, Johannes Varga, Günther Raidl

Energies, volume 16, number 12, 2023.

IPASIR-UP: User Propagators for CDCL

Katalin Fazekas, Aina Niemetz, 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 and Friedrich Slivovsky), volume 271 of LIPIcs, pages 8:1-8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Interactive Job Scheduling with Partially Known Personnel Availabilities

Johannes Varga, Günther Raidl, Rönnberg, Elina, Rodemann, Tobias

OLA 2023: Optimization and Learning (Dorronsoro, B. and Chicano, F. and Danoy, G. and Talbi, E.-G.), volume 1824 of Communications in Computer and Information Science, pages 236-247, 2023, Springer.

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes

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

50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany (Kousha Etessami and Uriel Feige and Gabriele Puppis), volume 261 of LIPIcs, pages 125:1-125:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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

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

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

Growth of the perfect sequence covering array number

Artif. Intell., volume 325, pages 104017, 2023.

Enrico Iurlano

Designs, Codes and Cryptography, volume 91, number 4, pages 1487-1494, 2023, Springer.

Group Activity Selection with Few Agent Types

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

Algorithmica, volume 85, number 5, pages 1111-1155, 2023.

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs

18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra and Magnus Wahlström), volume 285 of LIPIcs, pages 16:1-16:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager

First-Order Model Checking on Structurally Sparse Graph Classes

Jan Niclas Dreier, Mählmann, Nikolas, Siebertz, Sebastian

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 567-580, 2023, Association for Computing Machinery.

Faster Edge-Path Bundling Through Graph Spanners

Wallinger, Markus, Archambault, Daniel, Auber, David, Martin Nöllenburg, Peltonen, Jaakko

Computer Graphics Forum, volume 42, number 6, pages e14789, 2023.

Fast Convolutions for Near-Convex Sequences

Cornelius Brand and Alexandra Lassota

34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan (Satoru Iwata and Naonori Kakimura), volume 283 of LIPIcs, pages 16:1-16:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers and Joachim Gudmundsson), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Bhore, Sujoy, Robert Ganian, Liana Khazaliya, Montecchiani, Fabrizio, Martin Nöllenburg

Computational Geometry (SoCG'23) (Chambers, Erin W. and Gudmundsson, Joachim), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Exact Algorithms for Group Closeness Centrality

Luca Pascal Staus and Christian Komusiewicz and Nils Morawietz and Frank Sommer

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

Jan Niclas Dreier, Mock, Daniel, Rossmanith, Peter

31st Annual European Symposium on Algorithms (ESA 2023) (Gørtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz), volume 274 of Leibniz International Proceedings in Informatics (LIPIcs), pages 43:1-43:17, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Essentially Tight Kernels for (Weakly) Closed Graphs

Tomohiro Koana and Christian Komusiewicz and Frank Sommer

Alg, volume 85, number 6, pages 1706-1735, 2023.

Deterministic Constrained Multilinear Detection

Cornelius Brand and Viktoriia Korchemna and Michael Skotnica

48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France (Jérôme Leroux and Sylvain Lombardy and David Peleg), volume 272 of LIPIcs, pages 25:1-25:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs

Nils Jakob Eckstein and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer

DMTCS, volume 25, 2023.

CSP beyond tractable constraint languages

Crossing Minimization in Time Interval Storylines

Constraints, volume 28, number 3, pages 450-471, 2023.

Dobler, Alexander, Martin Nöllenburg, Stojanovic, Daniel, Villedieu, Anaïs, Wulms, Jules

European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer and Carlos Seara), pages 36:1-36:7, 2023.

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity

Computing twin-width with SAT and branch & bound

18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra and Magnus Wahlström), volume 285 of LIPIcs, pages 18:1-18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Andre Schidler, Stefan Szeider

The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind), pages 2013-2021, 2023, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track

Computing optimal hypertree decompositions with SAT

Computing Hive Plots: A Combinatorial Framework

Artificial Intelligence, volume 325, pages 104015, 2023.

Martin Nöllenburg, Wallinger, Markus

Graph Drawing and Network Visualization (GD'23) (Bekos, Michael and Chimani, Markus), volume 14466 of LNCS, pages 153-169, 2023, Springer.

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Tomohiro Koana and Christian Komusiewicz and Frank Sommer

Alg, volume 85, number 7, pages 2156-2187, 2023.

Co-Certificate Learning with SAT Modulo Symmetries

Markus Kirchweger, Tomas 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

Circuit Minimization with QBF-Based Exact Synthesis

Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider

Circuit Minimization with Exact Synthesis: From QBF Back to SAT

Block Crossings in One-Sided Tanglegrams

Proceedings of the 32nd International Workshop on Logic & Synthesis (IWLS), 2023.

Are Hitting Formulas Hard for Resolution?

Algorithms and Data Structures (WADS'23) (Morin, Pat and Suri, Subhash), volume 14079 of LNCS, pages 386-400, 2023, Springer.

An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles

Discr. Appl. Math., volume 337, pages 173-184, 2023.

Limmer, Steffen, Johannes Varga, Günther Raidl

EvoApplications 2023: Applications of Evolutionary Computation (Correia, J. and Smith, S. and Qaddoura, R.), volume 13989 of LNCS, pages 3-18, 2023, Springer.

Algorithms for Satisfiability Testing

Florentina Voboril

9 2023, SKILL 2023, Gesellschaft für Informatik, Bonn.

A Structural Complexity Analysis of Synchronous Dynamical Systems

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

Markus Kirchweger

26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy (Meena Mahajan and Friedrich Slivovsky), volume 271 of LIPIcs, pages 13:1-13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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

Huber, Marc, Günther Raidl

Computer Aided Systems Theory – EUROCAST 2022 (Roberto Moreno-Díaz and Franz Pichler and Alexis Quesada-Arencibia), volume 13789 of LNCS, pages 87-95, 2023, Springer.

A Polyhedral Perspective on Tropical Convolutions

Cornelius Brand and Martin Koutecký and Alexandra Lassota

Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings (Sun-Yuan Hsieh and Ling-Ju Hung and Chia-Wei Lee), volume 13889 of Lecture Notes in Computer Science, pages 111-122, 2023, Springer.

A Policy-Based Learning Beam Search for Combinatorial Optimization

Ettrich, Rupert, Huber, Marc, Günther Raidl

Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Pérez Cáceres, Leslie and Stützle, Thomas), volume 13987 of LNCS, pages 130-145, 2023, Springer.
Note: best paper award winner

A Parameterized Theory of PAC Learning

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

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

Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres and Thomas Stützle), volume 13987 of LNCS, pages 50–65, 2023, Springer.

Benjamin Bergougnoux, Jan Niclas Dreier, Lars Jaffke

Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3282-3304, 2023.

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets

Rafael Kiesel and André Schidler

Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023 (Gonzalo Navarro and Julian Shun), pages 39-52, 2023, SIAM.

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

Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution

Beyersdorff, Olaf, Blinkhorn, Joshua, Mahajan, Meena, Tomas Peitl

ACM Transactions on Computational Logic, sep 2022, Association for Computing Machinery.

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

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

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

Weighted Model Counting with Twin-Width

Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (Alexis Quesada-Arencibia and others), pages 32-33, February 2022.

Robert Ganian, Filip Pokr ́Yvka, 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 and Ofer Strichman), volume 236 of LIPIcs, pages 15:1-15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Twin-width and generalized coloring numbers

Jan Niclas Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona De Mendez, Jean-Florent Raymond

Discrete Mathematics, volume 345, number 3, pages 112746, 2022.

Turbocharging Heuristics for Weak Coloring Numbers

Dobler, Alexander, Manuel Sorge, Villedieu, Anäis

European Symposium on Algorithms (ESA 2022) (Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz), volume 244 of LIPIcs, pages 44:1-44:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Treelike Decompositions for Transductions of Sparse Graphs

Jan Niclas Dreier, Gajarský, Jakub, Kiefer, Sandra, Pilipczuk, Michał, Toruńczyk, Szymon

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery.

Tractable Abstract Argumentation via Backdoor-Treewidth

Wolfgang Dvorak, Markus Hecher, Matthias König and 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.

Towards Uniform Certification in QBF

Leroy Chew and Friedrich Slivovsky

39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink and Benjamin Monmege), volume 219 of LIPIcs, pages 22:1-22:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Threshold Treewidth and Hypertree Width

Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider

Journal of Artificial Intelligence Research, volume 74, pages 1687-1713, 2022.

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

Jaroslav Garvardt and Christian Komusiewicz and Frank Sommer

Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings (Cristina Bazgan and Henning Fernau), volume 13270 of Lecture Notes in Computer Science, pages 313-326, 2022, Springer.

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

The Complexity of Temporal Vertex Cover in Small-Degree Graphs

49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk and Emanuela Merelli and David P. Woodruff), volume 229 of LIPIcs, pages 66:1-66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Thekla Hamm and Nina Klobas and George B. Mertzios and Paul G. Spirakis

Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 10193-10201, 2022, AAAI Press.

The Complexity of k-Means Clustering when Little is Known

The Complexity of Envy-Free Graph Cutting

International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri and Stefanie Jegelka and Le Song and Csaba Szepesvári and Gang Niu and Sivan Sabato), volume 162 of Proceedings of Machine Learning Research, pages 6960-6987, 2022, PMLR.

Testing Upward Planarity of Partial 2-Trees

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt), pages 237-243, 2022, ijcai.org.

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

Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers (Patrizio Angelini and Reinhard von Hanxleden), volume 13764 of Lecture Notes in Computer Science, pages 175-187, 2022, Springer.

Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider

Journal of Artificial Intelligence Research, volume 33, pages 535-552, 2022.

Slim Tree-Cut Width

Should Decisions in QCDCL Follow Prefix Order?

17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell and Jesper Nederlof), volume 249 of LIPIcs, pages 15:1-15:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Shape-Guided Mixed Metro Map Layout

25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel and Ofer Strichman), volume 236 of LIPIcs, pages 11:1-11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Batik, Tobias, Terziadis, Soeren, Wang, Yu-Shuen, Martin Nöllenburg, Wu, Hsiang-Yun

Computer Graphics Forum, volume 41, number 7, pages 495-506, 2022.

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

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

André Schidler

38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 74:1-74:8, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

SAT Backdoors: Depth Beats Size

Phoebe De Nooijer and Soeren Nickel and Alexandra Weinberger and Zuzana Masárová and Tamara Mchedlidze and Maarten Löffler and Günter Rote

30th Annual European Symposium on Algorithms (ESA 2022) (Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 46:1-46:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

CoRR, volume abs/2202.12175, 2022.

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs

Nils Morawietz and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer

TCSys, volume 66, number 5, pages 1019-1045, 2022.

Recognizing Weighted and Seeded Disk Graphs

Klemz, Boris, Martin Nöllenburg, Prutkin, Roman

J. Computational Geometry, volume 13, number 1, pages 327-376, 2022.

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

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

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt), pages 1781-1787, 2022, ijcai.org.
Note: Distinguished Paper Award

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

Discr. Appl. Math., volume 312, pages 1-2, 2022.

Pedant: A Certifying DQBF Solver

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.

Franz-Xaver Reichl and Friedrich Slivovsky

25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel and Ofer Strichman), volume 236 of LIPIcs, pages 20:1-20:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Parameterized Algorithms for Upward Planarity

38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 26:1-26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

J. Graph Algorithms Appl., volume 26, number 3, pages 335-352, 2022.

Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg

J. Graph Algorithms Appl., volume 26, number 3, pages 335-352, 2022.

Parameterised Partially-Predrawn Crossing Number

Thekla Hamm and Petr Hlinený

38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 46:1-46:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Parallel Beam Search for Combinatorial Optimization

Frohner, Nikolaus, Gmys, Jan, Melab, Nourdine,, Günther Raidl, Talbi, El-Ghazali

Fifteenth International Symposium on Combinatorial Search (SoCS 2022), pages 273-275, 2022, AAAI.

PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT

Rafael Kiesel and André Schidler

17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell and Jesper Nederlof), volume 249 of LIPIcs, pages 32:1-32:4, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations

Frank Sommer

2022, PhD thesis, University of Marburg, Germany.

On Critical Node Problems with Vulnerable Vertices

Jannik Schestag and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer

On Covering Segments with Unit Intervals

On Computing Optimal Linear Diagrams

SIAM J. Discret. Math., volume 36, number 2, pages 1200-1230, 2022.

Multidimensional Manhattan Preferences

Diagrammatic Representation and Inference (DIAGRAMS'22) (Giardino, Valeria and Linker, Sven and Burns, Richard and Bellucci, Francesco and Boucheix, Jean-Michel and Viana, Petrucio), volume 13462 of LNAI, pages 20-36, 2022, Springer.

Jiehua Chen, Martin Nöllenburg, Simola, Sofia, Villedieu, Anaïs, Wallinger, Markus

Theoretical Informatics (LATIN'22) (Castañeda, Armando and Rodríguez-Henríquez, Francisco), volume 13568 of LNCS, pages 273-289, 2022, Springer.

Multicriteria Optimization for Dynamic Demers Cartograms

Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Kobourov, Stephen, Peltonen, Jaakko, Martin Nöllenburg

IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376-2387, 2022.
Note: TVCG Replicability Stamp

Multi-level Area Balancing of Clustered Graphs

Wu, Hsiang-Yun, Martin Nöllenburg, Viola, Ivan

IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682-2696, 2022.

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth

Bonnet, Édouard, Jan Niclas Dreier, Gajarský, Jakub, Kreutzer, Stephan, Mählmann, Nikolas, Simon, Pierre, Toruńczyk, Szymon

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery.

Mixed Labeling: Integrating Internal and External Labels

Čmolík, Ladislav, Pavlovec, Václav, Wu, Hsiang-Yun, Martin Nöllenburg

IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848-1861, 2022.

Minimum Link Fencing

Bhore, Sujoy, Klute, Fabian, Löffler, Maarten, Martin Nöllenburg, Terziadis, Soeren, Villedieu, Anaïs

Algorithms and Computation (ISAAC'22) (Bae, Sang Won and Park, Heejin), volume 248 of LIPIcs, pages 34:1-34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Lossy Kernelization of Same-Size Clustering

Bandyapadhyay, Sayan, Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi, Siminov, Kirill

Computer Science – Theory and Applications: 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 – July 1, 2022, Proceedings, pages 96–114, 2022, Springer-Verlag.

Longest Cycle above Erdős--Gallai Bound

Fomin, Fedor V., Golovach, Petr A., Sagunov, Danil, Simonov, Kirill

30th Annual European Symposium on Algorithms (ESA 2022), volume 271 of LIPIcs, pages 13:1-13:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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

N. Frohner, Günther Raidl

Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia and others), pages 20-21, 2022.

Learning Large Bayesian Networks with Expert Constraints

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

38th Conference on Uncertainty in Artificial Intelligence (UAI 2022), Eindhoven, Netherlands, August 1–5, 2022 (James Cussens and Kun Zhang), pages 180:1592–1601, 2022.

Huber, Marc, Günther Raidl

Machine Learning, Optimization, and Data Science, LOD 2021 (Nicosia, Giuseppe and Ojha, Varun and La Malfa, Emanuele and La Malfa, Gabriele and Jansen, Giorgio and Pardalos, Panos M. and Giuffrida, Giovanni and Umeton, Renato), volume 13164 of LNCS, pages 283-298, 2022, Springer.

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

Landman, Martina, Futschek, Gerald, Unkovic, Svetlana, Florentina Voboril

OLYMPIADS IN INFORMATICS, pages 43-53, 1 2022.

How to Find a Good Explanation for Clustering?

Sayan Bandyapadhyay and Fedor v. Fomin and Petr A. Golovach and William Lochet and Nidhi Purohit and Kirill Simonov

Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 3904-3912, 2022, AAAI Press.

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

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

Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 5034-5042, 2022, AAAI Press.

Djukanovic, Marko, Kartelj, Aleksandar, Matić, Dragan, Grbić, Milana, Blum, Christian, Günther Raidl

Applied Soft Computing, volume 122, pages 108844, 2022.

FPT Approximation for Fair Minimum-Load Clustering

Bandyapadhyay, Sayan, Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi, Simonov, Kirill

17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Fine-grained Complexity of Partial Minimum Satisfiability

Bliznets, Ivan, Sagunov, Danil, Simonov, Kirill

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22 (Lud De Raedt), pages 1774-1780, 7 2022, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track

Finding a Cluster in Incomplete Data

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

30th Annual European Symposium on Algorithms (ESA 2022) (Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1-47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Finding a Battleship of Uncertain Shape

Eva-Maria Hainzl and Maarten Löffler and Daniel Perz and Josef Tkadlec and Markus Wallinger

CoRR, volume abs/2202.08747, 2022.

Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems

Tomohiro Koana and Christian Komusiewicz and Frank Sommer

SiamJDM, volume 36, number 4, pages 2798-2821, 2022.

Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach

Wallinger, Markus, Archambault, Daniel, Auber, David, Martin Nöllenburg, Peltonen, Jaakko

IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313-323, 2022.

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

Christian Hatschka

Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos and Michael Kaufmann), volume 13453 of Lecture Notes in Computer Science, pages 98-113, 2022, Springer.

Detours in Directed Graphs

Fomin, Fedor V., Golovach, Petr A., Lochet, William, Sagunov, Danil, Simonov, Kirill, Saurabh, Saket

39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (Berenbrink, Petra and Monmege, Benjamin), volume 219 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29:1-29:16, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

CSP Beyond Tractable Constraint Languages

Jan Niclas 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), volume 235 of LIPIcs, pages 20:1-20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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

Tomohiro Koana and Christian Komusiewicz and André Nichterlein and Frank Sommer

39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink and Benjamin Monmege), volume 219 of LIPIcs, pages 42:1-42:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Computing Treewidth with Constraint Programming

Florentina Voboril

pages 115-126, 9 2022, SKILL 2022, Gesellschaft für Informatik, Bonn.

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

Johannes Varga, Günther Raidl, Steffen Limmer

Access, volume 10, 2022.

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

A. Akitaya, Hugo, Demaine, Erik D., Korman, Matias, Kostitsyna, Irina, Parada, Irene, Sonke, Willem, Speckmann, Bettina, Uehara, Ryuhei, Wulms, Jules

Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'22) (Czumaj, Artur and Xin, Qin), volume 227 of LIPIcs, pages 4:1-4:19, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Combinatorial and Algorithmic Aspects of Monadic Stability

Jan Niclas Dreier, Mählmann, Nikolas, Mouawad, Amer E., Siebertz, Sebastian, Vigny, Alexandre

33rd International Symposium on Algorithms and Computation (ISAAC 2022) (Bae, Sang Won and Park, Heejin), volume 248 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1-11:17, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Colored cut games

Nils Morawietz and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer

TCS, volume 936, pages 13-32, 2022.

Bounding and Computing Obstacle Numbers of Graphs

An efficient algorithm for counting Markov equivalent DAGs

30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Shiri Chechik and Gonzalo Navarro and Eva Rotenberg and Grzegorz Herman), volume 244 of LIPIcs, pages 11:1-11:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling

Artificial Intelligence, volume 304, pages 103648, 2022.

Bhore, Sujoy, Li, Guangping, Martin Nöllenburg

ACM J. Experimental Algorithmics, volume 27, pages 1.8:1-1.8:36, 2022.

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.

A Unifying Framework for Characterizing and Computing Width Measures

A SAT Attack on Rota’s Basis Conjecture

13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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 and Ofer Strichman), volume 236 of LIPIcs, pages 4:1-4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

A SAT Approach to Twin-Width

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

Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments (Cynthia A. Phillips and Bettina Speckmann), pages 67-77, 2022, SIAM.

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.

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

Huber, Marc, Günther Raidl

Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia and others), pages 22-23, 2022.

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

A Learning Large Neighborhood Search for the Staff Rerostering Problem

Oberweger, Fabio F., Günther Raidl, Rönnberg, Elina, Huber, Marc

Integration of Constraint Programming, Artificial Intelligence, and Operations Research – CPAIOR 2022 (Schaus, Pierre), volume 13292 of LNCS, pages 300-317, 2022, Springer.

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

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

Chapter in Computer Aided Systems Theory – EUROCAST 2022, volume 13789 of LNCS, pages 121-129, 2022, Springer.

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

Metaheuristics and Nature Inspired Computing (Dorronsoro, Bernabé and Yalaoui, Farouk and Talbi, El-Ghazali and Danoy, Grégoire), volume 1541 of CCIS, pages 3-17, 2022, Springer.

Mayerhofer, Jonas, Markus Kirchweger, Huber, Marc, Günther Raidl

Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Pérez Cáceres, Leslie and Verel, Sébastien), volume 13222 of LNCS, pages 127-142, 2022, Springer.
Note: best paper award winner

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

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

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 and Sébastien Vérel), volume 13222 of Lecture Notes in Computer Science, pages 127-142, 2022, Springer.

volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

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

A Learning Large Neighborhood Search for the Staff Rerostering Problem

Fabio Francisco Oberweger

October 2021, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and E. Rönnberg and M. Huber, winner of the Austrian OCG Förderpreis 2022

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

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

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

Worbel: Aggregating Point Labels into Word Clouds

Bhore, Sujoy, Robert Ganian, Li, Guangping, Martin Nöllenburg, Wulms, Jules

Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256-267, 2021, ACM.

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.

Untangling Circular Drawings: Algorithms and Complexity

Bhore, Sujoy, Li, Guangping, Martin Nöllenburg, Rutter, Ignaz, Wu, Hsiang-Yun

Algorithms and Computation (ISAAC'21) (Ahn, Hee-Kap and Sadakane, Kunihiko), volume 212 of LIPIcs, pages 19:1-19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs

Bhore, Sujoy, Löffler, Maarten, Nickel, Soeren, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 304-317, 2021, Springer.

Two new Mixed-Integer Linear Programming Models for Solving the Multidimensional Multi-Way Number Partitioning Problem

Bojan Nikolic, Marko Djukanovic, Dragan Matic

2021, Technical report AC-TR-21-005, Algorithms and Complexity Group, TU Wien.

Turbocharging Treewidth-Bounded Bayesian Network Structure Learning

Towards a Polynomial Kernel for Directed Feedback Vertex Set

Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3895-3903, 2021, AAAI Press.

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths

Algorithmica, volume 83, number 5, pages 1201-1221, 2021.

The Parameterized Complexity of Connected Fair Division

Algorithmica, volume 83, number 2, pages 726-752, 2021.

The Parameterized Complexity of Clustering Incomplete Data

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou), pages 139-145, 2021, ijcai.org.

Eduard Eiben, Robert Ganian, Iyad Kanj and Sebastian Ordyniak, Stefan Szeider

Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296-7304, 2021, AAAI Press.

The Parameterized Complexity of Clustering Incomplete Data

Eduard Eiben, Robert Ganian, Iyad Kanj and Sebastian Ordyniak, Stefan Szeider

2021, Technical report AC-TR-21-007, Algorithms and Complexity Group, TU Wien.

The Complexity of Object Association in Multiple Object Tracking

The Complexity of Bayesian Network Learning: Revisiting the Superstructure

Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388-1396, 2021, AAAI Press.

The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints

Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual (Marc’Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan), pages 430-442, 2021.

Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths

Artificial Intelligence, 2021.

Stable Visual Summaries for Trajectory Collections

Electron. Colloquium Comput. Complex., pages 135, 2021.

Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann

Pacific Visualization Symposium (PacificVis'21), pages 61-70, 2021, IEEE.

Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings

Nikolic, Bojan, Kartelj, Aleksandar, Djukanovic, Marko, Grbić, Milana, Blum, Christian, Günther Raidl

Mathematics, volume 9, number 13, 2021.

Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings

Nikolic, Bojan, Kartelj Aleksandar, Djukanovic, Marko, Grbic, Milana, Blum, Christian, Günther Raidl

2021, Technical report AC-TR-21-009, Algorithms and Complexity Group, TU Wien.

Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings

Djukanovic, Marko, Kartelj Aleksandar, Matic, Dragan,, Grbic, Milana, Blum, Christian, Günther Raidl

2021, Technical report AC-TR-21-008, Algorithms and Complexity Group, TU Wien.

Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers

Schaden, Benjamin, Jatschka, Thomas, Limmer, Steffen, Günther Raidl

Energies, volume 14, number 22, 2021.

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.

SAT-based Decision Tree Learning for Large Data Sets

SAT-based Decision Tree Learning for Large Data Sets

Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3904-3912, 2021, AAAI Press.

SAT Modulo Symmetries for Graph Generation

2021, Technical report AC-TR-21-003, Algorithms and Complexity Group, TU Wien.

Markus Kirchweger, Stefan Szeider

Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel), pages 39:1–-39:17, 2021, Dagstuhl Publishing.

Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines

Nikolaus Frohner, Matthias Horn, Günther 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.

Proof Complexity of Symbolic QBF Reasoning

Stefan Mengel and Friedrich Slivovsky

Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li and Felip Manyà), volume 12831 of Lecture Notes in Computer Science, pages 399-416, 2021, Springer.

Proof Complexity of Symbolic QBF Reasoning

Stefan Mengel, Friedrich Slivovsky

2021, Technical report AC-TR-21-011, Algorithms and Complexity Group, TU Wien.

Preventing Small (s,t)Cuts by Protecting Edges

Niels Grüttemeier and Christian Komusiewicz and Nils Morawietz and Frank Sommer

Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers (Lukasz Kowalik and Michal Pilipczuk and Pawel Rzazewski), volume 12911 of Lecture Notes in Computer Science, pages 143-155, 2021, Springer.

Parameterized k-Clustering: Tractability island

Fedor v. Fomin, Petr A. Golovach, Kirill Simonov

Journal of Computer and System Sciences, volume 117, pages 50 - 74, 2021.

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.

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.

Parameterized Complexity of Feature Selection for Categorical Data Clustering

Bandyapadhyay, Sayan, Fomin, Fedor V., Golovach, Petr A., Simonov, Kirill

46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (Bonchi, Filippo and Puglisi, Simon J.), volume 202 of Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1-14:14, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)

Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg, Zehavi, Meirav

Dagstuhl Reports, volume 11, number 6, pages 82-123, 2021.

On the Upward Book Thickness Problem: Combinatorial and Complexity Results

Bhore, Sujoy, Da Lozzo, Giordano, Montecchiani, Fabrizio, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 242-256, 2021, Springer.

On the Readability of Abstract Set Visualizations

Wallinger, Markus, Jacobsen, Ben, Kobourov, Stephen, Martin Nöllenburg

IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821-2832, 2021.

On Structural Parameterizations of the Edge Disjoint Paths Problem

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

Algorithmica, volume 83, number 6, pages 1605-1637, 2021.

On Strict (Outer-)Confluent Graphs

Algorithmica, volume 83, number 1, pages 297-336, 2021.

Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg

J. Graph Algorithms Appl., 2021.

On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications

Sayan Bandyapadhyay and Fedor v. Fomin and Kirill Simonov

48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), 2021.

New Width Parameters for SAT and Sharp-SAT

Robert Ganian, Stefan Szeider

Artificial Intelligence, volume 295, pages 103460, 2021.

Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

MetroSets: Visualizing Sets as Metro Maps

Annals of Operations Research, volume 302, pages 407-531, 2021.

Jacobsen, Ben, Wallinger, Markus, Kobourov, Stephen, Martin Nöllenburg

IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257-1267, 2021.

Measuring what matters: A hybrid approach to dynamic programming with treewidth

Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems

J. Comput. Syst. Sci., volume 121, pages 57-75, 2021.

Adrian Bracher, Nikolaus Frohner, Günther Raidl

17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey), volume 12735 of LNCS, pages 283-298, 2021, Springer.

Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems

M. Horn, Günther Raidl

Learning fast-inference Bayesian networks

Layered Area-Proportional Rectangle Contact Representation

Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems (M. Ranzato and A. Beygelzimer and K. Nguyen and P.S. Liang and J.W. Vaughan and Y. Dauphin), pages 17852-17863, 2021.

Martin Nöllenburg, Villedieu, Anaïs, Wulms, Jules

Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 318-326, 2021, Springer.

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes

Labeling Nonograms: Boundary Labeling for Curve Arrangements

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-13, 2021.
Note: distinguished paper

Klute, Fabian, Löffler, Maarten, Martin Nöllenburg

Comput. Geom. Theory Appl., volume 98, pages 101791, 2021.

Hardness and Optimality in QBF Proof Systems Modulo NP

Leroy Chew

2021, Technical report AC-TR-21-013, Algorithms and Complexity Group, TU Wien.

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.

Graphs with at most two moplexes

Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic

Journal of Graph Theory, 2021, Wiley Online Library.

Geometric Planar Networks on Bichromatic Collinear Points

Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Martin Nöllenburg

Theoretical Computer Science, volume 895, pages 124-136, 2021.

Fixed-Parameter Tractability

Marko Samer, Stefan Szeider

Chapter in Handbook of Satisfiability, 2nd Edition (Armin Biere and Marijn Heule and Hans van Maaren and Toby Walsh), pages 693-736, 2021, IOS Press.

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

First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving

Wolfgang Schreiner and Franz-Xaver Reichl

Proceedings of the 9th International Symposium on Symbolic Computation in Software Science, SCSS 2021, Hagenberg, Austria, September 8-10, 2021 (Temur Kutsia), volume 342 of EPTCS, pages 99-113, 2021.

Finding the Hardest Formulas for Resolution (Extended Abstract)

Finding the Hardest Formulas for Resolution

Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou), pages 4814-4818, 2021.
Note: Sister Conferences Best Papers

Tomas Peitl, Stefan Szeider

Journal of Artificial Intelligence Research, volume 72, pages 69-97, 2021.
Note: Conference Award Track, best paper CP 2020

External Labeling: Fundamental Concepts and Algorithmic Techniques

Bekos, Michael A., Niedermann, Benjamin, Martin Nöllenburg

2021, Morgan & Claypool.

Essentially Tight Kernels For (Weakly) Closed Graphs

Tomohiro Koana and Christian Komusiewicz and Frank Sommer

32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan (Hee-Kap Ahn and Kunihiko Sadakane), volume 212 of LIPIcs, pages 35:1-35:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

EPTAS for \emphk-means Clustering of Affine Subspaces

Eduard Eiben and Fedor v. Fomin and Petr A. Golovach and William Lochet and Fahad Panolan and Kirill Simonov

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 (Dániel Marx), pages 2649-2659, 2021, SIAM.

Enumerating connected induced subgraphs: Improved delay and experimental comparison

Christian Komusiewicz and Frank Sommer

DAM, volume 303, pages 262-282, 2021.

Engineering an Efficient Boolean Functional Synthesis Engine

Priyanka Golia and Friedrich Slivovsky and Subhajit Roy and Kuldeep S. Meel

IEEE/ACM International Conference On Computer Aided Design, ICCAD 2021, Munich, Germany, November 1-4, 2021, pages 1-9, 2021, IEEE.

Driver Shift Planning for an Online Store with Short Delivery Times

Matthias Horn, Nikolaus Frohner, Günther 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.

Disjoint Box Covering in a Rectilinear Polygon

Bhore, Sujoy, Li, Guangping, Martin Nöllenburg, Wulms, Jules

European Workshop on Computational Geometry (EuroCG'21), pages 71:1-71:7, 2021.

Destroying Bicolored $P_3$s by Deleting Few Edges

Niels Grüttemeier and Christian Komusiewicz and Jannik Schestag and Frank Sommer

DMTCS, volume 23, number 1, 2021.

Davis and Putnam Meet Henkin: Solving DQBF with Resolution

Joshua Blinkhorn, Tomas Peitl, Friedrich Slivovsky

2021, Technical report AC-TR-21-012, Algorithms and Complexity Group, TU Wien.

Davis and Putnam Meet Henkin: Solving DQBF with Resolution

Crossing-Optimal Extension of Simple Drawings

Computing Optimal Hypertree Decompositions with SAT

48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal and Emanuela Merelli and James Worrell), volume 198 of LIPIcs, pages 72:1-72:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Andre Schidler, Stefan Szeider

Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou), 2021.

Computing Kemeny Rankings from d-Euclidean Preferences

Thekla Hamm, Martin Lackner, Anna Rapberger

Algorithmic Decision Theory - 7th International Conference, ADT 2021, Toulouse, France, November 3-5, 2021, Proceedings, volume 13023 of Lecture Notes in Computer Science, pages 147-161, 2021, Springer.

ClusterSets: Optimizing Planar Clusters in Categorical Point Data

Geiger, Jakob, Cornelsen, Sabine, Haunert, Jan-Henrik, Kindermann, Philipp, Mchedlidze, Tamara, Martin Nöllenburg, Okamoto, Yoshio, Wolff, Alexander

Computer Graphics Forum, volume 40, number 3, pages 471-481, 2021.

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.

Certified DQBF Solving by Definition Extraction

Balanced Independent and Dominating Sets on Colored Interval Graphs

Bhore, Sujoy, Haunert, Jan-Henrik, Klute, Fabian, Li, Guangping, Martin Nöllenburg

Theory and Practice of Computer Science (SOFSEM'21) (Bureš, Tomáš and Dondi, Riccardo and Gamper, Johann and Guerrini, Giovanna and Jurdziński, Tomasz and Pahl, Claus and Sikora, Florian and Wong, Prudence), volume 12607 of LNCS, pages 89-103, 2021, Springer.

Backdoor DNFs

Sebastian Ordyniak, Andre Schidler, Stefan Szeider

Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou), pages 1403-1409, 2021.

Backdoor DNFs

Sebastian Ordyniak, André Schidler, Stefan Szeider

2021, Technical report AC-TR-21-001, Algorithms and Complexity Group, TU Wien.

Approximate Evaluation of First-Order Counting Queries

Jan Niclas Dreier, Rossmanith, Peter

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2021, SIAM.

A*-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem

Matthias Horn, Johannes Maschler, Günther Raidl, Elina Rönnberg

Computers & Operations Research, volume 126, number 105125, 2021.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf

A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

Matthias Horn, Günther Raidl, Elina R\n̈nberg

Annals of Operations Research, volume 302, pages 477-501, 2021.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf

A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications

Thomas Jatschka, Günther Raidl, Tobias Rodemann

Algorithms, volume 14, number 8, pages 232, 2021.

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.

Casual Employee Scheduling with Constraint Programming and Metaheuristics

Stephan Teuschl

November 2020, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and N. Frohner

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

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

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

VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points

Jatschka, Thomas, Rodemann, Tobias, Günther Raidl

Computer Aided Systems Theory – EUROCAST 2019, volume 12013 of LNCS, pages 255-262, 2020, Springer.

Using decomposition-parameters for QBF: Mind the prefix!

Towards Faster Reasoners by Using Transparent Huge Pages

J. Comput. Syst. Sci., volume 110, pages 1-21, 2020.

Johannes Klaus Fichte and Norbert Manthey and Julian Stecklina and André Schidler

Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, volume 12333 of Lecture Notes in Computer Science, pages 304-322, 2020, Springer.

Towards Data-Driven Multilinear Metro Maps

Nickel, Soeren, Martin Nöllenburg

Diagrammatic Representation and Inference (DIAGRAMS'20) (Pietarinen, Ahti-Veikko and Chapman, Peter and Bosveld de Smet, Leonie and Giardino, Valeria and Corter, James and Linker, Sven), volume 12169 of LNAI, pages 153-161, 2020, Springer.

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.

Threshold Treewidth and Hypertree Width

Robert Ganian, Andre Schidler, Manuel Sorge

2020, Technical report AC-TR-20-005, Algorithms and Complexity Group, TU Wien.

The Turing Test for Graph Drawing Algorithms

Purchase, Helen C., Archambault, Daniel, Kobourov, Stephen, Martin Nöllenburg, Pupyrev, Sergey, Wu, Hsiang-Yun

Graph Drawing and Network Visualization (GD'20) (Auber, David and Valtr, Pavel), volume 12590 of LNCS, pages 466-481, 2020, Springer.

The Complexity Landscape of Resource-Constrained Scheduling

Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere), pages 1741-1747, 2020, ijcai.org.

String Factorizations Under Various Collision Constraints

Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina and Martina Seidl), volume 12178 of Lecture Notes in Computer Science, pages 394-411, 2020, Springer Verlag.

Niels Grüttemeier and Christian Komusiewicz and Nils Morawietz and Frank Sommer

31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark (Inge Li Gørtz and Oren Weimann), volume 161 of LIPIcs, pages 17:1-17:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP

Jiehua Chen

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere), pages 146-152, 2020, ijcai.org.

Solving the Steiner Tree Problem with few Terminals

Johannes Klaus Fichte and Markus Hecher and André Schidler

32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pages 293-300, 2020, IEEE.

Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem

Christian Blum, Marko Djukanovic, Alberto Santini and Hua Jiang, Chu-Min Li, Felipe Manya, Günther Raidl

Computers & Operations Research, volume 125, number 105089, 2020.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf

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 Raidl

2020, Technical report AC-TR-20-003, Algorithms and Complexity Group, TU Wien.

Short Q-Resolution Proofs with Homomorphisms

Ankit Shukla, Friedrich Slivovsky, Stefan Szeider

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.

Route Schematization with Landmarks

Galvão, Marcelo, Krukar, Jakub, Martin Nöllenburg, Schwering, Angela

J. Spatial Information Science, volume 21, 2020.

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs

Nils Morawietz and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer

SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings (Alexander Chatzigeorgiou and Riccardo Dondi and Herodotos Herodotou and Christos A. Kapoutsis and Yannis Manolopoulos and George A. Papadopoulos and Florian Sikora), volume 12011 of Lecture Notes in Computer Science, pages 248-259, 2020, Springer.

Placing Labels in Road Maps: Algorithms and Complexity

Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg

Algorithmica, volume 82, pages 1881-1908, 2020.

Parameterized Complexity of Envy-Free Resource Allocation in Social Networks

The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 7135-7142, 2020, AAAI Press.

Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber and Pavel Valtr), volume 12590 of Lecture Notes in Computer Science, pages 40-54, 2020, Springer.

Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'20) (Auber, David and Valtr, Pavel), volume 12590 of LNCS, pages 40-54, 2020, Springer.

Parameterized algorithms for Module Map problems

Frank Sommer and Christian Komusiewicz

DAM, volume 283, pages 396-416, 2020.

Parameterized Algorithms for Book Embedding Problems

Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg

J. Graph Algorithms Appl., volume 24, number 4, pages 603-620, 2020.

On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences

Horn, Matthias, Djukanovic, Marko, Blum, Christian, Günther Raidl

Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 134-149, 2020, Springer.

On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank

Robert Ganian, Iyad Kanj, 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.

On the Parameterized Complexity of Clustering

Robert Ganian, Iyad Kanj, Stefan Szeider

2020, Technical report AC-TR-20-002, Algorithms and Complexity Group, TU Wien.

On Solving a Generalized Constrained Longest Common Subsequence Problem

Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum

On Existential MSO and Its Relation to ETH

On Covering Segments with Unit Intervals

ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1-22:32, 2020.

Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness

37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Christophe Paul and Markus Bläser), volume 154 of LIPIcs, pages 13:1-13:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Matthias Schlaipfer and Friedrich Slivovsky and Georg Weissenbacher and Florian Zuleger

Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference (Luca Pulina and Martina Seidl), volume 12178 of Lecture Notes in Computer Science, pages 429-446, 2020, Springer.

Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers

Nikolaus Frohner, Günther Raidl

Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia and Panos Pardalos and Renato Umeton and Giovanni Giuffrida and Vincenzo Sciacca), volume 11943 of LNCS, pages 445-457, 2020, Springer.

MaxSAT-Based Postprocessing for Treedepth

MaxSAT-Based Postprocessing for Treedepth

Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 478-495, 2020, Springer Verlag.

Vaidyanathan P. R., Stefan Szeider

2020, Technical report AC-TR-20-009, Algorithms and Complexity Group, TU Wien.

Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size

Jan Niclas 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.

Manipulating Districts to Win Elections: Fine-Grained Complexity

Eduard Eiben and Fedor v. Fomin and Fahad Panolan and Kirill Simonov

The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 1902-1909, 2020, AAAI Press.

Low-Rank Binary Matrix Approximation in Column-Sum Norm

Fedor v. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) (Jarosław Byrka and Raghu Meka), volume 176 of Leibniz International Proceedings in Informatics (LIPIcs), pages 32:1-32:18, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.

Layered Fan-Planar Graph Drawings

Biedl, Therese, Chaplick, Steven, Kaufmann, Michael, Montecchiani, Fabrizio, Martin Nöllenburg, Raftopoulou, Chrysanthi

Mathematical Foundations of Computer Science (MFCS'20) (Esparza, Javier and Král’, Daniel), volume 170 of LIPIcs, pages 14:1-14:13, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Labeling Nonograms

Löffler, Maarten, Martin Nöllenburg

European Workshop on Computational Geometry (EuroCG'20), pages 71:1-71:8, 2020.

Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing

Friedrich Slivovsky

Computer Aided Verification - 32nd International Conference, CAV 2020 (Shuvendu K. Lahiri and Chao Wang), volume 12224 of Lecture Notes in Computer Science, pages 508-528, 2020, Springer Verlag.

Hard QBFs for Merge Resolution

Hard Problems on Random Graphs

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 and Sunil Simon), volume 182 of LIPIcs, pages 12:1-12:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Jan Niclas 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.

Geometric Planar Networks on Bichromatic Points

Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Martin Nöllenburg

Algorithms and Discrete Applied Mathematics (CALDAM'20) (Changat, Manoj and Das, Sandip), volume 12016 of LNCS, pages 79-91, 2020, Springer.

Formalizing Graph Trail Properties in Isabelle/HOL

Formalizing Graph Trail Properties in Isabelle/HOL

Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings (Christoph Benzmüller and Bruce R. Miller), volume 12236 of Lecture Notes in Computer Science, pages 190-205, 2020, Springer Verlag.

Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada

2020, Technical report AC-TR-20-012, Algorithms and Complexity Group, TU Wien.

Fixed-Parameter Tractability of Dependency QBF with Structural Parameters

Discr. Appl. Math., volume 278, pages 1-2, 2020.

Fixed-Parameter Tractability of Dependency QBF with Structural Parameters

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese and Esra Erdem and Michael Thielscher), pages 392-402, 2020.

Robert Ganian, Tomas Peitl, Friedrich Slivovsky, Stefan Szeider

2020, Technical report AC-TR-20-011, Algorithms and Complexity Group, TU Wien.

FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems

Christian Komusiewicz and Frank Sommer

Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020 (Guy E. Blelloch and Irene Finocchi), pages 12-26, 2020, SIAM.

First-Order Model-Checking in Random Graphs and Complex Networks

Jan Niclas 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.

Finding the Hardest Formulas for Resolution

Tomas Peitl, Stefan Szeider

Finding the Hardest Formulas for Resolution

Tomas Peitl, Stefan Szeider

2020, Technical report AC-TR-20-008, Algorithms and Complexity Group, TU Wien.

Finding Longest Common Subsequences: New anytime A$^*$ Search Results

Extending Partial 1-Planar Drawings

Applied Soft Computing, volume 95, number 106400, 2020.

Eiben, Eduard, Robert Ganian, Hamm, Thekla, Klute, Fabian, Martin Nöllenburg

Automata, Languages, and Programming (ICALP'20) (Artur Czumaj and Anuj Dawar and Emanuela Merelli), volume 168 of LIPIcs, pages 43:1-43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.

Extending Partial 1-Planar Drawings

Extending Nearly Complete 1-Planar Drawings in Polynomial Time

47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj and Anuj Dawar and Emanuela Merelli), volume 168 of LIPIcs, pages 43:1-43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Eiben, Eduard, Robert Ganian, Hamm, Thekla, Klute, Fabian, Martin Nöllenburg

Mathematical Foundations of Computer Science (MFCS'20) (Esparza, Javier and Král’, Daniel), volume 170 of LIPIcs, pages 31:1-31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Extending Nearly Complete 1-Planar Drawings in Polynomial Time

45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza and Daniel Král’), volume 170 of LIPIcs, pages 31:1-31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Exploiting c-Closure in Kernelization Algorithms for Graph Problems

Tomohiro Koana and Christian Komusiewicz and Frank Sommer

28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference) (Fabrizio Grandoni and Grzegorz Herman and Peter Sanders), volume 173 of LIPIcs, pages 65:1-65:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Distributing Battery Swapping Stations for Electric Scooters in an Urban Area

Jatschka, Thomas, Oberweger, Fabio F., Rodemann, Tobias, Günther Raidl

Optimization and Applications, Proceedings of OPTIMA~2020 – XI International Conference Optimization and Applications (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 150-165, 2020, Springer.

Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem

Matthias Horn, Günther Raidl

Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz and Franz Pichler and Alexis Quesada-Arencibia), volume 12013 of LNCS, pages 344-351, 2020, Springer.

Crossing Layout in Non-planar Graphs

Computing Optimal Hypertree Decompositions

Chapter in Beyond Planar Graphs (Hong, Seok-Hee and Tokuyama, Takeshi), pages 187-209, 2020, Springer Nature Singapore.

Computing Optimal Hypertree Decompositions

Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments (Guy Blelloch and Irene Finocchi), pages 1-11, 2020, SIAM.

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

2020, Technical report AC-TR-20-001, Algorithms and Complexity Group, TU Wien.

Tomohiro Koana and Christian Komusiewicz and Frank Sommer

31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (Yixin Cao and Siu-Wing Cheng and Minming Li), volume 181 of LIPIcs, pages 20:1-20:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Complexity of independency and cliquy trees

Nils Morawietz and Niels Grüttemeier and Christian Komusiewicz and Frank Sommer

Discr. Appl. Math., volume 272, pages 2-15, 2020.

Colored Cut Games

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 and Sunil Simon), volume 182 of LIPIcs, pages 30:1-30:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Casual Employee Scheduling with Constraint Programming and Metaheuristics

Nikolaus Frohner, Stephan Teuschl, Günther Raidl

Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz and Franz Pichler and Alexis Quesada-Arencibia), volume 12013 of LNCS, pages 279-287, 2020, Springer.

Building Large k-Cores from Sparse Graphs

Fedor v. Fomin, Danil Sagunov, Kirill Simonov

45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) (Javier Esparza and Daniel Kráľ), volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35:1-35:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.

Breaking Symmetries with RootClique and LexTopsort

Breaking Symmetries with RootClique and LexTopsort

Balanced Independent and Dominating Sets on Colored Interval Graphs

2020, Technical report AC-TR-20-010, Algorithms and Complexity Group, TU Wien.

Bhore, Sujoy, Haunert, Jan-Henrik, Klute, Fabian, Li, Guangping, Martin Nöllenburg

European Workshop on Computational Geometry (EuroCG'20), pages 66:1-66:6, 2020.

Anytime Algorithms for the Longest Common Palindromic Subsequence Problem

An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem

Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier.

Riedler, Martin, Jatschka, Thomas, Maschler, Johannes, Günther Raidl

International Transactions in Operational Research, January 2020.

An Efficient Algorithm for Counting Markov Equivalent DAGs

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling

The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136-10143, 2020, AAAI Press.

Bhore, Sujoy, Li, Guangping, Martin Nöllenburg

Algorithms (ESA'20) (Grandoni, Fabrizio and Sanders, Peter and Herman, Grzegorz), volume 173 of LIPIcs, pages 19:1-19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

An A* Search Algorithm for the Constrained Longest Common Subsequence Problem

Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum

2020, Technical report AC-TR-20-004, Algorithms and Complexity Group, TU Wien.

An A* Search Algorithm for the Constrained Longest Common Subsequence Problem

Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum

Information Processing Letters, volume 166, number 106041, 2020.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf

A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem

Kaufmann, Thomas, Horn, Matthias, Günther Raidl

Proceedings of PPSN XVI: Parallel Problem Solving from Nature (Bäck, Thomas and Preuss, Mike and Deutz, André and Wang, Hao and Doerr, Carola and Emmerich, Michael and Trautmann, Heike), volume 12270 of LNCS, pages 385-398, 2020, Springer.

A Unified Model and Algorithms for Temporal Map Labeling

Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg

Algorithmica, volume 82, pages 2709-2736, 2020.

A Time Leap Challenge for SAT-Solving

A Survey on Transit Map Layout -- from Design, Machine, and Human Perspectives

Wu, Hsiang-Yun, Niedermann, Benjamin, Takahashi, Shigeo, Roberts, Maxwell J., Martin Nöllenburg

Computer Graphics Forum, volume 39, number 3, pages 619-646, 2020.

A Model for Finding Transition-Minors

Benedikt Klocker, Herbert Fleischner, Günther Raidl

Discrete Applied Mathematics, volume 228, pages 242-264, 2020.

A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three

Benedikt Klocker, Herbert Fleischner, Günther Raidl

Applied Mathematics and Computation, volume 380, number 125233, 2020.

A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources

A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth

09 2020, Presentation, CPAIOR2020.

Friedrich Slivovsky, Stefan Szeider

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.

A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility

Nikolaus Frohner, Günther Raidl

Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2020: Volume I (Patrick De Causmaecker and Ender Özcan and Greet Vanden Berghe), 2020.

A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation

Djukanovic, Marko, Günther Raidl, Blum, Christian

Proceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science (Nicosia, Giuseppe and Pardalos, Panos and Giuffrida, Giovanni and Umeton, Renato and Sciacca, Vincenzo), volume 11943 of LNCS, pages 154-167, 2020, Springer.

A Beam Search Approach to the Traveling Tournament Problem

Nikolaus Frohner, Bernhard Neumann, Günther Raidl

Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020 (Luís Paquete and Christine Zarges), volume 12102 of LNCS, pages 67-82, 2020, Springer.

A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem

Thomas Kaufmann

December 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and M. Horn

Perfect Pseudo Matchings on Snarks

Benjamin Schwendinger

May 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Benedikt Klocker

April 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl

Patient Scheduling in Particle Therapy

Johannes Maschler

March 2019, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by G.~R.~Raidl

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

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

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

VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points

Towards Improving Merging Heuristics for Binary Decision Diagrams

Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia and others), pages 70-71, February 2019.

Nikolaus Frohner, Günther Raidl

Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis and Yannis Marinakis and Panos Pardalos), volume 11968 of LNCS, pages 30-45, 2019, Springer.

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 and Dimitrios M. Thilikos), pages 190-204, 2019.

The Parameterized Complexity of Cascading Portfolio Scheduling

Eduard Eiben, Robert Ganian, Stefan Szeider

Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d’Alché-Buc and Emily B. Fox and Roman Garnett), pages 7666-7676, 2019.

The Parameterized Complexity of Cascading Portfolio Scheduling

Eduard Eiben, Robert Ganian, Stefan Szeider

2019, Technical report AC-TR-19-009, Algorithms and Complexity Group, TU Wien.

The Complexity of Packing Edge-Disjoint Paths

Jan Niclas 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.

Strategies for Iteratively Refining Layered Graph Models

Martin Riedler, Mario Ruthmair, Günther Raidl

Hybrid Metaheuristics: 11th International Workshop, HM 2019 (Blesa Aguilera, M. J. and Blum, C. and Gambini Santos, H. and Pinacho-Davidson, P. and Godoy del Campo, J.), volume 11299 of LNCS, pages 46-62, 2019, Springer.

Solving integer quadratic programming via explicit and structural restrictions

Eduard Eiben, Robert Ganian, Dusan Knop and Sebastian Ordyniak

The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 (Pascal Van Hentenryck and Zhi-Hua Zhou), pages 1477-1484, 2019.

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey

Snarks with Special Spanning Trees

Algorithms, volume 12, number 12, pages 248, 2019.

Hoffmann-Ostenhof, Arthur, Jatschka, Thomas

Graphs and Combinatorics, volume 35, number 1, pages 207–219, 2019, Springer.

Shrub-Depth: Capturing Height of Dense Graphs

Robert Ganian, Petr Hlinen ́Y, Jaroslav Nesetril, Jan Obdrz\ĺek, Patrice Ossona De Mendez

Logical Methods in Computer Science, 2019.

Short Plane Supports for Spatial Hypergraphs

Castermans, Thom, Van Garderen, Mereke, Meulemans, Wouter, Martin Nöllenburg, Hai Xia

J. Graph Algorithms Appl., volume 23, number 3, pages 463-498, 2019.

SAT-Encodings for Treecut Width and Treedepth

Robert Ganian, Neha Lodha, Stefan Szeider

Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov and Henning Meyerhenke), pages 117-129, 2019, SIAM.

SAT-Encodings for Treecut Width and Treedepth

Robert Ganian, Neha Lodha, Stefan Szeider

2019, Technical report AC-TR-19-001, Algorithms and Complexity Group, TU Wien.

Refined Complexity of PCA with Outliers

Kirill Simonov and Fedor v. Fomin and Petr A. Golovach and Fahad Panolan

Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Kamalika Chaudhuri and Ruslan Salakhutdinov), volume 97 of Proceedings of Machine Learning Research, pages 5818-5826, 2019, PMLR.

Proof Complexity of Fragments of Long-Distance Q-resolution

Proof Complexity of Fragments of Long-Distance Q-resolution

Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota and Inês Lynce), volume 11628 of Lecture Notes in Computer Science, pages 319-335, 2019, Springer Verlag.

Planar Drawings of Fixed-Mobile Bigraphs

2019, Technical report AC-TR-19-004, Algorithms and Complexity Group, TU Wien.

Bekos, Michael A., De Luca, Felice, Didimo, Walter, Mchedlidze, Tamara, Martin Nöllenburg, Symvonis, Antonios, Tollis, Ioannis

Theoretical Computer Science, volume 795, pages 408-419, 2019.

Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses

Nesic, Aleksandar, Blaicher, Matthias, Hoose, Tobias, Hofmann, Andreas, Lauermann, Matthias, Kutuvantavida, Yasar, Martin Nöllenburg, Randel, Sebastian, Freude, Wolfgang, Koos, Christian

Optics Express, volume 27, number 12, pages 17402-17425, 2019.

Parameterized Complexity of Asynchronous Border Minimization

Martin Kronegger

Algorithmica, volume 81, number 1, pages 201-223, 2019.

Parameterized Algorithms for Book Embedding Problems

Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 365-378, 2019, Springer.

Parameterized Algorithms for Book Embedding Problems

On the Readability of Leaders in Boundary Labeling

Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault and Csaba D. Tóth), volume 11904 of Lecture Notes in Computer Science, pages 365-378, 2019, Springer.

Barth, Lukas, Gemsa, Andreas, Niedermann, Benjamin, Martin Nöllenburg

Information Visualization, volume 18, number 1, pages 110-132, 2019.

On the Parameterized Complexity of (k,s)-SAT

Daniël~Paulusma, Stefan Szeider

Information Processing Letters, volume 143, pages 34-36, 2019.

On the Complexity Landscape of Connected f-Factor Problems

On Strict (Outer-)Confluent Graphs

Algorithmica, volume 81, number 6, pages 2606-2632, 2019.

Förster, Henry, Robert Ganian, Klute, Fabian, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 147-161, 2019, Springer.

On Strict (Outer-)Confluent Graphs

Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

Motif Counting in Preferential Attachment Graphs

2019, Technical report AC-TR-19-003, Algorithms and Complexity Group, TU Wien.

Mixed Linear Layouts: Complexity, Heuristics, and Experiments

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.

De Col, Philipp, Klute, Fabian, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 460-467, 2019, Springer.

Minimizing crossings in constrained two-sided circular graph layouts

Günther Raidl, Jakob Puchinger, Christian Blum

J. Computational Geometry, volume 10, number 2, pages 45-69, 2019.

Metaheuristic Hybrids

Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), pages 385-417, 2019, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf

Metabopolis: scalable network layout for biological pathway diagrams in urban map style

Wu, Hsiang-Yun, Martin Nöllenburg, Sousa, Filipa L., Viola, Ivan

BMC Bioinformatics, volume 20, pages 187, 2019.

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 and Pinar Heggernes and Joost-Pieter Katoen), pages 42:1-42:15, 2019.

Maximizing Ink in Partial Edge Drawings of k-plane Graphs

Hummel, Matthias, Klute, Fabian, Nickel, Soeren, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 323-336, 2019, Springer.

Long-Distance Q-Resolution with Dependency Schemes

Lombardi Drawings of Knots and Links

Journal of Automated Reasoning, volume 63, number 1, pages 127-155, 2019.

Kindermann, Philipp, Kobourov, Stephen, Löffler, Maarten, Martin Nöllenburg, Schulz, André, Vogtenhuber, Birgit

J. Computational Geometry, volume 10, number 1, pages 444-476, 2019.

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.

Integer Programming and Incidence Treedepth

Hardness of FO Model-Checking on Random Graphs

Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings (Andrea Lodi and Viswanath Nagarajan), volume 11480 of Lecture Notes in Computer Science, pages 194-204, 2019, Springer.

Guidelines for Experimental Algorithmics: A Case Study in Network Analysis

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.

Eugenio Angriman, Van Der Grinten, Alexander, Von Looz, Moritz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas

Algorithms, volume 12, number 7, pages 127:1-127:37, 2019.

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 and Ola Svensson and Grzegorz Herman), pages 48:1-48:16, 2019.

Finding Longest Common Subsequences: New A* Anytime Results

Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time

2019, Technical report AC-TR-19-008, Algorithms and Complexity Group, TU Wien.

Thekla Hamm

14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany (Bart M. P. Jansen and Jan Arne Telle), volume 148 of LIPIcs, pages 20:1-20:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

External Labeling Techniques: A Taxonomy and Survey

Bekos, Michael A., Niedermann, Benjamin, Martin Nöllenburg

Computer Graphics Forum, volume 38, number 3, pages 833-860, 2019.

Exploring Semi-Automatic Map Labeling

Klute, Fabian, Li, Guangping, Löffler, Raphael, Martin Nöllenburg, Schmidt, Manuela

Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13-22, 2019, ACM.

Exact Approaches for Network Design Problems with Relays

Leitner, M., Ljubić, I., Riedler, M., Ruthmair, M.

INFORMS Journal on Computing, volume 31, number 1, pages 171-192, 2019.

Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison

Proceedings of LION~12 – the 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199-214, 2019, Springer.

Christian Komusiewicz and Frank Sommer

SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings (Barbara Catania and Rastislav Královic and Jerzy R. Nawrocki and Giovanni Pighizzini), volume 11376 of Lecture Notes in Computer Science, pages 272-284, 2019, Springer.

Efficient Segment Folding is Hard

Horiyama, Takashi, Klute, Fabian, Korman, Matias, Parada, Irene, Uehara, Ryuhei, Yamanaka, Katsuhisa

Canadian Conference on Computational Geometry (CCCG'19), pages 177-183, 2019.

Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks

Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anaïs Villedieu

IFIP Networking Conference (Networking'19), pages 1-9, 2019, IEEE.

Destroying Bicolored $P_3$s by Deleting Few Edges

Niels Grüttemeier and Christian Komusiewicz and Jannik Schestag and Frank Sommer

Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings (Florin Manea and Barnaby Martin and Daniël Paulusma and Giuseppe Primiero), volume 11558 of Lecture Notes in Computer Science, pages 193-204, 2019, Springer.

Dependency Learning for QBF

Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem

Journal of Artificial Intelligence Research, volume 65, pages 180-208, 2019.

Matthias Horn, Günther Raidl

Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia and others), pages 94-95, 2019.

Counting linear extensions: Parameterizations by treewidth

Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak

Algorithmica, 2019.

Computing Stable Demers Cartograms

Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Chimani, Markus, Kobourov, Stephen, Peltonen, Jaakko, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 46-60, 2019, Springer.

Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy

Combining Resolution-Path Dependencies with Dependency Learning

MDPI Algorithms, volume 12, number 9, pages 1-28, 2019.

Combining Resolution-Path Dependencies with Dependency Learning

Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization

2019, Technical report AC-TR-19-005, Algorithms and Complexity Group, TU Wien.

Nikolaus Frohner, Stephan Teuschl, Günther Raidl

Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia and others), pages 78-79, 2019.

Approximation Algorithms for BalancedCC Multiwinner Rules

Markus Brill and Piotr Faliszewski and Frank Sommer and Nimrod Talmon

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS ‘19, Montreal, QC, Canada, May 13-17, 2019 (Edith Elkind and Manuela Veloso and Noa Agmon and Matthew E. Taylor), pages 494-502, 2019, International Foundation for Autonomous Agents and Multiagent Systems.

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.

A SAT Approach to Branchwidth

A SAT Approach to Branchwidth

2019, Technical report AC-TR-19-010, Algorithms and Complexity Group, TU Wien.

A SAT Approach for Finding Sup-Transition-Minors

ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1-15:24, 2019.

Benedikt Klocker, Herbert Fleischner, Günther Raidl

Learning and Intelligent Optimization. LION~2019, volume 11968 of LNCS, pages 325-341, 2019, Springer.

A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems

Christian Kloimüllner, Günther Raidl

Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, and Yannis Marinakis and Panos Pardalos), volume 11968 of LNCS, pages 184-200, 2019, Springer.

A Memetic Algorithm for Competitive Facility Location Problems

Benjamin Biesinger, Bin Hu, Günther Raidl

Chapter in Business and Consumer Analytics: New Ideas, pages 637-660, 2019, Springer.

A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three

Benedikt Klocker, Herbert Fleischner, Günther Raidl

2019, Technical report AC-TR-19-007, Algorithms and Complexity Group, TU Wien.

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 and Simon de Givry), volume 11802 of Lecture Notes in Computer Science, pages 195-212, 2019, Springer Verlag.

A Join-Based Hybrid Parameter for Constraint Satisfaction

Robert Ganian, Sebastian Ordyniak, Stefan Szeider

2019, Technical report AC-TR-19-006, Algorithms and Complexity Group, TU Wien.

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem

A Heuristic Approach for Solving the Longest Common Square Subsequence Problem

Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019), 2019.
Note: accepted for presentation

Djukanovic, Marko, Günther Raidl, Blum, Christian

Proceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 12013 of LNCS, pages 429-437, 2019, Springer.

A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications

A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem

Evolutionary Computation in Combinatorial Optimization (Liefooghe, Arnaud and Paquete, Luís), volume 11452 of LNCS, pages 1-16, 2019, Springer.

Blum, Christian, Thiruvady, Dhananjay, Ernst, Andreas T., Horn, Matthias, Günther Raidl

Proceedings of AI 2019: Advances in Artificial Intelligence (Liu, Jixue and Bailey, James), volume 11919 of LNCS, pages 549-560, 2019, Springer.

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

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

Monero Chross-Chain Traceability

Abraham Hinteregger

September 2018, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl

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

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

Unary Integer Linear Programming with Structural Restrictions

Towards Characterizing Strict Outerconfluent Graphs

Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 1284-1290, 2018, ijcai.org.

The complexity landscape of decompositional parameters for ILP

Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 612-614, 2018, Springer.

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

Artificial Intelligence, volume 257, pages 61-71, 2018.

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 and Éric Grégoire and Miltiadis Alamaniotis), pages 733-737, 2018, IEEE.

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

Robert Ganian, Eun Jung Kim, Stefan Szeider

2018, Technical report AC-TR-18-007, Algorithms and Complexity Group, TU Wien.

Solving Problems on Graphs of High Rank-Width

Eduard Eiben, Robert Ganian, Stefan Szeider

Algorithmica, volume 80, number 2, pages 742-771, 2018.

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Klocker, Benedikt, Günther Raidl

Computer Aided Systems Theory – EUROCAST 2017, Part I (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 10671 of LNCS, pages 355-363, 2018, Springer.

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.

Small Resolution Proofs for QBF using Dependency Treewidth

Eduard Eiben, Robert Ganian

35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier and Brigitte Vall ́ee), volume 96 of LIPIcs, pages 28:1-28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Short Plane Supports for Spatial Hypergraphs

Casterman, Thom, Van Garderen, Mereke, Meulemans, Wouter, Martin Nöllenburg, Hai Xia

Graph Drawing and Network Visualization (GD'18) (Biedl, Therese and Kerren, Andreas), volume 11282 of LNCS, pages 53-66, 2018, Springer International Publishing.

Semi-Automated Location Planning for Urban Bike-Sharing Systems

Markus Straub, Christian Rudloff, Anita Graser, Christian Kloimüllner, Günther Raidl, Markus Pajones, Felix Beyer

Proceedings of the 7th Transport Research Arena (TRA~2018), pages 1-10, 2018.

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.

QBF Encodings of Chess Problems

Portfolio-Based Algorithm Selection for Circuit QBFs

2018, Technical report AC-TR-18-013, Algorithms and Complexity Group, TU Wien.

Holger H. Hoos, Tomas Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker), volume 11008 of Lecture Notes in Computer Science, pages 195-209, 2018, Springer Verlag.

Portfolio-Based Algorithm Selection for Circuit QBFs

Holger H. Hoos, Tomas Peitl, Friedrich Slivovsky, Stefan Szeider

2018, Technical report AC-TR-18-004, Algorithms and Complexity Group, TU Wien.

Portfolio-Based Algorithm Selection for Circuit QBFs

Hoos, Holger H., Tomas Peitl, Slivovsky, Friedrich, Stefan Szeider

QBF Workshop, 2018.

Portfolio Solvers for QDIMACS and QCIR

Hoos, Holger H., Tomas Peitl, Stefan Szeider

Note: QBF Evaluation at SAT

Polynomial-Time Validation of QCDCL Certificates

Polynomial-Time Validation of QCDCL Certificates

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 and Christoph M. Wintersteiger), volume 10929 of Lecture Notes in Computer Science, pages 253-269, 2018, Springer Verlag.

Planar L-Drawings of Directed Graphs

2018, Technical report AC-TR-18-003, Algorithms and Complexity Group, TU Wien.

Chaplick, Steven, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Martin Nöllenburg, Patrignani, Maurizio, Tollis, Ioannis G., Wolff, Alexander

Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 465-478, 2018, Springer.

Planar Drawings of Fixed-Mobile Bigraphs

Bekos, Michael, De Luca, Felice, Didimo, Walter, Mchedlidze, Tamara, Martin Nöllenburg, Symvonis, Antonios, Tollis, Ioannis G.

Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 426-439, 2018, Springer.

Planar and poly-arc Lombardi drawings

Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Löffler, Maarten, Martin Nöllenburg

J. Computational Geometry, volume 9, number 1, pages 328-355, 2018.

Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments

Parameterized Algorithms for the Matrix Completion Problem

2018, Technical report AC-TR-18-005, Algorithms and Complexity Group, TU Wien.

Robert Ganian, Iyad Kanj, 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

Parameterized Algorithms for Module Map Problems

Frank Sommer and Christian Komusiewicz

Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers (Jon Lee and Giovanni Rinaldi and Ali Ridha Mahjoub), volume 10856 of Lecture Notes in Computer Science, pages 376-388, 2018, Springer.

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

Argyriou, Evmorfia, Cornelsen, Sabine, Förster, Henry, Kaufmann, Michael, Martin Nöllenburg, Okamoto, Yoshio, Raftopoulou, Chrysanthi, Wolff, Alexander

Graph Drawing and Network Visualization (GD'18) (Biedl, Therese and Kerren, Andreas), volume 11282 of LNCS, pages 509-523, 2018, Springer International Publishing.

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.

On the complexity of rainbow coloring problems

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

Discr. Appl. Math., volume 246, pages 38-48, 2018.

Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem

35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier and Brigitte Vall ́ee), volume 96 of LIPIcs, pages 33:1-33:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Minimzing Wiggles in Storyline Visualizations

PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 375-397, 2018.

Fröschl, Theresa, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 585-587, 2018, Springer.

Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts

Meta-kernelization using well-structured modulators

Computational Geometry (SoCG'18) (Speckmann, Bettina and Tóth, Csaba D.), pages 53:1-53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Lombardi Drawings of Knots and Links

Discr. Appl. Math., volume 248, pages 153-167, 2018.

Kindermann, Philipp, Kobourov, Stephen G., Löffler, Maarten, Martin Nöllenburg, Schulz, André, Vogtenhuber, Birgit

Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 113-126, 2018, Springer.

Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applications

GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection

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.

Airam Expósito, Günther Raidl, Julio Brito and José A. Moreno-Pérez

Computer Aided Systems Theory – EUROCAST 2017, Part I (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 10671 of LNCS, pages 299-306, 2018, Springer.

Graph Visualization

Hu, Yifan, Martin Nöllenburg

Chapter in Encyclopedia of Big Data Technologies (Sakr, Sherif and Zomaya, Albert), 2018, Springer International Publishing.

Finding Smooth Graphs with Small Independence Numbers

Klocker, Benedikt, Fleischner, Herbert, Günther Raidl

MOD~2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giuffrida, Giovanni and Nicosia, Giuseppe and Pardalos, Panos and Umeton, Renato), volume 10710 of LNCS, pages 527-539, 2018, Springer.

Experimental Evaluation of Book Drawing Algorithms

Klawitter, Jonathan, Mchedlidze, Tamara, Martin Nöllenburg

Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 224-238, 2018, Springer.

Exact approaches for the directed network design problem with relays

Markus Leitner, Ivana Ljubić, Martin Riedler, Mario Ruthmair

Omega, 2018.

Exact approaches for the directed network design problem with relays

Markus Leitner, Ivana Ljubić, Martin Riedler, Mario Ruthmair

2018, Technical report AC-TR-18-001, Algorithms and Complexity Group, TU Wien.

Drawing Large Graphs by Multilevel Maxent-Stress Optimization

Meyerhenke, Henning, Martin Nöllenburg, Schulz, Christian

IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814-1827, 2018.

Anytime Algorithms for the Longest Common Palindromic Subsequence Problem

An SMT Approach to Fractional Hypertree Width

2018, Technical report AC-TR-18-012, Algorithms and Complexity Group, TU Wien.

An SMT Approach to Fractional Hypertree Width

An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows

2018, Technical report AC-TR-18-006, Algorithms and Complexity Group, TU Wien.

Matthias Horn, Günther Raidl, Elina Rönnberg

PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 235-256, 2018.

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.

A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways

Wu, Hsiang-Yun, Martin Nöllenburg, Viola, Ivan

Eurographics Conference on Visualization (EuroVis'18) – Posters (Puig, Anna and Raidou, Renata), pages 57-59, 2018.

A Structural Approach to Activity Selection

A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion

Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 203-209, 2018, ijcai.org.

A SAT Approach for Finding Sup-Transition-Minors

Journal of Computer and System Sciences, volume 97, pages 121-146, 2018.

Benedikt Klocker, Herbert Fleischner, Günther Raidl

2018, Technical report AC-TR-18-010, Algorithms and Complexity Group, TU Wien.

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.

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

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

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

Minimizing crossings in constrained two-sided circular graph layouts

Towards a Polynomial Kernel for Directed Feedback Vertex Set

European Workshop on Computational Geometry (EuroCG'17), pages 265-268, April 2017.

Moritz Müller, Stefan Szeider

42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark (Kim G. Larsen and Hans L. Bodlaender and Jean-François Raskin), volume 83 of LIPIcs, pages 36:1-36:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

The Treewidth of Proofs

2017, Technical report AC-TR-17-010, Algorithms and Complexity Group, TU Wien.

The Treewidth of Proofs

Moritz Müller, Stefan Szeider

Information and Computation, volume 255, pages 147-164, 2017.

Stable Matching with Uncertain Pairwise Preferences

Haris Aziz, Péter Bir\ ́And Tamas Fleiner, Serge Gaspers, Ronald De Haan, Nicholas Mattei and Baharak Rastegari

Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.

Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm

Petrica C. Pop, Cosmin Sabo, Benjamin Biesinger, Bin Hu, Günther Raidl

Carpathian Journal of Mathematics, volume 33, number 3, pages 365-371, 2017.

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints

Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra), pages 607-613, 2017, ijcai.org.

Klocker, Benedikt, Günther Raidl

Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Quesada-Arencibia, Alexis and Rodríguez, José Carlos and Moreno-D\áz, Roberto), pages 104-105, 2017.

Saving Critical Nodes with Firefighters is FPT

Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan

44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), pages 135:1-135:13, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.

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 and Toby Walsh), volume 10491 of Lecture Notes in Computer Science, pages 429-445, 2017, Springer Verlag.

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.

SAT-Based Local Improvement for Finding Tree Decompositions of Small Width

Johannes K. Fichte, Neha Lodha, Stefan Szeider

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.

Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable

Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381)

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3929-3935, 2017.

volume 7 of Dagstuhl Reports, 2017.

Radial Contour Labeling with Straight Leaders

Niedermann, Benjamin, Martin Nöllenburg, Rutter, Ignaz

IEEE Pacific Visualization Symposium (PacificVis'17), pages 295-304, 2017.

Progress on Partial Edge Drawings

Bruckdorfer, Till, Cornelsen, Sabine, Gutwenger, Carsten, Kaufmann, Michael, Montecchiani, Fabrizio, Martin Nöllenburg, Wolff, Alexander

J. Graph Algorithms Appl., volume 21, number 4, pages 757-786, 2017.

Path-Contractions, Edge Deletions and Connectivity Preservation

Gregory Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström

25th Annual European Symposium on Algorithms (ESA 2017) (Kirk Pruhs and Christian Sohler), volume 87 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1-47:13, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

Martin Nöllenburg, Prutkin, Roman, Rutter, Ignaz

International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121-158, 2017.

Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments

Maschler, Johannes, Riedler, Martin, Günther Raidl

Pareto Optimal Allocation under Uncertain Preferences (Extended Abstract)

Haris Aziz, Ronald De Haan, Baharak Rastegari

Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.
Note: Extended Abstract

Parameterized Complexity of Directed Steiner Tree on Sparse Graphs

Mark Jones and Daniel Lokshtanov and M. S. Ramanujan and Saket Saurabh and Ondrej Suchý

SIAM J. Discrete Math., volume 31, number 2, pages 1294-1327, 2017.

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.

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.

On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances

De Haan, Ronald, Kanj, Iyad, Stefan Szeider

ACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017.

On Structural Parameterizations of the Edge Disjoint Paths Problem

New Width Parameters for Model Counting

28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand (Yoshio Okamoto and Takeshi Tokuyama), volume 92 of LIPIcs, pages 36:1-36:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Robert Ganian, Stefan Szeider

New Width Parameters for Model Counting

Robert Ganian, Stefan Szeider

2017, Technical report AC-TR-17-013, Algorithms and Complexity Group, TU Wien.

Metric Dimension of Bounded Tree-length Graphs

Rémy Belmonte and Fedor v. Fomin and Petr A. Golovach and M. S. Ramanujan

SIAM J. Discrete Math., volume 31, number 2, pages 1217-1243, 2017.

Lossy kernelization

Daniel Lokshtanov and Fahad Panolan and M. S. Ramanujan and Saket Saurabh

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 224-237, 2017.

Long-Distance Q-Resolution with Dependency Schemes