| Publication | Date of Publication | Type |
|---|
| Space-efficient parameterized algorithms on graphs of low shrubdepth | 2025-01-06 | Paper |
The parameterized complexity of the survivable network design problem
Journal of Computer and System Sciences | 2024-12-27 | Paper |
| Complexity framework for forbidden subgraphs III: when problems are tractable on subcubic graphs | 2024-12-03 | Paper |
Maximal induced matchings in \(K_4\)-free and \(K_5\)-free graphs
Discrete Applied Mathematics | 2024-11-06 | Paper |
Parameterized complexity of streaming diameter and connectivity problems
Algorithmica | 2024-10-07 | Paper |
| Planar multiway cut with terminals on few faces | 2024-07-19 | Paper |
| The parameterized complexity of the survivable network design problem | 2024-05-14 | Paper |
Streaming deletion problems Parameterized by vertex cover
Theoretical Computer Science | 2023-10-26 | Paper |
Induced disjoint paths and connected subgraphs for \(H\)-free graphs
Algorithmica | 2023-09-27 | Paper |
Few induced disjoint paths for \(H\)-free graphs
Lecture Notes in Computer Science | 2023-08-03 | Paper |
| Computing Subset Vertex Covers in $H$-Free Graphs | 2023-07-11 | Paper |
Induced disjoint paths and connected subgraphs for \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem | 2023-05-02 | Paper |
| Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs | 2023-05-01 | Paper |
| scientific article; zbMATH DE number 7650231 (Why is no real title available?) | 2023-02-03 | Paper |
| Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision | 2022-11-25 | Paper |
| Complexity Framework For Forbidden Subgraphs I: The Framework | 2022-11-23 | Paper |
Few induced disjoint paths for \(H\)-free graphs
Theoretical Computer Science | 2022-11-17 | Paper |
| Steiner trees for hereditary graph classes | 2022-10-13 | Paper |
| Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes | 2022-07-18 | Paper |
| A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs | 2022-07-18 | Paper |
Streaming deletion problems parameterized by vertex cover
(available as arXiv preprint) | 2022-05-20 | Paper |
Upper bounding rainbow connection number by forest number
Discrete Mathematics | 2022-05-17 | Paper |
| On Geometric Set Cover for Orthants | 2022-05-11 | Paper |
Disjoint paths and connected subgraphs for \(H\)-free graphs
Lecture Notes in Computer Science | 2022-03-22 | Paper |
Few Induced Disjoint Paths for $H$-Free Graphs
(available as arXiv preprint) | 2022-03-07 | Paper |
What Graphs are 2-Dot Product Graphs?
International Journal of Computational Geometry & Applications | 2022-02-01 | Paper |
Disjoint paths and connected subgraphs for \(H\)-free graphs
Theoretical Computer Science | 2021-12-01 | Paper |
Induced disjoint paths in AT-free graphs
Journal of Computer and System Sciences | 2021-11-25 | Paper |
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
SIAM Journal on Discrete Mathematics | 2021-11-04 | Paper |
Algorithms for the rainbow vertex coloring problem on graph classes
Theoretical Computer Science | 2021-09-27 | Paper |
| Rainbow vertex coloring bipartite graphs and chordal graphs | 2021-08-04 | Paper |
Disconnected cuts in claw-free graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
scientific article; zbMATH DE number 7378721 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Subexponential-time algorithms for finding large induced sparse subgraphs
Algorithmica | 2021-07-26 | Paper |
Disjoint Paths and Connected Subgraphs for H-Free Graphs
(available as arXiv preprint) | 2021-05-13 | Paper |
Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Steiner trees for hereditary graph classes: a treewidth perspective
Theoretical Computer Science | 2021-04-15 | Paper |
Disconnected cuts in claw-free graphs
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking
(available as arXiv preprint) | 2020-05-26 | Paper |
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
Algorithmica | 2020-04-14 | Paper |
Solving partition problems almost always requires pushing many vertices around
SIAM Journal on Discrete Mathematics | 2020-03-11 | Paper |
Algorithms for the rainbow vertex coloring problem on graph classes
(available as arXiv preprint) | 2020-03-06 | Paper |
Algorithms and bounds for very strong rainbow coloring
(available as arXiv preprint) | 2020-02-12 | Paper |
Complexity of independency and cliquy trees
Discrete Applied Mathematics | 2019-12-30 | Paper |
Domination when the stars are out
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Network sparsification for Steiner problems on planar and bounded-genus graphs
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Network sparsification for Steiner problems on planar and bounded-genus graphs
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs
Algorithmica | 2019-02-14 | Paper |
Independence and Efficient Domination on P 6 -free Graphs
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Independence and efficient domination on \(P_6\)-free graphs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Polynomial kernels for deletion to classes of acyclic digraphs
Discrete Optimization | 2018-05-24 | Paper |
Disconnected Cuts in Claw-free Graphs
(available as arXiv preprint) | 2018-03-09 | Paper |
| Polynomial kernels for deletion to classes of acyclic digraphs | 2018-01-24 | Paper |
| Co-bipartite neighborhood edge elimination orderings | 2018-01-18 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
| Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs | 2017-10-17 | Paper |
Polynomial kernelization for removing induced claws and diamonds
Theory of Computing Systems | 2017-08-15 | Paper |
Algorithms and Bounds for Very Strong Rainbow Coloring
(available as arXiv preprint) | 2017-03-01 | Paper |
Shortcutting directed and undirected networks with a degree constraint
Discrete Applied Mathematics | 2017-02-06 | Paper |
| Subexponential-time parameterized algorithm for Steiner tree on planar graphs | 2017-01-30 | Paper |
| Parameterized complexity dichotomy for Steiner Multicut | 2017-01-24 | Paper |
Polynomial kernelization for removing induced claws and diamonds
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
| What graphs are 2-dot product graphs? | 2016-10-14 | Paper |
What graphs are 2-dot product graphs?
(available as arXiv preprint) | 2016-10-14 | Paper |
Complexity of metric dimension on planar graphs
Journal of Computer and System Sciences | 2016-09-16 | Paper |
Induced disjoint paths in circular-arc graphs in linear time
Theoretical Computer Science | 2016-07-05 | Paper |
Parameterized complexity dichotomy for \textsc{Steiner Multicut}
Journal of Computer and System Sciences | 2016-06-13 | Paper |
The firefighter problem on graph classes
Theoretical Computer Science | 2015-12-28 | Paper |
Induced disjoint paths in circular-arc graphs in linear time
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Finding disjoint paths in split graphs
Theory of Computing Systems | 2015-09-04 | Paper |
Induced disjoint paths in claw-free graphs
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
Induced disjoint paths in claw-free graphs
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
Parameterized complexity of induced graph matching on claw-free graphs
Algorithmica | 2015-01-19 | Paper |
Finding disjoint paths in split graphs
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Parameterized complexity of firefighting
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Integer representations of convex polygon intersection graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
| Weisfeiler-Lehman graph kernels | 2014-02-03 | Paper |
Algorithms to measure diversity and clustering in social networks through dot product graphs
Algorithms and Computation | 2014-01-14 | Paper |
Integer representations of convex polygon intersection graphs
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Spanners of bounded degree graphs
Information Processing Letters | 2013-04-04 | Paper |
Structure of polynomial-time approximation
Theory of Computing Systems | 2012-12-06 | Paper |
Parameterized complexity of the spanning tree congestion problem
Algorithmica | 2012-11-21 | Paper |
On the Complexity of Metric Dimension
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Reducing a target interval to a few exact queries
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Induced disjoint paths in claw-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Parameterized complexity of induced \(H\)-matching on claw-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Induced disjoint paths in AT-free graphs
Lecture Notes in Computer Science | 2012-08-14 | Paper |
\(k\)-gap interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Parameterized Complexity of Firefighting Revisited
Parameterized and Exact Computation | 2012-06-15 | Paper |
Domination when the stars are out
Lecture Notes in Computer Science | 2011-07-06 | Paper |
Convex Polygon Intersection Graphs
Graph Drawing | 2011-02-11 | Paper |
Complexity results for the spanning tree congestion problem
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
PTAS for weighted set cover on unit squares
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Faster algorithms on branch and clique decompositions
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
| scientific article; zbMATH DE number 5764844 (Why is no real title available?) | 2010-08-06 | Paper |
Domination in Geometric Intersection Graphs
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Better Approximation Schemes for Disk Graphs
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
