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=8889

• Scheduling unit jobs with a common deadline to minimize the sum of weighted completion times and rejection penalties
  Nevzat Onur Domaniç, C. Gregory Plaxton
  Lecture Notes in Computer Science 8889, 2014, pp. 646-657
• Solving multi-choice secretary problem in parallel: An optimal observation-selection protocol
  Xiaoming Sun, Jia Zhang, Jialin Zhang
  Lecture Notes in Computer Science 8889, 2014, pp. 661-673
• A geometric approach to graph isomorphism
  Pawan Aurora, Shashank K. Mehta
  Lecture Notes in Computer Science 8889, 2014, pp. 674-685
• Concentrated hitting times of randomized search heuristics with variable drift
  Per Kristian Lehre, Carsten Witt
  Lecture Notes in Computer Science 8889, 2014, pp. 686-697
• Euclidean TSP with few inner points in linear space
  Paweƚ Gawrychowski, Damian Rusak
  Lecture Notes in Computer Science 8889, 2014, pp. 701-713
• Bottleneck partial-matching Voronoi diagrams and applications
  Matthias Henze, Rafel Jaume
  Lecture Notes in Computer Science 8889, 2014, pp. 714-725
• Ham-sandwich cuts for abstract order types
  Stefan Felsner, Alexander Pilz
  Lecture Notes in Computer Science 8889, 2014, pp. 726-737
• Graph orientation and flows over time
  Ashwin Arulselvan, Martin Groß, Martin Skutella
  Lecture Notes in Computer Science 8889, 2014, pp. 741-752
• A simple efficient interior point method for min-cost flow
  Ruben Becker, Andreas Karrenbauer
  Lecture Notes in Computer Science 8889, 2014, pp. 753-765
• Decremental all-pairs all shortest paths and betweenness centrality
  Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
  Lecture Notes in Computer Science 8889, 2014, pp. 766-778