( en | de | ru )

 

Disambiguation of "Fomin, Fedor V."

Author of the publication

copydeleteadd this publication to your clipboard
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.

, , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 160-169. Springer, (2002)

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

Approximating acyclicity parameters of sparse hypergraphs, , and . CoRR, (2008)Exploring Subexponential Parameterized Complexity of Completion Problems., , , and . CoRR, (2013)Exact (Exponential) Algorithms for the Dominating Set Problem., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 245-256. Springer, (2004)Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up., and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 581-592. Springer, (2004)Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In., , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 568-580. Springer, (2004)Parameterized Complexity of Superstring Problems., , , , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 89-99. Springer, (2015)Complexity of approximating the oriented diameter of chordal graphs., , and . J. Graph Theory, 45 (4): 255-269 (2004)Shortest Cycles with Monotone Submodular Costs., , , , and . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (January 2024)Subexponential parameterized algorithm for Interval Completion., , , and . SODA, page 1116-1131. SIAM, (2016)Algorithmic Lower Bounds for Problems Parameterized with Clique-Width., , , and . SODA, page 493-502. SIAM, (2010)