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
[2]
Hilfe
Suche: Author="Neyer, Gabriele"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of train assignment problems
Thomas Erlebach
,
Martin Gantenbein
,
Daniel Hürlimann
,
Gabriele Neyer
,
Aris Pagourtzis
,
Paolo Penna
,
Konrad Schlude Kathleen Steinhöfel
,
David Scot Taylor
,
Peter Widmayer
Lecture Notes in Computer Science
2223
, 2001, pp. 390-402
Labeling downtown
Gabriele Neyer
,
Frank Wagner
Lecture Notes in Computer Science
1767
, 2000, pp. 113-124
All separating triangles in a plane graph can be optimally ``broken'' in polynomial time
Anna Accornero
,
Massimo Ancona
,
Sonia Varini
Lecture Notes in Computer Science
1665
, 1999, pp. 278-290
Online algorithms: A study of graph-theoretic concepts
Susanne Albers
Lecture Notes in Computer Science
1665
, 1999, pp. 10-26
Routing permutations in the hypercube
Olivier Baudon
,
Guillaume Fertin
,
Ivan Havel
Lecture Notes in Computer Science
1665
, 1999, pp. 179-190
Generating all the minimal separators of a graph
Anne Berry
,
Jean-Paul Bordat
,
Olivier Cogis
Lecture Notes in Computer Science
1665
, 1999, pp. 167-172
Optimal cuts for powers of the Petersen graph
Sergei L. Bezrukov
,
Sajal K. Das
,
Robert Elsässer
Lecture Notes in Computer Science
1665
, 1999, pp. 228-239
PlaNet - A software package of algorithms and heuristics for disjoint paths in
Pla
nar
Net
works
Ulrik Brandes
,
Wolfram Schlickenrieder
,
Gabriele Neyer
,
Dorothea Wagner
,
Karsten Weihe
Discrete Applied Mathematics
92
(2-3), 1999, pp. 91-110
Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
Andreas Brandstädt
,
Feodor F. Dragan
,
Ekkehard Köhler
Lecture Notes in Computer Science
1665
, 1999, pp. 364-376
Vertex cover: Further observations and further improvements
Jianer Chen
,
Iyad A. Kanj
,
Weijia Jia
Lecture Notes in Computer Science
1665
, 1999, pp. 313-324
Recognizing bipartite incident-graphs of circulant digraphs
Johanne Cohen
,
Pierre Fraigniaud
,
Cyril Gavoille
Lecture Notes in Computer Science
1665
, 1999, pp. 215-227
Vertex partitioning of crown-free interval graphs
Giuseppe Confessore
,
Paolo Dell'Olmo
,
Stefano Giordani
Lecture Notes in Computer Science
1665
, 1999, pp. 391-401
Linear orderings of random geometric graphs
Josep Díaz
,
Mathew D. Penrose
,
Jordi Petit
,
María Serna
Lecture Notes in Computer Science
1665
, 1999, pp. 291-302
Two broadcasting problems in faulty hypercubes
Stefan Dobrev
,
Imrich Vrt̑o
Lecture Notes in Computer Science
1665
, 1999, pp. 173-178
Fixed-parameter complexity of
\lambda
-labelings
Jiȓí Fiala
,
Ton Kloks
,
Jan Kratochvíl
Lecture Notes in Computer Science
1665
, 1999, pp. 350-363
Optimal irreversible dynamos in chordal rings
Paola Flocchini
,
Frédéric Geurts
,
Nicola Santoro
Lecture Notes in Computer Science
1665
, 1999, pp. 202-214
On the clique-width of perfect graph classes
Martin Charles Golumbic
,
Udi Rotics
Lecture Notes in Computer Science
1665
, 1999, pp. 135-147
A multi-scale algorithm for drawing graphs nicely
Ronny Hadany
,
David Harel
Lecture Notes in Computer Science
1665
, 1999, pp. 262-277
Mod-2 independence and domination in graphs
Magnús M. Halldórsson
,
Jan Kratochvíl
,
Jan Arne Telle
Lecture Notes in Computer Science
1665
, 1999, pp. 101-109
Euler is standing in line - Dial-a-ride problems with precedence-constraints
D. Hauptmeier
,
S.O. Krumke
,
J. Rambau
,
H.-C. Wirth
Lecture Notes in Computer Science
1665
, 1999, pp. 42-54
On claw-free asteroidal triple-free graphs
Harald Hempel
,
Dieter Kratsch
Lecture Notes in Computer Science
1665
, 1999, pp. 377-390
NLC
_2
-decomposition in polynomial time
Öjvind Johansson
Lecture Notes in Computer Science
1665
, 1999, pp. 110-121
Optimal solutions for frequency assignment problems via tree decomposition
Arie M.C.A. Koster
,
Stan P.M. van Hoesel
,
Antoon W.J. Kolen
Lecture Notes in Computer Science
1665
, 1999, pp. 338-349
Discrete optimization methods for packing problems in two and three dimensions - With applications in the textile and car manufacturing industries
Thomas Lengauer
Lecture Notes in Computer Science
1665
, 1999, pp. 27-28
On the hardness of recognizing bundles in time table graphs
Annegret Liebers
,
Dorothea Wagner
,
Karsten Weihe
Lecture Notes in Computer Science
1665
, 1999, pp. 325-337
Seiten 1
2
>