PostDoc
EPFL SB IMA
MA C1 553
Station 8
CH-1015 Lausanne
Phone: +41 21 693 2568
Fax: +41 21 693 5840
Email: [email protected]
Biography
- March 29, 1981: born in Khabarovsk, Russia (Russian Soviet Federative Socialist Republic, USSR, being precise)
- July 1998: graduated from the Lyceum of Information Technologies, Khabarovsk, Russia
- July 2002: Bachelor (B.Sc.) degree in applied mathematics and computer science from Khabarovsk State University of Technology, Russia (recently renamed to Pacific National University)
- April 2004: Master of Science (M.Sc.) degree in computer science from University of the Saarland, Saarbrücken, Germany
- April 2004 — March 2006: research assistant at Max Planck Institute for Computer Science, Saarbrücken, Germany
- April 2006 — September 2006: research assistant at University of Dortmund, Germany (recently renamed to Dortmund University of Technology)
- October 2006 — August 2007: research assistant at University of Paderborn, Germany
- August 2007: doctoral (Dr.rer.nat.) degree in mathematics from University of Paderborn, Germany
- August 2007 — December 2007: ADONET post-doc at Laboratoire G-SCOP, Grenoble, France
- January 2008 — March 2008: again, researcher at University of Paderborn, Germany
- Since April 2008: researcher at EPFL
Research Interests
- combinatorial optimization
- integer programming
- algorithmic geometry of numbers
Teaching
- Fall 2008: Integer Points in Polyhedra (lecturer)
- Fall 2008: Combinatorial Optimization (assistant)
- Spring 2007: Combinatorial Optimization (assistant)
- Fall 2006: Optimierung 1+2 (assistant)
- Spring 2006: Effiziente Algorithmen und Komplexitätstheorie (assistant)
- Spring 2006: Optimization (tutor)
Publications
Warning
Please note that the publication lists from Infoscience integrated into the EPFL website, lab or people pages are frozen following the launch of the new version of platform. The owners of these pages are invited to recreate their publication list from Infoscience. For any assistance, please consult the Infoscience help or contact support.
Testing additive integrality gaps
Mathematical Programming. 2013. Vol. 141, num. 1-2, p. 257-271. DOI : 10.1007/s10107-012-0518-y.Testing additive integrality gaps
2010. 21st ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, January 17-19, 2010. p. 1227-1234. DOI : 10.1137/1.9781611973075.98.Parametric integer programming in fixed dimension
Mathematics of Operations Research. 2008. Vol. 33, num. 4, p. 839-850. DOI : 10.1287/moor.1080.0320.Parameterised integer programming, integer cones, and related problems
University of Paderborn, Germany, 2007.Caratheodory bounds for integer cones
Operations Research Letters. 2006. Vol. 34, num. 5, p. 564-568. DOI : 10.1016/j.orl.2005.09.008.Mapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality
2006. p. 87-90. DOI : 10.1109/RTCSA.2006.42.Notes
Testing Hilbert bases, manuscript, 2007 (with Friedrich Eisenbrand and András Sebő ) [ PDF ]