Some History and Some Math, Jon-Shmuel Halfway to Twelfty, Ecole des Ponts, Marne-la-Vallée, Paris, July 2023 (group photo, photo 1, photo 2, photo 3, photo 4, photo 5, lecture photo)
Degree Sequence Optimization and Sparse Integer Programming (Video), Workshop on Combinatorics and Optimization, ICERM Brown University, March 2023 (photo 1, photo 2)
Sparse Integer Programming is FPT (Video, Slides), Workshop on Tropical Geometry and the Geometry of Linear Programming, Hausdorff Research Institute for Mathematics, September 2021
Integer Programming in Parameter-Tractable Strongly-Polynomial Time, Dagstuhl Seminar on Parameterized Complexity, January 2019 (Photo)
Integer Programming in Parameter-Tractable Strongly-Polynomial Time, Oberwolfach Workshop on Combinatorial Optimization, November 2018 (Photo)
Integer Programming in Strongly Polynomial Oracle Time, Optimization and Discrete Geometry, Tel Aviv, April 2018 (Photo 1, Photo 2)
Advances in Integer Programming 1--2, Recent Advances in Parameterized Complexity, Tel Aviv, December 2017 (Video1, Video2)
A Polynomial Time Theory of Integer Programming, VOCAL Optimization Conference, Esztergom, Hungary, December 2016 (Photo)
Polynomial Time Iterative Methods for Integer Programming, Workshop on Advances in Optimization, Tokyo, August 2016 (Photo)
Shifted Combinatorial Optimization, Discrete Optimization, FIM ETH Zürich, August 2016 (Photos)
Oberwolfach Workshop on MINLP, Mathematical Institute Oberwolfach, October 2015 (group photo)
Robust Integer Programming, Mixed Integer Nonlinear Programming, Mathematical Research Institute, Sevilla, April 2015 (group photo)
Robust Integer Programming, Recent Advances in Linear Optimization, Paris, August 2014 (group photo)
Integer Programming is Fixed Parameter Tractable, Bertinoro Workshop on Parametrization and Approximation, University Residential Center, Bertinoro, Italy, May 2014 (group photo)
Nonlinear Integer Programming is Fixed Parameter Tractable, COST Workshop on MINLP, Institut Henri Poincare, Paris, October 2013
The Complexity of Projections of Combinatorial Polytopes, Mathematical Congress of the Americas, Guanajuato, Mexico, August 2013
N-Fold Integer Programming in Cubic Time (hence Multiway Tables are Fixed-Parameter Tractable), Oberwolfach Workshop on Combinatorial Optimization, Oberwolfach, November 2011 (group photo)
Graver Bases and Integer Programming, Mixed Integer Nonlinear Programming, Mathematical Research Institute, Sevilla, December 2010 (group photo)
The Graver Complexity of Integer Programming, Discrete Optimization Workshop, IPAM, UCLA, Los Angeles, October 2010
Linear and Nonlinear Integer Optimization, 7 hour Video Lecture Series, MSRI, Berkeley, August 2010
Graver Bases & Nonlinear Integer Programming in Polynomial Time, GB Conference , Osaka, June 2010 (Video; Slides; Photo1; Photo2)
Nonlinear Discrete Optimization, Nachdiplom Lectures, FIM ETH Zürich, Spring 2009
N-Fold Integer Programming and Multicommodity Flows, MIP 2009, University of California, Berkeley, June 2009
Nonlinear Optimization over a Weighted Independence System, AAIM 2009
Nonlinear Discrete Optimization, IMA Hot Topic Workshop, IMA, Minneapolis, November 2008 (video & slides; photo)
Nonlinear Discrete Optimization, BilleraFest 2008, Cornell University, Ithaca, New York, June 2008 (group photo & photo)
Entry uniqueness in margined tables, PSD 2006 - Privacy in Statistical Databases, Rome, Italy, December 2006
Multiway tables: universality and optimization, Privacy Day at the Weizmann Institute, July 2006
Lecture Series on Convex Discrete Optimization, SMS Summer School on Combinatorial Optimization, Montreal, June 2006 (photo)
Convex Discrete Optimization, Caesarea Rothschild Institute Workshop on Combinatorial Optimization, May 2006
Convex Integer Optimization and Universality of Multiway Polytopes, ETH, Zurich, May 2006 (photo 1, photo 2, photo 3)
Multiway polytopes: universality and convex optimization, BIRS, Banff, Canada, March 2006 (group photo)
Two universality theorems, Grobner Bases Conference, Tokyo, Japan, August 2005 (group photo)
Convex combinatorial optimization, Cube Conference, Magdeburg, Germany, July 2005
Convex combinatorial optimization - winner of the 2005 ORSIS prize for best research paper in OR, ORSIS, Caesarea, Israel, May 2005
Universality of Table Polytopes, Oberwolfach, August 2004 (group photo)
Nowhere-zero flow polynomials, Graph Theory Conference, Paris, July 2004
All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables, IPCO 2004, New York City, June 2004
The Hilbert zonotope and a polynomial time algorithm for universal Grobner bases (and figure of corner polytopes), Oberwolfach, June 2002