default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th ESA 2011: Saarbrücken, Germany
- Camil Demetrescu, Magnús M. Halldórsson:
Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Lecture Notes in Computer Science 6942, Springer 2011, ISBN 978-3-642-23718-8
Approximation Algorithms I
- Akiyoshi Shioura:
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints. 1-12 - Loukas Georgiadis
:
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph. 13-24 - Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen:
Improved Approximation Algorithms for Bipartite Correlation Clustering. 25-36 - Matthias Poloczek:
Bounds on Greedy Algorithms for MAX SAT. 37-48
Computational Geometry I
- Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. 49-60 - Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan:
On Isolating Points Using Disks. 61-69 - Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee:
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. 70-81 - Victor Alvarez, David G. Kirkpatrick, Raimund Seidel:
Can Nearest Neighbor Searching Be Simple and Always Fast? 82-92
Game Theory
- Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen, Carmine Ventre:
On the Approximation Performance of Fictitious Play in Finite Games. 93-105 - Ning Chen, Xiaotie Deng, Jie Zhang:
How Profitable Are Strategic Behaviors in a Market? 106-118 - George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga:
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms. 119-130
Graph Algorithms I
- Yusuke Kobayashi, Yuichi Yoshida:
Algorithms for Finding a Maximum Non-k-linked Graph. 131-142 - Andreas Emil Feldmann, Peter Widmayer:
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. 143-154 - Jakub Lacki, Piotr Sankowski:
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. 155-166
Stable Matchings and Auctions
- Chien-Chung Huang, Telikepalli Kavitha:
Near-Popular Matchings in the Roommates Problem. 167-179 - Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
The Hospitals/Residents Problem with Quota Lower Bounds. 180-191 - Monika Henzinger, Angelina Vidali:
Multi-parameter Mechanism Design under Budget and Matroid Constraints. 192-202
Optimization
- Thorsten Ederer, Ulf Lorenz, Alexander Martin, Jan Wolf:
Quantified Linear Programs: A Computational Study. 203-214 - Paul C. Bouman, J. M. van den Akker, J. A. Hoogeveen:
Recoverable Robustness by Column Generation. 215-226 - Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee:
Passenger Flow-Oriented Train Disposition. 227-238
Online Algorithms I
- Lukasz Jez:
One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay. 239-250 - Marek Chrobak, Lukasz Jez, Jirí Sgall:
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs. 251-262 - Marek Chrobak, Jirí Sgall, Gerhard J. Woeginger:
Two-Bounded-Space Bin Packing Revisited. 263-274
Exponential-Time Algorithms
- Rui A. Ferreira, Roberto Grossi, Romeo Rizzi:
Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. 275-286 - Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Exact Algorithm for the Maximum Induced Planar Subgraph Problem. 287-298 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Scheduling Partially Ordered Jobs Faster Than 2 n. 299-310
Online Algorithms I
- Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha:
AdCell: Ad Allocation in Cellular Networks. 311-322 - Yossi Azar, Iftah Gamzu, Ran Roth:
Submodular Max-SAT. 323-334 - Shayan Oveis Gharan, Jan Vondrák:
On Variants of the Matroid Secretary Problem. 335-346 - Guy Even, Shakhar Smorodinsky:
Hitting Sets Online and Vertex Ranking. 347-357
Parameterized Algorithms
- Dimitrios M. Thilikos:
Fast Sub-exponential Algorithms and Compactness in Planar Graphs. 358-369 - Pascal Schweitzer:
Isomorphism of (mis)Labeled Graphs. 370-381 - Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Paths, Flowers and Vertex Cover. 382-393 - Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. 394-407
Best Paper Session
- Nikhil Bansal, Joel Spencer:
Deterministic Discrepancy Minimization. 408-420 - Pawel Gawrychowski:
Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic. 421-432
Graph Algorithms I
- Asaf Frieder, Liam Roditty:
An Experimental Study on Approximating K Shortest Simple Paths. 433-444 - Petr Hlinený, Ondrej Moris:
Scope-Based Route Planning. 445-456 - Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Maximum Flows by Incremental Breadth-First Search. 457-468 - Peter Sanders, Christian Schulz:
Engineering Multilevel Graph Partitioning Algorithms. 469-480
Computational Geometry II
- Danny Z. Chen, Haitao Wang:
A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane. 481-492 - Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. 493-505 - Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir:
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane. 506-517 - Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh:
Improved Algorithms for Partial Curve Matching. 518-529
Scheduling
- José Verschae, Andreas Wiese:
On the Configuration-LP for Scheduling on Unrelated Machines. 530-542 - Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal:
Resource Allocation for Covering Time Varying Demands. 543-554 - Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie:
Mixed-Criticality Scheduling of Sporadic Task Systems. 555-566 - Leah Epstein, Asaf Levin:
Robust Algorithms for Preemptive Scheduling. 567-578
Data Structures
- Hristo N. Djidjev, Christian Sommer:
Approximate Distance Queries for Weighted Polyhedral Surfaces. 579-590 - Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri:
The Union of Probabilistic Boxes: Maintaining the Volume. 591-602 - Ely Porat, Liam Roditty:
Preprocess, Set, Query! 603-614 - Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink:
Cuckoo Hashing with Pages. 615-627
Approximation Algorithms I
- Andreas S. Schulz, Claudio Telha:
Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. 628-639 - Kaspar Schüpbach, Rico Zenklusen:
Approximation Algorithms for Conflict-Free Vehicle Routing. 640-651 - Basile Couëtoux:
A $\frac{3}{2}$ Approximation for a Constrained Forest Problem. 652-663
Graphs and Games
- Michael T. Goodrich, Pawel Pszona:
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. 664-676 - Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun:
Approximate Counting of Cycles in Streams. 677-688 - Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow:
Algorithms for Solving Rubik's Cubes. 689-700
Distributed Computing and Networking
- Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis:
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds. 701-712 - Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda:
Optimal Discovery Strategies in White Space Networks. 713-722 - Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa:
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. 723-735
Strings and Sorting
- Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff:
Tolerant Algorithms. 736-747 - Djamal Belazzougui, Gonzalo Navarro:
Alphabet-Independent Compressed Text Indexing. 748-759 - Paolo Ferragina, Jouni Sirén, Rossano Venturini:
Distribution-Aware Compressed Full-Text Indexes. 760-771
Local Search and Set Systems
- Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed Performance Guarantees for Local Search. 772-783 - Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward:
Improved Approximations for k-Exchange Systems - (Extended Abstract). 784-798 - Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. 799-810
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-12 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
