( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On exact algorithms for treewidth.

, , , , и . ACM Trans. Algorithms, 9 (1): 12:1-12:23 (2012)

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

 

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

Exploring Subexponential Parameterized Complexity of Completion Problems., , , и . CoRR, (2013)Approximating acyclicity parameters of sparse hypergraphs, , и . CoRR, (2008)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)Interval Completion with the Smallest Max-degree., и . WG, том 1517 из Lecture Notes in Computer Science, стр. 359-371. Springer, (1998)Approximation of Pathwidth of Outerplanar Graphs., и . WG, том 2204 из Lecture Notes in Computer Science, стр. 166-176. Springer, (2001)Exact (Exponential) Algorithms for the Dominating Set Problem., , и . WG, том 3353 из Lecture Notes in Computer Science, стр. 245-256. Springer, (2004)Minimizing Rosenthal Potential in Multicast Games., , , и . ICALP (2), том 7392 из Lecture Notes in Computer Science, стр. 525-536. Springer, (2012)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)