D. Corneil

发表

An Efficient Algorithm for Graph Isomorphism

D. Corneil, C. Gotlieb, Derek G. Corneil, 1970, JACM.

Complexity of finding embeddings in a k -tree

Derek G. Corneil, Andrzej Proskurowski, Stefan Arnborg, 1987 .

Efficient cluster compensation for lin-kernighan heuristics

D. Corneil, David Michael Neto, 1999 .

A dynamic programming approach to the dominating set problem on k trees

D. Corneil, J. Keil, 1987 .

Clustering and domination in perfect graphs

Yehoshua Perl, Derek G. Corneil, D. Corneil, 1984, Discret. Appl. Math..

Lexicographic Breadth First Search - A Survey

Derek G. Corneil, D. Corneil, 2004, WG.

Asteroidal Triple-Free Graphs

Stephan Olariu, Lorna Stewart, Derek G. Corneil, 1997, SIAM J. Discret. Math..

A recognition algorithm for II-graphs

D. Corneil, H. K. Cheah, 1990 .

Modeling interactome: scale-free or geometric?

Igor Jurisica, Natasa Przulj, Derek G. Corneil, 2004, Bioinform..

Isomorphism Testing in Hookup Classes

D. Corneil, M. Klawe, A. Proskurowski, 1982 .

Circle Graph Recognition in Time $O(n+m) \alpha(n+m)$

D. Corneil, C. Paul, E. Gioan, 2011 .

Unified View of Graph Searching and LDFS-Based Certifying Algorithms

M. Habib, D. Corneil, 2016, Encyclopedia of Algorithms.

Deposited in DRO : 08 September 2014 Version of attached le : Published Version Peer-review status of attached le : Peer-reviewed Citation for published item

D. Corneil, G. Mertzios, 2014 .

Polynomial Time Recognition of Clique-Width ≤ 3 Graphs

B. Reed, M. Habib, D. Corneil, 2000 .

Corrections to Bierstone's Algorithm for Generating Cliques

Derek G. Corneil, Gordon D. Mulligan, D. Corneil, 1972, J. ACM.

A generalization of line graphs: (X, Y)-intersection graphs

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski, 1996, J. Graph Theory.

Simple, linear-time modular decomposition

M. Habib, D. Corneil, C. Paul, 2007, ArXiv.

D M ] 2 1 O ct 2 00 7 Simple , Linear-time Modular Decomposition ∗ ( extended abstract )

M. Habib, D. Corneil, C. Paul, 2007 .

The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract).

Stephan Olariu, Lorna Stewart, Derek G. Corneil, 1998, ACM-SIAM Symposium on Discrete Algorithms.

Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada

Robert Ganian, Derek G. Corneil, Andrzej Proskurowski, 2020, Discrete Applied Mathematics.

New Results - Understanding graph representations

Jean-Sébastien Sereni, Laurent Viennot, Roberto Grossi, 2013 .

Pancyclicity and NP-completeness in Planar Graphs

Mingchu Li, Derek G. Corneil, Eric Mendelsohn, 2000, Discret. Appl. Math..

A generalization of perfect graphs— i -perfect graphs

Leizhen Cai, Derek G. Corneil, D. Corneil, 1996 .

Graph properties and hypergraph colourings

Jason I. Brown, Derek G. Corneil, D. Corneil, 1991, Discret. Math..

The existence of uniquely -G colourable graphs

Michael Molloy, Jason I. Brown, Derek G. Corneil, 1998, Discret. Math..

ON UNIQUELY PARTITIONABLE RELATIONAL STRUCTURES AND OBJECT SYSTEMS

D. Corneil, J. I. Brown, 2006 .

An n² Algorithm for Determining the Bridges of a Graph

Derek G. Corneil, D. Corneil, 1971, Inf. Process. Lett..

Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

Michel Habib, Jérémie Dusart, Derek G. Corneil, 2021, SIAM J. Comput..

Circle Graph Recognition in Time O(n+m) α(n+m) pdf

Emeric Gioan, Christophe Paul, Derek G. Corneil, 2011, ArXiv.

A Linear Algorithm for Unit Interval Graph Recognition

