![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Peter Gritzmann
Person information
- affiliation: Technical University Munich, Germany
- award (1992): Max Planck Research Award
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j49]Andreas Alpers
, Maximilian Fiedler, Peter Gritzmann
, Fabian Klemm:
Turning Grain Maps into Diagrams. SIAM J. Imaging Sci. 16(1): 223-249 (2023) - [j48]Martin Bichler
, Peter Gritzmann
, Paul Karaenke
, Michael Ritter
:
On Airport Time Slot Auctions: A Market Design Complying with the IATA Scheduling Guidelines. Transp. Sci. 57(1): 27-51 (2023) - 2022
- [j47]Christoph Hartmann
, Daniel Opritescu, Wolfram Volk
, Felix Schmiedl, Michael Ritter
, Peter Gritzmann
:
A knowledge-based automated driving approach for flexible production of individualized sheet metal parts. Knowl. Based Syst. 244: 108558 (2022) - [i26]Maximilian Fiedler, Peter Gritzmann:
Coresets for Weight-Constrained Anisotropic Assignment and Clustering. CoRR abs/2203.10864 (2022) - [i25]Andreas Alpers, Maximilian Fiedler, Peter Gritzmann, Fabian Klemm:
Turning grain maps into diagrams. CoRR abs/2205.06650 (2022) - 2021
- [j46]Frank Reinhold, Christian Schons
, Sarah Scheuerer
, Peter Gritzmann, Jürgen Richter-Gebert, Kristina M. Reiss:
Students' coping with the self-regulatory demand of crisis-driven digitalization in university mathematics instruction: do motivational and emotional orientations make a difference? Comput. Hum. Behav. 120: 106732 (2021) - 2020
- [j45]Peter Gritzmann
, Barbara Langfeld
:
On Polyatomic Tomography over Abelian Groups: Some Remarks on Consistency, Tree Packings and Complexity. Discret. Comput. Geom. 64(2): 290-303 (2020)
2010 – 2019
- 2018
- [j44]Stefano Campi, Peter Gritzmann
, Paolo Gronchi:
On the Reverse Loomis-Whitney Inequality. Discret. Comput. Geom. 60(1): 115-144 (2018) - [j43]Andreas Alpers
, Peter Gritzmann
:
On Double-Resolution Imaging and Discrete Tomography. SIAM J. Discret. Math. 32(2): 1369-1399 (2018) - [i24]Andreas Alpers, Peter Gritzmann:
On the Reconstruction of Static and Dynamic Discrete Structures. CoRR abs/1809.06141 (2018) - 2017
- [j42]Bo Chen
, Peter Gritzmann, Silvano Martello:
Combinatorial optimization: theory, computation, and applications. Discret. Appl. Math. 217: 1-2 (2017) - [j41]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) - [j40]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) - [j39]Andreas Alpers
, Peter Gritzmann:
Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums. Fundam. Informaticae 155(4): 321-340 (2017) - [j38]Susanne Albers, Martin Bichler, Felix Brandt, Peter Gritzmann, Rainer Kolisch:
Algorithmic Economics und Operations Research. Inform. Spektrum 40(2): 165-171 (2017) - [j37]Franziska Berger, Peter Gritzmann, Sven de Vries:
Computing cyclic invariants for molecular graphs. Networks 70(2): 116-131 (2017) - [p3]Susanne Albers, Martin Bichler, Felix Brandt, Peter Gritzmann, Rainer Kolisch:
Algorithmic Economics und Operations Research. 50 Jahre Universitäts-Informatik in München 2017: 129-139 - [i23]Andreas Alpers, Peter Gritzmann:
On double-resolution imaging in discrete tomography. CoRR abs/1701.04399 (2017) - [i22]Andreas Alpers, Peter Gritzmann:
Reconstructing binary matrices under window constraints from their row and column sums. CoRR abs/1702.06121 (2017) - [i21]Andreas Brieden, Peter Gritzmann, Fabian Klemm:
Electoral District Design via Constrained Clustering. CoRR abs/1703.02867 (2017) - [i20]Andreas Alpers, Peter Gritzmann:
Dynamic Discrete Tomography. CoRR abs/1712.04217 (2017) - 2015
- [j36]Andreas Alpers
, Peter Gritzmann, Dmitry Moseev, Mirko Salewski
:
3D particle tracking velocimetry using dynamic discrete tomography. Comput. Phys. Commun. 187: 130-136 (2015) - [p2]Eleanor Anthony, Sheridan Grant, Peter Gritzmann, J. Maurice Rojas:
Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving. Topological and Statistical Methods for Complex Data, Tackling Large-Scale, High-Dimensional, and Multivariate Data Spaces 2015: 255-277 - 2013
- [i19]Steffen Borgwardt, Andreas Brieden, Peter Gritzmann:
A balanced k-means algorithm for weighted point sets. CoRR abs/1308.4004 (2013) - [i18]Eleanor Anthony, Sheridan Grant, Peter Gritzmann, J. Maurice Rojas:
Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving. CoRR abs/1312.6547 (2013) - 2012
- [j35]Andreas Brieden, Peter Gritzmann:
On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams. SIAM J. Discret. Math. 26(2): 415-434 (2012) - [c9]Andreas Brieden, Peter Gritzmann, Michael Öllinger:
Optimal Robustness of Supply Chains. CTW 2012: 34 - [c8]Andreas Brieden, Peter Gritzmann, Bernhard Reinbold:
A Posteriori Vehicle Fleet Optimization and Scenario Evaluation. CTW 2012: 35 - 2011
- [j34]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) - [j33]Peter Gritzmann, Barbara Langfeld, Markus Wiegelmann:
Uniqueness in Discrete Tomography: Three Remarks and a Corollary. SIAM J. Discret. Math. 25(4): 1589-1599 (2011) - 2010
- [j32]Andreas Brieden, Peter Gritzmann:
On Clustering Bodies: Geometry and Polyhedral Approximation. Discret. Comput. Geom. 44(3): 508-534 (2010) - [j31]Peter Gritzmann, Michael Ritter, Paul Zuber:
Optimal wire ordering and spacing in low power semiconductor design. Math. Program. 121(2): 201-220 (2010)
2000 – 2009
- 2009
- [j30]Peter Gritzmann, Bernd Sturmfels, Günter M. Ziegler
:
Guest Editors' Foreword. Discret. Comput. Geom. 42(2): 131 (2009) - [c7]Franziska Berger, Peter Gritzmann, Sven de Vries:
Minimum Cycle Bases and Their Applications. Algorithmics of Large and Complex Networks 2009: 34-49 - 2008
- [j29]Peter Gritzmann, Barbara Langfeld:
On the index of Siegel grids and its application to the tomography of quasicrystals. Eur. J. Comb. 29(8): 1894-1909 (2008) - [j28]Sara Brunetti
, Alberto Del Lungo, Peter Gritzmann, Sven de Vries:
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints. Theor. Comput. Sci. 406(1-2): 63-71 (2008) - 2007
- [p1]Peter Gritzmann:
On the Mathematics of Semantic Spaces. Aspects of Automatic Text Analysis 2007: 95-115 - 2006
- [j27]Andreas Alpers
, Peter Gritzmann:
On Stability, Error Correction, and Noise Compensation in Discrete Tomography. SIAM J. Discret. Math. 20(1): 227-239 (2006) - 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 - [j26]Christian Huck, Michael Baake, Barbara Langfeld, Peter Gritzmann, Katja Lord:
Discrete Tomography of Mathematcal Quasicrystals: A Primer. Electron. Notes Discret. Math. 20: 179-191 (2005) - [c6]Paul Zuber, Peter Gritzmann, Michael Ritter, Walter Stechele:
The Optimal Wire Order for Low Power CMOS. PATMOS 2005: 674-683 - 2004
- [j25]Franziska Berger, Peter Gritzmann, Sven de Vries:
Minimum Cycle Bases for Network Graphs. Algorithmica 40(1): 51-62 (2004) - [j24]René Brandenberg
, Abhi Dattasharma, Peter Gritzmann, David G. Larman:
Isoradial Bodies. Discret. Comput. Geom. 32(4): 447-457 (2004) - [r1]Peter Gritzmann, Victor Klee:
Computational Convexity. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 693-718 - 2003
- [j23]Peter Gritzmann:
Stability Issues for Determination and Verification in Discrete Tomography. Electron. Notes Discret. Math. 12: 384 (2003) - 2002
- [j22]Peter Gritzmann, Sven de Vries:
On the algorithmic inversion of the discrete Radon transform. Theor. Comput. Sci. 281(1-2): 455-469 (2002) - 2000
- [j21]Thomas Burger, Peter Gritzmann:
Finding Optimal Shadows of Polytopes. Discret. Comput. Geom. 24(2-3): 219-240 (2000) - [j20]Andreas Brieden, Peter Gritzmann, Victor Klee:
Oracle-polynomial-time approximation of largest simplices in convex bodies. Discret. Math. 221(1-3): 79-92 (2000) - [j19]Peter Gritzmann, Sven de Vries, Markus Wiegelmann:
Approximating Binary Images from Discrete X-Rays. SIAM J. Optim. 11(2): 522-546 (2000) - [j18]R. J. Gardner, Peter Gritzmann, Dieter Prangenberg:
On the computational complexity of determining polyatomic structures by X-rays. Theor. Comput. Sci. 233(1-2): 91-106 (2000) - [c5]Andreas Alpers
, Peter Gritzmann, Lionel Thorens:
Stability and Instability in Discrete Tomography. Digital and Image Geometry 2000: 175-186
1990 – 1999
- 1999
- [j17]Richard J. Gardner, Peter Gritzmann, Dieter Prangenberg:
On the computational complexity of reconstructing lattice sets from their X-rays. Discret. Math. 202(1-3): 45-71 (1999) - 1998
- [j16]Peter Gritzmann, Dieter Prangenberg, Sven de Vries, Markus Wiegelmann:
Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography. Int. J. Imaging Syst. Technol. 9(2-3): 101-109 (1998) - [j15]Martin E. Dyer
, Peter Gritzmann, Alexander Hufnagel:
On the Complexity of Computing Mixed Volumes. SIAM J. Comput. 27(2): 356-400 (1998) - [c4]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
- [j14]Peter Gritzmann:
Guest Editor's Foreword. Discret. Comput. Geom. 17(4): 363-364 (1997) - [j13]Andreas Brieden, Peter Gritzmann:
On Helly's Theorem: Algorithms and Extensions. Discret. Comput. Geom. 17(4): 393-410 (1997) - [c3]Peter Gritzmann:
On the Reconstruction of Finite Lattice Sets from their X-Rays. DGCI 1997: 19-32 - [i17]Peter Gritzmann, Victor Klee:
Separation by Hyperplanes in Finite-Dimensional Vector Spaces Over Archimedean Ordered Fields. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-02 (1997) - 1996
- [i16]Thomas Burger, Peter Gritzmann:
Polytopes in Combinatorial Optimization. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-08 (1996) - [i15]R. J. Gardner, Peter Gritzmann, Dieter Prangenberg:
On the Reconstruction of Binary Images from Their Discrete Radon Transforms. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-24 (1996) - [i14]Peter Gritzmann, Victor Klee:
Computational Convexity. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-25 (1996) - [i13]Andreas Brieden, Peter Gritzmann:
On Helly's Theorem: Algorithms and Extensions. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-28 (1996) - 1995
- [j12]Peter Gritzmann, Victor Klee, David G. Larman:
Largest j-Simplices n-Polytopes. Discret. Comput. Geom. 13: 477-515 (1995) - [c2]Peter Gritzmann, Alexander Hufnagel:
A Polynomial Time Algorithm for Minkowski Reconstruction. SCG 1995: 1-9 - [i12]R. J. Gardner, Peter Gritzmann:
Discrete Tomography: Determination of Finite Sets by X-Rays. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-13 (1995) - [i11]Thomas Burger, Peter Gritzmann, Victor Klee:
Polytope Projection and Projection Polytopes. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-14 (1995) - [i10]Peter Gritzmann, Alexander Hufnagel:
On the Algorithmic Complexity of Minkowski's Reconstruction Theorem. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-15 (1995) - 1994
- [j11]Peter Gritzmann, Victor Klee:
On the complexity of some basic problems in computational convexity: I. Containment problems. Discret. Math. 136(1-3): 129-174 (1994) - [i9]Peter Gritzmann, Victor Klee, David G. Larman:
Largest j-Simplices in n-Polytopes. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-01 (1994) - [i8]Peter Gritzmann, Victor Klee:
On the Complexity of some Basic Problems in Computational Convexity: II. Volume and mixed volumes. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-07 (1994) - 1993
- [j10]Peter Gritzmann, Victor Klee:
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Program. 59: 163-213 (1993) - [j9]Peter Gritzmann, Bernd Sturmfels:
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Basis. SIAM J. Discret. Math. 6(2): 246-269 (1993) - [i7]Peter Gritzmann, Victor Klee:
Computational Complexity of Inner and Outer j-RADII of Polytopes in Finite-Dimensional Normed Spaces. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-06 (1993) - [i6]Peter Gritzmann, Victor Klee:
External Tangents and Closedness of Cone + Subspace. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-14 (1993) - [i5]Peter Gritzmann, Victor Klee, B. S. Tam:
Cross-Positive Matrices Revisited. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-17 (1993) - [i4]Peter Gritzmann, Victor Klee:
On the Complexity of some Basic Problems in Computational Convexity: 1. Containment Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-18 (1993) - 1992
- [j8]Peter Gritzmann, Victor Klee:
Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces. Discret. Comput. Geom. 7: 255-280 (1992) - [j7]Peter Gritzmann, Victor Klee:
Deciding uniqueness in norm maximization. Math. Program. 57: 203-214 (1992) - [i3]R. J. Gardner, Peter Gritzmann:
Successive Determination and Verification of Polytopes by their X-Rays. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-03 (1992) - [i2]Peter Gritzmann, Bernd Sturmfels:
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-06 (1992) - [i1]Peter Gritzmann, Victor Klee, John Westwater:
Polytope Containment and Determination by Linear Probes. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-26 (1992) - 1991
- [j6]David W. Barnette, Peter Gritzmann, Rainer Höhne:
On valences of polyhedra. J. Comb. Theory A 58(2): 279-300 (1991) - [j5]Peter Gritzmann, Laurent Habsieger, Victor Klee:
Good and Bad Radii of Convex Polygons. SIAM J. Comput. 20(2): 395-403 (1991) - [e1]Peter Gritzmann, Bernd Sturmfels:
Applied Geometry And Discrete Mathematics, Proceedings of a DIMACS Workshop, Providence, Rhode Island, USA, September 18, 1990. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4, DIMACS/AMS 1991, ISBN 978-0-8218-6593-4 [contents] - 1990
- [j4]Hans L. Bodlaender
, Peter Gritzmann, Victor Klee, Jan van Leeuwen:
Computational complexity of norm-maximization. Comb. 10(2): 203-225 (1990) - [c1]Peter Gritzmann, Victor Klee, John Westwater:
On the Limited Power of Linear Probes and Other Optimization Oracles. SCG 1990: 92-101
1980 – 1989
- 1989
- [j3]Gábor Fejes Tóth, Peter Gritzmann, Jörg M. Wills:
Finite Sphere Packing and Sphere Covering. Discret. Comput. Geom. 4: 19-40 (1989) - [j2]Peter Gritzmann, Marek Lassak:
Estimates for the Minimal Width of Polytopes Inscribed in Convex Bodies. Discret. Comput. Geom. 4: 627-635 (1989) - 1986
- [j1]Ulrich Betke, Peter Gritzmann:
An application of valuation theory to two problems in discrete geometry. Discret. Math. 58(1): 81-85 (1986)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint