default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBastian Degener
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j4]Bastian Degener, Barbara Kempkes, Peter Kling
, Friedhelm Meyer auf der Heide:
Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM Trans. Parallel Comput. 2(1): 2:1-2:18 (2015)- 2013
- [j3]Philipp Brandes, Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
Energy-efficient strategies for building short chains of mobile robots locally. Theor. Comput. Sci. 509: 97-112 (2013) - 2011
- [j2]Bastian Degener, Sándor P. Fekete, Barbara Kempkes, Friedhelm Meyer auf der Heide:
A survey on relay placement with runtime and approximation guarantees. Comput. Sci. Rev. 5(1): 57-68 (2011) - [c14]Sebastian Abshoff, Andreas Cord-Landwehr, Bastian Degener, Barbara Kempkes, Peter Pietrzyk:
Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. ALGOSENSORS 2011: 13-27 - [c13]Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot, Daniel Warner, Christoph Weddemann, Daniel Wonisch:
A New Approach for Analyzing Convergence Algorithms for Mobile Robots. ICALP (2) 2011: 650-661 - [c12]Philipp Brandes, Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. SIROCCO 2011: 138-149 - [c11]Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot, Daniel Warner, Christoph Weddemann, Daniel Wonisch:
Collisionless Gathering of Robots with an Extent. SOFSEM 2011: 178-189 - [c10]Bastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, Roger Wattenhofer:
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. SPAA 2011: 139-148 - [c9]Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
Building Simple Formations in Large Societies of Tiny Mobile Robots. FET 2011: 153-155 - [p1]Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
Energy-Awareness in Self-organising Robotic Exploration Teams. Organic Computing 2011: 531-543 - [i2]Patrick Briest, Bastian Degener, Barbara Kempkes, Peter Kling, Peter Pietrzyk:
A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model. CoRR abs/1105.1248 (2011) - 2010
- [b1]Bastian Degener:
Local, distributed approximation algorithms for geometric assignment problems. University of Paderborn, 2010, ISBN 978-3-939350-97-2, pp. 1-117 - [j1]Bastian Degener, Joachim Gehweiler, Christiane Lammersen:
Kinetic Facility Location. Algorithmica 57(3): 562-584 (2010) - [c8]Bastian Degener, Barbara Kempkes, Peter Pietrzyk:
A local, distributed constant-factor approximation algorithm for the dynamic facility location problem. IPDPS 2010: 1-10 - [c7]Bastian Degener, Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide:
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. SIROCCO 2010: 168-182 - [c6]Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
A local O(n2) gathering algorithm. SPAA 2010: 217-223
2000 – 2009
- 2009
- [c5]Olaf Bonorden, Bastian Degener, Barbara Kempkes, Peter Pietrzyk:
Complexity and Approximation of a Geometric Local Robot Assignment Problem. ALGOSENSORS 2009: 252-262 - [c4]Wilhelm Dangelmaier, Bastian Degener:
Online Optimization with Discrete Lotsizing Production and Rolling Horizons. LDIC 2009: 37-48 - [i1]Wilhelm Dangelmaier, Bastian Degener:
Production planning and control with discrete lotsizing and a rolling horizon. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [c3]Bastian Degener, Joachim Gehweiler, Christiane Lammersen:
The Kinetic Facility Location Problem. SWAT 2008: 378-389 - 2004
- [c2]Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener:
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN 2004: 21-30 - [c1]Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener:
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN 2004: 31-40
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
