Derek Corneil

Q: What Schools Are Affiliated With Derek Corneil

Derek Corneil is affiliated with the following schools: Queen's University at Kingston, University of Toronto

Derek Corneil's AcademicInfluence.com Rankings

Derek Corneil

Mathematics

#4546

World Rank

#6438

Historical Rank

Group Theory

#138

World Rank

#168

Historical Rank

Algebra

#361

World Rank

#498

Historical Rank

Measure Theory

#2355

World Rank

#2817

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Derek Corneil Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Derek Gordon Corneil is a Canadian mathematician and computer scientist, a professor emeritus of computer science at the University of Toronto, and an expert in graph algorithms and graph theory. Life When he was leaving high school, Corneil was told by his English teacher that doing a degree in mathematics and physics was a bad idea, and that the best he could hope for was to go to a technical college. His interest in computer science began when, as an undergraduate student at Queens College, he heard that a computer was purchased by the London Life insurance company in London, Ontario, where his father worked. As a freshman, he took a summer job operating the UNIVAC Mark II at the company. One of his main responsibilities was to operate a printer. An opportunity for a programming job with the company sponsoring his college scholarship appeared soon after. It was a chance that Corneil jumped at after being denied a similar position at London Life. There was an initial mix-up at his job as his overseer thought that he knew how to program the UNIVAC Mark II, and so he would easily transition to doing the same for the company's newly acquired IBM 1401 machine. However, Corneil did not have the assumed programming background. Thus, in the two-week window that Corneil had been given to learn how to grasp programming the IBM 1401, he learned how to write code from scratch by relying heavily on the instruction manual. This experience pushed him further on his way as did a number of projects he worked on in that position later on.

(See a Problem?)

