[{"date_updated":"2022-01-06T06:59:07Z","date_created":"2018-06-14T07:35:45Z","author":[{"last_name":"Gehrke","full_name":"Gehrke, Thomas","first_name":"Thomas"},{"full_name":"Huhn, Michaela","last_name":"Huhn","first_name":"Michaela"},{"full_name":"Rensink, Arend","last_name":"Rensink","first_name":"Arend"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"title":"An Algebraic Semantics for Message Sequence Chart Documents","year":"1998","page":"3--18","citation":{"chicago":"Gehrke, Thomas, Michaela Huhn, Arend Rensink, and Heike Wehrheim. “An Algebraic Semantics for Message Sequence Chart Documents.” In <i>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</i>, edited by Stanislaw Budkowski, Ana R. Cavalli, and Elie Najm, 3--18. {IFIP} Conference Proceedings, 1998.","ieee":"T. Gehrke, M. Huhn, A. Rensink, and H. Wehrheim, “An Algebraic Semantics for Message Sequence Chart Documents,” in <i>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</i>, 1998, pp. 3--18.","ama":"Gehrke T, Huhn M, Rensink A, Wehrheim H. An Algebraic Semantics for Message Sequence Chart Documents. In: Budkowski S, R. Cavalli A, Najm E, eds. <i>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</i>. {IFIP} Conference Proceedings. ; 1998:3--18.","apa":"Gehrke, T., Huhn, M., Rensink, A., &#38; Wehrheim, H. (1998). An Algebraic Semantics for Message Sequence Chart Documents. In S. Budkowski, A. R. Cavalli, &#38; E. Najm (Eds.), <i>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</i> (pp. 3--18).","bibtex":"@inproceedings{Gehrke_Huhn_Rensink_Wehrheim_1998, series={{IFIP} Conference Proceedings}, title={An Algebraic Semantics for Message Sequence Chart Documents}, 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}, author={Gehrke, Thomas and Huhn, Michaela and Rensink, Arend and Wehrheim, Heike}, editor={Budkowski, Stanislaw and R. Cavalli, Ana and Najm, ElieEditors}, year={1998}, pages={3--18}, collection={{IFIP} Conference Proceedings} }","mla":"Gehrke, Thomas, et al. “An Algebraic Semantics for Message Sequence Chart Documents.” <i>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</i>, edited by Stanislaw Budkowski et al., 1998, pp. 3--18.","short":"T. Gehrke, M. Huhn, A. Rensink, H. Wehrheim, in: S. Budkowski, A. R. Cavalli, E. Najm (Eds.), 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, 1998, pp. 3--18."},"_id":"3256","department":[{"_id":"77"}],"user_id":"29719","series_title":"{IFIP} Conference Proceedings","publication":"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","type":"conference","editor":[{"last_name":"Budkowski","full_name":"Budkowski, Stanislaw","first_name":"Stanislaw"},{"first_name":"Ana","full_name":"R. Cavalli, Ana","last_name":"R. Cavalli"},{"first_name":"Elie","last_name":"Najm","full_name":"Najm, Elie"}],"status":"public"},{"_id":"3257","user_id":"29719","series_title":"Lecture Notes in Computer Science","department":[{"_id":"77"}],"editor":[{"first_name":"Vikraman","full_name":"Arvind, Vikraman","last_name":"Arvind"},{"last_name":"Ramanujam","full_name":"Ramanujam, Ramaswamy","first_name":"Ramaswamy"}],"status":"public","type":"conference","publication":"Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings","title":"Partial Order Reductions for Bisimulation Checking","doi":"10.1007/978-3-540-49382-2_26","date_updated":"2022-01-06T06:59:07Z","author":[{"first_name":"Michaela","last_name":"Huhn","full_name":"Huhn, Michaela"},{"first_name":"Peter","last_name":"Niebert","full_name":"Niebert, Peter"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2018-06-14T07:37:32Z","year":"1998","citation":{"mla":"Huhn, Michaela, et al. “Partial Order Reductions for Bisimulation Checking.” <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>, edited by Vikraman Arvind and Ramaswamy Ramanujam, 1998, pp. 271--282, doi:<a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">10.1007/978-3-540-49382-2_26</a>.","short":"M. Huhn, P. Niebert, H. Wehrheim, in: V. Arvind, R. Ramanujam (Eds.), Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings, 1998, pp. 271--282.","bibtex":"@inproceedings{Huhn_Niebert_Wehrheim_1998, series={Lecture Notes in Computer Science}, title={Partial Order Reductions for Bisimulation Checking}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">10.1007/978-3-540-49382-2_26</a>}, booktitle={Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings}, author={Huhn, Michaela and Niebert, Peter and Wehrheim, Heike}, editor={Arvind, Vikraman and Ramanujam, RamaswamyEditors}, year={1998}, pages={271--282}, collection={Lecture Notes in Computer Science} }","apa":"Huhn, M., Niebert, P., &#38; Wehrheim, H. (1998). Partial Order Reductions for Bisimulation Checking. In V. Arvind &#38; R. Ramanujam (Eds.), <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i> (pp. 271--282). <a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">https://doi.org/10.1007/978-3-540-49382-2_26</a>","ama":"Huhn M, Niebert P, Wehrheim H. Partial Order Reductions for Bisimulation Checking. In: Arvind V, Ramanujam R, eds. <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>. Lecture Notes in Computer Science. ; 1998:271--282. doi:<a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">10.1007/978-3-540-49382-2_26</a>","ieee":"M. Huhn, P. Niebert, and H. Wehrheim, “Partial Order Reductions for Bisimulation Checking,” in <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>, 1998, pp. 271--282.","chicago":"Huhn, Michaela, Peter Niebert, and Heike Wehrheim. “Partial Order Reductions for Bisimulation Checking.” In <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>, edited by Vikraman Arvind and Ramaswamy Ramanujam, 271--282. Lecture Notes in Computer Science, 1998. <a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">https://doi.org/10.1007/978-3-540-49382-2_26</a>."},"page":"271--282"},{"citation":{"ama":"Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg; 1998. doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_14\">10.1007/3-540-68530-8_14</a>","chicago":"Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” In <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg, 1998. <a href=\"https://doi.org/10.1007/3-540-68530-8_14\">https://doi.org/10.1007/3-540-68530-8_14</a>.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in <i>Algorithms — ESA’ 98</i>, Berlin, Heidelberg, 1998.","bibtex":"@inbook{Fischer_Lukovszki_Ziegler_1998, place={Berlin, Heidelberg}, title={Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time}, DOI={<a href=\"https://doi.org/10.1007/3-540-68530-8_14\">10.1007/3-540-68530-8_14</a>}, booktitle={Algorithms — ESA’ 98}, author={Fischer, Matthias and Lukovszki, Tamás and Ziegler, Martin}, year={1998} }","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.","mla":"Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” <i>Algorithms — ESA’ 98</i>, 1998, doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_14\">10.1007/3-540-68530-8_14</a>.","apa":"Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-68530-8_14\">https://doi.org/10.1007/3-540-68530-8_14</a>"},"year":"1998","place":"Berlin, Heidelberg","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540648482","9783540685302"]},"doi":"10.1007/3-540-68530-8_14","title":"Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time","author":[{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_created":"2020-07-27T11:42:54Z","date_updated":"2022-01-06T06:53:11Z","file":[{"date_created":"2020-08-27T11:20:38Z","creator":"koala","date_updated":"2020-08-27T11:20:38Z","file_name":"hni-id-854.pdf","file_id":"18442","access_level":"closed","file_size":266070,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"lang":"eng","text":"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.\r\n"}],"type":"book_chapter","publication":"Algorithms — ESA’ 98","language":[{"iso":"eng"}],"file_date_updated":"2020-08-27T11:20:38Z","ddc":["000"],"user_id":"15415","department":[{"_id":"63"}],"_id":"17412"},{"_id":"19206","department":[{"_id":"443"}],"user_id":"21240","extern":"1","language":[{"iso":"ger"}],"publication":"Bürgersinn und Kritik, Festschrift für Udo Bermbach zum 60. Geburtstag","type":"book_chapter","editor":[{"full_name":"Greven, Michael Th.","last_name":"Greven","first_name":"Michael Th."},{"first_name":"Herfried","full_name":"Münkler, Herfried","last_name":"Münkler"},{"first_name":"Rainer","full_name":"Schmalz-Bruns, Rainer","last_name":"Schmalz-Bruns"}],"status":"public","date_updated":"2022-01-06T06:54:00Z","date_created":"2020-09-09T12:53:41Z","author":[{"last_name":"Seng","full_name":"Seng, Eva- Maria","id":"499","first_name":"Eva- Maria"},{"full_name":"Saage, Richard","last_name":"Saage","first_name":"Richard"}],"title":"Naturalisierte Utopien zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst","place":"Baden Baden","year":"1998","page":"207-238","citation":{"apa":"Seng, E.-M., &#38; Saage, R. (1998). Naturalisierte Utopien zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst. In M. T. Greven, H. Münkler, &#38; R. Schmalz-Bruns (Eds.), <i>Bürgersinn und Kritik, Festschrift für Udo Bermbach zum 60. Geburtstag</i> (pp. 207–238). Baden Baden.","short":"E.-M. Seng, R. Saage, in: M.T. Greven, H. Münkler, R. Schmalz-Bruns (Eds.), Bürgersinn und Kritik, Festschrift für Udo Bermbach zum 60. Geburtstag, Baden Baden, 1998, pp. 207–238.","bibtex":"@inbook{Seng_Saage_1998, place={Baden Baden}, title={Naturalisierte Utopien zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst}, booktitle={Bürgersinn und Kritik, Festschrift für Udo Bermbach zum 60. Geburtstag}, author={Seng, Eva- Maria and Saage, Richard}, editor={Greven, Michael Th. and Münkler, Herfried and Schmalz-Bruns, RainerEditors}, year={1998}, pages={207–238} }","mla":"Seng, Eva-Maria, and Richard Saage. “Naturalisierte Utopien zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst.” <i>Bürgersinn und Kritik, Festschrift für Udo Bermbach zum 60. Geburtstag</i>, edited by Michael Th. Greven et al., 1998, pp. 207–38.","ieee":"E.-M. Seng and R. Saage, “Naturalisierte Utopien zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst,” in <i>Bürgersinn und Kritik, Festschrift für Udo Bermbach zum 60. Geburtstag</i>, M. T. Greven, H. Münkler, and R. Schmalz-Bruns, Eds. Baden Baden, 1998, pp. 207–238.","chicago":"Seng, Eva- Maria, and Richard Saage. “Naturalisierte Utopien zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst.” In <i>Bürgersinn und Kritik, Festschrift für Udo Bermbach zum 60. Geburtstag</i>, edited by Michael Th. Greven, Herfried Münkler, and Rainer Schmalz-Bruns, 207–38. Baden Baden, 1998.","ama":"Seng E-M, Saage R. Naturalisierte Utopien zwischen literarischer Fiktion und frühneuzeitlicher Gartenkunst. In: Greven MT, Münkler H, Schmalz-Bruns R, eds. <i>Bürgersinn und Kritik, Festschrift für Udo Bermbach zum 60. Geburtstag</i>. Baden Baden; 1998:207-238."}},{"user_id":"68518","department":[{"_id":"157"}],"_id":"20746","language":[{"iso":"eng"}],"type":"conference","publication":"Tagungsband zum 6. Paderborner Symposium Fügetechnik","status":"public","date_created":"2020-12-15T13:25:20Z","author":[{"first_name":"O.","full_name":"Hahn, O.","last_name":"Hahn"},{"first_name":"M.","last_name":"Eis","full_name":"Eis, M."},{"first_name":"Gerson","id":"32056","full_name":"Meschut, Gerson","orcid":"0000-0002-2763-1246","last_name":"Meschut"}],"date_updated":"2022-01-06T06:54:35Z","conference":{"start_date":"1998-11-05","name":"6. Paderborner Symposium Fügetechnik: Mechanisches Fügen und Kleben - Fügetechniken für den eigenschaftsoptimierten Leichtbau","location":"Paderborn","end_date":"1998-11-06"},"title":"Kleben abzeichnungsfreier Leichtbaustrukturen durch Prozeß-, Gestalt- und Klebstoffoptimierung","publication_identifier":{"isbn":["ISBN 3-9805447-1-0"]},"citation":{"apa":"Hahn, O., Eis, M., &#38; Meschut, G. (1998). Kleben abzeichnungsfreier Leichtbaustrukturen durch Prozeß-, Gestalt- und Klebstoffoptimierung. In <i>Tagungsband zum 6. Paderborner Symposium Fügetechnik</i> (pp. 210–218). Paderborn.","bibtex":"@inproceedings{Hahn_Eis_Meschut_1998, title={Kleben abzeichnungsfreier Leichtbaustrukturen durch Prozeß-, Gestalt- und Klebstoffoptimierung}, booktitle={Tagungsband zum 6. Paderborner Symposium Fügetechnik}, author={Hahn, O. and Eis, M. and Meschut, Gerson}, year={1998}, pages={210–218} }","short":"O. Hahn, M. Eis, G. Meschut, in: Tagungsband Zum 6. Paderborner Symposium Fügetechnik, 1998, pp. 210–218.","mla":"Hahn, O., et al. “Kleben Abzeichnungsfreier Leichtbaustrukturen Durch Prozeß-, Gestalt- Und Klebstoffoptimierung.” <i>Tagungsband Zum 6. Paderborner Symposium Fügetechnik</i>, 1998, pp. 210–18.","ama":"Hahn O, Eis M, Meschut G. Kleben abzeichnungsfreier Leichtbaustrukturen durch Prozeß-, Gestalt- und Klebstoffoptimierung. In: <i>Tagungsband Zum 6. Paderborner Symposium Fügetechnik</i>. ; 1998:210-218.","ieee":"O. Hahn, M. Eis, and G. Meschut, “Kleben abzeichnungsfreier Leichtbaustrukturen durch Prozeß-, Gestalt- und Klebstoffoptimierung,” in <i>Tagungsband zum 6. Paderborner Symposium Fügetechnik</i>, Paderborn, 1998, pp. 210–218.","chicago":"Hahn, O., M. Eis, and Gerson Meschut. “Kleben Abzeichnungsfreier Leichtbaustrukturen Durch Prozeß-, Gestalt- Und Klebstoffoptimierung.” In <i>Tagungsband Zum 6. Paderborner Symposium Fügetechnik</i>, 210–18, 1998."},"page":"210-218","year":"1998"},{"language":[{"iso":"eng"}],"_id":"2185","series_title":"Lecture Notes in Computer Science","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"status":"public","type":"book","title":"Universal Routing Strategies for Interconnection Networks","doi":"10.1007/BFb0052928","date_updated":"2022-01-06T06:55:17Z","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2018-04-03T09:38:18Z","volume":1390,"year":"1998","citation":{"chicago":"Scheideler, Christian. <i>Universal Routing Strategies for Interconnection Networks</i>. Vol. 1390. Lecture Notes in Computer Science, 1998. <a href=\"https://doi.org/10.1007/BFb0052928\">https://doi.org/10.1007/BFb0052928</a>.","ieee":"C. Scheideler, <i>Universal Routing Strategies for Interconnection Networks</i>, vol. 1390. 1998.","ama":"Scheideler C. <i>Universal Routing Strategies for Interconnection Networks</i>. Vol 1390.; 1998. doi:<a href=\"https://doi.org/10.1007/BFb0052928\">10.1007/BFb0052928</a>","short":"C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.","bibtex":"@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal Routing Strategies for Interconnection Networks}, volume={1390}, DOI={<a href=\"https://doi.org/10.1007/BFb0052928\">10.1007/BFb0052928</a>}, author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer Science} }","mla":"Scheideler, Christian. <i>Universal Routing Strategies for Interconnection Networks</i>. Vol. 1390, 1998, doi:<a href=\"https://doi.org/10.1007/BFb0052928\">10.1007/BFb0052928</a>.","apa":"Scheideler, C. (1998). <i>Universal Routing Strategies for Interconnection Networks</i> (Vol. 1390). <a href=\"https://doi.org/10.1007/BFb0052928\">https://doi.org/10.1007/BFb0052928</a>"},"intvolume":"      1390","publication_identifier":{"isbn":["978-3-540-69792-3"]}},{"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","year":"1998","intvolume":"       196","page":"181-200","citation":{"apa":"Meyer auf der Heide, F., Schröder, K., &#38; Schwarze, F. (1998). Routing on networks of optical crossbars. <i>Theoretical Computer Science</i>, <i>196</i>, 181–200. <a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">https://doi.org/10.1016/s0304-3975(97)86791-6</a>","short":"F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.","mla":"Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.” <i>Theoretical Computer Science</i>, vol. 196, 1998, pp. 181–200, doi:<a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">10.1016/s0304-3975(97)86791-6</a>.","bibtex":"@article{Meyer auf der Heide_Schröder_Schwarze_1998, title={Routing on networks of optical crossbars}, volume={196}, DOI={<a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">10.1016/s0304-3975(97)86791-6</a>}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm and Schröder, Klaus and Schwarze, Frank}, year={1998}, pages={181–200} }","ieee":"F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” <i>Theoretical Computer Science</i>, vol. 196, pp. 181–200, 1998.","chicago":"Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing on Networks of Optical Crossbars.” <i>Theoretical Computer Science</i> 196 (1998): 181–200. <a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">https://doi.org/10.1016/s0304-3975(97)86791-6</a>.","ama":"Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical crossbars. <i>Theoretical Computer Science</i>. 1998;196:181-200. doi:<a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">10.1016/s0304-3975(97)86791-6</a>"},"date_updated":"2022-01-06T06:52:52Z","volume":196,"author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Schröder","full_name":"Schröder, Klaus","first_name":"Klaus"},{"full_name":"Schwarze, Frank","last_name":"Schwarze","first_name":"Frank"}],"date_created":"2020-04-14T12:20:57Z","title":"Routing on networks of optical crossbars","doi":"10.1016/s0304-3975(97)86791-6","publication":"Theoretical Computer Science","type":"journal_article","status":"public","_id":"16503","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","year":"1998","page":"175-203","citation":{"ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. <i>Theoretical Computer Science</i>. 1998:175-203. doi:<a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">10.1016/s0304-3975(98)00020-6</a>","ieee":"A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” <i>Theoretical Computer Science</i>, pp. 175–203, 1998.","chicago":"Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” <i>Theoretical Computer Science</i>, 1998, 175–203. <a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">https://doi.org/10.1016/s0304-3975(98)00020-6</a>.","bibtex":"@article{Bäumker_Dittrich_Meyer auf der Heide_1998, title={Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model}, DOI={<a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">10.1016/s0304-3975(98)00020-6</a>}, journal={Theoretical Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1998}, pages={175–203} }","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.","mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” <i>Theoretical Computer Science</i>, 1998, pp. 175–203, doi:<a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">10.1016/s0304-3975(98)00020-6</a>.","apa":"Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. <i>Theoretical Computer Science</i>, 175–203. <a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">https://doi.org/10.1016/s0304-3975(98)00020-6</a>"},"date_updated":"2022-01-06T06:52:52Z","date_created":"2020-04-14T12:36:47Z","author":[{"first_name":"Armin","full_name":"Bäumker, Armin","last_name":"Bäumker"},{"full_name":"Dittrich, Wolfgang","last_name":"Dittrich","first_name":"Wolfgang"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model","doi":"10.1016/s0304-3975(98)00020-6","publication":"Theoretical Computer Science","type":"journal_article","status":"public","_id":"16504","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2020-08-30T16:19:49Z","date_created":"2020-08-28T21:59:59Z","creator":"schindlm","file_size":226847,"description":"© 1998 IOP Publishing Ltd","title":"Assessment of the GW approximation using Hubbard chains","file_name":"Thomas_J_Pollehn_1998_J._Phys. _Condens._Matter_10_011.pdf","file_id":"18625","access_level":"closed"}],"abstract":[{"lang":"eng","text":"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."}],"publication":"Journal of Physics: Condensed Matter","language":[{"iso":"eng"}],"ddc":["530"],"external_id":{"isi":["000072104000011"],"arxiv":["cond-mat/9711120"]},"year":"1998","issue":"6","quality_controlled":"1","title":"Assessment of the GW approximation using Hubbard chains","date_created":"2020-08-28T21:58:46Z","publisher":"IOP Publishing","status":"public","type":"journal_article","file_date_updated":"2020-08-30T16:19:49Z","extern":"1","article_type":"original","isi":"1","user_id":"458","_id":"18624","intvolume":"        10","page":"1273-1283","citation":{"apa":"Pollehn, T. J., Schindlmayr, A., &#38; Godby, R. W. (1998). Assessment of the GW approximation using Hubbard chains. <i>Journal of Physics: Condensed Matter</i>, <i>10</i>(6), 1273–1283. <a href=\"https://doi.org/10.1088/0953-8984/10/6/011\">https://doi.org/10.1088/0953-8984/10/6/011</a>","mla":"Pollehn, Thomas Joachim, et al. “Assessment of the GW Approximation Using Hubbard Chains.” <i>Journal of Physics: Condensed Matter</i>, vol. 10, no. 6, IOP Publishing, 1998, pp. 1273–83, doi:<a href=\"https://doi.org/10.1088/0953-8984/10/6/011\">10.1088/0953-8984/10/6/011</a>.","short":"T.J. Pollehn, A. Schindlmayr, R.W. Godby, Journal of Physics: Condensed Matter 10 (1998) 1273–1283.","bibtex":"@article{Pollehn_Schindlmayr_Godby_1998, title={Assessment of the GW approximation using Hubbard chains}, volume={10}, DOI={<a href=\"https://doi.org/10.1088/0953-8984/10/6/011\">10.1088/0953-8984/10/6/011</a>}, number={6}, journal={Journal of Physics: Condensed Matter}, publisher={IOP Publishing}, author={Pollehn, Thomas Joachim and Schindlmayr, Arno and Godby, Rex William}, year={1998}, pages={1273–1283} }","ama":"Pollehn TJ, Schindlmayr A, Godby RW. Assessment of the GW approximation using Hubbard chains. <i>Journal of Physics: Condensed Matter</i>. 1998;10(6):1273-1283. doi:<a href=\"https://doi.org/10.1088/0953-8984/10/6/011\">10.1088/0953-8984/10/6/011</a>","chicago":"Pollehn, Thomas Joachim, Arno Schindlmayr, and Rex William Godby. “Assessment of the GW Approximation Using Hubbard Chains.” <i>Journal of Physics: Condensed Matter</i> 10, no. 6 (1998): 1273–83. <a href=\"https://doi.org/10.1088/0953-8984/10/6/011\">https://doi.org/10.1088/0953-8984/10/6/011</a>.","ieee":"T. J. Pollehn, A. Schindlmayr, and R. W. Godby, “Assessment of the GW approximation using Hubbard chains,” <i>Journal of Physics: Condensed Matter</i>, vol. 10, no. 6, pp. 1273–1283, 1998, doi: <a href=\"https://doi.org/10.1088/0953-8984/10/6/011\">10.1088/0953-8984/10/6/011</a>."},"has_accepted_license":"1","publication_identifier":{"eissn":["1361-648X"],"issn":["0953-8984"]},"publication_status":"published","doi":"10.1088/0953-8984/10/6/011","volume":10,"author":[{"full_name":"Pollehn, Thomas Joachim","last_name":"Pollehn","first_name":"Thomas Joachim"},{"first_name":"Arno","last_name":"Schindlmayr","orcid":"0000-0002-4855-071X","id":"458","full_name":"Schindlmayr, Arno"},{"first_name":"Rex William","full_name":"Godby, Rex William","last_name":"Godby"}],"date_updated":"2022-11-11T06:58:18Z"},{"publication":"Archiv für Sozialgeschichte","type":"review","status":"public","_id":"34769","department":[{"_id":"446"}],"user_id":"16220","language":[{"iso":"ger"}],"extern":"1","publication_status":"published","year":"1998","page":"679–682","intvolume":"        38","citation":{"bibtex":"@article{Süßmann_1998, 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}, journal={Archiv für Sozialgeschichte}, author={Süßmann, Johannes}, year={1998}, pages={679–682} }","short":"J. Süßmann, Archiv für Sozialgeschichte 38 (1998) 679–682.","mla":"Süßmann, Johannes. “[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.” <i>Archiv für Sozialgeschichte</i>, vol. 38, 1998, pp. 679–682.","apa":"Süßmann, J. (1998). [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. In <i>Archiv für Sozialgeschichte</i> (Vol. 38, pp. 679–682).","ieee":"J. Süßmann, “[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,” <i>Archiv für Sozialgeschichte</i>, vol. 38. pp. 679–682, 1998.","chicago":"Süßmann, Johannes. “[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.” <i>Archiv für Sozialgeschichte</i>, 1998.","ama":"Süßmann J. [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. <i>Archiv für Sozialgeschichte</i>. 1998;38:679–682."},"date_updated":"2022-12-28T21:27:17Z","oa":"1","volume":38,"author":[{"first_name":"Johannes","last_name":"Süßmann","orcid":"0000-0001-5716-0863","full_name":"Süßmann, Johannes","id":"16220"}],"date_created":"2022-12-21T17:22:00Z","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","main_file_link":[{"url":"https://library.fes.de/jportal/servlets/MCRFileNodeServlet/jportal_derivate_00022392/afs-1998-679.pdf","open_access":"1"}]},{"status":"public","editor":[{"full_name":"Melville, Gert","last_name":"Melville","first_name":"Gert"},{"first_name":"Peter","full_name":"von Moos, Peter","last_name":"von Moos"}],"type":"book_chapter","publication":"Das Öffentliche und Private in der Vormoderne","language":[{"iso":"ger"}],"extern":"1","user_id":"125","department":[{"_id":"6"}],"_id":"36166","citation":{"mla":"Kamp, Hermann. “Commynes und der Umgang mit der Öffentlichkeit im 15. Jahrhundert.” <i>Das Öffentliche und Private in der Vormoderne</i>, edited by Gert Melville and Peter von Moos, 1998, pp. 687–714.","bibtex":"@inbook{Kamp_1998, place={Köln – Weimar – Wien}, title={Commynes und der Umgang mit der Öffentlichkeit im 15. Jahrhundert}, booktitle={Das Öffentliche und Private in der Vormoderne}, author={Kamp, Hermann}, editor={Melville, Gert and von Moos, Peter}, year={1998}, pages={687–714} }","short":"H. Kamp, in: G. Melville, P. von Moos (Eds.), Das Öffentliche und Private in der Vormoderne, Köln – Weimar – Wien, 1998, pp. 687–714.","apa":"Kamp, H. (1998). Commynes und der Umgang mit der Öffentlichkeit im 15. Jahrhundert. In G. Melville &#38; P. von Moos (Eds.), <i>Das Öffentliche und Private in der Vormoderne</i> (pp. 687–714).","ama":"Kamp H. Commynes und der Umgang mit der Öffentlichkeit im 15. Jahrhundert. In: Melville G, von Moos P, eds. <i>Das Öffentliche und Private in der Vormoderne</i>. ; 1998:687-714.","chicago":"Kamp, Hermann. “Commynes und der Umgang mit der Öffentlichkeit im 15. Jahrhundert.” In <i>Das Öffentliche und Private in der Vormoderne</i>, edited by Gert Melville and Peter von Moos, 687–714. Köln – Weimar – Wien, 1998.","ieee":"H. Kamp, “Commynes und der Umgang mit der Öffentlichkeit im 15. Jahrhundert,” in <i>Das Öffentliche und Private in der Vormoderne</i>, G. Melville and P. von Moos, Eds. Köln – Weimar – Wien, 1998, pp. 687–714."},"page":"687-714","place":"Köln – Weimar – Wien","year":"1998","publication_status":"published","title":"Commynes und der Umgang mit der Öffentlichkeit im 15. Jahrhundert","date_created":"2023-01-11T13:46:38Z","author":[{"full_name":"Kamp, Hermann","id":"125","last_name":"Kamp","first_name":"Hermann"}],"date_updated":"2023-01-11T18:31:38Z"},{"author":[{"full_name":"Kamp, Hermann","id":"125","last_name":"Kamp","first_name":"Hermann"}],"date_created":"2023-01-11T13:44:33Z","date_updated":"2023-01-11T18:35:11Z","title":"Moderne Herrschaftsformen vor der Moderne: das Beispiel Burgund","publication_status":"published","citation":{"bibtex":"@inbook{Kamp_1998, place={Darmstadt }, title={Moderne Herrschaftsformen vor der Moderne: das Beispiel Burgund}, booktitle={Menschen im Schatten der Kathedrale. Neuigkeiten aus dem Mittelalter}, author={Kamp, Hermann}, editor={Althoff, Gerd and Goetz, Hans-Werner and Schubert, Ernst}, year={1998}, pages={99–110} }","mla":"Kamp, Hermann. “Moderne Herrschaftsformen vor der Moderne: das Beispiel Burgund.” <i>Menschen im Schatten der Kathedrale. Neuigkeiten aus dem Mittelalter</i>, edited by Gerd Althoff et al., 1998, pp. 99–110.","short":"H. Kamp, in: G. Althoff, H.-W. Goetz, E. Schubert (Eds.), Menschen im Schatten der Kathedrale. Neuigkeiten aus dem Mittelalter, Darmstadt , 1998, pp. 99–110.","apa":"Kamp, H. (1998). Moderne Herrschaftsformen vor der Moderne: das Beispiel Burgund. In G. Althoff, H.-W. Goetz, &#38; E. Schubert (Eds.), <i>Menschen im Schatten der Kathedrale. Neuigkeiten aus dem Mittelalter</i> (pp. 99–110).","ieee":"H. Kamp, “Moderne Herrschaftsformen vor der Moderne: das Beispiel Burgund,” in <i>Menschen im Schatten der Kathedrale. Neuigkeiten aus dem Mittelalter</i>, G. Althoff, H.-W. Goetz, and E. Schubert, Eds. Darmstadt , 1998, pp. 99–110.","chicago":"Kamp, Hermann. “Moderne Herrschaftsformen vor der Moderne: das Beispiel Burgund.” In <i>Menschen im Schatten der Kathedrale. Neuigkeiten aus dem Mittelalter</i>, edited by Gerd Althoff, Hans-Werner Goetz, and Ernst Schubert, 99–110. Darmstadt , 1998.","ama":"Kamp H. Moderne Herrschaftsformen vor der Moderne: das Beispiel Burgund. In: Althoff G, Goetz H-W, Schubert E, eds. <i>Menschen im Schatten der Kathedrale. Neuigkeiten aus dem Mittelalter</i>. ; 1998:99-110."},"page":"99-110","year":"1998","place":"Darmstadt ","user_id":"125","department":[{"_id":"6"}],"_id":"36163","language":[{"iso":"ger"}],"extern":"1","type":"book_chapter","publication":"Menschen im Schatten der Kathedrale. Neuigkeiten aus dem Mittelalter","status":"public","editor":[{"full_name":"Althoff, Gerd","last_name":"Althoff","first_name":"Gerd"},{"full_name":"Goetz, Hans-Werner","last_name":"Goetz","first_name":"Hans-Werner"},{"first_name":"Ernst","last_name":"Schubert","full_name":"Schubert, Ernst"}]},{"editor":[{"last_name":"Hans-Werner","full_name":"Hans-Werner, Goetz","first_name":"Goetz"}],"status":"public","publication":"Hochmittelalterliches Geschichtsbewußtsein im Spiegel nichthistoriographischer Quellen","type":"book_chapter","language":[{"iso":"ger"}],"_id":"53483","department":[{"_id":"513"}],"user_id":"108","year":"1998","place":"Berlin","page":"S. 117-129","citation":{"ieee":"B. Englisch, “Zeitbewußtsein und systematische Zeitordnung in den Kalendern des frühen und hohen Mittelalters,” in <i>Hochmittelalterliches Geschichtsbewußtsein im Spiegel nichthistoriographischer Quellen</i>, G. Hans-Werner, Ed. Berlin, 1998, p. S. 117-129.","chicago":"Englisch, Brigitte. “Zeitbewußtsein und systematische Zeitordnung in den Kalendern des frühen und hohen Mittelalters.” In <i>Hochmittelalterliches Geschichtsbewußtsein im Spiegel nichthistoriographischer Quellen</i>, edited by Goetz Hans-Werner, S. 117-129. Berlin, 1998.","ama":"Englisch B. Zeitbewußtsein und systematische Zeitordnung in den Kalendern des frühen und hohen Mittelalters. In: Hans-Werner G, ed. <i>Hochmittelalterliches Geschichtsbewußtsein im Spiegel nichthistoriographischer Quellen</i>. ; 1998:S. 117-129.","bibtex":"@inbook{Englisch_1998, place={Berlin}, title={Zeitbewußtsein und systematische Zeitordnung in den Kalendern des frühen und hohen Mittelalters}, booktitle={Hochmittelalterliches Geschichtsbewußtsein im Spiegel nichthistoriographischer Quellen}, author={Englisch, Brigitte}, editor={Hans-Werner, Goetz}, year={1998}, pages={S. 117-129} }","short":"B. Englisch, in: G. Hans-Werner (Ed.), Hochmittelalterliches Geschichtsbewußtsein im Spiegel nichthistoriographischer Quellen, Berlin, 1998, p. S. 117-129.","mla":"Englisch, Brigitte. “Zeitbewußtsein und systematische Zeitordnung in den Kalendern des frühen und hohen Mittelalters.” <i>Hochmittelalterliches Geschichtsbewußtsein im Spiegel nichthistoriographischer Quellen</i>, edited by Goetz Hans-Werner, 1998, p. S. 117-129.","apa":"Englisch, B. (1998). Zeitbewußtsein und systematische Zeitordnung in den Kalendern des frühen und hohen Mittelalters. In G. Hans-Werner (Ed.), <i>Hochmittelalterliches Geschichtsbewußtsein im Spiegel nichthistoriographischer Quellen</i> (p. S. 117-129)."},"publication_status":"published","title":"Zeitbewußtsein und systematische Zeitordnung in den Kalendern des frühen und hohen Mittelalters","date_updated":"2024-04-16T08:45:02Z","date_created":"2024-04-14T16:06:58Z","author":[{"id":"108","full_name":"Englisch, Brigitte","last_name":"Englisch","first_name":"Brigitte"}]},{"status":"public","type":"review","publication":"zbMATH Open, Zbl. 0897.01002","language":[{"iso":"ger"}],"extern":"1","article_number":"Zbl. 897.01002","user_id":"391","department":[{"_id":"520"}],"_id":"18306","citation":{"ama":"Peckhaus V. Gabriel, Gottfried/Kienzler, Wolfgang (eds.), Frege in Jena. Beiträge zur Spurensicherung. Tagungsbericht, Jena, Deutschland, 6.–7. Dezember 1996, Königshausen &#38; Neumann: Würzburg 1997. <i>zbMATH Open, Zbl 089701002</i>. Published online 1998.","chicago":"Peckhaus, Volker. “Gabriel, Gottfried/Kienzler, Wolfgang (eds.), Frege in Jena. Beiträge zur Spurensicherung. Tagungsbericht, Jena, Deutschland, 6.–7. Dezember 1996, Königshausen &#38; Neumann: Würzburg 1997.” <i>zbMATH Open, Zbl. 0897.01002</i>, 1998.","ieee":"V. Peckhaus, “Gabriel, Gottfried/Kienzler, Wolfgang (eds.), Frege in Jena. Beiträge zur Spurensicherung. Tagungsbericht, Jena, Deutschland, 6.–7. Dezember 1996, Königshausen &#38; Neumann: Würzburg 1997,” <i>zbMATH Open, Zbl. 0897.01002</i>. 1998.","apa":"Peckhaus, V. (1998). Gabriel, Gottfried/Kienzler, Wolfgang (eds.), Frege in Jena. Beiträge zur Spurensicherung. Tagungsbericht, Jena, Deutschland, 6.–7. Dezember 1996, Königshausen &#38; Neumann: Würzburg 1997. In <i>zbMATH Open, Zbl. 0897.01002</i> (Zbl. 897.01002).","bibtex":"@article{Peckhaus_1998, title={Gabriel, Gottfried/Kienzler, Wolfgang (eds.), Frege in Jena. Beiträge zur Spurensicherung. Tagungsbericht, Jena, Deutschland, 6.–7. Dezember 1996, Königshausen &#38; Neumann: Würzburg 1997}, number={Zbl. 897.01002}, journal={zbMATH Open, Zbl. 0897.01002}, author={Peckhaus, Volker}, year={1998} }","mla":"Peckhaus, Volker. “Gabriel, Gottfried/Kienzler, Wolfgang (eds.), Frege in Jena. Beiträge zur Spurensicherung. Tagungsbericht, Jena, Deutschland, 6.–7. Dezember 1996, Königshausen &#38; Neumann: Würzburg 1997.” <i>zbMATH Open, Zbl. 0897.01002</i>, Zbl. 897.01002, 1998.","short":"V. Peckhaus, zbMATH Open, Zbl. 0897.01002 (1998)."},"year":"1998","main_file_link":[{"url":"https://zbmath.org/0897.01002","open_access":"1"}],"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","author":[{"first_name":"Volker","id":"391","full_name":"Peckhaus, Volker","last_name":"Peckhaus"}],"date_created":"2020-08-26T05:40:33Z","oa":"1","date_updated":"2024-06-19T12:53:54Z"},{"year":"1998","place":"Halifax, NS, Canada ","citation":{"ama":"Dücker M, Müller W, Rubart J. VIPspace - A Visually Programmable Shared Workspace. In: <i> Proceedings. 1998 IEEE Symposium on Visual Languages </i>. ; 1998. doi:<a href=\"https://doi.org/10.1109/VL.1998.706150\">10.1109/VL.1998.706150</a>","ieee":"M. Dücker, W. Müller, and J. Rubart, “VIPspace - A Visually Programmable Shared Workspace,” presented at the 1998 IEEE Symposium on Visual Languages , Halifax, NS, Canada , 1998, doi: <a href=\"https://doi.org/10.1109/VL.1998.706150\">10.1109/VL.1998.706150</a>.","chicago":"Dücker, M., Wolfgang Müller, and Jessica Rubart. “VIPspace - A Visually Programmable Shared Workspace.” In <i> Proceedings. 1998 IEEE Symposium on Visual Languages </i>. Halifax, NS, Canada , 1998. <a href=\"https://doi.org/10.1109/VL.1998.706150\">https://doi.org/10.1109/VL.1998.706150</a>.","bibtex":"@inproceedings{Dücker_Müller_Rubart_1998, place={Halifax, NS, Canada }, title={VIPspace - A Visually Programmable Shared Workspace}, DOI={<a href=\"https://doi.org/10.1109/VL.1998.706150\">10.1109/VL.1998.706150</a>}, booktitle={ Proceedings. 1998 IEEE Symposium on Visual Languages }, author={Dücker, M. and Müller, Wolfgang and Rubart, Jessica}, year={1998} }","short":"M. Dücker, W. Müller, J. Rubart, in:  Proceedings. 1998 IEEE Symposium on Visual Languages , Halifax, NS, Canada , 1998.","mla":"Dücker, M., et al. “VIPspace - A Visually Programmable Shared Workspace.” <i> Proceedings. 1998 IEEE Symposium on Visual Languages </i>, 1998, doi:<a href=\"https://doi.org/10.1109/VL.1998.706150\">10.1109/VL.1998.706150</a>.","apa":"Dücker, M., Müller, W., &#38; Rubart, J. (1998). VIPspace - A Visually Programmable Shared Workspace. <i> Proceedings. 1998 IEEE Symposium on Visual Languages </i>. 1998 IEEE Symposium on Visual Languages , Halifax, NS, Canada . <a href=\"https://doi.org/10.1109/VL.1998.706150\">https://doi.org/10.1109/VL.1998.706150</a>"},"publication_identifier":{"isbn":["0-8186-8712-6"]},"title":"VIPspace - A Visually Programmable Shared Workspace","doi":"10.1109/VL.1998.706150","conference":{"name":"1998 IEEE Symposium on Visual Languages ","location":"Halifax, NS, Canada "},"date_updated":"2023-01-24T11:42:31Z","author":[{"first_name":"M.","full_name":"Dücker, M.","last_name":"Dücker"},{"first_name":"Wolfgang","last_name":"Müller","full_name":"Müller, Wolfgang","id":"16243"},{"full_name":"Rubart, Jessica","last_name":"Rubart","first_name":"Jessica"}],"date_created":"2023-01-24T11:42:25Z","abstract":[{"text":"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.","lang":"eng"}],"status":"public","publication":" Proceedings. 1998 IEEE Symposium on Visual Languages ","type":"conference","keyword":["Collaborative work","Electronic mail","Computer networks","Video sharing","Videoconference","Discussion forums","Information systems","Streaming media","Motion pictures","Computer languages"],"language":[{"iso":"eng"}],"_id":"39496","department":[{"_id":"672"}],"user_id":"5786"},{"author":[{"first_name":"U","last_name":"Karthaus","full_name":"Karthaus, U"},{"first_name":"Reinhold","last_name":"Noé","orcid":"https://orcid.org/0000-0002-5839-7616","id":"381","full_name":"Noé, Reinhold"}],"date_created":"2023-01-23T18:21:55Z","date_updated":"2023-01-25T15:57:34Z","doi":"10.1109/IZSBC.1998.670260","title":"Influence of polarization on 30 GHz broadband radio channels","publication_identifier":{"isbn":["0-7803-3893-6"]},"page":"159-164","citation":{"ama":"Karthaus U, Noé R. Influence of polarization on 30 GHz broadband radio channels. In: <i>1998 INTERNATIONAL ZURICH SEMINAR ON BROADBAND COMMUNICATIONS: ACCESSING, TRANSMISSION, NETWORKING</i>. ; 1998:159-164. doi:<a href=\"https://doi.org/10.1109/IZSBC.1998.670260\">10.1109/IZSBC.1998.670260</a>","ieee":"U. Karthaus and R. Noé, “Influence of polarization on 30 GHz broadband radio channels,” in <i>1998 INTERNATIONAL ZURICH SEMINAR ON BROADBAND COMMUNICATIONS: ACCESSING, TRANSMISSION, NETWORKING</i>, 1998, pp. 159–164, doi: <a href=\"https://doi.org/10.1109/IZSBC.1998.670260\">10.1109/IZSBC.1998.670260</a>.","chicago":"Karthaus, U, and Reinhold Noé. “Influence of Polarization on 30 GHz Broadband Radio Channels.” In <i>1998 INTERNATIONAL ZURICH SEMINAR ON BROADBAND COMMUNICATIONS: ACCESSING, TRANSMISSION, NETWORKING</i>, 159–64, 1998. <a href=\"https://doi.org/10.1109/IZSBC.1998.670260\">https://doi.org/10.1109/IZSBC.1998.670260</a>.","apa":"Karthaus, U., &#38; Noé, R. (1998). Influence of polarization on 30 GHz broadband radio channels. <i>1998 INTERNATIONAL ZURICH SEMINAR ON BROADBAND COMMUNICATIONS: ACCESSING, TRANSMISSION, NETWORKING</i>, 159–164. <a href=\"https://doi.org/10.1109/IZSBC.1998.670260\">https://doi.org/10.1109/IZSBC.1998.670260</a>","short":"U. Karthaus, R. Noé, in: 1998 INTERNATIONAL ZURICH SEMINAR ON BROADBAND COMMUNICATIONS: ACCESSING, TRANSMISSION, NETWORKING, 1998, pp. 159–164.","mla":"Karthaus, U., and Reinhold Noé. “Influence of Polarization on 30 GHz Broadband Radio Channels.” <i>1998 INTERNATIONAL ZURICH SEMINAR ON BROADBAND COMMUNICATIONS: ACCESSING, TRANSMISSION, NETWORKING</i>, 1998, pp. 159–64, doi:<a href=\"https://doi.org/10.1109/IZSBC.1998.670260\">10.1109/IZSBC.1998.670260</a>.","bibtex":"@inproceedings{Karthaus_Noé_1998, title={Influence of polarization on 30 GHz broadband radio channels}, DOI={<a href=\"https://doi.org/10.1109/IZSBC.1998.670260\">10.1109/IZSBC.1998.670260</a>}, booktitle={1998 INTERNATIONAL ZURICH SEMINAR ON BROADBAND COMMUNICATIONS: ACCESSING, TRANSMISSION, NETWORKING}, author={Karthaus, U and Noé, Reinhold}, year={1998}, pages={159–164} }"},"year":"1998","department":[{"_id":"56"}],"user_id":"14931","_id":"38400","language":[{"iso":"eng"}],"publication":"1998 INTERNATIONAL ZURICH SEMINAR ON BROADBAND COMMUNICATIONS: ACCESSING, TRANSMISSION, NETWORKING","type":"conference","status":"public"},{"date_updated":"2023-01-24T11:39:35Z","author":[{"full_name":"Geiger, Christian","last_name":"Geiger","first_name":"Christian"},{"first_name":"Wolfgang","last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang"},{"first_name":"W.","full_name":"Rosenbach, W.","last_name":"Rosenbach"}],"date_created":"2023-01-24T11:39:30Z","title":"SAM - An Animated 3D Programming Language","doi":"10.1109/VL.1998.706167","conference":{"location":"Halifax, Canada","name":"1998 IEEE Symposium on Visual Languages"},"publication_identifier":{"isbn":["0-8186-8712-6"]},"year":"1998","place":"Halifax, Canada","citation":{"apa":"Geiger, C., Müller, W., &#38; Rosenbach, W. (1998). SAM - An Animated 3D Programming Language. <i>Proceedings of the IEEE Symposium on Visual Languages</i>. 1998 IEEE Symposium on Visual Languages, Halifax, Canada. <a href=\"https://doi.org/10.1109/VL.1998.706167\">https://doi.org/10.1109/VL.1998.706167</a>","mla":"Geiger, Christian, et al. “SAM - An Animated 3D Programming Language.” <i>Proceedings of the IEEE Symposium on Visual Languages</i>, 1998, doi:<a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>.","short":"C. Geiger, W. Müller, W. Rosenbach, in: Proceedings of the IEEE Symposium on Visual Languages, Halifax, Canada, 1998.","bibtex":"@inproceedings{Geiger_Müller_Rosenbach_1998, place={Halifax, Canada}, title={SAM - An Animated 3D Programming Language}, DOI={<a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>}, booktitle={Proceedings of the IEEE Symposium on Visual Languages}, author={Geiger, Christian and Müller, Wolfgang and Rosenbach, W.}, year={1998} }","ama":"Geiger C, Müller W, Rosenbach W. SAM - An Animated 3D Programming Language. In: <i>Proceedings of the IEEE Symposium on Visual Languages</i>. ; 1998. doi:<a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>","ieee":"C. Geiger, W. Müller, and W. Rosenbach, “SAM - An Animated 3D Programming Language,” presented at the 1998 IEEE Symposium on Visual Languages, Halifax, Canada, 1998, doi: <a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>.","chicago":"Geiger, Christian, Wolfgang Müller, and W. Rosenbach. “SAM - An Animated 3D Programming Language.” In <i>Proceedings of the IEEE Symposium on Visual Languages</i>. Halifax, Canada, 1998. <a href=\"https://doi.org/10.1109/VL.1998.706167\">https://doi.org/10.1109/VL.1998.706167</a>."},"_id":"39493","department":[{"_id":"672"}],"user_id":"5786","keyword":["Animation","Computer languages","Solids","Concrete","Application software","Virtual reality","Programming profession","Switches","Visualization","Debugging"],"language":[{"iso":"eng"}],"publication":"Proceedings of the IEEE Symposium on Visual Languages","type":"conference","abstract":[{"text":"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.","lang":"eng"}],"status":"public"},{"citation":{"chicago":"Haarslev, Volker, Ralf Möller, and Anni-Yasmin Turhan. “Implementing an ALCRP(D) ABox Reasoner - Progress Report.” In <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i>, edited by Enrico Franconi, Giuseppe De Giacomo, Robert M. MacGregor, Werner Nutt, and Christopher A. Welty, Vol. 11. CEUR Workshop Proceedings. CEUR-WS.org, 1998.","ieee":"V. Haarslev, R. Möller, and A.-Y. Turhan, “Implementing an ALCRP(D) ABox Reasoner - Progress Report,” in <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i>, 1998, vol. 11.","ama":"Haarslev V, Möller R, Turhan A-Y. Implementing an ALCRP(D) ABox Reasoner - Progress Report. In: Franconi E, Giacomo GD, MacGregor RM, Nutt W, Welty CA, eds. <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i>. Vol 11. CEUR Workshop Proceedings. CEUR-WS.org; 1998.","mla":"Haarslev, Volker, et al. “Implementing an ALCRP(D) ABox Reasoner - Progress Report.” <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i>, edited by Enrico Franconi et al., vol. 11, CEUR-WS.org, 1998.","short":"V. Haarslev, R. Möller, A.-Y. Turhan, in: E. Franconi, G.D. Giacomo, R.M. MacGregor, W. Nutt, C.A. Welty (Eds.), Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998, CEUR-WS.org, 1998.","bibtex":"@inproceedings{Haarslev_Möller_Turhan_1998, series={CEUR Workshop Proceedings}, title={Implementing an ALCRP(D) ABox Reasoner - Progress Report}, volume={11}, booktitle={Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998}, publisher={CEUR-WS.org}, author={Haarslev, Volker and Möller, Ralf and Turhan, Anni-Yasmin}, editor={Franconi, Enrico and Giacomo, Giuseppe De and MacGregor, Robert M. and Nutt, Werner and Welty, Christopher A.}, year={1998}, collection={CEUR Workshop Proceedings} }","apa":"Haarslev, V., Möller, R., &#38; Turhan, A.-Y. (1998). Implementing an ALCRP(D) ABox Reasoner - Progress Report. In E. Franconi, G. D. Giacomo, R. M. MacGregor, W. Nutt, &#38; C. A. Welty (Eds.), <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i> (Vol. 11). CEUR-WS.org."},"intvolume":"        11","year":"1998","title":"Implementing an ALCRP(D) ABox Reasoner - Progress Report","author":[{"first_name":"Volker","full_name":"Haarslev, Volker","last_name":"Haarslev"},{"first_name":"Ralf","full_name":"Möller, Ralf","last_name":"Möller"},{"last_name":"Turhan","full_name":"Turhan, Anni-Yasmin","id":"104470","first_name":"Anni-Yasmin"}],"date_created":"2024-10-10T13:46:22Z","volume":11,"date_updated":"2024-10-10T13:46:36Z","publisher":"CEUR-WS.org","status":"public","editor":[{"full_name":"Franconi, Enrico","last_name":"Franconi","first_name":"Enrico"},{"first_name":"Giuseppe De","full_name":"Giacomo, Giuseppe De","last_name":"Giacomo"},{"first_name":"Robert M.","full_name":"MacGregor, Robert M.","last_name":"MacGregor"},{"last_name":"Nutt","full_name":"Nutt, Werner","first_name":"Werner"},{"full_name":"Welty, Christopher A.","last_name":"Welty","first_name":"Christopher A."}],"type":"conference","publication":"Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998","language":[{"iso":"eng"}],"series_title":"CEUR Workshop Proceedings","user_id":"15504","_id":"56577"},{"_id":"56576","series_title":"CEUR Workshop Proceedings","user_id":"15504","language":[{"iso":"eng"}],"publication":"Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998","type":"conference","editor":[{"first_name":"Enrico","last_name":"Franconi","full_name":"Franconi, Enrico"},{"last_name":"Giacomo","full_name":"Giacomo, Giuseppe De","first_name":"Giuseppe De"},{"first_name":"Robert M.","last_name":"MacGregor","full_name":"MacGregor, Robert M."},{"first_name":"Werner","full_name":"Nutt, Werner","last_name":"Nutt"},{"full_name":"Welty, Christopher A.","last_name":"Welty","first_name":"Christopher A."}],"status":"public","publisher":"CEUR-WS.org","date_updated":"2024-10-10T13:45:57Z","volume":11,"author":[{"full_name":"Haarslev, Volker","last_name":"Haarslev","first_name":"Volker"},{"full_name":"Möller, Ralf","last_name":"Möller","first_name":"Ralf"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan","first_name":"Anni-Yasmin"}],"date_created":"2024-10-10T13:45:46Z","title":"HAM-ALC","year":"1998","intvolume":"        11","citation":{"short":"V. Haarslev, R. Möller, A.-Y. Turhan, in: E. Franconi, G.D. Giacomo, R.M. MacGregor, W. Nutt, C.A. Welty (Eds.), Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998, CEUR-WS.org, 1998.","bibtex":"@inproceedings{Haarslev_Möller_Turhan_1998, series={CEUR Workshop Proceedings}, title={HAM-ALC}, volume={11}, booktitle={Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998}, publisher={CEUR-WS.org}, author={Haarslev, Volker and Möller, Ralf and Turhan, Anni-Yasmin}, editor={Franconi, Enrico and Giacomo, Giuseppe De and MacGregor, Robert M. and Nutt, Werner and Welty, Christopher A.}, year={1998}, collection={CEUR Workshop Proceedings} }","mla":"Haarslev, Volker, et al. “HAM-ALC.” <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i>, edited by Enrico Franconi et al., vol. 11, CEUR-WS.org, 1998.","apa":"Haarslev, V., Möller, R., &#38; Turhan, A.-Y. (1998). HAM-ALC. In E. Franconi, G. D. Giacomo, R. M. MacGregor, W. Nutt, &#38; C. A. Welty (Eds.), <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i> (Vol. 11). CEUR-WS.org.","ieee":"V. Haarslev, R. Möller, and A.-Y. Turhan, “HAM-ALC,” in <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i>, 1998, vol. 11.","chicago":"Haarslev, Volker, Ralf Möller, and Anni-Yasmin Turhan. “HAM-ALC.” In <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i>, edited by Enrico Franconi, Giuseppe De Giacomo, Robert M. MacGregor, Werner Nutt, and Christopher A. Welty, Vol. 11. CEUR Workshop Proceedings. CEUR-WS.org, 1998.","ama":"Haarslev V, Möller R, Turhan A-Y. HAM-ALC. In: Franconi E, Giacomo GD, MacGregor RM, Nutt W, Welty CA, eds. <i>Proceedings of the 1998 International Workshop on Description Logics (DL’98), IRST, Povo - Trento, Italy, June 6-8, 1998</i>. Vol 11. CEUR Workshop Proceedings. CEUR-WS.org; 1998."}},{"publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"ieee":"A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi: <a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>.","chicago":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” In <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_9\">https://doi.org/10.1007/3-540-63397-9_9</a>.","ama":"Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>. ; 1997. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>","apa":"Czumaj, A., &#38; Strothmann, W.-B. (1997). Bounded degree spanning trees. <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>. <a href=\"https://doi.org/10.1007/3-540-63397-9_9\">https://doi.org/10.1007/3-540-63397-9_9</a>","short":"A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.","mla":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>, 1997, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>.","bibtex":"@inproceedings{Czumaj_Strothmann_1997, title={Bounded degree spanning trees}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>}, booktitle={Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)}, author={Czumaj, Artur and Strothmann, Willy-Bernhard}, year={1997} }"},"year":"1997","date_created":"2020-10-05T07:13:42Z","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Willy-Bernhard","last_name":"Strothmann","full_name":"Strothmann, Willy-Bernhard"}],"date_updated":"2022-01-06T06:54:14Z","doi":"10.1007/3-540-63397-9_9","title":"Bounded degree spanning trees","publication":"Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)","type":"conference","status":"public","abstract":[{"text":"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$.","lang":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"19869","language":[{"iso":"eng"}]}]