| Publication | Date of Publication | Type |
|---|
Finding and counting small induced subgraphs efficiently
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Rankings of graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Dominoes
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Approximating the bandwidth for asteroidal triple-free graphs
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Complexity of paired domination in at-free and planar graphs
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
Vertex ranking of asteroidal triple-free graphs
| 2023-01-25 | Paper |
Testing superperfection of k-trees
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Complexity of paired domination in AT-free and planar graphs
Theoretical Computer Science | 2022-08-25 | Paper |
A simple linear time algorithm for triangulating three-colored graphs
STACS 92 | 2022-08-18 | Paper |
scientific article; zbMATH DE number 7511525 (Why is no real title available?)
| 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
Theoretical Computer Science | 2021-01-25 | Paper |
Treewidth and pathwidth of permutation graphs
Automata, Languages and Programming | 2019-03-29 | Paper |
Independent sets in asteroidal triple-free graphs
Automata, Languages and Programming | 2018-07-04 | Paper |
On retracts, absolute retracts, and foldings in cographs
Optimization Letters | 2018-05-28 | Paper |
On complexities of minus domination
Discrete Optimization | 2018-05-24 | Paper |
On the Grundy number of Cameron graphs
| 2018-04-10 | Paper |
On efficient absorbant conjecture in generalized de Bruijn digraphs
International Journal of Computer Mathematics | 2017-07-28 | Paper |
Gray Codes for AT-Free Orders
| 2017-06-20 | Paper |
Convex independence in permutation graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
P_3-Games on Chordal Bipartite Graphs
| 2016-10-22 | Paper |
Finding and counting small induced subgraphs efficiently
Information Processing Letters | 2016-06-16 | Paper |
Vertex ranking of asteroidal triple-free graphs
Information Processing Letters | 2016-06-09 | Paper |
Bandwidth of chain graphs
Information Processing Letters | 2016-06-09 | Paper |
Gray codes for AT-free orders via antimatroids
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Rainbow domination and related problems on some classes of perfect graphs
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Edge-clique covers of the tensor product
Theoretical Computer Science | 2015-12-08 | Paper |
On maximum independent set of categorical product and ultimate categorical ratios of graphs
Theoretical Computer Science | 2015-06-11 | Paper |
Edge-clique covers of the tensor product
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
Journal of Discrete Algorithms | 2015-02-13 | Paper |
The combinatorics of N. G. de Bruijn
Indagationes Mathematicae. New Series | 2014-09-03 | Paper |
In memoriam: Nicolaas Govert de Bruijn (1918--2012). Complementarity
Nieuw Archief voor Wiskunde. Vijfde Serie | 2014-08-28 | Paper |
\(k\)-cographs are Kruskalian
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Theoretical Computer Science | 2014-04-15 | Paper |
On edge-independent sets
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
On perfect absorbants in de Bruijn digraphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 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
Algorithms and Computation | 2014-02-18 | Paper |
New parameterized algorithms for the edge dominating set problem
Theoretical Computer Science | 2014-01-13 | Paper |
On complexities of minus domination
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
On retracts, absolute retracts, and folds in cographs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Set Representations of Linegraphs
| 2013-08-31 | Paper |
On independence domination
Fundamentals of Computation Theory | 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
WALCOM: Algorithms and Computation | 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
Lecture Notes in Computer Science | 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
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 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
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Block-graph width
Theoretical Computer Science | 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
Computer Science – Theory and Applications | 2010-06-22 | Paper |
On probe permutation graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
On some simple widths
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Trivially-perfect width
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
Journal of Combinatorial Theory. Series B | 2009-06-23 | Paper |
Block-Graph Width
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Efficient algorithms for Roman domination on some classes of graphs
Discrete Applied Mathematics | 2009-03-04 | Paper |
Partitioned Probe Comparability Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Probe Ptolemaic Graphs
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Partitioned probe comparability graphs
Theoretical Computer Science | 2008-05-28 | Paper |
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Probe Matrix Problems: Totally Balanced Matrices
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
scientific article; zbMATH DE number 5158503 (Why is no real title available?)
| 2007-05-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Improved bottleneck domination algorithms
Discrete Applied Mathematics | 2006-08-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Kernels in planar digraphs
Journal of Computer and System Sciences | 2005-08-03 | Paper |
Computing the branchwidth of interval graphs
Discrete Applied Mathematics | 2005-02-22 | Paper |
Approximations for -Colorings of Graphs
The Computer Journal | 2004-07-01 | Paper |
scientific article; zbMATH DE number 2044919 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 1953101 (Why is no real title available?)
| 2003-07-25 | Paper |
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
Algorithmica | 2002-12-01 | Paper |
Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
Discrete Applied Mathematics | 2002-07-22 | Paper |
On the structure of graphs with bounded asteroidal number
Graphs and Combinatorics | 2002-07-14 | Paper |
scientific article; zbMATH DE number 1696538 (Why is no real title available?)
| 2002-07-09 | Paper |
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
Algorithmica | 2002-05-21 | Paper |
scientific article; zbMATH DE number 1500531 (Why is no real title available?)
| 2002-04-08 | Paper |
Fixed-parameter complexity of \(\lambda\)-labelings
Discrete Applied Mathematics | 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
Discrete Mathematics | 2001-07-18 | Paper |
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
Journal of Algorithms | 2000-12-18 | Paper |
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
Discrete Applied Mathematics | 2000-07-19 | Paper |
scientific article; zbMATH DE number 1420489 (Why is no real title available?)
| 2000-06-27 | Paper |
scientific article; zbMATH DE number 1420920 (Why is no real title available?)
| 2000-06-07 | Paper |
scientific article; zbMATH DE number 1414315 (Why is no real title available?)
| 2000-03-16 | Paper |
scientific article; zbMATH DE number 1414319 (Why is no real title available?)
| 2000-03-16 | Paper |
On the vertex ranking problem for trapezoid, circular-arc and other graphs
Discrete Applied Mathematics | 2000-01-17 | Paper |
scientific article; zbMATH DE number 1304318 (Why is no real title available?)
| 1999-11-02 | Paper |
scientific article; zbMATH DE number 1354123 (Why is no real title available?)
| 1999-10-31 | Paper |
Independent Sets in Asteroidal Triple-Free Graphs
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
scientific article; zbMATH DE number 1301101 (Why is no real title available?)
| 1999-06-15 | Paper |
scientific article; zbMATH DE number 1262790 (Why is no real title available?)
| 1999-04-26 | Paper |
scientific article; zbMATH DE number 1222606 (Why is no real title available?)
| 1999-03-02 | Paper |
Treewidth and Minimum Fill-in on d-Trapezoid Graphs
Journal of Graph Algorithms and Applications | 1998-10-28 | Paper |
scientific article; zbMATH DE number 1107735 (Why is no real title available?)
| 1998-10-19 | Paper |
On treewidth and minimum fill-in of asteroidal triple-free graphs
Theoretical Computer Science | 1998-07-23 | Paper |
scientific article; zbMATH DE number 1107726 (Why is no real title available?)
| 1998-06-23 | Paper |
Rankings of Graphs
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
Listing all Minimal Separators of a Graph
SIAM Journal on Computing | 1998-05-10 | Paper |
Measuring the vulnerability for classes of intersection graphs
Discrete Applied Mathematics | 1998-02-16 | Paper |
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
Journal of Algorithms | 1997-05-11 | Paper |
Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
Information Processing Letters | 1997-02-28 | Paper |
On the equivalence covering number of splitgraphs
Information Processing Letters | 1997-02-28 | Paper |
\(K_{1,3}\)-free and \(W_4\)-free graphs
Information Processing Letters | 1997-02-28 | Paper |
TREEWIDTH OF CIRCLE GRAPHS
International Journal of Foundations of Computer Science | 1996-11-26 | Paper |
Treewidth of Chordal Bipartite Graphs
Journal of Algorithms | 1996-05-28 | Paper |
Treewidth and Pathwidth of Permutation Graphs
SIAM Journal on Discrete Mathematics | 1996-02-20 | Paper |
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Journal of Algorithms | 1995-08-20 | Paper |
Treewidth. Computations and approximations
Lecture Notes in Computer Science | 1994-12-01 | Paper |
scientific article; zbMATH DE number 512817 (Why is no real title available?)
| 1994-03-10 | Paper |
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
Journal of Algorithms | 1993-12-09 | Paper |
scientific article; zbMATH DE number 219228 (Why is no real title available?)
| 1993-06-29 | Paper |
scientific article; zbMATH DE number 176762 (Why is no real title available?)
| 1993-05-18 | Paper |
An infinite sequence of \(\Gamma{}\Delta{}\)-regular graphs
Discrete Mathematics | 1992-06-25 | Paper |
A class of graphs containing the polar spaces
European Journal of Combinatorics | 1986-01-01 | Paper |