Derek Corneil's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Complexity of finding embeddings in a k -tree (1987) (1309)
Complement reducible graphs (1981) (792)
Modeling interactome: scale-free or geometric? (2004) (645)
A Linear Recognition Algorithm for Cographs (1985) (620)
The graph isomorphism disease (1977) (521)
Clustering and domination in perfect graphs (1984) (227)
On the Relationship Between Clique-Width and Treewidth (2001) (187)
Tree Spanners (1995) (186)
Asteroidal Triple-Free Graphs (1993) (169)
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations (2008) (151)
Efficient estimation of graphlet frequency distributions in protein-protein interaction networks (2006) (132)
Simple Linear Time Recognition of Unit Interval Graphs (1995) (130)
Forbidden minors characterization of partial 3-trees (1990) (124)
The LBFS Structure and Recognition of Interval Graphs (2009) (99)
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (2004) (90)
Parallel computations in graph theory (1975) (88)
A Simple Linear Time LexBFS Cograph Recognition Algorithm (2003) (86)
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs (1995) (86)
A Unified View of Graph Searching (2008) (81)
Corrections to Bierstone's Algorithm for Generating Cliques (1972) (77)
The ultimate interval graph recognition algorithm? (1998) (76)
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem (1980) (73)
Polynomial Time Recognition of Clique-Width ≤ 3 Graphs (2000) (72)
Diameter determination on restricted graph families (1998) (69)
Characterization and parameterized random generation of digital circuits (1996) (63)
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract) (2000) (63)
Lexicographic Breadth First Search - A Survey (2004) (62)
Dominating sets in perfect graphs (1991) (62)
Embedding Trees in a Hypercube is NP-Complete (1990) (60)
Recognizing Visibility Graphs of Spiral Polygons (1990) (55)
Tree Powers (1998) (52)
Characterization and parameterized generation of synthetic combinational benchmark circuits (1998) (51)
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs (2013) (51)
Recognizing Powers of Proper Interval, Split, and Chordal Graph (2004) (48)
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs (2010) (46)
Polynomial-time recognition of clique-width ≤3 graphs (2012) (46)
A dynamic programming approach to the dominating set problem on k trees (1987) (46)
Geometry and Combinatorics: Selected Works of J.J. Seidel (1991) (45)
On generalized graph colorings (1987) (45)
An Algorithm for Determining the Chromatic Number of a Graph (1973) (45)
Automatic generation of synthetic sequential benchmark circuits (2002) (42)
The complexity of generalized clique covering (1989) (42)
On the power of BFS to determine a graph's diameter (2003) (41)
Algorithms for finding a fundamental set of cycles for an undirected linear graph (1967) (40)
The complexity of regular subgraph recognition (1990) (36)
Polynomial-time Instances of the Minimum Weight Triangulation Problem (1993) (36)
Vertex splitting and the recognition of trapezoid graphs (2011) (35)
The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). (1998) (33)
Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations (1978) (33)
Generation of synthetic sequential benchmark circuits (1997) (31)
on the Structure of Trapezoid Graphs (1996) (29)
Collective Tree Spanners and Routing in AT-free Related Graphs (2004) (28)
The complexity of generalized clique packing (1985) (27)
On deciding switching equivalence of graphs (1980) (27)
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph (1995) (26)
Ki-covers I: Complexity and polytopes (1986) (26)
On the Power of Graph Searching for Cocomparability Graphs (2016) (26)
Isomorphism Testing in Hookup Classes (1982) (25)
On end-vertices of Lexicographic Breadth First Searches (2010) (24)
Stable Set Bonding in Perfect Graphs and Parity Graphs (1993) (24)
Practical and Efficient Circle Graph Recognition (2011) (20)
Simple, linear-time modular decomposition (2007) (19)
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (2015) (19)
2-Tree probe interval graphs have a large obstruction set (2005) (18)
Pancyclicity and NP-completeness in Planar Graphs (2000) (17)
Negative Results on Characterizing Visibility Graphs (1995) (16)
Practical and Efficient Split Decomposition via Graph-Labelled Trees (2011) (15)
Ki-covers. II. Ki-perfect graphs (1987) (14)
On pseudosimilarity in trees (1983) (12)
Graph properties and hypergraph colourings (1991) (12)
Parallel Algorithms for Parity Graphs (1991) (11)
The existence of uniquely -G colourable graphs (1998) (11)
A Non-Factorial Algorithm for Canonical Numbering of a Graph (1984) (9)
On the Complexity of the Embedding Problem for Hypercube Related Graphs (1993) (9)
Collective Tree 1-Spanners for Interval Graphs (2005) (9)
A generalization of perfect graphs - i-perfect graphs (1996) (8)
An n² Algorithm for Determining the Bridges of a Graph (1971) (8)
Graph Property Update Algorithms and Their Appligation to Distance Matrices (1982) (8)
Collective additive tree spanners for circle graphs and polygonal graphs (2012) (8)
ON UNIQUELY -G k-COLOURABLE GRAPHS (1992) (8)
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (2007) (8)
Linear Orderings of Subfamilies of AT-Free Graphs (2006) (8)
A tie-break model for graph search (2015) (8)
Hereditary dominating pair graphs (2004) (8)
LBFS orderings and cocomparability graphs (1999) (8)
Edge-disjoint packings of graphs (1994) (7)
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time (1995) (7)
A Comparison And Evaluation Of Graph Theoretical Clustering Technioues (1978) (7)
Minimal event-node network of project precedence relations (1973) (6)
On cycle double covers of line graphs (1992) (6)
Maximal cliques structure for cocomparability graphs and applications (2016) (5)
A generalization of line graphs: (X, Y)-intersection graphs (1996) (5)
Circle Graph Recognition in Time O(n+m) α(n+m) (2011) (5)
Simple vertex ordering characterizations for graph search: (expanded abstract) (2005) (5)
Unicyclic Graphs Satisfy Harary′s Conjecture (1974) (5)
A generalization of perfect graphs— i -perfect graphs (1996) (4)
On Subfamilies of AT-Free Graphs (2001) (4)
An algorithm for determining the automorphism partitioning of an undirected graph (1972) (4)
A generalization of line graphs: ( X, Y )-intersection graphs (1996) (4)
On the Power of BFS to Determine a Graphs Diameter (2002) (3)
Computer-assisted medicine: How soft is software? (1979) (2)
Additive Spanners for Circle Graphs and Polygonal Graphs (2008) (2)
Unified View of Graph Searching and LDFS-Based Certifying Algorithms (2016) (2)
Isomorphic tree spanner problems (1995) (1)
Families of graphs complete for the strong perfect graph Conjecture (1986) (1)
Book reviews (2021) (1)
Circle Graph Recognition in Time $O(n+m) \alpha(n+m)$ (2011) (1)
04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes (2004) (1)
Book III: Scientific and Research Applications in Medical Care: User Views—A Mechanism for a User-Friendly Interface to a Large-Scale Database Management System (1982) (0)
A note on Ki-perfect graphs (1990) (0)
D M ] 2 1 O ct 2 00 7 Simple , Linear-time Modular Decomposition ∗ ( extended abstract ) (2007) (0)
ON UNIQUELY PARTITIONABLE RELATIONAL STRUCTURES AND OBJECT SYSTEMS (2006) (0)
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015 (2018) (0)
New Results - Understanding graph representations (2013) (0)
A note on a conjecture by Gavril on clique separable graphs (1983) (0)
Deposited in DRO : 08 September 2014 Version of attached le : Published Version Peer-review status of attached le : Peer-reviewed Citation for published item (2014) (0)
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada (2020) (0)
K-PARALLEL SEARCH TECHNIQUES (1976) (0)
Practical and Efficient Split Decomposition via Graph-Labelled Trees (2013) (0)
Proceedings of the Conference on Algebraic Aspects of Combinatorics : University of Toronto, Toronto, January 1975 (1975) (0)
D M ] 2 0 M ar 2 00 8 Simple , Linear-time Modular Decomposition ( Extended Abstract ) ∗ (2008) (0)
Isomorphic Tree Spanner Problems 1 (0)
A Linear Algorithm for Unit Interval Graph Recognition (1992) (0)
Almost Resolvable Max Packings / Min Coverings Of K n With 4-Cycles (2009) (0)
Forest embeddings in regular graphs of large girth (1981) (0)
Completeness for intersection classes (1998) (0)
Are flow charts obsolete? (1980) (0)
Stable 2-pairs and (X, Y)-intersection graphs (2001) (0)
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs (2021) (0)
Practical and Efficient Circle Graph Recognition (2013) (0)
User Views—A Mechanism for a User-Friendly Interface to a Large-Scale Database Management System*. (1982) (0)
The syllabus for the 1970 University of Toronto Ph. D. written comprehensive examination (1970) (0)
Addendum (1991) (0)

This paper list is powered by the following services:

Other Resources About Derek Corneil

en.wikipedia.org

What Schools Are Affiliated With Derek Corneil?

Derek Corneil is affiliated with the following schools:

Derek Corneil's Academic­Influence.com Rankings

Why Is Derek Corneil Influential?

Derek Corneil's Published Works

Published Works

Other Resources About Derek Corneil

What Schools Are Affiliated With Derek Corneil?

Derek Corneil's AcademicInfluence.com Rankings