[{"abstract":[{"lang":"eng","text":"Commercial software of material flow simulations has the ability to layout the simulated models. Arranged equipment, such as conveyors or machines, includes the need to model and determine motion paths for moving objects like forklifts or automatically guided vehicles, so that the simulation framework is able to navigate all vehicles across those motion paths. After analyzing first scenarios, the user often carries out layout changes in the simulation model, e.g. moving, adding or deleting equipment. However, those changes cause time consuming, additional modeling of the motion paths for the user. Our motion planning algorithm reduces these changes by automatically determining the motion paths for moving objects, depending on an actual model layout without colliding with other objects. The algorithm works on the basis of the virtual scene’s 3D-data used for the simulation model’s visualization. We demonstrate the technique with a multi-floor building example."}],"citation":{"apa":"Fischer, M., Renken, H., Laroque, C., Schaumann, G., &#38; Dangelmaier, W. (2010). Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations. In <i>Proceedings of the 2010 Winter Simulation Conference</i>. <a href=\"https://doi.org/10.1109/wsc.2010.5678906\">https://doi.org/10.1109/wsc.2010.5678906</a>","ieee":"M. Fischer, H. Renken, C. Laroque, G. Schaumann, and W. Dangelmaier, “Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations,” in <i>Proceedings of the 2010 Winter Simulation Conference</i>, 2010.","short":"M. Fischer, H. Renken, C. Laroque, G. Schaumann, W. Dangelmaier, in: Proceedings of the 2010 Winter Simulation Conference, 2010.","chicago":"Fischer, Matthias, Hendrik Renken, Christoph Laroque, Guido Schaumann, and Wilhelm Dangelmaier. “Automated 3D-Motion Planning for Ramps and Stairs in Intra-Logistics Material Flow Simulations.” In <i>Proceedings of the 2010 Winter Simulation Conference</i>, 2010. <a href=\"https://doi.org/10.1109/wsc.2010.5678906\">https://doi.org/10.1109/wsc.2010.5678906</a>.","mla":"Fischer, Matthias, et al. “Automated 3D-Motion Planning for Ramps and Stairs in Intra-Logistics Material Flow Simulations.” <i>Proceedings of the 2010 Winter Simulation Conference</i>, 2010, doi:<a href=\"https://doi.org/10.1109/wsc.2010.5678906\">10.1109/wsc.2010.5678906</a>.","ama":"Fischer M, Renken H, Laroque C, Schaumann G, Dangelmaier W. Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations. In: <i>Proceedings of the 2010 Winter Simulation Conference</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/wsc.2010.5678906\">10.1109/wsc.2010.5678906</a>","bibtex":"@inproceedings{Fischer_Renken_Laroque_Schaumann_Dangelmaier_2010, title={Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations}, DOI={<a href=\"https://doi.org/10.1109/wsc.2010.5678906\">10.1109/wsc.2010.5678906</a>}, booktitle={Proceedings of the 2010 Winter Simulation Conference}, author={Fischer, Matthias and Renken, Hendrik and Laroque, Christoph and Schaumann, Guido and Dangelmaier, Wilhelm}, year={2010} }"},"publication":"Proceedings of the 2010 Winter Simulation Conference","department":[{"_id":"63"}],"type":"conference","date_created":"2020-07-27T19:33:16Z","publication_status":"published","date_updated":"2022-01-06T06:53:11Z","publication_identifier":{"isbn":["9781424498666"]},"author":[{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Renken, Hendrik","last_name":"Renken","first_name":"Hendrik"},{"last_name":"Laroque","first_name":"Christoph","full_name":"Laroque, Christoph"},{"full_name":"Schaumann, Guido","first_name":"Guido","last_name":"Schaumann"},{"last_name":"Dangelmaier","first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm"}],"year":"2010","title":"Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations","status":"public","user_id":"15415","doi":"10.1109/wsc.2010.5678906","language":[{"iso":"eng"}],"_id":"17422"},{"date_updated":"2022-01-06T06:53:12Z","has_accepted_license":"1","year":"2010","status":"public","title":"A Large-Scale Distributed Environment for Peer-to-Peer Services","author":[{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"id":"477","full_name":"Schroeder, Ulf-Peter","first_name":"Ulf-Peter","last_name":"Schroeder"}],"user_id":"15415","ddc":["000"],"_id":"17462","language":[{"iso":"eng"}],"publisher":"Heinz Nixdorf Institut","report_number":"tr-ri-10-317","file_date_updated":"2020-07-30T07:24:17Z","citation":{"short":"J. Gehweiler, F. Meyer auf der Heide, U.-P. Schroeder, A Large-Scale Distributed Environment for Peer-to-Peer Services, Heinz Nixdorf Institut, Paderborn, 2010.","chicago":"Gehweiler, Joachim, Friedhelm Meyer auf der Heide, and Ulf-Peter Schroeder. <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Paderborn: Heinz Nixdorf Institut, 2010.","ieee":"J. Gehweiler, F. Meyer auf der Heide, and U.-P. Schroeder, <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Paderborn: Heinz Nixdorf Institut, 2010.","apa":"Gehweiler, J., Meyer auf der Heide, F., &#38; Schroeder, U.-P. (2010). <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Paderborn: Heinz Nixdorf Institut.","bibtex":"@book{Gehweiler_Meyer auf der Heide_Schroeder_2010, place={Paderborn}, title={A Large-Scale Distributed Environment for Peer-to-Peer Services}, publisher={Heinz Nixdorf Institut}, author={Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Schroeder, Ulf-Peter}, year={2010} }","ama":"Gehweiler J, Meyer auf der Heide F, Schroeder U-P. <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Paderborn: Heinz Nixdorf Institut; 2010.","mla":"Gehweiler, Joachim, et al. <i>A Large-Scale Distributed Environment for Peer-to-Peer Services</i>. Heinz Nixdorf Institut, 2010."},"type":"report","department":[{"_id":"63"}],"file":[{"date_created":"2020-07-30T07:24:17Z","creator":"koala","file_id":"17463","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-07-30T07:24:17Z","file_name":"tr-ri-10-317.pdf","access_level":"closed","file_size":468844}],"date_created":"2020-07-30T07:25:59Z","place":"Paderborn"},{"_id":"17464","language":[{"iso":"eng"}],"user_id":"15415","ddc":["000"],"author":[{"full_name":"Blesa, Maria J.","last_name":"Blesa","first_name":"Maria J."},{"full_name":"Blum, Christian","last_name":"Blum","first_name":"Christian"},{"first_name":"Angelo","last_name":"de Caro","full_name":"de Caro, Angelo"},{"full_name":"Degener, Bastian ","last_name":"Degener","first_name":"Bastian "},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"full_name":"Leone, Piere","first_name":"Piere","last_name":"Leone"},{"first_name":"Giuseppe","last_name":"Persiano","full_name":"Persiano, Giuseppe"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Mylonas, Georgios","last_name":"Mylonas","first_name":"Georgios"}],"title":"Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study","status":"public","year":"2010","has_accepted_license":"1","date_updated":"2022-01-06T06:53:12Z","date_created":"2020-07-30T07:48:53Z","file":[{"file_size":242286,"access_level":"closed","file_name":"FRONTS-TR-2010-11.pdf","date_updated":"2020-07-30T07:48:24Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"17466","creator":"koala","date_created":"2020-07-30T07:48:24Z"}],"department":[{"_id":"63"}],"type":"report","citation":{"bibtex":"@book{Blesa_Blum_de Caro_Degener_Kempkes_Leone_Persiano_Meyer auf der Heide_Mylonas_2010, title={Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study}, author={Blesa, Maria J. and Blum, Christian and de Caro, Angelo and Degener, Bastian  and Kempkes, Barbara and Leone, Piere and Persiano, Giuseppe and Meyer auf der Heide, Friedhelm and Mylonas, Georgios}, year={2010} }","ama":"Blesa MJ, Blum C, de Caro A, et al. <i>Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study</i>.; 2010.","mla":"Blesa, Maria J., et al. <i>Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study</i>. 2010.","chicago":"Blesa, Maria J., Christian Blum, Angelo de Caro, Bastian  Degener, Barbara Kempkes, Piere Leone, Giuseppe Persiano, Friedhelm Meyer auf der Heide, and Georgios Mylonas. <i>Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study</i>, 2010.","short":"M.J. Blesa, C. Blum, A. de Caro, B. Degener, B. Kempkes, P. Leone, G. Persiano, F. Meyer auf der Heide, G. Mylonas, Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario - a Case Study, 2010.","ieee":"M. J. Blesa <i>et al.</i>, <i>Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study</i>. 2010.","apa":"Blesa, M. J., Blum, C., de Caro, A., Degener, B., Kempkes, B., Leone, P., … Mylonas, G. (2010). <i>Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study</i>."},"file_date_updated":"2020-07-30T07:48:24Z","report_number":"FRONTS-TR-2010-11"},{"file":[{"creator":"koala","date_created":"2020-08-04T12:26:55Z","relation":"main_file","date_updated":"2020-08-04T12:26:55Z","file_name":"BoundedStepwidth.pdf","access_level":"closed","file_size":476532,"file_id":"17587","success":1,"content_type":"application/pdf"}],"date_created":"2020-08-04T12:28:05Z","type":"preprint","department":[{"_id":"63"}],"file_date_updated":"2020-08-04T12:26:55Z","citation":{"ama":"Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Building short chains of mobile robots locally with a bounded stepwidth. 2010.","bibtex":"@article{Brandes_Degener_Kempkes_Meyer auf der Heide_2010, title={Building short chains of mobile robots locally with a bounded stepwidth}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2010} }","mla":"Brandes, Philipp, et al. <i>Building Short Chains of Mobile Robots Locally with a Bounded Stepwidth</i>. 2010.","chicago":"Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Building Short Chains of Mobile Robots Locally with a Bounded Stepwidth,” 2010.","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, (2010).","apa":"Brandes, P., Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2010). Building short chains of mobile robots locally with a bounded stepwidth.","ieee":"P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building short chains of mobile robots locally with a bounded stepwidth.” 2010."},"abstract":[{"text":"We are given a winding chain of $n$ mobile robots between two stations in the plane, each of them having a limited viewing range. It is only guaranteed that each robot can see its two neighbors in the chain. We analyze a simple and natural parallel strategy to shorten the chain in a time model where each relay is allowed to move up to a distance of $\\delta$ in each time step. This model fills the gap between the previously used discrete time model and the continuous time model which was introduced recently in \\cite{sirocco}. We analyze the strategy with respect to two quality measures: the number of time steps and the maximum distance to be traveled by the robots, which are the major energy consumers in this scenario. We provide asymptotically tight or almost tight bounds in this time model for both quality measures and it turns out that the best choice for $\\delta$ is $\\delta \\in \\Theta(\\frac{1}{n})$, since this minimizes the number of time steps as well as the maximum traveled distance.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"17586","user_id":"15415","ddc":["000"],"year":"2010","title":"Building short chains of mobile robots locally with a bounded stepwidth","status":"public","author":[{"full_name":"Brandes, Philipp","last_name":"Brandes","first_name":"Philipp"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_updated":"2022-01-06T06:53:15Z","has_accepted_license":"1"},{"extern":"1","publication":"DIALM-PODC","citation":{"ieee":"R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” in <i>DIALM-PODC</i>, 2010, pp. 33–42.","apa":"Bar-Yehuda, R., Polevoy, G., &#38; Rawitz, D. (2010). Bandwidth allocation in cellular networks with multiple interferences. In <i>DIALM-PODC</i> (pp. 33–42).","chicago":"Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” In <i>DIALM-PODC</i>, 33–42, 2010.","short":"R. Bar-Yehuda, G. Polevoy, D. Rawitz, in: DIALM-PODC, 2010, pp. 33–42.","mla":"Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” <i>DIALM-PODC</i>, 2010, pp. 33–42.","bibtex":"@inproceedings{Bar-Yehuda_Polevoy_Rawitz_2010, title={Bandwidth allocation in cellular networks with multiple interferences}, booktitle={DIALM-PODC}, author={Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2010}, pages={33–42} }","ama":"Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. In: <i>DIALM-PODC</i>. ; 2010:33-42."},"type":"conference","department":[{"_id":"63"},{"_id":"541"}],"date_created":"2020-08-06T15:22:47Z","date_updated":"2022-01-06T06:53:16Z","status":"public","title":"Bandwidth allocation in cellular networks with multiple interferences","year":"2010","author":[{"last_name":"Bar-Yehuda","first_name":"Reuven","full_name":"Bar-Yehuda, Reuven"},{"last_name":"Polevoy","first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983"},{"first_name":"Dror","last_name":"Rawitz","full_name":"Rawitz, Dror"}],"user_id":"83983","page":"33-42","_id":"17665","language":[{"iso":"eng"}]},{"publication":"Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution","citation":{"ama":"Hamann H, Schmickl T, Stradner J, Crailsheim K, Levi P, Kernbach S. Hormone-based Control for Multi-modular Robotics. In: <i>Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution</i>. Springer; 2010:240--263.","bibtex":"@inbook{Hamann_Schmickl_Stradner_Crailsheim_Levi_Kernbach_2010, title={Hormone-based Control for Multi-modular Robotics}, booktitle={Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution}, publisher={Springer}, author={Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Levi, Paul and Kernbach, Serge}, year={2010}, pages={240--263} }","mla":"Hamann, Heiko, et al. “Hormone-Based Control for Multi-Modular Robotics.” <i>Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution</i>, Springer, 2010, pp. 240--263.","short":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Levi, S. Kernbach, in: Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution, Springer, 2010, pp. 240--263.","chicago":"Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, Paul Levi, and Serge Kernbach. “Hormone-Based Control for Multi-Modular Robotics.” In <i>Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution</i>, 240--263. Springer, 2010.","apa":"Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., Levi, P., &#38; Kernbach, S. (2010). Hormone-based Control for Multi-modular Robotics. In <i>Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution</i> (pp. 240--263). Springer.","ieee":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Levi, and S. Kernbach, “Hormone-based Control for Multi-modular Robotics,” in <i>Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution</i>, Springer, 2010, pp. 240--263."},"date_created":"2020-09-01T11:29:17Z","type":"book_chapter","department":[{"_id":"63"},{"_id":"238"}],"status":"public","title":"Hormone-based Control for Multi-modular Robotics","year":"2010","author":[{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"full_name":"Schmickl, Thomas","last_name":"Schmickl","first_name":"Thomas"},{"full_name":"Stradner, Jürgen","first_name":"Jürgen","last_name":"Stradner"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"},{"last_name":"Levi","first_name":"Paul","full_name":"Levi, Paul"},{"full_name":"Kernbach, Serge","first_name":"Serge","last_name":"Kernbach"}],"publication_status":"published","date_updated":"2022-01-06T06:53:51Z","page":"240--263","publisher":"Springer","_id":"18761","language":[{"iso":"eng"}],"user_id":"15415"},{"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18910","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":282,"user_id":"5786","publication_identifier":{"isbn":["978-3-942647-01-4"]},"author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"}],"title":"Page migration in dynamic networks","status":"public","year":"2010","intvolume":"       282","date_updated":"2022-01-06T06:53:54Z","date_created":"2020-09-03T07:52:47Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"mla":"Bienkowski, Marcin. <i>Page Migration in Dynamic Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","apa":"Bienkowski, M. (2010). <i>Page migration in dynamic networks</i> (Vol. 282). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"M. Bienkowski, <i>Page migration in dynamic networks</i>, vol. 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","chicago":"Bienkowski, Marcin. <i>Page Migration in Dynamic Networks</i>. Vol. 282. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"M. Bienkowski, Page Migration in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ama":"Bienkowski M. <i>Page Migration in Dynamic Networks</i>. Vol 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","bibtex":"@book{Bienkowski_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Page migration in dynamic networks}, volume={282}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bienkowski, Marcin}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2005010135","relation":"confirmation"}]}},{"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"bibtex":"@book{Dynia_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Collective graph exploration}, volume={284}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dynia, Miroslaw}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Dynia M. <i>Collective Graph Exploration</i>. Vol 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","mla":"Dynia, Miroslaw. <i>Collective Graph Exploration</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","chicago":"Dynia, Miroslaw. <i>Collective Graph Exploration</i>. Vol. 284. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"M. Dynia, Collective Graph Exploration, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ieee":"M. Dynia, <i>Collective graph exploration</i>, vol. 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","apa":"Dynia, M. (2010). <i>Collective graph exploration</i> (Vol. 284). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080225031","relation":"confirmation"}]},"date_created":"2020-09-03T10:21:10Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"status":"public","title":"Collective graph exploration","year":"2010","publication_identifier":{"isbn":["978-3-942647-03-8"]},"author":[{"last_name":"Dynia","first_name":"Miroslaw","full_name":"Dynia, Miroslaw"}],"date_updated":"2022-01-06T06:53:54Z","intvolume":"       284","_id":"18927","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":284},{"status":"public","_id":"19011","page":"562-584","volume":57,"user_id":"15415","citation":{"bibtex":"@article{Degener_Gehweiler_Lammersen_2010, title={Kinetic Facility Location}, volume={57}, DOI={<a href=\"https://doi.org/10.1007/s00453-008-9250-7\">10.1007/s00453-008-9250-7</a>}, number={3}, journal={Algorithmica}, author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2010}, pages={562–584} }","ama":"Degener B, Gehweiler J, Lammersen C. Kinetic Facility Location. <i>Algorithmica</i>. 2010;57(3):562-584. doi:<a href=\"https://doi.org/10.1007/s00453-008-9250-7\">10.1007/s00453-008-9250-7</a>","mla":"Degener, Bastian, et al. “Kinetic Facility Location.” <i>Algorithmica</i>, vol. 57, no. 3, 2010, pp. 562–84, doi:<a href=\"https://doi.org/10.1007/s00453-008-9250-7\">10.1007/s00453-008-9250-7</a>.","short":"B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584.","chicago":"Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “Kinetic Facility Location.” <i>Algorithmica</i> 57, no. 3 (2010): 562–84. <a href=\"https://doi.org/10.1007/s00453-008-9250-7\">https://doi.org/10.1007/s00453-008-9250-7</a>.","ieee":"B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” <i>Algorithmica</i>, vol. 57, no. 3, pp. 562–584, 2010.","apa":"Degener, B., Gehweiler, J., &#38; Lammersen, C. (2010). Kinetic Facility Location. <i>Algorithmica</i>, <i>57</i>(3), 562–584. <a href=\"https://doi.org/10.1007/s00453-008-9250-7\">https://doi.org/10.1007/s00453-008-9250-7</a>"},"author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"full_name":"Lammersen, Christiane","first_name":"Christiane","last_name":"Lammersen"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"title":"Kinetic Facility Location","year":"2010","intvolume":"        57","publication_status":"published","date_updated":"2022-01-06T06:53:57Z","language":[{"iso":"eng"}],"doi":"10.1007/s00453-008-9250-7","issue":"3","publication":"Algorithmica","date_created":"2020-09-04T10:35:36Z","department":[{"_id":"63"}],"type":"journal_article"},{"date_updated":"2022-01-06T06:53:57Z","publication_status":"published","author":[{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"full_name":"Meyerhenke, Henning","last_name":"Meyerhenke","first_name":"Henning"}],"publication_identifier":{"isbn":["9781424465330"]},"status":"public","title":"A distributed diffusive heuristic for clustering a virtual P2P supercomputer","year":"2010","doi":"10.1109/ipdpsw.2010.5470922","user_id":"15415","language":[{"iso":"eng"}],"_id":"19013","citation":{"ama":"Gehweiler J, Meyerhenke H. A distributed diffusive heuristic for clustering a virtual P2P supercomputer. In: <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">10.1109/ipdpsw.2010.5470922</a>","bibtex":"@inproceedings{Gehweiler_Meyerhenke_2010, title={A distributed diffusive heuristic for clustering a virtual P2P supercomputer}, DOI={<a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">10.1109/ipdpsw.2010.5470922</a>}, booktitle={Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)}, author={Gehweiler, Joachim and Meyerhenke, Henning}, year={2010} }","mla":"Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer.” <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>, 2010, doi:<a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">10.1109/ipdpsw.2010.5470922</a>.","short":"J. Gehweiler, H. Meyerhenke, in: Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010.","chicago":"Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer.” In <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>, 2010. <a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">https://doi.org/10.1109/ipdpsw.2010.5470922</a>.","apa":"Gehweiler, J., &#38; Meyerhenke, H. (2010). A distributed diffusive heuristic for clustering a virtual P2P supercomputer. In <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>. <a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">https://doi.org/10.1109/ipdpsw.2010.5470922</a>","ieee":"J. Gehweiler and H. Meyerhenke, “A distributed diffusive heuristic for clustering a virtual P2P supercomputer,” in <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>, 2010."},"publication":"Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-04T10:39:37Z"},{"date_created":"2020-09-04T10:45:47Z","department":[{"_id":"63"}],"type":"conference","citation":{"mla":"Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning and Graph Clustering Using Diffusion.” <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>, 2010.","ama":"Gehweiler J, Meyerhenke H. On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In: <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>. ; 2010.","bibtex":"@inproceedings{Gehweiler_Meyerhenke_2010, title={On Dynamic Graph Partitioning and Graph Clustering using Diffusion}, booktitle={Dagstuhl Seminar Proceedings 10261: Algorithm Engineering}, author={Gehweiler, Joachim and Meyerhenke, Henning}, year={2010} }","apa":"Gehweiler, J., &#38; Meyerhenke, H. (2010). On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>.","ieee":"J. Gehweiler and H. Meyerhenke, “On Dynamic Graph Partitioning and Graph Clustering using Diffusion,” in <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>, 2010.","short":"J. Gehweiler, H. Meyerhenke, in: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010.","chicago":"Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning and Graph Clustering Using Diffusion.” In <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>, 2010."},"publication":"Dagstuhl Seminar Proceedings 10261: Algorithm Engineering","abstract":[{"lang":"eng","text":"Load balancing is an important requirement for the efficient execu-tion of parallel numerical simulations. In particular when the simulation domainchanges over time, the mapping of computational tasks to processors needs tobe  modified  accordingly.  State-of-the-art  libraries  for  this  problem  are  basedon graph repartitioning. They have a number of drawbacks, including the opti-mized metric and the difficulty of parallelizing the popular repartitioning heuris-tic Kernighan-Lin (KL).Here we further explore the very promising diffusion-based graph partitioningalgorithm DIBAP (Meyerhenke et al., JPDC 69(9):750–761, 2009) by adaptingDIBAP  to  the  related  problem  of  load  balancing.  Experiments  with  graph  se-quences that imitate adaptive numerical simulations demonstrate the applicabilityand high quality of DIBAP for load balancing by repartitioning. Compared to thefaster state-of-the-art repartitioners PARMETIS and parallel JOSTLE, DIBAP’ssolutions have partitions with significantly fewer external edges and boundarynodes  and  the  resulting  average  migration  volume  in  the  important  maximumnorm is also the best in most cases.We also prove that one of DIBAP’s key components optimizes a relaxed versionof the minimum edge cut problem. Moreover, we hint at a distributed algorithmbased on ideas used in DIBAP for clustering a virtual P2P supercomputer."}],"related_material":{"link":[{"relation":"confirmation","url":"https://drops.dagstuhl.de/opus/volltexte/2010/2798/pdf/10261.MeyerhenkeHenning.Paper.2798.pdf"}]},"_id":"19016","language":[{"iso":"eng"}],"user_id":"15415","author":[{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"first_name":"Henning","last_name":"Meyerhenke","full_name":"Meyerhenke, Henning"}],"status":"public","title":"On Dynamic Graph Partitioning and Graph Clustering using Diffusion","year":"2010","date_updated":"2022-01-06T06:53:57Z"},{"citation":{"bibtex":"@book{Thies_Gehweiler_2010, title={Thread Migration and Checkpointing in Java}, author={Thies, Michael and Gehweiler, Joachim}, year={2010} }","ama":"Thies M, Gehweiler J. <i>Thread Migration and Checkpointing in Java</i>.; 2010.","mla":"Thies, Michael, and Joachim Gehweiler. <i>Thread Migration and Checkpointing in Java</i>. 2010.","chicago":"Thies, Michael, and Joachim Gehweiler. <i>Thread Migration and Checkpointing in Java</i>, 2010.","short":"M. Thies, J. Gehweiler, Thread Migration and Checkpointing in Java, 2010.","ieee":"M. Thies and J. Gehweiler, <i>Thread Migration and Checkpointing in Java</i>. 2010.","apa":"Thies, M., &#38; Gehweiler, J. (2010). <i>Thread Migration and Checkpointing in Java</i>."},"file_date_updated":"2020-09-04T10:54:26Z","department":[{"_id":"63"}],"type":"report","date_created":"2020-09-04T10:54:43Z","file":[{"date_updated":"2020-09-04T10:54:26Z","relation":"main_file","file_size":240725,"access_level":"closed","file_name":"tr-ri-10-315.pdf","success":1,"content_type":"application/pdf","file_id":"19020","creator":"koala","date_created":"2020-09-04T10:54:26Z"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:53:57Z","author":[{"full_name":"Thies, Michael","last_name":"Thies","first_name":"Michael"},{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"}],"year":"2010","title":"Thread Migration and Checkpointing in Java","status":"public","ddc":["000"],"user_id":"15415","_id":"19018","language":[{"iso":"eng"}]},{"date_created":"2020-09-04T11:53:40Z","department":[{"_id":"63"},{"_id":"238"}],"type":"conference","citation":{"mla":"Kernbach, Serge, et al. “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.” <i>Artificial Life XII (ALife XII)</i>, MIT Press, 2010, pp. 781–88.","apa":"Kernbach, S., Schmickl, T., Hamann, H., Stradner, J., Schlachter, F., Schwarzer, C. s. F., … Matthias, R. (2010). Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In <i>Artificial Life XII (ALife XII)</i> (pp. 781–788). MIT Press.","ieee":"S. Kernbach <i>et al.</i>, “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics,” in <i>Artificial Life XII (ALife XII)</i>, 2010, pp. 781–788.","short":"S. Kernbach, T. Schmickl, H. Hamann, J. Stradner, F. Schlachter, C. s. F. Schwarzer, A.F.T. Winfield, R. Matthias, in: Artificial Life XII (ALife XII), MIT Press, 2010, pp. 781–788.","ama":"Kernbach S, Schmickl T, Hamann H, et al. Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In: <i>Artificial Life XII (ALife XII)</i>. MIT Press; 2010:781-788.","chicago":"Kernbach, Serge, Thomas Schmickl, Heiko Hamann, Jürgen Stradner, Florian Schlachter, Christopher s. F. Schwarzer, Alan F. T. Winfield, and Rene Matthias. “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.” In <i>Artificial Life XII (ALife XII)</i>, 781–88. MIT Press, 2010.","bibtex":"@inproceedings{Kernbach_Schmickl_Hamann_Stradner_Schlachter_Schwarzer_Winfield_Matthias_2010, title={Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics}, booktitle={Artificial Life XII (ALife XII)}, publisher={MIT Press}, author={Kernbach, Serge and Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Schlachter, Florian and Schwarzer, Christopher s. F. and Winfield, Alan F. T. and Matthias, Rene}, year={2010}, pages={781–788} }"},"publication":"Artificial Life XII (ALife XII)","_id":"19023","language":[{"iso":"eng"}],"publisher":"MIT Press","page":"781-788","user_id":"15415","author":[{"full_name":"Kernbach, Serge","first_name":"Serge","last_name":"Kernbach"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"last_name":"Stradner","first_name":"Jürgen","full_name":"Stradner, Jürgen"},{"full_name":"Schlachter, Florian","last_name":"Schlachter","first_name":"Florian"},{"full_name":"Schwarzer, Christopher s. F.","last_name":"Schwarzer","first_name":"Christopher s. F."},{"last_name":"Winfield","first_name":"Alan F. T.","full_name":"Winfield, Alan F. T."},{"first_name":"Rene","last_name":"Matthias","full_name":"Matthias, Rene"}],"year":"2010","title":"Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics","status":"public","date_updated":"2022-01-06T06:53:57Z","publication_status":"published"},{"status":"public","title":"Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing","year":"2010","publication_identifier":{"isbn":["9783642175718","9783642175725"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Briest","first_name":"Patrick","full_name":"Briest, Patrick"},{"full_name":"Chalermsook, Parinya","last_name":"Chalermsook","first_name":"Parinya"},{"last_name":"Khanna","first_name":"Sanjeev","full_name":"Khanna, Sanjeev"},{"full_name":"Laekhanukit, Bundit","last_name":"Laekhanukit","first_name":"Bundit"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"publication_status":"published","date_updated":"2022-01-06T06:53:57Z","language":[{"iso":"eng"}],"_id":"19029","user_id":"15415","doi":"10.1007/978-3-642-17572-5_37","publication":"Workshop on Internet and Network Economics (WINE)","citation":{"apa":"Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., &#38; Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In <i>Workshop on Internet and Network Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>","ieee":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in <i>Workshop on Internet and Network Economics (WINE)</i>, 2010.","short":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in: Workshop on Internet and Network Economics (WINE), 2010.","chicago":"Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” In <i>Workshop on Internet and Network Economics (WINE)</i>, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>.","mla":"Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” <i>Workshop on Internet and Network Economics (WINE)</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>.","ama":"Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In: <i>Workshop on Internet and Network Economics (WINE)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>","bibtex":"@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>}, booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}, year={2010} }"},"date_created":"2020-09-04T12:01:18Z","type":"conference","department":[{"_id":"63"}]},{"year":"2010","title":"Algorithmische Grundlagen verteilter Speichersysteme","status":"public","author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:53:57Z","page":"468--474","language":[{"iso":"eng"}],"_id":"1903","doi":"10.1007/s00287-010-0470-2","user_id":"14955","publication":"Informatik Spektrum","issue":"5","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” <i>Informatik Spektrum</i>, no. 5, pp. 468--474, 2010.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>, (5), 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5 (2010): 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>.","short":"F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5, 2010, pp. 468--474, doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>.","bibtex":"@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen verteilter Speichersysteme}, DOI={<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>}, number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2010}, pages={468--474} }","ama":"Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>. 2010;(5):468--474. doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>"},"date_created":"2018-03-28T07:21:50Z","type":"journal_article","department":[{"_id":"79"},{"_id":"63"}]},{"publication_status":"published","date_updated":"2022-01-06T06:53:57Z","year":"2010","status":"public","title":"Pricing Randomized Allocations","publication_identifier":{"isbn":["9780898717013","9781611973075"]},"author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"},{"first_name":"Shuchi","last_name":"Chawla","full_name":"Chawla, Shuchi"},{"full_name":"Kleinberg, Robert","last_name":"Kleinberg","first_name":"Robert"},{"full_name":"Weinberg, S. Matthew","last_name":"Weinberg","first_name":"S. Matthew"}],"user_id":"15415","doi":"10.1137/1.9781611973075.49","language":[{"iso":"eng"}],"_id":"19033","publication":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","citation":{"bibtex":"@inproceedings{Briest_Chawla_Kleinberg_Weinberg_2010, title={Pricing Randomized Allocations}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973075.49\">10.1137/1.9781611973075.49</a>}, booktitle={Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert and Weinberg, S. Matthew}, year={2010} }","short":"P. Briest, S. Chawla, R. Kleinberg, S.M. Weinberg, in: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.","ama":"Briest P, Chawla S, Kleinberg R, Weinberg SM. Pricing Randomized Allocations. In: <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>. ; 2010. doi:<a href=\"https://doi.org/10.1137/1.9781611973075.49\">10.1137/1.9781611973075.49</a>","chicago":"Briest, Patrick, Shuchi Chawla, Robert Kleinberg, and S. Matthew Weinberg. “Pricing Randomized Allocations.” In <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2010. <a href=\"https://doi.org/10.1137/1.9781611973075.49\">https://doi.org/10.1137/1.9781611973075.49</a>.","ieee":"P. Briest, S. Chawla, R. Kleinberg, and S. M. Weinberg, “Pricing Randomized Allocations,” in <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2010.","apa":"Briest, P., Chawla, S., Kleinberg, R., &#38; Weinberg, S. M. (2010). Pricing Randomized Allocations. In <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>. <a href=\"https://doi.org/10.1137/1.9781611973075.49\">https://doi.org/10.1137/1.9781611973075.49</a>","mla":"Briest, Patrick, et al. “Pricing Randomized Allocations.” <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2010, doi:<a href=\"https://doi.org/10.1137/1.9781611973075.49\">10.1137/1.9781611973075.49</a>."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-04T12:15:39Z"},{"date_updated":"2022-01-06T06:53:57Z","author":[{"first_name":"Cyril","last_name":"Gavoille","full_name":"Gavoille, Cyril"},{"last_name":"Patt-Shamir","first_name":"Boaz","full_name":"Patt-Shamir, Boaz"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"year":"2010","title":"Foreword","status":"public","doi":"10.1007/s00224-010-9284-5","user_id":"15504","_id":"1904","page":"809--810","citation":{"mla":"Gavoille, Cyril, et al. “Foreword.” <i>Theory of Computing Systems</i>, no. 4, 2010, pp. 809--810, doi:<a href=\"https://doi.org/10.1007/s00224-010-9284-5\">10.1007/s00224-010-9284-5</a>.","ama":"Gavoille C, Patt-Shamir B, Scheideler C. Foreword. <i>Theory of Computing Systems</i>. 2010;(4):809--810. doi:<a href=\"https://doi.org/10.1007/s00224-010-9284-5\">10.1007/s00224-010-9284-5</a>","bibtex":"@article{Gavoille_Patt-Shamir_Scheideler_2010, title={Foreword}, DOI={<a href=\"https://doi.org/10.1007/s00224-010-9284-5\">10.1007/s00224-010-9284-5</a>}, number={4}, journal={Theory of Computing Systems}, author={Gavoille, Cyril and Patt-Shamir, Boaz and Scheideler, Christian}, year={2010}, pages={809--810} }","apa":"Gavoille, C., Patt-Shamir, B., &#38; Scheideler, C. (2010). Foreword. <i>Theory of Computing Systems</i>, (4), 809--810. <a href=\"https://doi.org/10.1007/s00224-010-9284-5\">https://doi.org/10.1007/s00224-010-9284-5</a>","ieee":"C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” <i>Theory of Computing Systems</i>, no. 4, pp. 809--810, 2010.","short":"C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810.","chicago":"Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.” <i>Theory of Computing Systems</i>, no. 4 (2010): 809--810. <a href=\"https://doi.org/10.1007/s00224-010-9284-5\">https://doi.org/10.1007/s00224-010-9284-5</a>."},"publication":"Theory of Computing Systems","issue":"4","department":[{"_id":"79"}],"type":"journal_article","date_created":"2018-03-28T07:22:21Z"},{"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-04T14:05:30Z","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100421015","relation":"confirmation"}]},"citation":{"apa":"Mahlmann, P. (2010). <i>Peer-to-peer networks based on random graphs</i> (Vol. 283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"P. Mahlmann, <i>Peer-to-peer networks based on random graphs</i>, vol. 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"P. Mahlmann, Peer-to-Peer Networks Based on Random Graphs, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","chicago":"Mahlmann, Peter. <i>Peer-to-Peer Networks Based on Random Graphs</i>. Vol. 283. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","mla":"Mahlmann, Peter. <i>Peer-to-Peer Networks Based on Random Graphs</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ama":"Mahlmann P. <i>Peer-to-Peer Networks Based on Random Graphs</i>. Vol 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","bibtex":"@book{Mahlmann_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-peer networks based on random graphs}, volume={283}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mahlmann, Peter}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"user_id":"5786","volume":283,"_id":"19041","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:57Z","intvolume":"       283","year":"2010","status":"public","title":"Peer-to-peer networks based on random graphs","publication_identifier":{"isbn":["978-3-942647-02-1"]},"author":[{"full_name":"Mahlmann, Peter","last_name":"Mahlmann","first_name":"Peter"}]},{"date_created":"2020-09-04T14:08:57Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"citation":{"chicago":"Degener, Bastian. <i>Local, Distributed Approximation Algorithms for Geometric Assignment Problems</i>. Vol. 278. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"B. Degener, Local, Distributed Approximation Algorithms for Geometric Assignment Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","apa":"Degener, B. (2010). <i>Local, distributed approximation algorithms for geometric assignment problems</i> (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"B. Degener, <i>Local, distributed approximation algorithms for geometric assignment problems</i>, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ama":"Degener B. <i>Local, Distributed Approximation Algorithms for Geometric Assignment Problems</i>. Vol 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","bibtex":"@book{Degener_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local, distributed approximation algorithms for geometric assignment problems}, volume={278}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Degener, Bastian}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Degener, Bastian. <i>Local, Distributed Approximation Algorithms for Geometric Assignment Problems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010."},"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100429011","relation":"confirmation"}]},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19042","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"user_id":"5786","volume":278,"title":"Local, distributed approximation algorithms for geometric assignment problems","status":"public","year":"2010","author":[{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"}],"publication_identifier":{"isbn":["978-3-939350-97-2 "]},"date_updated":"2022-01-06T06:53:57Z","intvolume":"       278"},{"publication_identifier":{"isbn":["978-3-642-12199-9"]},"author":[{"full_name":"Gall, Dominik","last_name":"Gall","first_name":"Dominik"},{"first_name":"Riko","last_name":"Jacob","full_name":"Jacob, Riko"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Täubig","first_name":"Hanjo","full_name":"Täubig, Hanjo"}],"title":"Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization","year":"2010","status":"public","intvolume":"      6034","date_updated":"2022-01-06T06:53:57Z","series_title":"Lecture Notes in Computer Science","_id":"1905","publisher":"Springer","page":"294--305","volume":6034,"user_id":"15504","doi":"10.1007/978-3-642-12200-2_27","citation":{"ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization,” in <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, 2010, vol. 6034, pp. 294--305.","apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &#38; Täubig, H. (2010). Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i> (Vol. 6034, pp. 294--305). Springer. <a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">https://doi.org/10.1007/978-3-642-12200-2_27</a>","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.” In <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, 6034:294--305. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">https://doi.org/10.1007/978-3-642-12200-2_27</a>.","short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.","mla":"Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.” <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, vol. 6034, Springer, 2010, pp. 294--305, doi:<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>.","bibtex":"@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2010, series={Lecture Notes in Computer Science}, title={Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization}, volume={6034}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>}, booktitle={LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2010}, pages={294--305}, collection={Lecture Notes in Computer Science} }","ama":"Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In: <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>. Vol 6034. Lecture Notes in Computer Science. Springer; 2010:294--305. doi:<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>"},"publication":"LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings","date_created":"2018-03-28T07:22:42Z","department":[{"_id":"79"}],"type":"conference"}]