DBLP: Derek G. Corneil

	2012
j66		Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial-time recognition of clique-width ≤3 graphs. Discrete Applied Mathematics 160(6): 834-865 (2012)
j65		Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang: Collective additive tree spanners for circle graphs and polygonal graphs. Discrete Applied Mathematics 160(12): 1717-1729 (2012)
j64		George B. Mertzios, Derek G. Corneil: A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs. SIAM J. Discrete Math. 26(3): 940-963 (2012)
	2011
j63		George B. Mertzios, Derek G. Corneil: Vertex splitting and the recognition of trapezoid graphs. Discrete Applied Mathematics 159(11): 1131-1147 (2011)
i4		Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil: Practical and Efficient Split Decomposition via Graph-Labelled Trees. CoRR abs/1104.3283 (2011)
i3		Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil: Circle Graph Recognition in Time $O(n+m) \alpha(n+m)$. CoRR abs/1104.3284 (2011)
	2010
j62		Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel: On end-vertices of Lexicographic Breadth First Searches. Discrete Applied Mathematics 158(5): 434-443 (2010)
i2		George B. Mertzios, Derek G. Corneil: A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs. CoRR abs/1004.4560 (2010)
	2009
j61		Derek G. Corneil, Stephan Olariu, Lorna Stewart: The LBFS Structure and Recognition of Interval Graphs. SIAM J. Discrete Math. 23(4): 1905-1953 (2009)
	2008
j60		Derek G. Corneil, Richard Krueger: A Unified View of Graph Searching. SIAM J. Discrete Math. 22(4): 1259-1276 (2008)
j59		Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul: A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discrete Math. 22(4): 1277-1296 (2008)
c20		Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) 2008: 634-645
c19		Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang: Additive Spanners for Circle Graphs and Polygonal Graphs. WG 2008: 110-121
	2007
c18		Marc Tedder, Derek G. Corneil: An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. STACS 2007: 344-355
i1		Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simple, linear-time modular decomposition. CoRR abs/0710.3901 (2007)
	2006
j58		Natasa Przulj, Derek G. Corneil, Igor Jurisica: Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. Bioinformatics 22(8): 974-980 (2006)
j57		Feodor F. Dragan, Chenyu Yan, Derek G. Corneil: Collective Tree Spanners and Routing in AT-free Related Graphs. J. Graph Algorithms Appl. 10(2): 97-122 (2006)
j56		Derek G. Corneil, Ekkehard Köhler: Linear Orderings of Subfamilies of AT-Free Graphs. SIAM J. Discrete Math. 20(1): 105-118 (2006)
	2005
j55		Natasa Przulj, Derek G. Corneil: 2-Tree probe interval graphs have a large obstruction set. Discrete Applied Mathematics 150(1-3): 216-231 (2005)
j54		Derek G. Corneil, Richard Krueger: Simple vertex ordering characterizations for graph search: (expanded abstract). Electronic Notes in Discrete Mathematics 22: 445-449 (2005)
j53		Derek G. Corneil, Udi Rotics: On the Relationship Between Clique-Width and Treewidth. SIAM J. Comput. 34(4): 825-847 (2005)
c17		Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan: Collective Tree 1-Spanners for Interval Graphs. WG 2005: 151-162
	2004
j52		Natasa Przulj, Derek G. Corneil, Igor Jurisica: Modeling interactome: scale-free or geometric?. Bioinformatics 20(18): 3508-3515 (2004)
j51		Natasa Przulj, Derek G. Corneil, Ekkehard Köhler: Hereditary dominating pair graphs. Discrete Applied Mathematics 134(1-3): 239-261 (2004)
j50		Derek G. Corneil: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discrete Applied Mathematics 138(3): 371-379 (2004)
j49		Lap Chi Lau, Derek G. Corneil: Recognizing Powers of Proper Interval, Split, and Chordal Graph. SIAM J. Discrete Math. 18(1): 83-102 (2004)
c16		Derek G. Corneil: Lexicographic Breadth First Search - A Survey. WG 2004: 1-19
c15		Feodor F. Dragan, Chenyu Yan, Derek G. Corneil: Collective Tree Spanners and Routing in AT-free Related Graphs. WG 2004: 68-80
	2003
