default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Brieden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j8]Andreas Brieden, Peter Gritzmann, Fabian Klemm:
Constrained clustering via diagrams: A unified theory and its application to electoral district design. Eur. J. Oper. Res. 263(1): 18-34 (2017)- [j7]Steffen Borgwardt, Andreas Brieden, Peter Gritzmann:
An LP-based k-means algorithm for balancing weighted point sets. Eur. J. Oper. Res. 263(2): 349-355 (2017) - [i3]Andreas Brieden, Peter Gritzmann, Fabian Klemm:
Electoral District Design via Constrained Clustering. CoRR abs/1703.02867 (2017) - 2013
- [i2]Steffen Borgwardt, Andreas Brieden, Peter Gritzmann:
A balanced k-means algorithm for weighted point sets. CoRR abs/1308.4004 (2013) - 2012
- [j6]Andreas Brieden, Peter Gritzmann:
On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams. SIAM J. Discret. Math. 26(2): 415-434 (2012) - [c3]Andreas Brieden, Peter Gritzmann, Michael Öllinger:
Optimal Robustness of Supply Chains. CTW 2012: 34 - [c2]Andreas Brieden, Peter Gritzmann, Bernhard Reinbold:
A Posteriori Vehicle Fleet Optimization and Scenario Evaluation. CTW 2012: 35 - [e1]Andreas Brieden, Zafer-Korcan Görgülü, Tino Krug, Erik Kropat, Silja Meyer-Nieberg, Goran Mihelcic, Stefan Wolfgang Pickl:
11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts. 2012, ISBN 978-3-943207-05-7 [contents] - 2011
- [j5]Steffen Borgwardt, Andreas Brieden, Peter Gritzmann:
Constrained Minimum-k-Star Clustering and its application to the consolidation of farmland. Oper. Res. 11(1): 1-17 (2011) - 2010
- [j4]Andreas Brieden, Peter Gritzmann:
On Clustering Bodies: Geometry and Polyhedral Approximation. Discret. Comput. Geom. 44(3): 508-534 (2010)
2000 – 2009
- 2002
- [j3]Andreas Brieden:
Geometric Optimization Problems Likely Not Contained in $$\mathbb{A}\mathbb{P}\mathbb{X}$$. Discret. Comput. Geom. 28(2): 201-209 (2002) - 2000
- [j2]Andreas Brieden, Peter Gritzmann, Victor Klee:
Oracle-polynomial-time approximation of largest simplices in convex bodies. Discret. Math. 221(1-3): 79-92 (2000)
1990 – 1999
- 1998
- [c1]Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits:
Approximation of Diameters: Randomization Doesn't Help. FOCS 1998: 244-251 - 1997
- [j1]Andreas Brieden, Peter Gritzmann:
On Helly's Theorem: Algorithms and Extensions. Discret. Comput. Geom. 17(4): 393-410 (1997) - 1996
- [i1]Andreas Brieden, Peter Gritzmann:
On Helly's Theorem: Algorithms and Extensions. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-28 (1996)
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-04-25 05:44 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:
