Person:1070246

Available identifiers

zbMath Open corneil.derek-gordonDBLP46/6360WikidataQ5261892 ScholiaQ5261892MaRDI QIDQ1070246

List of research outcomes

Publication	Date of Publication	Type
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications	2024-04-29	Paper
Asteroidal triple-free graphs	2024-01-05	Paper
Computing a dominating pair in an asteroidal triple-free graph in linear time	2022-12-16	Paper
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs	2021-06-29	Paper
Linear time algorithms for dominating pairs in asteroidal triple-free graphs	2019-01-10	Paper
On the Power of Graph Searching for Cocomparability Graphs	2016-04-07	Paper
A tie-break model for graph search	2015-12-10	Paper
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number	2015-01-21	Paper
Practical and efficient circle graph recognition	2014-11-19	Paper
Practical and efficient split decomposition via graph-labelled trees	2014-11-19	Paper
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs	2013-09-25	Paper
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs	2013-01-04	Paper
Collective additive tree spanners for circle graphs and polygonal graphs	2012-08-14	Paper
Polynomial-time recognition of clique-width \(\leq 3\) graphs	2012-05-11	Paper
Vertex splitting and the recognition of trapezoid graphs	2011-08-10	Paper
The LBFS Structure and Recognition of Interval Graphs	2010-12-03	Paper
On end-vertices of lexicographic breadth first searches	2010-05-05	Paper
Graph-Theoretic Concepts in Computer Science	2010-01-12	Paper
A Unified View of Graph Searching	2009-11-27	Paper
A Simple Linear Time LexBFS Cograph Recognition Algorithm	2009-11-27	Paper
Additive Spanners for Circle Graphs and Polygonal Graphs	2009-01-20	Paper
Collective Tree Spanners and Routing in AT-free Related Graphs	2009-01-19	Paper
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations	2008-08-28	Paper
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs	2007-09-03	Paper
Simple vertex ordering characterizations for graph search	2007-05-29	Paper
Graph-Theoretic Concepts in Computer Science	2006-11-01	Paper
Linear Orderings of Subfamilies of AT‐Free Graphs	2006-06-01	Paper
Graph-Theoretic Concepts in Computer Science	2005-12-08	Paper
Graph-Theoretic Concepts in Computer Science	2005-12-08	Paper
2-tree probe interval graphs have a large obstruction set	2005-09-28	Paper
On the Relationship Between Clique-Width and Treewidth	2005-09-16	Paper
Recognizing Powers of Proper Interval, Split, and Chordal Graphs	2005-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q3044328	2004-08-11	Paper
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4448749	2004-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4448763	2004-02-18	Paper
On the power of BFS to determine a graph's diameter	2004-02-03	Paper
Hereditary dominating pair graphs	2004-01-26	Paper
Diameter determination on restricted graph families	2002-08-14	Paper
Stable 2-pairs and \((X,Y)\)-intersection graphs	2001-07-05	Paper
https://portal.mardi4nfdi.de/entity/Q4508369	2001-05-13	Paper
Completeness for intersection classes	2000-11-02	Paper
Pancyclicity and NP-completeness in planar graphs	2000-06-29	Paper
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs	1999-10-28	Paper
Tree Powers	1999-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q4250178	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4252390	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4232788	1999-04-26	Paper
The existence of uniquely \(-G\) colourable graphs	1998-03-24	Paper
Asteroidal Triple-Free Graphs	1998-02-09	Paper
Simple linear time recognition of unit interval graphs	1997-02-28	Paper
A linear time algorithm to compute a dominating path in an AT-free graph	1997-02-28	Paper
A generalization of perfect graphs?i-perfect graphs	1996-12-15	Paper
A generalization of line graphs: (X, Y)-intersection graphs	1996-08-13	Paper
On the structure of trapezoid graphs	1996-07-07	Paper
Isomorphic tree spanner problems	1995-10-09	Paper
Tree Spanners	1995-09-20	Paper
Stable set bonding in perfect graphs and parity graphs	1994-08-10	Paper
Edge-disjoint packings of graphs	1994-06-08	Paper
https://portal.mardi4nfdi.de/entity/Q3139523	1994-05-19	Paper
Polynomial-time instances of the minimum weight triangulation problem	1994-03-03	Paper
On the complexity of the embedding problem for hypercube related graphs	1993-12-20	Paper
ON UNIQUELY -G k-COLOURABLE GRAPHS	1993-05-16	Paper
On cycle double covers of line graphs	1992-09-27	Paper
Graph properties and hypergraph colourings	1992-06-28	Paper
Dominating sets in perfect graphs	1992-06-25	Paper
Addendum to: The complexity of regular subgraph recognition	1992-06-25	Paper
Parallel algorithms for parity graphs	1991-01-01	Paper
The complexity of regular subgraph recognition	1990-01-01	Paper
Forbidden minors characterization of partial 3-trees	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3351379	1990-01-01	Paper
Embedding Trees in a Hypercube is NP-Complete	1990-01-01	Paper
A note onKi-perfect graphs	1990-01-01	Paper
The complexity of generalized clique covering	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3475304	1988-01-01	Paper
Ki-covers. II.Ki-perfect graphs	1987-01-01	Paper
On generalized graph colorings	1987-01-01	Paper
Complexity of Finding Embeddings in a k-Tree	1987-01-01	Paper
A Dynamic Programming Approach to the Dominating Set Problem on k-Trees	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3797233	1987-01-01	Paper
\(K_ i\)-covers. I: Complexity and polytopes	1986-01-01	Paper
Families of graphs complete for the strong perfect graph Conjecture	1986-01-01	Paper
The complexity of generalized clique packing	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3334090	1984-01-01	Paper
A non-factorial algorithm for canonical numbering of a graph	1984-01-01	Paper
On pseudosimilarity in trees	1983-01-01	Paper
A note on a conjecture by Gavril on clique separable graphs	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3697033	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3663341	1982-01-01	Paper
Graph Property Update Algorithms and Their Appligation to Distance Matrices	1982-01-01	Paper
Isomorphism Testing in Hookup Classes	1982-01-01	Paper
Complement reducible graphs	1981-01-01	Paper
Forest embeddings in regular graphs of large girth	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3952124	1981-01-01	Paper
On deciding switching equivalence of graphs	1980-01-01	Paper
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3910555	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4190142	1979-01-01	Paper
Parallel Computations in Graph Theory	1978-01-01	Paper
Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4121908	1977-01-01	Paper
The graph isomorphism disease	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4107927	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4090344	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4063169	1974-01-01	Paper
Unicyclic Graphs Satisfy Harary′s Conjecture	1974-01-01	Paper
An algorithm for determining the automorphism partitioning of an undirected graph	1972-01-01	Paper
Corrections to Bierstone's Algorithm for Generating Cliques	1972-01-01	Paper
An \(n^ 2\) algorithm for determining the bridges of a graph	1971-01-01	Paper
An Efficient Algorithm for Graph Isomorphism	1970-01-01	Paper
Algorithms for finding a fundamental set of cycles for an undirected linear graph	1967-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Derek Gordon Corneil