Conferences in DBLP

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

1. Erik D. Demaine
   Origami, Linkages, and Polyhedra: Folding with Algorithms. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:1- [Conf]
   
2. Kurt Mehlhorn
   Reliable and Efficient Geometric Computing. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:2- [Conf]
   
3. Ron Shamir
   Some Computational Challenges in Today's Bio-medicine. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:3- [Conf]
   
4. Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann
   Kinetic Collision Detection for Convex Fat Objects. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:4-15 [Conf]
   
5. Peyman Afshani, Timothy M. Chan
   Dynamic Connectivity for Axis-Parallel Rectangles. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:16-27 [Conf]
   
6. Christoph Ambühl, Monaldo Mastrolilli
   Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:28-39 [Conf]
   
7. Amitai Armon, Adi Avidor, Oded Schwartz
   Cooperative TSP. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:40-51 [Conf]
   
8. Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
   Fréchet Distance for Curves, Revisited. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:52-63 [Conf]
   
9. Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz
   Resource Allocation in Bounded Degree Trees. [Citation Graph (0, 0)][DBLP]
   ESA, 2006, pp:64-75 [Conf]
   
10. Surender Baswana
    Dynamic Algorithms for Graph Spanners. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:76-87 [Conf]
    
11. Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti
    Latency Constrained Aggregation in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:88-99 [Conf]
    
12. Avraham Ben-Aroya, Sivan Toledo
    Competitive Analysis of Flash-Memory Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:100-111 [Conf]
    
13. Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
    Contention Resolution with Heterogeneous Job Sizes. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:112-123 [Conf]
    
14. Robert Berke, Tibor Szabó
    Deciding Relaxed Two-Colorability - A Hardness Jump. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:124-135 [Conf]
    
15. Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
    Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:136-147 [Conf]
    
16. Lakshminath Bhuvanagiri, Sumit Ganguly
    Estimating Entropy over Data Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:148-159 [Conf]
    
17. David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
    Necklaces, Convolutions, and X + Y. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:160-171 [Conf]
    
18. Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas
    Purely Functional Worst Case Constant Time Catenable Sorted Lists. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:172-183 [Conf]
    
19. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    Taxes for Linear Atomic Congestion Games. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:184-195 [Conf]
    
20. Hubert T.-H. Chan, Michael Dinitz, Anupam Gupta
    Spanners with Slack. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:196-207 [Conf]
    
21. Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong
    Compressed Indexes for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:208-219 [Conf]
    
22. Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu
    Traversing the Machining Graph. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:220-231 [Conf]
    
23. Bruno Codenotti, Mauro Leoncini, Giovanni Resta
    Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:232-243 [Conf]
    
24. Andrzej Czygrinow, Michal Hanckowiak
    Distributed Almost Exact Approximations for Minor-Closed Families. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:244-255 [Conf]
    
25. Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra
    Spectral Clustering by Recursive Partitioning. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:256-267 [Conf]
    
26. Brian C. Dean, Michel X. Goemans, Nicole Immorlica
    Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:268-279 [Conf]
    
27. Frederic Dorn
    Dynamic Programming and Fast Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:280-291 [Conf]
    
28. Karim Douïeb, Stefan Langerman
    Near-Entropy Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:292-303 [Conf]
    
29. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan
    Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:304-314 [Conf]
    
30. Christoph Dürr, Mathilde Hurand
    Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:315-326 [Conf]
    
31. Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
    Preemptive Online Scheduling: Optimal Algorithms for All Speeds. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:327-339 [Conf]
    
32. Khaled M. Elbassioni
    On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:340-351 [Conf]
    
33. Matthias Englert, Matthias Westermann
    Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:352-363 [Conf]
    
34. Leah Epstein, Asaf Levin, Gerhard J. Woeginger
    Graph Coloring with Rejection. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:364-375 [Conf]
    
35. Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
    A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:376-386 [Conf]
    
36. Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
    Violator Spaces: Structure and Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:387-398 [Conf]
    
37. Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan
    Region-Restricted Clustering for Geographic Data Mining. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:399-410 [Conf]
    
