P. G. Drange

Most-cited papers

On the Computational Complexity of Vertex Integrity and Component Order Connectivity
P. G. Drange, Markus S. Dregi, Pim van 't Hof
2014Algorithmica120 citations Open access
Semantic Scholar
A ck n 5-Approximation Algorithm for Treewidth
H. Bodlaender, P. G. Drange, Markus S. Dregi, Fedor V. Fomin +2 more
2016SIAM journal on computing (Print)112 citations Open access
Semantic Scholar
An O(c^k n) 5-Approximation Algorithm for Treewidth
H. Bodlaender, P. G. Drange, Markus S. Dregi, F. Fomin +2 more
2013IEEE Annual Symposium on Foundations of Computer Science95 citations
Semantic Scholar
Kernelization and Sparseness: the case of Dominating Set
P. G. Drange, Markus S. Dregi, F. Fomin, S. Kreutzer +8 more
2014Symposium on Theoretical Aspects of Computer Science64 citations
Semantic Scholar
A Polynomial Kernel for Trivially Perfect Editing
P. G. Drange, Michał Pilipczuk
2014Algorithmica40 citations Open access
Semantic Scholar
On the Threshold of Intractability
P. G. Drange, Markus S. Dregi, D. Lokshtanov, Blair D. Sullivan
2015Embedded Systems and Applications34 citations
Semantic Scholar
Exploring the Subexponential Complexity of Completion Problems
P. G. Drange, F. Fomin, Michał Pilipczuk, Yngve Villanger
2015TOCT27 citations
Semantic Scholar
Exploring Subexponential Parameterized Complexity of Completion Problems
P. G. Drange, F. Fomin, Michał Pilipczuk, Yngve Villanger
2013Symposium on Theoretical Aspects of Computer Science27 citations
Semantic Scholar
On the Computational Complexity of Vertex Integrity and Component Order Connectivity
P. G. Drange, Markus S. Dregi, Pim van 't Hof
2016Algorithmica17 citations
Semantic Scholar
Fast Biclustering by Dual Parameterization
P. G. Drange, F. Reidl, Fernando Sánchez Villaamil, S. Sikdar
2015International Symposium on Parameterized and Exact Computation16 citations
Semantic Scholar
Parameterized Graph Modification Algorithms
P. G. Drange
201510 citations
Semantic Scholar
Cluster Editing with Overlapping Communities
Emmanuel Arrighi, Matthias Bentert, P. G. Drange, Blair D. Sullivan +1 more
2023International Symposium on Parameterized and Exact Computation9 citations
Semantic Scholar
A O(c^k n) 5-Approximation Algorithm for Treewidth
H. Bodlaender, P. G. Drange, Markus S. Dregi, Fedor V. Fomin +2 more
2013arXiv.org7 citations
Semantic Scholar
Compressing Bounded Degree Graphs
P. G. Drange, Markus S. Dregi, R. B. Sandeep
2016Latin American Symposium on Theoretical Informatics5 citations
Semantic Scholar
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
Y. Mizutani, Daniel Coimbra Salomao, A. Crane, Matthias Bentert +4 more
2024arXiv.org3 citations
Semantic Scholar
Identifying parsimonious pathways of accumulation and convergent evolution from binary data
Konstantinos Giannakis, Olav N. L. Aga, Marcus T. Moen, P. G. Drange +1 more
2024bioRxiv3 citations Open access
Semantic Scholar
An FPT Algorithm for Diverse Minimum s-t Cuts
K. Dehaleesan, P. G. Drange, Fedor V. Fomin, P. Golovach +1 more
2026Embedded Systems and Applications2 citations
Semantic Scholar
Computing complexity measures of degenerate graphs
P. G. Drange, P. Greaves, I. Muzi, F. Reidl
2023International Symposium on Parameterized and Exact Computation2 citations Open access
Semantic Scholar
Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
Matthias Bentert, A. Crane, P. G. Drange, Y. Mizutani +1 more
2025arXiv.org1 citations
Semantic Scholar
Cluster Editing with Vertex Splitting
Faisal N. Abu-Khzam, Emmanuel Arrighi, Matthias Bentert, P. G. Drange +6 more
2025Discrete Applied Mathematics1 citations Open access
Semantic Scholar
Correlation Clustering with Vertex Splitting
Matthias Bentert, A. Crane, P. G. Drange, F. Reidl +1 more
2024Scandinavian Workshop on Algorithm Theory1 citations
Semantic Scholar
Harmless Sets in Sparse Classes
P. G. Drange, I. Muzi, F. Reidl
2021International Workshop on Combinatorial Algorithms1 citations Open access
Semantic Scholar
Kernelization and hardness of harmless sets in sparse classes
P. G. Drange, I. Muzi, F. Reidl
2021arXiv.org1 citations
Semantic Scholar
A Polynomial Kernel for Trivially Perfect Editing
P. G. Drange, Michał Pilipczuk
2017Algorithmica1 citations Open access
Semantic Scholar
On the Computational Complexity of Vertex Integrity
P. G. Drange, Markus S. Dregi, Pim van 't Hof
2014arXiv.org1 citations
Semantic Scholar
An Evaluation of Vertex Elimination Strategies for Algorithmic Differentiation
Alexander H. Crane, P. G. Drange, Eli M. Friedman, P. Hovland +5 more
20260 citations
Semantic Scholar
Efficient Trace Frequency Queries in Sparse Graphs
Christine Awofeso, P. G. Drange, P. Greaves, Oded Lachish +1 more
2026Conference on Current Trends in Theory and Practice of Informatics0 citations
Semantic Scholar
Identifying parsimonious pathways of accumulation and convergent evolution from binary data.
Konstantinos Giannakis, Olav N. L. Aga, Marcus T. Moen, P. G. Drange +1 more
2026Systematic Biology0 citations Open access
Semantic Scholar
Overlapping Biclustering
Matthias Bentert, P. G. Drange, E. Haugen
2025Conference on Current Trends in Theory and Practice of Informatics0 citations
Semantic Scholar
Planar Network Diversion
Matthias Bentert, P. G. Drange, Fedor V. Fomin, Steinar Simonnes
2025The Sea0 citations
Semantic Scholar
Discounted Cuts: A Stackelberg Approach to Network Disruption
P. G. Drange, Fedor V. Fomin, P. Golovach, Danil Sagunov
2025AAAI Conference on Artificial Intelligence0 citations
Semantic Scholar
PACE Solver Description: LUNCH - Linear Uncrossing Heuristics
Kenneth Langedal, Matthias Bentert, Thorgal Blanco, P. G. Drange
2024International Symposium on Parameterized and Exact Computation0 citations
Semantic Scholar
PACE Solver Description: Zygosity
Emmanuel Arrighi, P. G. Drange, Kenneth Langedal, Farhad Vadiee +2 more
2023International Symposium on Parameterized and Exact Computation0 citations
Semantic Scholar