Skip to content

Pl Grns Drange

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

13

Venues

9

Active years

2013–2026

Best venue rank

A*

Where they publish

Papers

13 indexed papers, newest first.

YearVenueTitleAuthors
2026AAAIDiscounted Cuts: A Stackelberg Approach to Network Disruption.Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov
2026ESAAn FPT Algorithm for Diverse Minimum s-t Cuts.Krishnan Dehaleesan, Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
2026SOFSEMEfficient Trace Frequency Queries in Sparse Graphs.Christine Awofeso, Pl Grns Drange, Patrick Greaves, Oded Lachish, Felix Reidl
2026SOFSEMOverlapping Biclustering.Matthias Bentert, Pl Grns Drange, Erlend Haugen
2024ICALPTwo-Sets Cut-Uncut on Planar Graphs.Matthias Bentert, Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
2022IWOCAHarmless Sets in Sparse Classes.Pl Grns Drange, Irene Muzi, Felix Reidl
2016LATINCompressing Bounded Degree Graphs.Pl Grns Drange, Markus S. Dregi, R. B. Sandeep
2016STACSKernelization and Sparseness: the Case of Dominating Set.Pl Grns Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Snchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar
2015ESAOn the Threshold of Intractability.Pl Grns Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
2015ESAA Polynomial Kernel for Trivially Perfect Editing.Pl Grns Drange, Michal Pilipczuk
2014ISAACOn the Computational Complexity of Vertex Integrity and Component Order Connectivity.Pl Grns Drange, Markus Sortland Dregi, Pim van 't Hof
2014STACSExploring Subexponential Parameterized Complexity of Completion Problems.Pl Grns Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013FOCSAn O(c^k n) 5-Approximation Algorithm for Treewidth.Hans L. Bodlaender, Pl Grns Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk