Derek G. Corneil

	2012
85		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)
	2011
84		Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil: Practical and Efficient Split Decomposition via Graph-Labelled Trees CoRR abs/1104.3283: (2011)
83		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)
82		George B. Mertzios, Derek G. Corneil: Vertex splitting and the recognition of trapezoid graphs. Discrete Applied Mathematics 159(11): 1131-1147 (2011)
	2010
81		George B. Mertzios, Derek G. Corneil: A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs CoRR abs/1004.4560: (2010)
80		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)
	2009
79		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
78		Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) 2008: 634-645
77		Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang: Additive Spanners for Circle Graphs and Polygonal Graphs. WG 2008: 110-121
76		Derek G. Corneil, Richard Krueger: A Unified View of Graph Searching. SIAM J. Discrete Math. 22(4): 1259-1276 (2008)
75		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)
	2007
74		Marc Tedder, Derek G. Corneil: An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. STACS 2007: 344-355
73		Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simple, linear-time modular decomposition CoRR abs/0710.3901: (2007)
	2006
72		Natasa Przulj, Derek G. Corneil, Igor Jurisica: Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. Bioinformatics 22(8): 974-980 (2006)
71		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)
70		Derek G. Corneil, Ekkehard Köhler: Linear Orderings of Subfamilies of AT-Free Graphs. SIAM J. Discrete Math. 20(1): 105-118 (2006)
	2005
69		Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan: Collective Tree 1-Spanners for Interval Graphs. WG 2005: 151-162
68		Natasa Przulj, Derek G. Corneil: 2-Tree probe interval graphs have a large obstruction set. Discrete Applied Mathematics 150(1-3): 216-231 (2005)
67		Derek G. Corneil, Richard Krueger: Simple vertex ordering characterizations for graph search: (expanded abstract). Electronic Notes in Discrete Mathematics 22: 445-449 (2005)
66		Derek G. Corneil, Udi Rotics: On the Relationship Between Clique-Width and Treewidth. SIAM J. Comput. 34(4): 825-847 (2005)
	2004
65		Derek G. Corneil: Lexicographic Breadth First Search - A Survey. WG 2004: 1-19
64		Feodor F. Dragan, Chenyu Yan, Derek G. Corneil: Collective Tree Spanners and Routing in AT-free Related Graphs. WG 2004: 68-80
63		Natasa Przulj, Derek G. Corneil, Igor Jurisica: Modeling interactome: scale-free or geometric?. Bioinformatics 20(18): 3508-3515 (2004)
62		Natasa Przulj, Derek G. Corneil, Ekkehard Köhler: Hereditary dominating pair graphs. Discrete Applied Mathematics 134(1-3): 239-261 (2004)
61		Derek G. Corneil: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discrete Applied Mathematics 138(3): 371-379 (2004)
60		Lap Chi Lau, Derek G. Corneil: Recognizing Powers of Proper Interval, Split, and Chordal Graph. SIAM J. Discrete Math. 18(1): 83-102 (2004)
	2003
59		Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul: A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG 2003: 119-130
58		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)
	2002
57		Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler: On the Power of BFS to Determine a Graphs Diameter. LATIN 2002: 209-223
56		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)
	2001
55		Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart: On Subfamilies of AT-Free Graphs. WG 2001: 241-253
54		Derek G. Corneil, Udi Rotics: On the Relationship between Clique-Width and Treewidth. WG 2001: 78-90
53		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)
52		Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski: Stable 2-pairs and (X, Y)-intersection graphs. Discrete Mathematics 230(1-3): 119-131 (2001)
	2000
51		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
50		Ming-Chu Li, Derek G. Corneil, Eric Mendelsohn: Pancyclicity and NP-completeness in Planar Graphs. Discrete Applied Mathematics 98(3): 219-225 (2000)
	1999
49		Derek G. Corneil, Stephan Olariu, Lorna Stewart: LBFS Orderings and Cocomparability Graphs. SODA 1999: 883-884
48		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)
	1998
47		Derek G. Corneil, Stephan Olariu, Lorna Stewart: The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). SODA 1998: 175-180
46		Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter Determination on Restricted Graph Faminlies. WG 1998: 192-202
45		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)
44		Timothy B. Moorhouse, Derek G. Corneil: Completeness for intersection classes. Discrete Mathematics 190(1-3): 277-286 (1998)
43		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)
42		Paul E. Kearney, Derek G. Corneil: Tree Powers. J. Algorithms 29(1): 111-131 (1998)
	1997