Stephan Olariu, Derek G. Corneil, Sridhar Natarajan, 1992 .

Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015

Christophe Paul, Derek G. Corneil, Sang-il Oum, 2018, Discret. Appl. Math..

Unified View of Graph Searching and LDFS-Based Certifying Algorithms

Michel Habib, Derek G. Corneil, M. Habib, 2016, Encyclopedia of Algorithms.

Addendum

Derek G. Corneil, F. Cheah, D. Corneil, 1991, Discret. Appl. Math..

Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)

Udi Rotics, Michel Habib, Jean-Marc Lanlignel, 2000, Latin American Symposium on Theoretical Informatics.

On generalized graph colorings

Jason I. Brown, Derek G. Corneil, D. Corneil, 1987, J. Graph Theory.

A Linear Recognition Algorithm for Cographs

Lorna Stewart, Yehoshua Perl, Derek G. Corneil, 1985, SIAM J. Comput..

Complement reducible graphs

Derek G. Corneil, H. Lerchs, L. Stewart Burlingham, 1981, Discret. Appl. Math..

A Simple Linear Time LexBFS Cograph Recognition Algorithm

Michel Habib, Christophe Paul, Derek G. Corneil, 2003, WG.

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations

Michel Habib, Christophe Paul, Derek G. Corneil, 2008, ICALP.

The graph isomorphism disease

Derek G. Corneil, Ronald C. Read, D. Corneil, 1977, J. Graph Theory.

Efficient estimation of graphlet frequency distributions in protein-protein interaction networks

Igor Jurisica, Natasa Przulj, Derek G. Corneil, 2006, Bioinform..

A Non-Factorial Algorithm for Canonical Numbering of a Graph

Mark K. Goldberg, Derek G. Corneil, D. Corneil, 1984, J. Algorithms.

Algorithms for finding a fundamental set of cycles for an undirected linear graph

Calvin C. Gotlieb, Derek G. Corneil, D. Corneil, 1967, CACM.

Polynomial-time Instances of the Minimum Weight Triangulation Problem

Derek G. Corneil, Efthymios Anagnostou, D. Corneil, 1993, Comput. Geom..

On deciding switching equivalence of graphs

Charles J. Colbourn, Derek G. Corneil, D. Corneil, 1980, Discret. Appl. Math..

The LBFS Structure and Recognition of Interval Graphs

Stephan Olariu, Lorna Stewart, Derek G. Corneil, 2009, SIAM J. Discret. Math..

Tree Spanners

Leizhen Cai, Derek G. Corneil, D. Corneil, 1995, SIAM J. Discret. Math..

The syllabus for the 1970 University of Toronto Ph. D. written comprehensive examination

Derek G. Corneil, D. Corneil, 1970, SGCS.

An Algorithm for Determining the Chromatic Number of a Graph

Bruce P. Graham, Derek G. Corneil, D. Corneil, 1973, SIAM J. Comput..

Ki-covers. II. Ki-perfect graphs

Ali Ridha Mahjoub, Michele Conforti, Derek G. Corneil, 1987, J. Graph Theory.

Ki-covers I: Complexity and polytopes

Ali Ridha Mahjoub, Derek G. Corneil, M Conforti, 1986, Discret. Math..

Maximal cliques structure for cocomparability graphs and applications pdf

Michel Habib, Jérémie Dusart, Derek G. Corneil, 2016, ArXiv.

A tie-break model for graph search

Michel Habib, Jérémie Dusart, Fabien de Montgolfier, 2015, Discret. Appl. Math..

Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number

Juraj Stacho, Derek G. Corneil, D. Corneil, 2015, J. Graph Theory.

Collective additive tree spanners for circle graphs and polygonal graphs

Yang Xiang, Feodor F. Dragan, Ekkehard Köhler, 2012, Discret. Appl. Math..

Vertex splitting and the recognition of trapezoid graphs

Derek G. Corneil, George B. Mertzios, D. Corneil, 2011, Discret. Appl. Math..

Practical and Efficient Circle Graph Recognition

Emeric Gioan, Christophe Paul, Derek G. Corneil, 2011, Algorithmica.

