| Publication | Date of Publication | Type |
|---|
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
Order | 2024-04-29 | Paper |
Asteroidal triple-free graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Computing a dominating pair in an asteroidal triple-free graph in linear time
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs''
SIAM Journal on Computing | 2021-06-29 | Paper |
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
Automata, Languages and Programming | 2019-01-10 | Paper |
On the power of graph searching for cocomparability graphs
SIAM Journal on Discrete Mathematics | 2016-04-07 | Paper |
A tie-break model for graph search
Discrete Applied Mathematics | 2015-12-10 | Paper |
Vertex ordering characterizations of graphs of bounded asteroidal number
Journal of Graph Theory | 2015-01-21 | Paper |
Practical and efficient circle graph recognition
Algorithmica | 2014-11-19 | Paper |
Practical and efficient split decomposition via graph-labelled trees
Algorithmica | 2014-11-19 | Paper |
LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
SIAM Journal on Computing | 2013-09-25 | Paper |
A simple polynomial algorithm for the longest path problem on cocomparability graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Collective additive tree spanners for circle graphs and polygonal graphs
Discrete Applied Mathematics | 2012-08-14 | Paper |
Polynomial-time recognition of clique-width 3 graphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Vertex splitting and the recognition of trapezoid graphs
Discrete Applied Mathematics | 2011-08-10 | Paper |
The LBFS structure and recognition of interval graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
On end-vertices of lexicographic breadth first searches
Discrete Applied Mathematics | 2010-05-05 | Paper |
A simple linear time LexBFS cograph recognition algorithm.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
A Simple Linear Time LexBFS Cograph Recognition Algorithm
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
A Unified View of Graph Searching
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Additive Spanners for Circle Graphs and Polygonal Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Collective Tree Spanners and Routing in AT-free Related Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Collective Tree Spanners and Routing in AT-free Related Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
Automata, Languages and Programming | 2008-08-28 | Paper |
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
STACS 2007 | 2007-09-03 | Paper |
Simple vertex ordering characterizations for graph search
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Linear Orderings of Subfamilies of AT‐Free Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
2-tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics | 2005-09-28 | Paper |
On the Relationship Between Clique-Width and Treewidth
SIAM Journal on Computing | 2005-09-16 | Paper |
Recognizing Powers of Proper Interval, Split, and Chordal Graphs
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 2086230 (Why is no real title available?) | 2004-08-11 | Paper |
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
Discrete Applied Mathematics | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2044924 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 2044941 (Why is no real title available?) | 2004-02-18 | Paper |
On the power of BFS to determine a graph's diameter
Networks | 2004-02-03 | Paper |
Hereditary dominating pair graphs
Discrete Applied Mathematics | 2004-01-26 | Paper |
Diameter determination on restricted graph families
Discrete Applied Mathematics | 2002-08-14 | Paper |
Stable 2-pairs and (X,Y)-intersection graphs
Discrete Mathematics | 2001-07-05 | Paper |
| scientific article; zbMATH DE number 1512682 (Why is no real title available?) | 2001-05-13 | Paper |
Completeness for intersection classes
Discrete Mathematics | 2000-11-02 | Paper |
Pancyclicity and NP-completeness in planar graphs
Discrete Applied Mathematics | 2000-06-29 | Paper |
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
Tree Powers
Journal of Algorithms | 1999-08-23 | Paper |
| scientific article; zbMATH DE number 1303554 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1305500 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1262798 (Why is no real title available?) | 1999-04-26 | Paper |
The existence of uniquely \(-G\) colourable graphs
Discrete Mathematics | 1998-03-24 | Paper |
Asteroidal Triple-Free Graphs
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
Simple linear time recognition of unit interval graphs
Information Processing Letters | 1997-02-28 | Paper |
A linear time algorithm to compute a dominating path in an AT-free graph
Information Processing Letters | 1997-02-28 | Paper |
| A generalization of perfect graphs?i-perfect graphs | 1996-12-15 | Paper |
| A generalization of line graphs: (X, Y)-intersection graphs | 1996-08-13 | Paper |
On the structure of trapezoid graphs
Discrete Applied Mathematics | 1996-07-07 | Paper |
Isomorphic tree spanner problems
Algorithmica | 1995-10-09 | Paper |
Tree Spanners
SIAM Journal on Discrete Mathematics | 1995-09-20 | Paper |
Stable set bonding in perfect graphs and parity graphs
Journal of Combinatorial Theory. Series B | 1994-08-10 | Paper |
Edge-disjoint packings of graphs
Discrete Applied Mathematics | 1994-06-08 | Paper |
| scientific article; zbMATH DE number 434687 (Why is no real title available?) | 1994-05-19 | Paper |
Polynomial-time instances of the minimum weight triangulation problem
Computational Geometry | 1994-03-03 | Paper |
On the complexity of the embedding problem for hypercube related graphs
Discrete Applied Mathematics | 1993-12-20 | Paper |
ON UNIQUELY -G k-COLOURABLE GRAPHS
Quaestiones Mathematicae | 1993-05-16 | Paper |
On cycle double covers of line graphs
Discrete Mathematics | 1992-09-27 | Paper |
Graph properties and hypergraph colourings
Discrete Mathematics | 1992-06-28 | Paper |
Dominating sets in perfect graphs
Discrete Mathematics | 1992-06-25 | Paper |
Addendum to: The complexity of regular subgraph recognition
Discrete Applied Mathematics | 1992-06-25 | Paper |
Parallel algorithms for parity graphs
Journal of Algorithms | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4202279 (Why is no real title available?) | 1990-01-01 | Paper |
Forbidden minors characterization of partial 3-trees
Discrete Mathematics | 1990-01-01 | Paper |
The complexity of regular subgraph recognition
Discrete Applied Mathematics | 1990-01-01 | Paper |
Embedding Trees in a Hypercube is NP-Complete
SIAM Journal on Computing | 1990-01-01 | Paper |
A note onKi-perfect graphs
Journal of Graph Theory | 1990-01-01 | Paper |
The complexity of generalized clique covering
Discrete Applied Mathematics | 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 4063148 (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 |
On generalized graph colorings
Journal of Graph Theory | 1987-01-01 | Paper |
A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
Ki-covers. II.Ki-perfect graphs
Journal of Graph Theory | 1987-01-01 | Paper |
\(K_ i\)-covers. I: Complexity and polytopes
Discrete Mathematics | 1986-01-01 | Paper |
Families of graphs complete for the strong perfect graph Conjecture
Journal of Graph Theory | 1986-01-01 | Paper |
The complexity of generalized clique packing
Discrete Applied Mathematics | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3866594 (Why is no real title available?) | 1984-01-01 | Paper |
A non-factorial algorithm for canonical numbering of a graph
Journal of Algorithms | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3920497 (Why is no real title available?) | 1983-01-01 | Paper |
On pseudosimilarity in trees
Journal of Combinatorial Theory. Series B | 1983-01-01 | Paper |
A note on a conjecture by Gavril on clique separable graphs
Discrete Mathematics | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3815699 (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 |
Graph Property Update Algorithms and Their Appligation to Distance Matrices
INFOR: Information Systems and Operational Research | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3771635 (Why is no real title available?) | 1981-01-01 | Paper |
Complement reducible graphs
Discrete Applied Mathematics | 1981-01-01 | Paper |
Forest embeddings in regular graphs of large girth
Journal of Combinatorial Theory. Series B | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3720954 (Why is no real title available?) | 1980-01-01 | Paper |
On deciding switching equivalence of graphs
Discrete Applied Mathematics | 1980-01-01 | Paper |
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
SIAM Journal on Computing | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3628390 (Why is no real title available?) | 1979-01-01 | Paper |
Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
Algorithmic Aspects of Combinatorics | 1978-01-01 | Paper |
Parallel Computations in Graph Theory
SIAM Journal on Computing | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3547302 (Why is no real title available?) | 1977-01-01 | Paper |
The graph isomorphism disease
Journal of Graph Theory | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3530974 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3510315 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3480615 (Why is no real title available?) | 1974-01-01 | Paper |
Unicyclic Graphs Satisfy Harary′s Conjecture
Canadian Mathematical Bulletin | 1974-01-01 | Paper |
Corrections to Bierstone's Algorithm for Generating Cliques
Journal of the ACM | 1972-01-01 | Paper |
An algorithm for determining the automorphism partitioning of an undirected graph
BIT | 1972-01-01 | Paper |
An \(n^ 2\) algorithm for determining the bridges of a graph
Information Processing Letters | 1971-01-01 | Paper |
An Efficient Algorithm for Graph Isomorphism
Journal of the ACM | 1970-01-01 | Paper |
Algorithms for finding a fundamental set of cycles for an undirected linear graph
Communications of the ACM | 1967-01-01 | Paper |
