( en | de | ru )

 

Disambiguation of "Fomin, Fedor V."

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.

, , , , , and . GD (2), volume 14466 of Lecture Notes in Computer Science, page 189-202. Springer, (2023)

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

Exact Algorithms for Graph Homomorphisms., , and . FCT, volume 3623 of Lecture Notes in Computer Science, page 161-171. Springer, (2005)Branchwidth of Graphs., and . Encyclopedia of Algorithms, Springer, (2008)Kernelization.. CSR, volume 6072 of Lecture Notes in Computer Science, page 107-108. Springer, (2010)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)Treewidth computation and extremal combinatorics., and . Combinatorica, 32 (3): 289-308 (2012)Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms., , , and . J. ACM, 63 (4): 29:1-29:60 (2016)Representative Families of Product Families., , , and . ACM Trans. Algorithms, 13 (3): 36:1-36:29 (2017)Parameterized Complexity of Superstring Problems., , , , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 89-99. Springer, (2015)Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes., , and . J. ACM, 65 (2): 10:1-10:44 (2018)Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors., , , and . ACM Trans. Algorithms, 14 (1): 6:1-6:31 (2018)