[{"type":"conference","status":"public","publication":"34st International Symposium on Mathematical Foundations of Computer Science","citation":{"apa":"Raptopoulos, C. L., Nikoletseas, S. E., & Spirakis, P. G. (2009). Colouring Non-sparse Random Intersection Graphs. In *34st International Symposium on Mathematical Foundations of Computer Science* (pp. 600--611). https://doi.org/10.1007/978-1-4939-2864-4_597","ieee":"C. L. Raptopoulos, S. E. Nikoletseas, and P. G. Spirakis, “Colouring Non-sparse Random Intersection Graphs,” in *34st International Symposium on Mathematical Foundations of Computer Science*, 2009, pp. 600--611.","chicago":"Raptopoulos, Christoforos L., Sotiris E. Nikoletseas, and Paul G. Spirakis. “Colouring Non-Sparse Random Intersection Graphs.” In *34st International Symposium on Mathematical Foundations of Computer Science*, 600--611, 2009. https://doi.org/10.1007/978-1-4939-2864-4_597.","bibtex":"@inproceedings{Raptopoulos_Nikoletseas_Spirakis_2009, title={Colouring Non-sparse Random Intersection Graphs}, DOI={10.1007/978-1-4939-2864-4_597}, booktitle={34st International Symposium on Mathematical Foundations of Computer Science}, author={Raptopoulos, Christoforos L. and Nikoletseas, Sotiris E. and Spirakis, Paul G.}, year={2009}, pages={600--611} }","mla":"Raptopoulos, Christoforos L., et al. “Colouring Non-Sparse Random Intersection Graphs.” *34st International Symposium on Mathematical Foundations of Computer Science*, 2009, pp. 600--611, doi:10.1007/978-1-4939-2864-4_597.","ama":"Raptopoulos CL, Nikoletseas SE, Spirakis PG. Colouring Non-sparse Random Intersection Graphs. In: *34st International Symposium on Mathematical Foundations of Computer Science*. ; 2009:600--611. doi:10.1007/978-1-4939-2864-4_597","short":"C.L. Raptopoulos, S.E. Nikoletseas, P.G. Spirakis, in: 34st International Symposium on Mathematical Foundations of Computer Science, 2009, pp. 600--611."},"user_id":"15415","date_created":"2020-10-06T10:09:51Z","_id":"19901","page":"600--611","year":"2009","publication_identifier":{"isbn":["9781493928637","9781493928644"]},"publication_status":"published","doi":"10.1007/978-1-4939-2864-4_597","author":[{"full_name":"Raptopoulos, Christoforos L.","last_name":"Raptopoulos","first_name":"Christoforos L."},{"first_name":"Sotiris E.","last_name":"Nikoletseas","full_name":"Nikoletseas, Sotiris E."},{"full_name":"Spirakis, Paul G.","last_name":"Spirakis","first_name":"Paul G."}],"title":"Colouring Non-sparse Random Intersection Graphs","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"date_updated":"2020-10-06T10:26:42Z"},{"abstract":[{"lang":"eng","text":"For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others) from p? The present work explores the trade-off between query time\r\nand preprocessing space for these quantities in 2D: exactly, in the approximate\r\ndeterministic, and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space data structure for S that, given p and time O(log n), allows\r\nto approximate the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically is just linear in the size n of the scene S. On the other hand,\r\nwe present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing time and space with similar approximation properties and query\r\ntime O(k*polylog n), where kProc. 25th European Workshop on Computational Geometry (pp. 203–206).","ieee":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” in *Proc. 25th European Workshop on Computational Geometry*, 2009, pp. 203–206.","bibtex":"@inproceedings{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2009, title={Planar Visibility Counting}, booktitle={Proc. 25th European Workshop on Computational Geometry}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2009}, pages={203–206} }","chicago":"Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, and Martin Ziegler. “Planar Visibility Counting.” In *Proc. 25th European Workshop on Computational Geometry*, 203–6, 2009.","ama":"Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. In: *Proc. 25th European Workshop on Computational Geometry*. ; 2009:203-206.","mla":"Fischer, Matthias, et al. “Planar Visibility Counting.” *Proc. 25th European Workshop on Computational Geometry*, 2009, pp. 203–06.","short":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, in: Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206."},"title":"Planar Visibility Counting","date_updated":"2020-08-26T09:05:40Z","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"author":[{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"first_name":"Matthias","last_name":"Hilbig","full_name":"Hilbig, Matthias"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}]},{"author":[{"last_name":"Bonorden","first_name":"Olaf","full_name":"Bonorden, Olaf"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"}],"publication_status":"published","doi":"10.1007/978-3-642-05434-1_25","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642054334","9783642054341"]},"date_updated":"2020-09-28T10:30:01Z","publisher":"Springer","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","language":[{"iso":"eng"}],"title":"Complexity and Approximation of a Geometric Local Robot Assignment Problem","user_id":"15415","citation":{"short":"O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.","ama":"Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: *Algorithmic Aspects of Wireless Sensor Networks*. Berlin, Heidelberg: Springer; 2009:252-262. doi:10.1007/978-3-642-05434-1_25","mla":"Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” *Algorithmic Aspects of Wireless Sensor Networks*, Springer, 2009, pp. 252–62, doi:10.1007/978-3-642-05434-1_25.","ieee":"O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in *Algorithmic Aspects of Wireless Sensor Networks*, Berlin, Heidelberg: Springer, 2009, pp. 252–262.","apa":"Bonorden, O., Degener, B., Kempkes, B., & Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In *Algorithmic Aspects of Wireless Sensor Networks* (pp. 252–262). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-05434-1_25","bibtex":"@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg}, title={Complexity and Approximation of a Geometric Local Robot Assignment Problem}, DOI={10.1007/978-3-642-05434-1_25}, booktitle={Algorithmic Aspects of Wireless Sensor Networks}, publisher={Springer}, author={Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}, year={2009}, pages={252–262} }","chicago":"Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” In *Algorithmic Aspects of Wireless Sensor Networks*, 252–62. Berlin, Heidelberg: Springer, 2009. https://doi.org/10.1007/978-3-642-05434-1_25."},"publication":"Algorithmic Aspects of Wireless Sensor Networks","type":"book_chapter","status":"public","page":"252-262","year":"2009","_id":"19724","abstract":[{"text":"We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\\classP$ or are $\\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\\bigO(\\log^*n)$ communication rounds.","lang":"eng"}],"date_created":"2020-09-28T10:25:34Z"},{"author":[{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"},{"full_name":"Mahlmann, Peter","first_name":"Peter","last_name":"Mahlmann"},{"first_name":"Thomas","last_name":"Janson","full_name":"Janson, Thomas"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_id":"19826","creator":"koala","date_updated":"2020-10-01T09:47:33Z","file_name":"pub-hni-4130.pdf","success":1,"access_level":"closed","file_size":753215,"date_created":"2020-10-01T09:47:33Z"}],"ddc":["000"],"title":"3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","language":[{"iso":"eng"}],"file_date_updated":"2020-10-01T09:47:33Z","department":[{"_id":"63"}],"publisher":"Paderborn, Germany","date_updated":"2020-10-01T09:48:41Z","type":"report","status":"public","citation":{"apa":"Schindelhauer, C., Mahlmann, P., & Janson, T. (2009). *3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs*. Paderborn, Germany.","ieee":"C. Schindelhauer, P. Mahlmann, and T. Janson, *3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs*. Paderborn, Germany, 2009.","bibtex":"@book{Schindelhauer_Mahlmann_Janson_2009, title={3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, publisher={Paderborn, Germany}, author={Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas}, year={2009} }","chicago":"Schindelhauer, Christian, Peter Mahlmann, and Thomas Janson. *3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs*. Paderborn, Germany, 2009.","ama":"Schindelhauer C, Mahlmann P, Janson T. *3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs*. Paderborn, Germany; 2009.","mla":"Schindelhauer, Christian, et al. *3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs*. Paderborn, Germany, 2009.","short":"C. Schindelhauer, P. Mahlmann, T. Janson, 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs, Paderborn, Germany, 2009."},"user_id":"15415","date_created":"2020-10-01T09:47:54Z","_id":"19825","abstract":[{"lang":"eng","text":"Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks feature efficient lookup algorithms with typically logarithmic hop distance and provide simple and efficient load balancing. Yet, they are limited to exact match queries and in many cases hard to maintain under churn."}],"accept":"1","year":"2009"},{"publication_identifier":{"isbn":["978-1-59593-973-9"]},"publication_status":"published","doi":"10.1145/1378533","title":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"date_updated":"2020-04-08T09:06:57Z","publisher":"ACM","status":"public","type":"conference_editor","citation":{"ieee":"F. Meyer auf der Heide and N. Shavit, Eds., *Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08*. ACM, 2008.","apa":"Meyer auf der Heide, F., & Shavit, N. (Eds.). (2008). *Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08*. ACM. https://doi.org/10.1145/1378533","bibtex":"@book{Meyer auf der Heide_Shavit_2008, title={Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA ’08}, DOI={10.1145/1378533}, publisher={ACM}, year={2008} }","chicago":"Meyer auf der Heide, Friedhelm, and Nir Shavit, eds. *Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08*. ACM, 2008. https://doi.org/10.1145/1378533.","short":"F. Meyer auf der Heide, N. Shavit, eds., Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08, ACM, 2008.","ama":"Meyer auf der Heide F, Shavit N, eds. *Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08*. ACM; 2008. doi:10.1145/1378533","mla":"Meyer auf der Heide, Friedhelm, and Nir Shavit, editors. *Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’08*. ACM, 2008, doi:10.1145/1378533."},"user_id":"15415","editor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"}],"_id":"16466","date_created":"2020-04-08T08:46:08Z","year":"2008"},{"department":[{"_id":"63"}],"language":[{"iso":"eng"}],"date_updated":"2020-09-04T10:11:54Z","title":"The Kinetic Facility Location Problem","author":[{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"full_name":"Lammersen, Christiane","first_name":"Christiane","last_name":"Lammersen"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"}],"page":"251-254","year":"2008","abstract":[{"lang":"eng","text":"We present a deterministic kinetic data structure for the facility location problem that maintains a subset of the moving points as facilities such that, at any point of time, the sum of the maintenance cost for the facilities and the connection cost for the clients is at most a constant factor larger than the current optimal cost. In our scenario, each point can open a facility and moves continuously along a known trajectory in a d-dimensional Euclidean space where d is a constant.\r\n\r\nOur kinetic data structure has a storage requirement of O(n (log^d(n)+log(nR))), where n is the number of points and R is the ratio of the product of the maximum maintenance cost and demand to the product of their corresponding minimum values. In the case that each trajectory can be described by a bounded degree polynomial, the data structure processes O(n^2 log^2(nR)) events, each requiring only O(log(nR)) facility changes and O(log^(d+1)(n) log(nR)) time. This results in a total processing time of O(n^2 log^(d+1)(n) log^3(nR)). To the best of our knowledge, this is the first kinetic data structure for the facility location problem."}],"date_created":"2020-09-04T10:11:39Z","_id":"19004","citation":{"short":"J. Gehweiler, C. Lammersen, B. Degener, in: Proceedings of the 24th European Workshop on Computational Geometry, 2008, pp. 251–254.","mla":"Gehweiler, Joachim, et al. “The Kinetic Facility Location Problem.” *Proceedings of the 24th European Workshop on Computational Geometry*, 2008, pp. 251–54.","ama":"Gehweiler J, Lammersen C, Degener B. The Kinetic Facility Location Problem. In: *Proceedings of the 24th European Workshop on Computational Geometry*. ; 2008:251-254.","ieee":"J. Gehweiler, C. Lammersen, and B. Degener, “The Kinetic Facility Location Problem,” in *Proceedings of the 24th European Workshop on Computational Geometry*, 2008, pp. 251–254.","apa":"Gehweiler, J., Lammersen, C., & Degener, B. (2008). The Kinetic Facility Location Problem. In *Proceedings of the 24th European Workshop on Computational Geometry* (pp. 251–254).","bibtex":"@inproceedings{Gehweiler_Lammersen_Degener_2008, title={The Kinetic Facility Location Problem}, booktitle={Proceedings of the 24th European Workshop on Computational Geometry}, author={Gehweiler, Joachim and Lammersen, Christiane and Degener, Bastian}, year={2008}, pages={251–254} }","chicago":"Gehweiler, Joachim, Christiane Lammersen, and Bastian Degener. “The Kinetic Facility Location Problem.” In *Proceedings of the 24th European Workshop on Computational Geometry*, 251–54, 2008."},"user_id":"15415","publication":"Proceedings of the 24th European Workshop on Computational Geometry","status":"public","type":"conference"},{"author":[{"full_name":"Lürwer-Brüggemeier, Katharina","first_name":"Katharina","last_name":"Lürwer-Brüggemeier"}],"title":"Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division","date_updated":"2020-09-22T09:30:17Z","publisher":"Universität Paderborn","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090212010","relation":"confirmation"}]},"status":"public","type":"dissertation","user_id":"15415","citation":{"apa":"Lürwer-Brüggemeier, K. (2008). *Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division*. Universität Paderborn.","ieee":"K. Lürwer-Brüggemeier, *Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division*. Universität Paderborn, 2008.","chicago":"Lürwer-Brüggemeier, Katharina. *Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division*. Universität Paderborn, 2008.","bibtex":"@book{Lürwer-Brüggemeier_2008, title={Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division}, publisher={Universität Paderborn}, author={Lürwer-Brüggemeier, Katharina}, year={2008} }","short":"K. Lürwer-Brüggemeier, Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division, Universität Paderborn, 2008.","mla":"Lürwer-Brüggemeier, Katharina. *Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division*. Universität Paderborn, 2008.","ama":"Lürwer-Brüggemeier K. *Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division*. Universität Paderborn; 2008."},"_id":"19605","date_created":"2020-09-21T14:07:23Z","year":"2008","supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}]},{"year":"2008","page":"459-475","volume":5,"intvolume":" 5","_id":"18570","date_created":"2020-08-28T12:29:59Z","abstract":[{"text":"We present a game theoretic study of hybrid communication networks in which mobile devices can connect in an ad hoc fashion to a base station, possibly via a few hops using other mobile devices as intermediate nodes. The maximal number of allowed hops might be bounded with the motivation to guarantee small latency. We introduce hybrid connectivity games to study the impact of selfishness on this kind of infrastructure.\r\n\r\nMobile devices are represented by selfish players, each of which aims at establishing an uplink path to the base station minimizing its individual cost. Our model assumes that intermediate nodes on an uplink path are reimbursed for transmitting the packets of other devices. The reimbursements can be paid either by a benevolent network operator or by the senders of the packets using micropayments via a clearing agency that possibly collects a small percentage as commission. These different ways to implement the payments lead to different variants of the hybrid connectivity game. Our main findings are: (1) If there is no constraint on the number of allowed hops on the path to the base station, then the existence of equilibria is guaranteed regardless of whether the network operator or the senders pay for forwarding packets. (2) If the network operator pays, then the existence of equilibria is guaranteed only if at most one intermediate node is allowed, i.e., for at most two hops on the uplink path of a device, but not if the maximal number of allowed hops is three or larger. (3) In contrast, if the senders pay for forwarding their packets, then equilibria are guaranteed to exist given any bound on the number of allowed hops.\r\n\r\nThe equilibrium analysis presented in this paper gives a first game theoretical motivation for the implementation of micropayment schemes in which senders pay for forwarding their packets. We further support this evidence by giving an upper bound on the Price of Anarchy for this kind of hybrid connectivity games that is independent of the number of nodes, but only depends on the number of hops and the power gradient.","lang":"eng"}],"user_id":"15415","citation":{"apa":"Ackermann, H., Briest, P., Fanghänel, A., & Vöcking, B. (2008). Who Should Pay for Forwarding Packets? *Internet Mathematics*, *5*(4), 459–475. https://doi.org/10.1007/978-3-540-77105-0_21","ieee":"H. Ackermann, P. Briest, A. Fanghänel, and B. Vöcking, “Who Should Pay for Forwarding Packets?,” *Internet Mathematics*, vol. 5, no. 4, pp. 459–475, 2008.","chicago":"Ackermann, Heiner, Patrick Briest, Alexander Fanghänel, and Berthold Vöcking. “Who Should Pay for Forwarding Packets?” *Internet Mathematics* 5, no. 4 (2008): 459–75. https://doi.org/10.1007/978-3-540-77105-0_21.","bibtex":"@article{Ackermann_Briest_Fanghänel_Vöcking_2008, title={Who Should Pay for Forwarding Packets?}, volume={5}, DOI={10.1007/978-3-540-77105-0_21}, number={4}, journal={Internet Mathematics}, publisher={Springer}, author={Ackermann, Heiner and Briest, Patrick and Fanghänel, Alexander and Vöcking, Berthold}, year={2008}, pages={459–475} }","short":"H. Ackermann, P. Briest, A. Fanghänel, B. Vöcking, Internet Mathematics 5 (2008) 459–475.","ama":"Ackermann H, Briest P, Fanghänel A, Vöcking B. Who Should Pay for Forwarding Packets? *Internet Mathematics*. 2008;5(4):459-475. doi:10.1007/978-3-540-77105-0_21","mla":"Ackermann, Heiner, et al. “Who Should Pay for Forwarding Packets?” *Internet Mathematics*, vol. 5, no. 4, Springer, 2008, pp. 459–75, doi:10.1007/978-3-540-77105-0_21."},"status":"public","type":"journal_article","publication":"Internet Mathematics","publisher":"Springer","date_updated":"2020-09-25T10:13:42Z","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"issue":"4","title":"Who Should Pay for Forwarding Packets?","author":[{"first_name":"Heiner","last_name":"Ackermann","full_name":"Ackermann, Heiner"},{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"full_name":"Fanghänel, Alexander","first_name":"Alexander","last_name":"Fanghänel"},{"first_name":"Berthold","last_name":"Vöcking","full_name":"Vöcking, Berthold"}],"doi":"10.1007/978-3-540-77105-0_21","publication_status":"published","publication_identifier":{"isbn":["9783540771043"]}},{"status":"public","publication":"Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)","type":"conference","citation":{"ieee":"P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in *Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)*, 2008.","apa":"Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In *Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)*. https://doi.org/10.1007/978-3-540-70575-8_66","bibtex":"@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing Problem}, DOI={10.1007/978-3-540-70575-8_66}, booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }","chicago":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In *Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)*, 2008. https://doi.org/10.1007/978-3-540-70575-8_66.","ama":"Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: *Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)*. ; 2008. doi:10.1007/978-3-540-70575-8_66","mla":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” *Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)*, 2008, doi:10.1007/978-3-540-70575-8_66.","short":"P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008."},"user_id":"15415","_id":"19686","date_created":"2020-09-25T09:45:40Z","year":"2008","publication_identifier":{"isbn":["9783540705741","9783540705758"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-540-70575-8_66","publication_status":"published","author":[{"last_name":"Briest","first_name":"Patrick","full_name":"Briest, Patrick"}],"title":"Uniform Budgets and the Envy-Free Pricing Problem","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"date_updated":"2020-09-25T09:47:48Z"},{"_id":"17868","abstract":[{"text":"The paper describes an approach for an aggregated animation of a simulation experiment in an interactive 3D environment, visualizing multiple, distributed simulation runs. Although the general approach of a 3-dimensional visualization of material flow simulation helps to understand the dynamic behavior of a system better as well as faster, it remains unclear, how typical the animated simulation represents the model, if there is a stochastic influence for even some parameters. By the integrated visualization of multiple distributed simulation runs, this uncertainty can be solved, which will be shown in this paper for a typical simulation study of a queuing system. ","lang":"eng"}],"date_created":"2020-08-12T13:39:37Z","year":"2008","page":"2012-2020","publication":"2008 Winter Simulation Conference","type":"conference","status":"public","user_id":"15415","citation":{"short":"W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, T. Süß, in: 2008 Winter Simulation Conference, Miami, FL., USA, 2008, pp. 2012–2020.","mla":"Dangelmaier, Wilhelm, et al. “Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System.” *2008 Winter Simulation Conference*, 2008, pp. 2012–20, doi:10.1109/wsc.2008.4736296.","ama":"Dangelmaier W, Fischer M, Huber D, Laroque C, Süß T. Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. In: *2008 Winter Simulation Conference*. Miami, FL., USA; 2008:2012-2020. doi:10.1109/wsc.2008.4736296","ieee":"W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, and T. Süß, “Aggregated 3D-visualization of a distributed simulation experiment of a queuing system,” in *2008 Winter Simulation Conference*, 2008, pp. 2012–2020.","apa":"Dangelmaier, W., Fischer, M., Huber, D., Laroque, C., & Süß, T. (2008). Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. In *2008 Winter Simulation Conference* (pp. 2012–2020). Miami, FL., USA. https://doi.org/10.1109/wsc.2008.4736296","chicago":"Dangelmaier, Wilhelm, Matthias Fischer, Daniel Huber, Christoph Laroque, and Tim Süß. “Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System.” In *2008 Winter Simulation Conference*, 2012–20. Miami, FL., USA, 2008. https://doi.org/10.1109/wsc.2008.4736296.","bibtex":"@inproceedings{Dangelmaier_Fischer_Huber_Laroque_Süß_2008, place={Miami, FL., USA}, title={Aggregated 3D-visualization of a distributed simulation experiment of a queuing system}, DOI={10.1109/wsc.2008.4736296}, booktitle={2008 Winter Simulation Conference}, author={Dangelmaier, Wilhelm and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Süß, Tim}, year={2008}, pages={2012–2020} }"},"title":"Aggregated 3D-visualization of a distributed simulation experiment of a queuing system","date_updated":"2020-10-06T08:48:17Z","place":"Miami, FL., USA","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"doi":"10.1109/wsc.2008.4736296","publication_status":"published","publication_identifier":{"isbn":["9781424427079"]},"author":[{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"full_name":"Huber, Daniel","last_name":"Huber","first_name":"Daniel"},{"last_name":"Laroque","first_name":"Christoph","full_name":"Laroque, Christoph"},{"last_name":"Süß","first_name":"Tim","full_name":"Süß, Tim"}]}]