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

Suche: Series=LNCS AND Volume=2387

• On-line grid-packing with a single active grid
  Satoshi Fujita
  Lecture Notes in Computer Science 2387, 2002, pp. 476-483
• Bend minimization in orthogonal drawings using integer programming
  Petra Mutzel, René Weiskircher
  Lecture Notes in Computer Science 2387, 2002, pp. 484-493
• The conditional location of a median path
  Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh
  Lecture Notes in Computer Science 2387, 2002, pp. 494-503
• New results on the k-truck problem
  Weimin Ma, Yinfeng Xu, Jane You, James Liu, Kanliang Wang
  Lecture Notes in Computer Science 2387, 2002, pp. 504-513
• Theory of equal-flows in networks
  K. Srinathan, Pranava R. Goundan, M.V.N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan
  Lecture Notes in Computer Science 2387, 2002, pp. 514-524
• Minimum back-walk-free latency problem
  Yaw-Ling Lin
  Lecture Notes in Computer Science 2387, 2002, pp. 525-534
• Counting satisfying assignments in 2-SAT and 3-SAT
  Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström
  Lecture Notes in Computer Science 2387, 2002, pp. 535-543
• On the maximum number of irreducible coverings of an n-vertex graph by n-3 cliques
  Ioan Tomescu
  Lecture Notes in Computer Science 2387, 2002, pp. 544-553
• On reachability in graphs with bounded independence number
  Arfst Nickelsen, Till Tantau
  Lecture Notes in Computer Science 2387, 2002, pp. 554-563
• On parameterized enumeration
  Henning Fernau
  Lecture Notes in Computer Science 2387, 2002, pp. 564-573
• Probabilistic reversible automata and quantum automata
  Marats Golovkins, Maksim Kravtsev
  Lecture Notes in Computer Science 2387, 2002, pp. 574-583
• Quantum versus deterministic counter automata
  Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
  Lecture Notes in Computer Science 2387, 2002, pp. 584-594
• Quantum DNF learnability revisited
  Jeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami
  Lecture Notes in Computer Science 2387, 2002, pp. 595-604