default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvan Bliznets
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j11]Ivan Bliznets, Anton Bukov, Danil Sagunov:
Fair division with minimal withheld information in social networks. Theor. Comput. Sci. 991: 114446 (2024)- 2023
- [j10]Ivan Bliznets
, Danil Sagunov:
Solving Target Set Selection with Bounded Thresholds Faster than 2n. Algorithmica 85(2): 384-405 (2023) - 2020
- [j9]Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk, Lukás Mach:
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems. ACM Trans. Algorithms 16(2): 25:1-25:31 (2020) - [j8]Tatiana Belova, Ivan Bliznets:
Algorithms for (n, 3)-MAXSAT and parameterization above the all-true assignment. Theor. Comput. Sci. 803: 222-233 (2020) - [j7]Ivan Bliznets, Danil Sagunov:
Lower bounds for the happy coloring problems. Theor. Comput. Sci. 838: 94-110 (2020) - 2018
- [j6]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
Subexponential Parameterized Algorithm for Interval Completion. ACM Trans. Algorithms 14(3): 35:1-35:62 (2018) - [j5]Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk:
Hardness of Approximation for H-free Edge Modification Problems. ACM Trans. Comput. Theory 10(2): 9:1-9:32 (2018) - 2017
- [j4]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. Algorithmica 79(3): 798-813 (2017) - 2016
- [j3]Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Algorithmica 76(2): 569-594 (2016) - 2015
- [j2]Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach:
Kernelization lower bound for Permutation Pattern Matching. Inf. Process. Lett. 115(5): 527-531 (2015) - [j1]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Proper Interval Completion. SIAM J. Discret. Math. 29(4): 1961-1987 (2015)
Conference and Workshop Papers
- 2024
- [c28]Vasily Alferov, Ivan Bliznets, Kirill Brilliantov:
Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph. AAAI 2024: 7918-7925 - [c27]Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma:
Parameterized Complexity of Paired Domination. IWOCA 2024: 523-536 - [c26]Samuel Bismuth, Ivan Bliznets, Erel Segal-Halevi:
Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations. SAGT 2024: 89-107 - [c25]Ivan Bliznets, Jesper Nederlof:
Exact and Parameterized Algorithms for Choosability. SOFSEM 2024: 111-124 - [c24]Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi:
Parameterized Algorithms for Covering by Arithmetic Progressions. SOFSEM 2024: 125-138 - [c23]Ivan Bliznets, Markus Hecher:
Tight Double Exponential Lower Bounds. TAMC 2024: 124-136 - 2023
- [c22]Kirill Brilliantov, Vasily Alferov, Ivan Bliznets:
Improved Algorithms for Maximum Satisfiability and Its Special Cases. AAAI 2023: 3898-3905 - [c21]Ivan Bliznets, Danil Sagunov, Eugene Tagin:
Enumeration of Minimal Tropical Connected Sets. CIAC 2023: 127-141 - [c20]Ivan Bliznets, Vladislav Epifanov:
MaxCut Above Guarantee. MFCS 2023: 22:1-22:14 - 2022
- [c19]Ivan Bliznets, Danil Sagunov:
Two Generalizations of Proper Coloring: Hardness and Approximability. COCOON 2022: 82-93 - [c18]Ivan Bliznets, Anton Bukov, Danil Sagunov:
Fair Division with Minimal Withheld Information in Social Networks. COCOON 2022: 126-137 - [c17]Ivan Bliznets, Danil Sagunov, Kirill Simonov:
Fine-grained Complexity of Partial Minimum Satisfiability. IJCAI 2022: 1774-1780 - [c16]Tatiana Belova, Ivan Bliznets:
Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. ISAAC 2022: 24:1-24:15 - 2021
- [c15]Vasily Alferov, Ivan Bliznets:
New Length Dependent Algorithm for Maximum Satisfiability Problem. AAAI 2021: 3634-3641 - 2020
- [c14]Ivan Bliznets, Danil Sagunov:
Maximizing Happiness in Graphs of Bounded Clique-Width. LATIN 2020: 91-103 - 2019
- [c13]Ivan Bliznets, Danil Sagunov:
Lower Bounds for the Happy Coloring Problems. COCOON 2019: 490-502 - [c12]Ivan Bliznets, Danil Sagunov:
On Happy Colorings, Cuts, and Structural Parameterizations. WG 2019: 148-161 - 2018
- [c11]Tatiana Belova, Ivan Bliznets:
Upper and Lower Bounds for Different Parameterizations of (n, 3)-MAXSAT. COCOA 2018: 299-313 - [c10]Ivan Bliznets, Danil Sagunov:
Solving Target Set Selection with Bounded Thresholds Faster than 2^n. IPEC 2018: 22:1-22:14 - 2017
- [c9]Ivan Bliznets, Nikolay Karpov:
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. MFCS 2017: 6:1-6:14 - 2016
- [c8]Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk:
Hardness of Approximation for H-Free Edge Modification Problems. APPROX-RANDOM 2016: 3:1-3:17 - [c7]Virajith Jalaparti, Ivan Bliznets, Srikanth Kandula, Brendan Lucier, Ishai Menache:
Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers. SIGCOMM 2016: 73-86 - [c6]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
Subexponential parameterized algorithm for Interval Completion. SODA 2016: 1116-1131 - [c5]Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk:
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. SODA 2016: 1132-1151 - 2015
- [c4]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CPM 2015: 89-99 - 2014
- [c3]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Proper Interval Completion. ESA 2014: 173-184 - 2013
- [c2]Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA 2013: 193-204 - 2012
- [c1]Ivan Bliznets, Alexander Golovnev:
A New Algorithm for Parameterized MAX-SAT. IPEC 2012: 37-48
Informal and Other Publications
- 2023
- [i13]Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi:
Parameterized Algorithms for Covering by Arithmetic Progressions. CoRR abs/2312.06393 (2023) - 2020
- [i12]Ivan Bliznets, Danil Sagunov:
Maximizing Happiness in Graphs of Bounded Clique-Width. CoRR abs/2003.04605 (2020) - 2019
- [i11]Ivan Bliznets, Danil Sagunov:
Lower Bounds for the Happy Coloring Problems. CoRR abs/1906.05422 (2019) - [i10]Ivan Bliznets, Danil Sagunov:
On Happy Colorings, Cuts, and Structural Parameterizations. CoRR abs/1907.06172 (2019) - 2018
- [i9]Ivan Bliznets, Danil Sagunov:
Solving Target Set Selection with Bounded Thresholds Faster than 2n. CoRR abs/1807.10789 (2018) - 2017
- [i8]Ivan Bliznets, Nikolay Karpov:
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. CoRR abs/1706.09487 (2017) - 2016
- [i7]Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk:
Hardness of approximation for H-free edge modification problems. CoRR abs/1606.02688 (2016) - 2015
- [i6]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CoRR abs/1502.01461 (2015) - [i5]Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk:
Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems. CoRR abs/1508.05282 (2015) - 2014
- [i4]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A subexponential parameterized algorithm for Proper Interval Completion. CoRR abs/1402.3472 (2014) - [i3]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A subexponential parameterized algorithm for Interval Completion. CoRR abs/1402.3473 (2014) - [i2]Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach:
Kernelization lower bound for Permutation Pattern Matching. CoRR abs/1406.1158 (2014) - 2013
- [i1]Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Largest chordal and interval subgraphs faster than 2^n. CoRR abs/1311.4055 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
