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 [2]	Hilfe

Suche: Series=LNCS AND YEAR=2013

• Finding short paths on polytopes by the shadow vertex algorithm
  Tobias Brunsch, Heiko Röglin
  Lecture Notes in Computer Science 7965, 2013, pp. 279-290
• On randomized online labeling with polynomially many labels
  Jan Bulánek, Michal Koucký, Michael Saks
  Lecture Notes in Computer Science 7965, 2013, pp. 291-302
• Dual lower bounds for approximate degree and Markov-Bernstein inequalities
  Mark Bun, Justin Thaler
  Lecture Notes in Computer Science 7965, 2013, pp. 303-314
• New doubling spanners: Better and simpler
  T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon
  Lecture Notes in Computer Science 7965, 2013, pp. 315-327
• Maximum edge-disjoint paths in k-sums of graphs
  Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd
  Lecture Notes in Computer Science 7965, 2013, pp. 328-339
• On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
  Joseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla
  Lecture Notes in Computer Science 7965, 2013, pp. 340-351
• Counting matchings of size k is \#W[1]-hard
  Radu Curticapean
  Lecture Notes in Computer Science 7965, 2013, pp. 352-363
• Faster exponential-time algorithms in graphs of bounded average degree
  Marek Cygan, Marcin Pilipczuk
  Lecture Notes in Computer Science 7965, 2013, pp. 364-375
• A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry
  Anindya De, Ilias Diakonikolas, Rocco Servedio
  Lecture Notes in Computer Science 7965, 2013, pp. 376-387
• Combining binary search trees
  Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
  Lecture Notes in Computer Science 7965, 2013, pp. 388-399
• The two-handed tile assembly model is not intrinsically universal
  Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damian Woods
  Lecture Notes in Computer Science 7965, 2013, pp. 400-412
• Clustering in the Boolean hypercube in a list decoding regime
  Irit Dinur, Elazar Goldenberg
  Lecture Notes in Computer Science 7965, 2013, pp. 413-424
• Recent results for online makespan minimization
  Susanne Albers
  Lecture Notes in Computer Science 7936, 2013, pp. 1-3
• New bounds for the balloon popping problem
  Davide Bilò, Vittorio Bilò
  Lecture Notes in Computer Science 7936, 2013, pp. 5-16
• On the sequential price of anarchy of isolation games
  Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli
  Lecture Notes in Computer Science 7936, 2013, pp. 17-28
• On the advice complexity of the online L(2,1)-coloring problem on paths and cycles
  Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic̑, Sacha Krug, Björn Steffen
  Lecture Notes in Computer Science 7936, 2013, pp. 53-64
• A fast algorithm for data collection along a fixed track
  Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson
  Lecture Notes in Computer Science 7936, 2013, pp. 77-88
• How to schedule the marketing of products with negative externalities
  Zhigang Cao, Xujin Chen, Changjun Wang
  Lecture Notes in Computer Science 7936, 2013, pp. 122-133
• From preemptive to non-preemptive speed-scaling scheduling
  Evripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis
  Lecture Notes in Computer Science 7936, 2013, pp. 134-146
• On linear-size pseudorandom generators and hardcore functions
  Joshua Baron, Yuval Ishai, Rafail Ostrovsky
  Lecture Notes in Computer Science 7936, 2013, pp. 169-181
• The discrete Voronoi game in a simple polygon
  Aritra Banik, Sandip Das, Anil Maheshwari, Michiel Smid
  Lecture Notes in Computer Science 7936, 2013, pp. 197-207
• On the conjunctive capacity of graphs
  Miroslav Chlebík, Janka Chlebíková
  Lecture Notes in Computer Science 7936, 2013, pp. 280-291
• Improved local search for universal facility location
  Eric Angel, Nguyen Kim Thang, Damien Regnault
  Lecture Notes in Computer Science 7936, 2013, pp. 316-324
• The k-separator problem
  Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto
  Lecture Notes in Computer Science 7936, 2013, pp. 337-348
• Covering tree with stars
  Jan Baumbach, Jiong Guo, Rashid Ibragimov
  Lecture Notes in Computer Science 7936, 2013, pp. 373-384