@inproceedings{3256,
  author       = {{Gehrke, Thomas and Huhn, Michaela and Rensink, Arend and Wehrheim, Heike}},
  booktitle    = {{Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII'98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France}},
  editor       = {{Budkowski, Stanislaw and R. Cavalli, Ana and Najm, Elie}},
  pages        = {{3----18}},
  title        = {{{An Algebraic Semantics for Message Sequence Chart Documents}}},
  year         = {{1998}},
}

@inproceedings{3257,
  author       = {{Huhn, Michaela and Niebert, Peter and Wehrheim, Heike}},
  booktitle    = {{Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings}},
  editor       = {{Arvind, Vikraman and Ramanujam, Ramaswamy}},
  pages        = {{271----282}},
  title        = {{{Partial Order Reductions for Bisimulation Checking}}},
  doi          = {{10.1007/978-3-540-49382-2_26}},
  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}},
}

@inbook{19206,
  author       = {{Seng, Eva- Maria and Saage, Richard}},
  booktitle    = {{Bürgersinn und Kritik, Festschrift für Udo Bermbach zum 60. Geburtstag}},
  editor       = {{Greven, Michael Th. and Münkler, Herfried and Schmalz-Bruns, Rainer}},
  pages        = {{207--238}},
  title        = {{{Naturalisierte Utopien zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst}}},
  year         = {{1998}},
}

@inproceedings{20746,
  author       = {{Hahn, O. and Eis, M. and Meschut, Gerson}},
  booktitle    = {{Tagungsband zum 6. Paderborner Symposium Fügetechnik}},
  isbn         = {{ISBN 3-9805447-1-0}},
  location     = {{Paderborn}},
  pages        = {{210--218}},
  title        = {{{Kleben abzeichnungsfreier Leichtbaustrukturen durch Prozeß-, Gestalt- und Klebstoffoptimierung}}},
  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}},
}

