@techreport{19735,
  abstract     = {{The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In addition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in the implementation of the PUB library deviate significantly from the techniques used in other BSP libraries.}},
  author       = {{Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}},
  title        = {{{The Paderborn University BSP (PUB) Library - Design, Implementation and Performance}}},
  year         = {{1998}},
}

@inbook{17412,
  abstract     = {{We study algorithmic aspects in the management of geometric scenes in interactive walkthrough animations. We consider arbitrarily large scenes consisting of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic operations in our walkthrough system: reporting the objects around the visitor within a certain distance. Previously a randomized data structure was presented that supports reporting the balls around the visitor in an output sensitive time and allows insertion and deletion of objects nearly as fast as searching. These results were achieved by exploiting the fact that the visitor moves ''slowly'' through the scene. A serious disadvantage of the aforementioned data structure is a big space overhead and the use of randomization. Our first result is a construction of weak spanners that leads to an improvement of the space requirement of the previously known data structures. Then we develop a deterministic data structure for the searching problem in which insertion of objects are allowed. Our incremental data structure supports O(1+k) reporting time, where k is a certain quantity close to the number of reported objects. The insertion time is similar to the reporting time and the space is linear to the total number of objects.
}},
  author       = {{Fischer, Matthias and Lukovszki, Tamás and Ziegler, Martin}},
  booktitle    = {{Algorithms — ESA’ 98}},
  isbn         = {{9783540648482}},
  issn         = {{0302-9743}},
  title        = {{{Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time}}},
  doi          = {{10.1007/3-540-68530-8_14}},
  year         = {{1998}},
}

