Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar8. ESA 2000: Saarbrücken, Germany
Mike Paterson:
Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1879, Springer 2000, ISBN 3-540-41004-X
Invited Papers
Contributed Papers
- Pankaj K. Agarwal, Eyal Flato, Dan Halperin:
Polygon Decomposition for Efficient Construction of Minkowski Sums. 20-31 - Alexander A. Ageev, Maxim Sviridenko:
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. 32-41 - Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner:
Computing Largest Common Point Sets under Approximate Congruence. 52-63 - Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson:
On Recognizing Cayley Graphs. 76-87 - András A. Benczúr, Ottilia Fülöp:
Fast Algorithms for Even/Odd Minimum Cuts and Generalizations. 88-99 - Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal:
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. 100-111 - Peter Brass:
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset. 112-119 - Adam L. Buchsbaum, Michael T. Goodrich, Jeffery Westbrook:
Range Searching Over Tree Cross Products. 120-131 - Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh:
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. 132-142 - Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks. 143-154 - Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with Low Stabbing Number. 167-178 - Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich:
K-D Trees Are Better when Cut on the Longest Side. 179-190 - Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti:
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. 211-219 - Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh:
I/O-Efficient Well-Separated Pair Decomposition and Its Applications. 220-231 - Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld:
Higher Order Delaunay Triangulations. 232-243 - Venkatesan Guruswami, Madhu Sudan:
On Representations of Algebraic-Geometric Codes for List Decoding. 244-255 - Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai:
Scheduling Broadcasts in Wireless Networks. 290-301 - Jae-Ha Lee, Otfried Cheong, Woo-Cheol Kwon, Sung Yong Shin, Kyung-Yong Chwa:
Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points. 314-325 - Enrico Nardelli, Guido Proietti, Peter Widmayer:
Maintaining a Minimum Spanning Tree Under Transient Node Failures. 346-355 - Zhongping Qin, Alexander Wolff, Yin-Feng Xu, Binhai Zhu:
New Algorithms for Two-Label Point Labeling. 368-379 - Naila Rahman, Rajeev Raman:
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. 380-391 - Marjan van den Akker, Han Hoogeveen, Nodari Vakhania:
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. 427-436
maintained by 
at 
at 
last updated on 2018-11-15 21:46 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint