VITAE
Jesus Antonio De Loera
PERSONAL INFORMATION
Birthdate: January 18, 1966Married, two children (now adults)Citizenship: USA and MexicoLanguages: Fluent in Spanish (native), French, and English.
Intermediate knowledge of German,Beginners knowledge of Italian and Portuguese.
Official Contact Information: Department of Mathematics,University of California,3228 Mathematical Sciences Building,Davis CA 95616-8633phone: (530) 554-9702fax: (530) 752-6635E-mail: [emailprotected]: http://www.math.ucdavis.edu/˜deloeraORCID: https://orcid.org/0000-0002-9556-1112
EDUCATION
Ph.D. Cornell University, Applied Mathematics, April 1995.M.S Cornell University, Applied Mathematics (Operations Research), February 1993.M.A. Western Michigan University, Mathematics, May 1990.B.S. National University of Mexico, Mathematics, May 1989.
(Honors thesis: “On the genus of finite groups”)
Doctoral DissertationTitle: “Triangulations of Polytopes and Computational Algebra.”Advisor: Professor Bernd Sturmfels (UC Berkeley/MPI Leipzig).
RESEARCH TOPICS
Combinatorics, Discrete Mathematics.Algorithms and Computation in Algebra, Combinatorics , Geometry, & Optimization.Convex and Discrete Geometry, Geometry of Numbers.Algebraic, Geometric, and Topological methods in Applied Mathematics.Optimization, Operations Research, Data Science, and Other applications.
PROFESSIONAL EXPERIENCE
2019-to date: Chair of the Graduate group in Applied Mathematics University of California,
Davis.
2005-to date: Professor of Mathematics and member of the Graduate groups in Applied
Mathematics and Computer Science, University of California, Davis.
2014-2015: Professor and Faculty Assistant to the Dean of Math. and Physical Sciences forUndergraduate Affairs, UC Davis (equivalent to associate dean position).
2012-2014: Professor and Vice-Chair of Undergraduate Affairs for the Mathematics Depart-ment, UC Davis.
2002-2005: Associate Professor, Dept. of Mathematics, University of California, Davis.
1998-2001: Assistant Professor, Dept. of Mathematics, University of California, Davis.
1998-1999: Visiting researcher, Dept. of Computer Science, Swiss Federal Institute ofTechnology Zurich (ETH-Zurich).
1995-1998: Visiting Assistant Professor of Mathematics, University of Minnesota.
1991-1994: Teaching and Research assistant, Cornell University.
1987-1988: Teaching and Research assistant, National University of Mexico.
ACADEMIC HONORS
Scientific Awards
• 2020 winner of the INFORMS Optimization Society Farkas Prize.
• 2019 Fellow of the Society of Industrial and Applied Mathematics.
• 2014 Fellow of the American Mathematical Society.
• 2014 Bernard Society Lecture, Davidson College.
• 2013 Kemeny Lectures award, Dartmouth College.
• 2012 John von Neumann award, Technical University of Munich, Germany.
• 2011 Alumni Achievement Award, Western Michigan Univ.
• 2010 co-winner of the INFORMS computer society prize.
• 2004 Alexander Von Humboldt Award.
• 2003-2008 UC Davis, Chancellor’s fellow Award.
• 1995-1998 Postdoctoral fellow at the Geometry Center of the University of Minnesota.
• 1989-1995 National University of Mexico (UNAM) doctoral Fellowship
• 1986-1988 National University of Mexico (UNAM) Undergraduate Fellowship.
Teaching, Mentoring, and Service Awards
• 2020 ADVANCE Scholar Award, UC Davis Office for Diversity, Equity and Inclusion.
• 2018 Distinguished Teaching Award, College of Letters and Science UC Davis.
• 2017 Golden Section Teaching award of the Mathematical Association of America.
• 2013 UC Davis Chancellor’s Award in undergraduate research mentoring.
• 2007 Award for excellence in service to graduate students, UC Davis Graduate StudentAssociation.
• 2006 UC Davis, Principles of community and Diversity Award.
• 2001 Galois Group Award to individuals who serve the mathematics graduate programin a unique way.
Memberships to scientific societies: AMS, SIAM, MAA, and INFORMS
Visiting Positions: Long-term visiting researcher at the following research institutions:
• Institute for Mathematics and its Applications, Univ. of Minnesota (3 months)
• Newton Institute for Mathematical Sciences, Cambridge University, UK. (2 months)
• Technische Universitat Munchen, Germany (sabbatical year)
• Institute for Pure and Applied Mathematics, UCLA (one semester)
• Universitat Magdeburg, Germany (sabbatical year)
• Swiss Federal Institute ETH-Zurich, Switzerland.
• Mathematical Science Research Institute, Berkeley USA (two semesters, 2003 and2017)
• Universidad de Cantabria, Spain (1 month).
• CINVESTAV-Instituto Politecnico Nacional, Mexico.
Teaching & Mentoring:
• Has taught a wide range of undergraduate and graduate classes at the following insti-tutions: Universidad Nacional Autonoma de Mexico, Cornell University, Universityof Minnesota, ETH Zurich, University of California, Davis, Technische UniversitatMunchen.
• Ph.D students mentored:
Maya Ahmed (2004, now working in software industry in India),
Ruriko Yoshida (2004, now at U. Kentucky tenured),
Tyrrell McAllister (2006, now at U. Wyoming, tenured),
Susan Margulies (2008, now at US Naval Academy, tenured),
David Haws (2009, now at IBM Research science staff),
Edward D. Kim (2010, now at U. Wisconsin Lacrosse, tenured),
Mohamed Omar (2011, now at Harvey Mudd College, tenured)
Yvonne Kemper (2013, now at Austrian Institute of Technology)
Brandon Dutra (2016, now at Google)
Reuben La Haye (2016, now at Google)
Jacob Miller (2016, now at Facebook)
Jamie Haddock (2018, now at UCLA Center for Applied Math.)
Lily Silverstein (2019, now at California Polytechnic Pomona.)
Thomas Hogan (2019, now at Tatari TV Inc.)
Zhenyang Yang (advanced to candidacy, Ph.D. expected June 2022)
Chengyang Wang (advanced to candidacy, Ph.D expected June 2023)
William J. Wesley (advanced to candidacy, Ph.D expected June 2023)
Edgar Jaramillo-Rodriguez (Ph.D. expected June 2023)
Alexander Black (Ph.D. expected June 2024)
Yue Wu (Ph.D. expected 2024)
Felix Almendra Hernandez (Ph.D expected June 2025)
• Master Students mentored:
Pritpal Singh 2002
Jerry De Groot 2002
Tom Brounstein 2012
Mark Junod 2013
Rebecca Starr 2014
Michael Pernpeintner 2014 (at Technical Univ. Munich)
Annie Laurie Mauhs-Pugh 2016
Moise Blanchard 2018 (at Ecole Polytechnique Paris)
Sabrina Enriquez 2020
• Postdoctoral Fellows:
Dr. Raymond Hemmecke (now at Heureka Business GmbH)
Dr. Ruchira Datta (now at UC San Francisco)
Dr. Matthias Koppe (now at UC Davis, full professor)
Dr. Fu Liu (now at UC Davis, full professor)
Dr. Peter Malkin (now at Billington Inc. Australia)
Dr. Steve Klee (now at Seattle University, associate professor)
Dr. Steffen Borgwardt (now at Univ. Colorado, Denver, assistant prof. tenure-track)
Dr. Elisabeth Finhold (now at Fraunhofer Institute for Industrial Mathematics)
Dr. Chris O’Neill (now at San Diego State Univ, assistant prof. tenure-track)
Dr. Anastasia Chavez (currently at UC Davis, NSF postdoc)
• Undergraduate students Just at UC Davis I have had more than 60 undergraduatesconduct research under his supervision (with close to half of them going to graduateschool afterwards or finishing and undergraduate honors thesis). At UC Davis alonehe has supervised the work projects of the following students (those that went tograduate school marked with schools names, senior thesis with asteriks):
Amber Johnston, Cynthia Miranda* (CSU Long Beach), Marisa Garcia, NatashaSlepoy* (Columbia Univ), Jon Brooks, Jeremiah Tauzer* (Purdue U.), Peter Hug-gins* (UC Berkeley), David Haws* (UC Davis), Austin Shapiro* (Univ. Michigan),Michael Zhang, Esteban Pauli* (U. Illinois Urbana), Carol Hshi, David Karapetyan*(USC), Katherine Stalder* (Stanford), Creed Erickson* (UC Davis), Luis de la Torre*(Northwestern U), Tia Baker, Servando Narvaez * (UC Berkeley), Allison O’Hair*(MIT), Matthew Vicksell, Karla Lanzas* (San Francisco State), Rex Cheung* (UCDavis), Nancy Tafolla* (San Diego Univ.), Courtney Dostie, Katherine Burggraf*,Brandon Dutra* (UC Davis), Timothy Ingram* (Stanford), Samantha Cappozo, Jian-qiu Wu* (Rice U.), Stanislav Moreinis* (Stanford), Gregory Pinto, Ying Shi* (UCBerkeley), Longphi Nguyen* (UC Davis), Yuan Yuan Shen* (Stanford), Laila Rizvi,Connor Duthie, Victor Fuentes*(Univ. Michigan), Jacqueline Rodriguez* (UCLA),Hanna Polterock, Melody Molander (Univ. of Oklahoma), Emily Macway (UC SantaBarbara), Brendon Verissimo, Samuel Asher, Corina Putinar, Miguel Gil (San JoseState), Carmen Galaz (UC Santa Barbara), Leonardo Ferrer (UC Davis), Alberto Flo-res, Alicia Figueroa, Maya Nelson, Megan Liska* (Georgetown Univ), Jianping Pan(UC Davis), Kevin Sumner*, Benjamin Bairrington*, Li Li (Univ. of Washington),Sean O’Cleary, Morgan Imel, Arina Ushakova (UC Davis), Trevor Chan* (UC Davis),Jenette Sellin (Friedrich Schiller Univ. Germany), Mengda Xu*(CMU), Matthew Cor-belli, Santiago Rodriguez, Alondra Horta, and Dominic Yang* (UCLA), Lingyun Ye,Yuanbo Li*(Georgia Tech), Zekai Zhao*(Carnegie Mellon), Maira Hurtado, ChutongWu* (UC Davis), Michi Kirihara*, Tzu Feng-Leung*, Bohan Yang (NYU), LiminHuang*, and Michael Chu*(NYU).
PROFESSIONAL SERVICE
Editorial and Referee Work:
• Associate Editor for
– SIAM Journal of Discrete Math.
– SIAM Journal for Applied Algebra and Geometry (until 2020),
– Boletın de la Sociedad Matematica Mexicana,.
– Discrete Optimization (until 2014).
• Chief Editor of the SIAM-MOS series of books in Optimization.
• Co-editor special issue on “Geometric Combinatorics”, 148 pages, “Discrete and Com-putational Geometry” Volume 27, Number 1, 2002.
• Reviewer for Mathematical Reviews, Zentralblatt fur Mathematik since 1995.
• Referee for the following institutions and conferences (some multiple times):
The National Science Foundation, Journal of Combinatorial Theory (A,B),Journal of the American Mathematical Soc. Discrete Applied Mathematics,Discrete and Computational Geometry, Journal of Pure and Applied Algebra,Operations Research, Mathematical Programming (A,B),American Mathematical Monthly, Contributions to Discrete Mathematics,Boletin de la Sociedad Matematica Mexicana, Advances in Applied Mathematics,Computational Geometry: Theory and Apps., Mathematic of ComputationJournal of Symbolic Computation, Operations Research Letters,Journal of Optimization Theory and Apps. Proceedings of the AMSDiscrete Optimization, Mathematika,Journal of Algebraic Combinatorics, Mathematics of Operations Research,Advances in Mathematics Beitrage zur Algebra und GeometrieSIAM journal of Optimization Forum of MathematicsDiscrete Mathematics Arnold Math. JournalAMS Memoirs SIAM journal of Applied Algebra & GeometryAMS Notices Bulletin of the London Math. Soc.Banff International Research Station (BIRS) German Science FoundationIPCO Symposium on Integer Programming and Combinatorial Optimization 1999, 2013, 2019,2021ACM-SIAM symposium in Computational Geometry 1999, 2000, 2001ACM Symposium on the Theory of Computing 2016.Springer book series in “Algorithms and Computations in Mathematics”,Formal Power Series and Algebraic Combinatorics 2001.
Special Service in Scientific Boards and Committees
• Scientific program committee member IPCO XVI, Georgia Tech, Atlanta, 2021.
• George Polya Award, SIAM, 2019-2021.
• Hedrick Lectures MAA, 2017-2023
• Elected to the Scientific Board of the American Institute Mathematics, 2019.
• Elected to the Scientific Board of Institute for Computational and Experimental Math-ematics (ICERM), Brown University, 2018.
• Elected to the Executive Council of the American Mathematical Society (2015-2019).
• Elected member of the American Mathematical Society Council (serving in subcom-mittee in Education) (2013-2016).
• Denes Konig Award SIAM, 2018.
• Award committee, MAA Beckenbach book award, 2007-2009.
• Member scientific program committee special program on Inverse Moment Problems,Institute for Mathematical Sciences (IMS) at the National University of Singapore,Singapore, (Nov. 2013-Jan 2014).
• Member scientific program committee “Mexican Conference on Discrete Mathematicsand Computational Geometry”, Oaxaca Mexico, November 2013.
• Co-Chair of the Scientific Committee LAGOS VII, Playa del Carmen, Mexico, April2013.
• Scientific program committee member IPCO XVI, Valparaiso Chile March 2013.
• Scientific program committee member LATIN 2010 (Latin American Theoretical In-formatics), Oaxaca Mexico, April 2010.
• Organizing and Scientific committee MIP 2009 (Mixed Integer Programming), Berke-ley, June 2009.
• Scientific committee member and co-organizer “Geometric Combinatorics” Satelliteconference of the International Congress of Mathematicians, Alcala de Henares, Spain,2006.
• Scientific program committee member IPCO XI, Berlin Summer 2005.
• Program committee member ACM-SIAM symposium on Computational GeometryBoston June 2001.
Conference and Scientific programs organized
• Co-organizer American Institute of Mathematics workshop “Latinx MathematiciansNetwork II”, December 2019.
• Co-organizer Max Planck Institute for Mathematics in the Natural Sciences “Ran-domness and Learning in Non-linear Algebra”, June 2019.
• Co-organizer American Institute of Mathematics workshop “Latinx MathematiciansNetwork I”, December 2018.
• Co-organizer Mathematisches Forschung Institut Oberwolfach workshop on “Combi-natorial Optimization”, November 2018.
• Co-organizer Mathematisches Forschung Institut Oberwolfach workshop on “New di-rections in Stochastic Optimisation”, August 2018.
• Co-Chair, MSRI-Berkeley special semester in “Geometric and Topological Combina-torics” Fall 2017. A semester long program that attracted several dozens of expertsand included three workshops.
• Co-chair, Bay Area Optimization BAYOPT2017: From Data to Decisions, UC DavisMay 2017, conference in honor of Roger Wets 80th Birthday. More than 70 partici-pants.
• Lead organizer, MAA Golden Section meeting at UC Davis, February 2016. Meetingattended by over 250 participants.
• Co-organizer discussion panel ”What is a Mathematics PhD?” at Joint Math. MeetingSeattle January 2016
• co-organizer Casa Matematica Oaxaca, Advances in Discrete Optimization, November2015.
• Co-organizer Mathematical Research Communities program Snowbird Utah, June2014.
• Co-organizer, special session on Convexity, Combinatorics and Topology at FirstMathematical Congress of the Americas, Guanajuato August 2013
• chair organizer “Convexity, Topology, Combinatorics & Beyond, an internationalworkshop”, Puerto Vallarta Mexico, October 2011.
• “Workshop on Optimization”, Fields Institute, Toronto Canada, September 2011.Program on Discrete Geometry and Applications
• “Conference on Discrete Geometry and Optimization”, Fields Institute, Toronto Canada,September 2011. Program on Discrete Geometry and Applications
• “Workshop on Discrete Geometry”, Fields Institute, Toronto Canada, September2011. Program on Discrete Geometry and Applications
• Chair for Workshop “Efficiency of the Simplex Method: Quo vadis Hirsch conjec-ture?”, UC Los Angeles IPAM, January 2011.
• co-organizer “Algebraic Techniques for Optimization” SIAM conference on DiscreteMathematics, University of Victoria, British Columbia, 2006.
• co-organizer “Inside the Cube: Algebra, Combinatorics, and Geometry”, MagdeburgGermany, 2005.
• co-organizer Oberwolfach workshop on “Ehrhart Quasi-Polynomials”, Summer 2004.
• co-organizer AIM workshop on “Algebraic Statistics” Winter 2003.
• Co-Chair, MSRI-Berkeley special semester in “Discrete and Computational Geome-try” Fall 2003. A semester long program that attracted several dozens of experts andincluded three workshops.
• Co-organizer AMS session of “Algebraic and Geometric Combinatorics” San Francisco2000.
• Founding member “Bay Area Discrete Math Day”, a semi-annual regional meeting,(since 2000 main discrete math/combinatorics meeting in Northern California).
RESEARCH ACTIVITIES
Selected Invited Talks:
• Plenary Speaker or Keynote Lecturer for large national or international events:
– Plenary speaker, Bay Area Discrete Math Day, November 2020.
– Plenary speaker AMS invited address Joint Mathematical Meetings, Baltimore,January 2019.
– Plenary speaker “”30th RAMP (Operations Research Soc. of Japan) Sympo-sium”, Hiroshima, Japan, October 2018.
– Plenary speaker 2018 FPSAC (Formal Power Series and Algebraic Combina-torics) Dartmouth College. July 2018.
– Plenary speaker “Latinx in the Mathematical Sciences”, IPAM Conference, March,2018.
– Plenary speaker 2017 MAA Golden Section meeting, Cal State East Bay, Febru-ary 2018.
– Plenary speaker 2017 MOPTA (Modeling and Optimization: Theory and Appli-cations ) Lehigh University, August 2017
– Keynote speaker 2017 Modern Math Workshop at SACNAS, Salt Lake CityConvention Center, Utah, October 2017
– Plenary speaker 2017 SIAM conference in Applied Algebraic Geometry, GeorgiaTech, July 2017.
– Plenary speaker 2016 USA Mathematics Olympiad Award Ceremony, US StateDepartment, Washington DC June 2016.
– Plenary speaker 2015 Summer School “Convex Geometry: Discrete and Compu-tational” TU Berlin, June-July 2015.
– Plenary speaker 2014 West Coast Optimization Meeting, September 2014, SurreyCanada
– Plenary Speaker MAA southern California section annual meeting, October 2013
– Plenary Speaker, “Polynomial Optimization”, Newton Institute Cambridge UK,July 2013.
– Plenary Speaker AMS Western Section Meeting Boulder Colorado, April 2013
– Plenary Speaker Anderson Lecture at the Louisiana Mississippi MAA SectionConference, March, 2014
– Plenary Speaker, MAA Halmos Distinguished Lecture Series, Carriage HouseConference Center, Washington DC September 2012
– Workshop speaker, “Mixed-Integer Programming 2013”, UC Davis, July 2012
– Plenary Speaker Bay Area Discrete Math Day, March 2012
– Plenary Speaker, Triangle Lectures in Combinatorics, Univ. of North Carolina,Chapel Hill, November 2011
– Plenary Speaker Atul Vyas Memorial Lecture, Claremont Mckenna College,November 2011
– Plenary Speaker XX Coloquio Victor Neumann-Lara de Teoria de las Graficas,Combinatoria y sus Aplicaciones, Pachuca Mexico, February 2011
– Plenary invited topical speaker SIAM Annual meeting, Pittsburgh, July 12-16,2010.
– Plenary Speaker, Second Canadian Discrete and Algorithmic Mathematics Con-ference (CanaDAM), Montreal, May 2009
– Plenary speaker, Fourth International Symposium of Combinatorial Computing(4ICC), University of Auckland New Zealand, December 2008.
– Keynote lecturer “Rocky Mountain Mathematics Consortium Summer School:Polyhedral Geometry and Algebraic Combinatorics”, Laramie Wyoming, June20-July 1, 2011.
– Keynote Lecturer, Summer Seminar of the North Central Section of the MAA,St. John’s University Minnesota, July 2009
– Plenary speaker DIAMANT/EIDMA symposium Netherlands (2007)
– Plenary speaker MAA Golden Section (CA,NV, HI), annual meeting March(2008), Sacramento, CA
– Plenary Speaker MAA Mathfest, Knoxville Tennessee (2006)
– Plenary Lecturer, IMA Tutorial on “Algebraic Geometric Methods in Engineer-ing”, September 2006, IMA Minneapolis MN
– Plenary Lecturer, Doctoral school on: “Optimization over Polynomials and Semidef-inite Programming” University of Klagenfurt (Austria), September 2005.
– Plenary Lecturer, International Summer School on Geometric and Algebraic ap-proaches for Integer Programming, University of Lisbon, Portugal, July 2005
– Plenary Speaker, XI Encuentros de Geometria Computacional Santander Spain,June 2005
– Plenary speaker, CBMS conference on Integer points in Polyhedra: Geometry,Number Theory, Algebra, Optimization Snowbird Utah (2003)
– Plenary speaker COCOA VIII (computational commutative algebra) Cadiz Spain(2003)
– Plenary speaker conference COMBINATEXAS (2001),
• Invited Department-wide Colloquium Speaker
– Colloquium H.B Keller lecture, Computational Mathematics, Caltech November2020.
– Colloquium speaker, San Jose State University, December 2018.
– Colloquium speaker, CORE interdisciplinary seminar, Univ. of Washington Seat-tle, November 2018.
– Colloquium speaker, Univ. of California Irvine, May 2018.
– Colloquium speaker, Texas State Univ., February 2018
– Colloquium speaker, Clemson University Dept. of Math, January 2018
– Colloquium speaker, North Carolina State Univ, November 2016
– Colloquium Georgia Tech, Atlanta, Feb 2016
– Colloquium Univ., of California Los Angeles, Jan 2016
– Colloquium John Hopkins Univ. November 2015
– Colloquium Technical Univ. of Berlin, October 2015
– Colloquium Claremont Mckenna College, September 2015
– Colloquium Instituto de Matematicas UNAM, March 2015
– Colloquium University of San Francisco, September 2014
– Colloquium of Illinois Institute of Technology, October 2013
– Colloquium of Technical University of Munich, June 2013
– Colloquium Applied and Computational Mathematics, October 2012
– Colloquium George Mason University, September 2012
– Colloquium George Washington University DC, September 2012
– Colloquium, Operations Research Center Colloquium, MIT, September 2008
– Colloquium of Rice University Computational Applied Math Dept. April 2008.
– Colloquium Speaker, Sonoma State Univ., April 2008
– Colloquium speaker Dept. of Applied Mathematics, MIT (2006),
– Colloquium speaker Technische Universitat Berlin, December 2004),
– Colloquium speaker Dept. of Mathematics Univ. of California Berkeley (2003),
– Colloquium speaker Dept. of Mathematics, Santa Clara Univ, March (2003)
– Colloquium speaker Dept of Mathematics, UC Santa Cruz, October (2003)
– Colloquium speaker Dept. of Computer Science, Hong Kong University (2002),
– Colloquium speaker Dept. of Operations Research and Industrial EngineeringUC Berkeley (2000)
– Colloquium speaker, Dept. of Mathematics, Purdue University Lafayette (1998)
– Colloquium speaker, Courant Institute of Mathematical Sciences New York (1998)
• Invited Workshop Speaker
– Workshop speaker (online) Oberwolfach “Discrete Geometry”, September 2020.
– Workshop speaker AMS Fall Central Section “Algebraic, geometric and topolog-ical combinatorics” session September 2020.
– Workshop speaker “Combinatorial Geometries 2018: matroids, oriented matroidsand applications”, CIRM, Marseille-Luminy, France September 2018.
– Workshop speaker, “ Lattice Polytopes”, Einstein Foundation, Berlin, December2016.
– Workshop speaker “”Polyhedral geometry and partition theory” American Insti-tute of Mathematics, November 2016.
– Workshop speaker “Transversal, Helly and Tverberg type Theorems in Geometry,Combinatorics and Topology III,” Casa Matematica Oaxaca BIRS, October 2016.
– Workshop speaker “Discrete Optimization” Forschung Institut Mathematik, ETHZurich. August 22-26, 2016.
– Workshop speaker Oberwolfach “Topological and Algebraic Combinatorics”, Febru-ary 2015
– Workshop speaker IMA “Enumerative and Geometric Combinatorics”, November2014.
– Workshop speaker AMS Special Session on Polyhedral Number Theory, October2014
– Workshop speaker ”Recent Advances in Linear Optimization”, Paris, July 2014
– Workshop speaker “SIAM optimization annual meeting, San Diego CaliforniaMay 2014
– Workshop speaker “Optimization, Moment problems and geometry”, Singapore,November 2013
– Workshop speaker Clifford Lectures, Tulane University, March 2010
– Workshop speaker AIM workshop on “ Convex algebraic geometry, optimizationand applications”
– Workshop speaker AIM workshop on “Combinatorial challenges in toric vari-eties”, April 2009,
– Invited speaker, workshop High Performance Optimization Techniques (HPOPT),Tilburg Netherlands, June 2008.
– Workshop speaker, “Mixed-Integer Nonlinear Optimization: Algorithmic Ad-vances and Applications”, IMA Minnesota, November (2008)
– Workshop Speaker, “Polyhedral Computation”, October, 2006, Centre de RechercheMathematique, Montreal Canada
– Workshop speaker, “Convex Sets and their Applications”, International ResearchStation, Banff, Canada (2006)
– Workshop speaker, “Algorithmic, Combinatorial and Applicable Real AlgebraicGeometry”, MSRI Berkeley, April 2004
– Workshops speaker, “Connections in Mathematics”, Society for the Advancementof Chicano and Native Americans in Science, October 2003
• Invited seminars presented at the following universities and conference centers:
Combinatorics and Geometry seminar, University of Washington (10/2020). Fun-dacion Panamena para las Matematicas, Expository Public Lectures for children(8/2020) GEOTOP-A online seminar on Applications of Geometry and Topology(8/2020) Combinatorics, Games, and Optimisation seminar, London School of Eco-nomics (online due to COVID19), (7/2020) Combinatorics Seminar UC Berkeley(4/2020) Dept of Mathematics, Beijing University, China (6,2017) Dept of Mathe-matics, Northwestern Univ, Xi’an China (6/2017) Dept of Mathematics, UC Berkeley(Applied Algebra-seminar) (4/2017) Dept. of Electrical Engineering, Univ. Liege Bel-gium (12/2016) Hausdorff Institute for Mathematics, Univ. of Bonn, Germany (2015)Instituto de Matematicas, Univ. de Sevilla, Spain (2014) Dept. of Industrial and Sys-tems Engineering, Georgia Tech (2014) Combinatorics seminar, Georgia Tech (2014)Combinatorics Seminar, Caltech (2012), National Institute of Standards and Technol-ogy (2012), Combinatorics Seminar MIT (2000), Combinatorics Seminar UC Berkeley(2000,2003, 2004,2008), Combinatorics Seminar Univ. of Washington (2010), Com-binatorics Seminar, Univ of Illinois Urbana-Champaign (1998), Operations Research& Industrial Engineering UC Berkeley (2012), Algebra-Combinatorics Seminar SanFrancisco State Univ. (2003,2005,2006), Combinatorics seminar, Texas A & M Univ.(2007) IBM T.J Watson Research Center, NY (2007), School of Business, OperationsResearch Seminar, Univ. British Columbia, Canada, (2007) School of Computer Sci-ences McGill University Canada, CINVESTAV Mexico (1999), Univ. of Tokyo Japan
(2005), Universidad Tecnica de Lisboa, Portugal (2005) Universidad ComplutenseSpain (2000), University of Rome Italy (2005), University of Crete Greece (2005),CWI-Amsterdam, Netherlands (2004), Universitat Osnabruck Germany(2005), Tech-nische Universitat Darmstadt (2005), Universitat Marburg Germany (2005), Mathe-matisches Institut Oberwolfach Germany (1995,2000,2005,2007,2008,2010,2012) FreieUniv. Berlin Germany (2013), Technische Univ. Berlin Germany (2004), Univ.Magdeburg Germany (2004, 2005, 2013) ETH Zurich Switzerland (1999, 2005), Ox-ford University UK (1996), International Centre for Theoretical Physics Trieste Italy(1994),
Grants & Research Funding:
• NSF-DMS personal grant (2000-to-2014, 2016-2019).
• NSA grant (2015-2016).
• CONACYT-UC MEXUS grant (2013-2015).
• Lead PI, NSF VIGRE grant 2007-2013 for the UC Davis math department (3.3 Milliondollars).
• Co-PI of NSF VIGRE grant 2002-2007 for the department of Mathematics.
• IBM collaborative grant, non-standard techniques in integer optimization (2006-2010).
• Co-PI for GAAN grant (2000-to date).
• Four NSA grants to support scientific workshops.
• Three NSF grants for scientific workshops.
• CNRS-University of California, Computer Algebra techniques in Optimization, Berke-ley Fund Award. (2001-2002). Co-PI Andras Sebo.
• Swiss Federal grant Optimization in the space of subdivisions of a polyhedron (1998-1999). Co-PI Jurgen Richter-Gebert.
ALL SCHOLARLY PUBLICATIONSBooks
(1) (with F. Santos and J. Rambau) ”Triangulations: Structure for Algorithms and Ap-plications”, No. 25 of the series “Algorithms and Computation in Mathematics” SpringerVerlag, 2010, 545 pages.
(2) (with R. Hemmecke and M. Koppe) Algebraic and Geometric ideas in Discrete Op-timization, volume 14 in SIAM-MOS series on Optimization books. SIAM 2013, ISBN978-1-61197-243-6, pp. I-XIX, 322 pages.
Refereed Articles (Published or to Appear only)
(1) (with B. Sturmfels, and R. R. Thomas), “Grobner bases and triangulations of the secondhypersimplex”, Combinatorica. 15, (3), 1995, 409-424.
(2) “Grobner bases and graph colorings”, Beitrage zur Algebra und Geometrie. 36, (1),1995, 89-96.
(3) “Non-regular triangulations of product of simplices”, Discrete and Computational Ge-ometry. 15, 1996, 253-264.
(4) (with F. Santos), “An effective version of Polya’s theorem on positive definite forms”,Journal of Pure and Applied Algebra., 108, 1996, 231-240.
(5) (with S. Hosten F. Santos and B. Sturmfels), “The polytope of all triangulations of apoint configuration”, Documenta Mathematica J. DMV., 1, 1996, 103-119.
(6) (With F. Wicklin) “ On the need of convexity in Patchworking”, Advances in AppliedMathematics 20, 1998, 188-219.
(7) (with F. Santos and J. Urrutia), “The number of geometric bistellar flips of a triangu-lation”, Discrete and Computational Geometry, 21, No.1, 1999, 131-142.
(8) (with W. Morris), “Q-matrix recognition via secondary and universal polytopes”, Math-ematical Programming, 85, 259-276 (1999).
(9) (with C. Athanasiadis, V. Reiner and F. Santos), “ Fiber Polytopes for the projectionsof cyclic polytopes.”, European Journal of Combinatorics 21, No. 1, 2000, 19–47.
(10) (with A. Below and J. Richter-Gebert) “ Finding minimal triangulations of convex3-polytopes is NP-hard”, Research Announcement in Proc. of the eleventh Symposium ofDiscrete Algorithms San Francisco, 2000, 65-66.
(11) (with F. Wicklin), “Viro’s patchworking disproves Ragsdale’s conjecture”, Videotape(10 minutes) and short expository article Proceedings of the sixteenth annual ACM-SIAMSymposium on Computational Geometry, Hong Kong, 2000, 371-372.
(12) (with A. Below, U. Brehm and J. Richter-Gebert), “Minimal simplicial dissections andtriangulations of convex 3-polytopes”, Discrete and Computational Geometry 24, 2000,35-48.
(13) (with F. Santos and F. Takeuchi) “Extremal properties of optimal dissections of convexpolytopes” SIAM Journal of Discrete Mathematics 14, No.2, 2001, 143-161.
(14) (with A. Below and J. Richter-Gebert), “The complexity of finding small triangulationsof convex 3-polytopes”, J. Algorithms 50(2): 134-167 (2004)
(15) (with B. Sturmfels) “Algebraic Unimodular Counting” in Mathematical ProgrammingB. Special issue in “Algebraic and Topological Techniques in Discrete Optimization” Math.Program. 96(2): 183-203 (2003).
(16) (with E. Peterson and F. Su) “A Polytopal Generalization of Sperner’s lemma” Journalof Combinatorial Theory (A), 100: 1–26, (2002)
(17) (with M. Ahmed and R. Hemmecke) “Polyhedral Cones for Magic Cubes and Squares”in “New directions in Combinatorial Geometry: The Goodman-Pollack Festschrift volume”(edited by Aronov et al), Springer, 2003, 25–41.
(18) (with S.Onn), “The complexity of 3-way statistical tables”, SIAM J. of Computing.33, No. 4, 819–836, 2004.
(19) (with D.Haws, R. Hemmecke, P. Huggins, B. Sturmfels, R. Yoshida) ”Short rationalfunctions for toric algebra and its applications” Journal of Symbolic Computation, 38, 2004,959–973.
(20) (with D.Haws, R. Hemmecke, P. Huggins, R. Yoshida) ”Three kinds of Integer Pro-gramming Algorithms based on Barvinok’s rational functions” in proceedings Tenth Inter-national Conference in Integer Programming and Combinatorial Optimization, New YorkNY, June 2004 Lecture Notes in Computer Science, Vol 3064, 244–255.
(21) (with S. Onn) “All rational polytopes are transportation polytopes and all polytopalinteger sets are contingency tables” in proceedings Tenth International Conference in IntegerProgramming and Combinatorial Optimization, New York NY, June 2004 Lecture Notes inComputer Science, Vol 3064, 338–351.
(22) (with W. Baldoni-Silva and M. Vergne) ”Counting integer flows in networks” Founda-tions of Computational Mathematics, vol. 4, 2004, 277–314.
(23) (with R. Hemmecke, J. Tauzer, and R. Yoshida) “Effective lattice point counting inrational convex polytopes.” Journal of Symbolic Computation, vol. 38 no. 4 (2004), 1273–1302.
(24) (with T. McAllister) ”Vertices of Gelfand-Tsetlin polytopes” Discrete and Computa-tional Geometry, vol 32, No. 4, (2004), 459–470.
(25) (with M. Beck, M. Develin, J. Pfeifle, R.P. Stanley) ”Coefficients and zeroes of Ehrhartpolynomials”. in Integer points in polyhedrageometry, number theory, algebra, optimiza-tion, Contemp. Math. 374, Providence, RI: Amer. Math. Soc., pp. 1536, MR 2134759.
(26) (with S. Onn) ”Markov bases of 3-way tables are arbitrarily complicated” Journal ofSymbolic computation 41:173–181, 2006.
(27) (with L. Bowen, M. Develin and F. Santos) ”The Gromov norm of the product of twosurfaces” Topology, 44, (2005), 321–339.
(28) ”The many aspects of counting lattice points in polyhedra” Mathematische Semester-berichte (2005) 52: 175–195.
(29) (with R. Hemmecke, M. Koppe, and R. Weismantel) ”Integer polynomial optimizationin fixed dimension.” Mathematics of Operations Research. (2006), vol 31, No.1, 147–153.
(30) (with R. Hemmecke, D.Haws, P. Huggins, R. Yoshida) “Computational Study of integerprogramming algorithms based on Barvinok’s rational functions” Discrete Optimization. 2,(2005) 135–144.
(31) (with T. McAllister) ”On the Computation of Clebsch-Gordan coefficients and thedilation effect” Experimental Mathematics, vol 15. No. 1, (2006), 7–19.
(32) (with R. Hemmecke, M. Koppe, R. Weismantel) “FPTAS for optimizing polynomialsover the mixed-integer points of polytopes in fixed dimension.” Mathematical Programming,115, No. 2, (2008) 273–290. Earlier version appeared in the proceedings of 2006 ACM-SIAMSymposium on Discrete Algorithms, Miami Florida, 743-748.
(33) (with S.Onn) ”All linear and integer programming problems are slim 3-way transporta-tion programs”, SIAM J. of Optimization., vol 17, No. 3, (2006), 806–821.
(34) (with R. Hemmecke, S. Onn, and R. Weismantel) ”N-fold integer programming” Dis-crete Optimization, 5:231–241, 2008
(35) (with R. Hemmecke, U.Rothblum, S. Onn, and R. Weismantel) “Integer convex maxi-mization” Journal of Pure and Applied Algebra, 213:1569–1577, 2009.
(36) (with E. Kim, F. Santos, and S. Onn) “Graphs of transportation polytopes” Journalof Combinatorial Theory A. 116 (2009), 1306-1325
(37) (with S. Margulies, J. Lee, and S. Onn) “Expressing Combinatorial problems viasystems of Polynomials equations and Hilbert’s Nullstellensatz” Combinatorics, Probability,and Computing, volume 18, issue 04, pp. 551-582, 2009.
(38) (with F. Liu and R. Yoshida) “A generating function for all semi-magic squares andthe volume of the Birkhoff polytope” Journal of Algebraic Combinatorics. 30 (2009), no.1, 113-139.
(39) (with R. Hemmecke and M. Koppe) “Pareto optima of multicriteria integer programs”INFORMS journal of Computing. Vol. 21, No. 1, (2009), 39–48.
(40) (with D. Haws and M. Koppe) “Ehrhart polynomials of Matroid polytopes and polyma-troids” Discrete and Computational Geometry. 2009, available online DOI 10.1007/s00454-008-9080-z(41) (with J.Lee, P. Malkin and S. Margulies) “Hilbert’s Nullstellensatz and an Algorithmfor Proving Combinatorial Infeasibility” Proceedings of the twenty-first international sym-posium on Symbolic and algebraic computation, ISSAC 08, 2008, 197–206, Linz/Hagenberg,Austria, Published by ACM, New York, NY, USA.
(42) (with P. Malkin and P. Parrilo) Computation with Polynomial Equations and Inequal-ities arising in Combinatorial Optimization, in “Mixed Integer Non-Linear Programming”(J. Lee and S. Leyffer eds.), IMA Volumes in Mathematics and its Applications, Vol. 154.1st Edition., 2011, X, 660 p.
(43) (with V. Baldoni, N. Berline, M. Koppe, M. Vergne), How to integrate a polynomialover a simplex, Mathematics of Computation, vol. 80, 273, 297–325, 2011.
(44) (with D. Haws, J. Lee and A. O’Hair), Computation in Multicriteria Matroid Opti-mization, ACM Journal of Experimental Algorithmics, volume 14, pages 8:1.8–8:1.33, 2010.
(45) Counting and Estimating Lattice Points: Tools from Algebra, Analysis, Convexity andProbability, Optima, newsletter of the Mathematical Programming Society, 81, 1-9, 2009.available at http://www.mathprog.org/Optima-Issues/optima81.pdf
(46) (with C. Hillar, P. Malkin and M. Omar) “Recognizing Graph Theoretic Propertieswith Polynomial Ideals”, Electronic Journal of Combinatorics, Vol 17, R114 (2010).
(47) (with J. Lee, P. Malkin and S. Margulies) “Computing Infeasibility Certificates forCombinatorial Problems through Hilbert’s Nullstellensatz”, Journal of Symbolic Computa-tion, Volume 46, Issue 11, November 2011, Pages 1260-1283 (a shorter conference versionappeared in 2008 as article [41]).
(48) “New Insights into the Complexity and Geometry of Linear Optimization”, in Op-tima, newsletter of the Mathematical Optimization Society. 87, 1-13, 2011. available athttp://www.mathprog.org/Optima-Issues/optima87.pdf
(49) (with V. Baldoni, N. Berline, M. Koppe, and M. Vergne),“Computation of the highestcoefficients of weighted Ehrhart quasi-polynomials of rational polyhedra”, Foundations ofComputational Mathematics, 12(4): 435-469 (2012)
(50) (with B. Sturmfels and C. Vinzant), “The central curve of linear programming”, Foun-dations of Computational Mathematics, 12 (2012) 509-540.
(51) (with Y. Kemper, S. Klee) “h-vectors of small matroid complexes”, Electronic Journalof Combinatorics, 19 (2012), No. 1, 11 pages.
(52) (with B. Dutra, M. Koeppe, S. Moreinis, G. Pinto, J. Wu) “Software for Exact Integra-tion of Polynomials over Polyhedra”, Computational Geometry Theory and Applications46(3): 232-252 (2013).
(53) (with S. Klee) ‘Transportation Problems and Simplicial Polytopes That Are NotWeakly Vertex-Decomposable, Mathematics of Operations Research, Vol 37, No. 34, (2012),670–674.
(54) (with R. Hemmecke, M. Koppe) “Foundations of Discrete Optimization: in transi-tion from linear to non-linear models and methods” Jahresbericht Deutsche MathematikerVereinung, (2012), 114: 189–207.
(55) (with K. Burggraff and M. Omar), “On volumes of permutation polytopes”, in “Dis-crete Geometry and Optimization”, Vol 69 of Fields Institute Communications, eds. (A.Deza, K. Bezdek, Y. Ye), (2013), 55–78.
(56) (with V. Baldoni, N. Berline, B. Dutra, M Koppe, M. Vergne) “Top coefficients of theDenumerant” in the Proceedings of FPSAC 2013, Paris June 2013.
(57) (with A. Basu, M. Junod) “On Chubanov’s method for Linear Programming”, IN-FORMS Journal on Computing, 26, No. 2, (2014), 336–350.
(58) “Comments on: Recent progress on the combinatorial diameter of polytopes and sim-plicial complexes”, TOP, Official Journal of the Spanish Society of Statistics and OperationsResearch.
(59) (with Y. Kemper) ”Polyhedral Embeddings of Cayley Graphs,” Electronic Notes inDiscrete Mathematics, 43: 279-288. 2014.
(60) (with E. Kim) “Combinatorics and Geometry of Transportation polytopes: An Up-date”. Contemporary Mathematics, AMS, vol. 625, Proceedings AMS special session “Dis-crete Geometry and Algebraic Combinatorics” (Barg et al. editors), (2014), 37–76.
(61) (with I. Aliev and Q. Louveaux) “Integer programs with prescribed number of solutionsand a weighted version of Doignon-Bell-Scarf theorem” in the Proceedings of the The 17thConference on Integer Programming and Combinatorial Optimization June 23 - 25, 2014,Bonn - Germany.
(62) (with J. Lee, J. Miller, S. Margulies) “Weak Orientability of Matroids and PolynomialEquations”, European Journal of Combinatorics, 50, (2015), 56–71.
(63) (with V. Baldoni, N. Berline, B. Dutra, M. Koppe, M. Vergne) “Coefficients of Sylvester’sDenumerant” in INTEGERS, vol. 15, (2015), A11 (32 pages), available at http://www.integers-ejcnt.org/vol15.html.
(64) (with I. Aliev, R. Bassett, and Q. Louveaux) ”A Quantitative Doignon-Bell-ScarfTheorem” in Combinatorica, Combinatorica 37(3): 313-332 (2017).
(65) (with S. Margulies, M. Pernpeintner, E. Riedl, D. Rolnick, G. Spencer, D. Stasi, J.Swenson), Graph-coloring ideals: Nullstellensatz certificates, Grobner bases for chordalgraphs, and hardness of Grobner bases. In Proceedings of the 2015 ACM InternationalSymposium on Symbolic and Algebraic Computation, ISSAC 2015, Univ. of Bath, BathUK, ACM New York, NY, USA, 133–140.
(66) (with I. Aliev and Q. Louveaux), Parametric Polyhedra with at least k Lattice Points:Their Semigroup Structure and the k-Frobenius Problem. In Recent Trends in Combina-torics, (eds. Beveridge et al), IMA Volumes in Mathematics and its Applications, a SpringerSeries, vol. 159, (2016), 753–778.
(67) (with R. Hemmecke and J. Lee), On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond. SIAM J. of Optimiza-tion, 25, No. 4, (2015) 2494–2511.
(68) (with S. Petrovic and D. Stasi), Random Sampling in Computational Algebraic Ge-ometry: Helly numbers and violator spaces Journal of Symbolic Computation, J. Symb.Comput. 77, (2016), 1–15.
(70) (with R. La Haye, A. Montejano, D. Oliveros, E. Roldan-Pensado), A Rainbow RamseyAnalogue of Rado’s Theorem, Discrete Mathematics.Vol. 339, 11, (2016), 2812–2818.
(69) (with S.Borgwardt, J. Miller, and E. Finhold), The Hierarchy of Circuit Diameters andTransportation Polytopes, Discrete Applied Mathematics, Vol. 240, (2018), 8–24. Availableonline at https://doi.org/10.1016/j.dam.2015.10.017
(71) (with V. Baldoni, N. Berline, M. Koppe, M. Vergne), Intermediate Sums on PolyhedraII: Bidegree and Poisson Formula. Mathematika, Vol. 62, (3) 2016 , 653–684, availableonline https://doi.org/10.1112/S0025579315000418
(72) (with N. Amenta and P. Soberon) Helly’s Theorem: New Variations and Applications,in Algebraic and geometric methods in discrete mathematics, edited by H. Harrington et al,Contemp. Math., vol. 685, Amer. Math. Soc., Providence, RI, 2017, pp. 55?95. Availableonline at https://doi.org/10.1090/conm/685/13718
(73) (with R. La Haye, D. Oliveros, E. Roldan-Pensado) Helly numbers of Algebraic subsetsof Rn and an extension of Doignon’s theorem, Advances in Geometry. Vol. 17 (4), (2017)473–482. Available online https://doi.org/10.1515/advgeom-2017-0028
(74) (with S. Borgwardt and E. Finhold), Edges vs Circuits: A Hierarchy of diameters inpolyhedra. Advances in Geometry; 16 (4) (2016): 511–530. Available at https://doi.org/10.1515/advgeom-2016-0020.
(75) (with J. Haddock and D. Needell), A Sampling Kaczmarz-Motzkin Algorithm for LinearFeasibility. SIAM Scientific Computing, Vol. 39 (5), (2017) S66–S87. Available onlinehttps://doi.org/10.1137/16M1073807
(76) (with R. N. La Haye, D. Rolnick, P. Soberon), Quantitative Tverberg theorems overlattices and other discrete sets. Discrete and Computational Geometry, Vol. 58 (2017), no.2, 435–448. Available online https://doi.org/10.1007/s00454-016-9858-3
(77) (with R. N. La Haye, D. Rolnick, P. Soberon), Quantitative combinatorial geometryfor continuous parameters. Discrete and Computational Geometry, Vol. 57 (2017), no. 2,318–334. Available online https://doi.org/10.1007/s00454-016-9857-4
(78) (with I. Aliev, C. O’Neill, and T. Oertel) Sparse solutions of linear Diophantine equa-tions. SIAM journal of Applied Algebra and Geometry, 1(1), (2017) 239–253. Availableonline https://doi.org/10.1137/16M1083876
(79) (with R. La Haye, D. Oliveros, E. Roldan-Pensado) Beyond Chance-Constrained Con-vex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notionof S-optimization. Journal of Convex Analysis 25 (2018), No. 1, 201–218
(80) (with S. Borgwardt and E. Finhold), The Hirsch conjecture holds true for all network-flow polytopes Mathematical Programming (2017). Available online https://doi.org/10.1007/s10107-017-1176-x
(81) (with J. Haddock and L. Rademacher), The Minimum Euclidean-Norm Point on aConvex Polytope: Wolfe’s Combinatorial Algorithm is Exponential. STOC 2018 Proceed-ings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles.(2018), 545–553. Available online https://doi.org/10.1145/3188745.3188820
(82) (with T. Hogan, F. Meunier, N. Mustafa), Integer and Mixed Integer Tverberg Num-bers in Low Dimension in Proceeding of the 34th European Workshop in ComputationalGeometry, Berlin (2018), Paper #36:1-6, Available online at https://conference.imp.fu-berlin.de/eurocg18/download/eurocg proc.pdf
(83) (with I. Aliev, F. Eisenbrand, T. Oertel, and R. Weismantel), All Integer linear pro-grams have sparse optimal solutions. to appear in SIAM Journal of Optimization. 28 (3):2152-2157 (2018)
(84) (with S. Petrovic, L. Silverstein, D. Stasi, and D. Wilburne), Random Monomial IdealsJournal of Algebra. Volume 519, 1, (2019),440–473.
(85) (with L. Silverstein, S. Hosten, R. Krone), Average behavior of Minimal Free Resolu-tions of Monomial Ideals. Proceedings of the American Math. Soc. Volume 147, 8, (2019),3239–3257.
(86) (with X. Goaoc, F. Meunier, and N. Mustafa), The discrete yet ubiquitous theorems ofCaratheodory, Helly, Sperner, Tucker, & Tverberg. Bulletin of the American MathematicalSociety. Volume 56, Number 3, (2019), Pages 415–511.
(87) (with V. Baldoni, N. Berline, M. Koppe, M. Vergne), Three Ehrhart Quasi-polynomials.to appear in Algebraic Combinatorics.
(88) (with C. O’Neill, D. Wilburne) Random numerical semigroups and a simplicial complexof irreducible semigroups. To appear in Electronic Journal of Combinatorics.
(89) Algebraic and Topological Tools in Linear Optimization Notices of the American Math-ematical Society Number 66 (07), 2020, 1023–1033.
(90) (with J. Haddock, A. Ma, D. Needell) Data-driven Algorithm Selection and Tuningin Optimization and Signal Processing to appear in Annals of Mathematics and ArtificialIntelligence
(91) (with J. Haddock and L. Rademacher) The Minimum Euclidean-Norm Point on aConvex Polytope: Wolfe’s Combinatorial Algorithm is Exponential. to appear in SIAMJournal of Computing. Vol. 49, No. 1, pp. 138–169, 2020
(92) (with G. Averkov, A. Aliev, T. Oertel) Optimizing Sparsity over Lattices and Semi-groups, in the proceedings of IPCO 2020, London.
(93) (with T. Hogan, D. Oliveros, D. Yang) A Tverberg Theorem with Trees and Cyclesas (Nerve) Intersection Patterns. Discrete and Computational Geometry. vol. 65, pages916–937 (2021)
(94) (with T. Hogan) Stochastic Tverberg Theorems with Applications to Multiclass LogisticRegression, Separability, and Centerpoints of Data. to appear in SIAM Data Science.
(95) (with G. Averkov, A. Chavez, B. Gillespie) The Lattice of Cycles of an UndirectedGraph. to appear in Linear Algebra and its applications.
(96) (with G. Averkov, A. Aliev, T. Oertel) Sparse representations of vectors in Latticesand Semigroups. to appear Mathematical Programming.
(97) (with C. Athanasiadis and Z. Zhang) Extremal Enumerative Problems on MonotonePaths and Arborescences, to appear in Journal of Graph Theory.
(98) (with M. Blanchard and Q. Louveaux) On Lengths of monotone paths of polyhedra. toappear in SIAM Journal of Discrete Mathematics.
Finished work submitted for publication (all preprints available on math ArXiv)
(99) (with I. Adler, S. Klee, Z. Zhang) Diameters of Cocircuit Graphs of Oriented Matroids.Submitted to Electronic Journal of Combinatorics.
(100) (with S. Kafer and L. Sanita) Pivoting rules for Circuit Augmentation Algorithms inLinear optimization. submitted to SIAM journal of Optimization.
(101) (with A. Black) Monotone Paths of Cross-Polytopes, submitted to Discrete and Com-putational Geometry.
SOFTWARE
The original LattE was first developed in 2001 as C++ software to study lattice points ofconvex polytopes, primarily counting them and computation of Ehrhart functions (see paper(23)). The algorithms used combinations of geometric and symbolic computation. The keydata structures are rational generating functions and cone decompositions. It was the firstever implementation of Barvinok’s algorithm. The latest Latte Integrale 1.7.2 incorporatesthe ability to integrate a polynomial over a polytope.
V. Baldoni, N. Berline, J.A. De Loera, B. Dutra, M. Koppe, S. Moreinis, G. Pinto, M.Vergne, J. Wu, A User’s Guide for LattE integrale v1.7.2, 2013. All versions of the software
package LattE are available at http://www.math.ucdavis.edu/ latte/