Nfpc

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
Algorithmica, volume 83, number 2, pages 726-752, 2021.
PDF Cite Project
Towards a Polynomial Kernel for Directed Feedback Vertex Set
Algorithmica, volume 83, number 5, pages 1201-1221, 2021.
PDF Cite Project
Worbel: Aggregating Point Labels into Word Clouds
Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021.
PDF Cite Project Project
An Efficient Algorithm for Counting Markov Equivalent DAGs
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136-10143, 2020, AAAI Press.
PDF Cite Project
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.
PDF Cite Project
Extending Partial 1-Planar Drawings
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj and Anuj Dawar and Emanuela Merelli), volume 168 of LIPIcs, pages 43:1-43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF Cite Project
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.
PDF Cite Project Project Project Project
On Covering Segments with Unit Intervals
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Christophe Paul and Markus Bläser), volume 154 of LIPIcs, pages 13:1-13:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF Cite Project
On Existential MSO and Its Relation to ETH
ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1-22:32, 2020.
PDF Cite Project Project Project DOI
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906-3913, 2020, AAAI Press.
PDF Cite Project Project Project