| Publication | Date of Publication | Type |
|---|
Complexity of graph covering problems
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Defensive domination in proper interval graphs
Discrete Applied Mathematics | 2023-03-29 | Paper |
Practical algorithms on partial k-trees with an application to domination-like problems
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Memory requirements for table computations in partial k-tree algorithms
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Canonical representations of partial 2-and 3-trees
SWAT 90 | 2022-12-09 | Paper |
Seeing Arboretum for the (partial k-) Trees
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
The complexity of the defensive domination problem in special graph classes
Discrete Mathematics | 2019-12-17 | Paper |
A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
Lecture Notes in Computer Science | 2019-01-10 | Paper |
Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
Algorithms — ESA '96 | 2017-12-05 | Paper |
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory | 2015-07-23 | Paper |
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory | 2015-07-23 | Paper |
Obstructions for linear rank-width at most 1
Discrete Applied Mathematics | 2014-04-02 | Paper |
Obstructions for linear rank-width at most 1
Discrete Applied Mathematics | 2014-04-02 | Paper |
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Extremal graphs having no matching cuts
Journal of Graph Theory | 2012-02-08 | Paper |
A generic approach to decomposition algorithms, with an application to digraph decomposition
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
Theoretical Computer Science | 2011-03-14 | Paper |
Generation of Graphs with Bounded Branchwidth
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
| Graph covering via shortest paths | 2008-02-20 | Paper |
Priority-Consistent Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Coloring mixed hypertrees
Discrete Applied Mathematics | 2006-04-28 | Paper |
| scientific article; zbMATH DE number 2170409 (Why is no real title available?) | 2005-05-23 | Paper |
On routing of wavebands for all-to-all communications in all-optical paths and cycles
Theoretical Computer Science | 2005-04-06 | Paper |
Systems of distant representatives
Discrete Applied Mathematics | 2005-02-22 | Paper |
Embeddings of \(k\)-connected graphs of pathwidth \(k\)
Discrete Applied Mathematics | 2005-02-22 | Paper |
Spanners and message distribution in networks.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Multi-source spanning trees: Algorithms for minimizing source eccentricities.
Discrete Applied Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2044507 (Why is no real title available?) | 2004-02-18 | Paper |
The complexity of minimizing certain cost metrics for k-source spanning trees.
Discrete Applied Mathematics | 2003-09-25 | Paper |
| scientific article; zbMATH DE number 1974112 (Why is no real title available?) | 2003-09-03 | Paper |
Multicoloring trees.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1696541 (Why is no real title available?) | 2002-07-09 | Paper |
| scientific article; zbMATH DE number 1617252 (Why is no real title available?) | 2001-07-11 | Paper |
Stable 2-pairs and \((X,Y)\)-intersection graphs
Discrete Mathematics | 2001-07-05 | Paper |
Faster algorithms for subgraph isomorphism of k-connected partial k-trees
Algorithmica | 2000-08-27 | Paper |
Memory requirements for table computations in partial k-tree algorithms
Algorithmica | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 512967 (Why is no real title available?) | 2000-08-14 | Paper |
Hamiltonicity of amalgams
Graphs and Combinatorics | 2000-07-05 | Paper |
Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time
Theoretical Computer Science | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1229626 (Why is no real title available?) | 2000-02-09 | Paper |
| scientific article; zbMATH DE number 1375584 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1375584 (Why is no real title available?) | 1999-12-09 | Paper |
Minimum-time multidrop broadcast
Discrete Applied Mathematics | 1999-05-30 | Paper |
| scientific article; zbMATH DE number 1236360 (Why is no real title available?) | 1999-04-19 | Paper |
Covering regular graphs
Journal of Combinatorial Theory. Series B | 1998-08-10 | Paper |
Minimum self-repairing graphs
Graphs and Combinatorics | 1998-06-29 | Paper |
| scientific article; zbMATH DE number 1107736 (Why is no real title available?) | 1998-06-11 | Paper |
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
Characterization and complexity of uniformly nonprimitive labeled 2-structures
Theoretical Computer Science | 1997-02-28 | Paper |
Plane Embeddings of 2-Trees and Biconnected Partial 2-Trees
SIAM Journal on Discrete Mathematics | 1996-12-01 | Paper |
| A generalization of line graphs: (X, Y)-intersection graphs | 1996-08-13 | Paper |
| scientific article; zbMATH DE number 841614 (Why is no real title available?) | 1996-07-02 | Paper |
Bounded-call broadcasting
Discrete Applied Mathematics | 1995-03-05 | Paper |
An algebraic theory of graph reduction
Journal of the ACM | 1994-09-11 | Paper |
| scientific article; zbMATH DE number 475616 (Why is no real title available?) | 1994-05-19 | Paper |
Efficient sets in partial k-trees
Discrete Applied Mathematics | 1993-11-30 | Paper |
| scientific article; zbMATH DE number 177426 (Why is no real title available?) | 1993-05-18 | Paper |
Canonical representations of partial 2- and 3-trees
BIT | 1992-12-14 | Paper |
| scientific article; zbMATH DE number 4174333 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4139807 (Why is no real title available?) | 1990-01-01 | Paper |
Generating binary trees by transpositions
Journal of Algorithms | 1990-01-01 | Paper |
Forbidden minors characterization of partial 3-trees
Discrete Mathematics | 1990-01-01 | Paper |
Linear time algorithms for NP-hard problems restricted to partial k- trees
Discrete Applied Mathematics | 1989-01-01 | Paper |
Centering a spanning tree of a biconnected graph
Information Processing Letters | 1989-01-01 | Paper |
On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
Theoretical Computer Science | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4144031 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062616 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4087605 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4049079 (Why is no real title available?) | 1987-01-01 | Paper |
Complexity of Finding Embeddings in a <i>k</i>-Tree
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4016952 (Why is no real title available?) | 1986-01-01 | Paper |
Characterization and Recognition of Partial 3-Trees
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4008410 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3875306 (Why is no real title available?) | 1985-01-01 | Paper |
Interior graphs of maximal outerplane graphs
Journal of Combinatorial Theory. Series B | 1985-01-01 | Paper |
Binary tree gray codes
Journal of Algorithms | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3884101 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3866594 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3869363 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3869366 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3837386 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3837744 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3857141 (Why is no real title available?) | 1984-01-01 | Paper |
Separating subgraphs in k-trees: Cables and caterpillars
Discrete Mathematics | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3853133 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3857145 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3821763 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3800937 (Why is no real title available?) | 1982-01-01 | Paper |
Isomorphism Testing in Hookup Classes
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
Networks immune to isolated line failures
Networks | 1982-01-01 | Paper |
Directed maximal-cut problems
Information Processing Letters | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3770974 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3767061 (Why is no real title available?) | 1981-01-01 | Paper |
Partitioning trees: Matching, domination, and maximum diameter
International Journal of Computer & Information Sciences | 1981-01-01 | Paper |
Broadcasting in Trees with Multiple Originators
SIAM Journal on Algebraic Discrete Methods | 1981-01-01 | Paper |
Minimum dominating cycles in outerplanar graphs
International Journal of Computer & Information Sciences | 1981-01-01 | Paper |
Recursive Graphs, Recursive Labelings and Shortest Paths
SIAM Journal on Computing | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3710197 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3728293 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3692664 (Why is no real title available?) | 1980-01-01 | Paper |
Computation of the center and diameter of outerplanar graphs
Discrete Applied Mathematics | 1980-01-01 | Paper |
Centers of 2–Trees
Combinatorics 79 | 1980-01-01 | Paper |
Centers of maximal outerplanar graphs
Journal of Graph Theory | 1980-01-01 | Paper |
Minimum broadcast graphs
Discrete Mathematics | 1979-01-01 | Paper |
Minimum dominating cycles in 2-trees
International Journal of Computer & Information Sciences | 1979-01-01 | Paper |
Canonical incidence matrices of graphs
BIT | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3648727 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3561376 (Why is no real title available?) | 1976-01-01 | Paper |
Search for a unique incidence matrix of a graph
BIT | 1974-01-01 | Paper |
