( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Randomization in Parameterized Complexity (Dagstuhl Seminar 17041).

, , , и . Dagstuhl Reports, 7 (1): 103-128 (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.

Anette Fomin

Anna Fomina

Anna Fomina

Anton Fomin

Marina Fomin

 

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

Kernelization.. CSR, том 6072 из Lecture Notes in Computer Science, стр. 107-108. Springer, (2010)On the Parameterized Complexity of Cutting a Few Vertices from a Graph., , и . MFCS, том 8087 из Lecture Notes in Computer Science, стр. 421-432. Springer, (2013)Exact Algorithms for Graph Homomorphisms., , и . FCT, том 3623 из Lecture Notes in Computer Science, стр. 161-171. Springer, (2005)Parameterized Complexity of Superstring Problems., , , , , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 89-99. Springer, (2015)Parameterized Algorithms for Directed Maximum Leaf Problems., , , , и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 352-362. Springer, (2007)Subexponential Parameterized Algorithms., , и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 15-27. Springer, (2007)Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up., и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 581-592. Springer, (2004)Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In., , и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 568-580. Springer, (2004)Minimizing Rosenthal Potential in Multicast Games., , , и . ICALP (2), том 7392 из Lecture Notes in Computer Science, стр. 525-536. Springer, (2012)Structured Connectivity Augmentation., , и . MFCS, том 83 из LIPIcs, стр. 29:1-29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)