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 Volume=5757

• Dynamic programming on tree decompositions using generalised fast subset convolution
  Johan M.M. van Rooij, Hans L. Bodlaender, Peter Rossmanith
  Lecture Notes in Computer Science 5757, 2009, pp. 566-577
• Counting paths and packings in halves
  Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
  Lecture Notes in Computer Science 5757, 2009, pp. 578-586
• Accelerating multi-modal route planning by access-nodes
  Daniel Delling, Thomas Pajor, Dorothea Wagner
  Lecture Notes in Computer Science 5757, 2009, pp. 587-598
• Parallel algorithms for mean-payoff games: An experimental evaluation
  Jakub Chaloupka
  Lecture Notes in Computer Science 5757, 2009, pp. 599-610
• Experimental study of FPT algorithms for the directed feedback vertex set problem
  Rudolf Fleischer, Xi Wu, Liwei Yuan
  Lecture Notes in Computer Science 5757, 2009, pp. 611-622
• Fast evaluation of interlace polynomials on graphs of bounded treewidth
  Markus Bläser, Christian Hoffmann
  Lecture Notes in Computer Science 5757, 2009, pp. 623-634
• Kernel bounds for disjoint cycles and disjoint paths
  Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo
  Lecture Notes in Computer Science 5757, 2009, pp. 635-646
• Constant ratio fixed-parameter approximation of the edge multicut problem
  Dániel Marx, Igor Razgon
  Lecture Notes in Computer Science 5757, 2009, pp. 647-658
• Rank-pairing heaps
  Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
  Lecture Notes in Computer Science 5757, 2009, pp. 659-670
• 3.5-way cuckoo hashing for the price of 2-and-a-bit
  Eric Lehman, Rina Panigrahy
  Lecture Notes in Computer Science 5757, 2009, pp. 671-681
• Hash, displace, and compress
  Djamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger
  Lecture Notes in Computer Science 5757, 2009, pp. 682-693
• Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels
  Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
  Lecture Notes in Computer Science 5757, 2009, pp. 694-705
• Contraction bidimensionality: The accurate picture
  Fedor V. Fomin, Petr Golovach, Dimitrios Thilikos
  Lecture Notes in Computer Science 5757, 2009, pp. 706-717
• Minimizing movement: Fixed-parameter tractability
  Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx
  Lecture Notes in Computer Science 5757, 2009, pp. 718-729
• Storing a compressed function with constant time access
  Jóhannes B.and Morten Kryer Hreinsson, Rasmus Pagh
  Lecture Notes in Computer Science 5757, 2009, pp. 730-741
• Experimental variations of a theoretically good retrieval data structure
  Martin Aumüller, Martin Dietzfelbinger, Michael Rink
  Lecture Notes in Computer Science 5757, 2009, pp. 742-751
• Short labels for lowest common ancestors in trees
  Johannes Fischer
  Lecture Notes in Computer Science 5757, 2009, pp. 752-763
• Disproof of the neighborhood conjecture with implications to SAT
  Heidi Gebauer
  Lecture Notes in Computer Science 5757, 2009, pp. 764-775
• Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard
  Christoph Dürr, Flavio Guiñez, Martín Matamala
  Lecture Notes in Computer Science 5757, 2009, pp. 776-787