| Publication | Date of Publication | Type |
|---|
| On Interval Routing Schemes and treewidth | 2024-02-28 | Paper |
| Fugitive-search games on graphs and related parameters | 2024-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090877 | 2023-11-20 | Paper |
| Parameterized complexity of finding a spanning tree with minimum reload cost diameter | 2023-11-15 | Paper |
| Edge-treewidth: algorithmic and combinatorial properties | 2023-11-13 | Paper |
| k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms | 2023-10-31 | Paper |
| Combing a Linkage in an Annulus | 2023-10-26 | Paper |
| Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable | 2023-10-23 | Paper |
| Connected search for a lazy robber | 2023-10-04 | Paper |
| Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm | 2023-08-10 | Paper |
| Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs | 2023-07-17 | Paper |
| \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions | 2023-05-02 | Paper |
| Universal Obstructions of Graph Parameters | 2023-04-27 | Paper |
| Approximating branchwidth on parametric extensions of planarity | 2023-04-10 | Paper |
| Graph Parameters, Universal Obstructions, and WQO | 2023-04-07 | Paper |
| On strict brambles | 2023-03-09 | Paper |
| The mixed search game against an agile and visible fugitive is monotone | 2023-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874521 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874536 | 2023-02-07 | Paper |
| Clustering to Given Connectivities | 2023-02-03 | Paper |
| Connected Search for a Lazy Robber | 2023-02-03 | Paper |
| Excluding Single-Crossing Matching Minors in Bipartite Graphs | 2022-12-19 | Paper |
| A Retrospective on (Meta) Kernelization | 2022-10-19 | Paper |
| Faster parameterized algorithms for modification problems to minor-closed classes | 2022-10-05 | Paper |
| Block elimination distance | 2022-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091010 | 2022-07-21 | Paper |
| Contraction Bidimensionality of Geometric Intersection Graphs | 2022-07-20 | Paper |
| Modification to Planarity is Fixed Parameter Tractable | 2022-07-18 | Paper |
| Lean Tree-Cut Decompositions: Obstructions and Algorithms | 2022-07-18 | Paper |
| Block elimination distance | 2022-06-08 | Paper |
| Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs | 2022-06-08 | Paper |
| Parameterized Complexity of Elimination Distance to First-Order Logic Properties | 2022-04-29 | Paper |
| Contraction bidimensionality of geometric intersection graphs | 2022-03-25 | Paper |
| A polynomial time algorithm to compute the connected treewidth of a series-parallel graph | 2022-03-24 | Paper |
| A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth | 2022-03-15 | Paper |
| Compactors for parameterized counting problems | 2021-12-20 | Paper |
| Compound Logics for Modification Problems | 2021-11-04 | Paper |
| Minimum reload cost graph factors | 2021-08-05 | Paper |
| A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth | 2021-08-04 | Paper |
| Minor obstructions for apex-pseudoforests | 2021-08-02 | Paper |
| A Menger-like property of tree-cut width | 2021-03-08 | Paper |
| Block Elimination Distance | 2021-03-02 | Paper |
| Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes | 2021-02-15 | Paper |
| A more accurate view of the Flat Wall Theorem | 2021-02-12 | Paper |
| Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable | 2021-02-02 | Paper |
| A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary | 2021-02-02 | Paper |
| Bidimensionality and Kernels | 2021-01-13 | Paper |
| Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds | 2020-10-28 | Paper |
| Minimum reload cost graph factors | 2020-10-22 | Paper |
| Structure and enumeration of \(K_4\)-minor-free links and link-diagrams | 2020-09-15 | Paper |
| Edge degeneracy: algorithmic and structural results | 2020-09-03 | Paper |
| Partial complementation of graphs | 2020-08-25 | Paper |
| Minor-obstructions for apex sub-unicyclic graphs | 2020-07-07 | Paper |
| Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111862 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111863 | 2020-05-27 | Paper |
| Contraction-Bidimensionality of Geometric Intersection Graphs | 2020-05-27 | Paper |
| Structured Connectivity Augmentation | 2020-05-26 | Paper |
| Subgraph complementation | 2020-05-21 | Paper |
| Sparse obstructions for minor-covering parameters | 2020-04-21 | Paper |
| Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms | 2020-03-12 | Paper |
| On the parameterized complexity of graph modification to first-order logic properties | 2020-02-27 | Paper |
| Hitting minors on bounded treewidth graphs. III. Lower bounds | 2020-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4972036 | 2019-11-22 | Paper |
| On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring | 2019-09-17 | Paper |
| Planar Disjoint Paths in Linear Time | 2019-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743379 | 2019-05-10 | Paper |
| Explicit linear kernels for packing problems | 2019-04-25 | Paper |
| Cutwidth: obstructions and algorithmic aspects | 2019-02-14 | Paper |
| Structured Connectivity Augmentation | 2018-11-19 | Paper |
| Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors | 2018-11-12 | Paper |
| Structure and enumeration of \(K_{4}\)-minor-free links and link diagrams | 2018-10-11 | Paper |
| Data-compression for Parametrized Counting Problems on Sparse graphs | 2018-09-21 | Paper |
| (Meta) Kernelization | 2018-08-02 | Paper |
| Constructive linear time algorithms for branchwidth | 2018-07-04 | Paper |
| Minimal disconnected cuts in planar graphs | 2018-05-23 | Paper |
| An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) | 2018-05-23 | Paper |
| Cutwidth: obstructions and algorithmic aspects | 2018-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608585 | 2018-03-21 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2018-02-28 | Paper |
| On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability | 2017-11-16 | Paper |
| Bidimensionality and Parameterized Algorithms (Invited Talk) | 2017-09-29 | Paper |
| Variants of Plane Diameter Completion | 2017-09-29 | Paper |
| Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism | 2017-09-29 | Paper |
| Recent techniques and results on the Erdős-Pósa property | 2017-09-12 | Paper |
| A polynomial-time algorithm for outerplanar diameter improvement | 2017-09-07 | Paper |
| Minors in graphs of large \(\theta_r\)-girth | 2017-08-31 | Paper |
| Packing and covering immersion-expansions of planar sub-cubic graphs | 2017-08-31 | Paper |
| Parameterized algorithms for min-max multiway cut and list digraph homomorphism | 2017-05-26 | Paper |
| The Parameterized Complexity of Graph Cyclability | 2017-03-16 | Paper |
| A linear kernel for planar red-blue dominating set | 2017-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965494 | 2017-03-03 | Paper |
| Acyclic edge coloring through the Lovász local lemma | 2017-02-06 | Paper |
| Low Polynomial Exclusion of Planar Graph Patterns | 2017-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957874 | 2017-01-30 | Paper |
| Partiality and approximation schemes for local consistency in networks of constraints | 2017-01-19 | Paper |
| Editing to a planar graph of given degrees | 2016-12-28 | Paper |
| Packing and Covering Immersion Models of Planar Subcubic Graphs | 2016-12-22 | Paper |
| Irrelevant vertices for the planar disjoint paths problem | 2016-11-25 | Paper |
| Planar disjoint-paths completion | 2016-10-21 | Paper |
| Contraction obstructions for connected graph searching | 2016-06-21 | Paper |
| It is hard to know when greedy is good for finding independent sets | 2016-05-26 | Paper |
| Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems | 2016-05-26 | Paper |
| An edge variant of the Erdős-Pósa property | 2016-05-18 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2016-02-26 | Paper |
| An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r | 2016-02-26 | Paper |
| The Structure of $W_4$-Immersion-Free Graphs | 2016-02-05 | Paper |
| Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs | 2015-12-04 | Paper |
| Explicit Linear Kernels via Dynamic Programming | 2015-10-21 | Paper |
| A Polynomial-Time Algorithm for Outerplanar Diameter Improvement | 2015-10-20 | Paper |
| Editing to a Planar Graph of Given Degrees | 2015-10-20 | Paper |
| Minimal Disconnected Cuts in Planar Graphs | 2015-09-29 | Paper |
| Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs | 2015-09-02 | Paper |
| Dynamic programming for graphs on surfaces | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501345 | 2015-08-03 | Paper |
| An alternative proof for the constructive Asymmetric Lov\'asz Local Lemma | 2015-05-11 | Paper |
| FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT | 2015-04-29 | Paper |
| Forbidding Kuratowski Graphs as Immersions | 2015-01-21 | Paper |
| Bidimensionality of Geometric Intersection Graphs | 2015-01-13 | Paper |
| On exact algorithms for treewidth | 2014-12-05 | Paper |
| Confronting intractability via parameters | 2014-10-24 | Paper |
| The Parameterized Complexity of Graph Cyclability | 2014-10-08 | Paper |
| Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms | 2014-10-07 | Paper |
| Subexponential parameterized algorithms | 2014-10-07 | Paper |
| Lift-contractions | 2014-07-29 | Paper |
| (Meta) Kernelization | 2014-07-25 | Paper |
| Polynomial gap extensions of the Erdős-Pósa theorem | 2014-06-11 | Paper |
| Bidimensionality and Geometric Graphs | 2014-05-22 | Paper |
| Characterizing graphs of small carving-width | 2014-04-22 | Paper |
| Square roots of minor closed graph classes | 2014-04-02 | Paper |
| Optimizing the Graph Minors Weak Structure Theorem | 2014-01-21 | Paper |
| Outerplanar obstructions for matroid pathwidth | 2014-01-16 | Paper |
| Excluding Graphs as Immersions in Surface Embedded Graphs | 2013-12-06 | Paper |
| Increasing the minimum degree of a graph by contractions | 2013-11-29 | Paper |
| Nearly Planar Graphs and {\lambda}-flat Graphs | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857377 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857379 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857402 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857427 | 2013-11-01 | Paper |
| Outerplanar Obstructions for the Feedback Vertex Set | 2013-10-10 | Paper |
| Obstructions for Tree-depth | 2013-10-10 | Paper |
| Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs | 2013-07-04 | Paper |
| Asymptotic enumeration of non-crossing partitions on surfaces | 2013-03-04 | Paper |
| A note on exact algorithms for vertex ordering problems on graphs | 2012-12-06 | Paper |
| Connected graph searching | 2012-11-27 | Paper |
| Fast minor testing in planar graphs | 2012-11-21 | Paper |
| Characterizing Graphs of Small Carving-Width | 2012-11-02 | Paper |
| LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth | 2012-10-26 | Paper |
| Paths of bounded length and their cuts: parameterized complexity and algorithms | 2012-10-16 | Paper |
| Dynamic Programming for H-minor-free Graphs | 2012-09-25 | Paper |
| Graph Minors and Parameterized Algorithm Design | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904760 | 2012-08-23 | Paper |
| Catalan structures and dynamic programming in \(H\)-minor-free graphs | 2012-08-17 | Paper |
| Planar Disjoint-Paths Completion | 2012-06-15 | Paper |
| Increasing the Minimum Degree of a Graph by Contractions | 2012-06-15 | Paper |
| On graph contractions and induced minors | 2012-05-11 | Paper |
| Outerplanar obstructions for a feedback vertex set | 2012-05-04 | Paper |
| Forbidden graphs for tree-depth | 2012-05-04 | Paper |
| On self-duality of branchwidth in graphs of bounded genus | 2012-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389998 | 2012-04-24 | Paper |
| Containment relations in split graphs | 2012-03-19 | Paper |
| Approximating Width Parameters of Hypergraphs with Excluded Minors | 2012-03-15 | Paper |
| Induced packing of odd cycles in planar graphs | 2012-03-13 | Paper |
| Parameterizing cut sets in a graph by the number of their components | 2012-01-09 | Paper |
| Faster parameterized algorithms for minor containment | 2011-12-07 | Paper |
| Searching for a Visible, Lazy Fugitive | 2011-10-27 | Paper |
| Fast Sub-exponential Algorithms and Compactness in Planar Graphs | 2011-09-16 | Paper |
| Contracting planar graphs to contractions of triangulations | 2011-08-23 | Paper |
| Contraction obstructions for treewidth | 2011-08-10 | Paper |
| On disconnected cuts and separators | 2011-08-10 | Paper |
| Tight Bounds for Linkages in Planar Graphs | 2011-07-06 | Paper |
| Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms | 2011-07-01 | Paper |
| Strengthening Erdös-Pósa property for minor-closed graph classes | 2011-03-21 | Paper |
| Approximation Algorithms for Domination Search | 2011-02-15 | Paper |
| Rank-width and tree-width of \(H\)-minor-free graphs | 2010-10-18 | Paper |
| Dynamic Programming for Graphs on Surfaces | 2010-09-07 | Paper |
| Fast Minor Testing in Planar Graphs | 2010-09-06 | Paper |
| Contractions of Planar Graphs in Polynomial Time | 2010-09-06 | Paper |
| Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs | 2010-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579494 | 2010-08-06 | Paper |
| Faster Parameterized Algorithms for Minor Containment | 2010-06-22 | Paper |
| A note on the subgraphs of the (\(2\times \infty \))-grid | 2010-03-29 | Paper |
| Graph Searching in a Crime Wave | 2010-03-17 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| On Contracting Graphs to Fixed Pattern Graphs | 2010-01-28 | Paper |
| Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms | 2010-01-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Induced Packing of Odd Cycles in a Planar Graph | 2009-12-17 | Paper |
| Parameterizing Cut Sets in a Graph by the Number of Their Components | 2009-12-17 | Paper |
| Contraction Bidimensionality: The Accurate Picture | 2009-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396557 | 2009-09-19 | Paper |
| Parameterized complexity of finding regular induced subgraphs | 2009-06-24 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Derivation of algorithms for cutwidth and related graph layout parameters | 2009-04-30 | Paper |
| Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms | 2009-01-20 | Paper |
| Searching for a Visible, Lazy Fugitive | 2009-01-20 | Paper |
| Faster fixed-parameter tractable algorithms for matching and packing problems | 2008-12-02 | Paper |
| Graph Searching in a Crime Wave | 2008-07-01 | Paper |
| Efficient algorithms for counting parameterized list \(H\)-colorings | 2008-06-26 | Paper |
| An annotated bibliography on guaranteed graph searching | 2008-06-24 | Paper |
| Fast FPT-Algorithms for Cleaning Grids | 2008-03-19 | Paper |
| On Exact Algorithms for Treewidth | 2008-03-11 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Subexponential Parameterized Algorithms | 2007-11-28 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Kernels for the Vertex Cover Problem on the Preferred Attachment Model | 2007-09-14 | Paper |
| Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus | 2007-09-07 | Paper |
| Complexity issues on bounded restrictive \(H\)-coloring | 2007-06-26 | Paper |
| On self duality of pathwidth in polyhedral graph embeddings | 2007-06-11 | Paper |
| A 3-approximation for the pathwidth of Halin graphs | 2007-05-29 | Paper |
| Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs | 2007-05-29 | Paper |
| Connected Graph Searching in Outerplanar Graphs | 2007-05-29 | Paper |
| The Bidimensional Theory of Bounded-Genus Graphs | 2007-05-22 | Paper |
| Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up | 2007-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424889 | 2007-03-05 | Paper |
| A 3-approximation for the pathwidth of Halin graphs | 2007-02-14 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| New upper bounds on the decomposability of planar graphs | 2006-03-24 | Paper |
| Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover | 2005-12-27 | Paper |
| Bidimensional Parameters and Local Treewidth | 2005-09-16 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Cutwidth I: A linear time fixed parameter algorithm | 2005-08-01 | Paper |
| Cutwidth II: Algorithms for partial w-trees of bounded degree | 2005-08-01 | Paper |
| Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660720 | 2005-04-04 | Paper |
| The restrictive \(H\)-coloring problem | 2005-02-22 | Paper |
| Approximation algorithms for classes of graphs excluding single-crossing graphs as minors | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472491 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471291 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448757 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449223 | 2004-02-08 | Paper |
| On the monotonicity of games generated by symmetric submodular functions. | 2003-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427278 | 2003-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425961 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414491 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411278 | 2003-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796189 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779153 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778544 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551368 | 2002-09-05 | Paper |
| Counting \(H-\)colorings of partial \(k-\)trees | 2002-07-15 | Paper |
| On Graph Powers for Leaf-Labeled Trees | 2002-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741367 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741369 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721973 | 2001-07-11 | Paper |
| Algorithms and obstructions for linear-width and related search parameters | 2001-02-27 | Paper |
| Graphs with Branchwidth at Most Three | 2000-10-17 | Paper |
| On parallel partial solutions and approximation schemes for local consistency in networks of constraints | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944989 | 2000-03-22 | Paper |
| Isomorphism for graphs of bounded distance width | 1999-06-29 | Paper |
| Fugitive-search games on graphs and related parameters | 1998-07-23 | Paper |
| On interval routing schemes and treewidth | 1998-06-15 | Paper |
| Treewidth for graphs with small chordality | 1998-01-07 | Paper |
| The Linkage of a Graph | 1996-10-15 | Paper |
