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

• Faster computation of the Robinson-Foulds distance between phylogenetic networks
  Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
  Lecture Notes in Computer Science 6129, 2010, pp. 190-201
• Cover array string reconstruction
  Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler
  Lecture Notes in Computer Science 6129, 2010, pp. 251-259
• Building the minimal automaton of A^*X in linear time, when X is of bounded cardinality
  Omar AitMous, Frédérique Bassino, Cyril Nicaud
  Lecture Notes in Computer Science 6129, 2010, pp. 275-287
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
  Domenico Cantone, Simone Faro, Emanuele Giaquinta
  Lecture Notes in Computer Science 6129, 2010, pp. 288-298
• Algorithms for three versions of the shortest common superstring problem
  Maxime Crochemore, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
  Lecture Notes in Computer Science 6129, 2010, pp. 299-309
• The NEO protocol for large-scale distributed database systems: Modelling and initial verification
  Christine Choppy, Anna Dedova, Sami Evangelista, Silien Hong, Kais Klai, Laure Petrucci
  Lecture Notes in Computer Science 6128, 2010, pp. 145-164
• Factorization properties of symbolic unfoldings of colored Petri nets
  Thomas Chatain, Eric Fabre
  Lecture Notes in Computer Science 6128, 2010, pp. 165-184
• Separability in persistent Petri nets
  Eike Best, Philippe Darondeau
  Lecture Notes in Computer Science 6128, 2010, pp. 246-266
• AlPiNA: A symbolic model checker
  Didier Buchs, Steve Hostettler, Alexis Marechal, Matteo Risoldi
  Lecture Notes in Computer Science 6128, 2010, pp. 287-296
• GreatSPN enhanced with decision diagram data structures
  Junaid Babar, Marco Beccuti, Susanna Donatelli, Andrew Miner
  Lecture Notes in Computer Science 6128, 2010, pp. 308-317
• Solving LP relaxations of large-scale precedence constrained problems
  Daniel Bienstock, Mark Zuckerberg
  Lecture Notes in Computer Science 6080, 2010, pp. 1-14
• Eigenvalue techniques for convex objective, nonconvex optimization problems
  Daniel Bienstock
  Lecture Notes in Computer Science 6080, 2010, pp. 29-42
• Restricted b-matchings in degree-bounded graphs
  Kristóf Bérczi, László A. Végh
  Lecture Notes in Computer Science 6080, 2010, pp. 43-56
• Zero-coefficient cuts
  Kent Andersen, Robert Weismantel
  Lecture Notes in Computer Science 6080, 2010, pp. 57-70
• On lifting integer variables in minimal inequalities
  Amitabh Basu, Manoel Campelo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
  Lecture Notes in Computer Science 6080, 2010, pp. 85-95
• On generalizations of network design problems with degree bounds
  Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
  Lecture Notes in Computer Science 6080, 2010, pp. 110-123
• A 3-approximation for facility location with uniform capacities
  Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain
  Lecture Notes in Computer Science 6080, 2010, pp. 149-162
• Secretary problems via linear programming
  Niv Buchbinder, Kamal Jain, Mohit Singh
  Lecture Notes in Computer Science 6080, 2010, pp. 163-176
• Approximability of 3- and 4-hop bounded disjoint paths problems
  Andreas Bley, Jose Neto
  Lecture Notes in Computer Science 6080, 2010, pp. 205-218
• Fault-tolerant facility location: A randomized dependent LP-rounding algorithm
  Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy
  Lecture Notes in Computer Science 6080, 2010, pp. 244-257
• An effective branch-and-bound algorithm for convex quadratic integer programming
  Christoph Buchheim, Alberto Caprara, Andrea Lodi
  Lecture Notes in Computer Science 6080, 2010, pp. 285-298
• Extending SDP integrality gaps to Sherali-Adams with applications to Quadratic Programming and MaxCutGain
  Siavosh Benabbas, Avner Magen
  Lecture Notes in Computer Science 6080, 2010, pp. 299-312
• The price of collusion in series-parallel networks
  Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang
  Lecture Notes in Computer Science 6080, 2010, pp. 313-326
• A pumping algorithm for ergodic stochastic mean payoff games with perfect information
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino
  Lecture Notes in Computer Science 6080, 2010, pp. 341-354
• On column-restricted and priority covering integer programs
  Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann
  Lecture Notes in Computer Science 6080, 2010, pp. 355-368