The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Derek G. Corneil: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eshrat Reghbati, Derek G. Corneil
    Parallel Computations in Graph Theory. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:2, pp:230-237 [Journal]
  2. Michael D. Hutton, Jerry P. Grossman, Jonathan Rose, Derek G. Corneil
    Characterization and Parameterized Random Generation of Digital Circuits. [Citation Graph (0, 0)][DBLP]
    DAC, 1996, pp:94-99 [Conf]
  3. Eshrat Arjomandi, Derek G. Corneil
    Parallel Computations in Graph Theory [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:13-18 [Conf]
  4. Michael D. Hutton, Jonathan Rose, Derek G. Corneil
    Generation of Synthetic Sequential Benchmark Circuits. [Citation Graph (0, 0)][DBLP]
    FPGA, 1997, pp:149-155 [Conf]
  5. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:292-302 [Conf]
  6. Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
    On the Power of BFS to Determine a Graphs Diameter. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:209-223 [Conf]
  7. 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). [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:126-134 [Conf]
  8. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:175-180 [Conf]
  9. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    LBFS Orderings and Cocomparability Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:883-884 [Conf]
  10. Marc Tedder, Derek G. Corneil
    An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:344-355 [Conf]
  11. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:358-368 [Conf]
  12. Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
    A Simple Linear Time LexBFS Cograph Recognition Algorithm. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:119-130 [Conf]
  13. Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
    Collective Tree Spanners and Routing in AT-free Related Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:68-80 [Conf]
  14. Derek G. Corneil
    Lexicographic Breadth First Search - A Survey. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:1-19 [Conf]
  15. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
    Diameter Determination on Restricted Graph Faminlies. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:192-202 [Conf]
  16. Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
    Collective Tree 1-Spanners for Interval Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:151-162 [Conf]
  17. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:211-224 [Conf]
  18. Derek G. Corneil, Udi Rotics
    On the Relationship between Clique-Width and Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:78-90 [Conf]
  19. Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart
    On Subfamilies of AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:241-253 [Conf]
  20. Leizhen Cai, Derek G. Corneil
    Isomorphic Tree Spanner Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:2, pp:138-153 [Journal]
  21. Natasa Przulj, Derek G. Corneil, Igor Jurisica
    Modeling interactome: scale-free or geometric?. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2004, v:20, n:18, pp:3508-3515 [Journal]
  22. Natasa Przulj, Derek G. Corneil, Igor Jurisica
    Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:8, pp:974-980 [Journal]
  23. Derek G. Corneil, C. C. Gotlieb, Y. M. Lee
    Minimal Event-Node Network of Project Precedence Relations. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1973, v:16, n:5, pp:296-298 [Journal]
  24. C. C. Gotlieb, Derek G. Corneil
    Algorithms for finding a fundamental set of cycles for an undirected linear graph. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1967, v:10, n:12, pp:780-783 [Journal]
  25. Efthymios Anagnostou, Derek G. Corneil
    Polynomial-time Instances of the Minimum Weight Triangulation Problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:247-259 [Journal]
  26. Hazel Everett, Derek G. Corneil
    Negative Results on Characterizing Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:51-63 [Journal]
  27. F. Cheah, Derek G. Corneil
    on the Structure of Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:66, n:2, pp:109-133 [Journal]
  28. Derek G. Corneil
    A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:3, pp:371-379 [Journal]
  29. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
    Diameter determination on restricted graph families. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:143-166 [Journal]
  30. Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi
    Edge-disjoint packings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:2, pp:135-148 [Journal]
  31. Ming-Chu Li, Derek G. Corneil, Eric Mendelsohn
    Pancyclicity and NP-completeness in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:98, n:3, pp:219-225 [Journal]
  32. Natasa Przulj, Derek G. Corneil
    2-Tree probe interval graphs have a large obstruction set. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:216-231 [Journal]
  33. Natasa Przulj, Derek G. Corneil, Ekkehard Köhler
    Hereditary dominating pair graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:239-261 [Journal]
  34. Alan Wagner, Derek G. Corneil
    On the Complexity of the Embedding Problem for Hypercube Related Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:43, n:1, pp:75-95 [Journal]
  35. Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski
    Stable 2-pairs and (X, Y)-intersection graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:119-131 [Journal]
  36. Derek G. Corneil
    An n² Algorithm for Determining the Bridges of a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1971, v:1, n:2, pp:51-55 [Journal]
  37. Derek G. Corneil, Hiryoung Kim, Sridhar Natarajan, Stephan Olariu, Alan P. Sprague
    Simple Linear Time Recognition of Unit Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:2, pp:99-104 [Journal]
  38. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:5, pp:253-257 [Journal]
  39. Derek G. Corneil, C. C. Gotlieb
    An Efficient Algorithm for Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1970, v:17, n:1, pp:51-64 [Journal]
  40. Gordon D. Mulligan, Derek G. Corneil
    Corrections to Bierstone's Algorithm for Generating Cliques. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1972, v:19, n:2, pp:244-247 [Journal]
  41. Derek G. Corneil, Mark K. Goldberg
    A Non-Factorial Algorithm for Canonical Numbering of a Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:3, pp:345-362 [Journal]
  42. Hazel Everett, Derek G. Corneil
    Recognizing Visibility Graphs of Spiral Polygons. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:1, pp:1-26 [Journal]
  43. Paul E. Kearney, Derek G. Corneil
    Tree Powers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:1, pp:111-131 [Journal]
  44. Teresa M. Przytycka, Derek G. Corneil
    Parallel Algorithms for Parity Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:1, pp:96-109 [Journal]
  45. Derek G. Corneil, Jean Fonlupt
    Stable Set Bonding in Perfect Graphs and Parity Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:59, n:1, pp:1-14 [Journal]
  46. David G. Kirkpatrick, Maria M. Klawe, Derek G. Corneil
    On pseudosimilarity in trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:323-339 [Journal]
  47. David G. Kirkpatrick, Derek G. Corneil
    Forest embeddings in regular graphs of large girth. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:45-60 [Journal]
  48. Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
    On the power of BFS to determine a graph's diameter. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:4, pp:209-222 [Journal]
  49. Derek G. Corneil, Bruce Graham
    An Algorithm for Determining the Chromatic Number of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:4, pp:311-318 [Journal]
  50. Derek G. Corneil, David G. Kirkpatrick
    A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:281-297 [Journal]
  51. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1284-1297 [Journal]
  52. Derek G. Corneil, Yehoshua Perl, Lorna K. Stewart
    A Linear Recognition Algorithm for Cographs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:926-934 [Journal]
  53. Derek G. Corneil, Udi Rotics
    On the Relationship Between Clique-Width and Treewidth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:825-847 [Journal]
  54. Alan Wagner, Derek G. Corneil
    Embedding Trees in a Hypercube is NP-Complete. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:570-590 [Journal]
  55. Leizhen Cai, Derek G. Corneil
    Tree Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:3, pp:359-387 [Journal]
  56. Derek G. Corneil, Ekkehard Köhler
    Linear Orderings of Subfamilies of AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:105-118 [Journal]
  57. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:399-430 [Journal]
  58. Lap Chi Lau, Derek G. Corneil
    Recognizing Powers of Proper Interval, Split, and Chordal Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:83-102 [Journal]
  59. Michael D. Hutton, Jonathan Rose, Derek G. Corneil
    Automatic generation of synthetic sequential benchmark circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2002, v:21, n:8, pp:928-940 [Journal]
  60. Michael D. Hutton, Jonathan Rose, Jerry P. Grossman, Derek G. Corneil
    Characterization and parameterized generation of synthetic combinational benchmark circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1998, v:17, n:10, pp:985-996 [Journal]
  61. Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
    Simple, linear-time modular decomposition [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  62. Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub
    Ki-covers I: Complexity and polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:2, pp:121-142 [Journal]
  63. Derek G. Corneil, J. Mark Keil
    A note on a conjecture by Gavril on clique separable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:3, pp:317-318 [Journal]
  64. Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil
    Forbidden minors characterization of partial 3-trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:1, pp:1-19 [Journal]
  65. Timothy B. Moorhouse, Derek G. Corneil
    Completeness for intersection classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:277-286 [Journal]
  66. Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy
    The existence of uniquely -G colourable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:179, n:1-3, pp:1-11 [Journal]
  67. Derek G. Corneil, Lorna K. Stewart
    Dominating sets in perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:86, n:1-3, pp:145-164 [Journal]
  68. Jason I. Brown, Derek G. Corneil
    Graph properties and hypergraph colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:2, pp:81-93 [Journal]
  69. Leizhen Cai, Derek G. Corneil
    On cycle double covers of line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:1, pp:103-106 [Journal]

  70. Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. [Citation Graph (, )][DBLP]


  71. Additive Spanners for Circle Graphs and Polygonal Graphs. [Citation Graph (, )][DBLP]


  72. A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs [Citation Graph (, )][DBLP]


  73. Addendum. [Citation Graph (, )][DBLP]


  74. The complexity of generalized clique covering. [Citation Graph (, )][DBLP]


  75. The complexity of regular subgraph recognition. [Citation Graph (, )][DBLP]


  76. On end-vertices of Lexicographic Breadth First Searches. [Citation Graph (, )][DBLP]


Search in 0.184secs, Finished in 0.189secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002