@inproceedings{17863,
  abstract     = {{New dynamic search data structures developed recently guarantee constant execution time per search and update, i.e., they fulfil the real-time requirements necessary for interactive walkthrough in large geometric scenes. Yet, superiority or even applicability of these new methods in practice was still an open question.

Their prototypical implementation presented in this work uses common libraries on standard stations and thus represents a first strut to bridge this gap. Indeed our experimental results give an indication on the actual performance of these theoretical ideas on real machines and possible bottlenecks in future developments. By special algorithmic enhancements, we can even avoid the otherwise essential preprocessing step.
}},
  author       = {{Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin }},
  booktitle    = {{Algorithm Engineering, 2nd International Workshop, {WAE '98}}},
  pages        = {{133----142}},
  publisher    = {{Max-Planck-Institut für Informatik}},
  title        = {{{A Network Based Approach for Realtime Walkthrough of Massive Models}}},
  year         = {{1998}},
}

@techreport{18145,
  abstract     = {{Preis für den Beitrag "Multimediale Entdeckungsreisen unserer Welt mit dem Internet"}},
  author       = {{Ziegler, Martin and Fischer, Matthias and Lukovszki, Tamás}},
  title        = {{{Multimediale Entdeckungsreisen unserer Welt mit dem Internet}}},
  year         = {{1998}},
}

@phdthesis{18445,
  author       = {{Oesterdiekhoff, Brigitte}},
  title        = {{{On Periodic Comparator Networks}}},
  year         = {{1998}},
}

@article{2168,
  author       = {{Scheideler, Christian and Vöcking, Berthold}},
  journal      = {{Theory Comput. Syst.}},
  number       = {{4}},
  pages        = {{425----449}},
  title        = {{{Universal Continuous Routing Strategies}}},
  doi          = {{10.1007/s002240000096}},
  volume       = {{31}},
  year         = {{1998}},
}

@inproceedings{2169,
  author       = {{Adler, Micah and Scheideler, Christian}},
  booktitle    = {{SPAA}},
  pages        = {{259----268}},
  title        = {{{Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)}}},
  year         = {{1998}},
}

@inproceedings{2170,
  author       = {{Feige, Uriel and Scheideler, Christian}},
  booktitle    = {{STOC}},
  pages        = {{624----633}},
  title        = {{{Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)}}},
  year         = {{1998}},
}

@book{2185,
  author       = {{Scheideler, Christian}},
  isbn         = {{978-3-540-69792-3}},
  title        = {{{Universal Routing Strategies for Interconnection Networks}}},
  doi          = {{10.1007/BFb0052928}},
  volume       = {{1390}},
  year         = {{1998}},
}

@article{16503,
  author       = {{Meyer auf der Heide, Friedhelm and Schröder, Klaus and Schwarze, Frank}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  pages        = {{181--200}},
  title        = {{{Routing on networks of optical crossbars}}},
  doi          = {{10.1016/s0304-3975(97)86791-6}},
  volume       = {{196}},
  year         = {{1998}},
}

@article{16504,
  author       = {{Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  pages        = {{175--203}},
  title        = {{{Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model}}},
  doi          = {{10.1016/s0304-3975(98)00020-6}},
  year         = {{1998}},
}

@inbook{16562,
  author       = {{Meyer auf der Heide, Friedhelm and Martinez, Gabriel Terán}},
  booktitle    = {{LATIN'98: Theoretical Informatics}},
  isbn         = {{9783540642756}},
  issn         = {{0302-9743}},
  title        = {{{Communication-efficient parallel multiway and approximate minimum cut computation}}},
  doi          = {{10.1007/bfb0054332}},
  year         = {{1998}},
}

@inproceedings{16563,
  author       = {{Cole, Richard and Maggs, Bruce M. and Meyer auf der Heide, Friedhelm and Mitzenmacher, Michael and Richa, Andréa W. and Schröder, Klaus and Sitaraman, Ramesh K. and Vöcking, Berthold}},
  booktitle    = {{Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC '98}},
  isbn         = {{0897919629}},
  title        = {{{Randomized protocols for low-congestion circuit routing in multistage interconnection networks}}},
  doi          = {{10.1145/276698.276790}},
  year         = {{1998}},
}

@phdthesis{19631,
  author       = {{Bäumker, Armin}},
  isbn         = {{3-931466-27-2}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Communication Efficient Parallel Searching}}},
  volume       = {{28}},
  year         = {{1997}},
}

@phdthesis{19636,
  author       = {{Dittrich, Wolfgang}},
  isbn         = {{3-931466-26-4}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Communication and I/O Efficient Parallel Data Structures}}},
  volume       = {{27}},
  year         = {{1997}},
}

@phdthesis{19637,
  author       = {{Strothmann, Willy-Bernhard}},
  isbn         = {{3-931466-34-5}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Bounded Degree Spanning Trees}}},
  volume       = {{35}},
  year         = {{1997}},
}

@inproceedings{19869,
  abstract     = {{Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning tree of $G$ of maximum degree bounded by $dT$. It is well known that for each $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning tree is NP-complete. In this paper we investigate this problem when additionally connectivity and maximum degree of the graph are given. A complete characterization of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$ is provided. Our first result is that given a biconnected graph of maximum degree $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand, we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$ has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge 3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$ has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$. This extends the well known result for $k=3$ and fully characterizes the case $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$. On the other hand, we show how to find in polynomial (linear or almost linear) time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.}},
  author       = {{Czumaj, Artur and Strothmann, Willy-Bernhard}},
  booktitle    = {{Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)}},
  isbn         = {{9783540633976}},
  issn         = {{0302-9743}},
  title        = {{{Bounded degree spanning trees}}},
  doi          = {{10.1007/3-540-63397-9_9}},
  year         = {{1997}},
}

@techreport{18955,
  abstract     = {{In this paper we present a (randomized) algorithm for maintaining the biconnected components of a dynamic planar graph of $n$ vertices under deletions of edges. The biconnected components can be maintained under any sequence of edge deletions in a total of $O(n log n)$ time, with high probability. This gives $O(log n)$ amortized time per edge deletion, which improves previous (deterministic) results due to Giammarresi and Italiano, where $O(n log^2 n)$ amortized time is needed. Our work describes a simplification of the data structures from [GiIt96] and uses dynamic perfect hashing to reduce the running time. As in the paper by Giammarresi and Italiano, we only need $O(n)$ space. Finally we describe some simply additional operations on the decremental data structure. By aid of them this the data structure is applicable for finding efficiently a $Delta$-spanning tree in a biconnected planar graph with a maximum degree $2Delta-2$ do to Czumaj and Strothmann.}},
  author       = {{Strothmann, Willy-Bernhard and Lukovszki, Tamás}},
  title        = {{{Decremental Biconnectivity on Planar Graphs}}},
  year         = {{1997}},
}

@inproceedings{18575,
  author       = {{Sohler, Christian and Denny, Markus}},
  booktitle    = {{Proceedings of the 9th Canadian Conference on Computational Geometry}},
  pages        = {{39--43}},
  title        = {{{Encoding a Triangulation as a Permutation of its Point Set}}},
  year         = {{1997}},
}

@inproceedings{2175,
  author       = {{Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler, Christian}},
  booktitle    = {{IPPS}},
  pages        = {{326----332}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Optimal Wormhole Routing in the (n, d)-Torus}}},
  year         = {{1997}},
}