Falk Tschirschnitz

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ A subexponential randomized simplex algorithm (extended abstract) 1992 Gil Kalai
2
+ Completely unimodal numberings of a simple polytope 1988 Kathy Hoke
2
+ Linear programming, the simplex algorithm and simple polytopes 1997 Gil Kalai
1
+ Puzzles and polytope isomorphisms 1987 R. Blind
Peter Mani-Levitska
1
+ RANDOM EDGE can be exponential on abstract cubes 2005 Jiřı́ Matoušek
Tibor Szabó
1
+ On the Folkman–Lawrence Topological Representation Theorem for Oriented Matroids of Rank 3 2001 Jürgen Bokowski
Susanne Mock
Ileana Streinu
1
+ Semispaces of configurations, cell complexes of arrangements 1984 Jacob E. Goodman
Richard Pollack
1
+ PDF Chat Many Polytopes Meeting the Conjectured Hirsch Bound 1998 Fred B. Holt
Victor Klee
1
+ A simple way to tell a simple polytope from its graph 1988 Gil Kalai
1
+ Sweeps, arrangements and signotopes 2001 Stefan Felsner
Helmut Weil
1
+ From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions 1988 P. L. Hammer
Bruno Simeone
Th. M. Liebling
D. de Werra
1
+ Teilungen der Ebene durch Geraden oder topologische Geraden 1956 Gerhard Ringel
1
+ PDF Chat Upper bounds for configurations and polytopes inR d 1986 Jacob E. Goodman
Richard Pollack
1
+ PDF Chat Two New Bounds for the Random‐Edge Simplex‐Algorithm 2007 Bernd Gärtner
Volker Kaibel
1
+ On LP-orientations of cubes and crosspolytopes 2002 Mike Develin
1
+ Multidimensional Sorting 1983 Jacob E. Goodman
Richard Pollack
1
+ NP-completeness of Partial Chirotope Extendibility 2005 Patrick Baier
1
+ Algorithms in Combinatorial Geometry 1987 Herbert Edelsbrunner
1
+ Long Monotone Paths in Abstract Polytopes 1976 I. Adler
Romesh Saigal
1