| Publication | Date of Publication | Type |
|---|
| Streaming deletion problems Parameterized by vertex cover | 2023-10-26 | Paper |
| Induced disjoint paths and connected subgraphs for \(H\)-free graphs | 2023-09-27 | Paper |
| Few induced disjoint paths for \(H\)-free graphs | 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 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5875557 | 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 | 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 | 2022-05-20 | Paper |
| Upper bounding rainbow connection number by forest number | 2022-05-17 | Paper |
| On Geometric Set Cover for Orthants | 2022-05-11 | Paper |
| Disjoint paths and connected subgraphs for \(H\)-free graphs | 2022-03-22 | Paper |
| Few Induced Disjoint Paths for $H$-Free Graphs | 2022-03-07 | Paper |
| What Graphs are 2-Dot Product Graphs? | 2022-02-01 | Paper |
| Disjoint paths and connected subgraphs for \(H\)-free graphs | 2021-12-01 | Paper |
| Induced disjoint paths in AT-free graphs | 2021-11-25 | Paper |
| A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs | 2021-11-04 | Paper |
| Algorithms for the rainbow vertex coloring problem on graph classes | 2021-09-27 | Paper |
| Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009615 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009627 | 2021-08-04 | Paper |
| Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs | 2021-08-04 | Paper |
| Subexponential-time algorithms for finding large induced sparse subgraphs | 2021-07-26 | Paper |
| Disjoint Paths and Connected Subgraphs for H-Free Graphs | 2021-05-13 | Paper |
| Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces | 2021-05-03 | Paper |
| Steiner trees for hereditary graph classes: a treewidth perspective | 2021-04-15 | Paper |
| Disconnected cuts in claw-free graphs | 2020-06-09 | Paper |
| Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking | 2020-05-26 | Paper |
| Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs | 2020-04-14 | Paper |
| Solving Partition Problems Almost Always Requires Pushing Many Vertices Around | 2020-03-11 | Paper |
| Algorithms for the rainbow vertex coloring problem on graph classes | 2020-03-06 | Paper |
| Algorithms and bounds for very strong rainbow coloring | 2020-02-12 | Paper |
| Complexity of independency and cliquy trees | 2019-12-30 | Paper |
| Domination When the Stars Are Out | 2019-11-25 | Paper |
| Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces | 2019-10-15 | Paper |
| Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs | 2019-03-28 | Paper |
| Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs | 2019-02-14 | Paper |
| Independence and Efficient Domination on P 6 -free Graphs | 2018-11-12 | Paper |
| Independence and Efficient Domination on P6-free Graphs | 2018-07-16 | Paper |
| Polynomial kernels for deletion to classes of acyclic digraphs | 2018-05-24 | Paper |
| Disconnected Cuts in Claw-free Graphs | 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 | 2017-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369516 | 2017-10-17 | Paper |
| Polynomial kernelization for removing induced claws and diamonds | 2017-08-15 | Paper |
| Algorithms and Bounds for Very Strong Rainbow Coloring | 2017-03-01 | Paper |
| Shortcutting directed and undirected networks with a degree constraint | 2017-02-06 | Paper |
| Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2954992 | 2017-01-24 | Paper |
| Polynomial Kernelization for Removing Induced Claws and Diamonds | 2016-10-21 | Paper |
| What graphs are 2-dot product graphs? | 2016-10-14 | Paper |
| Complexity of metric dimension on planar graphs | 2016-09-16 | Paper |
| Induced disjoint paths in circular-arc graphs in linear time | 2016-07-05 | Paper |
| Parameterized complexity dichotomy for \textsc{Steiner Multicut} | 2016-06-13 | Paper |
| The firefighter problem on graph classes | 2015-12-28 | Paper |
| Induced Disjoint Paths in Circular-Arc Graphs in Linear Time | 2015-09-09 | Paper |
| Finding disjoint paths in split graphs | 2015-09-04 | Paper |
| Induced Disjoint Paths in Claw-Free Graphs | 2015-05-20 | Paper |
| Parameterized complexity of induced graph matching on claw-free graphs | 2015-01-19 | Paper |
| Finding Disjoint Paths in Split Graphs | 2015-01-13 | Paper |
| Parameterized complexity of firefighting | 2014-06-10 | Paper |
| Integer representations of convex polygon intersection graphs | 2014-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396694 | 2014-02-03 | Paper |
| Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs | 2014-01-14 | Paper |
| Integer Representations of Convex Polygon Intersection Graphs | 2013-06-27 | Paper |
| Spanners of bounded degree graphs | 2013-04-04 | Paper |
| Structure of polynomial-time approximation | 2012-12-06 | Paper |
| Parameterized complexity of the spanning tree congestion problem | 2012-11-21 | Paper |
| Reducing a Target Interval to a Few Exact Queries | 2012-09-25 | Paper |
| On the Complexity of Metric Dimension | 2012-09-25 | Paper |
| Induced Disjoint Paths in Claw-Free Graphs | 2012-09-25 | Paper |
| Parameterized Complexity of Induced H-Matching on Claw-Free Graphs | 2012-09-25 | Paper |
| Induced disjoint paths in AT-free graphs | 2012-08-14 | Paper |
| k-Gap Interval Graphs | 2012-06-29 | Paper |
| Parameterized Complexity of Firefighting Revisited | 2012-06-15 | Paper |
| Domination When the Stars Are Out | 2011-07-06 | Paper |
| Convex Polygon Intersection Graphs | 2011-02-11 | Paper |
| Complexity Results for the Spanning Tree Congestion Problem | 2010-11-16 | Paper |
| PTAS for Weighted Set Cover on Unit Squares | 2010-09-10 | Paper |
| Faster Algorithms on Branch and Clique Decompositions | 2010-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579437 | 2010-08-06 | Paper |
| Domination in Geometric Intersection Graphs | 2008-04-15 | Paper |
| Better Approximation Schemes for Disk Graphs | 2007-09-07 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
