Peter Gritzmann

Jürgen Richter-Gebert

Kristina M. Reiss

Comput. Hum. Behav., 2021

2020

On Polyatomic Tomography over Abelian Groups: Some Remarks on Consistency, Tree Packings and Complexity.

[BibT_eX]

[DOI]

Barbara Langfeld

Discret. Comput. Geom., 2020

2018

On Double-Resolution Imaging and Discrete Tomography.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

On the Reverse Loomis-Whitney Inequality.

[BibT_eX]

[DOI]

Stefano Campi

Paolo Gronchi

Discret. Comput. Geom., 2018

On the Reconstruction of Static and Dynamic Discrete Structures.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Computing cyclic invariants for molecular graphs.

[BibT_eX]

[DOI]

Franziska Berger

Networks, 2017

Algorithmic Economics und Operations Research.

[BibT_eX]

[DOI]

Inform. Spektrum, 2017

Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Constrained clustering via diagrams: A unified theory and its application to electoral district design.

[BibT_eX]

[DOI]

Fabian Klemm

Eur. J. Oper. Res., 2017

An LP-based k-means algorithm for balancing weighted point sets.

[BibT_eX]

[DOI]

Steffen Borgwardt

Eur. J. Oper. Res., 2017

Combinatorial optimization: theory, computation, and applications.

[BibT_eX]

[DOI]

Bo Chen

Silvano Martello

Discret. Appl. Math., 2017

Dynamic Discrete Tomography.

[BibT_eX]

[DOI]

CoRR, 2017

Electoral District Design via Constrained Clustering.

[BibT_eX]

[DOI]

Fabian Klemm

CoRR, 2017

On double-resolution imaging in discrete tomography.

[BibT_eX]

[DOI]

CoRR, 2017

Algorithmic Economics und Operations Research.

[BibT_eX]

[DOI]

Proceedings of the 50 Jahre Universitäts-Informatik in München, 2017

2015

3D particle tracking velocimetry using dynamic discrete tomography.

[BibT_eX]

[DOI]

Comput. Phys. Commun., 2015

Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving.

[BibT_eX]

[DOI]

Proceedings of the Green in Software Engineering, 2015

2013

A balanced k-means algorithm for weighted point sets.

[BibT_eX]

[DOI]

Steffen Borgwardt

CoRR, 2013

Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving.

[BibT_eX]

[DOI]

CoRR, 2013

2012

On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

A Posteriori Vehicle Fleet Optimization and Scenario Evaluation.

[BibT_eX]

Bernhard Reinbold

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Optimal Robustness of Supply Chains.

[BibT_eX]

Michael Öllinger

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Uniqueness in Discrete Tomography: Three Remarks and a Corollary.

[BibT_eX]

[DOI]

Barbara Langfeld

Markus Wiegelmann

SIAM J. Discret. Math., 2011

Constrained Minimum-<i>k</i>-Star Clustering and its application to the consolidation of farmland.

[BibT_eX]

[DOI]

Steffen Borgwardt

Oper. Res., 2011

2010

Optimal wire ordering and spacing in low power semiconductor design.

[BibT_eX]

[DOI]

Michael Ritter

Paul Zuber

Math. Program., 2010

On Clustering Bodies: Geometry and Polyhedral Approximation.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

2009

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Bernd Sturmfels

Günter M. Ziegler

Discret. Comput. Geom., 2009

Minimum Cycle Bases and Their Applications.

[BibT_eX]

[DOI]

Franziska Berger

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

On the reconstruction of binary and permutation matrices under (binary) tomographic constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

On the index of Siegel grids and its application to the tomography of quasicrystals.

[BibT_eX]

[DOI]

Barbara Langfeld

Eur. J. Comb., 2008

2007

On the Mathematics of Semantic Spaces.

[BibT_eX]

[DOI]

Proceedings of the Aspects of Automatic Text Analysis, 2007

2006

On Stability, Error Correction, and Noise Compensation in Discrete Tomography.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

2005

Discrete Tomography of Mathematcal Quasicrystals: A Primer.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

The Optimal Wire Order for Low Power CMOS.

[BibT_eX]

[DOI]

Proceedings of the Integrated Circuit and System Design, 2005

Das Geheimnis des kürzesten Weges - ein mathematisches Abenteuer (3. Aufl.).

[BibT_eX]

[DOI]

René Brandenberg

Springer, ISBN: 978-3-540-22193-7, 2005

2004

Computational Convexity.

[BibT_eX]

[DOI]

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

Isoradial Bodies.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2004

