2024

2024a

(Re)packing equal disks into rectangle
F. V. Fomin, P. A. Golovach, T. Inamdar, S. Saurabh, M. Zehavi
Discrete Comput. Geom.  72  1596--1629  (2024)
DOI PDF

2024b

Longest cycle above Erdos--Gallai bound
F. V. Fomin, P. A. Golovach, D. Sagunov, K. Simonov
SIAM J. Discrete Math.  38  2721--2749  (2024)
DOI PDF

2024c

Fast FPT-approximation of branchwidth
F. V. Fomin, T. Korhonen
SIAM J. Comput.  53  1085--1131  (2024)
DOI PDF

2024d

Approximating Long Cycle above Dirac's guarantee
F. V. Fomin, P. A. Golovach, D. Sagunov, K. Simonov
Algorithmica  86  2676--2713  (2024)
DOI PDF

2024e

Diverse pairs of matchings
F. V. Fomin, P. A. Golovach, L. Jaffke, G. Philip, D. Sagunov
Algorithmica  86  2026--2040  (2024)
DOI PDF

2024f

Parameterized complexity of broadcasting in graphs
F. V. Fomin, P. Fraigniaud, P. A. Golovach
Theoret. Comput. Sci.  997  Paper No. 114508, 14  (2024)
DOI PDF

2024g

Shortest cycles with monotone submodular costs
F. V. Fomin, P. A. Golovach, T. Korhonen, D. Lokshtanov, G. Stamoulis
ACM Trans. Algorithms  20  Art. 2, 16  (2024)
DOI PDF

2024h

On coresets for Fair Clustering
S. Bandyapadhyay, F. V. Fomin, K. Simonov
J. Comput. System Sci.  142  Paper No. 103506, 38  (2024)
DOI PDF

2024i

FPT approximation and subexponential algorithms for covering few or many edges
F. V. Fomin, P. A. Golovach, T. Inamdar, T. Koana
Inform. Process. Lett.  185  Paper No. 106471, 6  (2024)
DOI PDF

2024k

Fixed-parameter tractability of Maximum Colored Path and beyond
F. V. Fomin, P. A. Golovach, T. Korhonen, K. Simonov, G. Stamoulis
ACM Trans. Algorithms  20  36:1--36:48  (2024)
DOI PDF

2024l

Diverse collections in matroids and graphs
F. V. Fomin, P. A. Golovach, F. Panolan, G. Philip, S. Saurabh
Math. Program.  204  415--447  (2024)
DOI PDF

2024m

Compound logics for modification problems
F. V. Fomin, P. A. Golovach, I. Sau, G. Stamoulis, S. Saurabh
ACM Transactions on Computational Logic  26  Art. No. 2, 57 pp.  (2024)
DOI PDF

2023

2023a

Lossy kernelization of same-size clustering
S. Bandyapadhyay, F. V. Fomin, P. A. Golovach, N. Purohit, and K. Simonov
Theory Comput. Syst.  67  785--824  (2023)
PDF

2023b

How to find a good explanation for clustering?
S. Bandyapadhyay, F. V. Fomin, P. A. Golovach, W. Lochet, N. Purohit, and K. Simonov
Artificial Intelligence  322  Paper No. 103948, 20  (2023)
PDF

2023c

Detours in directed graphs
F. V. Fomin, P. A. Golovach, W. Lochet, D. Sagunov, S. Saurabh, and K. Simonov
J. Comput. System Sci.  137  66--86  (2023)
PDF

2023d

Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
F. V. Fomin, P. A. Golovach, and D. M. Thilikos
Inform. and Comput.  293  Paper No. 105049, 21  (2023)
PDF

2023e

A survey of parameterized algorithms and the complexity of edge modification
C. Crespelle, P. l. G. n. s. Drange, F. V. Fomin, and P. Golovach
Comput. Sci. Rev.  48  Paper No. 100556, 31  (2023)
PDF

2023f

Parameterized complexity of categorical clustering with size constraints
F. V. Fomin, P. A. Golovach, and N. Purohit
J. Comput. System Sci.  136  171--194  (2023)
PDF

2023g

On the optimality of pseudo-polynomial algorithms for integer programming
F. V. Fomin, F. Panolan, M. S. Ramanujan, and S. Saurabh
Math. Program.  198  561--593  (2023)
PDF

2023h

Building large k-cores from sparse graphs
F. V. Fomin, D. Sagunov, and K. Simonov
J. Comput. System Sci.  132  68--88  (2023)
PDF

2022

2022e

Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering
F. V. Fomin, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh
SIAM J. Comput.  51  1866--1930  (2022)
PDF

2022d

Parameterized complexity of elimination distance to first-order logic properties
F. V. Fomin, P. A. Golovach, and D. M. Thilikos
ACM Trans. Comput. Log.  23  Art. 17, 35  (2022)
PDF

2022c

Parameterized complexity of directed spanner problems
F. V. Fomin, P. A. Golovach, W. Lochet, P. Misra, S. Saurabh, and R. Sharma
Algorithmica  84  2292--2308  (2022)
PDF

2022b

Present-biased optimization
F. V. Fomin, P. Fraigniaud, and P. A. Golovach
Math. Social Sci.  119  56--67  (2022)
PDF

2022a

On the parameterized complexity of the expected coverage problem
F. V. Fomin and V. Ramamoorthi
Theory Comput. Syst.  66  432--453  (2022)
PDF

2021

2021a

Subexponential parameterized algorithms and kernelization on almost chordal graphs
F. V. Fomin and P. A. Golovach
Algorithmica  83  2170--2214  (2021)
PDF

2021b

Kernelization of Whitney switches
F. V. Fomin and P. A. Golovach
SIAM J. Discrete Math.  35  1298--1336  (2021)
PDF

2021c

Computation of Hadwiger number and related contraction problems: tight lower bounds
F. V. Fomin and D. Lokshtanov and I. Mihajlin and S. Saurabh and M. Zehavi
ACM Trans. Comput. Theory  13  Art. 10, 25  (2021)
PDF

2021d

Kernelization of graph Hamiltonicity: proper H-graphs
S. Chaplick and F. V. Fomin and P. A. Golovach and D. Knop and P. Zeman
SIAM J. Discrete Math.  35  840--892  (2021)
PDF

2021e

Parameterized k-clustering: tractability island
F. V. Fomin and P. A. Golovach and K. Simonov
J. Comput. System Sci.  117  50--74  (2021)
PDF

2021f

ETH-tight algorithms for Long Path and Cycle on unit disk graphs
M. Zehavi and F. V. Fomin and D. Lokshtanov and F. Panolan and S. Saurabh
J. Comput. Geom.  12  126--148  (2021)
PDF

2021g

Multiplicative parameterization above a guarantee
F. V. Fomin and P. A. Golovach and D. Lokshtanov and F. Panolan and S. Saurabh and M. Zehavi
ACM Trans. Comput. Theory  13  18:1--18:16  (2021)
PDF

2020

2020a

On the tractability of optimization problems on H-graphs
F. V. Fomin and P. A. Golovach and J.-F. Raymond
Algorithmica  82  2432--2473  (2020)
PDF

2020b

Going far from degeneracy
F. V. Fomin and P. A. Golovach and D. Lokshtanov and F. Panolan and S. Saurabh and M. Zehavi
SIAM J. Discrete Math.  34  1587--1601  (2020)
PDF

2020c

Path contraction faster than $2^n$
A. Agrawal and F. V. Fomin and D. Lokshtanov and S. Saurabh and P. Tale
SIAM J. Discrete Math.  34  1302--1325  (2020)
PDF

2020d

Subgraph complementation
F. V. Fomin and P. A. Golovach and T. J. F. Str\o mme and D. M. Thilikos
Algorithmica  82  1859--1880  (2020)
PDF

2020e

Subexponential algorithms for rectilinear Steiner tree and arborescence problems
F. V. Fomin and D. Lokshtanov and S. Kolay and F. Panolan and S. Saurabh
ACM Trans. Algorithms  16  Art. 21, 37  (2020)
PDF

2020f

Parameterized low-rank binary matrix approximation
F. V. Fomin and P. A. Golovach and F. Panolan
Data Min. Knowl. Discov.  34  478--532  (2020)
PDF

2020g

On the parameterized complexity of graph modification to first-order logic properties
F. V. Fomin and P. A. Golovach and D. M. Thilikos
Theory Comput. Syst.  64  251--271  (2020)
PDF

2020h

On the parameterized complexity of $[1, j]$-domination problems
M. Alambardar Meybodi and F. V. Fomin and A. E. Mouawad and F. Panolan
Theoret. Comput. Sci.  804  207--218  (2020)
PDF

2020i

Approximation Schemes for Low-rank Binary Matrix Approximation Problems
F. V. Fomin and P. A. Golovach and D. Lokshtanov and F. Panolan and S. Saurabh
ACM Trans. Algorithms  16  12:1--12:39  (2020)
PDF

2020k

Bidimensionality and Kernels
F. V. Fomin and D. Lokshtanov and S. Saurabh and D. M. Thilikos
{SIAM} J. Comput.  49  1397--1422  (2020)
PDF

2019

2019a

Finding detours is fixed-parameter tractable
I. Bezakova and R. Curticapean and H. Dell and F. V. Fomin
SIAM J. Discrete Math.  33  2326--2345  (2019)
PDF

2019b

Finding, hitting and packing cycles in subexponential time on unit disk graphs
F. V. Fomin and D. Lokshtanov and F. Panolan and S. Saurabh and M. Zehavi
Discrete Comput. Geom.  62  879--911  (2019)
PDF

2019c

A fixed-parameter perspective on #BIS
R. Curticapean and H. Dell and F. V. Fomin and L. A. Goldberg and J. Lapinskas
Algorithmica  81  3844--3864  (2019)
PDF

2019d

On width measures and topological problems on semi-complete digraphs
F. V. Fomin and M. Pilipczuk
J. Combin. Theory Ser. B  138  78--165  (2019)
PDF

2019e

Editing to connected f-degree graph
F. V. Fomin and P. Golovach and F. Panolan and S. Saurabh
SIAM J. Discrete Math.  33  795--836  (2019)
PDF

2019f

Exact algorithms via monotone local search
F. V. Fomin and S. Gaspers and D. Lokshtanov and S. Saurabh
J. ACM  66  Art. 8, 23  (2019)
PDF

