Peter Gritzmann

According to our database1, Peter Gritzmann authored at least 74 papers between 1986 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
On Double-Resolution Imaging and Discrete Tomography.
SIAM J. Discrete Math., 2018

On the Reverse Loomis-Whitney Inequality.
Discrete & Computational Geometry, 2018

2017
Computing cyclic invariants for molecular graphs.
Networks, 2017

Algorithmic Economics und Operations Research.
Informatik Spektrum, 2017

Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums.
Fundam. Inform., 2017

Constrained clustering via diagrams: A unified theory and its application to electoral district design.
European Journal of Operational Research, 2017

An LP-based k-means algorithm for balancing weighted point sets.
European Journal of Operational Research, 2017

Combinatorial optimization: theory, computation, and applications.
Discrete Applied Mathematics, 2017

2015
3D particle tracking velocimetry using dynamic discrete tomography.
Computer Physics Communications, 2015

Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving.
Proceedings of the Green in Software Engineering, 2015

2012
On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams.
SIAM J. Discrete Math., 2012

A Posteriori Vehicle Fleet Optimization and Scenario Evaluation.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Optimal Robustness of Supply Chains.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Uniqueness in Discrete Tomography: Three Remarks and a Corollary.
SIAM J. Discrete Math., 2011

Constrained Minimum-k-Star Clustering and its application to the consolidation of farmland.
Operational Research, 2011

2010
Optimal wire ordering and spacing in low power semiconductor design.
Math. Program., 2010

On Clustering Bodies: Geometry and Polyhedral Approximation.
Discrete & Computational Geometry, 2010

2009
Guest Editors' Foreword.
Discrete & Computational Geometry, 2009

Minimum Cycle Bases and Their Applications.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints.
Theor. Comput. Sci., 2008

On the index of Siegel grids and its application to the tomography of quasicrystals.
Eur. J. Comb., 2008

2007
On the Mathematics of Semantic Spaces.
Proceedings of the Aspects of Automatic Text Analysis, 2007

2006
On Stability, Error Correction, and Noise Compensation in Discrete Tomography.
SIAM J. Discrete Math., 2006

2005
Discrete Tomography of Mathematcal Quasicrystals: A Primer.
Electronic Notes in Discrete Mathematics, 2005

The Optimal Wire Order for Low Power CMOS.
Proceedings of the Integrated Circuit and System Design, 2005

Das Geheimnis des kürzesten Weges - ein mathematisches Abenteuer (3. Aufl.).
Springer, ISBN: 978-3-540-22193-7, 2005

2004
Computational Convexity.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Isoradial Bodies.
Discrete & Computational Geometry, 2004

Minimum Cycle Bases for Network Graphs.
Algorithmica, 2004

2003
Stability Issues for Determination and Verification in Discrete Tomography.
Electronic Notes in Discrete Mathematics, 2003

2002
On the algorithmic inversion of the discrete Radon transform.
Theor. Comput. Sci., 2002

2000
On the computational complexity of determining polyatomic structures by X-rays.
Theor. Comput. Sci., 2000

Approximating Binary Images from Discrete X-Rays.
SIAM Journal on Optimization, 2000

Oracle-polynomial-time approximation of largest simplices in convex bodies.
Discrete Mathematics, 2000

Finding Optimal Shadows of Polytopes.
Discrete & Computational Geometry, 2000

Stability and Instability in Discrete Tomography.
Proceedings of the Digital and Image Geometry, 2000

1999
On the computational complexity of reconstructing lattice sets from their X-rays.
Discrete Mathematics, 1999

1998
On the Complexity of Computing Mixed Volumes.
SIAM J. Comput., 1998

Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography.
Int. J. Imaging Systems and Technology, 1998

Approximation of Diameters: Randomization Doesn't Help.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Separation by Hyperplanes in Finite-Dimensional Vector Spaces Over Archimedean Ordered Fields
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Guest Editor's Foreword.
Discrete & Computational Geometry, 1997

On Helly's Theorem: Algorithms and Extensions.
Discrete & Computational Geometry, 1997

On the Reconstruction of Finite Lattice Sets from their X-Rays.
Proceedings of the Discrete Geometry for Computer Imagery, 1997

1996
On Helly's Theorem: Algorithms and Extensions
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Computational Convexity
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

On the Reconstruction of Binary Images from Their Discrete Radon Transforms
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Polytopes in Combinatorial Optimization
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

1995
On the Algorithmic Complexity of Minkowski's Reconstruction Theorem
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Polytope Projection and Projection Polytopes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Discrete Tomography: Determination of Finite Sets by X-Rays
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Largest j-Simplices n-Polytopes.
Discrete & Computational Geometry, 1995

A Polynomial Time Algorithm for Minkowski Reconstruction.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
On the Complexity of some Basic Problems in Computational Convexity: II. Volume and mixed volumes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

Largest j-Simplices in n-Polytopes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

On the complexity of some basic problems in computational convexity: I. Containment problems.
Discrete Mathematics, 1994

1993
On the Complexity of some Basic Problems in Computational Convexity: 1. Containment Problems
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Cross-Positive Matrices Revisited
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

External Tangents and Closedness of Cone + Subspace
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Computational Complexity of Inner and Outer j-RADII of Polytopes in Finite-Dimensional Normed Spaces
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Basis.
SIAM J. Discrete Math., 1993

Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces.
Math. Program., 1993

1992
Polytope Containment and Determination by Linear Probes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Successive Determination and Verification of Polytopes by their X-Rays
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Deciding uniqueness in norm maximization.
Math. Program., 1992

Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces.
Discrete & Computational Geometry, 1992

1991
Good and Bad Radii of Convex Polygons.
SIAM J. Comput., 1991

On valences of polyhedra.
J. Comb. Theory, Ser. A, 1991

1990
Computational complexity of norm-maximization.
Combinatorica, 1990

On the Limited Power of Linear Probes and Other Optimization Oracles.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Finite Sphere Packing and Sphere Covering.
Discrete & Computational Geometry, 1989

Estimates for the Minimal Width of Polytopes Inscribed in Convex Bodies.
Discrete & Computational Geometry, 1989

1986
An application of valuation theory to two problems in discrete geometry.
Discrete Mathematics, 1986


  Loading...