Nfpc

Parameterized Algorithms for Book Embedding Problems

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

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

Parameterized Algorithms for Queue Layouts

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

Martin Nöllenburg

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.

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP

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

The Complexity Landscape of Resource-Constrained Scheduling

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

Threshold Treewidth and Hypertree Width

Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898-1904, 2020.

Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider

Using decomposition-parameters for QBF: Mind the prefix!

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

A Join-Based Hybrid Parameter for Constraint Satisfaction

Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex and Simon de Givry), volume 11802 of Lecture Notes in Computer Science, pages 195-212, 2019, Springer Verlag.

Robert Ganian, Sebastian Ordyniak, Stefan Szeider

Counting linear extensions: Parameterizations by treewidth

Algorithmica, 2019.

Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak

Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time

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.