Ivan Bliznets


Education
2012 -- present St. Petersburg Academic University of the Russian Academy of Sciences /
St. Petersburg Department of V.A. Steklov Institute of Mathematics of the Russian Academy of Sciences
, St. Petersburg, Russia

2010 -- 2012 St. Petersburg Academic University of the Russian Academy of Sciences, St. Petersburg, Russia

  • M.Sc. student, Department of Mathematics and Information Technology, Degree With Distinction.
  • Thesis title: "New Upper Bounds for Maximum Satisfiability Problem".
  • Advisor: Alexander S. Kulikov
  • Major: Computer Science

Publications

  1. Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukas Mach: Kernelization lower bound for Permutation Pattern Matching. Information Processing Letters, 2015.
  2. Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michał Pilipczuk: A subexponential parameterized algorithm for Interval Completion. Submitted.
  3. Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michał Pilipczuk: A Subexponential Parameterized Algorithm for Proper Interval Completion. ESA 2014: 173-184.
  4. Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger: Largest Chordal and Interval Subgraphs Faster Than 2^n. ESA 2013: 193-204.
  5. Ivan Bliznets, Alexander Golovnev: A New Algorithm for Parameterized MAX-SAT. IPEC 2012: 37-48. draft, Excellent Student Paper Award.
  6. Bliznets, I. A., A new upper bound for (n,3)-MAX-SAT, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 399 (2012), Voprosy Slozhnosti Vychislenii. X, 5--14, 128; MR2944997.

Interests

  • Exact algorithms
  • FPT algorithms
  • Kernelization
  • Approximation algorithms
  • Expanders