According to our database
1,
Günter M. Ziegler
authored at least 65 papers
between 1986 and 2020.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2020
Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles.
Exp. Math., 2020
Characterizing Face and Flag Vector Pairs for Polytopes.
Discret. Comput. Geom., 2020
Plus Minus Analogues for Affine Tverberg Type Results.
Discret. Comput. Geom., 2020
2019
Convex Equipartitions of Colored Point Sets.
Discret. Comput. Geom., 2019
Tverberg-Type Theorems for Matroids: A Counterexample and a Proof.
Comb., 2019
2018
Small f-vectors of 3-spheres and of 4-polytopes.
Math. Comput., 2018
2016
Thirtieth Anniversary Note from the Editors in Chief.
Discret. Comput. Geom., 2016
2015
Many non-equivalent realizations of the associahedron.
Comb., 2015
2014
Foldable Triangulations of Lattice Polygons.
Am. Math. Mon., 2014
2013
Face Numbers of Centrally Symmetric Polytopes Produced from Split Graphs.
Electron. J. Comb., 2013
2012
Invited talk: Cannons at Sparrows.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012
2011
A Lost Counterexample and a Problem on Illuminated Polytopes.
Am. Math. Mon., 2011
Projecting Lattice Polytopes Without Interior Lattice Points.
Math. Oper. Res., 2011
Letter from the New Editors-in-Chief.
Discret. Comput. Geom., 2011
2010
Construction and Analysis of Projected Deformed Products.
Discret. Comput. Geom., 2010
2009
Combinatorial Stokes formulas via minimal resolutions.
J. Comb. Theory A, 2009
Computeralgebra in Forschung und Lehre; Primzahltests und Primzahlrekorde.
Inform. Spektrum, 2009
On Kalai's Conjectures Concerning Centrally Symmetric Polytopes.
Discret. Comput. Geom., 2009
Zonotopes with Large 2D-Cuts.
Discret. Comput. Geom., 2009
Discret. Comput. Geom., 2009
Tetrahedra on Deformed and Integral Group Cohomology.
Electron. J. Comb., 2009
2007
On generalized Kneser hypergraph colorings.
J. Comb. Theory A, 2007
2006
Singular 0/1-Matrices, and the Hyperplanes Spanned by Random 0/1-Vectors.
Comb. Probab. Comput., 2006
2005
The Topological Tverberg Theorem and winding numbers.
J. Comb. Theory A, 2005
Discret. Comput. Geom., 2005
2004
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
Basic Properties of Convex Polytopes.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
The Simplex Algorithm in Dimension Three.
SIAM J. Comput., 2004
Convex hulls, oracles, and homology.
J. Symb. Comput., 2004
Construction Techniques for Cubical Complexes, Odd Cubical 4-Polytopes, and Prescribed Dual Manifolds.
Exp. Math., 2004
On the Monotone Upper Bound Problem.
Exp. Math., 2004
The E <sub>t</sub>-Construction for Lattices, Spheres and Polytopes.
Discret. Comput. Geom., 2004
Random monotone paths on polyhedra.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004
Typical and Extremal Linear Programs.
Proceedings of the Sharpest Cut, 2004
Proofs from THE BOOK (3. ed.).
Springer, ISBN: 978-3-540-40460-6, 2004
2002
Examples and Counterexamples for the Perles Conjecture.
Discret. Comput. Geom., 2002
2001
Zonotopes associated with higher Bruhat orders.
Discret. Math., 2001
Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001
2000
Combinatorics of Polytopes - Preface.
Eur. J. Comb., 2000
On the Maximal Width of Empty Lattice Simplices.
Eur. J. Comb., 2000
Neighborly Cubical Polytopes.
Discret. Comput. Geom., 2000
1999
Hilbert Bases, Unimodular Triangulations, and Binary Covers of Rational Polyhedral Cones.
Discret. Comput. Geom., 1999
1998
Shellability of Complexes of Trees.
J. Comb. Theory A, 1998
Shelling Polyhedral 3-Balls and 4-Polytopes.
Discret. Comput. Geom., 1998
Randomized Simplex Algorithms on Klee-Minty Cubes.
Comb., 1998
1997
A Variant of the Buchberger Algorithm for Integer Programming.
SIAM J. Discret. Math., 1997
Lê Numbers of Arrangements and Matroid Identities.
J. Comb. Theory B, 1997
Extremal Properties of 0/1-Polytopes.
Discret. Comput. Geom., 1997
1996
Projections of Polytopes and the Generalized Baues Conjecture.
Discret. Comput. Geom., 1996
Shadows and Slices of Polytopes.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
1995
0/1-Integer Programming: Optimization and Augmentation are Equivalent.
Proceedings of the Algorithms, 1995
1994
Maximizing Möbius functions on subsets of Boolean algebras.
Discret. Math., 1994
Randomized Simplex Algorithms on Klee-Mintny Cubes
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1993
"What Is a Complex Matroid?".
Discret. Comput. Geom., 1993
Extension Spaces of Oriented Matroids.
Discret. Comput. Geom., 1993
Combinatorial Models for the Finite-Dimensional Grassmannians.
Discret. Comput. Geom., 1993
Topological Representation of Dual Pairs of Oriented Matroids.
Discret. Comput. Geom., 1993
1991
Posets with maximal Möbius function.
J. Comb. Theory A, 1991
Broken circuit complexes: Factorizations and generalizations.
J. Comb. Theory B, 1991
Supersolvable and Modularly Complemented Matroid Extensions.
Eur. J. Comb., 1991
1990
Hyperplane Arrangements with a Lattice of Regions.
Discret. Comput. Geom., 1990
1989
The face lattice of hyperplane arrangements.
Discret. Math., 1989
1988
Branchings in rooted graphs and the diameter of greedoids.
Comb., 1988
1986
On the poset of partitions of an integer.
J. Comb. Theory A, 1986
