author-photo

Fedor V. Fomin

University of Bergen
University of Paderborn
Saint Petersburg State University

667

Papers

13414

Citations

Citation Trend

Filter By

Papers (667) Sort By

Journal Conference Others

Building large k-cores from sparse graphs

2023 Journal of Computer and System Sciences
Show All
- Source
- Cite
- Save
Citations (0)
On the Parameterized Complexity of the Expected Coverage Problem.

2022 Theory Comput. Syst.
- Fedor V. Fomin
- Vijayaragunathan Ramamoorthi
Show All
- Source
- Cite
- Save
Citations (0)
Parameterized Complexity of Directed Spanner Problems - Algorithmica

2022 Algorithmica
Show All
- Source
- Cite
- Save
Citations (0)
Algorithmic Extensions of Dirac's Theorem.

2022 SODA | Symposium on Discrete Algorithms
Show All
- Source
- Cite
- Save
Citations (0)
Shortest Cycles With Monotone Submodular Costs.

2022 CoRR
Show All
- Source
- Cite
- Save
Citations (0)
EPTAS for k-means Clustering of Affine Subspaces.

2022 SODA | Symposium on Discrete Algorithms
Show All
- Source
- Cite
- Save
Citations (0)
Parameterized Complexity of Elimination Distance to First-Order Logic Properties

2022 ACM Transactions on Computational Logic
Show All
- Source
- Cite
- Save
Citations (0)
Longest Cycle above Erdős-Gallai Bound.

2022 CoRR
Show All
- Source
- Cite
- Save
Citations (0)
Detours in Directed Graphs.

2022 STACS | Symposium on Theoretical Aspects of Computer Science
Show All
- Source
- Cite
- Save
Citations (0)
EPTAS for $k$-means Clustering of Affine Subspaces

2021 SODA | Symposium on Discrete Algorithms
Show All
- Source
- Cite
- Save
Citations (1)