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="Stege, Ulrike"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Connecting a set of circles with minimum sum of radii
Erin Wolf Chambers
,
Sándor P. Fekete
,
Hella-Franziska Hoffmann
,
Dimitri Marinakis
,
Joseph S.B. Mitchell
,
Venkatesh Srinivasan
,
Ulrike Stege
,
Sue Whitesides
Lecture Notes in Computer Science
6844
, 2011, pp. 183-194
Connectivity graphs of uncertainty regions
Erin Chambers
,
Alejandro Erickson
,
Sándor Fekete
,
Jonathan Lenchner
,
Jeff Sember
,
Srinivasan Venkatesh
,
Ulrike Stege
,
Svetlana Stolpner
,
Christoph Weibel
,
Sue Whitesides
Lecture Notes in Computer Science
6507
, 2010, pp. 434-445
Parameterized pursuit-evasion games
Allan Scott
,
Ulrike Stege
Theoretical Computer Science
411
(43), 2010, pp. 3845-3858
Politician's firefighting
Allan E. Scott
,
Ulrike Stege
,
Norbert Zeh
Lecture Notes in Computer Science
4288
, 2006, pp. 608-617
A refined search tree technique for dominating set on planar graphs
Jochen Alber
,
Hongbing Fan
,
Michael R. Fellows
,
Henning Fernau
,
Rolf Niedermeier
,
Fran Rosamond
,
Ulrike Stege
Journal of Computer and System Sciences
71
(4), 2005, pp. 385-405
Solving large FPT problems on coarse-grained parallel machines
James Cheetham
,
Frank Dehne
,
Andrew Rau-Chaplin
,
Ulrike Stege
,
Peter J. Taillon
Journal of Computer and System Sciences
67
(4), 2003, pp. 691-706
Analogs & duals of the MAST problem for sequences & trees
Michael Fellows
,
Michael Hallett
,
Ulrike Stege
Journal of Algorithms
49
(1), 2003, pp. 192-216
An
O(pn + 1.151^p)
-algorithm for
p
-profit cover and its practical implications for vertex cover
Ulrike Stege
,
Iris van Rooij
,
Alex Hertel
,
Philipp Hertel
Lecture Notes in Computer Science
2518
, 2002, pp. 249-261
Refined search tree technique for DOMINATING SET on planar graphs
Jochen Alber
,
Hongbing Fan
,
Michael R. Fellows
,
Henning Fernau
,
Rolf Niedermeier
,
Fran Rosamond
,
Ulrike Stege
Lecture Notes in Computer Science
2136
, 2001, pp. 111-122
Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems
Michael R. Fellows
,
Catherine McCartin
,
Frances A. Rosamond
,
Ulrike Stege
Lecture Notes in Computer Science
1974
, 2000, pp. 240-251
Gene trees and species trees: The gene-duplication problem is fixed-parameter tractable
Ulrike Stege
Lecture Notes in Computer Science
1663
, 1999, pp. 288-293
Analogs and duals of the MAST problem for sequences and trees
Michael Fellows
,
Michael Hallett
,
Chantal Korostensky
,
Ulrike Stege
Lecture Notes in Computer Science
1461
, 1998, pp. 103-114
On the multiple gene duplication problem
Michael Fellows
,
Michael Hallett
,
Ulrike Stege
Lecture Notes in Computer Science
1533
, 1998, pp. 347-356