( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Complexity of Superstring Problems.

, , , , , и . Algorithmica, 79 (3): 798-813 (2017)

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.

Svilen Ivanov

Marian Ivanov

Natalie Ivanits

Sarah Ivanovas

Oxana Ivanova-Chessex

 

Другие публикации лиц с тем же именем

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