| Publication | Date of Publication | Type |
|---|
| Complexity of graph covering problems | 2024-01-05 | Paper |
| Defensive domination in proper interval graphs | 2023-03-29 | Paper |
| Practical algorithms on partial k-trees with an application to domination-like problems | 2023-01-18 | Paper |
| Memory requirements for table computations in partial k-tree algorithms | 2022-12-09 | Paper |
| Canonical representations of partial 2-and 3-trees | 2022-12-09 | Paper |
| Seeing Arboretum for the (partial k-) Trees | 2022-10-19 | Paper |
| The complexity of the defensive domination problem in special graph classes | 2019-12-17 | Paper |
| A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths | 2019-01-10 | Paper |
| Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees | 2017-12-05 | Paper |
| Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs | 2015-07-23 | Paper |
| Obstructions for linear rank-width at most 1 | 2014-04-02 | Paper |
| Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs | 2013-12-06 | Paper |
| Extremal graphs having no matching cuts | 2012-02-08 | Paper |
| A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition | 2011-08-17 | Paper |
| Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs | 2011-03-14 | Paper |
| Generation of Graphs with Bounded Branchwidth | 2008-09-04 | Paper |
| Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs | 2008-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5443196 | 2008-02-20 | Paper |
| Priority-Consistent Graphs | 2007-05-29 | Paper |
| Coloring mixed hypertrees | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677897 | 2005-05-23 | Paper |
| On routing of wavebands for all-to-all communications in all-optical paths and cycles | 2005-04-06 | Paper |
| Embeddings of \(k\)-connected graphs of pathwidth \(k\) | 2005-02-22 | Paper |
| Systems of distant representatives | 2005-02-22 | Paper |
| Spanners and message distribution in networks. | 2004-03-14 | Paper |
| Multi-source spanning trees: Algorithms for minimizing source eccentricities. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448371 | 2004-02-18 | Paper |
| The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422267 | 2003-09-03 | Paper |
| Multicoloring trees. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766689 | 2002-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721972 | 2001-07-11 | Paper |
| Stable 2-pairs and \((X,Y)\)-intersection graphs | 2001-07-05 | Paper |
| Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees | 2000-08-27 | Paper |
| Memory requirements for table computations in partial \(k\)-tree algorithms | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281679 | 2000-08-14 | Paper |
| Hamiltonicity of amalgams | 2000-07-05 | Paper |
| Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222093 | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836524 | 1999-12-09 | Paper |
| Minimum-time multidrop broadcast | 1999-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223772 | 1999-04-19 | Paper |
| Covering regular graphs | 1998-08-10 | Paper |
| Minimum self-repairing graphs | 1998-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373685 | 1998-06-11 | Paper |
| Algorithms for Vertex Partitioning Problems on Partial k-Trees | 1998-02-09 | Paper |
| Characterization and complexity of uniformly nonprimitive labeled 2-structures | 1997-02-28 | Paper |
| Plane Embeddings of 2-Trees and Biconnected Partial 2-Trees | 1996-12-01 | Paper |
| A generalization of line graphs: (X, Y)-intersection graphs | 1996-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863460 | 1996-07-02 | Paper |
| Bounded-call broadcasting | 1995-03-05 | Paper |
| An algebraic theory of graph reduction | 1994-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273872 | 1994-05-19 | Paper |
| Efficient sets in partial \(k\)-trees | 1993-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037299 | 1993-05-18 | Paper |
| Canonical representations of partial 2- and 3-trees | 1992-12-14 | Paper |
| Forbidden minors characterization of partial 3-trees | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3198869 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3472149 | 1990-01-01 | Paper |
| Generating binary trees by transpositions | 1990-01-01 | Paper |
| Linear time algorithms for NP-hard problems restricted to partial k- trees | 1989-01-01 | Paper |
| Centering a spanning tree of a biconnected graph | 1989-01-01 | Paper |
| On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3475304 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796773 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3816031 | 1988-01-01 | Paper |
| Complexity of Finding Embeddings in a k-Tree | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785967 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3029044 | 1986-01-01 | Paper |
| Efficient Vertex- and Edge-Coloring of Outerplanar Graphs | 1986-01-01 | Paper |
| Characterization and Recognition of Partial 3-Trees | 1986-01-01 | Paper |
| Interior graphs of maximal outerplane graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3342593 | 1985-01-01 | Paper |
| Binary tree gray codes | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758844 | 1985-01-01 | Paper |
| Separating subgraphs in k-trees: Cables and caterpillars | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3042417 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3042845 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218070 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325749 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334090 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337494 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337498 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322145 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325753 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669435 | 1983-01-01 | Paper |
| Directed maximal-cut problems | 1982-01-01 | Paper |
| Networks immune to isolated line failures | 1982-01-01 | Paper |
| Isomorphism Testing in Hookup Classes | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745270 | 1982-01-01 | Paper |
| Partitioning trees: Matching, domination, and maximum diameter | 1981-01-01 | Paper |
| Recursive Graphs, Recursive Labelings and Shortest Paths | 1981-01-01 | Paper |
| Minimum dominating cycles in outerplanar graphs | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3948606 | 1981-01-01 | Paper |
| Broadcasting in Trees with Multiple Originators | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3951566 | 1981-01-01 | Paper |
| Computation of the center and diameter of outerplanar graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3886878 | 1980-01-01 | Paper |
| Centers of 2–Trees | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3901535 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916590 | 1980-01-01 | Paper |
| Centers of maximal outerplanar graphs | 1980-01-01 | Paper |
| Minimum broadcast graphs | 1979-01-01 | Paper |
| Canonical incidence matrices of graphs | 1979-01-01 | Paper |
| Minimum dominating cycles in 2-trees | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206969 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134004 | 1976-01-01 | Paper |
| Search for a unique incidence matrix of a graph | 1974-01-01 | Paper |
