E-LIB Suche - Ergebnisse für: Bliznets, Ivan

1

Tight Double Exponential Lower Bounds:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,

Bliznets, Ivan ; Hecher, Markus - p. 124-136 , 2024

Link: https://doi.org/10.1007/..

2

Parameterized Algorithms for Covering by Arithmetic Progres..:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,

Bliznets, Ivan ; Nederlof, Jesper ; Szilágyi, Krisztina - p. 125-138 , 2024

Link: https://doi.org/10.1007/..

3

Correction to: Parameterized Algorithms for Covering by Ari..:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,

Bliznets, Ivan ; Nederlof, Jesper ; Szilágyi, Krisztina - p. C1-C1 , 2024

Link: https://doi.org/10.1007/..

4

Parameterized Complexity of Paired Domination:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Andreev, Nikita ; Bliznets, Ivan ; Kundu, Madhumita... - p. 523-536 , 2024

Link: https://doi.org/10.1007/..

5

Exact and Parameterized Algorithms for Choosability:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,

Bliznets, Ivan ; Nederlof, Jesper - p. 111-124 , 2024

Link: https://doi.org/10.1007/..

6

Fair division with minimal withheld information in social n..:

Bliznets, Ivan ; Bukov, Anton ; Sagunov, Danil
Theoretical Computer Science. 991 (2024) - p. 114446 , 2024

Link: https://doi.org/10.1016/..

7

Enumeration of Minimal Tropical Connected Sets:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,

Bliznets, Ivan ; Sagunov, Danil ; Tagin, Eugene - p. 127-141 , 2023

Link: https://doi.org/10.1007/..

8

Solving Target Set Selection with Bounded Thresholds Faster..:

Bliznets, Ivan ; Sagunov, Danil
Algorithmica. 85 (2022) 2 - p. 384-405 , 2022

Link: https://doi.org/10.1007/..

9

Two Generalizations of Proper Coloring: Hardness and Approx..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Bliznets, Ivan ; Sagunov, Danil - p. 82-93 , 2022

Link: https://doi.org/10.1007/..

10

Fair Division with Minimal Withheld Information in Social N..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Bliznets, Ivan ; Bukov, Anton ; Sagunov, Danil - p. 126-137 , 2022

Link: https://doi.org/10.1007/..

11

Legal and Regulatory Framework for the Creative Industries ..:

, In: Economic Issues of Social Entrepreneurship,

Bliznets, Ivan A. ; Savina, Viktoriia S. ; Gribkov, Ilia A. - p. 257-266 , 2021

Link: https://doi.org/10.1007/..

12

Algorithms for (n,3)-MAXSAT and parameterization above the ..:

Belova, Tatiana ; Bliznets, Ivan
Theoretical Computer Science. 803 (2020) - p. 222-233 , 2020

Link: https://doi.org/10.1016/..

13

Lower Bounds for the Parameterized Complexity of Minimum Fi..:

Bliznets, Ivan ; Cygan, Marek ; Komosa, Paweł..
ACM Transactions on Algorithms. 16 (2020) 2 - p. 1-31 , 2020

Link: https://doi.org/10.1145/..

14

Lower Bounds for the Parameterized Complexity of Minimum Fi..:

Bliznets, Ivan ; Cygan, Marek ; Komosa, Paweł..
ACM Transactions on Algorithms (TALG). 16 (2020) 2 - p. 1-31 , 2020

Link: https://dl.acm.org/doi/1..

15

Maximizing Happiness in Graphs of Bounded Clique-Width:

, In: LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science,

Bliznets, Ivan ; Sagunov, Danil - p. 91-103 , 2020

Link: https://doi.org/10.1007/..