Skip to main content
SpringerLink
Log in

Algorithms - ESA '93

First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993. Proceedings

  • Conference proceedings
  • © 1993

Overview

Editors:
  1. Thomas Lengauer
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 726)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (38 papers)

  1. Fully dynamic algorithms for bin packing: Being (mostly) myopic helps

    • Zoran Ivković, Errol L. Lloyd
    Pages 224-235

  2. Increasing the vertex-connectivity in directed graphs

    • Tibor Jordán
    Pages 236-247

  3. On the recognition of permuted bottleneck monge matrices

    • Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
    Pages 248-259

  4. Computing treewidth and minimum fill-in: All you need are the minimal separators

    • T. Kloks, H. Bodlaender, H. Müller, D. Kratsch
    Pages 260-271

  5. Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound

    • Manfred Kunde
    Pages 272-283

  6. The complexity of scheduling trees with communication delays

    • Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman
    Pages 284-294

  7. Optimal tree contraction on the hypercube and related networks

    • Ernst W. Mayr, Ralph Werchner
    Pages 295-305

  8. Evolution of an algorithm

    • Mike Paterson
    Pages 306-308

  9. Mesh connected computers with fixed and reconfigurable buses: Packet routing, sorting, and selection

    • Sanguthevar Rajasekaran
    Pages 309-320

  10. An efficient parallel algorithm for the layered planar monotone circuit value problem

    • Vijaya Ramachandran, Honghua Yang
    Pages 321-332

  11. Randomized routing on meshes with buses

    • Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
    Pages 333-344

  12. On the distribution of the transitive closure in a random acyclic digraph

    • Klaus Simon, Davide Crippa, Fabian Collenberg
    Pages 345-356

  13. Complexity of disjoint paths problems in planar graphs

    • Alexander Schrijver
    Pages 357-359

  14. Integer multicommodity flows with reduced demands

    • Anand Srivastav, Peter Stangier
    Pages 360-371

  15. A fully dynamic data structure for reachability in planar digraphs

    • Sairam Subramanian
    Pages 372-383

  16. A linear-time algorithm for edge-disjoint paths in planar graphs

    • Dorothea Wagner, Karsten Weihe
    Pages 384-395

  17. Sequence comparison and statistical significance in molecular biology

    • Michael S. Waterman
    Pages 396-396

  18. Surface reconstruction between simple polygons via angle criteria

    • Emo Welzl, Barbara Wolfers
    Pages 397-408

  19. A linear algorithm for edge-coloring partial k-trees

    • Xiao Zhou, Shin-ichi Nakano, Takao Nishizeki
    Pages 409-418

  20. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

Symposium on Algorithms (ESA '93), held in Bad Honnef, near Boon, in Germany, September 30 - October 2, 1993. The symposium is intended to launchan annual series of international conferences, held in early fall, covering the field of algorithms. Within the scope of the symposium lies all research on algorithms, theoretical as well as applied, that is carried out in the fields of computer science and discrete applied mathematics. The symposium aims to cater to both of these research communities and to intensify the exchange between them. The volume contains 35 contributed papers selected from 101 proposals submitted in response to the call for papers, as well as three invited lectures: "Evolution of an algorithm" by Michael Paterson, "Complexity of disjoint paths problems in planar graphs" by Alexander Schrijver, and "Sequence comparison and statistical significance in molecular biology" by Michael S. Waterman.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation