( en | de | ru )

 

Disambiguation of "Bliznets, Ivan"

Author of the publication

copydeleteadd this publication to your clipboard
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n.

, , , and . Algorithmica, 76 (2): 569-594 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Constantin Romulus Ivan

Marian Ivanov

Elizaveta Ivanova

Sarah Ivanovas

Svilen Ivanov

 

Other publications of authors with the same name

Algorithms for (n, 3)-MAXSAT and parameterization above the all-true assignment., and . Theor. Comput. Sci., (2020)Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters., and . MFCS, volume 83 of LIPIcs, page 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems., , , , and . ACM Trans. Algorithms, 16 (2): 25:1-25:31 (2020)A New Algorithm for Parameterized MAX-SAT., and . IPEC, volume 7535 of Lecture Notes in Computer Science, page 37-48. Springer, (2012)Subexponential Parameterized Algorithm for Interval Completion., , , and . ACM Trans. Algorithms, 14 (3): 35:1-35:62 (2018)Parameterized Complexity of Superstring Problems., , , , , and . Algorithmica, 79 (3): 798-813 (2017)Largest Chordal and Interval Subgraphs Faster Than 2 n., , , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 193-204. Springer, (2013)Fine-grained Complexity of Partial Minimum Satisfiability., , and . IJCAI, page 1774-1780. ijcai.org, (2022)Two Generalizations of Proper Coloring: Hardness and Approximability., and . COCOON, volume 13595 of Lecture Notes in Computer Science, page 82-93. Springer, (2022)Lower bounds for the happy coloring problems., and . Theor. Comput. Sci., (2020)