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 Volume=6942

• 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
• On variants of the matroid secretary problem
  Shayan Oveis Gharan, Jan Vondrák
  Lecture Notes in Computer Science 6942, 2011, pp. 335-346
• Hitting sets online and vertex ranking
  Guy Even, Shakhar Smorodinsky
  Lecture Notes in Computer Science 6942, 2011, pp. 347-357
• Fast sub-exponential algorithms and compactness in planar graphs
  Dimitrios M. Thilikos
  Lecture Notes in Computer Science 6942, 2011, pp. 358-369
• Isomorphism of (mis)labeled graphs
  Pascal Schweitzer
  Lecture Notes in Computer Science 6942, 2011, pp. 370-381
• Paths, flowers and vertex cover
  Venkatesh Raman, M.S. Ramanujan, Saket Saurabh
  Lecture Notes in Computer Science 6942, 2011, pp. 382-393
• Hitting and harvesting pumpkins
  Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
  Lecture Notes in Computer Science 6942, 2011, pp. 394-407
• Deterministic discrepancy minimization
  Nikhil Bansal, Joel Spencer
  Lecture Notes in Computer Science 6942, 2011, pp. 408-420
• Pattern matching in Lempel-Ziv compressed strings: Fast, simple, and deterministic
  Paweƚ Gawrychowski
  Lecture Notes in Computer Science 6942, 2011, pp. 421-432
• An experimental study on approximating k shortest simple paths
  Asaf Frieder, Liam Roditty
  Lecture Notes in Computer Science 6942, 2011, pp. 433-444
• Scope-based route planning
  Petr Hlinȇný, Ondrej Moris̑
  Lecture Notes in Computer Science 6942, 2011, pp. 445-456
• Maximum flows by incremental breadth-first search
  Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan, Renato F. Werneck
  Lecture Notes in Computer Science 6942, 2011, pp. 457-468
• Engineering multilevel graph partitioning algorithms
  Peter Sanders, Christian Schulz
  Lecture Notes in Computer Science 6942, 2011, pp. 469-480
• 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
• Motion planning via manifold samples
  Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin
  Lecture Notes in Computer Science 6942, 2011, pp. 493-505
• Ray-shooting depth: Computing statistical data depth of point sets in the plane
  Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
  Lecture Notes in Computer Science 6942, 2011, pp. 506-517
• Improved algorithms for partial curve matching
  Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
  Lecture Notes in Computer Science 6942, 2011, pp. 518-529
• On the configuration-LP for scheduling on unrelated machines
  José Verschae, Andreas Wiese
  Lecture Notes in Computer Science 6942, 2011, pp. 530-542
• 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
• The union of probabilistic boxes: Maintaining the volume
  Hakan Yıldız, Luca Foschini, John Hershberger, Subhash Suri
  Lecture Notes in Computer Science 6942, 2011, pp. 591-602