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
[3]
Hilfe
Suche: Author="Stewart, Lorna"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On list coloring and list homomorphism of permutation and interval graphs
Jessica Enright
,
Lorna Stewart
,
Gábor Tardos
SIAM Journal on Discrete Mathematics
28
(4), 2014, pp. 1675-1685
DP
-complete problems derived from extremal
NP
-complete properties
Yi Cao
,
Joseph Culberson
,
Lorna Stewart
Lecture Notes in Computer Science
5734
, 2009, pp. 199-210
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
Subtree filament graphs are subtree overlap graphs
Jessica Enright
,
Lorna Stewart
Information Processing Letters
104
(6), 2007, pp. 228-232
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
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
Biconvex graphs: Ordering and algorithms
Nesrine Abbas
,
Lorna K. Stewart
Discrete Applied Mathematics
103
(1-3), 2000, pp. 1-19
Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
Nesrine Abbas
,
Lorna Stewart
Discrete Applied Mathematics
91
(1-3), 1999, pp. 1-23
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
Approximating bandwidth by mixing layouts of interval graphs
Dieter Kratsch
,
Lorna Stewart
Lecture Notes in Computer Science
1563
, 1999, pp. 248-258
The ultimate interval graph recognition algorithm?
Derek G. Corneil
,
Stephan Olariu
,
Lorna Stewart
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 175-180
Asteroidal triple-free graphs
Derek G. Corneil
,
Stephan Olariu
,
Lorna Stewart
SIAM Journal on Discrete Mathematics
10
(3), 1997, pp. 399-430
Total domination and transformation
Dieter Kratsch
,
Lorna Stewart
Information Processing Letters
63
(3), 1997, pp. 167-170
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
Derek G. Corneil
,
Stephan Olariu
,
Lorna Stewart
Lecture Notes in Computer Science
944
, 1995, pp. 292-302
Computing a dominating pair in an asteroidal triple-free graph in linear time
Derek G. Corneil
,
Stephan Olariu
,
Lorna Stewart
Lecture Notes in Computer Science
955
, 1995, pp. 358-368
A linear time algorithm to compute a dominating path in an AT-free graph
Derek G. Stephan Olariu Corneil
,
Lorna Stewart
Information Processing Letters
54
, 1995, pp. 253-257
On cocolourings and cochromatic numbers of graphs
John Gimbel
,
Dieter Kratsch
,
Lorna Stewart
Discrete Applied Mathematics
48
, 1994, pp. 111-127
Asteroidal triple-free graphs
Derek G. Corneil
,
Stephan Olariu
,
Lorna Stewart
Lecture Notes in Computer Science
790
, 1993, pp. 211-224
Independence and domination in polygon graphs
Ehab S. Elmallah
,
Lorna K. Stewart
Discrete Applied Mathematics
44
(1-3), 1993, pp. 65-77
Domination on cocomparability graphs
Dieter Kratsch
,
Lorna Stewart
SIAM Journal on Discrete Mathematics
6
(3), 1993, August, pp. 400-417
Complexity results for well-covered graphs
Ramesh S. Sankaranarayana
,
Lorna K. Stewart
Networks
22
(3), 1992, pp. 247-262
Bipartite permutation graphs
Jeremy Spinrad
,
Andreas Brandstädt
,
Lorna Stewart
Discrete Applied Mathematics
18
, 1987, pp. 279-292