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

• Approximation algorithms for a directed network design problem
  Vardges Melkonian, Éva Tardos
  Lecture Notes in Computer Science 1610, 1999, pp. 345-360
• Optimizing over all combinatorial embeddings of a planar graph
  Petra Mutzel, René Weiskircher
  Lecture Notes in Computer Science 1610, 1999, pp. 361-376
• A fast algorithm for computing minimum 3-way and 4-way cuts
  Hiroshi Nagamochi, Toshihide Ibaraki
  Lecture Notes in Computer Science 1610, 1999, pp. 377-390
• Scheduling two machines with release times
  John Noga, Steve Seiden
  Lecture Notes in Computer Science 1610, 1999, pp. 391-399
• An introduction to empty lattice simplices
  András Sebŏ
  Lecture Notes in Computer Science 1610, 1999, pp. 400-414
• On optimal ear-decompositions of graphs
  Zoltán Szigeti
  Lecture Notes in Computer Science 1610, 1999, pp. 415-428
• Gale-Shapley stable marriage problem revisited: Strategic issues and applications
  Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan
  Lecture Notes in Computer Science 1610, 1999, pp. 429-438
• Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut
  Eduardo Uchoa, Marcus Poggi de Aragão
  Lecture Notes in Computer Science 1610, 1999, pp. 439-452