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

• Approximation of multiobjective optimization problems
  Mihalis Yannakakis
  Lecture Notes in Computer Science 2125, 2001, pp. 1-1
• Optimal, suboptimal, and robust algorithms for proximity graphs
  Ferran Hurtado, Giuseppe Liotta, Henk Meijer
  Lecture Notes in Computer Science 2125, 2001, pp. 2-13
• Optimal Möbius transformations for information visualization and meshing
  Marshall Bern, David Eppstein
  Lecture Notes in Computer Science 2125, 2001, pp. 14-25
• Using the pseudo-dimension to analyze approximation algorithms for integer programming
  Philip M. Long
  Lecture Notes in Computer Science 2125, 2001, pp. 26-37
• On the complexity of scheduling conditional real-time code
  Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele
  Lecture Notes in Computer Science 2125, 2001, pp. 38-49
• Time responsive external data structures for moving points
  Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold
  Lecture Notes in Computer Science 2125, 2001, pp. 50-61
• Voronoi diagrams for moving disks and applications
  Menelaos I. Karavelas
  Lecture Notes in Computer Science 2125, 2001, pp. 62-74
• Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
  Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 2125, 2001, pp. 75-86
• Deciding clique-width for graphs of bounded tree-width
  Wolfgang Espelage, Frank Gurski, Egon Wanke
  Lecture Notes in Computer Science 2125, 2001, pp. 87-98
• Complexity bounds for vertical decompositions of linear arrangements in four dimensions
  Vladlen Koltun
  Lecture Notes in Computer Science 2125, 2001, pp. 99-110
• Optimization over zonotopes and training Support Vector Machines
  Marshall Bern, David Eppstein
  Lecture Notes in Computer Science 2125, 2001, pp. 111-121
• Reporting intersecting pairs of polytopes in two and three dimensions
  Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
  Lecture Notes in Computer Science 2125, 2001, pp. 122-134
• Seller-focused algorithms for online auctioning
  Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar
  Lecture Notes in Computer Science 2125, 2001, pp. 135-147
• Competitive analysis of the LRFU paging algorithm
  Edith Cohen, Haim Kaplan, Uri Zwick
  Lecture Notes in Computer Science 2125, 2001, pp. 148-154
• Admission control to minimize rejections
  Avrim Blum, Adam Kalai, Jon Kleinberg
  Lecture Notes in Computer Science 2125, 2001, pp. 155-164
• Secure multi-party computational geometry
  Mikhail J. Atallah, Wenliang Du
  Lecture Notes in Computer Science 2125, 2001, pp. 165-179
• The grid placement problem
  Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison
  Lecture Notes in Computer Science 2125, 2001, pp. 180-191
• On the reflexivity of point sets
  Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S.B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia
  Lecture Notes in Computer Science 2125, 2001, pp. 192-204
• A \frac{7}{8}-approximation algorithm for Metric Max TSP
  Refael Hassin, Shlomi Rubinstein
  Lecture Notes in Computer Science 2125, 2001, pp. 205-209
• Approximating multi-objective knapsack problems
  Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
  Lecture Notes in Computer Science 2125, 2001, pp. 210-221
• Visual ranking of link structures
  Ulrik Brandes, Sabine Cornelsen
  Lecture Notes in Computer Science 2125, 2001, pp. 222-233
• A simple linear time algorithm for proper box rectangular drawings of plane graphs
  Xin He
  Lecture Notes in Computer Science 2125, 2001, pp. 234-245
• Short and simple labels for small distances and other functions
  Haim Kaplan, Tova Milo
  Lecture Notes in Computer Science 2125, 2001, pp. 246-257
• Fast Boolean matrix multiplication for highly clustered data
  Andreas Bjor̈klund, Andrzej Lingas
  Lecture Notes in Computer Science 2125, 2001, pp. 258-263
• Partitioning colored point sets into monochromatic parts
  Adrian Dumitrescu, János Pach
  Lecture Notes in Computer Science 2125, 2001, pp. 264-275