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	Hilfe

Suche: Series=LNCS AND Volume=4271

• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
  Haim Kaplan, Yahav Nussbaum
  Lecture Notes in Computer Science 4271, 2006, pp. 289-300
• Graph labelings derived from models in distributed computing
  Jérémie Chalopin, Daniël Paulusma
  Lecture Notes in Computer Science 4271, 2006, pp. 301-312
• Flexible matchings
  Miklós Bartha, Miklós Krész
  Lecture Notes in Computer Science 4271, 2006, pp. 313-324
• Simultaneous graph embeddings with fixed edges
  Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
  Lecture Notes in Computer Science 4271, 2006, pp. 325-335
• Approximation algorithms for restricted cycle covers based on cycle decompositions
  Bodo Manthey
  Lecture Notes in Computer Science 4271, 2006, pp. 336-347
• Circular-perfect concave-round graphs
  Sylvain Coulonges
  Lecture Notes in Computer Science 4271, 2006, pp. 348-355