j48		Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler: On the power of BFS to determine a graph's diameter. Networks 42(4): 209-222 (2003)
c14		Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul: A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG 2003: 119-130
	2002
j47		Michael D. Hutton, Jonathan Rose, Derek G. Corneil: Automatic generation of synthetic sequential benchmark circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 21(8): 928-940 (2002)
c13		Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler: On the Power of BFS to Determine a Graphs Diameter. LATIN 2002: 209-223
	2001
j46		Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter determination on restricted graph families. Discrete Applied Mathematics 113(2-3): 143-166 (2001)
j45		Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski: Stable 2-pairs and (X, Y)-intersection graphs. Discrete Mathematics 230(1-3): 119-131 (2001)
c12		Derek G. Corneil, Udi Rotics: On the Relationship between Clique-Width and Treewidth. WG 2001: 78-90
c11		Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart: On Subfamilies of AT-Free Graphs. WG 2001: 241-253
	2000
j44		Ming-Chu Li, Derek G. Corneil, Eric Mendelsohn: Pancyclicity and NP-completeness in Planar Graphs. Discrete Applied Mathematics 98(3): 219-225 (2000)
c10		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: 126-134
	1999
j43		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. SIAM J. Comput. 28(4): 1284-1297 (1999)
c9		Derek G. Corneil, Stephan Olariu, Lorna Stewart: LBFS Orderings and Cocomparability Graphs. SODA 1999: 883-884
	1998
j42		Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy: The existence of uniquely -G colourable graphs. Discrete Mathematics 179(1-3): 1-11 (1998)
j41		Timothy B. Moorhouse, Derek G. Corneil: Completeness for intersection classes. Discrete Mathematics 190(1-3): 277-286 (1998)
j40		Paul E. Kearney, Derek G. Corneil: Tree Powers. J. Algorithms 29(1): 111-131 (1998)
j39		Michael D. Hutton, Jonathan Rose, Jerry P. Grossman, Derek G. Corneil: Characterization and parameterized generation of synthetic combinational benchmark circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 17(10): 985-996 (1998)
c8		Derek G. Corneil, Stephan Olariu, Lorna Stewart: The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). SODA 1998: 175-180
c7		Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter Determination on Restricted Graph Faminlies. WG 1998: 192-202
	1997
j38		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 10(3): 399-430 (1997)
c6		Michael D. Hutton, Jonathan Rose, Derek G. Corneil: Generation of Synthetic Sequential Benchmark Circuits. FPGA 1997: 149-155
	1996
j37		F. Cheah, Derek G. Corneil: on the Structure of Trapezoid Graphs. Discrete Applied Mathematics 66(2): 109-133 (1996)
j36		Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski: A generalization of line graphs: (X, Y)-intersection graphs. Journal of Graph Theory 21(3): 267-287 (1996)
j35		Leizhen Cai, Derek G. Corneil: A generalization of perfect graphs - i-perfect graphs. Journal of Graph Theory 23(1): 87-103 (1996)
c5		Michael D. Hutton, Jerry P. Grossman, Jonathan Rose, Derek G. Corneil: Characterization and Parameterized Random Generation of Digital Circuits. DAC 1996: 94-99
	1995
j34		Leizhen Cai, Derek G. Corneil: Isomorphic Tree Spanner Problems. Algorithmica 14(2): 138-153 (1995)
j33		Hazel Everett, Derek G. Corneil: Negative Results on Characterizing Visibility Graphs. Comput. Geom. 5: 51-63 (1995)
j32		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): 253-257 (1995)
j31		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): 99-104 (1995)
j30		Leizhen Cai, Derek G. Corneil: Tree Spanners. SIAM J. Discrete Math. 8(3): 359-387 (1995)
c4		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. ICALP 1995: 292-302
c3		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. WADS 1995: 358-368
	1994
j29		Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi: Edge-disjoint packings of graphs. Discrete Applied Mathematics 50(2): 135-148 (1994)
	1993
