2024
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications.
Order, April, 2024
2021
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs.
SIAM J. Comput., 2021
2020
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada.
Discret. Appl. Math., 2020
2018
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015.
Discret. Appl. Math., 2018
2016
Unified View of Graph Searching and LDFS-Based Certifying Algorithms.
Encyclopedia of Algorithms, 2016
On the Power of Graph Searching for Cocomparability Graphs.
SIAM J. Discret. Math., 2016
A tie-break model for graph search.
Discret. Appl. Math., 2016
Maximal cliques structure for cocomparability graphs and applications.
CoRR, 2016
2015
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number.
J. Graph Theory, 2015
A tie-break model for graph search.
CoRR, 2015
2014
Practical and Efficient Split Decomposition via Graph-Labelled Trees.
Algorithmica, 2014
Practical and Efficient Circle Graph Recognition.
Algorithmica, 2014
2013
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs.
SIAM J. Comput., 2013
2012
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs.
SIAM J. Discret. Math., 2012
Collective additive tree spanners for circle graphs and polygonal graphs.
Discret. Appl. Math., 2012
Polynomial-time recognition of clique-width ≤3 graphs.
Discret. Appl. Math., 2012
2011
Vertex splitting and the recognition of trapezoid graphs.
Discret. Appl. Math., 2011
Circle Graph Recognition in Time O(n+m) α(n+m)
CoRR, 2011
2010
On end-vertices of Lexicographic Breadth First Searches.
Discret. Appl. Math., 2010
2009
The LBFS Structure and Recognition of Interval Graphs.
SIAM J. Discret. Math., 2009
2008
A Unified View of Graph Searching.
SIAM J. Discret. Math., 2008
A Simple Linear Time LexBFS Cograph Recognition Algorithm.
SIAM J. Discret. Math., 2008
Additive Spanners for Circle Graphs and Polygonal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
Simple, linear-time modular decomposition
CoRR, 2007
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs.
Proceedings of the STACS 2007, 2007
2006
Linear Orderings of Subfamilies of AT-Free Graphs.
SIAM J. Discret. Math., 2006
Collective Tree Spanners and Routing in AT-free Related Graphs.
J. Graph Algorithms Appl., 2006
Efficient estimation of graphlet frequency distributions in protein-protein interaction networks.
Bioinform., 2006
2005
On the Relationship Between Clique-Width and Treewidth.
SIAM J. Comput., 2005
Simple vertex ordering characterizations for graph search: (expanded abstract).
Electron. Notes Discret. Math., 2005
2-Tree probe interval graphs have a large obstruction set.
Discret. Appl. Math., 2005
Collective Tree 1-Spanners for Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005
2004
Recognizing Powers of Proper Interval, Split, and Chordal Graph.
SIAM J. Discret. Math., 2004
Hereditary dominating pair graphs.
Discret. Appl. Math., 2004
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs.
Discret. Appl. Math., 2004
Modeling interactome: scale-free or geometric?.
Bioinform., 2004
Lexicographic Breadth First Search - A Survey.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes.
Proceedings of the Robust and Approximative Algorithms an Particular Graph Classes, 23.05., 2004
2003
On the power of BFS to determine a graph's diameter.
Networks, 2003
2002
Automatic generation of synthetic sequential benchmark circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002
On the Power of BFS to Determine a Graphs Diameter.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
2001
Stable 2-pairs and (<i>X, Y</i>)-intersection graphs.
Discret. Math., 2001
Diameter determination on restricted graph families.
Discret. Appl. Math., 2001
On Subfamilies of AT-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001
2000
Pancyclicity and NP-completeness in Planar Graphs.
Discret. Appl. Math., 2000
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract).
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
1999
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs.
SIAM J. Comput., 1999
LBFS Orderings and Cocomparability Graphs.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
1998
Characterization and parameterized generation of synthetic combinational benchmark circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1998
Completeness for intersection classes.
Discret. Math., 1998
The existence of uniquely -G colourable graphs.
Discret. Math., 1998
Diameter Determination on Restricted Graph Faminlies.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998
The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
1997
Asteroidal Triple-Free Graphs.
SIAM J. Discret. Math., 1997
Generation of Synthetic Sequential Benchmark Circuits.
Proceedings of the 1997 ACM/SIGDA Fifth International Symposium on Field Programmable Gate Arrays, 1997
1996
A generalization of line graphs: (<i>X, Y</i>)-intersection graphs.
J. Graph Theory, 1996
A generalization of perfect graphs - <i>i</i>-perfect graphs.
J. Graph Theory, 1996
on the Structure of Trapezoid Graphs.
Discret. Appl. Math., 1996
Characterization and Parameterized Random Generation of Digital Circuits.
Proceedings of the 33st Conference on Design Automation, 1996
1995
SIAM J. Discret. Math., 1995
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph.
Inf. Process. Lett., 1995
Simple Linear Time Recognition of Unit Interval Graphs.
Inf. Process. Lett., 1995
Negative Results on Characterizing Visibility Graphs.
Comput. Geom., 1995
Isomorphic Tree Spanner Problems.
Algorithmica, 1995
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995
1994
Edge-disjoint packings of graphs.
Discret. Appl. Math., 1994
1993
Stable Set Bonding in Perfect Graphs and Parity Graphs.
J. Comb. Theory B, 1993
On the Complexity of the Embedding Problem for Hypercube Related Graphs.
Discret. Appl. Math., 1993
Polynomial-time Instances of the Minimum Weight Triangulation Problem.
Comput. Geom., 1993
1992
On cycle double covers of line graphs.
Discret. Math., 1992
1991
Parallel Algorithms for Parity Graphs.
J. Algorithms, 1991
Graph properties and hypergraph colourings.
Discret. Math., 1991
Discret. Appl. Math., 1991
1990
Embedding Trees in a Hypercube is NP-Complete.
SIAM J. Comput., 1990
A note on <i>K<sub>i</sub></i>-perfect graphs.
J. Graph Theory, 1990
Recognizing Visibility Graphs of Spiral Polygons.
J. Algorithms, 1990
Dominating sets in perfect graphs.
Discret. Math., 1990
Forbidden minors characterization of partial 3-trees.
Discret. Math., 1990
The complexity of regular subgraph recognition.
Discret. Appl. Math., 1990
1989
The complexity of generalized clique covering.
Discret. Appl. Math., 1989
1987
<i>K</i><sub><i>i</i></sub>-covers. II. <i>K</i><sub><i>i</i></sub>-perfect graphs.
J. Graph Theory, 1987
On generalized graph colorings.
J. Graph Theory, 1987
1986
Families of graphs complete for the strong perfect graph Conjecture.
J. Graph Theory, 1986
K<sub>i</sub>-covers I: Complexity and polytopes.
Discret. Math., 1986
1985
A Linear Recognition Algorithm for Cographs.
SIAM J. Comput., 1985
The complexity of generalized clique packing.
Discret. Appl. Math., 1985
1984
A Non-Factorial Algorithm for Canonical Numbering of a Graph.
J. Algorithms, 1984
Clustering and domination in perfect graphs.
Discret. Appl. Math., 1984
1983
On pseudosimilarity in trees.
J. Comb. Theory B, 1983
A note on a conjecture by Gavril on clique separable graphs.
Discret. Math., 1983
1981
Forest embeddings in regular graphs of large girth.
J. Comb. Theory B, 1981
Complement reducible graphs.
Discret. Appl. Math., 1981
1980
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem.
SIAM J. Comput., 1980
On deciding switching equivalence of graphs.
Discret. Appl. Math., 1980
1978
Parallel Computations in Graph Theory.
SIAM J. Comput., 1978
1977
The graph isomorphism disease.
J. Graph Theory, 1977
1975
Parallel Computations in Graph Theory
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975
1973
An Algorithm for Determining the Chromatic Number of a Graph.
SIAM J. Comput., 1973
Minimal Event-Node Network of Project Precedence Relations.
Commun. ACM, 1973
1972
Corrections to Bierstone's Algorithm for Generating Cliques.
J. ACM, 1972
1971
An n² Algorithm for Determining the Bridges of a Graph.
Inf. Process. Lett., 1971
1970
The syllabus for the 1970 University of Toronto Ph. D. written comprehensive examination.
ACM SIGCSE Bull., 1970
An Efficient Algorithm for Graph Isomorphism.
J. ACM, 1970
1967
Algorithms for finding a fundamental set of cycles for an undirected linear graph.
Commun. ACM, 1967
