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

• A multi-scale algorithm for drawing graphs nicely
  Ronny Hadany, David Harel
  Lecture Notes in Computer Science 1665, 1999, pp. 262-277
• All separating triangles in a plane graph can be optimally ``broken'' in polynomial time
  Anna Accornero, Massimo Ancona, Sonia Varini
  Lecture Notes in Computer Science 1665, 1999, pp. 278-290
• Linear orderings of random geometric graphs
  Josep Díaz, Mathew D. Penrose, Jordi Petit, María Serna
  Lecture Notes in Computer Science 1665, 1999, pp. 291-302
• Finding smallest supertrees under minor containment
  Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 1665, 1999, pp. 303-312
• Vertex cover: Further observations and further improvements
  Jianer Chen, Iyad A. Kanj, Weijia Jia
  Lecture Notes in Computer Science 1665, 1999, pp. 313-324
• On the hardness of recognizing bundles in time table graphs
  Annegret Liebers, Dorothea Wagner, Karsten Weihe
  Lecture Notes in Computer Science 1665, 1999, pp. 325-337
• Optimal solutions for frequency assignment problems via tree decomposition
  Arie M.C.A. Koster, Stan P.M. van Hoesel, Antoon W.J. Kolen
  Lecture Notes in Computer Science 1665, 1999, pp. 338-349
• Fixed-parameter complexity of \lambda-labelings
  Jiȓí Fiala, Ton Kloks, Jan Kratochvíl
  Lecture Notes in Computer Science 1665, 1999, pp. 350-363
• Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
  Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
  Lecture Notes in Computer Science 1665, 1999, pp. 364-376
• On claw-free asteroidal triple-free graphs
  Harald Hempel, Dieter Kratsch
  Lecture Notes in Computer Science 1665, 1999, pp. 377-390
• Vertex partitioning of crown-free interval graphs
  Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani
  Lecture Notes in Computer Science 1665, 1999, pp. 391-401
• Triangulated neighbourhoods in C_4-free Berge graphs
  I. Parfenoff, F. Roussel, I. Rusu
  Lecture Notes in Computer Science 1665, 1999, pp. 402-412