I. Bliznets

发表

Fine-grained Complexity of Partial Minimum Satisfiability

Kirill Simonov, Ivan A. Bliznets, Danil Sagunov, 2022, IJCAI.

Solving Target Set Selection with Bounded Thresholds Faster than 2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^n

Danil Sagunov, Ivan Bliznets, Danil Sagunov, 2018, Algorithmica.

Upper and Lower Bounds for Different Parameterizations of (n, 3)-MAXSAT

Ivan Bliznets, Tatiana Belova, I. Bliznets, 2018, COCOA.

Largest Chordal and Interval Subgraphs Faster than 2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^n$$\end{documen

Michal Pilipczuk, Fedor V. Fomin, Yngve Villanger, 2015, Algorithmica.

Largest Chordal and Interval Subgraphs Faster than

F. Fomin, Yngve Villanger, Michal Pilipczuk, 2015 .

Largest Chordal and Interval Subgraphs Faster Than 2 n

Michal Pilipczuk, Fedor V. Fomin, Yngve Villanger, 2013, ESA.

Kernelization lower bound for Permutation Pattern Matching pdf

Marek Cygan, Lukás Mach, Ivan Bliznets, 2014, Inf. Process. Lett..

Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers

Srikanth Kandula, Ishai Menache, Brendan Lucier, 2016, SIGCOMM.

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems

Marek Cygan, Michal Pilipczuk, Ivan A. Bliznets, 2015, SODA.

Subexponential Parameterized Algorithm for Interval Completion

Michal Pilipczuk, Fedor V. Fomin, Marcin Pilipczuk, 2016, SODA.

A subexponential parameterized algorithm for Interval Completion

F. Fomin, Marcin Pilipczuk, Michal Pilipczuk, 2014, arXiv.org.

A Subexponential Parameterized Algorithm for Proper Interval Completion pdf

Michal Pilipczuk, Fedor V. Fomin, Marcin Pilipczuk, 2014, ESA.

Hardness of Approximation for H-free Edge Modification Problems

Michal Pilipczuk, Marek Cygan, Ivan Bliznets, 2016, APPROX-RANDOM.

Maximizing Happiness in Graphs of Bounded Clique-Width

Danil Sagunov, Ivan Bliznets, Ivan A. Bliznets, 2020, LATIN.