2019g

Subquadratic kernels for implicit 3-hitting set and 3-set packing problems
F. V. Fomin and T.-N. Le and D. Lokshtanov and S. Saurabh and S. Thomasse and M. Zehavi
ACM Trans. Algorithms  15  Art. 13, 44  (2019)
PDF

2019h

Clique-width III: Hamiltonian cycle and the odd case of graph coloring
F. V. Fomin and P. A. Golovach and D. Lokshtanov and S. Saurabh and M. Zehavi
ACM Trans. Algorithms  15  Art. 9, 27  (2019)
PDF

2019i

Parameterized single-exponential time polynomial space algorithm for Steiner tree
F. V. Fomin and P. Kaski and D. Lokshtanov and F. Panolan and S. Saurabh
SIAM J. Discrete Math.  33  327--345  (2019)
PDF

2019k

Spanning circuits in regular matroids
F. V. Fomin and P. A. Golovach and D. Lokshtanov and S. Saurabh
ACM Trans. Algorithms  15  52:1--52:38  (2019)
PDF

2018

2018a

Structured connectivity augmentation
F. V. Fomin and P. A. Golovach and D. M. Thilikos
SIAM J. Discrete Math.  32  2612--2635  (2018)
PDF

2018b

Covering vectors by spaces: Regular matroids
F. V. Fomin and P. A. Golovach and D. Lokshtanov and S. Saurabh
SIAM J. Discrete Math.  32  2512--2565  (2018)
PDF

2018c

Long directed (s,t)-path: FPT algorithm
F. V. Fomin and D. Lokshtanov and F. Panolan and S. Saurabh and M. Zehavi
Inform. Process. Lett.  140  8--12  (2018)
PDF

2018d

Subexponential parameterized algorithm for interval completion
I. Bliznets and F. V. Fomin and M. Pilipczuk and M. Pilipczuk
ACM Trans. Algorithms  14  Art. 35, 62  (2018)
PDF

2018e

Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
F. V. Fomin and D. Lokshtanov and S. Saurabh and M. Pilipczuk and M. Wrochna
ACM Trans. Algorithms  14  Art. 34, 45  (2018)
PDF

2018f

Exact algorithms for terrain guarding
P. Ashok and F. V. Fomin and S. Kolay and S. Saurabh and M. Zehavi
ACM Trans. Algorithms  14  Art. 25, 20  (2018)
PDF

2018g

Matrix rigidity from the viewpoint of parameterized complexity
F. V. Fomin and D. Lokshtanov and S. M. Meesum and S. Saurabh and M. Zehavi
SIAM J. Discrete Math.  32  966--985  (2018)
PDF

2018h

Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
F. V. Fomin and M. Liedloff and P. Montealegre and I. Todinca
Algorithmica  80  1146--1169  (2018)
PDF

2018i

Kernels for (connected) dominating set on graphs with excluded topological minors
F. V. Fomin and D. Lokshtanov and S. Saurabh and D. M. Thilikos
ACM Trans. Algorithms  14  Art. 6, 31  (2018)
PDF

2018j

Excluded grid minors and efficient polynomial-time approximation schemes
F. V. Fomin and D. Lokshtanov and S. Saurabh
J. ACM  65  Art. 10, 44  (2018)
PDF

2017

2017a

Parameterized complexity of superstring problems
I. Bliznets and F. V. Fomin and P. A. Golovach and N. Karpov and A. S. Kulikov and S. Saurabh
Algorithmica  79  798--813  (2017)
PDF

2017b

Representative families of product families
F. V. Fomin and D. Lokshtanov and F. Panolan and S. Saurabh
ACM Trans. Algorithms  13  Art. 36, 29  (2017)
PDF

2017c

Parameterized complexity of secluded connectivity problems
F. V. Fomin and P. A. Golovach and N. Karpov and A. S. Kulikov
Theory Comput. Syst.  61  795--819  (2017)
PDF

2017d

Tight lower bounds on graph embedding problems
M. Cygan and F. V. Fomin and A. Golovnev and A. S. Kulikov and I. Mihajlin and J. Pachocki and A. Soca\l a
J. ACM  64  Art. 18, 22  (2017)
PDF

2017e

Metric dimension of bounded tree-length graphs
R. Belmonte and F. V. Fomin and P. A. Golovach and M. S. Ramanujan
SIAM J. Discrete Math.  31  1217--1243  (2017)
PDF

2017f

Faster exact algorithms for some terminal set problems
R. Chitnis and F. V. Fomin and D. Lokshtanov and P. Misra and M. S. Ramanujan and S. Saurabh
J. Comput. System Sci.  88  195--207  (2017)
PDF

2016

2016a

(Meta) Kernelization
H. L. Bodlaender and F. V. Fomin and D. Lokshtanov and E. Penninkx and S. Saurabh and D. M. Thilikos
J. ACM  63  44:1--44:69  (2016)
PDF

2016b

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
F. V. Fomin and D. Lokshtanov and F. Panolan and S. Saurabh
J. ACM  63  29:1--29:60  (2016)
PDF

2016c

