default search action
15. ESA 2007: Eilat, Israel
- Lars Arge, Michael Hoffmann, Emo Welzl:
Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings. Lecture Notes in Computer Science 4698, Springer 2007, ISBN 978-3-540-75519-7
Invited Lectures
- Christos H. Papadimitriou:
Nash Equilibria: Where We Stand. 1 - Pierre Fraigniaud:
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. 2-11 - Micha Sharir:
Arrangements in Geometry: Recent Advances and Challenges. 12-16
Contributed Papers: Design and Analysis Track
- Christoph Dürr, Kim Thang Nguyen:
Nash Equilibria in Voronoi Games on Graphs. 17-28 - Petra Berenbrink, Oliver Schulte:
Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation. 29-40 - Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu:
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks. 41-52 - Rina Panigrahy, Dilys Thomas:
Finding Frequent Elements in Non-bursty Streams. 53-62 - Martin Hoefer, Alexander Souza:
Tradeoffs and Average-Case Equilibria in Selfish Routing. 63-74 - Mario Szegedy, Mikkel Thorup:
On the Variance of Subset Sum Estimation. 75-86 - Yuval Lando, Zeev Nutov:
On Minimum Power Connectivity Problems. 87-98 - Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. 99-110 - Amotz Bar-Noy, Joanna Klukowska:
Finding Mobile Data: Efficiency vs. Location Inaccuracy. 111-122 - Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang:
A Faster Query Algorithm for the Text Fingerprinting Problem. 123-135 - Philippe Baptiste, Marek Chrobak, Christoph Dürr:
Polynomial Time Algorithms for Minimum Energy Scheduling. 136-150 - Raphaël Clifford
, Klim Efremenko, Ely Porat, Amir Rothschild:
k -Mismatch with Don't Cares. 151-162 - Petr Hlinený, Sang-il Oum:
Finding Branch-Decompositions and Rank-Decompositions. 163-174 - Noga Alon, Raphael Yuster:
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. 175-186 - Martin Mares
Linear-Time Ranking of Permutations. 187-193 - Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu:
Radix Sorting with No Extra Space. 194-205 - Emilio De Santis, Fabrizio Grandoni, Alessandro Panconesi:
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation. 206-217 - Jakub Pawlewicz
Order Statistics in the Farey Sequences in Sublinear Time. 218-229 - Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir:
New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks. 230-240 - Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k -Forest. 241-252 - Niv Buchbinder
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. 253-264 - Miroslaw Kowaluk, Andrzej Lingas:
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. 265-274 - Julian Lorenz, Konstantinos Panagiotou, Angelika Steger:
Optimal Algorithms for k -Search with Application in Option Pricing. 275-286 - Haim Kaplan, Natan Rubin, Micha Sharir:
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. 287-298 - Dimitris Fotakis
Stackelberg Strategies for Atomic Congestion Games. 299-310 - Sriram V. Pemmaraju, Imran A. Pirwani:
Good Quality Virtual Realization of Unit Ball Graphs. 311-322 - Shankar Kalyanaraman, Christopher Umans:
Algorithms for Playing Games with Limited Randomness. 323-334 - Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover. 335-346 - Gerth Stølting Brodal
Optimal Resilient Dynamic Dictionaries. 347-358 - Frank Kammer:
Determining the Smallest k Such That G Is k -Outerplanar. 359-370 - Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao
On the Size of Succinct Indices. 371-382 - Mikkel Thorup:
Compact Oracles for Approximate Distances Around Obstacles in the Plane. 383-394 - Maren Martens, Fernanda Salazar, Martin Skutella:
Convex Combinations of Single Source Unsplittable Flows. 395-406 - Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. 407-418 - Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
Equitable Revisited. 419-426 - Jihuan Ding, Tomás Ebenlendr, Jirí Sgall
Online Scheduling of Equal-Length Jobs on Parallel Machines. 427-438 - Aristides Gionis, Tamir Tassa:
k -Anonymization with Minimal Loss of Information. 439-450 - Khaled M. Elbassioni
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. 451-462 - Koji M. Kobayashi, Kazuya Okamoto:
Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling. 463-474 - Alexander Grigoriev
Bundle Pricing with Comparable Items. 475-486 - Israel Beniaminy, Zeev Nutov, Meir Ovadia:
Approximating Interval Scheduling Problems with Bounded Profits. 487-497 - Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi:
Pricing Tree Access Networks with Connected Backbones. 498-509 - Alexa Sharp:
Distance Coloring. 510-521 - Nikhil Bansal, Niv Buchbinder
An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. 522-533 - Samir Khuller, Azarakhsh Malekian, Julián Mestre:
To Fill or Not to Fill: The Gas Station Problem. 534-545 - Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic
Online Bandwidth Allocation. 546-557 - Chien-Chung Huang:
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems. 558-569 - Amos Israeli, Dror Rawitz, Oran Sharon:
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems. 570-581 - Cyril Gavoille, Arnaud Labourel:
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. 582-593 - Krzysztof Diks, Piotr Sankowski:
Dynamic Plane Transitive Closure. 594-604
Contributed Papers: Engineering and Applications Track
- Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. 605-617 - Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler:
Estimating Clustering Indexes in Data Streams. 618-632 - Laurent Dupont, Michael Hemmer, Sylvain Petitjean, Elmar Schömer:
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics. 633-644 - Eric Berberich, Efi Fogel
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. 645-656 - Laurent Flindt Muller, Martin Zachariasen
Fast and Compact Oracles for Approximate Distances in Planar Graphs. 657-668 - Peter Hachenberger:
Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces. 669-680 - Markus Chimani, Maria Kandyba, Petra Mutzel
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. 681-692 - Arie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka:
Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts. 693-704 - Stefan Eckhardt, Andreas Michael Mühling, Johannes Nowak:
Fast Lowest Common Ancestor Computations in Dags. 705-716 - Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. 717-728 - Felix G. König, Marco E. Lübbecke
Solutions to Real-World Instances of PSPACE-Complete Stacking. 729-740 - Julien Robert, Nicolas Schabanel:
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough. 741-753 - Susanne Albers, Tobias Jacobs:
An Experimental Study of New and Known Online Packet Buffering Algorithms. 754-765
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-15 01:33 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: