| Publication | Date of Publication | Type |
|---|
| On the maximum number of edges in chordal graphs of bounded degree and matching number | 2022-12-08 | Paper |
| On the maximum number of edges in chordal graphs of bounded degree and matching number | 2022-10-13 | Paper |
| Generation of random chordal graphs using subtrees of a tree | 2022-05-09 | Paper |
| Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116487 | 2020-08-25 | Paper |
| Finding connected secluded subgraphs | 2020-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111877 | 2020-05-27 | Paper |
| Parameterized aspects of strong subgraph closure | 2020-05-21 | Paper |
| Enumeration of minimal connected dominating sets for chordal graphs | 2020-04-21 | Paper |
| Partitioning a graph into degenerate subgraphs | 2019-11-28 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2019-05-21 | Paper |
| Scheduling unit-length jobs with precedence constraints of small height | 2018-08-27 | Paper |
| Vector connectivity in graphs | 2018-05-23 | Paper |
| Output-polynomial enumeration on graphs of bounded (local) linear MIM-width | 2018-04-06 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2018-01-04 | Paper |
| Enumeration and maximum number of minimal connected vertex covers in graphs | 2017-11-14 | Paper |
| Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality | 2017-09-29 | Paper |
| Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees | 2017-09-11 | Paper |
| Linear-Time Generation of Random Chordal Graphs | 2017-07-21 | Paper |
| Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded | 2017-02-27 | Paper |
| Minimal dominating sets in interval graphs and trees | 2016-11-24 | Paper |
| On recognition of threshold tolerance graphs and their complements | 2016-11-24 | Paper |
| Maximal Induced Matchings in Triangle-Free Graphs | 2016-11-16 | Paper |
| Recognizability equals definability for graphs of bounded treewidth and bounded chordality | 2016-10-14 | Paper |
| Enumerating minimal dominating sets in chordal graphs | 2016-08-16 | Paper |
| Enumerating minimal connected dominating sets in graphs of bounded chordality | 2016-05-02 | Paper |
| Clique-width of path powers | 2016-04-07 | Paper |
| Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs | 2016-04-04 | Paper |
| Output-polynomial enumeration on graphs of bounded (local) linear MIM-width | 2016-01-11 | Paper |
| The firefighter problem on graph classes | 2015-12-28 | Paper |
| Enumerating minimal dominating sets in chordal bipartite graphs | 2015-12-10 | Paper |
| Maximal Induced Matchings in Triangle-Free Graphs | 2015-09-09 | Paper |
| Hadwiger Number of Graphs with Small Chordality | 2015-09-09 | Paper |
| Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time | 2015-09-09 | Paper |
| Finding disjoint paths in split graphs | 2015-09-04 | Paper |
| On the parameterized complexity of finding separators with non-hereditary properties | 2015-09-02 | Paper |
| An incremental polynomial time algorithm to enumerate all minimal edge dominating sets | 2015-09-02 | Paper |
| Hadwiger Number of Graphs with Small Chordality | 2015-08-17 | Paper |
| A characterisation of clique-width through nested partitions | 2015-06-10 | Paper |
| Computing the metric dimension for chain graphs | 2015-06-02 | Paper |
| Modifying a graph using vertex elimination | 2015-05-21 | Paper |
| A multi-parameter analysis of hard problems on deterministic finite automata | 2015-02-20 | Paper |
| Finding Disjoint Paths in Split Graphs | 2015-01-13 | Paper |
| Induced subgraph isomorphism on proper interval and bipartite permutation graphs | 2014-12-02 | Paper |
| Enumerating minimal subset feedback vertex sets | 2014-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921757 | 2014-10-13 | Paper |
| Graph classes and Ramsey numbers | 2014-08-22 | Paper |
| Finding clubs in graph classes | 2014-08-22 | Paper |
| Detecting fixed patterns in chordal graphs in polynomial time | 2014-07-03 | Paper |
| Contracting chordal graphs and bipartite graphs to paths and trees | 2014-05-05 | Paper |
| Subset feedback vertex sets in chordal graphs | 2014-04-28 | Paper |
| Obtaining a Bipartite Graph by Contracting Few Edges | 2014-04-10 | Paper |
| Guest editors' foreword | 2014-04-02 | Paper |
| Contracting graphs to paths and trees | 2014-03-25 | Paper |
| Induced Subtrees in Interval Graphs | 2014-01-17 | Paper |
| Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization | 2014-01-16 | Paper |
| Parameterized complexity of vertex deletion into perfect graph classes | 2014-01-13 | Paper |
| Minimal dominating sets in graph classes: combinatorial bounds and enumeration | 2013-12-11 | Paper |
| An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets | 2013-08-06 | Paper |
| Contracting chordal graphs and bipartite graphs to paths and trees | 2013-07-23 | Paper |
| A new representation of proper interval graphs with an application to clique-width | 2013-07-04 | Paper |
| Cliques and Clubs | 2013-06-07 | Paper |
| Vector Connectivity in Graphs | 2013-05-28 | Paper |
| Choosability on \(H\)-free graphs | 2013-03-20 | Paper |
| A Multivariate Analysis of Some DFA Problems | 2013-03-18 | Paper |
| Polar permutation graphs are polynomial-time recognisable | 2013-01-24 | Paper |
| An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs | 2013-01-07 | Paper |
| Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time | 2013-01-04 | Paper |
| How to Eliminate a Graph | 2012-11-06 | Paper |
| On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties | 2012-11-06 | Paper |
| Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs | 2012-09-25 | Paper |
| Ramsey Numbers for Line Graphs and Perfect Graphs | 2012-09-25 | Paper |
| Computing role assignments of proper interval graphs in polynomial time | 2012-09-13 | Paper |
| Broadcast Domination on Block Graphs in Linear Time | 2012-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2911626 | 2012-08-31 | Paper |
| Computing Minimum Geodetic Sets of Proper Interval Graphs | 2012-06-29 | Paper |
| Contracting graphs to paths and trees | 2012-06-15 | Paper |
| Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration | 2012-06-15 | Paper |
| Edge contractions in subclasses of chordal graphs | 2012-05-30 | Paper |
| Edge search number of cographs | 2012-05-11 | Paper |
| Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs | 2012-05-11 | Paper |
| Cutwidth of Split Graphs and Threshold Graphs | 2012-03-15 | Paper |
| Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths | 2011-12-16 | Paper |
| Strongly chordal and chordal bipartite graphs are sandwich monotone | 2011-12-15 | Paper |
| Faster parameterized algorithms for \textsc{Minimum Fill-in} | 2011-12-14 | Paper |
| Bandwidth on AT-free graphs | 2011-12-07 | Paper |
| Graphs of linear clique-width at most 3 | 2011-10-10 | Paper |
| Parameterized Complexity of Vertex Deletion into Perfect Graph Classes | 2011-08-19 | Paper |
| A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition | 2011-08-17 | Paper |
| Enumerating Minimal Subset Feedback Vertex Sets | 2011-08-12 | Paper |
| Edge Contractions in Subclasses of Chordal Graphs | 2011-07-01 | Paper |
| Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width | 2011-06-17 | Paper |
| Computing Role Assignments of Proper Interval Graphs in Polynomial Time | 2011-05-19 | Paper |
| Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs | 2011-03-14 | Paper |
| Induced Subgraph Isomorphism on Interval and Proper Interval Graphs | 2010-12-09 | Paper |
| Mixed search number and linear-width of interval and split graphs | 2010-11-24 | Paper |
| Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time | 2010-11-16 | Paper |
| Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs | 2010-11-16 | Paper |
| Hardness and approximation of minimum distortion embeddings | 2010-09-07 | Paper |
| Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing | 2010-06-22 | Paper |
| Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width | 2010-06-17 | Paper |
| A Parameterized Algorithm for Chordal Sandwich | 2010-05-28 | Paper |
| Minimal split completions | 2010-04-28 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Clustering with partial information | 2010-03-09 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Bandwidth on AT-Free Graphs | 2009-12-17 | Paper |
| Polar Permutation Graphs | 2009-12-11 | Paper |
| Bandwidth of bipartite permutation graphs in polynomial time | 2009-12-10 | Paper |
| Fast Computation of Minimal Fill Inside A Given Elimination Ordering | 2009-11-06 | Paper |
| Interval Completion Is Fixed Parameter Tractable | 2009-11-06 | Paper |
| Choosability of P 5-Free Graphs | 2009-10-16 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone | 2009-07-23 | Paper |
| Edge Search Number of Cographs in Linear Time | 2009-07-14 | Paper |
| Dynamically maintaining split graphs | 2009-06-24 | Paper |
| A Complete Characterisation of the Linear Clique-Width of Path Powers | 2009-06-03 | Paper |
| Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions | 2009-03-06 | Paper |
| Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions | 2009-02-19 | Paper |
| Clustering with Partial Information | 2009-02-03 | Paper |
| Faster Parameterized Algorithms for Minimum Fill-In | 2009-01-29 | Paper |
| Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5503435 | 2009-01-15 | Paper |
| Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree | 2009-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549635 | 2009-01-05 | Paper |
| Minimal Split Completions of Graphs | 2008-09-18 | Paper |
| Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs | 2008-07-15 | Paper |
| Mixed Search Number and Linear-Width of Interval and Split Graphs | 2008-07-01 | Paper |
| Mixed Search Number of Permutation Graphs | 2008-06-19 | Paper |
| Graphs of Linear Clique-Width at Most 3 | 2008-05-27 | Paper |
| Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions | 2008-04-24 | Paper |
| Bandwidth of Bipartite Permutation Graphs in Polynomial Time | 2008-04-15 | Paper |
| Minimal comparability completions of arbitrary graphs | 2008-03-18 | Paper |
| Exact algorithms for graph homomorphisms | 2007-09-06 | Paper |
| Optimal Linear Arrangement of Interval Graphs | 2007-09-05 | Paper |
| Characterizing Minimal Interval Completions | 2007-09-03 | Paper |
| A completely dynamic algorithm for split graphs | 2007-05-29 | Paper |
| Optimal broadcast domination in polynomial time | 2006-12-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) | 2006-06-01 | Paper |
| A wide-range algorithm for minimal triangulation from an arbitrary ordering | 2006-04-28 | Paper |
| Minimal triangulations of graphs: a survey | 2006-03-29 | Paper |
| A vertex incremental approach for maintaining chordality | 2006-03-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677956 | 2005-05-23 | Paper |
| Graph searching, elimination trees, and a generalization of bandwidth | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825539 | 2004-10-28 | Paper |
| Maximum cardinality search for computing minimal triangulations of graphs | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414480 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414498 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411390 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721974 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708230 | 2001-04-17 | Paper |
| Methods for Large Scale Total Least Squares Problems | 2001-03-19 | Paper |
| A practical algorithm for making filled graphs minimal | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4209364 | 1999-01-11 | Paper |
| Making an arbitrary filled graph minimal by removing fill edges | 1998-02-08 | Paper |
| Finding minimum height elimination trees for interval graphs in polynomial time | 1995-06-19 | Paper |
