default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGünter M. Ziegler
2020 – today
- 2020
[j55]Hannah Sjöberg, Günter M. Ziegler
:
Characterizing Face and Flag Vector Pairs for Polytopes. Discret. Comput. Geom. 64(1): 174-199 (2020)- [j54]Pavle V. M. Blagojevic, Günter M. Ziegler:
Plus Minus Analogues for Affine Tverberg Type Results. Discret. Comput. Geom. 64(2): 535-541 (2020) - [j53]Jean-Philippe Labbé, Günter Rote, Günter M. Ziegler:
Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles. Exp. Math. 29(3): 253-275 (2020)
2010 – 2019
- 2019
- [j52]Pavle V. M. Blagojevic, Albert Haase, Günter M. Ziegler:
Tverberg-Type Theorems for Matroids: A Counterexample and a Proof. Comb. 39(3): 477-500 (2019) - [j51]Pavle V. M. Blagojevic, Günter Rote, Johanna K. Steinmeyer, Günter M. Ziegler:
Convex Equipartitions of Colored Point Sets. Discret. Comput. Geom. 61(2): 355-363 (2019) - 2018
- [j50]Philip Brinkmann, Günter M. Ziegler:
Small f-vectors of 3-spheres and of 4-polytopes. Math. Comput. 87(314): 2955-2975 (2018) - 2016
- [j49]Kenneth L. Clarkson, János Pach, Günter M. Ziegler:
Thirtieth Anniversary Note from the Editors in Chief. Discret. Comput. Geom. 55(4): 745-747 (2016) - 2015
- [j48]Cesar Ceballos, Francisco Santos, Günter M. Ziegler:
Many non-equivalent realizations of the associahedron. Comb. 35(5): 513-551 (2015) - 2014
- [j47]Tuan Tran, Günter M. Ziegler:
Extremal Edge Polytopes. Electron. J. Comb. 21(2): 2 (2014) - [j46]Michael Joswig, Günter M. Ziegler:
Foldable Triangulations of Lattice Polygons. Am. Math. Mon. 121(8): 706-710 (2014) - 2013
- [j45]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) - 2012
- [c6]Günter M. Ziegler:
Invited talk: Cannons at Sparrows. CCCG 2012: 191 - 2011
- [j44]Herbert Edelsbrunner, János Pach, Günter M. Ziegler:
Letter from the New Editors-in-Chief. Discret. Comput. Geom. 45(1): 1-2 (2011) - [j43]Benjamin Nill, Günter M. Ziegler:
Projecting Lattice Polytopes Without Interior Lattice Points. Math. Oper. Res. 36(3): 462-467 (2011) - [j42]Ronald F. Wotzlaw, Günter M. Ziegler:
A Lost Counterexample and a Problem on Illuminated Polytopes. Am. Math. Mon. 118(6): 534-543 (2011) - 2010
- [j41]Raman Sanyal, Günter M. Ziegler:
Construction and Analysis of Projected Deformed Products. Discret. Comput. Geom. 43(2): 412-435 (2010)
2000 – 2009
- 2009
- [j40]Pavle V. M. Blagojevic, Günter M. Ziegler:
Tetrahedra on Deformed and Integral Group Cohomology. Electron. J. Comb. 16(2) (2009) - [j39]Raman Sanyal, Axel Werner, Günter M. Ziegler:
On Kalai's Conjectures Concerning Centrally Symmetric Polytopes. Discret. Comput. Geom. 41(2): 183-198 (2009) - [j38]Peter Gritzmann, Bernd Sturmfels, Günter M. Ziegler:
Guest Editors' Foreword. Discret. Comput. Geom. 42(2): 131 (2009) - [j37]Thilo Rörig, Nikolaus Witte, Günter M. Ziegler:
Zonotopes with Large 2D-Cuts. Discret. Comput. Geom. 42(4): 527-541 (2009) - [j36]Günter M. Ziegler:
Computeralgebra in Forschung und Lehre; Primzahltests und Primzahlrekorde. Inform. Spektrum 32(1): 33-36 (2009) - [j35]Bernhard Hanke, Raman Sanyal, Carsten Schultz, Günter M. Ziegler:
Combinatorial Stokes formulas via minimal resolutions. J. Comb. Theory A 116(2): 404-420 (2009) - 2007
- [j34]Carsten E. M. C. Lange, Günter M. Ziegler:
On generalized Kneser hypergraph colorings. J. Comb. Theory A 114(1): 159-166 (2007) - 2006
- [j33]Thomas Voigt, Günter M. Ziegler:
Singular 0/1-Matrices, and the Hyperplanes Spanned by Random 0/1-Vectors. Comb. Probab. Comput. 15(3): 463-471 (2006) - 2005
- [j32]Anders Björner, Andreas Paffenholz, Jonas Sjöstrand, Günter M. Ziegler:
Bier Spheres and Posets. Discret. Comput. Geom. 34(1): 71-86 (2005) - [j31]Torsten Schöneborn, Günter M. Ziegler:
The Topological Tverberg Theorem and winding numbers. J. Comb. Theory A 112(1): 82-104 (2005) - 2004
- [b1]Martin Aigner, Günter M. Ziegler:
Proofs from THE BOOK (3. ed.). Springer 2004, ISBN 978-3-540-40460-6, pp. I-VIII, 1-239 - [j30]Andreas Paffenholz, Günter M. Ziegler:
The E t-Construction for Lattices, Spheres and Polytopes. Discret. Comput. Geom. 32(4): 601-621 (2004) - [j29]Julian Pfeifle, Günter M. Ziegler:
On the Monotone Upper Bound Problem. Exp. Math. 13(1): 1-11 (2004) - [j28]Alexander Schwartz, Günter M. Ziegler:
Construction Techniques for Cubical Complexes, Odd Cubical 4-Polytopes, and Prescribed Dual Manifolds. Exp. Math. 13(4): 385-413 (2004) - [j27]Michael Joswig, Günter M. Ziegler:
Convex hulls, oracles, and homology. J. Symb. Comput. 38(4): 1247-1259 (2004) - [j26]Volker Kaibel, Rafael Mechtel, Micha Sharir, Günter M. Ziegler:
The Simplex Algorithm in Dimension Three. SIAM J. Comput. 34(2): 475-497 (2004) - [c5]Günter M. Ziegler:
Random monotone paths on polyhedra. SCG 2004: 56 - [p1]Günter M. Ziegler:
Typical and Extremal Linear Programs. The Sharpest Cut 2004: 217-230 - [r2]Jürgen Richter-Gebert, Günter M. Ziegler:
Oriented Matroids. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 129-151 - [r1]Martin Henk, Jürgen Richter-Gebert, Günter M. Ziegler:
Basic Properties of Convex Polytopes. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 355-382 - 2002
- [j25]Christian Haase, Günter M. Ziegler:
Examples and Counterexamples for the Perles Conjecture. Discret. Comput. Geom. 28(1): 29-44 (2002) - 2001
- [j24]Stefan Felsner, Günter M. Ziegler:
Zonotopes associated with higher Bruhat orders. Discret. Math. 241(1-3): 301-312 (2001) - [c4]Günter M. Ziegler:
Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. Computational Discrete Mathematics 2001: 159-172 - 2000
- [j23]Michael Joswig, Günter M. Ziegler:
Neighborly Cubical Polytopes. Discret. Comput. Geom. 24(2-3): 325-344 (2000) - [j22]Komei Fukuda, Günter M. Ziegler:
Combinatorics of Polytopes - Preface. Eur. J. Comb. 21(1): 1 (2000) - [j21]Christian Haase, Günter M. Ziegler:
On the Maximal Width of Empty Lattice Simplices. Eur. J. Comb. 21(1): 111-119 (2000)
1990 – 1999
- 1999
- [j20]Robert T. Firla, Günter M. Ziegler:
Hilbert Bases, Unimodular Triangulations, and Binary Covers of Rational Polyhedral Cones. Discret. Comput. Geom. 21(2): 205-216 (1999) - 1998
- [j19]Bernd Gärtner, Martin Henk, Günter M. Ziegler:
Randomized Simplex Algorithms on Klee-Minty Cubes. Comb. 18(3): 349-372 (1998) - [j18]Günter M. Ziegler:
Shelling Polyhedral 3-Balls and 4-Polytopes. Discret. Comput. Geom. 19(2): 159-174 (1998) - [j17]Henryk Trappmann, Günter M. Ziegler:
Shellability of Complexes of Trees. J. Comb. Theory A 82(2): 168-178 (1998) - 1997
- [j16]Ulrich Kortenkamp, Jürgen Richter-Gebert, Aravamuthan Sarangarajan, Günter M. Ziegler:
Extremal Properties of 0/1-Polytopes. Discret. Comput. Geom. 17(4): 439-448 (1997) - [j15]David B. Massey, Rodica Simion, Richard P. Stanley, Dirk L. Vertigan, Dominic J. A. Welsh, Günter M. Ziegler:
Lê Numbers of Arrangements and Matroid Identities. J. Comb. Theory B 70(1): 118-133 (1997) - [j14]Regina Urbaniak, Robert Weismantel, Günter M. Ziegler:
A Variant of the Buchberger Algorithm for Integer Programming. SIAM J. Discret. Math. 10(1): 96-108 (1997) - 1996
- [j13]Jörg Rambau, Günter M. Ziegler:
Projections of Polytopes and the Generalized Baues Conjecture. Discret. Comput. Geom. 16(3): 215-237 (1996) - [c3]Nina Amenta, Günter M. Ziegler:
Shadows and Slices of Polytopes. SCG 1996: 10-19 - 1995
- [c2]Andreas S. Schulz, Robert Weismantel, Günter M. Ziegler:
0/1-Integer Programming: Optimization and Augmentation are Equivalent. ESA 1995: 473-483 - 1994
- [j12]Bruce E. Sagan, Yeong-Nan Yeh, Günter M. Ziegler:
Maximizing Möbius functions on subsets of Boolean algebras. Discret. Math. 126(1-3): 293-311 (1994) - [c1]Bernd Gärtner, Günter M. Ziegler:
Randomized Simplex Algorithms on Klee-Mintny Cubes. FOCS 1994: 502-510 - 1993
- [j11]Bernd Sturmfels, Günter M. Ziegler:
Extension Spaces of Oriented Matroids. Discret. Comput. Geom. 10: 23-45 (1993) - [j10]Thomas H. Brylawski, Günter M. Ziegler:
Topological Representation of Dual Pairs of Oriented Matroids. Discret. Comput. Geom. 10: 237-240 (1993) - [j9]Nicolai E. Mnëv, Günter M. Ziegler:
Combinatorial Models for the Finite-Dimensional Grassmannians. Discret. Comput. Geom. 10: 241-250 (1993) - [j8]Günter M. Ziegler:
"What Is a Complex Matroid?". Discret. Comput. Geom. 10: 313-348 (1993) - 1991
- [j7]Thomas Wanner, Günter M. Ziegler:
Supersolvable and Modularly Complemented Matroid Extensions. Eur. J. Comb. 12(4): 341-360 (1991) - [j6]Anders Björner, Günter M. Ziegler:
Broken circuit complexes: Factorizations and generalizations. J. Comb. Theory B 51(1): 96-126 (1991) - [j5]Günter M. Ziegler:
Posets with maximal Möbius function. J. Comb. Theory A 56(2): 203-222 (1991) - 1990
- [j4]Anders Björner, Paul H. Edelman, Günter M. Ziegler:
Hyperplane Arrangements with a Lattice of Regions. Discret. Comput. Geom. 5: 263-288 (1990)
1980 – 1989
- 1989
- [j3]Günter M. Ziegler:
The face lattice of hyperplane arrangements. Discret. Math. 73(1-2): 233-238 (1989) - 1988
- [j2]Günter M. Ziegler:
Branchings in rooted graphs and the diameter of greedoids. Comb. 8(2): 217-234 (1988) - 1986
- [j1]Günter M. Ziegler:
On the poset of partitions of an integer. J. Comb. Theory A 42(2): 215-222 (1986)
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.
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.
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.
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 2025-01-20 22:59 CET 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:
