( en | de | ru )

 

Disambiguation of "Fomin, Fedor V."

Author of the publication

copydeleteadd this publication to your clipboard
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs.

, , , , and . STACS, volume 5 of LIPIcs, page 251-262. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)

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.

Anette Fomin

Anna Fomina

Anna Fomina

Anton Fomin

Marina Fomin

 

Other publications of authors with the same name

Pathwidth of cubic graphs and exact algorithms., and . Inf. Process. Lett., 97 (5): 191-196 (2006)Approximating minimum cocolorings., , and . Inf. Process. Lett., 84 (5): 285-290 (2002)Treewidth computation and extremal combinatorics., and . Combinatorica, 32 (3): 289-308 (2012)Representative Families of Product Families., , , and . ACM Trans. Algorithms, 13 (3): 36:1-36:29 (2017)Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms., , , and . J. ACM, 63 (4): 29:1-29:60 (2016)On the Parameterized Complexity of Cutting a Few Vertices from a Graph., , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 421-432. Springer, (2013)Kernelization.. CSR, volume 6072 of Lecture Notes in Computer Science, page 107-108. Springer, (2010)Approximation of Pathwidth of Outerplanar Graphs., and . WG, volume 2204 of Lecture Notes in Computer Science, page 166-176. Springer, (2001)Interval Completion with the Smallest Max-degree., and . WG, volume 1517 of Lecture Notes in Computer Science, page 359-371. Springer, (1998)Minimizing Rosenthal Potential in Multicast Games., , , and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 525-536. Springer, (2012)