1. ESA 1993: Bad Honnef, Germany
Thomas Lengauer (Ed.):
Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings.
Lecture Notes in Computer Science 726 Springer 1993, ISBN 3-540-57273-2 BibTeX
- Susanne Albers:
The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract).
1-12 BibTeX
- Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications.
13-24 BibTeX
- Yosi Ben-Asher, Dan Gordon, Assaf Schuster:
Efficient Self Simulation Algorithms for Reconfigurable Arrays.
25-36 BibTeX
- Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia:
Optimal Upward Planarity Testing of Single-Source Digraphs.
37-48 BibTeX
- Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe:
On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract).
49-60 BibTeX
- Dany Breslauer:
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm.
61-72 BibTeX
- Anne Brüggemann-Klein:
Unambiguity of Extended Regular Expressions in SGML Document Grammars.
73-84 BibTeX
- Nader H. Bshouty:
On the Direct Sum Conjecture in the Straight Line Model.
85-96 BibTeX
- Robert F. Cohen, Roberto Tamassia:
Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract).
97-108 BibTeX
- Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack:
Optimal CREW-PRAM Algorithms for Direct Dominance Problems.
109-120 BibTeX
- Mark de Berg, Marc J. van Kreveld:
Trekking in the Alps Without Freezing or Getting Tired.
121-132 BibTeX
- Olivier Devillers, Mordecai J. Golin:
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems.
133-144 BibTeX
- Josep Díaz, Maria J. Serna, Jacobo Torán:
Parallel Approximation Schemes for problems on planar graphs (Extended Abstract).
145-156 BibTeX
- Michael R. Fellows, Michael T. Hallett, Harold T. Wareham:
DNA Physical Mapping: Three Ways Difficult.
157-168 BibTeX
- Philippe Flajolet, Paul Zimmermann, Bernard Van Cutsem:
A Calculus of Random Generation.
169-180 BibTeX
- Ornan Ori Gerstel, Shmuel Zaks:
The Bit Complexity of Distributed Sorting (Extended Abstract).
181-191 BibTeX
- Johann Hagauer, Günter Rote:
Three-Clustering of Points in the Plane.
192-199 BibTeX
- Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener:
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.
200-211 BibTeX
- Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch:
Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract).
212-223 BibTeX
- Zoran Ivkovic, Errol L. Lloyd:
Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps.
224-235 BibTeX
- Tibor Jordán:
Incresing the Vertex-Connectivity in Directed Graphs.
236-247 BibTeX
- Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
On the Recognition of Permuted Bottleneck Monge Matrices.
248-259 BibTeX
- Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch:
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators.
260-271 BibTeX
,
Erratum: ESA 1994: 508 BibTeX
- Manfred Kunde:
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound.
272-283 BibTeX
- Jan Karel Lenstra, Marinus Veldhorst:
The Complexity of Scheduling Trees with Communication Delays (Extended Abstract).
284-294 BibTeX
- Ernst W. Mayr, Ralph Werchner:
Optimal Tree Contraction on the Hypercube and Related Networks.
295-305 BibTeX
- Mike Paterson:
Evolution of an Algorithm.
306-308 BibTeX
- Sanguthevar Rajasekaran:
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection.
309-320 BibTeX
- Vijaya Ramachandran, Honghua Yang:
An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem.
321-332 BibTeX
- Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman:
Randomized Routing on Meshes with Buses.
333-344 BibTeX
- Klaus Simon, Davide Crippa, Fabian Collenberg:
On the Distribution of the Transitive Closure in a Random Acyclic Digraph.
345-356 BibTeX
- Alexander Schrijver:
Complexity of Disjoint Paths Problems in Planar Graphs.
357-359 BibTeX
- Anand Srivastav, Peter Stangier:
Integer Multicommodity Flows with Reduced Demands.
360-371 BibTeX
- Sairam Subramanian:
A Fully Dynamic Data Structure for Reachability in Planar Digraphs.
372-383 BibTeX
- Dorothea Wagner, Karsten Weihe:
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs.
384-395 BibTeX
- Michael S. Waterman:
Sequence Comparison and Statistical Significance in Molecular Biology (Abstract).
396 BibTeX
- Emo Welzl, Barbara Wolfers:
Surface Reconstruction Between Simple Polygons via Angle Criteria.
397-408 BibTeX
- Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki:
A Linear Algorithm for Edge-Coloring Partial k-Trees.
409-418 BibTeX
Copyright © Sat May 16 23:10:37 2009
by Michael Ley (ley@uni-trier.de)