j28		Efthymios Anagnostou, Derek G. Corneil: Polynomial-time Instances of the Minimum Weight Triangulation Problem. Comput. Geom. 3: 247-259 (1993)
j27		Alan Wagner, Derek G. Corneil: On the Complexity of the Embedding Problem for Hypercube Related Graphs. Discrete Applied Mathematics 43(1): 75-95 (1993)
j26		Derek G. Corneil, Jean Fonlupt: Stable Set Bonding in Perfect Graphs and Parity Graphs. J. Comb. Theory, Ser. B 59(1): 1-14 (1993)
c2		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. WG 1993: 211-224
	1992
j25		Leizhen Cai, Derek G. Corneil: On cycle double covers of line graphs. Discrete Mathematics 102(1): 103-106 (1992)
	1991
j24		F. Cheah, Derek G. Corneil: Addendum. Discrete Applied Mathematics 31(3): 309 (1991)
j23		Jason I. Brown, Derek G. Corneil: Graph properties and hypergraph colourings. Discrete Mathematics 98(2): 81-93 (1991)
j22		Teresa M. Przytycka, Derek G. Corneil: Parallel Algorithms for Parity Graphs. J. Algorithms 12(1): 96-109 (1991)
	1990
j21		F. Cheah, Derek G. Corneil: The complexity of regular subgraph recognition. Discrete Applied Mathematics 27(1-2): 59-68 (1990)
j20		Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil: Forbidden minors characterization of partial 3-trees. Discrete Mathematics 80(1): 1-19 (1990)
j19		Derek G. Corneil, Lorna K. Stewart: Dominating sets in perfect graphs. Discrete Mathematics 86(1-3): 145-164 (1990)
j18		Hazel Everett, Derek G. Corneil: Recognizing Visibility Graphs of Spiral Polygons. J. Algorithms 11(1): 1-26 (1990)
j17		Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub: A note on K_i-perfect graphs. Journal of Graph Theory 14(3): 333-340 (1990)
j16		Alan Wagner, Derek G. Corneil: Embedding Trees in a Hypercube is NP-Complete. SIAM J. Comput. 19(3): 570-590 (1990)
	1989
j15		Derek G. Corneil, Jean Fonlupt: The complexity of generalized clique covering. Discrete Applied Mathematics 22(2): 109-118 (1989)
	1986
j14		Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub: K_i-covers I: Complexity and polytopes. Discrete Mathematics 58(2): 121-142 (1986)
	1985
j13		Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart: A Linear Recognition Algorithm for Cographs. SIAM J. Comput. 14(4): 926-934 (1985)
	1984
j12		Derek G. Corneil, Mark K. Goldberg: A Non-Factorial Algorithm for Canonical Numbering of a Graph. J. Algorithms 5(3): 345-362 (1984)
	1983
j11		Derek G. Corneil, J. Mark Keil: A note on a conjecture by Gavril on clique separable graphs. Discrete Mathematics 46(3): 317-318 (1983)
j10		David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil: On pseudosimilarity in trees. J. Comb. Theory, Ser. B 34(3): 323-339 (1983)
	1981
j9		David G. Kirkpatrick, Derek G. Corneil: Forest embeddings in regular graphs of large girth. J. Comb. Theory, Ser. B 30(1): 45-60 (1981)
	1980
j8		Derek G. Corneil, David G. Kirkpatrick: A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. SIAM J. Comput. 9(2): 281-297 (1980)
	1978
j7		Eshrat Reghbati, Derek G. Corneil: Parallel Computations in Graph Theory. SIAM J. Comput. 7(2): 230-237 (1978)
	1975
c1		Eshrat Arjomandi, Derek G. Corneil: Parallel Computations in Graph Theory. FOCS 1975: 13-18
	1973
j6		Derek G. Corneil, C. C. Gotlieb, Y. M. Lee: Minimal Event-Node Network of Project Precedence Relations. Commun. ACM 16(5): 296-298 (1973)
j5		Derek G. Corneil, Bruce Graham: An Algorithm for Determining the Chromatic Number of a Graph. SIAM J. Comput. 2(4): 311-318 (1973)
	1972
j4		Gordon D. Mulligan, Derek G. Corneil: Corrections to Bierstone's Algorithm for Generating Cliques. J. ACM 19(2): 244-247 (1972)
	1971
j3		Derek G. Corneil: An n² Algorithm for Determining the Bridges of a Graph. Inf. Process. Lett. 1(2): 51-55 (1971)
	1970
