Michael Joswig

Orcid: 0000-0002-4974-9659

According to our database1, Michael Joswig authored at least 56 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Tropical medians by transportation.
Math. Program., May, 2024

Confirmable Workflows in OSCAR.
CoRR, 2024

A FAIR File Format for Mathematical Software.
Proceedings of the Mathematical Software - ICMS 2024, 2024

2023
Generalised cone complexes and tropical moduli in polymake.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

The Polyhedral Geometry of Truthful Auctions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
Generalized Permutahedra and Optimal Auctions.
SIAM J. Appl. Algebra Geom., March, 2022

Parametric Shortest-Path Algorithms via Tropical Geometry.
Math. Oper. Res., 2022

Frontiers of sphere recognition in practice.
J. Appl. Comput. Topol., 2022

Tropical Bisectors and Voronoi Diagrams.
Found. Comput. Math., 2022

2021
What Tropical Geometry Tells Us about the Complexity of Linear Programming.
SIAM Rev., 2021

Correction to: The Schläfli Fan.
Discret. Comput. Geom., 2021

2020
Monomial Tropical Cones for Multicriteria Optimization.
SIAM J. Discret. Math., 2020

Secondary Fans and Secondary Polyhedra of Punctured Riemann Surfaces.
Exp. Math., 2020

The Schläfli Fan.
Discret. Comput. Geom., 2020

Geometric Disentanglement by Random Convex Polytopes.
CoRR, 2020

Real Tropical Hyperfaces by Patchworking in polymake.
Proceedings of the Mathematical Software - ICMS 2020, 2020

2019
Algorithms for tight spans and tropical linear spaces.
J. Symb. Comput., 2019

Breadth-first search on a Ramanujan graph.
CoRR, 2019

2018
Log-Barrier Interior Point Methods Are Not Strongly Polynomial.
SIAM J. Appl. Algebra Geom., 2018

Webs of stars or how to triangulate free sums of point configurations.
J. Comb. Theory A, 2018

Parallel Enumeration of Triangulations.
Electron. J. Comb., 2018

New Counts for the Number of Triangulations of Cyclic Polytopes.
Proceedings of the Mathematical Software - ICMS 2018, 2018

2017
Computing convex hulls and counting integer points with polymake.
Math. Program. Comput., 2017

Matroids from hypersimplex splits.
J. Comb. Theory A, 2017

MatchTheNet - An Educational Game on 3-Dimensional Polytopes (Multimedia Contribution).
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Rigid multiview varieties.
Int. J. Algebra Comput., 2016

Algorithms and Effectivity in Tropical Mathematics and Beyond (Dagstuhl Seminar 16482).
Dagstuhl Reports, 2016

The polymake XML File Format.
Proceedings of the Mathematical Software - ICMS 2016, 2016

2015
Tropicalizing the Simplex Algorithm.
SIAM J. Discret. Math., 2015

DGD Gallery: Storage, sharing, and publication of digital research data.
CoRR, 2015

Linear Programs and Convex Hulls Over Fields of Puiseux Fractions.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014
Foldable Triangulations of Lattice Polygons.
Am. Math. Mon., 2014

Combinatorial Simplex Algorithms Can Solve Mean Payoff Games.
SIAM J. Optim., 2014

Smooth Fano Polytopes with Many Vertices.
Discret. Comput. Geom., 2014

Heuristics for Sphere Recognition.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
Algorithms for highly symmetric linear and integer programs.
Math. Program., 2013

Computing the bounded subcomplex of an unbounded polyhedron.
Comput. Geom., 2013

Polyhedral and Algebraic Methods in Computational Geometry.
Universitext, Springer, ISBN: 978-1-4471-4816-6, 2013

2011
Defect polytopes and counter-examples with polymake.
ACM Commun. Comput. Algebra, 2011

2010
Totally Splittable Polytopes.
Discret. Comput. Geom., 2010

Drawing polytopal graphs with polymake.
Comput. Vis. Sci., 2010

2009
How to Draw Tropical Planes.
Electron. J. Comb., 2009

2008
Algorithmische Geometrie - Polyedrische und algebraische Methoden.
Vieweg Studium, Vieweg+Teubner, ISBN: 978-3-8348-0281-1, 2008

2007
Bounds on the f-vectors of tight spans.
Contributions Discret. Math., 2007

2006
Computing Optimal Morse Matchings.
SIAM J. Discret. Math., 2006

Flexible Object Hierarchies in Polymake.
Proceedings of the Mathematical Software, 2006

2005
One-point suspensions and wreath products of polytopes and spheres.
J. Comb. Theory A, 2005

Complexes of discrete Morse functions.
Discret. Math., 2005

2004
Software.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Convex hulls, oracles, and homology.
J. Symb. Comput., 2004

Computing Optimal Discrete Morse Functions.
Electron. Notes Discret. Math., 2004

2003
Beneath-and-Beyond Revisited.
Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2001
Polymake: an approach to modular software design in computational geometry.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000
Neighborly Cubical Polytopes.
Discret. Comput. Geom., 2000

1998
Isotopy of Polygonal Domains for Generalized Polygons.
Eur. J. Comb., 1998

1996
Towards Modelling the Topology of Homogeneous Manifolds by Means of Symbolic Computation.
Proceedings of the Artificial Intelligence and Symbolic Mathematical Computation, 1996


  Loading...