default search action
20. ESA 2012: Ljubljana, Slovenia
- Leah Epstein, Paolo Ferragina:
Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Lecture Notes in Computer Science 7501, Springer 2012, ISBN 978-3-642-33089-6 - Yossi Matias:
On Big Data Algorithmics. 1 - Jirí Sgall
:
Open Problems in Throughput Scheduling. 2-11 - Fidaa Abed
Preemptive Coordination Mechanisms for Unrelated Machines. 12-23 - Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Hierarchical Hub Labelings for Shortest Paths. 24-35 - A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck Non-crossing Matching in the Plane. 36-47 - Peyman Afshani, Norbert Zeh:
Lower Bounds for Sorted Geometric Queries in the I/O Model. 48-59 - Mahmuda Ahmed, Carola Wenk:
Constructing Street Networks from GPS Trajectories. 60-71 - Deepak Ajwani
I/O-efficient Hierarchical Diameter Approximation. 72-83 - Susanne Albers, Matthias Hellwig:
On the Value of Job Migration in Online Makespan Minimization. 84-95 - Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen:
Simplifying Massive Contour Maps. 96-107 - Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. 108-120 - Martin Babka, Jan Bulánek, Vladimír Cunát, Michal Koucký
On Online Labeling with Polynomially Many Labels. 121-132 - Manisha Bansal
A 5-Approximation for Capacitated Facility Location. 133-144 - Nikhil Bansal, Kirk Pruhs:
Weighted Geometric Set Multi-cover via Quasi-uniform Sampling. 145-156 - Siddharth Barman, Shuchi Chawla, Seeun Umboh
A Bicriteria Approximation for the Reordering Buffer Problem. 157-168 - Gernot Veit Batz, Peter Sanders:
Time-Dependent Route Planning with Generalized Objective Functions. 169-180 - Djamal Belazzougui, Gonzalo Navarro:
New Lower and Upper Bounds for Representing Sequences. 181-192 - Aleksandrs Belovs, Ben W. Reichardt:
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection. 193-204 - Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations. 205-216 - Gerth Stølting Brodal
Two Dimensional Range Minimum Queries and Fibonacci Lattices. 217-228 - Kevin Buchin
Locally Correct Fréchet Matchings. 229-240 - Sergio Cabello
The Clique Problem in Ray Intersection Graphs. 241-252 - Ioannis Caragiannis
Revenue Guarantees in Sponsored Search Auctions. 253-264 - T.-H. Hubert Chan, Fei Chen, Li Ning:
Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite. 265-276 - T.-H. Hubert Chan, Elaine Shi, Dawn Song:
Optimal Lower Bound for Differentially Private Multi-party Aggregation. 277-288 - Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. 289-300 - Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. 301-312 - Bernard Chazelle, Wolfgang Mulzer
Data Structures on Event Graphs. 313-324 - Shiri Chechik:
Improved Distance Oracles and Spanners for Vertex-Labeled Graphs. 325-336 - Andrew M. Childs
The Quantum Query Complexity of Read-Many Formulas. 337-348 - Marek Cygan
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. 349-360 - Marek Cygan
Steiner Forest Orientation Problems. 361-372 - James M. Davis, David P. Williamson:
A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems. 373-382 - Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes. 383-394 - Bart de Keijzer, Guido Schäfer:
Finding Social Optima in Congestion Games with Positive Externalities. 395-406 - Daniel Delling, Renato Fonseca F. Werneck:
Better Bounds for Graph Bisection. 407-418 - Josep Díaz
On the Complexity of Metric Dimension. 419-430 - Debojyoti Dutta, Michael Kapralov, Ian Post, Rajendra Shinde:
Embedding Paths into Trees: VM Placement to Minimize Congestion. 431-442 - Vissarion Fisikopoulos
Faster Geometric Algorithms via Dynamic Determinant Computation. 443-454 - Efi Fogel
Lines through Segments in 3D Space. 455-466 - Fedor V. Fomin
A Polynomial Kernel for Proper Interval Vertex Deletion. 467-478 - Emanuele G. Fusco
Knowledge, Level of Symmetry, and Time of Leader Election. 479-490 - Loukas Georgiadis
An Experimental Study of Dynamic Dominators. 491-502 - Joachim Giesen, Martin Jaggi
Optimizing over the Growing Spectrahedron. 503-514 - Petr A. Golovach
Induced Disjoint Paths in Claw-Free Graphs. 515-526 - Fabrizio Grandoni:
On Min-Power Steiner Tree. 527-538 - Martin Groß, Martin Skutella:
Maximum Multicommodity Flows over Time without Intermediate Storage. 539-550 - Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt:
Approximating Earliest Arrival Flows in Arbitrary Networks. 551-562 - Tobias Harks, Britta Peis:
Resource Buying Games. 563-574 - Meng He
Succinct Data Structures for Path Queries. 575-586 - Pavol Hell, Monaldo Mastrolilli
Approximation of Minimum Cost Homomorphisms. 587-598 - Frank Hellweg, Christian Sohler:
Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness. 599-610 - Michael Hemmer, Michal Kleinbort, Dan Halperin:
Improved Implementation of Point Location in General Two-Dimensional Subdivisions. 611-623 - Danny Hermelin
Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. 624-635 - Rasmus Ibsen-Jensen
Solving Simple Stochastic Games with Few Coin Toss Positions. 636-647 - Hossein Jowhari
Efficient Communication Protocols for Deciding Edit Distance. 648-658 - Thomas Kesselheim:
Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates. 659-670 - Pavel Klavík
Extending Partial Representations of Function Graphs and Permutation Graphs. 671-682 - Yasuaki Kobayashi
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization. 683-694 - László Kozma
Minimum Average Distance Triangulations. 695-706 - Dieter Kratsch, Haiko Müller
Colouring AT-Free Graphs. 707-718 - Bundit Laekhanukit
Routing Regardless of Network Stability. 719-730 - Jean-Daniel Boissonnat, Clément Maria:
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. 731-742 - J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. 743-754 - Tim Nonner:
Polynomial-Time Approximation Schemes for Shortest Path with Alternatives. 755-765 - Peter Palfrader, Martin Held, Stefan Huber
On Computing Straight Skeletons by Means of Kinetic Triangulations. 766-777 - Eunhui Park, David M. Mount
A Self-adjusting Data Structure for Multidimensional Point Sets. 778-789 - José R. Correa, Omar Larré, José A. Soto:
TSP Tours in Cubic Graphs: Beyond 4/3. 790-801 - Jan Arne Telle, Yngve Villanger:
FPT Algorithms for Domination in Biclique-Free Graphs. 802-812 - Martin Waßmann, Karsten Weicker
Maximum Flow Networks for Stability Analysis of LEGO®Structures. 813-824 - Sebastian Wild
Average Case Analysis of Java 7's Dual Pivot Quicksort. 825-836
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 2024-12-26 00:35 CET 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: