Fedor V. Fomin

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 258

Top Venues

CoRR

SIAM J. Discret. Math.

Algorithmica

ICALP

Publications

Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen
Structural perspective on constraint-based learning of Markov networks. AISTATS (2024)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse collections in matroids and graphs. Math. Program. 204 (1) (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Tree Containment Above Minimum Degree is FPT. SODA (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20 (1) (2024)
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
Stability in Graphs with Matroid Constraints. SWAT (2024)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Parameterized complexity of broadcasting in graphs. Theor. Comput. Sci. 997 (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
Stability in Graphs with Matroid Constraints. CoRR (2024)
Fedor V. Fomin, Tuukka Korhonen
Fast FPT-Approximation of Branchwidth. SIAM J. Comput. 53 (4) (2024)
Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen
Structural perspective on constraint-based learning of Markov networks. CoRR (2024)
Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
Cuts in Graphs with Matroid Constraints. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Hybrid k-Clustering: Blending k-Median and k-Center. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
FPT approximation and subexponential algorithms for covering few or many edges. Inf. Process. Lett. 185 (2024)
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC (2024)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. ICALP (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. Algorithmica 86 (8) (2024)
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
On coresets for fair clustering in metric and Euclidean spaces and their applications. J. Comput. Syst. Sci. 142 (2024)
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
Diverse Pairs of Matchings. Algorithmica 86 (6) (2024)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-Sets Cut-Uncut on Planar Graphs. ICALP (2024)
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Model Checking on Graphs of Bounded Treedepth. CoRR (2024)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Inf. Comput. 293 (2023)
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
Parameterized complexity of categorical clustering with size constraints. J. Comput. Syst. Sci. 136 (2023)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-sets cut-uncut on planar graphs. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
Proportionally Fair Matching with Multiple Groups. WG (2023)
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48 (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA (2023)
Fedor V. Fomin
IPEC Nerode Prize 2023. Bull. EATCS 140 (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Tree Containment Above Minimum Degree is FPT. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. ICALP (2023)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA (2023)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Turán's Theorem Through Algorithmic Lens. WG (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
Coresets for Clustering in Geometric Intersection Graphs. SoCG (2023)
Fedor V. Fomin
IPEC Nerode Prize 2023 - Call for Nominations. Bull. EATCS 139 (2023)
Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198 (1) (2023)
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
-cores from sparse graphs. J. Comput. Syst. Sci. 132 (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
Socially Fair Matching: Exact and Approximation Algorithms. WADS (2023)
Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. GD (2) (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
Proportionally Fair Matching with Multiple Groups. CoRR (2023)
Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf
Kernelizing Temporal Exploration Problems. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
Computing paths of large rank in planar frameworks deterministically. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles With Monotone Submodular Costs. SODA (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. CoRR (2023)
Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf
Kernelizing Temporal Exploration Problems. IPEC (2023)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Parameterized Complexity of Broadcasting in Graphs. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Kernelization for Spreading Points. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to find a good explanation for clustering? Artif. Intell. 322 (2023)
Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
Detours in directed graphs. J. Comput. Syst. Sci. 137 (2023)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
Computing Paths of Large Rank in Planar Frameworks Deterministically. ISAAC (2023)
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Compound Logics for Modification Problems. ICALP (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Turán's Theorem Through Algorithmic Lens. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
Coresets for Clustering in Geometric Intersection Graphs. CoRR (2023)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Parameterized Complexity of Broadcasting in Graphs. WG (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Kernelization for Spreading Points. ESA (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67 (4) (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR (2022)
Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. 51 (6) (2022)
Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer
-Matrix Factorization: From Theory to Practice. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Longest Cycle Above Erdős-Gallai Bound. ESA (2022)
Yuriy Dementiev, Fedor V. Fomin, Artur Ignatiev
Inconsistent Planning: When in Doubt, Toss a Coin! AAAI (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. IPEC (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
(Re)packing Equal Disks into Rectangle. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84 (8) (2022)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory 14 (3-4) (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? AAAI (2022)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Present-biased optimization. Math. Soc. Sci. 119 (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
Exact Exponential Algorithms for Clustering Problems. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Longest Cycle above Erdős-Gallai Bound. CoRR (2022)
Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer
Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice. IJCNN (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
Exact Exponential Algorithms for Clustering Problems. IPEC (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). MFCS (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Algorithmic Extensions of Dirac's Theorem. SODA (2022)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Trans. Comput. Log. 23 (3) (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Siminov
Lossy Kernelization of Same-Size Clustering. CSR (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi
(Re)packing Equal Disks into Rectangle. ICALP (2022)
Fedor V. Fomin, Vijayaragunathan Ramamoorthi
On the Parameterized Complexity of the Expected Coverage Problem. Theory Comput. Syst. 66 (2) (2022)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles With Monotone Submodular Costs. CoRR (2022)
Fedor V. Fomin, Tuukka Korhonen
Fast FPT-approximation of branchwidth. STOC (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. STACS (2022)
Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin, Archontia C. Giannopoulou, Roman Rabinovich
Preface to the special issue on Graph Searching: Theory and Applications. Theor. Comput. Sci. 858 (2021)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse Collections in Matroids and Graphs. STACS (2021)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS (2021)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. WG (2021)
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
Parameterized Complexity of Categorical Clustering with Size Constraints. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. ICALP (2021)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. CoRR (2021)
Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. 12 (2) (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS (2021)
Fedor V. Fomin, Tuukka Korhonen
Fast FPT-Approximation of Branchwidth. CoRR (2021)

Fedor V. Fomin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Fedor V. Fomin