j2		Derek G. Corneil, C. C. Gotlieb: An Efficient Algorithm for Graph Isomorphism. J. ACM 17(1): 51-64 (1970)
	1967
j1		C. C. Gotlieb, Derek G. Corneil: Algorithms for finding a fundamental set of cycles for an undirected linear graph. Commun. ACM 10(12): 780-783 (1967)

2012

j66

Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial-time recognition of clique-width ≤3 graphs. Discrete Applied Mathematics 160(6): 834-865 (2012)

j65

Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang: Collective additive tree spanners for circle graphs and polygonal graphs. Discrete Applied Mathematics 160(12): 1717-1729 (2012)

j64

George B. Mertzios, Derek G. Corneil: A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs. SIAM J. Discrete Math. 26(3): 940-963 (2012)

2011

j63

George B. Mertzios, Derek G. Corneil: Vertex splitting and the recognition of trapezoid graphs. Discrete Applied Mathematics 159(11): 1131-1147 (2011)

Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil: Practical and Efficient Split Decomposition via Graph-Labelled Trees. CoRR abs/1104.3283 (2011)

Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil: Circle Graph Recognition in Time $O(n+m) \alpha(n+m)$. CoRR abs/1104.3284 (2011)

2010

j62

Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel: On end-vertices of Lexicographic Breadth First Searches. Discrete Applied Mathematics 158(5): 434-443 (2010)

George B. Mertzios, Derek G. Corneil: A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs. CoRR abs/1004.4560 (2010)

2009

j61

Derek G. Corneil, Stephan Olariu, Lorna Stewart: The LBFS Structure and Recognition of Interval Graphs. SIAM J. Discrete Math. 23(4): 1905-1953 (2009)

2008

j60

Derek G. Corneil, Richard Krueger: A Unified View of Graph Searching. SIAM J. Discrete Math. 22(4): 1259-1276 (2008)

j59

Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul: A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discrete Math. 22(4): 1277-1296 (2008)

c20

Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) 2008: 634-645

c19

Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang: Additive Spanners for Circle Graphs and Polygonal Graphs. WG 2008: 110-121

2007

c18

Marc Tedder, Derek G. Corneil: An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. STACS 2007: 344-355

Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simple, linear-time modular decomposition. CoRR abs/0710.3901 (2007)

2006

j58

Natasa Przulj, Derek G. Corneil, Igor Jurisica: Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. Bioinformatics 22(8): 974-980 (2006)

j57

Feodor F. Dragan, Chenyu Yan, Derek G. Corneil: Collective Tree Spanners and Routing in AT-free Related Graphs. J. Graph Algorithms Appl. 10(2): 97-122 (2006)

j56

Derek G. Corneil, Ekkehard Köhler: Linear Orderings of Subfamilies of AT-Free Graphs. SIAM J. Discrete Math. 20(1): 105-118 (2006)

2005

j55

Natasa Przulj, Derek G. Corneil: 2-Tree probe interval graphs have a large obstruction set. Discrete Applied Mathematics 150(1-3): 216-231 (2005)

j54

Derek G. Corneil, Richard Krueger: Simple vertex ordering characterizations for graph search: (expanded abstract). Electronic Notes in Discrete Mathematics 22: 445-449 (2005)

j53

Derek G. Corneil, Udi Rotics: On the Relationship Between Clique-Width and Treewidth. SIAM J. Comput. 34(4): 825-847 (2005)

c17

Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan: Collective Tree 1-Spanners for Interval Graphs. WG 2005: 151-162

2004

j52

Natasa Przulj, Derek G. Corneil, Igor Jurisica: Modeling interactome: scale-free or geometric?. Bioinformatics 20(18): 3508-3515 (2004)

j51

Natasa Przulj, Derek G. Corneil, Ekkehard Köhler: Hereditary dominating pair graphs. Discrete Applied Mathematics 134(1-3): 239-261 (2004)

j50

Derek G. Corneil: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discrete Applied Mathematics 138(3): 371-379 (2004)

j49

Lap Chi Lau, Derek G. Corneil: Recognizing Powers of Proper Interval, Split, and Chordal Graph. SIAM J. Discrete Math. 18(1): 83-102 (2004)

c16

