Derek G. Corneil

Publication Activity (10 Years)

Years Active: 1967-2021
Publications (10 Years): 8

Top Venues

Discret. Appl. Math.

CoRR

SIAM J. Discret. Math.

Algorithmica

Publications

Jérémie Dusart, Derek G. Corneil, Michel Habib
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM J. Comput. 50 (3) (2021)
Derek G. Corneil, Robert Ganian, Andrzej Proskurowski
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada. Discret. Appl. Math. 278 (2020)
Derek G. Corneil, Sang-il Oum, Christophe Paul
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. Discret. Appl. Math. 248 (2018)
Jérémie Dusart, Michel Habib, Derek G. Corneil
Maximal cliques structure for cocomparability graphs and applications. CoRR (2016)
Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
A tie-break model for graph search. Discret. Appl. Math. 199 (2016)
Derek G. Corneil, Jérémie Dusart, Michel Habib, Ekkehard Köhler
On the Power of Graph Searching for Cocomparability Graphs. SIAM J. Discret. Math. 30 (1) (2016)
Derek G. Corneil, Juraj Stacho
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number. J. Graph Theory 78 (1) (2015)
Derek G. Corneil, Jérémie Dusart, Michel Habib, Fabien de Montgolfier
A tie-break model for graph search. CoRR (2015)
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
Practical and Efficient Split Decomposition via Graph-Labelled Trees. Algorithmica 69 (4) (2014)
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
Practical and Efficient Circle Graph Recognition. Algorithmica 69 (4) (2014)
Derek G. Corneil, Barnaby Dalton, Michel Habib
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM J. Comput. 42 (3) (2013)
Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics
Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. 160 (6) (2012)
Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang
Collective additive tree spanners for circle graphs and polygonal graphs. Discret. Appl. Math. 160 (12) (2012)
George B. Mertzios, Derek G. Corneil
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs. SIAM J. Discret. Math. 26 (3) (2012)
George B. Mertzios, Derek G. Corneil
Vertex splitting and the recognition of trapezoid graphs. Discret. Appl. Math. 159 (11) (2011)
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
Practical and Efficient Split Decomposition via Graph-Labelled Trees CoRR (2011)
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
Circle Graph Recognition in Time O(n+m) α(n+m) CoRR (2011)
Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel
On end-vertices of Lexicographic Breadth First Searches. Discret. Appl. Math. 158 (5) (2010)
George B. Mertzios, Derek G. Corneil
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs CoRR (2010)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
The LBFS Structure and Recognition of Interval Graphs. SIAM J. Discret. Math. 23 (4) (2009)
Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discret. Math. 22 (4) (2008)
Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang
Additive Spanners for Circle Graphs and Polygonal Graphs. WG (2008)
Derek G. Corneil, Richard Krueger
A Unified View of Graph Searching. SIAM J. Discret. Math. 22 (4) (2008)
Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) (2008)
Marc Tedder, Derek G. Corneil
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. STACS (2007)
Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
Simple, linear-time modular decomposition CoRR (2007)
Derek G. Corneil, Ekkehard Köhler, Stephan Olariu, Lorna Stewart
Linear Orderings of Subfamilies of AT-Free Graphs. SIAM J. Discret. Math. 20 (1) (2006)
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
Collective Tree Spanners and Routing in AT-free Related Graphs. J. Graph Algorithms Appl. 10 (2) (2006)
Natasa Przulj, Derek G. Corneil, Igor Jurisica
Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. Bioinform. 22 (8) (2006)
Natasa Przulj, Derek G. Corneil
2-Tree probe interval graphs have a large obstruction set. Discret. Appl. Math. 150 (1-3) (2005)
Derek G. Corneil, Udi Rotics
On the Relationship Between Clique-Width and Treewidth. SIAM J. Comput. 34 (4) (2005)
Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
Collective Tree 1-Spanners for Interval Graphs. WG (2005)
Derek G. Corneil, Richard Krueger
Simple vertex ordering characterizations for graph search: (expanded abstract). Electron. Notes Discret. Math. 22 (2005)
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
Collective Tree Spanners and Routing in AT-free Related Graphs. WG (2004)
Derek G. Corneil
Lexicographic Breadth First Search - A Survey. WG (2004)
Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad
04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes. Robust and Approximative Algorithms an Particular Graph Classes (2004)
Natasa Przulj, Derek G. Corneil, Ekkehard Köhler
Hereditary dominating pair graphs. Discret. Appl. Math. 134 (1-3) (2004)
Lap Chi Lau, Derek G. Corneil
Recognizing Powers of Proper Interval, Split, and Chordal Graph. SIAM J. Discret. Math. 18 (1) (2004)
Derek G. Corneil
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discret. Appl. Math. 138 (3) (2004)
Natasa Przulj, Derek G. Corneil, Igor Jurisica
Modeling interactome: scale-free or geometric?. Bioinform. 20 (18) (2004)
Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG (2003)
Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
On the power of BFS to determine a graph's diameter. Networks 42 (4) (2003)
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
Automatic generation of synthetic sequential benchmark circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21 (8) (2002)
Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
On the Power of BFS to Determine a Graphs Diameter. LATIN (2002)
Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
Diameter determination on restricted graph families. Discret. Appl. Math. 113 (2-3) (2001)
Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski
)-intersection graphs. Discret. Math. 230 (1-3) (2001)
Derek G. Corneil, Udi Rotics
On the Relationship between Clique-Width and Treewidth. WG (2001)
Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart
On Subfamilies of AT-Free Graphs. WG (2001)
Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). LATIN (2000)
Mingchu Li, Derek G. Corneil, Eric Mendelsohn
Pancyclicity and NP-completeness in Planar Graphs. Discret. Appl. Math. 98 (3) (2000)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. SIAM J. Comput. 28 (4) (1999)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
LBFS Orderings and Cocomparability Graphs. SODA (1999)
Michael D. Hutton, Jonathan Rose, Jerry P. Grossman, Derek G. Corneil
Characterization and parameterized generation of synthetic combinational benchmark circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17 (10) (1998)
Timothy B. Moorhouse, Derek G. Corneil
Completeness for intersection classes. Discret. Math. 190 (1-3) (1998)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). SODA (1998)
Paul E. Kearney, Derek G. Corneil
Tree Powers. J. Algorithms 29 (1) (1998)
Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
Diameter Determination on Restricted Graph Faminlies. WG (1998)
Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael Molloy
The existence of uniquely -G colourable graphs. Discret. Math. 179 (1-3) (1998)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Asteroidal Triple-Free Graphs. SIAM J. Discret. Math. 10 (3) (1997)
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
Generation of Synthetic Sequential Benchmark Circuits. FPGA (1997)
Michael D. Hutton, Jerry P. Grossman, Jonathan Rose, Derek G. Corneil
Characterization and Parameterized Random Generation of Digital Circuits. DAC (1996)
F. Cheah, Derek G. Corneil
on the Structure of Trapezoid Graphs. Discret. Appl. Math. 66 (2) (1996)
Leizhen Cai, Derek G. Corneil
-perfect graphs. J. Graph Theory 23 (1) (1996)
Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski
)-intersection graphs. J. Graph Theory 21 (3) (1996)
Leizhen Cai, Derek G. Corneil
Tree Spanners. SIAM J. Discret. Math. 8 (3) (1995)
Leizhen Cai, Derek G. Corneil
Isomorphic Tree Spanner Problems. Algorithmica 14 (2) (1995)
Hazel Everett, Derek G. Corneil
Negative Results on Characterizing Visibility Graphs. Comput. Geom. 5 (1995)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph. Inf. Process. Lett. 54 (5) (1995)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. ICALP (1995)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. WADS (1995)
Derek G. Corneil, Hiryoung Kim, Sridhar Natarajan, Stephan Olariu, Alan P. Sprague
Simple Linear Time Recognition of Unit Interval Graphs. Inf. Process. Lett. 55 (2) (1995)
Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi
Edge-disjoint packings of graphs. Discret. Appl. Math. 50 (2) (1994)
Alan Wagner, Derek G. Corneil
On the Complexity of the Embedding Problem for Hypercube Related Graphs. Discret. Appl. Math. 43 (1) (1993)
Derek G. Corneil, Jean Fonlupt
Stable Set Bonding in Perfect Graphs and Parity Graphs. J. Comb. Theory, Ser. B 59 (1) (1993)
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Asteroidal Triple-Free Graphs. WG (1993)
Efthymios Anagnostou, Derek G. Corneil
Polynomial-time Instances of the Minimum Weight Triangulation Problem. Comput. Geom. 3 (1993)
Leizhen Cai, Derek G. Corneil
On cycle double covers of line graphs. Discret. Math. 102 (1) (1992)
F. Cheah, Derek G. Corneil
Addendum. Discret. Appl. Math. 31 (3) (1991)
Jason I. Brown, Derek G. Corneil
Graph properties and hypergraph colourings. Discret. Math. 98 (2) (1991)
Teresa M. Przytycka, Derek G. Corneil
Parallel Algorithms for Parity Graphs. J. Algorithms 12 (1) (1991)
Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil
Forbidden minors characterization of partial 3-trees. Discret. Math. 80 (1) (1990)
Hazel Everett, Derek G. Corneil
Recognizing Visibility Graphs of Spiral Polygons. J. Algorithms 11 (1) (1990)
F. Cheah, Derek G. Corneil
The complexity of regular subgraph recognition. Discret. Appl. Math. 27 (1-2) (1990)
Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub
-perfect graphs. J. Graph Theory 14 (3) (1990)
Derek G. Corneil, Lorna K. Stewart
Dominating sets in perfect graphs. Discret. Math. 86 (1-3) (1990)
Alan Wagner, Derek G. Corneil
Embedding Trees in a Hypercube is NP-Complete. SIAM J. Comput. 19 (3) (1990)
Derek G. Corneil, Jean Fonlupt
The complexity of generalized clique covering. Discret. Appl. Math. 22 (2) (1989)
Jason I. Brown, Derek G. Corneil
On generalized graph colorings. J. Graph Theory 11 (1) (1987)
Derek G. Corneil
Families of graphs complete for the strong perfect graph Conjecture. J. Graph Theory 10 (1) (1986)
Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub
-covers I: Complexity and polytopes. Discret. Math. 58 (2) (1986)
Derek G. Corneil
The complexity of generalized clique packing. Discret. Appl. Math. 12 (3) (1985)
Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart
A Linear Recognition Algorithm for Cographs. SIAM J. Comput. 14 (4) (1985)
Derek G. Corneil, Yehoshua Perl
Clustering and domination in perfect graphs. Discret. Appl. Math. 9 (1) (1984)
Derek G. Corneil, Mark K. Goldberg
A Non-Factorial Algorithm for Canonical Numbering of a Graph. J. Algorithms 5 (3) (1984)
David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil
On pseudosimilarity in trees. J. Comb. Theory, Ser. B 34 (3) (1983)
Derek G. Corneil, J. Mark Keil
A note on a conjecture by Gavril on clique separable graphs. Discret. Math. 46 (3) (1983)
David G. Kirkpatrick, Derek G. Corneil
Forest embeddings in regular graphs of large girth. J. Comb. Theory, Ser. B 30 (1) (1981)
Derek G. Corneil, H. Lerchs, L. Stewart Burlingham
Complement reducible graphs. Discret. Appl. Math. 3 (3) (1981)
Charles J. Colbourn, Derek G. Corneil
On deciding switching equivalence of graphs. Discret. Appl. Math. 2 (3) (1980)
Derek G. Corneil, David G. Kirkpatrick
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. SIAM J. Comput. 9 (2) (1980)

Derek G. Corneil.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Derek G. Corneil