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

• Semi-matchings for bipartite graphs and load balancing
  Nicholas J.A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
  Lecture Notes in Computer Science 2748, 2003, pp. 294-306
• The Traveling Salesman Problem for cubic graphs
  David Eppstein
  Lecture Notes in Computer Science 2748, 2003, pp. 307-318
• Sorting circular permutations by reversal
  Andrew Solomon, Paul Sutcliffe, Raymond Lister
  Lecture Notes in Computer Science 2748, 2003, pp. 319-328
• An improved bound on Boolean matrix multiplication for highly clustered data
  Leszek Ga̧sieniec, Andrzej Lingas
  Lecture Notes in Computer Science 2748, 2003, pp. 329-339
• Dynamic text and static pattern matching
  Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol
  Lecture Notes in Computer Science 2748, 2003, pp. 340-352
• Real two dimensional scaled matching
  Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
  Lecture Notes in Computer Science 2748, 2003, pp. 353-364
• Proximity structures for geometric graphs
  Sanjiv Kapoor, Xiang-Yang Li
  Lecture Notes in Computer Science 2748, 2003, pp. 365-376
• The zigzag path of a pseudo-triangulation
  Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
  Lecture Notes in Computer Science 2748, 2003, pp. 377-388
• Alternating paths along orthogonal segments
  Csaba D. Tóth
  Lecture Notes in Computer Science 2748, 2003, pp. 389-400
• Improved approximation algorithms for the quality of service Steiner tree problem
  Marek Karpinski, Ion I. Mȃndoiu, Alexander Olshevsky, Alexander Zelikovsky
  Lecture Notes in Computer Science 2748, 2003, pp. 401-411
• Chips on wafers
  Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
  Lecture Notes in Computer Science 2748, 2003, pp. 412-423
• A model for analyzing black-box optimization
  Vinhthuy Phan, Steven Skiena, Pavel Sumazin
  Lecture Notes in Computer Science 2748, 2003, pp. 424-438
• On the Hausdorff Voronoi diagram of point clusters in the plane
  Evanthia Papadopoulou
  Lecture Notes in Computer Science 2748, 2003, pp. 439-450
• Output-sensitive algorithms for computing nearest-neighbour decision boundaries
  David Bremner, Erik Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried Toussaint
  Lecture Notes in Computer Science 2748, 2003, pp. 451-461
• Significant-presence range queries in categorical data
  Mark de Berg, Herman J. Haverkort
  Lecture Notes in Computer Science 2748, 2003, pp. 462-473
• Either/or: Using VERTEX COVER structure in designing FPT-algorithms - The case of k-INTERNAL SPANNING TREE
  Elena Prieto, Christian Sloper
  Lecture Notes in Computer Science 2748, 2003, pp. 474-483
• Parameterized complexity of directed feedback set problems in tournaments
  Venkatesh Raman, Saket Saurabh
  Lecture Notes in Computer Science 2748, 2003, pp. 484-492
• Compact visibility representation and straight-line grid embedding of plane graphs
  Huaming Zhang, Xin He
  Lecture Notes in Computer Science 2748, 2003, pp. 493-504
• New directions and new challenges in algorithm design and complexity, parameterized
  Michael R. Fellows
  Lecture Notes in Computer Science 2748, 2003, pp. 505-519