38. Yijie Han
    An O(n³ (loglogn/logn)^5/4) Time Algorithm for All Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:411-417 [Conf]
    
39. Chien-Chung Huang
    Cheating by Men in the Gale-Shapley Stable Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:418-431 [Conf]
    
40. Alexis C. Kaporis, Lefteris M. Kirousis, Elias C. Stavropoulos
    Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:432-443 [Conf]
    
41. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
    Enumerating Spanning and Connected Subsets in Graphs and Matroids. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:444-455 [Conf]
    
42. Adam Kirsch, Michael Mitzenmacher
    Less Hashing, Same Performance: Building a Better Bloom Filter. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:456-467 [Conf]
    
43. Jochen Könemann, Ojas Parekh, Danny Segev
    A Unified Approach to Approximating Partial Covering Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:468-479 [Conf]
    
44. Ravi Kumar, David Liben-Nowell, Andrew Tomkins
    Navigating Low-Dimensional and Hierarchical Population Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:480-491 [Conf]
    
45. David Manlove, Colin T. S. Sng
    Popular Matchings in the Capacitated House Allocation Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:492-503 [Conf]
    
46. Yossi Matias, Daniel Urieli
    Inner-Product Based Wavelet Synopses for Range-Sum Queries. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:504-515 [Conf]
    
47. Nicole Megow, Tjark Vredeveld
    Approximation in Preemptive Stochastic Online Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:516-527 [Conf]
    
48. Julián Mestre
    Greedy in Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:528-539 [Conf]
    
49. Ulrich Meyer, Norbert Zeh
    I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:540-551 [Conf]
    
50. Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher
    Stochastic Shortest Paths Via Quasi-convex Maximization. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:552-563 [Conf]
    
51. Ojas Parekh, Danny Segev
    Path Hitting in Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:564-575 [Conf]
    
52. Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige
    Minimum Transversals in Posi-modular Systems. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:576-587 [Conf]
    
53. Alexander D. Scott, Gregory B. Sorkin
    An LP-Designed Algorithm for Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:588-599 [Conf]
    
54. Danny Segev, Gil Segev
    Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:600-611 [Conf]
    
55. Robert Endre Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou, Jia Mao
    Balancing Applied to Maximum Network Flow Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:612-623 [Conf]
    
56. Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu
    Out-of-Order Event Processing in Kinetic Data Structures. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:624-635 [Conf]
    
57. Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes
    Kinetic Algorithms Via Self-adjusting Computation. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:636-647 [Conf]
    
58. Marjan van den Akker, J. A. Hoogeveen, Jules W. van Kempen
    Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:648-659 [Conf]
    
59. Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle
    Reporting Flock Patterns. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:660-671 [Conf]
    
60. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
    On Exact Algorithms for Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:672-683 [Conf]
    
61. Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese
    An Improved Construction for Counting Bloom Filters. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:684-695 [Conf]
    
62. Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth
    An MINLP Solution Method for a Water Network Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:696-707 [Conf]
    
63. Gerth Stølting Brodal, Gabriel Moruz
    Skewed Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:708-719 [Conf]
    
64. Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
    Algorithmic Aspects of Proportional Symbol Maps. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:720-731 [Conf]
    
65. Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup
    Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:732-743 [Conf]
    
66. Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu
    Multiline Addressing by Network Flow. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:744-755 [Conf]
    
67. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini
    The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:756-767 [Conf]
    
68. Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano
    The Price of Resiliency: A Case Study on Sorting with Memory Faults. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:768-779 [Conf]
    
69. Kanela Kaligosi, Peter Sanders
    How Branch Mispredictions Affect Quicksort. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:780-791 [Conf]
    
70. Michal Meyerovitch
    Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:792-803 [Conf]
    
71. Peter Sanders, Dominik Schultes
    Engineering Highway Hierarchies. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:804-816 [Conf]
    
72. Elias P. Tsigaridas, Ioannis Z. Emiris
    Univariate Polynomial Real Root Isolation: Continued Fractions Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:817-828 [Conf]
    
73. Ron Wein
    Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:829-840 [Conf]