A $c^kn$ 5-approximation algorithm for treewidth
H. L. Bodlaender and P. G. Drange and M. S. Dregi and F. V. Fomin and D. Lokshtanov and M. Pilipczuk
SIAM J. Comput.  45  317--378  (2016)
PDF

2016d

Hitting forbidden minors: approximation and kernelization
F. V. Fomin and D. Lokshtanov and N. Misra and G. Philip and S. Saurabh
SIAM J. Discrete Math.  30  383--410  (2016)
PDF

2016e

Parameterized complexity of the anchored k-core problem for directed graphs
R. Chitnis and F. V. Fomin and P. A. Golovach
Inform. and Comput.  247  11--22  (2016)
PDF

2016f

The firefighter problem on graph classes
F. V. Fomin and P. Heggernes and E. J. van Leeuwen
Theoret. Comput. Sci.  613  38--50  (2016)
PDF

2016g

How to hunt an invisible rabbit on a graph
T. V. Abramovskaya and F. V. Fomin and P. A. Golovach and M. Pilipczuk
European J. Combin.  52  12--26  (2016)
PDF

2016h

Largest chordal and interval subgraphs faster than $2^n$
I. Bliznets and F. V. Fomin and M. Pilipczuk and Y. Villanger
Algorithmica  76  569--594  (2016)
PDF

2015

2015a

A Subexponential parameterized algorithm for Proper Interval Completion
I. Bliznets and F. V. Fomin and M. Pilipczuk and M. Pilipczuk
SIAM J. Discrete Math.  29  1961--1987  (2015)
PDF

2015b

Computing tree-depth faster than $2^n$
F. V. Fomin and A. C. Giannopoulou and M. Pilipczuk
Algorithmica  73  202--216  (2015)
PDF

2015c

Minimizing Rosenthal potential in multicast games
F. V. Fomin and P. A. Golovach and J. Nederlof and M. Pilipczuk
Theory Comput. Syst.  57  81--96  (2015)
PDF

2015d

Large induced subgraphs via triangulations and CMSO
F. V. Fomin and I. Todinca and Y. Villanger
SIAM J. Comput.  44  54--87  (2015)
PDF

2015e

Minimum fill-in of sparse graphs: kernelization and approximation
F. V. Fomin and G. Philip and Y. Villanger
Algorithmica  71  1--20  (2015)
PDF

2015f

On the parameterized complexity of vertex cover and edge cover with connectivity constraints
H. Fernau and F. V. Fomin and G. Philip and S. Saurabh
Theoret. Comput. Sci.  565  1--15  (2015)
PDF

2015g

Exploring the subexponential complexity of completion problems
P. G. Drange and F. V. Fomin and M. Pilipczuk and Y. Villanger
ACM Transactions on Computation Theory (TOCT)  7  14  (2015)
PDF

2014

2014a

Social choice meets graph drawing: how to get subexponential time algorithms for ranking and drawing problems
H. Fernau and F. V. Fomin and D. Lokshtanov and M. Mnich and G. Philip and S. Saurabh
Tsinghua Sci. Technol.  19  374--386  (2014)
PDF

2014b

Almost optimal lower bounds for problems parameterized by clique-width
F. V. Fomin and P. A. Golovach and D. Lokshtanov and S. Saurabh
SIAM J. Comput.  43  1541--1563  (2014)
PDF

2014c

Long circuits and large Euler subgraphs
F. V. Fomin and P. A. Golovach
SIAM J. Discrete Math.  28  878--892  (2014)
PDF

2014d

Tight bounds for parameterized complexity of cluster editing with a small number of clusters
F. V. Fomin and S. Kratsch and M. Pilipczuk and M. Pilipczuk and Y. Villanger
J. Comput. System Sci.  80  1430--1447  (2014)
PDF

2014e

Searching for better fill-in
F. V. Fomin and Y. Villanger
J. Comput. System Sci.  80  1374--1383  (2014)
PDF

2014f

Parameterized complexity of firefighting
C. Bazgan and M. Chopin and M. Cygan and M. R. Fellows and F. V. Fomin and E. J. van Leeuwen
J. Comput. System Sci.  80  1285--1297  (2014)
PDF

2014g

To satisfy impatient Web surfers is hard
F. V. Fomin and F. Giroire and A. Jean-Marie and D. Mazauric and N. Nisse
Theoret. Comput. Sci.  526  1--17  (2014)
PDF

2014h

Enumerating minimal subset feedback vertex sets
F. V. Fomin and P. Heggernes and D. Kratsch and C. Papadopoulos and Y. Villanger
Algorithmica  69  216--231  (2014)
PDF

2014i

Preprocessing subgraph and minor problems: When does a small vertex cover help?
F. V. Fomin and B. M. P. Jansen and M. Pilipczuk
J. Comput. System Sci.  80  468--495  (2014)
PDF

2014k

Parameterized complexity of connected even/odd subgraph problems
F. V. Fomin and P. A. Golovach
J. Comput. System Sci.  80  157--179  (2014)
PDF

2013

2013a

Distortion is fixed parameter tractable
M. R. Fellows and F. V. Fomin and D. Lokshtanov and E. Losievskaja and F. A. Rosamond and S. Saurabh
ACM Transactions on Computation Theory  5  16  (2013)
PDF

2013b

Quadratic upper bounds on the Erdos-Pósa property for a generalization of packing and covering cycles
F. V. Fomin and D. Lokshtanov and N. Misra and G. Philip and S. Saurabh
Journal of Graph Theory  74  417-424  (2013)
PDF

2013c

Exact exponential algorithms
F. V. Fomin and P. Kaski
Commun. ACM  56  80-88  (2013)
PDF

2013d

Subexponential parameterized algorithm for minimum fill-in
F. V. Fomin and Y. Villanger
SIAM J. Comput.  42  2197--2216  (2013)
PDF

2013e

A Polynomial kernel for proper interval vertex deletion
F. V. Fomin and S. Saurabh and Y. Villanger
SIAM J. Discrete Math.  27  1964--1976  (2013)
PDF

2013f

Computing optimal Steiner trees in polynomial space
F. V. Fomin and F. Grandoni and D. Kratsch and D. Lokshtanov and S. Saurabh
Algorithmica  65  584--604  (2013)
PDF

2013g

Exact algorithms for finding longest cycles in claw-free graphs
H. Broersma and F. V. Fomin and P. van 't Hof and D. Paulusma
Algorithmica  65  129--145  (2013)
PDF

2013h

Three complexity results on coloring $P_k$-free graphs
H. Broersma and F. V. Fomin and P. A. Golovach and D. Paulusma
European J. Combin.  34  609--619  (2013)
PDF

2013i

A linear vertex kernel for maximum internal spanning tree
F. V. Fomin and S. Gaspers and S. Saurabh and S. Thomassé
J. Comput. System Sci.  79  1--6  (2013)
PDF

2013k

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
F. Dorn and F. V. Fomin and D. Lokshtanov and V. Raman and S. Saurabh
Inf. Comput.  233  60-70  (2013)
PDF

2012

2012a

A note on exact algorithms for vertex ordering problems on graphs
H. L. Bodlaender and F. V. Fomin and A. M. C. A. Koster and D. Kratsch and D. M. Thilikos
Theory Comput. Syst.  50  420--432  (2012)
PDF

2012b

Catalan structures and dynamic programming in H-minor-free graphs
F. Dorn and F. V. Fomin and D. M. Thilikos
J. Comput. System Sci.  78  1606--1622  (2012)
PDF

2012c

Connected graph searching
L. Barrière and P. Flocchini and F. V. Fomin and P. Fraigniaud and N. Nisse and N. Santoro and D. M. Thilikos
Inform. and Comput.  219  1--16  (2012)
PDF

2012d

Cops and robber game without recharging
F. V. Fomin and P. A. Golovach and D. Lokshtanov
Theory Comput. Syst.  50  611--620  (2012)
PDF

2012e

Cops and robber with constraints
F. V. Fomin and P. A. Golovach and P. Pralat
SIAM J. Discrete Math.  26  571-590  (2012)
PDF

2012f

Counting subgraphs via homomorphisms
O. Amini and F. V. Fomin and S. Saurabh
SIAM J. Discrete Math.  26  695-717  (2012)
PDF

2012g

Fast minor testing in planar graphs
I. Adler and F. Dorn and F. V. Fomin and I. Sau and D. M. Thilikos
Algorithmica  64  69--84  (2012)
PDF

2012h

Faster algorithms for finding and counting subgraphs
F. V. Fomin and D. Lokshtanov and V. Raman and S. Saurabh and B. V. R. Rao
J. Comput. System Sci.  78  698--706  (2012)
PDF

2012i

Kernel(s) for problems with no kernel: On out-trees with many leaves
D. Binkele-Raible and H. Fernau and F. V. Fomin and D. Lokshtanov and S. Saurabh and Y. Villanger
ACM Transactions on Algorithms  8  38  (2012)
PDF

2012j

Local search: is brute-force avoidable?
M. R. Fellows and F. V. Fomin and D. Lokshtanov and F. Rosamond and S. Saurabh and Y. Villanger
J. Comput. System Sci.  78  707--719  (2012)
PDF

2012k

On exact algorithms for treewidth
H. L. Bodlaender and F. V. Fomin and A. M. C. A. Koster and D. Kratsch and D. M. Thilikos
ACM Transactions on Algorithms  9  12  (2012)
PDF

2012l

Parameterized complexity of the spanning tree congestion problem
H. L. Bodlaender and F. V. Fomin and P. A. Golovach and Y. Otachi and E. J. van Leeuwen
Algorithmica  64  85--111  (2012)
PDF

2012m

Sharp separation and applications to exact and parameterized algorithms
F. V. Fomin and F. Grandoni and D. Lokshtanov and S. Saurabh
Algorithmica  63  692--706  (2012)
PDF

2012n

Treewidth computation and extremal combinatorics
F. V. Fomin and Y. Villanger
Combinatorica  32  289--308  (2012)
PDF

2011

2011p

Faster parameterized algorithms for minor containment
I. Adler and F. Dorn and F. V. Fomin and I. Sau and D. M. Thilikos
Theoret. Comput. Sci.  412  7018--7028  (2011)
PDF

2011o

How to guard a graph?
F. V. Fomin and P. A. Golovach and A. Hall and M. Mihalák and E. Vicari and P. Widmayer
Algorithmica  61  839--856  (2011)
PDF

2011n

Guard games on graphs: keep the intruder out!
F. V. Fomin and P. A. Golovach and D. Lokshtanov
Theoret. Comput. Sci.  412  6484--6497  (2011)
PDF

2011m

Approximating width parameters of hypergraphs with excluded minors
F. V. Fomin and P. A. Golovach and D. M. Thilikos
SIAM J. Discrete Math.  25  1331--1348  (2011)
PDF

2011l

Implicit branching and parameterized partial cover problems
O. Amini and F. V. Fomin and S. Saurabh
J. Comput. System Sci.  77  1159--1171  (2011)
PDF

2011k

Spanners in sparse graphs
F. F. Dragan and F. V. Fomin and P. A. Golovach
J. Comput. System Sci.  77  1108--1119  (2011)
PDF

2011j

Kernels for feedback arc set in tournaments
S. Bessy and F. V. Fomin and S. Gaspers and C. Paul and A. Perez and S. Saurabh and S. Thomassé
J. Comput. System Sci.  77  1071--1078  (2011)
PDF

2011i

On the complexity of reconstructing H-free graphs from their star systems
F. V. Fomin and J. Kratochvil and D. Lokshtanov and F. Mancini and J. A. Telle
J. Graph Theory  68  113--124  (2011)
PDF

2011h

Subexponential algorithms for partial cover problems
F. V. Fomin and D. Lokshtanov and V. Raman and S. Saurabh
Inform. Process. Lett.  111  814--818  (2011)
PDF

2011g

Branch and recharge: exact algorithms for generalized domination
F. V. Fomin and P. A. Golovach and J. Kratochvil and D. Kratsch and M. Liedloff
Algorithmica  61  252--273  (2011)
PDF

2011f

An exact algorithm for minimum distortion embedding
F. V. Fomin and D. Lokshtanov and S. Saurabh
Theoret. Comput. Sci.  412  3530--3536  (2011)
PDF

2011e

Contraction obstructions for treewidth
F. V. Fomin and P. Golovach and D. M. Thilikos
J. Combin. Theory Ser. B  101  302--314  (2011)
PDF

2011d

Approximation of minimum weight spanners for sparse graphs
F. F. Dragan and F. V. Fomin and P. A. Golovach
Theoret. Comput. Sci.  412  846--852  (2011)
PDF

2011c

Strengthening Erdős-Posa property for minor-closed graph classes
F. V. Fomin and S. Saurabh and D. M. Thilikos
J. Graph Theory  66  235--240  (2011)
PDF

2011b

On the complexity of some colorful problems parameterized by treewidth
M. R. Fellows and F. V. Fomin and D. Lokshtanov and F. Rosamond and S. Saurabh and S. Szeider and C. Thomassen
Inform. and Comput.  209  143--153  (2011)
PDF

2011a

Spanners of bounded degree graphs
F. V. Fomin and P. A. Golovach and E. J. van Leeuwen
Inform. Process. Lett.  111  142--144  (2011)
PDF

2010

2010h

Mixed search number and linear-width of interval and split graphs
F. V. Fomin and P. Heggernes and R. Mihai
Networks  56  207--214  (2010)
PDF

2010g

Rank-width and tree-width of H-minor-free graphs
F. V. Fomin and S.-i. Oum and D. M. Thilikos
European J. Combin.  31  1617--1628  (2010)
PDF

2010f

Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions
F. Dorn and E. Penninkx and H. L. Bodlaender and F. V. Fomin
Algorithmica  58  790--810  (2010)
PDF

2010e

Parameterized algorithm for eternal vertex cover
F. V. Fomin and S. Gaspers and P. A. Golovach and D. Kratsch and S. Saurabh
Inform. Process. Lett.  110  702--706  (2010)
PDF

2010d

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
N. Cohen and F. V. Fomin and G. Gutin and E. J. Kim and S. Saurabh and A. Yeo
J. Comput. System Sci.  76  650--662  (2010)
PDF

2010c

Pursuing a fast robber on a graph
F. V. Fomin and P. A. Golovach and J. Kratochvil and N. Nisse and K. Suchan
Theoret. Comput. Sci.  411  1167--1181  (2010)
PDF

2010b

Iterative compression and exact algorithms
F. V. Fomin and S. Gaspers and D. Kratsch and M. Liedloff and S. Saurabh
Theoret. Comput. Sci.  411  1045--1053  (2010)
PDF

2010a

Intractability of clique-width parameterizations
F. V. Fomin and P. A. Golovach and D. Lokshtanov and S. Saurabh
SIAM J. Comput.  39  1941--1956  (2010)
PDF

2009

2009e

A measure & conquer approach for the analysis of exact algorithms
F. V. Fomin and F. Grandoni and D. Kratsch
J. ACM  56  Art. 25, 32  (2009)
PDF

2009d

Computing branchwidth via efficient triangulations and blocks
F. V. Fomin and F. Mazoit and I. Todinca
Discrete Appl. Math.  157  2726--2736  (2009)
PDF

2009c

Sort and search: exact algorithms for generalized domination
F. V. Fomin and P. A. Golovach and J. Kratochvil and D. Kratsch and M. Liedloff
Inform. Process. Lett.  109  795--798  (2009)
PDF