Minimum Cycle Bases for Network Graphs.

[BibT_eX]

[DOI]

Franziska Berger

Algorithmica, 2004

2003

Stability Issues for Determination and Verification in Discrete Tomography.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

2002

On the algorithmic inversion of the discrete Radon transform.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2000

On the computational complexity of determining polyatomic structures by X-rays.

[BibT_eX]

[DOI]

Dieter Prangenberg

Theor. Comput. Sci., 2000

Approximating Binary Images from Discrete X-Rays.

[BibT_eX]

[DOI]

Markus Wiegelmann

SIAM J. Optim., 2000

Oracle-polynomial-time approximation of largest simplices in convex bodies.

[BibT_eX]

[DOI]

Discret. Math., 2000

Finding Optimal Shadows of Polytopes.

[BibT_eX]

[DOI]

Thomas Burger

Discret. Comput. Geom., 2000

Stability and Instability in Discrete Tomography.

[BibT_eX]

[DOI]

Lionel Thorens

Proceedings of the Digital and Image Geometry, 2000

1999

On the computational complexity of reconstructing lattice sets from their X-rays.

[BibT_eX]

[DOI]

Richard J. Gardner

Dieter Prangenberg

Discret. Math., 1999

1998

On the Complexity of Computing Mixed Volumes.

[BibT_eX]

[DOI]

Martin E. Dyer

Alexander Hufnagel

SIAM J. Comput., 1998

Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography.

[BibT_eX]

[DOI]

Int. J. Imaging Syst. Technol., 1998

Approximation of Diameters: Randomization Doesn't Help.

[BibT_eX]

[DOI]

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

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Guest Editor's Foreword.

[BibT_eX]

Discret. Comput. Geom., 1997

On Helly's Theorem: Algorithms and Extensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1997

On the Reconstruction of Finite Lattice Sets from their X-Rays.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 1997

1996

Computational Convexity

[BibT_eX]

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

On the Reconstruction of Binary Images from Their Discrete Radon Transforms

[BibT_eX]

Dieter Prangenberg

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

Polytopes in Combinatorial Optimization

[BibT_eX]

Thomas Burger

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

1995

On the Algorithmic Complexity of Minkowski's Reconstruction Theorem

[BibT_eX]

Alexander Hufnagel

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Polytope Projection and Projection Polytopes

[BibT_eX]

Thomas Burger

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Discrete Tomography: Determination of Finite Sets by X-Rays

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Largest j-Simplices n-Polytopes.

[BibT_eX]

[DOI]

David G. Larman

Discret. Comput. Geom., 1995

A Polynomial Time Algorithm for Minkowski Reconstruction.

[BibT_eX]

[DOI]

Alexander Hufnagel

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

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

On the complexity of some basic problems in computational convexity: I. Containment problems.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

On the Complexity of some Basic Problems in Computational Convexity: 1. Containment Problems

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Cross-Positive Matrices Revisited

[BibT_eX]

B. S. Tam

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

External Tangents and Closedness of Cone + Subspace

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Basis.

[BibT_eX]

[DOI]

Bernd Sturmfels

SIAM J. Discret. Math., 1993

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

[BibT_eX]

[DOI]

Math. Program., 1993

1992

Polytope Containment and Determination by Linear Probes

[BibT_eX]

John Westwater

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases

[BibT_eX]

Bernd Sturmfels

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Successive Determination and Verification of Polytopes by their X-Rays

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Deciding uniqueness in norm maximization.

[BibT_eX]

[DOI]

Math. Program., 1992

Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

1991

Good and Bad Radii of Convex Polygons.

[BibT_eX]

[DOI]

Laurent Habsieger

SIAM J. Comput., 1991

On valences of polyhedra.

[BibT_eX]

[DOI]

David W. Barnette

Rainer Höhne

J. Comb. Theory A, 1991

1990

Computational complexity of norm-maximization.

[BibT_eX]

[DOI]

Comb., 1990

On the Limited Power of Linear Probes and Other Optimization Oracles.

[BibT_eX]

[DOI]

John Westwater

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Finite Sphere Packing and Sphere Covering.

[BibT_eX]

[DOI]

Gábor Fejes Tóth

Jörg M. Wills

Discret. Comput. Geom., 1989

Estimates for the Minimal Width of Polytopes Inscribed in Convex Bodies.

[BibT_eX]

[DOI]

Marek Lassak

Discret. Comput. Geom., 1989

1986

An application of valuation theory to two problems in discrete geometry.

[BibT_eX]

[DOI]

Ulrich Betke