default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAchill Schürmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j17]Mathieu Dutour Sikiric
, Achill Schürmann, Frank Vallentin:
A simplex algorithm for rational cp-factorization. Math. Program. 187(1): 25-45 (2021)
2010 – 2019
- 2018
- [j16]Frieder Ladisch, Achill Schürmann:
Equivalence of Lattice Orbit Polytopes. SIAM J. Appl. Algebra Geom. 2(2): 259-280 (2018) - 2015
- [j15]Katrin Herr, Thomas Rehn, Achill Schürmann:
On Lattice-Free Orbit Polytopes. Discret. Comput. Geom. 53(1): 144-172 (2015) - 2014
- [j14]David Bremner, Mathieu Dutour Sikiric, Dmitrii V. Pasechnik, Thomas Rehn, Achill Schürmann:
Computing symmetry groups of polyhedra. LMS J. Comput. Math. 17(1): 565-581 (2014) - 2013
- [j13]Katrin Herr, Thomas Rehn, Achill Schürmann:
Exploiting symmetry in integer convex optimization using core points. Oper. Res. Lett. 41(3): 298-304 (2013) - [j12]Achill Schürmann:
Exploiting polyhedral symmetries in social choice. Soc. Choice Welf. 40(4): 1097-1110 (2013) - [c2]Henry Cohn, Abhinav Kumar, Christian Reiher, Achill Schürmann:
Formal duality and generalizations of the Poisson summation formula. Discrete Geometry and Algebraic Combinatorics 2013 - 2012
- [j11]Jacques Martinet Wolfgang Keller, Achill Schürmann, Mathieu Dutour Sikiric:
On classifying Minkowskian sublattices. Math. Comput. 81(278): 1063-1092 (2012) - 2011
- [j10]Lenny Fukshansky, Achill Schürmann:
Bounds on generalized Frobenius numbers. Eur. J. Comb. 32(3): 361-368 (2011) - 2010
- [j9]Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin:
The Contact Polytope of the Leech Lattice. Discret. Comput. Geom. 44(4): 904-911 (2010) - [c1]Thomas Rehn, Achill Schürmann:
C++ Tools for Exploiting Polyhedral Symmetries. ICMS 2010: 295-298
2000 – 2009
- 2009
- [j8]Brandon Ballinger, Grigoriy Blekherman, Henry Cohn, Noah Giansiracusa, Elizabeth Kelly, Achill Schürmann:
Experimental Study of Energy-Minimizing Point Configurations on Spheres. Exp. Math. 18(3): 257-283 (2009) - [j7]Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin:
Complexity and algorithms for computing Voronoi cells of lattices. Math. Comput. 78(267): 1713-1731 (2009) - 2008
- [i2]Mathieu Dutour Sikiric, Achill Schürmann, Frank Vallentin:
Complexity and algorithms for computing Voronoi cells of lattices. CoRR abs/0804.0036 (2008) - 2007
- [j6]Francisco Santos, Achill Schürmann, Frank Vallentin:
Lattice Delone simplices with super-exponential volume. Eur. J. Comb. 28(3): 801-806 (2007) - [i1]David Bremner, Mathieu Dutour Sikiric, Achill Schürmann:
Polyhedral representation conversion up to symmetries. CoRR abs/math/0702239 (2007) - 2006
- [j5]Achill Schürmann, Frank Vallentin:
Computational Approaches to Lattice Packing and Covering Problems. Discret. Comput. Geom. 35(1): 73-116 (2006) - [j4]Achill Schürmann:
Instability of discrete point sets. Period. Math. Hung. 53(1-2): 257-264 (2006) - 2002
- [j3]Achill Schürmann:
On Extremal Finite Packings. Discret. Comput. Geom. 28(3): 389-403 (2002) - [j2]Achill Schürmann:
Dense ellipsoid packings. Discret. Math. 247(1-3): 243-249 (2002) - [j1]Uwe Schnell, Achill Schürmann:
A criterion for finite lattice coverings. Period. Math. Hung. 45(1-2): 131-134 (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 2025-01-20 22:55 CET 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:
