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: Series=LNCS AND Volume=1928

• On the expected runtime and the success probability of evolutionary algorithms
  Ingo Wegener
  Lecture Notes in Computer Science 1928, 2000, pp. 1-10
• n points and one line: Analysis of randomized games
  Emo Welzl
  Lecture Notes in Computer Science 1928, 2000, pp. 11-12
• Approximating call-scheduling makespan in all-optical networks
  Luca Becchetti, Miriam di Ianni, Alberto Marchetti-Spaccamela
  Lecture Notes in Computer Science 1928, 2000, pp. 13-22
• New spectral lower bounds on the bisection width of graphs
  Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
  Lecture Notes in Computer Science 1928, 2000, pp. 23-34
• Traversing directed Eulerian mazes
  Sandeep Bhatt, Shimon Even, David Greenberg, Rafi Tayar
  Lecture Notes in Computer Science 1928, 2000, pp. 35-46
• On the space and access complexity of computation DAGs
  Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto
  Lecture Notes in Computer Science 1928, 2000, pp. 47-58
• Approximating the treewidth of AT-free graphs
  Vincent Bouchitté, Ioan Todinca
  Lecture Notes in Computer Science 1928, 2000, pp. 59-70
• Split-perfect graphs: Characterizations and algorithmic use
  Andreas Brandstädt, Van Bang Le
  Lecture Notes in Computer Science 1928, 2000, pp. 71-82
• Coarse grained parallel algorithms for detecting convex bipartite graphs
  Edson Cáceres, Albert Chan, Frank Dehne, Giuseppe Prencipe
  Lecture Notes in Computer Science 1928, 2000, pp. 83-94
• Networks with small stretch number
  Serafino Cicerone, Gabriele di Stefano
  Lecture Notes in Computer Science 1928, 2000, pp. 95-106
• Efficient dispersion algorithms for geometric intersection graphs
  Peter Damaschke
  Lecture Notes in Computer Science 1928, 2000, pp. 107-115
• Optimizing cost flows by modifying arc costs and capacities
  Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
  Lecture Notes in Computer Science 1928, 2000, pp. 116-126
• Update networks and their routing strategies
  Michael J. Dinneen, Bakhadyr Khoussainov
  Lecture Notes in Computer Science 1928, 2000, pp. 127-136
• Computing input multiplicity in anonymous synchronous networks with dynamic faults
  Stefan Dobrev
  Lecture Notes in Computer Science 1928, 2000, pp. 137-148
• Diameter of the Knödel graph
  Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrt̑o
  Lecture Notes in Computer Science 1928, 2000, pp. 149-160
• On the domination search number
  Fedor Fomin, Dieter Kratsch, Haiko Müller
  Lecture Notes in Computer Science 1928, 2000, pp. 161-171
• Efficient communication in unknown networks
  Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
  Lecture Notes in Computer Science 1928, 2000, pp. 172-183
• Graph coloring on a coarse grained multiprocessor
  Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
  Lecture Notes in Computer Science 1928, 2000, pp. 184-195
• The tree-width of clique-width bounded graphs without K_{n,n}
  Frank Gurski, Egon Wanke
  Lecture Notes in Computer Science 1928, 2000, pp. 196-205
• Tree spanners for subgraphs and related tree covering problems
  Dagmar Handke, Guy Kortsarz
  Lecture Notes in Computer Science 1928, 2000, pp. 206-217
• Minimal size of piggypacked information for tracking causality: A graph-based characterization
  Jean Michel Hélary, Giovanna Melideo
  Lecture Notes in Computer Science 1928, 2000, pp. 218-229
• The expressive power and complexity of dynamic process graphs
  Andreas Jakoby, Maciej Liśkiewicz, Rüdiger Reischuk
  Lecture Notes in Computer Science 1928, 2000, pp. 230-242
• Bandwidth of split and circular permutation graphs
  Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller
  Lecture Notes in Computer Science 1928, 2000, pp. 243-254
• Recognizing graphs without asteroidal triples
  Ekkehard Köhler
  Lecture Notes in Computer Science 1928, 2000, pp. 255-266
• Budget constrained minimum cost connected medians
  Goran Konjevod, Sven O. Krumke, Madhav Marathe
  Lecture Notes in Computer Science 1928, 2000, pp. 267-278