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

• How profitable are strategic behaviors in a market?
  Ning Chen, Xiaotie Deng, Jie Zhang
  Lecture Notes in Computer Science 6942, 2011, pp. 106-118
• Improving the price of anarchy for Selfish Routing via coordination mechanisms
  George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga
  Lecture Notes in Computer Science 6942, 2011, pp. 119-130
• An \mathcal O(n^4) time algorithm to compute the bisection width of solid grid graphs
  Andreas Emil Feldmann, Peter Widmayer
  Lecture Notes in Computer Science 6942, 2011, pp. 143-154
• Quantified linear programs: A computational study
  Thorsten Ederer, Ulf Lorenz, Alexander Martin, Jan Wolf
  Lecture Notes in Computer Science 6942, 2011, pp. 203-214
• Recoverable robustness by column generation
  P.C. Bouman, J.M. van den Akker, J.A. Hoogeveen
  Lecture Notes in Computer Science 6942, 2011, pp. 215-226
• Passenger flow-oriented train disposition
  Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee
  Lecture Notes in Computer Science 6942, 2011, pp. 227-238
• Better bounds for incremental frequency allocation in bipartite graphs
  Marek Chrobak, Łukasz Jeż, Jiȓí Sgall
  Lecture Notes in Computer Science 6942, 2011, pp. 251-262
• Two-bounded-space bin packing revisited
  Marek Chrobak, Jiȓí Sgall, Gerhard J. Woeginger
  Lecture Notes in Computer Science 6942, 2011, pp. 263-274
• Output-sensitive listing of bounded-size trees in undirected graphs
  Rui Ferreira, Roberto Grossi, Romeo Rizzi
  Lecture Notes in Computer Science 6942, 2011, pp. 275-286
• Exact algorithm for the maximum induced planar subgraph problem
  Fedor V. Fomin, Ioan Todinca, Yngve Villanger
  Lecture Notes in Computer Science 6942, 2011, pp. 287-298
• Scheduling partially ordered jobs faster than 2^n
  Marek Cygan, Marcin Pilipczuk, Michaƚ Pilipczuk, Jakub Onufry Wojtaszczyk
  Lecture Notes in Computer Science 6942, 2011, pp. 299-310
• AdCell: Ad allocation in cellular networks
  Saeed Alaei, Mohammad T. Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha
  Lecture Notes in Computer Science 6942, 2011, pp. 311-322
• Submodular Max-SAT
  Yossi Azar, Iftah Gamzu, Ran Roth
  Lecture Notes in Computer Science 6942, 2011, pp. 323-334
• Hitting sets online and vertex ranking
  Guy Even, Shakhar Smorodinsky
  Lecture Notes in Computer Science 6942, 2011, pp. 347-357
• Deterministic discrepancy minimization
  Nikhil Bansal, Joel Spencer
  Lecture Notes in Computer Science 6942, 2011, pp. 408-420
• A nearly optimal algorithm for finding L_1 shortest paths among polygonal obstacles in the plane
  Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 6942, 2011, pp. 481-492
• Resource allocation for covering time varying demands
  Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal
  Lecture Notes in Computer Science 6942, 2011, pp. 543-554
• Mixed-criticality scheduling of sporadic task systems
  Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie
  Lecture Notes in Computer Science 6942, 2011, pp. 555-566
• Robust algorithms for preemptive scheduling
  Leah Epstein, Asaf Levin
  Lecture Notes in Computer Science 6942, 2011, pp. 567-578
• Approximate distance queries for weighted polyhedral surfaces
  Hristo N. Djidjev, Christian Sommer
  Lecture Notes in Computer Science 6942, 2011, pp. 579-590
• Cuckoo hashing with pages
  Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink
  Lecture Notes in Computer Science 6942, 2011, pp. 615-627
• A \frac{3}{2} approximation for a constrained forest problem
  Basile Couëtoux
  Lecture Notes in Computer Science 6942, 2011, pp. 652-663
• Algorithms for solving Rubik's Cubes
  Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow
  Lecture Notes in Computer Science 6942, 2011, pp. 689-700
• Boundary patrolling by mobile agents with distinct maximal speeds
  Jurek Czyzowicz, Leszek Ga̧sieniec, Adrian Kosowski, Evangelos Kranakis
  Lecture Notes in Computer Science 6942, 2011, pp. 701-712
• Optimal discovery strategies in white space networks
  Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda
  Lecture Notes in Computer Science 6942, 2011, pp. 713-722