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

• Selfish resource allocation in optical networks
  Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis
  Lecture Notes in Computer Science 7878, 2013, pp. 25-36
• Average optimal string matching in packed strings
  Djamal Belazzougui, Mathieu Raffinot
  Lecture Notes in Computer Science 7878, 2013, pp. 37-48
• Four measures of nonlinearity
  Joan Boyar, Magnus Find, René Peralta
  Lecture Notes in Computer Science 7878, 2013, pp. 61-72
• On the characterization of plane bus graphs
  Till Bruckdorfer, Stefan Felsner, Michael Kaufmann
  Lecture Notes in Computer Science 7878, 2013, pp. 73-84
• Online multi-dimensional dynamic bin packing of unit-fraction items
  Mihai Burcea, Prudence W.H. Wong, Fencol C.C. Yung
  Lecture Notes in Computer Science 7878, 2013, pp. 85-96
• A greedy approximation algorithm for minimum-gap scheduling
  Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor
  Lecture Notes in Computer Science 7878, 2013, pp. 97-109
• Exponential complexity of satisfiability testing for linear-size Boolean formulas
  Evgeny Dantsin, Alexander Wolpert
  Lecture Notes in Computer Science 7878, 2013, pp. 110-121
• Linear time distributed swap edge algorithms
  Ajoy K. Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
  Lecture Notes in Computer Science 7878, 2013, pp. 122-133
• New results on stabbing segments with a polygon
  José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira
  Lecture Notes in Computer Science 7878, 2013, pp. 146-157
• Improving the H_k-bound on the price of stability in undirected shapley network design games
  Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús̑ Mihalák
  Lecture Notes in Computer Science 7878, 2013, pp. 158-169
• On the structure of reduced kernel lattice bases
  Karen Aardal, Frederik von Heymann
  Lecture Notes in Computer Science 7801, 2013, pp. 1-12
• All-or-nothing generalized assignment with application to scheduling advertising campaigns
  Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
  Lecture Notes in Computer Science 7801, 2013, pp. 13-24
• Constant integrality gap LP formulations of unsplittable flow on a path
  Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
  Lecture Notes in Computer Science 7801, 2013, pp. 25-36
• Intersection cuts for mixed integer conic quadratic sets
  Kent Andersen, Anders Nedergaard Jensen
  Lecture Notes in Computer Science 7801, 2013, pp. 37-48
• Content placement via the exponential potential function method
  David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K.K. Ramakrishnan
  Lecture Notes in Computer Science 7801, 2013, pp. 49-61
• Equivariant perturbation in Gomory and Johnson's infinite group problem: II. The unimodular two-dimensional case
  Amitabh Basu, Robert Hildebrand, Matthias Köppe
  Lecture Notes in Computer Science 7801, 2013, pp. 62-73
• Blocking optimal arborescences
  Attila Bernáth, Gyula Pap
  Lecture Notes in Computer Science 7801, 2013, pp. 74-85
• Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property
  Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer
  Lecture Notes in Computer Science 7801, 2013, pp. 86-97
• A complexity and approximability study of the bilevel knapsack problem
  Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger
  Lecture Notes in Computer Science 7801, 2013, pp. 98-109
• Matroid and knapsack center problems
  Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang
  Lecture Notes in Computer Science 7801, 2013, pp. 110-122
• Cut-generating functions
  Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick
  Lecture Notes in Computer Science 7801, 2013, pp. 123-132
• Reverse Chvátal-Gomory rank
  Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
  Lecture Notes in Computer Science 7801, 2013, pp. 133-144
• On some generalizations of the split closure
  Sanjeeb Dash, Oktay Günlük, Diego Alejandro Móran Ramirez
  Lecture Notes in Computer Science 7801, 2013, pp. 145-156
• Packing interdiction and partial covering problems
  Michael Dinitz, Anupam Gupta
  Lecture Notes in Computer Science 7801, 2013, pp. 157-168
• Flips
  Prosenjit Bose
  Lecture Notes in Computer Science 7704, 2013, pp. 1-1