Ivan Bliznets - RankMe

53 papers A* 7A 2B 11C 4Misc 3Journal 25Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Exact and parameterized algorithms for choosability. Acta Informatica Ivan Bliznets, Jesper Nederlof
2024	B	`conf`	Exact and Parameterized Algorithms for Choosability. SOFSEM Ivan Bliznets, Jesper Nederlof
2024	B	`conf`	Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations. SAGT Samuel Bismuth, Ivan Bliznets, Erel Segal-Halevi
2024	J	`jnl`	Fair division with minimal withheld information in social networks. Theor. Comput. Sci. Ivan Bliznets, Anton Bukov, Danil Sagunov
2024	A*	`conf`	Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph. AAAI Vasily Alferov, Ivan Bliznets, Kirill Brilliantov
2024	B	`conf`	Parameterized Algorithms for Covering by Arithmetic Progressions. SOFSEM Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
2024	C	`conf`	Parameterized Complexity of Paired Domination. IWOCA Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma
2024	C	`conf`	Tight Double Exponential Lower Bounds. TAMC Ivan Bliznets, Markus Hecher
2023	C	`conf`	Enumeration of Minimal Tropical Connected Sets. CIAC Ivan Bliznets, Danil Sagunov, Eugene Tagin
2023	A*	`conf`	Improved Algorithms for Maximum Satisfiability and Its Special Cases. AAAI Kirill Brilliantov, Vasily Alferov, Ivan Bliznets
2023	B	`conf`	MaxCut Above Guarantee. MFCS Ivan Bliznets, Vladislav Epifanov
2023	J	`jnl`	Parameterized Algorithms for Covering by Arithmetic Progressions. CoRR Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
2023	J	`jnl`	Solving Target Set Selection with Bounded Thresholds Faster than 2 Algorithmica Ivan Bliznets, Danil Sagunov
2022	Misc	`conf`	Fair Division with Minimal Withheld Information in Social Networks. COCOON Ivan Bliznets, Anton Bukov, Danil Sagunov
2022	A*	`conf`	Fine-grained Complexity of Partial Minimum Satisfiability. IJCAI Ivan Bliznets, Danil Sagunov, Kirill Simonov
2022	B	`conf`	Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. ISAAC Tatiana Belova, Ivan Bliznets
2022	Misc	`conf`	Two Generalizations of Proper Coloring: Hardness and Approximability. COCOON Ivan Bliznets, Danil Sagunov
2021	A*	`conf`	New Length Dependent Algorithm for Maximum Satisfiability Problem. AAAI Vasily Alferov, Ivan Bliznets
2020	J	`jnl`	Algorithms for (n, 3)-MAXSAT and parameterization above the all-true assignment. Theor. Comput. Sci. Tatiana Belova, Ivan Bliznets
2020	J	`jnl`	Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems. ACM Trans. Algorithms Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk, Lukás Mach
2020	J	`jnl`	Lower bounds for the happy coloring problems. Theor. Comput. Sci. Ivan Bliznets, Danil Sagunov
2020	B	`conf`	Maximizing Happiness in Graphs of Bounded Clique-Width. LATIN Ivan Bliznets, Danil Sagunov
2020	J	`jnl`	Maximizing Happiness in Graphs of Bounded Clique-Width. CoRR Ivan Bliznets, Danil Sagunov
2019	Misc	`conf`	Lower Bounds for the Happy Coloring Problems. COCOON Ivan Bliznets, Danil Sagunov
2019	J	`jnl`	Lower Bounds for the Happy Coloring Problems. CoRR Ivan Bliznets, Danil Sagunov
2019	B	`conf`	On Happy Colorings, Cuts, and Structural Parameterizations. WG Ivan Bliznets, Danil Sagunov
2019	J	`jnl`	On Happy Colorings, Cuts, and Structural Parameterizations. CoRR Ivan Bliznets, Danil Sagunov
2018	J	`jnl`	Hardness of Approximation for ACM Trans. Comput. Theory Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk
2018	J	`jnl`	Solving Target Set Selection with Bounded Thresholds Faster than 2 CoRR Ivan Bliznets, Danil Sagunov
2018	B	`conf`	Solving Target Set Selection with Bounded Thresholds Faster than 2^n. IPEC Ivan Bliznets, Danil Sagunov
2018	J	`jnl`	Subexponential Parameterized Algorithm for Interval Completion. ACM Trans. Algorithms Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2018	C	`conf`	Upper and Lower Bounds for Different Parameterizations of (n, 3)-MAXSAT. COCOA Tatiana Belova, Ivan Bliznets
2017	B	`conf`	Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. MFCS Ivan Bliznets, Nikolay Karpov
2017	J	`jnl`	Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. CoRR Ivan Bliznets, Nikolay Karpov
2017	J	`jnl`	Parameterized Complexity of Superstring Problems. Algorithmica Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2016	A*	`conf`	Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers. SIGCOMM Virajith Jalaparti, Ivan Bliznets, Srikanth Kandula, Brendan Lucier, Ishai Menache
2016	—	`conf`	Hardness of Approximation for H-Free Edge Modification Problems. APPROX-RANDOM Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk
2016	J	`jnl`	Hardness of approximation for H-free edge modification problems. CoRR Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk
2016	J	`jnl`	Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Algorithmica Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2016	A*	`conf`	Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. SODA Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk
2016	A*	`conf`	Subexponential parameterized algorithm for Interval Completion. SODA Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2015	J	`jnl`	A Subexponential Parameterized Algorithm for Proper Interval Completion. SIAM J. Discret. Math. Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2015	J	`jnl`	Kernelization lower bound for Permutation Pattern Matching. Inf. Process. Lett. Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach
2015	J	`jnl`	Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems. CoRR Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk
2015	B	`conf`	Parameterized Complexity of Superstring Problems. CPM Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2015	J	`jnl`	Parameterized Complexity of Superstring Problems. CoRR Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2014	A	`conf`	A Subexponential Parameterized Algorithm for Proper Interval Completion. ESA Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	A subexponential parameterized algorithm for Interval Completion. CoRR Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	A subexponential parameterized algorithm for Proper Interval Completion. CoRR Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	Kernelization lower bound for Permutation Pattern Matching. CoRR Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach
2013	A	`conf`	Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013	J	`jnl`	Largest chordal and interval subgraphs faster than 2^n. CoRR Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2012	B	`conf`	A New Algorithm for Parameterized MAX-SAT. IPEC Ivan Bliznets, Alexander Golovnev