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

• Recent results for online makespan minimization
  Susanne Albers
  Lecture Notes in Computer Science 7936, 2013, pp. 1-3
• Optimal stopping meets combinatorial optimization
  Robert Kleinberg
  Lecture Notes in Computer Science 7936, 2013, pp. 4-4
• 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
• Social exchange networks with distant bargaining
  Konstantinos Georgiou, George Karakostas, Jochen Könemann, Zuzanna Stamirowska
  Lecture Notes in Computer Science 7936, 2013, pp. 29-40
• The 1/4-core of the uniform bin packing game is nonempty
  Walter Kern, Xian Qiu
  Lecture Notes in Computer Science 7936, 2013, pp. 41-52
• 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
• On randomized fictitious play for approximating saddle points over convex sets
  Khaled Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani
  Lecture Notes in Computer Science 7936, 2013, pp. 65-76
• 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
• Random methods for parameterized problems
  Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen
  Lecture Notes in Computer Science 7936, 2013, pp. 89-100
• DVS scheduling in a line or a star network of processors
  Zongxu Mu, Minming Li
  Lecture Notes in Computer Science 7936, 2013, pp. 101-113
• Online algorithms for batch machines scheduling with delivery times
  Peihai Liu, Xiwen Lu
  Lecture Notes in Computer Science 7936, 2013, pp. 114-121
• 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
• Selection from read-only memory with limited workspace
  Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
  Lecture Notes in Computer Science 7936, 2013, pp. 147-157
• Deternimization of Büchi automata as partitioned automata
  Cong Tian, Zhenhua Duan, Mengfei Yang
  Lecture Notes in Computer Science 7936, 2013, pp. 158-168
• On linear-size pseudorandom generators and hardcore functions
  Joshua Baron, Yuval Ishai, Rafail Ostrovsky
  Lecture Notes in Computer Science 7936, 2013, pp. 169-181
• A fast algorithm finding the shortest reset words
  Andrzej Kisielewicz, Jakub Kowalski, Marek Szykuƚa
  Lecture Notes in Computer Science 7936, 2013, pp. 182-196
• 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
• Facets for art gallery problems
  Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt
  Lecture Notes in Computer Science 7936, 2013, pp. 208-220
• Hitting and piercing rectangles induced by a point set
  Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra
  Lecture Notes in Computer Science 7936, 2013, pp. 221-232
• Realistic roofs over a rectilinear polygon revisited
  Jessica Sherette, Sang Duk Yoon
  Lecture Notes in Computer Science 7936, 2013, pp. 233-244
• Parametric power supply networks
  Shiho Morishita, Takao Nishizeki
  Lecture Notes in Computer Science 7936, 2013, pp. 245-256
• Approximating the minimum independent dominating set in perturbed graphs
  Weitian Tong, Randy Goebel, Guohui Lin
  Lecture Notes in Computer Science 7936, 2013, pp. 257-267
• A linear-time algorithm for the minimum degree hypergraph problem with the consecutive ones property
  Chih-Hsuan Li, Jhih-Hong Ye, Biing-Feng Wang
  Lecture Notes in Computer Science 7936, 2013, pp. 268-279