| Publication | Date of Publication | Type |
|---|
| Correction to: ``On reconfiguration graphs of independent sets under token sliding | 2023-08-21 | Paper |
| On reconfiguration graphs of independent sets under token sliding | 2023-07-12 | Paper |
| On the foundations and extremal structure of the holographic entropy cone | 2023-02-22 | Paper |
| A Note On Acyclic Token Sliding Reconfiguration Graphs of Independent Sets | 2022-12-31 | Paper |
| Sparktope: linear programs from algorithms | 2022-10-06 | Paper |
| Algorithmic enumeration of surrounding polygons | 2021-09-15 | Paper |
| On the foundations and extremal structure of the holographic entropy cone | 2021-02-15 | Paper |
| An analysis of budgeted parallel search on conditional Galton-Watson trees | 2020-04-01 | Paper |
| Polynomial size linear programs for problems in \textsc{P} | 2019-07-17 | Paper |
| Compact linear programs for 2SAT | 2019-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967193 | 2019-07-03 | Paper |
| \texttt{mplrs}: a scalable parallel vertex/facet enumeration code | 2018-11-09 | Paper |
| On the \({\mathcal {H}}\)-free extension complexity of the TSP | 2017-04-05 | Paper |
| An exponential lower bound for Cunningham's rule | 2017-02-03 | Paper |
| On the directed cut cone and polytope | 2016-05-11 | Paper |
| On the extension complexity of combinatorial polytopes | 2015-10-14 | Paper |
| A generalization of extension complexity that captures P | 2015-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934001 | 2014-12-08 | Paper |
| Reputation games for undirected graphs | 2014-02-18 | Paper |
| A Portable Parallel Implementation of the lrs Vertex Enumeration Code | 2013-12-10 | Paper |
| On the extension complexity of combinatorial polytopes | 2013-08-06 | Paper |
| Families of polytopal digraphs that do not satisfy the shelling property | 2013-01-25 | Paper |
| Leggett-Garg inequalities and the geometry of the cut polytope | 2013-01-19 | Paper |
| On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes | 2012-10-26 | Paper |
| Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs | 2011-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3078231 | 2011-02-18 | Paper |
| Enumeration of Nash equilibria for two-player games | 2010-02-19 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Visualizing and Constructing Cycles in the Simplex Method | 2009-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5324458 | 2009-08-03 | Paper |
| Computing monotone disjoint paths on polytopes | 2009-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3622252 | 2009-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3622261 | 2009-04-28 | Paper |
| Enumerating constrained non-crossing minimally rigid frameworks | 2008-09-24 | Paper |
| Distributed compression and multiparty squashed entanglement | 2008-04-08 | Paper |
| Generating facets for the cut polytope of a graph by triangular elimination | 2008-01-07 | Paper |
| New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities | 2007-09-18 | Paper |
| Enumerating Non-crossing Minimally Rigid Frameworks | 2007-09-10 | Paper |
| A list heuristic for vertex cover | 2007-08-27 | Paper |
| Enumerating non-crossing minimally rigid frameworks | 2007-07-19 | Paper |
| Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) | 2007-07-19 | Paper |
| Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching | 2007-01-19 | Paper |
| One of the ``problèmes plaisants et délectables by Claude Berge (Un des ``problèmes plaisants et délectables de Claude Berge). | 2006-10-30 | Paper |
| On the relationship between convex bodies related to correlation experiments with dichotomic observables | 2006-09-28 | Paper |
| Two-party Bell inequalities derived from combinatorics via triangular elimination | 2006-01-13 | Paper |
| On the fractional chromatic index of a graph and its complement | 2005-08-25 | Paper |
| Solving Inequalities and Proving Farkas's Lemma Made Easy | 2004-06-14 | Paper |
| Stronger linear programming relaxations of max-cut | 2003-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790468 | 2003-06-16 | Paper |
| On the chromatic polynomial of a graph | 2002-12-01 | Paper |
| Estimating the number of vertices of a polyhedron | 2002-07-25 | Paper |
| On the binary solitaire cone | 2002-07-16 | Paper |
| On the existence of a point subset with a specified number of interior points | 2002-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728843 | 2001-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508372 | 2001-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518988 | 2001-05-20 | Paper |
| On the solitaire cone and its relationship to multi-commodity flows. | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504018 | 2000-12-06 | Paper |
| Computational experience with the reverse search vertex enumeration algorithm | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935168 | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4389428 | 1999-08-10 | Paper |
| Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms | 1998-09-21 | Paper |
| How good are convex hull algorithms? | 1997-12-08 | Paper |
| Reverse search for enumeration | 1997-01-13 | Paper |
| Generating rooted triangulations without repetitions | 1996-12-01 | Paper |
| COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES | 1996-05-28 | Paper |
| Metric extensions and the \(L^ 1\) hierarchy | 1995-06-20 | Paper |
| The m-core properly contains the m-divisible points in space | 1994-01-02 | Paper |
| A bound on the \(k\)-gonality of facets of the hypermetric cone and related complexity problems | 1993-06-29 | Paper |
| A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra | 1993-01-16 | Paper |
| A basis enumeration algorithm for linear systems with geometric applications | 1992-06-27 | Paper |
| The cut cone,L1 embeddability, complexity, and multicommodity flows | 1992-06-27 | Paper |
| Distinct distances determined by subsets of a point set in space | 1991-01-01 | Paper |
| Locating a robot with angle measurements | 1990-01-01 | Paper |
| Algorithms for high dimensional stabbing problems | 1990-01-01 | Paper |
| All the facets of the six-point Hamming cone | 1989-01-01 | Paper |
| On the complexity of single fault set diagnosability and diagnosis problems | 1989-01-01 | Paper |
| Computing the volume of the union of spheres | 1988-01-01 | Paper |
| Repeated distances in space | 1988-01-01 | Paper |
| Polyhedral line transversals in space | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796752 | 1988-01-01 | Paper |
| Triangulating point sets in space | 1987-01-01 | Paper |
| A Generalized Theory for System Level Diagnosis | 1987-01-01 | Paper |
| Diameter partitioning | 1986-01-01 | Paper |
| Visibility between two edges of a simple polygon | 1986-01-01 | Paper |
| An analysis of a decomposition heuristic for the assignment problem | 1985-01-01 | Paper |
| Eccentric graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692390 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716335 | 1985-01-01 | Paper |
| Non-partitionable point sets | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337484 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680876 | 1984-01-01 | Paper |
| The Number of Furthest Neighbour Pairs of a Finite Planar Set | 1984-01-01 | Paper |
| Applications of a two-dimensional hidden-line algorithm to other geometric problems | 1983-01-01 | Paper |
| A survey of heuristics for the weighted matching problem | 1983-01-01 | Paper |
| A combinational approach to polygon similarity | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4741714 | 1983-01-01 | Paper |
| On the complexity of finding the convex hull of a set of points | 1982-01-01 | Paper |
| On the multimodality of distances in convex polygons | 1982-01-01 | Paper |
| Worst case bounds for the Euclidean matching problem | 1981-01-01 | Paper |
| Balancing signed graphs | 1981-01-01 | Paper |
| Hypermetric Spaces and the Hamming Cone | 1981-01-01 | Paper |
| A linear algorithm for computing the visibility polygon from a point | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3911404 | 1981-01-01 | Paper |
| Comments on a lower bound for convex hull determination | 1980-01-01 | Paper |
| A note on some computationally difficult set covering problems | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3910557 | 1980-01-01 | Paper |
| On the Extreme Rays of the Metric Cone | 1980-01-01 | Paper |
| Extremal Metrics Induced by Graphs | 1980-01-01 | Paper |
| A linear algorithm for finding the convex hull of a simple polygon | 1979-01-01 | Paper |
| On minimal 5-chromatic triangle-free graphs | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3862427 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4188659 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4178292 | 1977-01-01 | Paper |
