Research group

Parameterized Algorithms Laboratory


New Length Dependent Algorithm for Maximum Satisfiability Problem

May 2021

Vasily Alferov, Ivan Bliznets

Proceedings of the AAAI Conference on Artificial Intelligence, 35(5), 3634-3641

Read more

Diverse Pairs of Matchings

December 2020

Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov

ISAAC 2020: The 31st International Symposium on Algorithms and Computation

Read more

Building Large k-Cores from Sparse Graphs

August 2020

Fedor Fomin, Danil Sagunov, Kirill Simonov

MFCS 2020: 45th International Symposium on Mathematical Foundations of Computer Science

Read more

On Happy Colorings, Cuts, and Structural Parameterizations

September 2019

Ivan Bliznets and Danil Sagunov

WG 2019: Graph-Theoretic Concepts in Computer Science

Read more

Lower Bounds for the Happy Coloring Problems

July 2019

Ivan Bliznets and Danil Sagunov

COCOON 2019: Computing and Combinatorics

Read more

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

November 2018

Tatiana Belova and Ivan Bliznets

COCOA 2018: Combinatorial Optimization and Applications

Read more