@inproceedings{20953,
  author       = {{Eis, M. and Hahn, O. and Meschut, Gerson}},
  booktitle    = {{Tagungsband zur Werkstoffwoche 1998}},
  isbn         = {{ISBN 3-527-29943-2}},
  location     = {{Weinheim}},
  pages        = {{327--332}},
  publisher    = {{Wiley-VCH Verlag}},
  title        = {{{Kleben dünnwandiger Fahrzeugkomponenten aus Stahl}}},
  volume       = {{6}},
  year         = {{1999}},
}

@inproceedings{20954,
  author       = {{Hahn, O. and Meschut, Gerson and Koyro, M.}},
  booktitle    = {{Tagungsband zur Werkstoffwoche 1998}},
  isbn         = {{ISBN 3-527-29943-2}},
  location     = {{Weinheim}},
  pages        = {{357--360}},
  publisher    = {{Wiley-VCH Verlag}},
  title        = {{{Quasistationäre Meßmethode zur Ermittlung der Wärmeleitfähigkeit von Klebverbindungen}}},
  volume       = {{6}},
  year         = {{1999}},
}

@inproceedings{18747,
  abstract     = {{We present a new ( O(n) ) algorithm to compute good orders for the point set of a Delaunay triangulation of ( n ) points in the plane. Such a good order makes reconstruction in ( O(n) ) time with a simple algorithm possible. In contrast to the algorithm of Snoeyink and van Kreveld cite1, which is based on independent sets, our algorithm uses a breadth first search (BFS) to obtain these orders. Both approaches construct such orders by repeatedly removing a constant fraction of vertices from the current triangulation. The advantage of the BFS approach is that we can give significantly better bounds on the fraction of removed points in a phase of the algorithm. We can prove that a single phase of our algorithm removes at least ( frac13 ) of the points, even if we restrict the degree of the points (at the time they are removed) to 6. We implemented and compared both algorithms. Our algorithms is slightly faster and achieves about 15% better vertex data compression when using a simple variable length code to encode the differences between two consecutive vertices of the given order.}},
  author       = {{Sohler, Christian}},
  booktitle    = {{Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99)}},
  pages        = {{136--141}},
  title        = {{{Fast Reconstruction of Delaunay Triangulations}}},
  year         = {{1999}},
}

@book{18772,
  editor       = {{Saage, Richard and Seng, Eva- Maria}},
  pages        = {{295 S. Text mit 58 Abb.}},
  publisher    = {{Max Niemeyer}},
  title        = {{{Von der Geometrie zur Naturalisierung. Utopisches Denken im 18. Jahrhundert zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst. Hallesche Beiträge zur Europäischen Aufklärung Bd. 10}}},
  volume       = {{Bd. 10}},
  year         = {{1999}},
}

@inproceedings{18959,
  abstract     = {{We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path.<br><br>Recently it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2 n) time. Furthermore, it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for some constant c.<br><br>Our first contribution is a construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound. The computation takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S. We investigate the question whether Steiner points help. We answer this question affirmatively and prove Theta(kn) bounds on the number of Steiner points and on the number of edges in such spanners.}},
  author       = {{Lukovszki, Tamás}},
  booktitle    = {{Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS}},
  isbn         = {{9783540662792}},
  issn         = {{0302-9743}},
  pages        = {{193--204}},
  title        = {{{New Results on Fault Tolerant Geometric Spanners}}},
  doi          = {{10.1007/3-540-48447-7_20}},
  year         = {{1999}},
}

@inbook{19201,
  author       = {{Seng, Eva- Maria}},
  booktitle    = {{Jahrbuch der Akademie der Wissenschaften zu Göttingen 1999}},
  pages        = {{54--62}},
  title        = {{{Kirchenbau und Politik im 19. Jahrhundert}}},
  year         = {{1999}},
}

@inbook{19203,
  author       = {{Seng, Eva- Maria and Saage, Richard}},
  booktitle    = {{Von der Geometrie zur Naturalisierung. Utopisches Denken im 18. Jahrhundert zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst. Hallesche Beiträge zur Europäischen Aufklärung Bd. 10,}},
  editor       = {{Seng, Eva-Maria and Saage, Richard}},
  pages        = {{VII--XI}},
  title        = {{{Einleitung}}},
  volume       = {{10}},
  year         = {{1999}},
}

@inproceedings{8122,
  author       = {{Krauter, Stefan}},
  booktitle    = {{Proceedings of Workshop Energias Alternativas para Produção de Calor, Frio e Geração e Conservação de Energia Elétrica, UFSC, Florianópolis, Santa Catarina (Brasilien), 6.–9. Dezember 1999}},
  title        = {{{Híbridos Termo/Solares Fotovoltaicos (Combined Solar–Thermal/Photovoltaic Systems)}}},
  year         = {{1999}},
}

@inproceedings{8323,
  author       = {{Corradini, Andrea and Große-Rhode, Martin and Heckel, Reiko}},
  booktitle    = {{Selected papers of the 13th International Workshop on Recent Trends in Algebraic Development Techniques (WADT 1998), Lisbon (Portugal)}},
  pages        = {{92--106}},
  publisher    = {{Springer}},
  title        = {{{An Algebra of Graph Derivations using Finite (co-) limit Double Theories}}},
  doi          = {{http://dx.doi.org/10.1007/3-540-48483-3_7}},
  volume       = {{1589}},
  year         = {{1999}},
}

@inbook{17053,
  author       = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}},
  booktitle    = {{Algorithms - ESA’ 99}},
  isbn         = {{9783540662518}},
  issn         = {{0302-9743}},
  title        = {{{Provably Good and Practical Strategies for Non-uniform Data Management in Networks}}},
  doi          = {{10.1007/3-540-48481-7_9}},
  year         = {{1999}},
}

@inproceedings{13608,
  author       = {{Eisenring, Michael and Platzner, Marco and Thiele, Lothar}},
  booktitle    = {{Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL)}},
  isbn         = {{9783540664574}},
  issn         = {{0302-9743}},
  pages        = {{205--214}},
  publisher    = {{Springer}},
  title        = {{{Communication Synthesis for Reconfigurable Embedded Systems}}},
  doi          = {{10.1007/978-3-540-48302-1_21}},
  volume       = {{1673}},
  year         = {{1999}},
}

@inbook{34938,
  author       = {{Süßmann, Johannes}},
  booktitle    = {{Andreas Riem. Ein Europäer aus der Pfalz}},
  editor       = {{Welker, Karl H.L}},
  isbn         = {{978-3-7995-4906-6}},
  pages        = {{107–118}},
  publisher    = {{Jan Thorbecke}},
  title        = {{{Andreas Riem und die Französische Revolution}}},
  volume       = {{6}},
  year         = {{1999}},
}

@inbook{36160,
  author       = {{Kamp, Hermann}},
  booktitle    = {{La splendeur des Rolin. Un mécénat privé à la cour de Bourgogne}},
  editor       = {{Maurice-Chabard, Brigitte}},
  pages        = {{67--88}},
  title        = {{{Nicolas Rolin, le salut de l'âme et l'imitation du duc}}},
  year         = {{1999}},
}

@book{29822,
  author       = {{Hartung, Olaf}},
  isbn         = {{3814206347}},
  pages        = {{282}},
  publisher    = {{bis}},
  title        = {{{Pädagogische Überlegungen zu einer Geschichtsdidaktik des Reisens}}},
  year         = {{1999}},
}

@inbook{53484,
  author       = {{Englisch, Brigitte}},
  booktitle    = {{Artes im Mittelalter}},
  editor       = {{Schaefer, Ursula}},
  title        = {{{Artes und Weltsicht bei Roger Bacon}}},
  year         = {{1999}},
}

