default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRené Brandenberg
Person information
- affiliation: Technical University Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2005
[b1]Peter Gritzmann, René Brandenberg:
Das Geheimnis des kürzesten Weges - ein mathematisches Abenteuer (3. Aufl.). Springer 2005, ISBN 978-3-540-22193-7, pp. 1-362
Journal Articles
- 2022
- [j9]René Brandenberg
, Katherina von Dichter, Bernardo González Merino:
Relating Symmetrizations of Convex Bodies: Once More the Golden Ratio. Am. Math. Mon. 129(4): 352-362 (2022) - 2021
- [j8]René Brandenberg, Paul Stursberg:
Refined cut selection for benders decomposition: applied to network capacity expansion problems. Math. Methods Oper. Res. 94(3): 383-412 (2021) - 2017
- [j7]René Brandenberg, Matthias Huber, Matthias Silbernagl:
The summed start-up costs in a unit commitment problem. EURO J. Comput. Optim. 5(1-2): 203-238 (2017) - 2013
- [j6]René Brandenberg, Stefan König:
No Dimension-Independent Core-Sets for Containment Under Homothetics. Discret. Comput. Geom. 49(1): 3-21 (2013) - 2011
- [j5]René Brandenberg, Lucia Roth:
Minimal containment under homothetics: a simple cutting plane approach. Comput. Optim. Appl. 48(2): 325-340 (2011) - 2009
- [j4]René Brandenberg, Lucia Roth:
New algorithms for k-center and extensions. J. Comb. Optim. 18(4): 376-392 (2009) - 2005
- [j3]René Brandenberg:
Radii of Regular Polytopes. Discret. Comput. Geom. 33(1): 43-55 (2005) - 2004
- [j2]René Brandenberg, Thorsten Theobald:
Algebraic Methods for Computing Smallest Enclosing and Circumscribing Cylinders of Simplices. Appl. Algebra Eng. Commun. Comput. 14(6): 439-460 (2004) - [j1]René Brandenberg, Abhi Dattasharma, Peter Gritzmann, David G. Larman:
Isoradial Bodies. Discret. Comput. Geom. 32(4): 447-457 (2004)
Conference and Workshop Papers
- 2011
- [c2]René Brandenberg, Stefan König:
No dimension independent core-sets for containment under homothetics. SCG 2011: 464-471 - 2008
- [c1]René Brandenberg, Lucia Roth:
New Algorithms for k-Center and Extensions. COCOA 2008: 64-78
Informal and Other Publications
- 2013
- [i4]René Brandenberg, Stefan König:
Sharpening Geometric Inequalities using Computable Symmetry Measures. CoRR abs/1310.4368 (2013) - 2010
- [i3]René Brandenberg, Stefan König:
No dimension independent Core-Sets for Containment under Homothetics. CoRR abs/1010.4229 (2010) - 2005
- [i2]René Brandenberg, Thorsten Theobald:
Exact analysis of optimal configurations in radii computations. EuroCG 2005: 135-138 - 2002
- [i1]René Brandenberg, Thorsten Theobald:
Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices. CoRR math.OC/0211344 (2002)
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-10-07 22:21 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:
