Diverse collections in matroids and graphs
Fomin, Fedor V., Golovach, Petr A., Panolan, Fahad, Philip, Geevarghese, Saurabh, Saket
Published in Mathematical programming (2024)
Published in Mathematical programming (2024)
Get full text
Journal Article
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques
Fomin, Fedor V., Liedloff, Mathieu, Montealegre, Pedro, Todinca, Ioan
Published in Algorithmica (01.04.2018)
Published in Algorithmica (01.04.2018)
Get full text
Journal Article
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions
Dorn, Frederic, Penninkx, Eelko, Bodlaender, Hans L., Fomin, Fedor V.
Published in Algorithmica (01.11.2010)
Published in Algorithmica (01.11.2010)
Get full text
Journal Article
On Two Techniques of Combining Branching and Treewidth
Fomin, Fedor V., Gaspers, Serge, Saurabh, Saket, Stepanov, Alexey A.
Published in Algorithmica (01.06.2009)
Published in Algorithmica (01.06.2009)
Get full text
Journal Article
Conference Proceeding
INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONS
FOMIN, Fedor V, GOLOVACH, Petr A, LOKSHTANOV, Daniel, SAURABH, Saket
Published in SIAM journal on computing (2010)
Published in SIAM journal on computing (2010)
Get full text
Journal Article
Faster parameterized algorithms for minor containment
Adler, Isolde, Dorn, Frederic, Fomin, Fedor V., Sau, Ignasi, Thilikos, Dimitrios M.
Published in Theoretical computer science (25.11.2011)
Published in Theoretical computer science (25.11.2011)
Get full text
Journal Article
Implicit branching and parameterized partial cover problems
Amini, Omid, Fomin, Fedor V., Saurabh, Saket
Published in Journal of computer and system sciences (01.11.2011)
Published in Journal of computer and system sciences (01.11.2011)
Get full text
Journal Article
Exact Algorithms for Treewidth and Minimum Fill-In
Fomin, Fedor V., Kratsch, Dieter, Todinca, Ioan, Villanger, Yngve
Published in SIAM journal on computing (01.01.2008)
Published in SIAM journal on computing (01.01.2008)
Get full text
Journal Article
Enumerating Minimal Subset Feedback Vertex Sets
FOMIN, Fedor V, HEGGERNES, Pinar, KRATSCH, Dieter, PAPADOPOULOS, Charis, VILLANGER, Yngve
Published in Algorithmica (01.05.2014)
Published in Algorithmica (01.05.2014)
Get full text
Journal Article
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
Bodlaender, Hans L., Fomin, Fedor V., Koster, Arie M. C. A., Kratsch, Dieter, Thilikos, Dimitrios M.
Published in Theory of computing systems (01.04.2012)
Published in Theory of computing systems (01.04.2012)
Get full text
Journal Article
Computing Optimal Steiner Trees in Polynomial Space
Fomin, Fedor V., Grandoni, Fabrizio, Kratsch, Dieter, Lokshtanov, Daniel, Saurabh, Saket
Published in Algorithmica (01.03.2013)
Published in Algorithmica (01.03.2013)
Get full text
Journal Article
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
Fomin, Fedor V., Lokshtanov, Daniel, Panolan, Fahad, Saurabh, Saket, Zehavi, Meirav
Published in Discrete & computational geometry (01.12.2019)
Published in Discrete & computational geometry (01.12.2019)
Get full text
Journal Article
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
Fomin, Fedor V., Golovach, Petr A., Thilikos, Dimitrios M.
Published in Information and computation (01.08.2023)
Published in Information and computation (01.08.2023)
Get full text
Journal Article