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

• An improved algorithm for finding cycles through elements
  Ken-ichi Kawarabayashi
  Lecture Notes in Computer Science 5035, 2008, pp. 374-384
• The stable roommates problem with choice functions
  Tamás Fleiner
  Lecture Notes in Computer Science 5035, 2008, pp. 385-400
• A new approach to splitting-off
  Attila Bernáth, Tamás Király
  Lecture Notes in Computer Science 5035, 2008, pp. 401-415
• Can pure cutting plane algorithms work?
  Arrigo Zanette, Matteo Fischetti, Egon Balas
  Lecture Notes in Computer Science 5035, 2008, pp. 416-434
• The mixing set with divisible capacities
  Michele Conforti, Marco Di Summa, Laurence A. Wolsey
  Lecture Notes in Computer Science 5035, 2008, pp. 435-449
• A polynomial time algorithm for the stochastic uncapacitated lot-sizing problem with backlogging
  Yongpei Guan, Andrew Miller
  Lecture Notes in Computer Science 5035, 2008, pp. 450-462
• Lifting integer variables in minimal inequalities corresponding to lattice-free triangles
  Santanu S. Dey, Laurence A. Wolsey
  Lecture Notes in Computer Science 5035, 2008, pp. 463-475