publications

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision		 Previous revision
Next revisionBoth sides next revision
publications [2019/03/14 16:54] – eblepublications [2019/03/14 17:01] – eble
Line 8: Line 8:
   - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]], Benjamin Müller, and [[http://www.mathematik.tu-darmstadt.de/~paffenholz/|Andreas Paffenholz]]. Polymake and Lattice Polytopes, Proceedings of the 21th International Conference on Formal Power Series and Algebraic Combinatorics (2009), 493--504. [[http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0141/2751|dmAK0141/2751]]   - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]], Benjamin Müller, and [[http://www.mathematik.tu-darmstadt.de/~paffenholz/|Andreas Paffenholz]]. Polymake and Lattice Polytopes, Proceedings of the 21th International Conference on Formal Power Series and Algebraic Combinatorics (2009), 493--504. [[http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0141/2751|dmAK0141/2751]]
   - Ewgenij Gawrilow, [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]], [[http://www.math.tu-berlin.de/~thilosch|Thilo Rörig]], and Nikolaus Witte. Drawing polytopal graphs with polymake, Computing and Visualization in Science 13 (2010), no. 2, 99--110 [[http://www.springerlink.com/content/t3217196q6816344/fulltext.pdf|DOI:10.1007/s00791-009-0127-3]]   - Ewgenij Gawrilow, [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]], [[http://www.math.tu-berlin.de/~thilosch|Thilo Rörig]], and Nikolaus Witte. Drawing polytopal graphs with polymake, Computing and Visualization in Science 13 (2010), no. 2, 99--110 [[http://www.springerlink.com/content/t3217196q6816344/fulltext.pdf|DOI:10.1007/s00791-009-0127-3]]
-  - [[http://svenherrmann.net/math/|Sven Herrmann]], [[https://page.math.tu-berlin.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]], [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]], and [[https://www2.mathematik.tu-darmstadt.de/~pfetsch/|Marc E. Pfetsch]]. Computing the bounded subcomplex of an unbounded polyhedron. [[http://arxiv.org/abs/1006.2767|arXiv:1006.2767]]
   - [[https://page.math.tu-berlin.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]]   - [[https://page.math.tu-berlin.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]]   -  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]]
Line 15: Line 15:
   - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]] and [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler/|Günter M. Ziegler]]. Neighborly cubical polytopes. The Branko Grünbaum birthday issue.  Discrete Comput. Geom.  24  (2000), no. 2-3, 325--344. [[http://www.springerlink.com/content/m73pqv6kr80rw4b1/fulltext.pdf|MR1758054 (2001f:52019)]]   - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]] and [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler/|Günter M. Ziegler]]. Neighborly cubical polytopes. The Branko Grünbaum birthday issue.  Discrete Comput. Geom.  24  (2000), no. 2-3, 325--344. [[http://www.springerlink.com/content/m73pqv6kr80rw4b1/fulltext.pdf|MR1758054 (2001f:52019)]]
   - Andrea Höppner and [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler|Günter M. Ziegler]].  A census of flag-vectors of 4-polytopes. Polytopes---combinatorics and computation (Oberwolfach, 1997), 105--110, DMV Sem., 29, Birkhäuser, Basel, 2000. [[http://www.ams.org/mathscinet-getitem?mr=1785294|MR1785294 (2001e:52026)]]  [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler|Günter M. Ziegler]].  Lectures on $0/1$-polytopes. Polytopes---combinatorics and computation (Oberwolfach, 1997), 1--41, DMV Sem., 29, Birkhäuser, Basel,  2000.  [[http://www.ams.org/mathscinet-getitem?mr=1785291|MR1785291 (2001e:52017)]]    - Andrea Höppner and [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler|Günter M. Ziegler]].  A census of flag-vectors of 4-polytopes. Polytopes---combinatorics and computation (Oberwolfach, 1997), 105--110, DMV Sem., 29, Birkhäuser, Basel, 2000. [[http://www.ams.org/mathscinet-getitem?mr=1785294|MR1785294 (2001e:52026)]]  [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler|Günter M. Ziegler]].  Lectures on $0/1$-polytopes. Polytopes---combinatorics and computation (Oberwolfach, 1997), 1--41, DMV Sem., 29, Birkhäuser, Basel,  2000.  [[http://www.ams.org/mathscinet-getitem?mr=1785291|MR1785291 (2001e:52017)]] 
-  - [[http://www.math.ku.edu/~bayer/|M.M. Bayer]], A.M. Bruening, and J.D. Stewart.  A combinatorial study of multiplexes and ordinary polytopes. Geometric combinatorics (San Francisco, CA/Davis, CA, 2000). Discrete Comput. Geom.  27  (2002),  no. 1, 49--63. [[http://www.ams.org/mathscinet-getitem?mr=1871688|MR1871688 (2002k:52012)]]  +  - M.M. Bayer, A.M. Bruening, and J.D. Stewart.  A combinatorial study of multiplexes and ordinary polytopes. Geometric combinatorics (San Francisco, CA/Davis, CA, 2000). Discrete Comput. Geom.  27  (2002),  no. 1, 49--63. [[http://www.ams.org/mathscinet-getitem?mr=1871688|MR1871688 (2002k:52012)]]  
-  - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]]; [[http://www.math.uni-magdeburg.de/~kaibel/|Volker Kaibel]]; [[http://www.math.tu-bs.de/%7Epfetsch/|Marc E. Pfetsch]]; [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler|Günter M. Ziegler]]. Vertex-facet incidences of unbounded polyhedra.  Adv. Geom.  1 (2001),  no. 1, 23--36. [[http://www.reference-global.com/doi/pdf/10.1515/advg.2001.002|MR1823950 (2002b:52015)]] +  - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]]; [[http://www.math.uni-magdeburg.de/~kaibel/|Volker Kaibel]]; [[https://www2.mathematik.tu-darmstadt.de/~pfetsch/|Marc E. Pfetsch]]; [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler|Günter M. Ziegler]]. Vertex-facet incidences of unbounded polyhedra.  Adv. Geom.  1 (2001),  no. 1, 23--36. [[http://www.reference-global.com/doi/pdf/10.1515/advg.2001.002|MR1823950 (2002b:52015)]] 
   - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]]. Software integration and computer proofs. Mathematical software (Beijing, 2002), 15--28, World Sci. Publ., River Edge, NJ,  2002. [[http://www.ams.org/mathscinet-getitem?mr=1932601|MR1932601]]    - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]]. Software integration and computer proofs. Mathematical software (Beijing, 2002), 15--28, World Sci. Publ., River Edge, NJ,  2002. [[http://www.ams.org/mathscinet-getitem?mr=1932601|MR1932601]] 
   - [[http://ehrhart.math.fu-berlin.de/people/haase/|Christian Haase]] and [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler|Günter M. Ziegler]]. Examples and counterexamples for the Perles conjecture. Discrete Comput. Geom.  28  (2002),  no. 1, 29--44. [[http://www.ams.org/mathscinet-getitem?mr=1904008|MR1904008 (2003e:52016)]]    - [[http://ehrhart.math.fu-berlin.de/people/haase/|Christian Haase]] and [[http://www.mi.fu-berlin.de/math/groups/discgeom/ziegler|Günter M. Ziegler]]. Examples and counterexamples for the Perles conjecture. Discrete Comput. Geom.  28  (2002),  no. 1, 29--44. [[http://www.ams.org/mathscinet-getitem?mr=1904008|MR1904008 (2003e:52016)]] 
   - [[http://www.math.uni-magdeburg.de/~kaibel/|Volker Kaibel]] and [[http://www.math.tu-berlin.de/~schwartz/|Alexander Schwartz]]. On the complexity of polytope isomorphism problems. Graphs Combin.  19  (2003),  no. 2, 215--230. [[http://www.ams.org/mathscinet-getitem?mr=1996205|MR1996205 (2004e:05125)]]    - [[http://www.math.uni-magdeburg.de/~kaibel/|Volker Kaibel]] and [[http://www.math.tu-berlin.de/~schwartz/|Alexander Schwartz]]. On the complexity of polytope isomorphism problems. Graphs Combin.  19  (2003),  no. 2, 215--230. [[http://www.ams.org/mathscinet-getitem?mr=1996205|MR1996205 (2004e:05125)]] 
-  - [[http://www.math.uni-magdeburg.de/~kaibel/|Volker Kaibel]] and [[http://www.math.tu-bs.de/%7Epfetsch/|Marc E. Pfetsch]]. Some algorithmic problems in polytope theory. (English summary) Algebra, geometry, and software systems, 23--47, Springer, Berlin, 2003. [[http://www.ams.org/mathscinet-getitem?mr=2011752|MR2011752 (2004i:52012)]] +  - [[http://www.math.uni-magdeburg.de/~kaibel/|Volker Kaibel]] and [[https://www2.mathematik.tu-darmstadt.de/~pfetsch/|Marc E. Pfetsch]]. Some algorithmic problems in polytope theory. (English summary) Algebra, geometry, and software systems, 23--47, Springer, Berlin, 2003. [[http://www.ams.org/mathscinet-getitem?mr=2011752|MR2011752 (2004i:52012)]] 
   - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]]. Beneath-and-beyond revisited. Algebra, geometry, and software systems, 1--21, Springer, Berlin, 2003. [[http://www.ams.org/mathscinet-getitem?mr=2011751|MR2011751 (2004k:68169)]]    - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]]. Beneath-and-beyond revisited. Algebra, geometry, and software systems, 1--21, Springer, Berlin, 2003. [[http://www.ams.org/mathscinet-getitem?mr=2011751|MR2011751 (2004k:68169)]] 
   - [[http://www-ma2.upc.edu/~julian/|Julian Pfeifle]] and [[http://www.uni-bayreuth.de/departments/wirtschaftsmathematik/rambau/|Jörg Rambau]]. Computing triangulations using oriented matroids. Algebra, geometry, and software systems, 49--75, Springer, Berlin, 2003. [[http://www.ams.org/mathscinet-getitem?mr=2011753|MR2011753 (2004i:68233)]]    - [[http://www-ma2.upc.edu/~julian/|Julian Pfeifle]] and [[http://www.uni-bayreuth.de/departments/wirtschaftsmathematik/rambau/|Jörg Rambau]]. Computing triangulations using oriented matroids. Algebra, geometry, and software systems, 49--75, Springer, Berlin, 2003. [[http://www.ams.org/mathscinet-getitem?mr=2011753|MR2011753 (2004i:68233)]] 
Line 36: Line 36:
   - [[http://math.sfsu.edu/beck/|Matthias Beck]] and [[http://math.sfsu.edu/hosten/|Serkan Hosten]]. Cyclotomic polytopes and growth series of cyclotomic lattices.  Math. Res. Lett.  13  (2006),  no. 4, 607--622. [[http://www.ams.org/mathscinet-getitem?mr=2250495|MR2250495 (2007h:52018)]]    - [[http://math.sfsu.edu/beck/|Matthias Beck]] and [[http://math.sfsu.edu/hosten/|Serkan Hosten]]. Cyclotomic polytopes and growth series of cyclotomic lattices.  Math. Res. Lett.  13  (2006),  no. 4, 607--622. [[http://www.ams.org/mathscinet-getitem?mr=2250495|MR2250495 (2007h:52018)]] 
   -  [[http://www-rcf.usc.edu/~guralnic/|Robert Guralnick]] and [[http://www.reed.edu/~davidp/|David Perkinson]]. Permutation polytopes and indecomposable elements in permutation groups. J. Combin. Theory Ser. A 113 (2006), no. 7, 1243--1256. [[http://www.ams.org/mathscinet-getitem?mr=2259059|MR2259059 (2007h:05076)]]    -  [[http://www-rcf.usc.edu/~guralnic/|Robert Guralnick]] and [[http://www.reed.edu/~davidp/|David Perkinson]]. Permutation polytopes and indecomposable elements in permutation groups. J. Combin. Theory Ser. A 113 (2006), no. 7, 1243--1256. [[http://www.ams.org/mathscinet-getitem?mr=2259059|MR2259059 (2007h:05076)]] 
-  - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]]; [[http://www.math.tu-bs.de/%7Epfetsch/|Marc E. Pfetsch]]. Computing optimal Morse matchings. SIAM J. Discrete Math.  20  (2006),  no. 1, 11--25 (electronic). [[http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SJDMEC000020000001000011000001&idtype=cvips&prog=normal|MR2257241 (2007h:90067)]] +  - [[https://page.math.tu-berlin.de/~joswig/|Michael Joswig]]; [[https://www2.mathematik.tu-darmstadt.de/~pfetsch/|Marc E. Pfetsch]]. Computing optimal Morse matchings. SIAM J. Discrete Math.  20  (2006),  no. 1, 11--25 (electronic). [[http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SJDMEC000020000001000011000001&idtype=cvips&prog=normal|MR2257241 (2007h:90067)]] 
   - [[http://www.mathematik.tu-darmstadt.de/~paffenholz/|Andreas Paffenholz]]. New polytopes from products.  J. Combin. Theory Ser. A  113  (2006),  no. 7, 1396--1418. [[http://www.ams.org/mathscinet-getitem?mr=2259068|MR2259068 (2007m:52015)]]    - [[http://www.mathematik.tu-darmstadt.de/~paffenholz/|Andreas Paffenholz]]. New polytopes from products.  J. Combin. Theory Ser. A  113  (2006),  no. 7, 1396--1418. [[http://www.ams.org/mathscinet-getitem?mr=2259068|MR2259068 (2007m:52015)]] 
   - [[http://www.math.harvard.edu/~seths/|Seth Sullivant]]. Compressed polytopes and statistical disclosure limitation.  Tohoku Math. J. (2)  58  (2006),  no. 3, 433--445. [[http://www.ams.org/mathscinet-getitem?mr=2273279|MR2273279]]    - [[http://www.math.harvard.edu/~seths/|Seth Sullivant]]. Compressed polytopes and statistical disclosure limitation.  Tohoku Math. J. (2)  58  (2006),  no. 3, 433--445. [[http://www.ams.org/mathscinet-getitem?mr=2273279|MR2273279]] 
  • publications.txt
  • Last modified: 2020/01/22 14:41
  • by lkastner