| Publication | Date of Publication | Type |
|---|
| Finding and counting small induced subgraphs efficiently | 2024-02-28 | Paper |
| Rankings of graphs | 2024-01-05 | Paper |
| Dominoes | 2024-01-05 | Paper |
| Approximating the bandwidth for asteroidal triple-free graphs | 2023-05-08 | Paper |
| Complexity of paired domination in at-free and planar graphs | 2023-05-08 | Paper |
| Vertex ranking of asteroidal triple-free graphs | 2023-01-25 | Paper |
| Testing superperfection of k-trees | 2022-12-09 | Paper |
| Complexity of paired domination in AT-free and planar graphs | 2022-08-25 | Paper |
| A simple linear time algorithm for triangulating three-colored graphs | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5071562 | 2022-04-22 | Paper |
| Semitotal domination on AT-free graphs and circle graphs | 2022-03-24 | Paper |
| A Guide to Graph Algorithms | 2021-12-06 | Paper |
| A note on the geodetic number and the Steiner number of AT-free graphs | 2021-01-25 | Paper |
| Treewidth and pathwidth of permutation graphs | 2019-03-29 | Paper |
| Independent sets in asteroidal triple-free graphs | 2018-07-04 | Paper |
| On retracts, absolute retracts, and foldings in cographs | 2018-05-28 | Paper |
| On complexities of minus domination | 2018-05-24 | Paper |
| On the Grundy number of Cameron graphs | 2018-04-10 | Paper |
| On efficient absorbant conjecture in generalized De Bruijn digraphs | 2017-07-28 | Paper |
| Gray Codes for AT-Free Orders | 2017-06-20 | Paper |
| Convex Independence in Permutation Graphs | 2017-02-01 | Paper |
| P_3-Games on Chordal Bipartite Graphs | 2016-10-22 | Paper |
| Finding and counting small induced subgraphs efficiently | 2016-06-16 | Paper |
| Vertex ranking of asteroidal triple-free graphs | 2016-06-09 | Paper |
| Bandwidth of chain graphs | 2016-06-09 | Paper |
| Gray Codes for AT-Free Orders via Antimatroids | 2016-04-04 | Paper |
| Rainbow Domination and Related Problems on Some Classes of Perfect Graphs | 2016-04-01 | Paper |
| Edge-clique covers of the tensor product | 2015-12-08 | Paper |
| On maximum independent set of categorical product and ultimate categorical ratios of graphs | 2015-06-11 | Paper |
| Edge-Clique Covers of the Tensor Product | 2015-05-20 | Paper |
| On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs | 2015-02-13 | Paper |
| The combinatorics of N. G. de Bruijn | 2014-09-03 | Paper |
| In memoriam: Nicolaas Govert de Bruijn (1918--2012). Complementarity | 2014-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414591 | 2014-05-06 | Paper |
| On the complexity of the black-and-white coloring problem on some classes of perfect graphs | 2014-04-15 | Paper |
| On Edge-Independent Sets | 2014-04-03 | Paper |
| On Perfect Absorbants in De Bruijn Digraphs | 2014-04-03 | Paper |
| Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio | 2014-02-18 | Paper |
| New parameterized algorithms for the edge dominating set problem | 2014-01-13 | Paper |
| On Complexities of Minus Domination | 2013-12-10 | Paper |
| On Retracts, Absolute Retracts, and Folds in Cographs | 2013-12-06 | Paper |
| Set Representations of Linegraphs | 2013-08-31 | Paper |
| On Independence Domination | 2013-08-16 | Paper |
| Independent set in categorical products of cographs and splitgraphs | 2013-05-18 | Paper |
| The Domination Number of Generalized Petersen Graphs with a Faulty Vertex | 2013-05-06 | Paper |
| Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs | 2013-04-12 | Paper |
| On the threshold-width of graphs | 2012-10-29 | Paper |
| Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs | 2012-09-25 | Paper |
| A note on "Folding wheels and fans." | 2012-08-29 | Paper |
| De combinatoriek van De Bruijn | 2012-08-07 | Paper |
| The black-and-white coloring problem on distance-hereditary graphs and strongly chordal graphs | 2012-07-16 | Paper |
| Independent sets in edge-clique graphs II | 2012-06-22 | Paper |
| Independent sets in edge-clique graphs | 2012-06-10 | Paper |
| Edge-clique graphs of cocktail parties have unbounded rankwidth | 2012-05-11 | Paper |
| New Parameterized Algorithms for the Edge Dominating Set Problem | 2011-08-17 | Paper |
| Block-graph width | 2011-05-18 | Paper |
| Feedback vertex set on chordal bipartite graphs | 2011-04-19 | Paper |
| Black-and-white threshold graphs | 2011-04-19 | Paper |
| Some results on triangle partitions | 2011-04-19 | Paper |
| Graphs without even holes or diamonds | 2011-04-19 | Paper |
| Classifying rankwidth \(k\)-dh-graphs | 2010-06-22 | Paper |
| On probe permutation graphs | 2010-04-28 | Paper |
| On some simple widths | 2010-02-09 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Trivially-perfect width | 2009-12-11 | Paper |
| Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences | 2009-06-23 | Paper |
| Block-Graph Width | 2009-06-03 | Paper |
| Efficient algorithms for Roman domination on some classes of graphs | 2009-03-04 | Paper |
| Partitioned Probe Comparability Graphs | 2008-09-04 | Paper |
| Probe Ptolemaic Graphs | 2008-07-10 | Paper |
| Partitioned probe comparability graphs | 2008-05-28 | Paper |
| Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs | 2008-01-04 | Paper |
| Probe Matrix Problems: Totally Balanced Matrices | 2008-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439683 | 2007-05-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Improved bottleneck domination algorithms | 2006-08-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Kernels in planar digraphs | 2005-08-03 | Paper |
| Computing the branchwidth of interval graphs | 2005-02-22 | Paper |
| Approximations for -Colorings of Graphs | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448744 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414505 | 2003-07-25 | Paper |
| Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs | 2002-12-01 | Paper |
| Bandwidth and topological bandwidth of graphs with few \(P_4\)'s | 2002-07-22 | Paper |
| On the structure of graphs with bounded asteroidal number | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766686 | 2002-07-09 | Paper |
| A generalization of AT-free graphs and a generic algorithm for solving triangulation problems | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501549 | 2002-04-08 | Paper |
| Fixed-parameter complexity of \(\lambda\)-labelings | 2002-03-29 | Paper |
| SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s | 2001-09-23 | Paper |
| On the structure of graphs with bounded asteroidal number | 2001-09-23 | Paper |
| Efficient algorithms for graphs with few \(P_4\)'s | 2001-07-18 | Paper |
| Approximating the Bandwidth for Asteroidal Triple-Free Graphs | 2000-12-18 | Paper |
| A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944739 | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944992 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942652 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942656 | 2000-03-16 | Paper |
| On the vertex ranking problem for trapezoid, circular-arc and other graphs | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251049 | 1999-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268436 | 1999-10-31 | Paper |
| Independent Sets in Asteroidal Triple-Free Graphs | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246749 | 1999-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232780 | 1999-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218149 | 1999-03-02 | Paper |
| Treewidth and Minimum Fill-in on d-Trapezoid Graphs | 1998-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373684 | 1998-10-19 | Paper |
| On treewidth and minimum fill-in of asteroidal triple-free graphs | 1998-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373674 | 1998-06-23 | Paper |
| Rankings of Graphs | 1998-05-11 | Paper |
| Listing all Minimal Separators of a Graph | 1998-05-10 | Paper |
| Measuring the vulnerability for classes of intersection graphs | 1998-02-16 | Paper |
| Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs | 1997-05-11 | Paper |
| Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph | 1997-02-28 | Paper |
| On the equivalence covering number of splitgraphs | 1997-02-28 | Paper |
| \(K_{1,3}\)-free and \(W_4\)-free graphs | 1997-02-28 | Paper |
| TREEWIDTH OF CIRCLE GRAPHS | 1996-11-26 | Paper |
| Treewidth of Chordal Bipartite Graphs | 1996-05-28 | Paper |
| Treewidth and Pathwidth of Permutation Graphs | 1996-02-20 | Paper |
| Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree | 1995-08-20 | Paper |
| Treewidth. Computations and approximations | 1994-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281510 | 1994-03-10 | Paper |
| A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs | 1993-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694712 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036592 | 1993-05-18 | Paper |
| An infinite sequence of \(\Gamma{}\Delta{}\)-regular graphs | 1992-06-25 | Paper |
| A class of graphs containing the polar spaces | 1986-01-01 | Paper |