@article{18624,
  abstract     = {{We investigate the performance of the GW approximation by comparison to exact results for small model systems. The role of the chemical potentials in Dyson's equation as well as the consequences of numerical resonance broadening are examined, and we show how a proper treatment can improve computational implementations of many-body perturbation theory in general. Exchange-only and GW calculations are performed over a wide range of fractional band fillings and correlation strengths. We thus identify the physical situations where these schemes are applicable.}},
  author       = {{Pollehn, Thomas Joachim and Schindlmayr, Arno and Godby, Rex William}},
  issn         = {{1361-648X}},
  journal      = {{Journal of Physics: Condensed Matter}},
  number       = {{6}},
  pages        = {{1273--1283}},
  publisher    = {{IOP Publishing}},
  title        = {{{Assessment of the GW approximation using Hubbard chains}}},
  doi          = {{10.1088/0953-8984/10/6/011}},
  volume       = {{10}},
  year         = {{1998}},
}

@misc{34769,
  author       = {{Süßmann, Johannes}},
  booktitle    = {{Archiv für Sozialgeschichte}},
  pages        = {{679–682}},
  title        = {{{[Rez. v.] Francis Haskell. Die Geschichte und ihre Bilder. Die Kunst und die Deutung der Vergangenheit. Aus dem Englischen übersetzt von Michael Bischoff. Verlag C.H. Beck, München 1995}}},
  volume       = {{38}},
  year         = {{1998}},
}

@inbook{36166,
  author       = {{Kamp, Hermann}},
  booktitle    = {{Das Öffentliche und Private in der Vormoderne}},
  editor       = {{Melville, Gert and von Moos, Peter}},
  pages        = {{687--714}},
  title        = {{{Commynes und der Umgang mit der Öffentlichkeit im 15. Jahrhundert}}},
  year         = {{1998}},
}

@inbook{36163,
  author       = {{Kamp, Hermann}},
  booktitle    = {{Menschen im Schatten der Kathedrale. Neuigkeiten aus dem Mittelalter}},
  editor       = {{Althoff, Gerd and Goetz, Hans-Werner and Schubert, Ernst}},
  pages        = {{99--110}},
  title        = {{{Moderne Herrschaftsformen vor der Moderne: das Beispiel Burgund}}},
  year         = {{1998}},
}

@inbook{53483,
  author       = {{Englisch, Brigitte}},
  booktitle    = {{Hochmittelalterliches Geschichtsbewußtsein im Spiegel nichthistoriographischer Quellen}},
  editor       = {{Hans-Werner, Goetz}},
  pages        = {{S. 117--129}},
  title        = {{{Zeitbewußtsein und systematische Zeitordnung in den Kalendern des frühen und hohen Mittelalters}}},
  year         = {{1998}},
}

@misc{18306,
  author       = {{Peckhaus, Volker}},
  booktitle    = {{zbMATH Open, Zbl. 0897.01002}},
  title        = {{{Gabriel, Gottfried/Kienzler, Wolfgang (eds.), Frege in Jena. Beiträge zur Spurensicherung. Tagungsbericht, Jena, Deutschland, 6.–7. Dezember 1996, Königshausen & Neumann: Würzburg 1997}}},
  year         = {{1998}},
}

@inproceedings{39496,
  abstract     = {{With the wide availability of network supporting hard-and software cooperative computer-based environments became extremely popular. A wide range of CSCW (Computer Supported Cooperative Work) tools with video conferencing, electronic mail, shared whiteboards, discussion forums, and shared information systems are already part of daily business. In contrast to the unstructured linear stream of information in electronic mails shared workspaces provide structured administration of electronic information like documents, voice, pictures, and movies. Popular examples of shared workspaces are BSCW (Basic Support for Cooperative Work), Hypernews, Lotus Notes, Alta Vista Forum, Lifelink, Microsoft Exchange and Webshare. Currently, all these systems are not flexible enough to get easily customized to the requirements of the individual application and user only supporting a limited set of predefined different views and functionality. This article introduces VIPspace (Visually Programmable Workspace). VIPspace can be easily customized to the individual needs of an user through VIPrule, a combination of a form- and icon-based visual programming language. VIPrule is based on an easy-to-use drag and drop paradigm. Direct manipulation via drag and drop allows easy access to local file systems as well as manipulation, exchange, and publication of shared multimedia documents. As VIPspace is implemented in Java it nicely integrates with other web-applications and provides a platform independent environment with a uniform graphical user interface.}},
  author       = {{Dücker, M. and Müller, Wolfgang and Rubart, Jessica}},
  booktitle    = {{ Proceedings. 1998 IEEE Symposium on Visual Languages }},
  isbn         = {{0-8186-8712-6}},
  keywords     = {{Collaborative work, Electronic mail, Computer networks, Video sharing, Videoconference, Discussion forums, Information systems, Streaming media, Motion pictures, Computer languages}},
  location     = {{Halifax, NS, Canada }},
  title        = {{{VIPspace - A Visually Programmable Shared Workspace}}},
  doi          = {{10.1109/VL.1998.706150}},
  year         = {{1998}},
}

@inproceedings{38400,
  author       = {{Karthaus, U and Noé, Reinhold}},
  booktitle    = {{1998 INTERNATIONAL ZURICH SEMINAR ON BROADBAND COMMUNICATIONS: ACCESSING, TRANSMISSION, NETWORKING}},
  isbn         = {{0-7803-3893-6}},
  pages        = {{159--164}},
  title        = {{{Influence of polarization on 30 GHz broadband radio channels}}},
  doi          = {{10.1109/IZSBC.1998.670260}},
  year         = {{1998}},
}

@inproceedings{39493,
  abstract     = {{This article presents the animated visual 3D programming language SAM (Solid Agents in Motion) for parallel systems specification and animation. A SAM program is a set of interacting agents synchronously exchanging messages. The agent's behaviour is specified by means of production rules with a condition and a sequence of actions each. Actions are linearly ordered and execute when matching a rule. In SAM, main syntactic objects like agents, rules, and messages are 3D. These objects can have an abstract and a concrete, solid 3D presentation. While the abstract representation is for programming and debugging, the concrete representation is for animated 3D end-user presentations. After outlining the concepts of SAM this article gives two programming examples of 3D micro worlds and an overview of the programming environment.}},
  author       = {{Geiger, Christian and Müller, Wolfgang and Rosenbach, W.}},
  booktitle    = {{Proceedings of the IEEE Symposium on Visual Languages}},
  isbn         = {{0-8186-8712-6}},
  keywords     = {{Animation, Computer languages, Solids, Concrete, Application software, Virtual reality, Programming profession, Switches, Visualization, Debugging}},
  location     = {{Halifax, Canada}},
  title        = {{{SAM - An Animated 3D Programming Language}}},
  doi          = {{10.1109/VL.1998.706167}},
  year         = {{1998}},
}

@inproceedings{56577,
  author       = {{Haarslev, Volker and Möller, Ralf and Turhan, Anni-Yasmin}},
  booktitle    = {{Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998}},
  editor       = {{Franconi, Enrico and Giacomo, Giuseppe De and MacGregor, Robert M. and Nutt, Werner and Welty, Christopher A.}},
  publisher    = {{CEUR-WS.org}},
  title        = {{{Implementing an ALCRP(D) ABox Reasoner - Progress Report}}},
  volume       = {{11}},
  year         = {{1998}},
}

@inproceedings{56576,
  author       = {{Haarslev, Volker and Möller, Ralf and Turhan, Anni-Yasmin}},
  booktitle    = {{Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998}},
  editor       = {{Franconi, Enrico and Giacomo, Giuseppe De and MacGregor, Robert M. and Nutt, Werner and Welty, Christopher A.}},
  publisher    = {{CEUR-WS.org}},
  title        = {{{HAM-ALC}}},
  volume       = {{11}},
  year         = {{1998}},
}

@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}},
}