 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen 
|
Hilfe 
|
 |
|
| Suche: Series=LNCS AND Volume=5344 |
|
-
Parameterized graph cleaning problems
Dániel Marx, Ildikó Schlotter
Lecture Notes in Computer Science 5344, 2008, pp. 287-299 -
Traffic grooming in unidirectional WDM rings with bounded degree request graph
Xavier Muñoz, Ignasi Sau
Lecture Notes in Computer Science 5344, 2008, pp. 300-311 -
Fast robber in planar graphs
Nicolas Nisse, Karol Suchan
Lecture Notes in Computer Science 5344, 2008, pp. 312-323 -
From a circular-arc model to a proper circular-arc model
Yahav Nussbaum
Lecture Notes in Computer Science 5344, 2008, pp. 324-335 -
Digraph decompositions and monotonicity in digraph searching
Stephan Kreutzer, Sebastian Ordyniak
Lecture Notes in Computer Science 5344, 2008, pp. 336-347 -
Searching for a visible, lazy fugitive
David Richerby, Dimitrios M. Thilikos
Lecture Notes in Computer Science 5344, 2008, pp. 348-359 -
A faster shortest-paths algorithm for minor-closed graph classes
Siamak Tazari, Matthias Müller-Hannemann
Lecture Notes in Computer Science 5344, 2008, pp. 360-371 -
Local construction and coloring of spanners of location aware unit disk graphs
Andreas Wiese, Evangelos Kranakis
Lecture Notes in Computer Science 5344, 2008, pp. 372-383
|
|
|