default search action
Matthias Schymura
Person information
- affiliation: Freie Universität Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Gennadiy Averkov, Matthias Schymura
:
On the maximal number of columns of a Δ-modular integer matrix: bounds and computations. Math. Program. 206(1): 61-89 (2024) - 2023
- [j15]Matthias Schymura
Lifts for Voronoi Cells of Lattices. Discret. Comput. Geom. 70(3): 845-865 (2023) - [j14]Gennadiy Averkov
Computational aspects of relaxation complexity: possibilities and limitations. Math. Program. 197(2): 1173-1200 (2023) - [j13]Gennadiy Averkov
Efficient MIP techniques for computing the relaxation complexity. Math. Program. Comput. 15(3): 549-580 (2023) - 2022
- [j12]Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura:
Computing the Covering Radius of a Polytope with an Application to Lonely Runners. Comb. 42(4): 463-490 (2022) - [j11]Giulia Codenotti, Francisco Santos
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices. Discret. Comput. Geom. 67(1): 65-111 (2022) - [j10]Gennadiy Averkov, Matthias Schymura
Complexity of linear relaxations in integer programming. Math. Program. 194(1): 191-227 (2022) - [c5]Gennadiy Averkov
On the Maximal Number of Columns of a $\varDelta $-modular Matrix. IPCO 2022: 29-42 - 2021
- [c4]Gennadiy Averkov
Computational Aspects of Relaxation Complexity. IPCO 2021: 368-382 - [i5]Matthias Schymura, Ina Seidel, Stefan Weltge:
Lifts for Voronoi cells of lattices. CoRR abs/2106.04432 (2021) - 2020
- [j9]Christoph Hunkenschröder
On compact representations of Voronoi cells of lattices. Math. Program. 183(1): 337-358 (2020) - [i4]Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura
Computing the covering radius of a polytope with an application to lonely runners. CoRR abs/2009.12080 (2020)
2010 – 2019
- 2019
- [j8]Matthias Beck, Serkan Hosten, Matthias Schymura:
Lonely Runner Polyhedra. Integers 19: A29 (2019) - [c3]Christoph Hunkenschröder
On Compact Representations of Voronoi Cells of Lattices. IPCO 2019: 261-274 - 2018
- [j7]Rinat Ben Avraham, Matthias Henze
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms. Algorithmica 80(8): 2400-2421 (2018) - [i3]Christoph Hunkenschröder, Gina Reuland, Matthias Schymura:
On compact representations of Voronoi cells of lattices. CoRR abs/1811.08532 (2018) - 2017
- [j6]Gennadiy Averkov, Bernardo González Merino
Tight bounds on discrete quantitative Helly numbers. Adv. Appl. Math. 89: 76-101 (2017) - [j5]Bernardo González Merino
On Densities of Lattice Arrangements Intersecting Every i-Dimensional Affine Subspace. Discret. Comput. Geom. 58(3): 663-685 (2017) - 2016
- [j4]Matthias Henze
Bottleneck partial-matching Voronoi diagrams and applications. Comput. Geom. 51: 40-54 (2016) - 2014
- [j3]Matthias Henze:
On Counterexamples to a Conjecture of Wills and Ehrhart Polynomials whose Roots have Equal Real Parts. Electron. J. Comb. 21(1): 1 (2014) - [c2]Rinat Ben Avraham, Matthias Henze
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. ESA 2014: 100-111 - [c1]Matthias Henze
Bottleneck Partial-Matching Voronoi Diagrams and Applications. ISAAC 2014: 714-725 - [i2]Matthias Henze, Rafel Jaume:
Bottleneck Partial-Matching Voronoi Diagrams. CoRR abs/1405.0900 (2014) - [i1]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms. CoRR abs/1411.7273 (2014) - 2013
- [j2]Ragnar Freij, Matthias Henze, Moritz W. Schmitt, Günter M. Ziegler:
Face Numbers of Centrally Symmetric Polytopes Produced from Split Graphs. Electron. J. Comb. 20(2): 32 (2013) - 2011
- [j1]Christian Bey, Martin Henk
Notes on lattice points of zonotopes and lattice-face polytopes. Discret. Math. 311(8-9): 634-644 (2011)
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-03 21:18 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: