This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision |
| publications [2014/10/10 17:24] – [Publications with references to polymake] paffenholz | publications [2019/01/29 21:46] – external edit 127.0.0.1 |
|---|
| - [[http://svenherrmann.net/math/|Sven Herrmann]], [[http://www.mathematik.tu-darmstadt.de/~joswig|Michael Joswig]], and Marc E. Pfetsch. Computing the bounded subcomplex of an unbounded polyhedron. [[http://arxiv.org/abs/1006.2767|arXiv:1006.2767]] | - [[http://svenherrmann.net/math/|Sven Herrmann]], [[http://www.mathematik.tu-darmstadt.de/~joswig|Michael Joswig]], and Marc E. Pfetsch. Computing the bounded subcomplex of an unbounded polyhedron. [[http://arxiv.org/abs/1006.2767|arXiv:1006.2767]] |
| - [[http://www.mathematik.tu-darmstadt.de/~joswig|Michael Joswig]] and [[http://www.mathematik.tu-darmstadt.de/~paffenholz/|Andreas Paffenholz]]. Defect Polytopes and Counter-Examples With polymake. [[http://arxiv.org/abs/1105.5027|arXiv:1105.0527]] | - [[http://www.mathematik.tu-darmstadt.de/~joswig|Michael Joswig]] and [[http://www.mathematik.tu-darmstadt.de/~paffenholz/|Andreas Paffenholz]]. Defect Polytopes and Counter-Examples With polymake. [[http://arxiv.org/abs/1105.5027|arXiv:1105.0527]] |
| | - Benjamin Assarf , Ewgenij Gawrilow, Katrin Herr, Michael Joswig, Benjamin Lorenz, Andreas Paffenholz and Thomas Rehn, polymake in Linear and Integer Programming, [[http://arxiv.org/abs/1408.4653|arXiv:1408.4653]] |
| ===== Publications with references to polymake ===== | ===== Publications with references to polymake ===== |
| |