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