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

• Erratum to ``A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items''
  Marco Bender, Clemens Thielen, Stephan Westphal
  Lecture Notes in Computer Science 8087, 2013, pp. E1-E3
• Alternation trading proofs and their limitations
  Sam Buss
  Lecture Notes in Computer Science 8087, 2013, pp. 1-7
• Bin packing games with selfish items
  Leah Epstein
  Lecture Notes in Computer Science 8087, 2013, pp. 8-21
• A constructive proof of the topological Kruskal theorem
  Jean Goubault-Larrecq
  Lecture Notes in Computer Science 8087, 2013, pp. 22-41
• Logical and structural approaches to the graph isomorphism problem
  Martin Grohe
  Lecture Notes in Computer Science 8087, 2013, pp. 42-42
• Prior-free auctions of digital goods
  Elias Koutsoupias
  Lecture Notes in Computer Science 8087, 2013, pp. 43-44
• Synthesis from temporal specifications: New applications in robotics and model-driven development
  Nir Piterman
  Lecture Notes in Computer Science 8087, 2013, pp. 45-49
• Clustering on k-edge-colored graphs
  Eric Angel, Evripidis Bampis, Alexander Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos
  Lecture Notes in Computer Science 8087, 2013, pp. 50-61
• How to pack your items when you have to buy your knapsack
  Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott, José Verschae
  Lecture Notes in Computer Science 8087, 2013, pp. 62-73
• Computing behavioral distances, compositionally
  Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare
  Lecture Notes in Computer Science 8087, 2013, pp. 74-85
• Which finitely ambiguous automata recognize finitely sequential functions?
  Sebastian Bala
  Lecture Notes in Computer Science 8087, 2013, pp. 86-97
• Rewriting guarded negation queries
  Vince Bárány, Michael Benedikt, Balder ten Cate
  Lecture Notes in Computer Science 8087, 2013, pp. 98-110
• Parity games and propositional proofs
  Arnold Beckmann, Pavel Pudlák, Neil Thapen
  Lecture Notes in Computer Science 8087, 2013, pp. 111-122
• Logic and branching automata
  Nicolas Bedon
  Lecture Notes in Computer Science 8087, 2013, pp. 123-134
• A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items
  Marco Bender, Clemens Thielen, Stephan Westphal
  Lecture Notes in Computer Science 8087, 2013, pp. 135-145
• Determinacy and rewriting of top-down and MSO tree transformations
  Michael Benedikt, Joost Engelfriet, Sebastian Maneth
  Lecture Notes in Computer Science 8087, 2013, pp. 146-158
• On the speed of constraint propagation and the time complexity of arc consistency testing
  Christoph Berkholz, Oleg Verbitsky
  Lecture Notes in Computer Science 8087, 2013, pp. 159-170
• Validity of tree pattern queries with respect to schema information
  Henrik Björklund, Wim Martens, Thomas Schwentick
  Lecture Notes in Computer Science 8087, 2013, pp. 171-182
• Auctions for partial heterogeneous preferences
  Piero A. Bonatti, Marco Faella, Clemente Galdi, Luigi Sauro
  Lecture Notes in Computer Science 8087, 2013, pp. 183-194
• New polynomial cases of the weighted efficient domination problem
  Andreas Brandstädt, Martin Milanic̑, Ragnar Nevries
  Lecture Notes in Computer Science 8087, 2013, pp. 195-206
• Bringing order to special cases of Klee's measure problem
  Karl Bringmann
  Lecture Notes in Computer Science 8087, 2013, pp. 207-218
• Random shortest paths: Non-Euclidean instances for metric optimization problems
  Karl Bringmann, Christian Engels, Bodo Manthey, B.V. Raghavendra Rao
  Lecture Notes in Computer Science 8087, 2013, pp. 219-230
• Semilinearity and context-freeness of languages accepted by valence automata
  P. Buckheister, Georg Zetzsche
  Lecture Notes in Computer Science 8087, 2013, pp. 231-242
• Learning reductions to sparse sets
  Harry Buhrman, Lance Fortnow, John M. Hitchcock, Bruno Loff
  Lecture Notes in Computer Science 8087, 2013, pp. 243-253
• Probabilistic automata with isolated cut-points
  Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
  Lecture Notes in Computer Science 8087, 2013, pp. 254-265