Derek G. Corneil

8.4k total citations · 2 hit papers
96 papers, 4.2k citations indexed

About

Derek G. Corneil is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Derek G. Corneil has authored 96 papers receiving a total of 4.2k indexed citations (citations by other indexed papers that have themselves been cited), including 83 papers in Computational Theory and Mathematics, 24 papers in Computer Networks and Communications and 18 papers in Electrical and Electronic Engineering. Recurrent topics in Derek G. Corneil's work include Advanced Graph Theory Research (76 papers), Graph Labeling and Dimension Problems (38 papers) and Complexity and Algorithms in Graphs (27 papers). Derek G. Corneil is often cited by papers focused on Advanced Graph Theory Research (76 papers), Graph Labeling and Dimension Problems (38 papers) and Complexity and Algorithms in Graphs (27 papers). Derek G. Corneil collaborates with scholars based in Canada, United States and France. Derek G. Corneil's co-authors include Andrzej Proskurowski, Stefan Arnborg, Yehoshua Perl, Nataša Pržulj, Igor Jurišica, Ronald C. Read, Laura K. Stewart, C. C. Gotlieb, Lorna Stewart and Stephan Olariu and has published in prestigious journals such as Bioinformatics, Communications of the ACM and Journal of the ACM.

In The Last Decade

Derek G. Corneil

94 papers receiving 3.7k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Complexity of Finding Embeddings in a k-Tree

1987 605 citations Stefan Arnborg, Derek G. Corneil et al. profile →
Complement reducible graphs

1981 432 citations Derek G. Corneil et al. Discrete Applied Mathematics profile →

Peers

Derek G. Corneil

CTM

CNC

AI

EEE

GT

János Komlós United States

Daniel J. Kleitman United States

Hans L. Bodlaender Netherlands

J. Fields United States

Michael R. Fellows Australia

Raphael Yuster Israel

Harold N. Gabow United States

Uri Zwick Israel

Miklós Ajtai United States

Brendan D. McKay Australia

János Komlós United States

Derek G. Corneil

2.4k ×0.9

CTM

900 ×0.8

CNC

1.3k ×1.7

AI

667 ×1.3

EEE

880 ×1.7

GT

Citations per year, relative to Derek G. Corneil Derek G. Corneil (= 1×) peers János Komlós

Countries citing papers authored by Derek G. Corneil

Since Specialization

Citations

This map shows the geographic impact of Derek G. Corneil's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Derek G. Corneil with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Derek G. Corneil more than expected).

Fields of papers citing papers by Derek G. Corneil

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Derek G. Corneil. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Derek G. Corneil. The network helps show where Derek G. Corneil may publish in the future.

Co-authorship network of co-authors of Derek G. Corneil

This figure shows the co-authorship network connecting the top 25 collaborators of Derek G. Corneil. A scholar is included among the top collaborators of Derek G. Corneil based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Derek G. Corneil. Derek G. Corneil is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

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

2.

Paul, Christophe, et al.. (2011). Circle Graph Recognition in Time O(n+m) α(n+m). arXiv (Cornell University). 1 indexed citations

3.

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

4.

Corneil, Derek G., et al.. (2009). On end-vertices of Lexicographic Breadth First Searches. Discrete Applied Mathematics. 158(5). 434–443. 12 indexed citations

5.

Corneil, Derek G., et al.. (2007). Simple, Linear-Time Modular Decomposition. arXiv (Cornell University). 634–645. 4 indexed citations

6.

Pržulj, Nataša & Derek G. Corneil. (2005). 2-Tree probe interval graphs have a large obstruction set. Discrete Applied Mathematics. 150(1-3). 216–231. 8 indexed citations

7.

Corneil, Derek G., Stephan Olariu, & Lorna Stewart. (1999). LBFS orderings and cocomparability graphs. Symposium on Discrete Algorithms. 883–884. 3 indexed citations

8.

Corneil, Derek G., Stephan Olariu, & Lorna Stewart. (1998). The ultimate interval graph recognition algorithm. Symposium on Discrete Algorithms. 175–180. 41 indexed citations

9.

Corneil, Derek G., Stephan Olariu, & Lorna Stewart. (1998). The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract).. Symposium on Discrete Algorithms. 175–180. 14 indexed citations

10.

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

11.

Cai, Leizhen & Derek G. Corneil. (1996). A generalization of perfect graphs— i -perfect graphs. Journal of Graph Theory. 23(1). 87–103. 6 indexed citations

12.

Corneil, Derek G., Shigeru Masuyama, & S. L. Hakimi. (1994). Edge-disjoint packings of graphs. Discrete Applied Mathematics. 50(2). 135–148. 5 indexed citations

13.

Corneil, Derek G., et al.. (1993). Polynomial-time instances of the minimum weight triangulation problem. Computational Geometry. 3(5). 247–259. 16 indexed citations

14.

Corneil, Derek G. & Jean Fonlupt. (1993). Stable Set Bonding in Perfect Graphs and Parity Graphs. Journal of Combinatorial Theory Series B. 59(1). 1–14. 15 indexed citations

15.

Cai, Leizhen & Derek G. Corneil. (1992). On cycle double covers of line graphs. Discrete Mathematics. 102(1). 103–106. 1 indexed citations

16.

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

17.

Corneil, Derek G., et al.. (1990). The complexity of regular subgraph recognition. Discrete Applied Mathematics. 27(1-2). 59–68. 15 indexed citations

18.

Corneil, Derek G. & Lorna Stewart. (1990). Dominating sets in perfect graphs. Discrete Mathematics. 86(1-3). 145–164. 30 indexed citations

19.

Conforti, Michele, Derek G. Corneil, & Ali Ridha Mahjoub. (1986). K-covers I: Complexity and polytopes. Discrete Mathematics. 58(2). 121–142. 15 indexed citations

20.

Corneil, Derek G. & Yehoshua Perl. (1984). Clustering and domination in perfect graphs. Discrete Applied Mathematics. 9(1). 27–39. 142 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact