Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND Volume=5664

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Optimal embedding into star metrics
David Eppstein, Kevin A. Wortman
Lecture Notes in Computer Science 5664, 2009, pp. 290-301
Online square packing
Sándor P. Fekete, Tom Kamphans, Nils Schweer
Lecture Notes in Computer Science 5664, 2009, pp. 302-314
Worst-case optimal adaptive prefix coding
Travis Gagie, Yakov Nekrich
Lecture Notes in Computer Science 5664, 2009, pp. 315-326
New results on visibility in simple polygons
Alexander Gilbers, Rolf Klein
Lecture Notes in Computer Science 5664, 2009, pp. 327-338
Dynamic graph clustering using minimum-cut trees
Robert Görke, Tanja Hartmann, Dorothea Wagner
Lecture Notes in Computer Science 5664, 2009, pp. 339-350
Rank-balanced trees
Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
Lecture Notes in Computer Science 5664, 2009, pp. 351-362
Approximation algorithms for finding a minimum perimeter polygon intersecting a set of line segments
Farzad Hassanzadeh, David Rappaport
Lecture Notes in Computer Science 5664, 2009, pp. 363-374
Reconfiguration of list edge-colorings in a graph
Takehiro Ito, Marcin Kamiński, Erik D. Demaine
Lecture Notes in Computer Science 5664, 2009, pp. 375-386
The simultaneous representation problem for chordal, comparability and permutation graphs
Krishnam Raju Jampani, Anna Lubiw
Lecture Notes in Computer Science 5664, 2009, pp. 387-398
Two for one: Tight approximation of 2D bin packing
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
Lecture Notes in Computer Science 5664, 2009, pp. 399-410
Fault tolerant external memory algorithms
Gerth Stlting Brodal, Allan Grnlund Jrgensen, Thomas Mlhave
Lecture Notes in Computer Science 5664, 2009, pp. 411-422
Inspecting a set of strips optimally
Tom Kamphans, Elmar Langetepe
Lecture Notes in Computer Science 5664, 2009, pp. 423-434
A pseudopolynomial algorithm for Alexandrov's theorem
Daniel Kane, Gregory N. Price, Erik D. Demaine
Lecture Notes in Computer Science 5664, 2009, pp. 435-446
A scheme for computing minimum covers within simple regions
Matthew J. Katz, Gila Morgenstern
Lecture Notes in Computer Science 5664, 2009, pp. 447-458
Better approximation algorithms for the Maximum Internal Spanning Tree problem
Martin Knauer, Joachim Spoerhase
Lecture Notes in Computer Science 5664, 2009, pp. 459-470
Two approximation algorithms for ATSP with strengthened triangle inequality
Łukasz Kowalik, Marcin Mucha
Lecture Notes in Computer Science 5664, 2009, pp. 471-482
Streaming embeddings with slack
Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler
Lecture Notes in Computer Science 5664, 2009, pp. 483-494
Computing the implicit Voronoi diagram in triple precision
David L. Millman, Jack Snoeyink
Lecture Notes in Computer Science 5664, 2009, pp. 495-506
Efficient approximation of combinatorial problems by moderately exponential algorithms
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Lecture Notes in Computer Science 5664, 2009, pp. 507-518
Integer programming: Optimization and evaluation are equivalent
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Lecture Notes in Computer Science 5664, 2009, pp. 519-529
Resolving loads with positive interior stresses
Günter Rote, André Schulz
Lecture Notes in Computer Science 5664, 2009, pp. 530-541
On making directed graphs transitive
Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
Lecture Notes in Computer Science 5664, 2009, pp. 542-553
Bit-parallel tree pattern matching algorithms for unordered labeled trees
Hiroaki Yamamoto, Daichi Takenouchi
Lecture Notes in Computer Science 5664, 2009, pp. 554-565
Compact and low delay routing labeling scheme for unit disk graphs
Chenyu Yan, Yang Xiang, Feodor F. Dragan
Lecture Notes in Computer Science 5664, 2009, pp. 566-577

Seiten < 1 2