Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Corneil, Derek"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Vertex ordering characterizations of graphs of bounded asteroidal number
Derek G. Corneil
,
Juraj Stacho
Journal of Graph Theory
78
(1), 2015, pp. 61-79
Practical and efficient circle graph recognition
Emeric Gioan
,
Christophe Paul
,
Marc Tedder
,
Derek Corneil
Algorithmica
69
(4), 2014, pp. 759-788
Practical and efficient split decomposition via graph-labelled trees
Emeric Gioan
,
Christophe Paul
,
Marc Tedder
,
Derek Corneil
Algorithmica
69
(4), 2014, pp. 789-843
LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
Derek G. Corneil
,
Barnaby Dalton
,
Michel Habib
SIAM Journal on Computing
42
(3), 2013, pp. 792-807
A simple polynomial algorithm for the longest path problem on cocomparability graphs
George B. Mertzios
,
Derek G. Corneil
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 940-963
The LBFS structure and recognition of interval graphs
Derek G. Corneil
,
Stephan Olariu
,
Lorna Stewart
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1905-1953
A simple linear time LexBFS cograph recognition algorithm
Anna Bretscher
,
Derek Corneil
,
Michel Habib
,
Christophe Paul
SIAM Journal on Discrete Mathematics
22
(4), 2008, pp. 1277-1296
A unified view of graph searching
Derek G. Corneil
,
Richard M. Krueger
SIAM Journal on Discrete Mathematics
22
(4), 2008, pp. 1259-1276
Additive spanners for circle graphs and polygonal graphs
Feodor F. Dragan
,
Derek G. Corneil
,
Ekkehard Köhler
,
Yang Xiang
Lecture Notes in Computer Science
5344
, 2008, pp. 110-121
Simpler linear-time modular decomposition via recursive factorizing permutations
Marc Tedder
,
Derek Corneil
,
Michel Habib
,
Christophe Paul
Lecture Notes in Computer Science
5125
, 2008, pp. 634-645
An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs
Marc Tedder
,
Derek Corneil
Lecture Notes in Computer Science
4393
, 2007, pp. 344-355
Linear orderings of subfamilies of AT-free graphs
Derek G. Corneil
,
Ekkehard Köhler
,
Stephan Olariu
,
Lorna Stewart
SIAM Journal on Discrete Mathematics
20
(1), 2006, pp. 105-118
Collective tree 1-spanners for interval graphs
Derek G. Corneil
,
Feodor F. Dragan
,
Ekkehard Köhler
,
Chenyu Yan
Lecture Notes in Computer Science
3787
, 2005, pp. 151-162
On the relationship between clique-width and treewidth
Derek G. Corneil
,
Udi Rotics
SIAM Journal on Computing
34
(4), 2005, pp. 825-847
Lexicographic breadth first search - A survey
Derek G. Corneil
Lecture Notes in Computer Science
3353
, 2004, pp. 1-19
Collective tree spanners and routing in AT-free related graphs
Feodor Dragan
,
Chenyu Yan
,
Derek G. Corneil
Lecture Notes in Computer Science
3353
, 2004, pp. 68-80
Recognizing powers of proper interval, split, and chordal graphs
Lap Chi Lau
,
Derek G. Corneil
SIAM Journal on Discrete Mathematics
18
(1), 2004, pp. 83-102
A simple linear time LexBFS cograph recognition algorithm
Anna Bretscher
,
Derek Corneil
,
Michel Habib
,
Christophe Paul
Lecture Notes in Computer Science
2880
, 2003, pp. 119-130
On the power of BFS to determine a graph's diameter
Derek G. Corneil
,
Feodor F. Dragan
,
Ekkehard Köhler
Networks
42
(4), 2003, pp. 209-222
Diameter determination on restricted graph families
Derek G. Corneil
,
Feodor F. Dragan
,
Michel Habib
,
Christoph Paul
Discrete Applied Mathematics
113
(2-3), 2001, pp. 143-166
On the relationship between clique-width and treewidth
Derek G. Corneil
,
Udi Rotics
Lecture Notes in Computer Science
2204
, 2001, pp. 78-90
On subfamilies of AT-free graphs
Ekkehard Köhler
,
Derek G. Corneil
,
Stephan Olariu
,
Lorna Stewart
Lecture Notes in Computer Science
2204
, 2001, pp. 241-253
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
Derek G. Corneil
,
Stephan Olariu
,
Lorna Stewart
SIAM Journal on Computing
28
(4), 1999, pp. 1284-1297
LBFS orderings and cocomparability graphs
Derek G. Corneil
,
Stephan Olariu
,
Lorna Stewart
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 883-884
Pancyclicity and
NP
-completeness in planar graphs
Ming-Chu Li
,
Derek G. Corneil
,
Eric Mendelsohn
Discrete Applied Mathematics
98
(3), 1999, pp. 219-225
Seiten 1
2
>