Conferences in DBLP

European Symposium on Algorithms (ESA) (esa)
2007 (conf/esa/2007)

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