Derek G. Corneil: Lexicographic Breadth First Search - A Survey. WG 2004: 1-19

c15

Feodor F. Dragan, Chenyu Yan, Derek G. Corneil: Collective Tree Spanners and Routing in AT-free Related Graphs. WG 2004: 68-80

2003

j48

Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler: On the power of BFS to determine a graph's diameter. Networks 42(4): 209-222 (2003)

c14

Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul: A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG 2003: 119-130

2002

j47

Michael D. Hutton, Jonathan Rose, Derek G. Corneil: Automatic generation of synthetic sequential benchmark circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 21(8): 928-940 (2002)

c13

Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler: On the Power of BFS to Determine a Graphs Diameter. LATIN 2002: 209-223

2001

j46

Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter determination on restricted graph families. Discrete Applied Mathematics 113(2-3): 143-166 (2001)

j45

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski: Stable 2-pairs and (X, Y)-intersection graphs. Discrete Mathematics 230(1-3): 119-131 (2001)

c12

Derek G. Corneil, Udi Rotics: On the Relationship between Clique-Width and Treewidth. WG 2001: 78-90

c11

Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart: On Subfamilies of AT-Free Graphs. WG 2001: 241-253

2000

j44

Ming-Chu Li, Derek G. Corneil, Eric Mendelsohn: Pancyclicity and NP-completeness in Planar Graphs. Discrete Applied Mathematics 98(3): 219-225 (2000)

c10

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: 126-134

1999

j43

Derek G. Corneil, Stephan Olariu, Lorna Stewart: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. SIAM J. Comput. 28(4): 1284-1297 (1999)

Derek G. Corneil, Stephan Olariu, Lorna Stewart: LBFS Orderings and Cocomparability Graphs. SODA 1999: 883-884

1998

j42

Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy: The existence of uniquely -G colourable graphs. Discrete Mathematics 179(1-3): 1-11 (1998)

j41

Timothy B. Moorhouse, Derek G. Corneil: Completeness for intersection classes. Discrete Mathematics 190(1-3): 277-286 (1998)

j40

Paul E. Kearney, Derek G. Corneil: Tree Powers. J. Algorithms 29(1): 111-131 (1998)

j39

Michael D. Hutton, Jonathan Rose, Jerry P. Grossman, Derek G. Corneil: Characterization and parameterized generation of synthetic combinational benchmark circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 17(10): 985-996 (1998)

Derek G. Corneil, Stephan Olariu, Lorna Stewart: The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). SODA 1998: 175-180

Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter Determination on Restricted Graph Faminlies. WG 1998: 192-202

1997

j38

Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 10(3): 399-430 (1997)

Michael D. Hutton, Jonathan Rose, Derek G. Corneil: Generation of Synthetic Sequential Benchmark Circuits. FPGA 1997: 149-155

1996

j37

F. Cheah, Derek G. Corneil: on the Structure of Trapezoid Graphs. Discrete Applied Mathematics 66(2): 109-133 (1996)

j36

Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski: A generalization of line graphs: (X, Y)-intersection graphs. Journal of Graph Theory 21(3): 267-287 (1996)

j35

Leizhen Cai, Derek G. Corneil: A generalization of perfect graphs - i-perfect graphs. Journal of Graph Theory 23(1): 87-103 (1996)

Michael D. Hutton, Jerry P. Grossman, Jonathan Rose, Derek G. Corneil: Characterization and Parameterized Random Generation of Digital Circuits. DAC 1996: 94-99

1995

j34

Leizhen Cai, Derek G. Corneil: Isomorphic Tree Spanner Problems. Algorithmica 14(2): 138-153 (1995)

j33

Hazel Everett, Derek G. Corneil: Negative Results on Characterizing Visibility Graphs. Comput. Geom. 5: 51-63 (1995)

j32

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): 253-257 (1995)

j31

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): 99-104 (1995)

j30

Leizhen Cai, Derek G. Corneil: Tree Spanners. SIAM J. Discrete Math. 8(3): 359-387 (1995)

Derek G. Corneil, Stephan Olariu, Lorna Stewart: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. ICALP 1995: 292-302

Derek G. Corneil, Stephan Olariu, Lorna Stewart: Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. WADS 1995: 358-368

1994

j29

Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi: Edge-disjoint packings of graphs. Discrete Applied Mathematics 50(2): 135-148 (1994)

1993

j28

Efthymios Anagnostou, Derek G. Corneil: Polynomial-time Instances of the Minimum Weight Triangulation Problem. Comput. Geom. 3: 247-259 (1993)

j27

Alan Wagner, Derek G. Corneil: On the Complexity of the Embedding Problem for Hypercube Related Graphs. Discrete Applied Mathematics 43(1): 75-95 (1993)

j26

Derek G. Corneil, Jean Fonlupt: Stable Set Bonding in Perfect Graphs and Parity Graphs. J. Comb. Theory, Ser. B 59(1): 1-14 (1993)

Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. WG 1993: 211-224

1992

j25

Leizhen Cai, Derek G. Corneil: On cycle double covers of line graphs. Discrete Mathematics 102(1): 103-106 (1992)

1991

j24

F. Cheah, Derek G. Corneil: Addendum. Discrete Applied Mathematics 31(3): 309 (1991)

j23

Jason I. Brown, Derek G. Corneil: Graph properties and hypergraph colourings. Discrete Mathematics 98(2): 81-93 (1991)

j22

Teresa M. Przytycka, Derek G. Corneil: Parallel Algorithms for Parity Graphs. J. Algorithms 12(1): 96-109 (1991)

1990

j21

F. Cheah, Derek G. Corneil: The complexity of regular subgraph recognition. Discrete Applied Mathematics 27(1-2): 59-68 (1990)

j20

Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil: Forbidden minors characterization of partial 3-trees. Discrete Mathematics 80(1): 1-19 (1990)

j19

Derek G. Corneil, Lorna K. Stewart: Dominating sets in perfect graphs. Discrete Mathematics 86(1-3): 145-164 (1990)

j18

Hazel Everett, Derek G. Corneil: Recognizing Visibility Graphs of Spiral Polygons. J. Algorithms 11(1): 1-26 (1990)

j17

Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub: A note on K_i-perfect graphs. Journal of Graph Theory 14(3): 333-340 (1990)

j16

Alan Wagner, Derek G. Corneil: Embedding Trees in a Hypercube is NP-Complete. SIAM J. Comput. 19(3): 570-590 (1990)

1989

j15

Derek G. Corneil, Jean Fonlupt: The complexity of generalized clique covering. Discrete Applied Mathematics 22(2): 109-118 (1989)

1986

j14

Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub: K_i-covers I: Complexity and polytopes. Discrete Mathematics 58(2): 121-142 (1986)

1985

j13

Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart: A Linear Recognition Algorithm for Cographs. SIAM J. Comput. 14(4): 926-934 (1985)

1984

j12

Derek G. Corneil, Mark K. Goldberg: A Non-Factorial Algorithm for Canonical Numbering of a Graph. J. Algorithms 5(3): 345-362 (1984)

1983

j11

Derek G. Corneil, J. Mark Keil: A note on a conjecture by Gavril on clique separable graphs. Discrete Mathematics 46(3): 317-318 (1983)

j10

David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil: On pseudosimilarity in trees. J. Comb. Theory, Ser. B 34(3): 323-339 (1983)

1981

David G. Kirkpatrick, Derek G. Corneil: Forest embeddings in regular graphs of large girth. J. Comb. Theory, Ser. B 30(1): 45-60 (1981)

1980

Derek G. Corneil, David G. Kirkpatrick: A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. SIAM J. Comput. 9(2): 281-297 (1980)

1978

Eshrat Reghbati, Derek G. Corneil: Parallel Computations in Graph Theory. SIAM J. Comput. 7(2): 230-237 (1978)

1975

Eshrat Arjomandi, Derek G. Corneil: Parallel Computations in Graph Theory. FOCS 1975: 13-18

1973

Derek G. Corneil, C. C. Gotlieb, Y. M. Lee: Minimal Event-Node Network of Project Precedence Relations. Commun. ACM 16(5): 296-298 (1973)

Derek G. Corneil, Bruce Graham: An Algorithm for Determining the Chromatic Number of a Graph. SIAM J. Comput. 2(4): 311-318 (1973)

1972

