| Publication | Date of Publication | Type |
|---|
| Chordal graphs and their clique graphs | 2024-02-28 | 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 |
| Connected search for a lazy robber | 2023-10-04 | Paper |
| Universal Obstructions of Graph Parameters | 2023-04-27 | Paper |
| Graph Parameters, Universal Obstructions, and WQO | 2023-04-07 | Paper |
| The mixed search game against an agile and visible fugitive is monotone | 2023-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874536 | 2023-02-07 | Paper |
| Connected Search for a Lazy Robber | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089215 | 2022-07-18 | Paper |
| On Dasgupta's hierarchical clustering objective and its relation to other graph parameters | 2022-05-20 | 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 |
| Edge degeneracy: algorithmic and structural results | 2020-09-03 | Paper |
| Hierarchical Clusterings of Unweighted Graphs | 2020-08-07 | Paper |
| Parameterized complexity of finding a spanning tree with minimum reload cost diameter | 2020-05-27 | Paper |
| Exploring the complexity of layout parameters in tournaments and semi-complete digraphs | 2020-05-27 | Paper |
| On independent set in \(B_1\)-EPG graphs | 2020-04-21 | Paper |
| Explicit linear kernels for packing problems | 2019-04-25 | Paper |
| Strong immersion is a well‐quasi‐ordering for semicomplete digraphs | 2019-04-25 | Paper |
| Exploring the complexity of layout parameters in tournaments and semicomplete digraphs | 2018-11-13 | Paper |
| Linear time 3-approximation for the MAST problem | 2018-11-05 | Paper |
| Linear kernels and single-exponential algorithms via protrusion decompositions | 2018-10-30 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2018-02-28 | Paper |
| Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees | 2017-10-20 | Paper |
| An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion | 2017-10-10 | Paper |
| Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism | 2017-09-29 | Paper |
| An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion | 2017-09-29 | Paper |
| A polynomial-time algorithm for outerplanar diameter improvement | 2017-09-07 | Paper |
| Parameterized complexity of the MinCCA problem on graphs of bounded decomposability | 2017-08-24 | Paper |
| Parameterized algorithms for min-max multiway cut and list digraph homomorphism | 2017-05-26 | Paper |
| Explicit linear kernels via dynamic programming | 2017-03-03 | Paper |
| Parameterized complexity of the MinCCA problem on graphs of bounded decomposability | 2016-12-22 | Paper |
| Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees | 2016-11-09 | Paper |
| Approximate distance labeling schemes | 2016-07-01 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2016-02-26 | Paper |
| On independent set on B1-EPG graphs | 2016-02-26 | Paper |
| Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique | 2015-12-11 | Paper |
| Explicit linear kernels via dynamic programming | 2015-10-21 | Paper |
| A polynomial-time algorithm for outerplanar diameter improvement | 2015-10-20 | Paper |
| Hadwiger number of graphs with small chordality | 2015-09-09 | Paper |
| Hadwiger number of graphs with small chordality | 2015-08-17 | Paper |
| Eclecticism shrinks even small worlds | 2015-08-03 | Paper |
| Partition refinement techniques: an interesting algorithmic tool kit | 2015-04-29 | Paper |
| Hitting and Harvesting Pumpkins | 2014-12-22 | Paper |
| Practical and efficient circle graph recognition | 2014-11-19 | Paper |
| Practical and efficient split decomposition via graph-labelled trees | 2014-11-19 | Paper |
| A survey of the algorithmic aspects of modular decomposition | 2014-10-07 | Paper |
| A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem | 2014-09-22 | Paper |
| Contracting chordal graphs and bipartite graphs to paths and trees | 2014-05-05 | Paper |
| Obtaining a bipartite graph by contracting few edges | 2014-04-10 | Paper |
| Contracting graphs to paths and trees | 2014-03-25 | Paper |
| Parameterized domination in circle graphs | 2014-03-25 | Paper |
| Linear kernels and single-exponential algorithms via protrusion decompositions | 2013-08-06 | Paper |
| Eclecticism shrinks even small worlds | 2013-06-13 | Paper |
| On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems | 2013-05-16 | Paper |
| Parameterized Domination in Circle Graphs | 2012-11-06 | Paper |
| Kernels for feedback arc set in tournaments | 2012-10-24 | Paper |
| Obtaining a bipartite graph by contracting few edges | 2012-08-31 | Paper |
| A single-exponential FPT algorithm for the \(K _{4}\)-minor cover problem | 2012-08-14 | Paper |
| Contracting graphs to paths and trees | 2012-06-15 | Paper |
| Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs | 2012-05-11 | Paper |
| Kernels for feedback arc set in tournaments | 2012-01-11 | Paper |
| Hitting and Harvesting Pumpkins | 2011-09-16 | Paper |
| Conflict packing yields linear vertex-kernels for \(k\)-FAST, \(k\)-dense RTI and a related problem | 2011-08-17 | Paper |
| On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems | 2010-12-07 | Paper |
| Generalized graph clustering: recognizing \((p,q)\)-cluster graphs | 2010-11-16 | Paper |
| Milling a graph with turn costs: a parameterized complexity perspective | 2010-11-16 | Paper |
| Polynomial kernels for 3-leaf power graph modification problems | 2010-11-05 | Paper |
| Fully dynamic algorithm for recognition and modular decomposition of permutation graphs | 2010-09-16 | Paper |
| Branchwidth of chordal graphs | 2010-04-28 | Paper |
| A more efficient algorithm for perfect sorting by reversals | 2010-04-19 | Paper |
| Optimal distance labeling for interval and circular-arc graphs | 2010-03-03 | Paper |
| A simple linear time LexBFS cograph recognition algorithm. | 2010-01-12 | Paper |
| Polynomial kernels for 3-leaf power graph modification problems | 2009-12-11 | Paper |
| A Simple Linear Time LexBFS Cograph Recognition Algorithm | 2009-11-27 | Paper |
| Interval Completion Is Fixed Parameter Tractable | 2009-11-06 | Paper |
| Optimal Distance Labeling for Interval Graphs and Related Graph Families | 2009-08-20 | Paper |
| The Structure of Level-k Phylogenetic Networks | 2009-07-07 | Paper |
| Kinetic maintenance of mobile \(k\)-centres on trees | 2009-06-30 | Paper |
| On the approximability of the maximum agreement subtree and maximum compatible tree problems | 2009-06-30 | Paper |
| Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches | 2009-06-17 | Paper |
| A note on finding all homogeneous set sandwiches | 2009-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549635 | 2009-01-05 | Paper |
| Generation of Graphs with Bounded Branchwidth | 2008-09-04 | Paper |
| Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations | 2008-08-28 | Paper |
| Dynamic Distance Hereditary Graphs Using Split Decomposition | 2008-05-27 | Paper |
| Kinetic Maintenance of Mobile k-Centres on Trees | 2008-05-27 | Paper |
| Competitive graph searches | 2008-04-15 | Paper |
| Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs | 2007-05-29 | Paper |
| Edge-maximal graphs of branchwidth k | 2007-05-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Fully dynamic recognition algorithm and certificate for directed cographs | 2006-08-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| A simple linear time algorithm for cograph recognition | 2005-02-22 | Paper |
| Distance labeling scheme and split decomposition | 2004-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796196 | 2003-03-02 | Paper |
| Diameter determination on restricted graph families | 2002-08-14 | Paper |
| Linear time recognition of \(P_4\)-indifference graphs | 2002-01-07 | Paper |
| A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232788 | 1999-04-26 | Paper |