@inproceedings{38324,
  author       = {{Sandel, D and Hinz, S and Yoshida-Dierolf, M and Mirvoda, V and Noé, Reinhold and Feise, G and Herrmann, H and Ricken, R and Sohler, W and Suche, H and Wehrmann, F and Wessel, R}},
  booktitle    = {{ECIO’99: 9TH EUROPEAN CONFERENCE ON INTEGRATED OPTICS AND TECHNICAL EXHIBITION}},
  pages        = {{W17--W19}},
  title        = {{{Integrated-optical polarization mode dispersion compensation for 6-ps, 40-Gb/s pulses}}},
  year         = {{1999}},
}

@inproceedings{38374,
  author       = {{Sandel, D and Hinz, S and Yoshida-Dierolf, M and Mirvoda, V and Noé, Reinhold and Feise, G and Herrmann, H and Ricken, R and Sohler, W and Suche, H and Wehrmann, F and Wessel, R}},
  booktitle    = {{ECIO’99: 9TH EUROPEAN CONFERENCE ON INTEGRATED OPTICS AND TECHNICAL EXHIBITION}},
  pages        = {{W17--W19}},
  title        = {{{Integrated-optical polarization mode dispersion compensation for 6-ps, 40-Gb/s pulses}}},
  year         = {{1999}},
}

@article{40192,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>If<jats:italic>G</jats:italic>is a closed subgroup of a commutative hypergroup<jats:italic>K</jats:italic>, then the coset space<jats:italic>K</jats:italic>/<jats:italic>G</jats:italic>carries a quotient hypergroup structure. In this paper, we study related convolution structures on<jats:italic>K</jats:italic>/<jats:italic>G</jats:italic>coming fromdeformations of the quotient hypergroup structure by certain functions on<jats:italic>K</jats:italic>which we call partial characters with respect to<jats:italic>G</jats:italic>. They are usually not probability-preserving, but lead to so-called signed hypergroups on<jats:italic>K</jats:italic>/<jats:italic>G</jats:italic>. A first example is provided by the Laguerre convolution on [0, ∞[, which is interpreted as a signed quotient hypergroup convolution derived from the Heisenberg group. Moreover, signed hypergroups associated with the Gelfand pair (<jats:italic>U</jats:italic>(<jats:italic>n</jats:italic>, 1),<jats:italic>U</jats:italic>(<jats:italic>n</jats:italic>)) are discussed.</jats:p>}},
  author       = {{Rösler, Margit and Voit, Michael}},
  issn         = {{0008-414X}},
  journal      = {{Canadian Journal of Mathematics}},
  keywords     = {{General Mathematics}},
  number       = {{1}},
  pages        = {{96--116}},
  publisher    = {{Canadian Mathematical Society}},
  title        = {{{Partial Characters and Signed Quotient Hypergroups}}},
  doi          = {{10.4153/cjm-1999-006-6}},
  volume       = {{51}},
  year         = {{1999}},
}

@misc{43544,
  author       = {{Schroeter-Wittke, Harald and Osteroth, Martin}},
  publisher    = {{QueenGames}},
  title        = {{{Mückenstich - ein flottes Kartenspiel für 3-6 Spieler}}},
  year         = {{1999}},
}

@inproceedings{44273,
  abstract     = {{It is demonstrated that the optical response of semiconductor systems is influenced by various interactions. In detail, it is shown that meaningful calculations of optical nonlinearities in semiconductor structures require to microscopically include Coulomb-induced many-body carrier-correlations. Some distinct signatures induced by correlations in nonlinear optical signals are presented and discussed.}},
  author       = {{Meier, Torsten and Jahnke, F. and Koch, S.W.}},
  booktitle    = {{Technical Digest. CLEO/Pacific Rim'99. Pacific Rim Conference on Lasers and Electro-Optics}},
  isbn         = {{0-7803-5661-6}},
  location     = {{Seoul, Korea (South)}},
  pages        = {{632--633}},
  publisher    = {{IEEE}},
  title        = {{{Optical nonlinearities in semiconductor quantum-well and microcavity structures}}},
  doi          = {{10.1109/CLEOPR.1999.817755}},
  volume       = {{3}},
  year         = {{1999}},
}