2009b

On two techniques of combining branching and treewidth
F. V. Fomin and S. Gaspers and S. Saurabh and A. A. Stepanov
Algorithmica  54  181--207  (2009)
PDF

2009a

Nondeterministic graph searching: from pathwidth to treewidth
F. V. Fomin and P. Fraigniaud and N. Nisse
Algorithmica  53  358--373  (2009)
PDF

2008

2008h

Subexponential parameterized algorithms
F. Dorn and F. V. Fomin and D.M. Thilikos
Computer Science Review  2  29--39  (2008)
PDF

2008g

Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications
F. V. Fomin and F. Grandoni and A. V. Pyatkin and A. A. Stepanov
ACM Trans. Algorithms  5  Art. 9, 17  (2008)
PDF

2008f

Spanning directed trees with many leaves
N. Alon and F. V. Fomin and G. Gutin and M. Krivelevich and S. Saurabh
SIAM J. Discrete Math.  23  466--476  (2008/09)
PDF

2008e

Improved algorithms for feedback vertex set problems
J. Chen and F. V. Fomin and Y. Liu and S. Lu and Y. Villanger
J. Comput. System Sci.  74  1188--1198  (2008)
PDF

2008d

On the minimum feedback vertex set problem: exact and enumeration algorithms
F. V. Fomin and S. Gaspers and A. V. Pyatkin and I. Razgon
Algorithmica  52  293--307  (2008)
PDF

2008c

Solving connected dominating set faster than {2^n}
F. V. Fomin and F. Grandoni and D. Kratsch
Algorithmica  52  153--166  (2008)
PDF

2008b

Exact algorithms for treewidth and minimum fill-in
F. V. Fomin and D. Kratsch and I. Todinca and Y. Villanger
SIAM J. Comput.  38  1058--1079  (2008)
PDF

2008a

An annotated bibliography on guaranteed graph searching
F. V. Fomin and D. M. Thilikos
Theoret. Comput. Sci.  399  236--245  (2008)
PDF

2007

2007d

Exact algorithms for graph homomorphisms
F. V. Fomin and P. Heggernes and D. Kratsch
Theory Comput. Syst.  41  381--393  (2007)
PDF

2007c

Backbone colorings for graphs: tree and path backbones
H. Broersma and F. V. Fomin and P. A. Golovach and G. J. Woeginger
J. Graph Theory  55  137--152  (2007)
PDF

2007b

On self duality of pathwidth in polyhedral graph embeddings
F. V. Fomin and D. M. Thilikos
J. Graph Theory  55  42--54  (2007)
PDF

2007a

Eliminating graphs by means of parallel knock-out schemes
H. Broersma and F. V. Fomin and R. Královic and G. J. Woeginger
Discrete Appl. Math.  155  92--102  (2007)
PDF

2006

2006e

A 3-approximation for the pathwidth of Halin graphs
F. V. Fomin and D. M. Thilikos
J. Discrete Algorithms  4  499--510  (2006)
PDF

2006d

Dominating sets in planar graphs: branch-width and exponential speed-up
F. V. Fomin and D. M. Thilikos
SIAM J. Comput.  36  281--309  (2006)
PDF

2006c

Planar graph coloring avoiding monochromatic subgraphs: trees and paths make it difficult
H. Broersma and F. V. Fomin and J. Kratochvil and G. J. Woeginger
Algorithmica  44  343--361  (2006)
PDF

2006b

Pathwidth of cubic graphs and exact algorithms
F. V. Fomin and K. Høie
Inform. Process. Lett.  97  191--196  (2006)
PDF

2006a

New upper bounds on the decomposability of planar graphs
F. V. Fomin and D. M. Thilikos
J. Graph Theory  51  53--81  (2006)
PDF

2005

2005g

Some new techniques in design and analysis of exact (exponential) algorithms
F. V. Fomin and F. Grandoni and D. Kratsch
Bull. Eur. Assoc. Theor. Comput. Sci. EATCS    47--77  (2005)
PDF

2005f

Equitable colorings of bounded treewidth graphs
H. L. Bodlaender and F. V. Fomin
Theoret. Comput. Sci.  349  22--30  (2005)
PDF

2005e

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
E. D. Demaine and F. V. Fomin and M. Hajiaghayi and D. M. Thilikos
J. ACM  52  866--893  (2005)
PDF

2005d

Bidimensional parameters and local treewidth
E. D. Demaine and F. V. Fomin and M. Hajiaghayi and D. M. Thilikos
SIAM J. Discrete Math.  18  501--511  (2004/05)
PDF

2005c

Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs
E. D. Demaine and F. V. Fomin and M. Hajiaghayi and D. M. Thilikos
ACM Trans. Algorithms  1  33--47  (2005)
PDF

2005b

Tree decompositions with small cost
H. L. Bodlaender and F. V. Fomin
Discrete Appl. Math.  145  143--154  (2005)
PDF

2005a

Graph searching, elimination trees, and a generalization of bandwidth
F. V. Fomin and P. Heggernes and J. A. Telle
Algorithmica  41  73--87  (2005)
PDF

2004

2004f

Radio labeling with preassigned frequencies
H. L. Bodlaender and H. Broersma and F. V. Fomin and A. V. Pyatkin and G. J. Woeginger
SIAM J. Optim.  15  1--16   (2004)
PDF

