Conferences in DBLP

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

1. Bernard Chazelle
   Sublinear Computing. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:1- [Conf]
   
2. Roberto Tamassia
   Authenticated Data Structures. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:2-5 [Conf]
   
3. Éva Tardos
   Approximation Algorithms and Network Games. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:6- [Conf]
   
4. Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi
   I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:7-18 [Conf]
   
5. Mansoor Alicherry, Randeep Bhatia
   Line System Design and a Generalized Coloring Problem. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:19-30 [Conf]
   
6. Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys
   Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:31-42 [Conf]
   
7. Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere
   Scheduling for Flow-Time with Admission Control. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:43-54 [Conf]
   
8. Reuven Bar-Yehuda, Guy Even, Shimon Shahar
   On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:55-66 [Conf]
   
9. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
   Semi-clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP]
   ESA, 2003, pp:67-77 [Conf]
   
10. Alex R. Berg, Tibor Jordán
    Algorithms for Graph Rigidity and Scene Analysis. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:78-89 [Conf]
    
11. Therese C. Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper
    Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:90-101 [Conf]
    
12. Liad Blumrosen, Noam Nisan, Ilya Segal
    Multi-player and Multi-round Auctions with Severely Bounded Communication. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:102-113 [Conf]
    
13. Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky
    Network Lifetime and Power Assignment in ad hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:114-126 [Conf]
    
14. Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na
    Disjoint Unit Spheres admit at Most Two Line Transversals. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:127-135 [Conf]
    
15. Kai-min Chung, Hsueh-I Lu
    An Optimal Algorithm for the Maximum-Density Segment Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:136-147 [Conf]
    
16. Graham Cormode, S. Muthukrishnan
    Estimating Dominance Norms of Multiple Data Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:148-160 [Conf]
    
17. Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler
    Smoothed Motion Complexity. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:161-171 [Conf]
    
18. Mark de Berg
    Kinetic Dictionaries: How to Shoot a Moving Target. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:172-183 [Conf]
    
19. Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc
    Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:184-195 [Conf]
    
20. Friedrich Eisenbrand
    Fast Integer Programming in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:196-207 [Conf]
    
21. Dotan Emanuel, Amos Fiat
    Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:208-220 [Conf]
    
22. Fedor V. Fomin, Dimitrios M. Thilikos
    Dominating Sets and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:221-229 [Conf]
    
23. Stefan Funke, Domagoj Matijevic, Peter Sanders
    Approximating Energy Efficient Paths in Wireless Multi-hop Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:230-241 [Conf]
    
24. Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit
    Bandwidth Maximization in Multicasting. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:242-253 [Conf]
    
25. Cyril Gavoille, Christophe Paul
    Optimal Distance Labeling for Interval and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:254-265 [Conf]
    
26. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
    Improved Approximation of the Stable Marriage Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:266-277 [Conf]
    
27. Sariel Har-Peled, Soham Mazumdar
    Fast Algorithms for Computing the Smallest k-Enclosing Disc. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:278-288 [Conf]
    
28. Refael Hassin, Asaf Levin
    The Minimum Generalized Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:289-300 [Conf]
    
29. Thomas Hofmeister
    An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:301-312 [Conf]
    
30. Bala Kalyanasundaram, Mahendran Velauthapillai
    On-Demand Broadcasting Under Deadline. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:313-324 [Conf]
    
31. Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis
    Improved Bounds for Finger Search on a RAM. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:325-336 [Conf]
    
32. Menelaos I. Karavelas, Mariette Yvinec
    The Voronoi Diagram of Planar Convex Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:337-348 [Conf]
    
33. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir
    Buffer Overflows of Merging Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:349-360 [Conf]
    
34. Alexander Kesselman, Yishay Mansour, Rob van Stee
    Improved Competitive Guarantees for QoS Buffering. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:361-372 [Conf]
    
35. Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
    On Generalized Gossiping and Broadcasting (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:373-384 [Conf]
    
36. Guy Kortsarz, Sunil M. Shende
    Approximating the Achromatic Number Problem on Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:385-396 [Conf]
    
37. Miroslaw Kutylowski, Wojciech Rutkowski
    Adversary Immune Leader Election in ad hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:397-408 [Conf]
    
38. Mohammad Mahdian, Martin Pál
    Universal Facility Location. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:409-421 [Conf]
    
39. Grzegorz Malewicz
    A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:422-433 [Conf]
    
40. Ulrich Meyer, Norbert Zeh
    I/O-Efficient Undirected Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:434-445 [Conf]
    
41. Shmuel Safra, Oded Schwartz
    On the Complexity of Approximating TSP with Neighborhoods and Related Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:446-458 [Conf]
    
42. Jiri Sgall, Gerhard J. Woeginger
    A Lower Bound for Cake Cutting. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:459-469 [Conf]
    
43. Micha Sharir, Hayim Shaul
    Ray Shooting and Stone Throwing. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:470-481 [Conf]
    
44. Aleksandrs Slivkins
    Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:482-493 [Conf]
    
45. Csaba D. Tóth
    Binary Space Partition for Orthogonal Fat Rectangles. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:494-505 [Conf]
    
46. Dekel Tsur
    Sequencing by Hybridization in Few Rounds. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:506-516 [Conf]
    
47. Biing-Feng Wang, Yong-Hsian Hsieh, Li-Pu Yeh
    Efficient Algorithms for the Ring Loading Problem with Demand Splitting. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:517-526 [Conf]
    
48. Gerhard J. Woeginger
    Seventeen Lines and One-Hundred-and-One Points. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:527-531 [Conf]
    
49. Nicola Wolpert
    Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:532-543 [Conf]
    
50. Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian
    Streaming Geometric Optimization Using Graphics Hardware. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:544-555 [Conf]
    
51. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:556-567 [Conf]
    
52. Ulrik Brandes, Marco Gaertler, Dorothea Wagner
    Experiments on Graph Clustering Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:568-579 [Conf]
    
53. Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu
    More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:580-592 [Conf]
    
54. Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany
    The Minimum Shift Design Problem: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:593-604 [Conf]
    
55. Marianne Durand, Philippe Flajolet
    Loglog Counting of Large Cardinalities (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:605-617 [Conf]
    
56. Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schömer
    Packing a Trunk. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:618-629 [Conf]
    
57. Kaspar Fischer, Bernd Gärtner, Martin Kutz
    Fast Smallest-Enclosing-Ball Computation in High Dimensions. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:630-641 [Conf]
    
58. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Automated Generation of Search Tree Algorithms for Graph Modification Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:642-653 [Conf]
    
59. Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel
    Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:654-666 [Conf]
    
60. Sven Grothklags
    Fleet Assignment with Connection Dependent Ground Times. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:667-678 [Conf]
    
61. Irit Katriel, Peter Sanders, Jesper Larsson Träff
    A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:679-690 [Conf]
    
62. Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher
    The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:691-702 [Conf]
    
63. Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn
    Algorithms and Experiments for the Webgraph. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:703-714 [Conf]
    
64. Christian Liebchen
    Finding Short Integral Cycle Bases for Cyclic Timetabling. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:715-726 [Conf]
    
65. Matthias Müller-Hannemann, Ute Zimmermann
    Slack Optimization of Timing-Critical Nets. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:727-739 [Conf]
    
66. Piotr Sankowski
    Multisampling: A New Approach to Uniform Sampling and Approximate Counting. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:740-751 [Conf]
    
67. Meinolf Sellmann, Norbert Sensen, Larissa Timajev
    Multicommodity Flow Approximation Used for Exact Graph Partitioning. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:752-764 [Conf]
    
68. Hisao Tamaki
    A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:765-775 [Conf]
    
69. Dorothea Wagner, Thomas Willhalm
    Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:776-787 [Conf]