41		Michael D. Hutton, Jonathan Rose, Derek G. Corneil: Generation of Synthetic Sequential Benchmark Circuits. FPGA 1997: 149-155
40		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 10(3): 399-430 (1997)
	1996
39		Michael D. Hutton, Jerry P. Grossman, Jonathan Rose, Derek G. Corneil: Characterization and Parameterized Random Generation of Digital Circuits. DAC 1996: 94-99
38		F. Cheah, Derek G. Corneil: on the Structure of Trapezoid Graphs. Discrete Applied Mathematics 66(2): 109-133 (1996)
	1995
37		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. ICALP 1995: 292-302
36		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. WADS 1995: 358-368
35		Leizhen Cai, Derek G. Corneil: Isomorphic Tree Spanner Problems. Algorithmica 14(2): 138-153 (1995)
34		Hazel Everett, Derek G. Corneil: Negative Results on Characterizing Visibility Graphs. Comput. Geom. 5: 51-63 (1995)
33		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)
32		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)
31		Leizhen Cai, Derek G. Corneil: Tree Spanners. SIAM J. Discrete Math. 8(3): 359-387 (1995)
	1994
30		Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi: Edge-disjoint packings of graphs. Discrete Applied Mathematics 50(2): 135-148 (1994)
	1993
29		Derek G. Corneil, Stephan Olariu, Lorna Stewart: Asteroidal Triple-Free Graphs. WG 1993: 211-224
28		Efthymios Anagnostou, Derek G. Corneil: Polynomial-time Instances of the Minimum Weight Triangulation Problem. Comput. Geom. 3: 247-259 (1993)
27		Alan Wagner, Derek G. Corneil: On the Complexity of the Embedding Problem for Hypercube Related Graphs. Discrete Applied Mathematics 43(1): 75-95 (1993)
26		Derek G. Corneil, Jean Fonlupt: Stable Set Bonding in Perfect Graphs and Parity Graphs. J. Comb. Theory, Ser. B 59(1): 1-14 (1993)
	1992
25		Leizhen Cai, Derek G. Corneil: On cycle double covers of line graphs. Discrete Mathematics 102(1): 103-106 (1992)
	1991
24		F. Cheah, Derek G. Corneil: Addendum. Discrete Applied Mathematics 31(3): 309 (1991)
23		Jason I. Brown, Derek G. Corneil: Graph properties and hypergraph colourings. Discrete Mathematics 98(2): 81-93 (1991)
22		Teresa M. Przytycka, Derek G. Corneil: Parallel Algorithms for Parity Graphs. J. Algorithms 12(1): 96-109 (1991)
	1990
21		F. Cheah, Derek G. Corneil: The complexity of regular subgraph recognition. Discrete Applied Mathematics 27(1-2): 59-68 (1990)
20		Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil: Forbidden minors characterization of partial 3-trees. Discrete Mathematics 80(1): 1-19 (1990)
19		Derek G. Corneil, Lorna K. Stewart: Dominating sets in perfect graphs. Discrete Mathematics 86(1-3): 145-164 (1990)
18		Hazel Everett, Derek G. Corneil: Recognizing Visibility Graphs of Spiral Polygons. J. Algorithms 11(1): 1-26 (1990)
17		Alan Wagner, Derek G. Corneil: Embedding Trees in a Hypercube is NP-Complete. SIAM J. Comput. 19(3): 570-590 (1990)
	1989
16		Derek G. Corneil, Jean Fonlupt: The complexity of generalized clique covering. Discrete Applied Mathematics 22(2): 109-118 (1989)
	1986
15		Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub: Ki-covers I: Complexity and polytopes. Discrete Mathematics 58(2): 121-142 (1986)
	1985
14		Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart: A Linear Recognition Algorithm for Cographs. SIAM J. Comput. 14(4): 926-934 (1985)
	1984
13		Derek G. Corneil, Mark K. Goldberg: A Non-Factorial Algorithm for Canonical Numbering of a Graph. J. Algorithms 5(3): 345-362 (1984)
	1983
12		Derek G. Corneil, J. Mark Keil: A note on a conjecture by Gavril on clique separable graphs. Discrete Mathematics 46(3): 317-318 (1983)
11		David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil: On pseudosimilarity in trees. J. Comb. Theory, Ser. B 34(3): 323-339 (1983)
	1981
