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 YEAR=2003

• Three sorting algorithms using priority queues
  Amr Elmasry
  Lecture Notes in Computer Science 2906, 2003, pp. 209-220
• On the geometric dilation of finite point sets
  Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
  Lecture Notes in Computer Science 2906, 2003, pp. 250-259
• On computing all immobilizing grasps of a simple polygon with few contacts
  Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen
  Lecture Notes in Computer Science 2906, 2003, pp. 260-269
• Optimal point set projections onto regular grids
  José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, J. Antoni Sellarès
  Lecture Notes in Computer Science 2906, 2003, pp. 270-279
• A faster algorithm for two-variable integer programming
  Friedrich Eisenbrand, Sören Laue
  Lecture Notes in Computer Science 2906, 2003, pp. 290-299
• Efficient algorithms for generation of combinatorial covering suites
  Adrian Dumitrescu
  Lecture Notes in Computer Science 2906, 2003, pp. 300-308
• On minimizing average weighted completion time: A PTAS for the job shop problem with release dates
  Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
  Lecture Notes in Computer Science 2906, 2003, pp. 319-328
• Settling the intractability of multiple alignment
  Isaac Elias
  Lecture Notes in Computer Science 2906, 2003, pp. 352-363
• On the locality properties of space-filling curves
  H.K. Dai, H.C. Su
  Lecture Notes in Computer Science 2906, 2003, pp. 385-394
• Geometric restrictions on producible polygonal protein chains
  Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
  Lecture Notes in Computer Science 2906, 2003, pp. 395-404
• Approximation hardness of minimum edge dominating set and minimum maximal matching
  Miroslav Chlebík, Janka Chlebíková
  Lecture Notes in Computer Science 2906, 2003, pp. 415-424
• On the existence and determination of satisfactory partitions in a graph
  Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
  Lecture Notes in Computer Science 2906, 2003, pp. 444-453
• A turn function scheme realized in the asynchronous single-writer/multi-reader shared memory model
  Tom Altman, Yoshihide Igarashi, Michiko Omori
  Lecture Notes in Computer Science 2906, 2003, pp. 454-463
• The student-project allocation problem
  David J. Abraham, Robert W. Irving, David F. Manlove
  Lecture Notes in Computer Science 2906, 2003, pp. 474-484
• Algorithms for enumerating circuits in matroids
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan
  Lecture Notes in Computer Science 2906, 2003, pp. 485-494
• A generalized Gale-Shapley algorithm for a discrete-concave stable-marriage model
  Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura
  Lecture Notes in Computer Science 2906, 2003, pp. 495-504
• Quasi-perfect minimally adaptive q-ary search with unreliable tests
  Ferdinando Cicalese, Christian Deppe
  Lecture Notes in Computer Science 2906, 2003, pp. 527-536
• New ways to construct binary search trees
  Travis Gagie
  Lecture Notes in Computer Science 2906, 2003, pp. 537-543
• Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
  Artur Czumaj, Andrzej Lingas, Johan Nilsson
  Lecture Notes in Computer Science 2906, 2003, pp. 544-553
• Deterministic algorithm for the t-threshold set problem
  Jérémy Barbay, Claire Kenyon
  Lecture Notes in Computer Science 2906, 2003, pp. 575-584
• Energy-efficient wireless network design
  Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
  Lecture Notes in Computer Science 2906, 2003, pp. 585-594
• Wavelength conversion in shortest-path all-optical networks
  Thomas Erlebach, Stamatis Stefanakos
  Lecture Notes in Computer Science 2906, 2003, pp. 595-604
• A heuristic for the stacker crane problem on trees which is almost surely exact
  Amin Coja-Oghlan, Sven O. Krumke, Till Nierhoff
  Lecture Notes in Computer Science 2906, 2003, pp. 605-614
• Flexible train rostering
  Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer
  Lecture Notes in Computer Science 2906, 2003, pp. 615-624
• Counting complexity classes over the reals I: The additive case
  Peter Bürgisser, Felipe Cucker
  Lecture Notes in Computer Science 2906, 2003, pp. 625-634