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 [1]	Hilfe

Suche: Series=LNCS AND Volume=920

• Minimum cost dynamic flows: The series-parallel case
  Bettina Klinz, G.J. Woeginger
  Lecture Notes in Computer Science 920, 1995, pp. 329-343
• (0, \pm1) ideal matrices
  Paolo Nobili, Antonio Sassano
  Lecture Notes in Computer Science 920, 1995, pp. 344-359
• Embedding graphs in the torus in linear time
  Martin Juvan, Joz̑e Marinc̑ek, Bojan Mohar
  Lecture Notes in Computer Science 920, 1995, pp. 360-363
• A characterization of Seymour graphs
  A.A. Ageev, A.V. Kostochka, Z. Szigeti
  Lecture Notes in Computer Science 920, 1995, pp. 364-372
• The Markov chain of colourings
  J. Eric Bartels, Dominic J.A. Welsh
  Lecture Notes in Computer Science 920, 1995, pp. 373-387
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
  Harold N. Gabow, K.S. Manu
  Lecture Notes in Computer Science 920, 1995, pp. 388-402
• A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
  Hiroshi Nagamochi, Toshihide Ibaraki
  Lecture Notes in Computer Science 920, 1995, pp. 403-413
• How to make a strongly connected digraph two-connected
  A. Frank, T. Jordán
  Lecture Notes in Computer Science 920, 1995, pp. 414-425
• Polyhedra and optimization in connection with a weak majorization ordering
  Geir Dahl
  Lecture Notes in Computer Science 920, 1995, pp. 426-437
• Combining and strengthening Gomory cuts
  Sebastián Ceria, Gérard Cornuéjols, Milind Dawande
  Lecture Notes in Computer Science 920, 1995, pp. 438-451
• Sequence independent lifting of cover inequalities
  Zonghao Gu, George L. Nemhauser, Martin W.P. Savelsbergh
  Lecture Notes in Computer Science 920, 1995, pp. 452-461