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

• Hanani-Tutte and monotone drawings
  Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel S̑tefankovic̑
  Lecture Notes in Computer Science 6986, 2011, pp. 283-294
• On collinear sets in straight-line drawings
  Alexander Ravsky, Oleg Verbitsky
  Lecture Notes in Computer Science 6986, 2011, pp. 295-306
• From few components to an Eulerian graph by adding arcs
  Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
  Lecture Notes in Computer Science 6986, 2011, pp. 307-318
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
  Steven Chaplick, Elad Cohen, Juraj Stacho
  Lecture Notes in Computer Science 6986, 2011, pp. 319-330
• A polynomial time algorithm for bounded directed pathwidth
  Hisao Tamaki
  Lecture Notes in Computer Science 6986, 2011, pp. 331-342