Practical and Efficient Split Decomposition via Graph-Labelled Trees

Emeric Gioan, Christophe Paul, Derek G. Corneil, 2011, Algorithmica.

A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs

Derek G. Corneil, George B. Mertzios, D. Corneil, 2010, SIAM J. Discret. Math..

Additive Spanners for Circle Graphs and Polygonal Graphs

Yang Xiang, Feodor F. Dragan, Ekkehard Köhler, 2008, WG.

A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs

Derek G. Corneil, D. Corneil, 2004, Discret. Appl. Math..

Polynomial-time recognition of clique-width ≤3 graphs

Udi Rotics, Michel Habib, Jean-Marc Lanlignel, 2012, Discret. Appl. Math..

On the Relationship Between Clique-Width and Treewidth

Udi Rotics, Derek G. Corneil, D. Corneil, 2001, SIAM J. Comput..

A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem

David G. Kirkpatrick, Derek G. Corneil, D. Corneil, 1980, SIAM J. Comput..

On pseudosimilarity in trees

David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil, 1983, J. Comb. Theory, Ser. B.

Dominating sets in perfect graphs

Lorna Stewart, Derek G. Corneil, D. Corneil, 1991, Discret. Math..

The ultimate interval graph recognition algorithm?

Stephan Olariu, Lorna Stewart, Derek G. Corneil, 1998, SODA '98.

Diameter determination on restricted graph families

Feodor F. Dragan, Michel Habib, Christophe Paul, 1998, Discret. Appl. Math..

Hereditary dominating pair graphs

Ekkehard Köhler, Natasa Przulj, Derek G. Corneil, 2004, Discret. Appl. Math..

On the power of BFS to determine a graph's diameter

Feodor F. Dragan, Ekkehard Köhler, Derek G. Corneil, 2003, Networks.

Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs

Stephan Olariu, Lorna Stewart, Derek G. Corneil, 1995, SIAM J. Comput..

A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph

Stephan Olariu, Lorna Stewart, Derek G. Corneil, 1995, Inf. Process. Lett..

Asteroidal Triple-Free Graphs

Stephan Olariu, Lorna Stewart, Derek G. Corneil, 1993, SIAM J. Discret. Math..

Forbidden minors characterization of partial 3-trees

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski, 1990, Discret. Math..

Characterization and parameterized generation of synthetic combinational benchmark circuits

J. P. Grossman, Jonathan Rose, Mike Hutton, 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

A Unified View of Graph Searching

Derek G. Corneil, Richard Krueger, D. Corneil, 2008, SIAM J. Discret. Math..

LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

Michel Habib, Derek G. Corneil, Barnaby Dalton, 2013, SIAM J. Comput..

Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time

Stephan Olariu, Lorna Stewart, Derek G. Corneil, 1995, WADS.

Unicyclic Graphs Satisfy Harary′s Conjecture

D. Corneil, E. Arjomandi, D. G. Corneil, 1974, Canadian Mathematical Bulletin.

On the Power of Graph Searching for Cocomparability Graphs

Ekkehard Köhler, Michel Habib, Jérémie Dusart, 2016, SIAM J. Discret. Math..

On end-vertices of Lexicographic Breadth First Searches

Ekkehard Köhler, Jean-Marc Lanlignel, Derek G. Corneil, 2010, Discret. Appl. Math..

Families of graphs complete for the strong perfect graph Conjecture

D. G. Corneil, D. Corneil, 1986, J. Graph Theory.

A generalization of perfect graphs - i-perfect graphs

Leizhen Cai, Derek G. Corneil, D. Corneil, 1996, J. Graph Theory.

Simple Linear Time Recognition of Unit Interval Graphs

Stephan Olariu, Alan P. Sprague, Derek G. Corneil, 1995, Inf. Process. Lett..

Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations

Derek G. Corneil, Rudolf Mathon, D. Corneil, 1978 .

Automatic generation of synthetic sequential benchmark circuits

Jonathan Rose, Mike Hutton, Derek G. Corneil, 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Negative Results on Characterizing Visibility Graphs

Hazel Everett, Derek G. Corneil, D. Corneil, 1995, Comput. Geom..