| 2008 |
|---|
| 18 | Additive Spanners for Circle Graphs and Polygonal Graphs. Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang. WG 2008, 110-121. Web SearchBibTeXDownload |
| 2006 |
|---|
| 17 | Collective Tree Spanners and Routing in AT-free Related Graphs. Feodor F. Dragan, Chenyu Yan, Derek G. Corneil. J. Graph Algorithms Appl. (10): 97-122 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 16 | Collective Tree 1-Spanners for Interval Graphs. Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan. WG 2005, 151-162. Web SearchBibTeXDownload |
| 2004 |
|---|
| 15 | Collective Tree Spanners and Routing in AT-free Related Graphs. Feodor F. Dragan, Chenyu Yan, Derek G. Corneil. WG 2004, 68-80. Web SearchBibTeXDownload |
| 2003 |
|---|
| 14 | On the power of BFS to determine a graph's diameter. Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler. Networks (42): 209-222 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 13 | On the Power of BFS to Determine a Graphs Diameter. Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler. LATIN 2002, 209-223. Web SearchBibTeXDownload |
| 2001 |
|---|
| 12 | Diameter determination on restricted graph families. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul. Discrete Applied Mathematics (113): 143-166 (2001). Web SearchBibTeXDownload |
| 1998 |
|---|
| 11 | The existence of uniquely -G colourable graphs. Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy. Discrete Mathematics (179): 1-11 (1998). Web SearchBibTeXDownload |
| 10 | Diameter Determination on Restricted Graph Faminlies. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul. WG 1998, 192-202. Web SearchBibTeXDownload |
| 1993 |
|---|
| 9 | On the Complexity of the Embedding Problem for Hypercube Related Graphs. Alan Wagner, Derek G. Corneil. Discrete Applied Mathematics (43): 75-95 (1993). Web SearchBibTeXDownload |
| 1990 |
|---|
| 8 | Embedding Trees in a Hypercube is NP-Complete. Alan Wagner, Derek G. Corneil. SIAM J. Comput. (19): 570-590 (1990). Web SearchBibTeXDownload |
| 1985 |
|---|
| 7 | A Linear Recognition Algorithm for Cographs. Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart. SIAM J. Comput. (14): 926-934 (1985). Web SearchBibTeXDownload |
| 1983 |
|---|
| 6 | On pseudosimilarity in trees. David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil. J. Comb. Theory, Ser. B (34): 323-339 (1983). Web SearchBibTeXDownload |
| 1981 |
|---|
| 5 | Forest embeddings in regular graphs of large girth. David G. Kirkpatrick, Derek G. Corneil. J. Comb. Theory, Ser. B (30): 45-60 (1981). Web SearchBibTeXDownload |
| 1980 |
|---|
| 4 | A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. Derek G. Corneil, David G. Kirkpatrick. SIAM J. Comput. (9): 281-297 (1980). Web SearchBibTeXDownload |
| 1973 |
|---|
| 3 | Minimal Event-Node Network of Project Precedence Relations. Derek G. Corneil, C. C. Gotlieb, Y. M. Lee. Commun. ACM (16): 296-298 (1973). Web SearchBibTeXDownload |
| 1970 |
|---|
| 2 | An Efficient Algorithm for Graph Isomorphism. Derek G. Corneil, C. C. Gotlieb. J. ACM (17): 51-64 (1970). Web SearchBibTeXDownload |
| 1967 |
|---|
| 1 | Algorithms for finding a fundamental set of cycles for an undirected linear graph. C. C. Gotlieb, Derek G. Corneil. Commun. ACM (10): 780-783 (1967). Web SearchBibTeXDownload |
