![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
2. ESA 1994: Utrecht, The Netherlands
- Jan van Leeuwen:
Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings. Lecture Notes in Computer Science 855, Springer 1994, ISBN 3-540-58434-X
Invited Lectures
- Andrew V. Goldberg:
Optimization Algorithms For Large Networks. 1-9 - Gaston H. Gonnet:
Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value (Abstract). 10-11
Automatic Graph Drawing and Rendering
- Ashim Garg, Roberto Tamassia:
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract). 12-23 - Therese Biedl, Goos Kant:
A Better Heuristic for Orthogonal Graph Drawings. 24-35 - Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena:
Hamilton Triangulations for Fast Rendering. 36-47
Spanners and Steiner Trees
- Sunil Arya, Michiel H. M. Smid:
Efficient Construction of a Bounded Degree Spanner with Low Weight. 48-59 - Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky:
Approaching the 5/4-Approximation for Rectilinear Steiner Trees. 60-71
Efficient Datastructures and Complexity Analysis
- Andrej Brodnik
, J. Ian Munro:
Membership in Constant Time and Minimum Space. 72-81 - Arne Andersson, Stefan Nilsson:
Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. 82-93 - Patricio V. Poblete, Alfredo Viola, J. Ian Munro:
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). 94-105 - Svante Carlsson, Jingsen Chen:
Some Lower Bounds for Comparison-Based Algorithms. 106-117
Graph Algorithms I
- Xiao Zhou, Takao Nishizeki:
An Efficient Algorithm for Edge-Ranking Trees. 118-129 - Karsten Weihe:
Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time. 130-140 - Mechthild Stoer, Frank Wagner:
A Simple Min Cut Algorithm. 141-147 - Jun Dong Cho
, Salil Raje, Majid Sarrafzadeh:
Approximation Algorithm on Multi-Way Maxcut Partitioning. 148-158 - Victor Chepoi, Feodor F. Dragan:
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. 159-170
Distributed Algorithms
- Amos Israeli, Asaf Shirazi:
The Time Complexity of Updating Snapshot Memories. 171-182 - Giuseppe Parlati, Moti Yung:
Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking. 183-201 - Carsten Lund, Nick Reingold, Jeffery R. Westbrook, Dicky C. K. Yan:
On-Line Distributed Data Management. 202-214
Computational Geometry
- Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
:
A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. 215-226 - Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra:
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. 227-239 - Mark H. Overmars, A. Frank van der Stappen:
Range Searching and Point Location among Fat Objects. 240-253
Computational Geometry and Robutics
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec:
Convex Tours on Bounded Curvature. 254-265 - Yi-Jen Chiang, Roberto Tamassia:
Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract). 266-277 - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. 278-289
Operations Research and Combinatorial Optimization
- Ingo Schiermeyer:
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles. 290-299 - Bo Chen, André van Vliet, Gerhard J. Woeginger:
An Optimal Algorithm for Preemptive On-line Scheduling. 300-306 - Anand Srivastav, Peter Stangier:
Tight Approximations for Resource Constrained Scheduling Problems. 307-318 - Dag Wedelin:
An Algorithm for 0-1 Programming with Application to Airline Crew Scheduling. 319-330
Graph Algorithms II
- Sajal K. Das, Paolo Ferragina:
An o(n) Work EREW Parallel Algorithm for Updating MST. 331-342 - Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
:
On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's. 343-353 - Noga Alon, Raphael Yuster, Uri Zwick
:
Finding and Counting Given Length Cycles (Extended Abstract). 354-364
Parallel Computation and Interconnection Networks
- Ishai Ben-Aroya, Assaf Schuster:
Greedy Hot-Potato Routing on the Mesh. 365-376 - Jop F. Sibeyn:
Desnakification of Mesh Sorting Algorithms. 377-390 - Andrea Pietracaprina, Geppino Pucci
:
Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy. 391-400 - Bogdan S. Chlebus, Anna Gambin, Piotr Indyk:
PRAM Computations Resilient to Memory Faults. 401-412 - Gianfranco Bilardi, Paul Bay:
An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). 413-423
Complexity Theory
- Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. 424-435 - Raymond Greenlaw, Jonathan Machta:
The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract). 436-447 - Arnold Schönhage, Ekkehart Vetter:
A New Approach to Resultant Computations and Other Algorithms with Exact Division. 448-459
Text Processing Algorithms
- Wojciech Plandowski:
Testing Equivalence of Morphisms on Context-Free Languages. 460-470 - Leszek Gasieniec, Kunsoo Park:
Work-Time Optimal Parallel Prefix Matching (Extended Abstract). 471-482 - Dany Breslauer, Livio Colussi, Laura Toniolo:
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). 483-494 - Paolo Ferragina:
Incremental Text Editing: A New Data Structure. 495-507 - Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch:
Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. 508
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.