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

• A new dynamic graph structure for large-scale transportation networks
  Georgia Mali, Panagiotis Michail, Andreas Paraskevopoulos, Christos Zaroliagis
  Lecture Notes in Computer Science 7878, 2013, pp. 312-323
• Capacitated rank-maximal matchings
  Katarzyna Paluch
  Lecture Notes in Computer Science 7878, 2013, pp. 324-335
• A faster CREW PRAM algorithm for computing Cartesian trees
  Chung Keung Poon, Hao Yuan
  Lecture Notes in Computer Science 7878, 2013, pp. 336-344
• Advice complexity of the online coloring problem
  Sebastian Seibert, Andreas Sprock, Walter Unger
  Lecture Notes in Computer Science 7878, 2013, pp. 345-357
• Sparse linear complementarity problems
  Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
  Lecture Notes in Computer Science 7878, 2013, pp. 358-369
• LP-rounding algorithms for the fault-tolerant facility placement problem
  Li Yan, Marek Chrobak
  Lecture Notes in Computer Science 7878, 2013, pp. 370-381