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
Hilfe
Suche: Author="Ellis, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The dominating set problem is fixed parameter tractable for graphs of bounded genus
J. Ellis
,
H. Fan
,
M. Fellows
Journal of Algorithms
52
(2), 2004, pp. 152-168
The dominating set problem is fixed parameter tractable for graphs of bounded genus
J. Ellis
,
H. Fan
,
M. Fellows
Lecture Notes in Computer Science
2368
, 2002, pp. 180-189
The vertex separation and search number of a graph
J.A. Ellis
,
I.H. Sudborough
,
J.S. Turner
Information and Computation
113
(1), 1994, August, pp. 50-79
Embedding rectangular grids into square grids
J.A. Ellis
IEEE Transactions on Computers
40
(1), 1991, January, pp. 46-52
On the complexity of fixed parameter problems
K. Abrahamson
,
J. Ellis
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 210-215
Embedding rectangular grids into square grids
J.A. Ellis
Lecture Notes in Computer Science
319
, 1988, pp. 181-190