Gordon D. Mulligan, Derek G. Corneil: Corrections to Bierstone's Algorithm for Generating Cliques. J. ACM 19(2): 244-247 (1972)

1971

Derek G. Corneil: An n² Algorithm for Determining the Bridges of a Graph. Inf. Process. Lett. 1(2): 51-55 (1971)

1970

Derek G. Corneil, C. C. Gotlieb: An Efficient Algorithm for Graph Isomorphism. J. ACM 17(1): 51-64 (1970)

1967

C. C. Gotlieb, Derek G. Corneil: Algorithms for finding a fundamental set of cycles for an undirected linear graph. Commun. ACM 10(12): 780-783 (1967)

1	Dimitris Achlioptas	[j42]
2	Efthymios Anagnostou	[j28]
3	Eshrat Arjomandi	[c1]
4	Stefan Arnborg	[j20]
5	Anna Bretscher	[j59] [c14]
6	Jason I. Brown	[j42] [j23] [j17]
7	Leizhen Cai	[j45] [j36] [j35] [j34] [j30] [j25]
8	F. Cheah	[j37] [j24] [j21]
9	Michele Conforti	[j14]
10	Feodor F. Dragan	[j65] [c19] [j57] [c17] [c15] [j48] [c13] [j46] [c7]
11	Hazel Everett	[j33] [j18]
12	Jean Fonlupt	[j26] [j15]
13	Emeric Gioan	[i4] [i3]
14	Mark K. Goldberg	[j12]
15	Calvin C. Gotlieb (C. C. Gotlieb)	[j6] [j2] [j1]
16	Bruce P. Graham (Bruce Graham)	[j5]
17	Jerry P. Grossman	[j39] [c5]
18	Michel Habib	[j66] [j59] [c20] [i1] [c14] [j46] [c10] [c7]
19	S. Louis Hakimi	[j29]
20	Michael Hutton (Michael D. Hutton, Mike Hutton)	[j47] [j39] [c6] [c5]
21	Igor Jurisica	[j58] [j52]
22	Paul E. Kearney	[j40]
23	J. Mark Keil	[j11]
24	Hiryoung Kim	[j31]
25	David G. Kirkpatrick	[j10] [j9] [j8]
26	Maria M. Klawe	[j10]
27	Richard Krueger	[j60] [j54]
28	Ekkehard Köhler	[j65] [j62] [c19] [j56] [c17] [j51] [j48] [c13] [c11]
29	Jean-Marc Lanlignel	[j66] [j62] [c10]
30	Lap Chi Lau	[j49]
31	Y. M. Lee	[j6]
32	Ming-Chu Li	[j44]
33	Ali Ridha Mahjoub	[j17] [j14]
34	Shigeru Masuyama	[j29]
35	Eric Mendelsohn	[j44]
36	George B. Mertzios	[j64] [j63] [i2]
37	Michael Molloy (Michael S. O. Molloy)	[j42]
38	Timothy B. Moorhouse	[j41]
39	Gordon D. Mulligan	[j4]
40	Sridhar Natarajan	[j31]
41	Stephan Olariu	[j61] [c11] [j43] [c9] [c8] [j38] [j32] [j31] [c4] [c3] [c2]
42	Christophe Paul	[i4] [i3] [j59] [c20] [i1] [c14] [j46] [c7]
43	Yehoshua Perl	[j13]
44	Andrzej Proskurowski	[j45] [j36] [j20]
45	Natasa Przulj	[j58] [j55] [j52] [j51]
46	Teresa M. Przytycka	[j22]
47	Bruce A. Reed	[j66] [c10]
48	Eshrat Reghbati	[j7]
49	Jonathan Rose	[j47] [j39] [c6] [c5]
50	Udi Rotics	[j66] [j53] [c12] [c10]
51	Alan P. Sprague	[j31]
52	Lorna Stewart (Lorna K. Stewart)	[j61] [c11] [j43] [c9] [c8] [j38] [j32] [c4] [c3] [c2] [j19] [j13]
53	Marc Tedder	[i4] [i3] [c20] [c18] [i1]
54	Alan Wagner	[j27] [j16]
55	Yang Xiang	[j65] [c19]
56	Chenyu Yan	[j57] [c17] [c15]

Derek G. Corneil

Coauthor Index