10		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
9		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
8		Eshrat Reghbati, Derek G. Corneil: Parallel Computations in Graph Theory. SIAM J. Comput. 7(2): 230-237 (1978)
	1975
7		Eshrat Arjomandi, Derek G. Corneil: Parallel Computations in Graph Theory FOCS 1975: 13-18
	1973
6		Derek G. Corneil, C. C. Gotlieb, Y. M. Lee: Minimal Event-Node Network of Project Precedence Relations. Commun. ACM 16(5): 296-298 (1973)
5		Derek G. Corneil, Bruce Graham: An Algorithm for Determining the Chromatic Number of a Graph. SIAM J. Comput. 2(4): 311-318 (1973)
	1972
4		Gordon D. Mulligan, Derek G. Corneil: Corrections to Bierstone's Algorithm for Generating Cliques. J. ACM 19(2): 244-247 (1972)
	1971
3		Derek G. Corneil: An n² Algorithm for Determining the Bridges of a Graph. Inf. Process. Lett. 1(2): 51-55 (1971)
	1970
2		Derek G. Corneil, C. C. Gotlieb: An Efficient Algorithm for Graph Isomorphism. J. ACM 17(1): 51-64 (1970)
	1967
1		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)

Coauthor Index

1	Dimitris Achlioptas	[45]
2	Efthymios Anagnostou	[28]
3	Eshrat Arjomandi	[7]
4	Stefan Arnborg	[20]
5	Anna Bretscher	[59] [75]
6	Jason I. Brown	[23] [45]
7	Leizhen Cai	[25] [31] [35] [52]
8	F. Cheah	[21] [24] [38]
9	Michele Conforti	[15]
10	Feodor F. Dragan	[46] [53] [57] [58] [64] [69] [71] [77]
11	Hazel Everett	[18] [34]
12	Jean Fonlupt	[16] [26]
13	Emeric Gioan	[83] [84]
14	Mark K. Goldberg	[13]
15	Calvin C. Gotlieb (C. C. Gotlieb)	[1] [2] [6]
16	Bruce P. Graham (Bruce Graham)	[5]
17	Jerry P. Grossman	[39] [43]
18	Michel Habib	[46] [51] [53] [59] [73] [75] [78] [85]
19	S. Louis Hakimi	[30]
20	Michael Hutton (Michael D. Hutton, Mike Hutton)	[39] [41] [43] [56]
21	Igor Jurisica	[63] [72]
22	Paul E. Kearney	[42]
23	J. Mark Keil	[12]
24	Hiryoung Kim	[32]
25	David G. Kirkpatrick	[9] [10] [11]
26	Maria M. Klawe	[11]
27	Ekkehard Köhler	[55] [57] [58] [62] [69] [70] [77] [80]
28	Richard Krueger	[67] [76]
29	Jean-Marc Lanlignel	[51] [80] [85]
30	Lap Chi Lau	[60]
31	Y. M. Lee	[6]
32	Ming-Chu Li	[50]
33	Ali Ridha Mahjoub	[15]
34	Shigeru Masuyama	[30]
35	Eric Mendelsohn	[50]
36	George B. Mertzios	[81] [82]
37	Michael Molloy (Michael S. O. Molloy)	[45]
38	Timothy B. Moorhouse	[44]
39	Gordon D. Mulligan	[4]
40	Sridhar Natarajan	[32]
41	Stephan Olariu	[29] [32] [33] [36] [37] [40] [47] [48] [49] [55] [79]
42	Christophe Paul	[46] [53] [59] [73] [75] [78] [83] [84]
43	Yehoshua Perl	[14]
44	Andrzej Proskurowski	[20] [52]
45	Natasa Przulj	[62] [63] [68] [72]
46	Teresa M. Przytycka	[22]
47	Bruce A. Reed	[51] [85]
48	Eshrat Reghbati	[8]
49	Jonathan Rose	[39] [41] [43] [56]
50	Udi Rotics	[51] [54] [66] [85]
51	Alan P. Sprague	[32]
52	Lorna Stewart (Lorna K. Stewart)	[14] [19] [29] [33] [36] [37] [40] [47] [48] [49] [55] [79]
53	Marc Tedder	[73] [74] [78] [83] [84]
54	Alan Wagner	[17] [27]
55	Yang Xiang	[77]
56	Chenyu Yan	[64] [69] [71]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page