2004e

On distance constrained labeling of disk graphs
J. Fiala and A. V. Fishkin and F. Fomin
Theoret. Comput. Sci.  326  261--292  (2004)
PDF

2004d

AT-free graphs: linear bounds for the oriented diameter
F. V. Fomin and M. Matamala and E. Prisner and I. Rapaport
Discrete Appl. Math.  141  135--148  (2004)
PDF

2004c

Searching expenditure and interval graphs
F. V. Fomin
Discrete Appl. Math.  135  97--104  (2004)
PDF

2004b

Complexity of approximating the oriented diameter of chordal graphs
F. V. Fomin and M. Matamala and I. Rapaport
J. Graph Theory  45  255--269  (2004)
PDF

2004a

Algorithms for graphs with small octopus
F. V. Fomin and D. Kratsch and H. Müller
Discrete Appl. Math.  134  105--128  (2004)
PDF

2003

2003d

On the monotonicity of games generated by symmetric submodular functions
F. V. Fomin and D. M. Thilikos
Discrete Appl. Math.  131  323--335  (2003)
PDF

2003c

Interval degree and bandwidth of a graph
F. V. Fomin and P. A. Golovach
Discrete Appl. Math.  129  345--359  (2003)
PDF

2003b

On the domination search number
F. V. Fomin and D. Kratsch and H. Müller
Discrete Appl. Math.  127  565--580  (2003)
PDF

2003a

Pathwidth of planar and line graphs
F. V. Fomin
Graphs Combin.  19  91--99  (2003)
PDF

2002

2002d

More about subcolorings
H. Broersma and F. V. Fomin and J. Nesetril and G. J. Woeginger
Computing  69  187--203  (2002)
PDF

2002c

Approximating minimum cocolorings
F. V. Fomin and D. Kratsch and J.-C. Novelli
Inform. Process. Lett.  84  285--290  (2002)
PDF

2002b

Approximation of pathwidth of outerplanar graphs
H. L. Bodlaender and F. V. Fomin
J. Algorithms  43  190--200  (2002)
PDF

2002a

Approximation algorithms for time-dependent orienteering
F. V. Fomin and A. Lingas
Inform. Process. Lett.  83  57--62  (2002)
PDF

2001

2001b

A generalization of the graph bandwidth
F. V. Fomin
Vestnik St. Petersburg Univ. Math.  34  15--19 (2002)  (2001)
PDF

2001a

The search and the node-search number of dual graphs
P. A. Golovach and F. V. Fomin
Vestn. Syktyvkar. Univ. Ser. 1 Mat. Mekh. Inform.    125--136  (2001)
PDF

2000

2000b

Search in graphs
P. A. Golovach and N. N. Petrov and F. V. Fomin
Proc. Steklov Inst. Math.    S90--S103  (2000)
PDF

2000a

Graph searching and interval completion
F. V. Fomin and P. A. Golovach
SIAM J. Discrete Math.  13  454--464   (2000)
PDF

1999

1999c

Discrete search programs on graphs
N. N. Petrov and F. V. Fomin
Vestnik St. Petersburg Univ. Math.  32  27--32 (2000)  (1999)
PDF

1999b

On a complementary interval graph with the lowest max-degree
P. A. Golovach and F. V. Fomin
Vestnik St. Petersburg Univ. Math.  32  7--10 (2000)  (1999)
PDF

1999a

Note on a helicopter search problem on graphs
F. V. Fomin
Discrete Appl. Math.  95  241--249  (1999)
PDF

1998

1998d

Search costs and interval graphs
F. V. Fomin
Diskretn. Anal. Issled. Oper. Ser. 1  5  70--79, 97  (1998)
PDF

1998c

The total vertex separation number and the profile of graphs
P. A. Golovach and F. V. Fomin
Diskret. Mat.  10  87--94  (1998)
PDF

1998b

Helicopter search problems, bandwidth and pathwidth
F. V. Fomin
Discrete Appl. Math.  85  59--70  (1998)
PDF

1998a

Search problems on 1-skeletons of regular polyhedrons
F. V. Fomin and P. A. Golovach and N. N. Petrov
Int. J. Math. Game Theory Algebra  7  101--111  (1998)
PDF

1997

1997a

Almost discrete search programs on graphs
F. V. Fomin
Vestnik St. Petersburg Univ. Math.  30  44--49 (1998)  (1997)
PDF

1993-1995

1995a

Search problem on trees
F. V. Fomin
Vestnik St. Petersburg Univ. Math.  28  36--39 (1996)  (1995)
PDF

1995b

The search for the evader on 3-minimal trees
F. V. Fomin
Vestnik St. Petersburg Univ. Math.  28  56--60 (1996)  (1995)
PDF

1994a

A search problem on a graph under restriction of the velocity
F. V. Fomin
Vestnik St. Petersburg Univ. Math.  27  50--54  (1994)
PDF

1993a

Synthesis of a discrete algorithm for the adaptive control of a linear plant by the Lyapunov function method
F. V. Fomin
Vestnik S.-Peterburg. Univ. Mat. Mekh. Astronom.    40--44, 150 (1994)  (1993)
PDF