


default search action
Fedor V. Fomin
Person information
- affiliation: University of Bergen
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j206]Fedor V. Fomin, Petr A. Golovach
, Tuukka Korhonen, Giannos Stamoulis
:
Computing Paths of Large Rank in Planar Frameworks Deterministically. SIAM J. Discret. Math. 39(1): 92-118 (2025) - [c236]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh:
Fixed-Parameter Tractability of Hedge Cut. SODA 2025: 1402-1411 - [c235]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov:
Packing Short Cycles. SODA 2025: 1425-1463 - 2024
- [j205]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. Algorithmica 86(6): 2026-2040 (2024) - [j204]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. Algorithmica 86(8): 2676-2713 (2024) - [j203]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. Discret. Comput. Geom. 72(4): 1596-1629 (2024) - [j202]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: 106471 (2024) - [j201]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: 103506 (2024) - [j200]Fedor V. Fomin
, Petr A. Golovach
, Fahad Panolan
, Geevarghese Philip, Saket Saurabh:
Diverse collections in matroids and graphs. Math. Program. 204(1): 415-447 (2024) - [j199]Fedor V. Fomin, Tuukka Korhonen
:
Fast FPT-Approximation of Branchwidth. SIAM J. Comput. 53(4): 1085-1131 (2024) - [j198]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Longest Cycle above Erdős-Gallai Bound. SIAM J. Discret. Math. 38(4): 2721-2749 (2024) - [j197]Fedor V. Fomin
, Petr A. Golovach
, Tuukka Korhonen
, Daniel Lokshtanov
, Giannos Stamoulis
:
Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20(1): 2:1-2:16 (2024) - [j196]Fedor V. Fomin
, Petr A. Golovach
, Tuukka Korhonen
, Kirill Simonov
, Giannos Stamoulis
:
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. ACM Trans. Algorithms 20(4): 36:1-36:48 (2024) - [j195]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
:
Parameterized complexity of broadcasting in graphs. Theor. Comput. Sci. 997: 114508 (2024) - [c234]Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen:
Structural perspective on constraint-based learning of Markov networks. AISTATS 2024: 1855-1863 - [c233]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Hybrid k-Clustering: Blending k-Median and k-Center. APPROX/RANDOM 2024: 4:1-4:19 - [c232]Tatiana Belova, Yuriy Dementiev, Fedor V. Fomin, Petr A. Golovach, Artur Ignatiev:
How to Guide a Present-Biased Agent Through Prescribed Tasks? ECAI 2024: 3461-3468 - [c231]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. ESA 2024: 17:1-17:15 - [c230]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: 22:1-22:18 - [c229]Clément Dallard
, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. ICALP 2024: 51:1-51:18 - [c228]Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh:
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. IPEC 2024: 14:1-14:23 - [c227]Fedor V. Fomin
, Pierre Fraigniaud
, Pedro Montealegre
, Ivan Rapaport
, Ioan Todinca
:
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC 2024: 205-208 - [c226]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Tree Containment Above Minimum Degree is FPT. SODA 2024: 366-376 - [c225]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. SWAT 2024: 22:1-22:16 - [c224]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. DISC 2024: 25:1-25:20 - [i147]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach:
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR abs/2402.15348 (2024) - [i146]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR abs/2403.05943 (2024) - [i145]Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen:
Structural perspective on constraint-based learning of Markov networks. CoRR abs/2403.08562 (2024) - [i144]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. CoRR abs/2404.03979 (2024) - [i143]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. CoRR abs/2405.03321 (2024) - [i142]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana
, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. CoRR abs/2406.19134 (2024) - [i141]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Hybrid k-Clustering: Blending k-Median and k-Center. CoRR abs/2407.08295 (2024) - [i140]Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh:
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. CoRR abs/2408.13543 (2024) - [i139]Tatiana Belova
, Yuriy Dementiev, Fedor V. Fomin, Petr A. Golovach, Artur Ignatiev:
How to guide a present-biased agent through prescribed tasks? CoRR abs/2408.13675 (2024) - [i138]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh:
Fixed-Parameter Tractability of Hedge Cut. CoRR abs/2410.17641 (2024) - [i137]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov:
Packing Short Cycles. CoRR abs/2410.18878 (2024) - [i136]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Parameterized Geometric Graph Modification with Disk Scaling. CoRR abs/2411.13171 (2024) - [i135]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking in Graphs Classes of Bounded Expansion. CoRR abs/2411.14825 (2024) - 2023
- [j194]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: 103948 (2023) - [j193]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: 100556 (2023) - [j192]Fedor V. Fomin:
IPEC Nerode Prize 2023 - Call for Nominations. Bull. EATCS 139 (2023) - [j191]Fedor V. Fomin:
IPEC Nerode Prize 2023. Bull. EATCS 140 (2023) - [j190]Fedor V. Fomin
, Petr A. Golovach
, Dimitrios M. Thilikos:
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Inf. Comput. 293: 105049 (2023) - [j189]Fedor V. Fomin
, Danil Sagunov, Kirill Simonov
:
Building large k-cores from sparse graphs. J. Comput. Syst. Sci. 132: 68-88 (2023) - [j188]Fedor V. Fomin
, Petr A. Golovach
, Nidhi Purohit:
Parameterized complexity of categorical clustering with size constraints. J. Comput. Syst. Sci. 136: 171-194 (2023) - [j187]Fedor V. Fomin
, Petr A. Golovach
, William Lochet
, Danil Sagunov, Saket Saurabh, Kirill Simonov:
Detours in directed graphs. J. Comput. Syst. Sci. 137: 66-86 (2023) - [j186]Fedor V. Fomin
, Fahad Panolan
, M. S. Ramanujan
, Saket Saurabh:
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198(1): 561-593 (2023) - [j185]Sayan Bandyapadhyay, Fedor V. Fomin
, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67(4): 785-824 (2023) - [j184]Sayan Bandyapadhyay
, Fedor V. Fomin
, Petr A. Golovach, Kirill Simonov
:
Parameterized Complexity of Feature Selection for Categorical Data Clustering. ACM Trans. Comput. Theory 15(3-4): 7:1-7:24 (2023) - [c223]Sayan Bandyapadhyay, Fedor V. Fomin
, Tanmay Inamdar:
Coresets for Clustering in Geometric Intersection Graphs. SoCG 2023: 10:1-10:16 - [c222]Parinya Chalermsook, Fedor V. Fomin
, Thekla Hamm, Tuukka Korhonen
, Jesper Nederlof, Ly Orgo
:
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA 2023: 33:1-33:13 - [c221]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. ESA 2023: 48:1-48:16 - [c220]Fedor V. Fomin
, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA 2023: 49:1-49:14 - [c219]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: 189-202 - [c218]Fedor V. Fomin
, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. ICALP 2023: 60:1-60:18 - [c217]Fedor V. Fomin
, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Compound Logics for Modification Problems. ICALP 2023: 61:1-61:21 - [c216]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
, Giannos Stamoulis:
Computing Paths of Large Rank in Planar Frameworks Deterministically. ISAAC 2023: 32:1-32:15 - [c215]Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf:
Kernelizing Temporal Exploration Problems. IPEC 2023: 1:1-1:18 - [c214]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana:
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS 2023: 46:1-46:8 - [c213]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles With Monotone Submodular Costs. SODA 2023: 2214-2227 - [c212]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
, Kirill Simonov, Giannos Stamoulis:
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA 2023: 3700-3712 - [c211]Sayan Bandyapadhyay
, Fedor V. Fomin
, Tanmay Inamdar
, Fahad Panolan
, Kirill Simonov
:
Socially Fair Matching: Exact and Approximation Algorithms. WADS 2023: 79-92 - [c210]Sayan Bandyapadhyay
, Fedor V. Fomin
, Tanmay Inamdar
, Kirill Simonov
:
Proportionally Fair Matching with Multiple Groups. WG 2023: 1-15 - [c209]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Parameterized Complexity of Broadcasting in Graphs. WG 2023: 334-347 - [c208]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Turán's Theorem Through Algorithmic Lens. WG 2023: 348-362 - [i134]Sayan Bandyapadhyay, Fedor V. Fomin
, Tanmay Inamdar, Kirill Simonov:
Proportionally Fair Matching with Multiple Groups. CoRR abs/2301.03862 (2023) - [i133]Emmanuel Arrighi, Fedor V. Fomin
, Petr A. Golovach, Petra Wolf:
Kernelizing Temporal Exploration Problems. CoRR abs/2302.10110 (2023) - [i132]Sayan Bandyapadhyay, Fedor V. Fomin
, Tanmay Inamdar:
Coresets for Clustering in Geometric Intersection Graphs. CoRR abs/2303.01400 (2023) - [i131]Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin
, Petr A. Golovach, Tuukka Korhonen:
Two-sets cut-uncut on planar graphs. CoRR abs/2305.01314 (2023) - [i130]Fedor V. Fomin
, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis:
Computing paths of large rank in planar frameworks deterministically. CoRR abs/2305.01993 (2023) - [i129]Fedor V. Fomin
, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. CoRR abs/2305.02011 (2023) - [i128]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Parameterized Complexity of Broadcasting in Graphs. CoRR abs/2306.01536 (2023) - [i127]Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo:
Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR abs/2307.01341 (2023) - [i126]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Turán's Theorem Through Algorithmic Lens. CoRR abs/2307.07456 (2023) - [i125]Fedor V. Fomin
, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR abs/2308.05974 (2023) - [i124]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. CoRR abs/2308.07099 (2023) - [i123]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana:
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. CoRR abs/2308.15546 (2023) - [i122]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 abs/2308.15635 (2023) - [i121]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Tree Containment Above Minimum Degree is FPT. CoRR abs/2310.09678 (2023) - 2022
- [j183]Fedor V. Fomin
, Petr A. Golovach
, William Lochet
, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84(8): 2292-2308 (2022) - [j182]Fedor V. Fomin
, Pierre Fraigniaud, Petr A. Golovach
:
Present-biased optimization. Math. Soc. Sci. 119: 56-67 (2022) - [j181]Fedor V. Fomin
, Vijayaragunathan Ramamoorthi
:
On the Parameterized Complexity of the Expected Coverage Problem. Theory Comput. Syst. 66(2): 432-453 (2022) - [j180]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): 1866-1930 (2022) - [j179]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): 17:1-17:35 (2022) - [j178]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): 1-29 (2022) - [c207]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov:
How to Find a Good Explanation for Clustering? AAAI 2022: 3904-3912 - [c206]Yuriy Dementiev, Fedor V. Fomin, Artur Ignatiev:
Inconsistent Planning: When in Doubt, Toss a Coin! AAAI 2022: 9724-9731 - [c205]Sayan Bandyapadhyay, Fedor V. Fomin
, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. CSR 2022: 96-114 - [c204]Fedor V. Fomin
, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Longest Cycle Above Erdős-Gallai Bound. ESA 2022: 55:1-55:15 - [c203]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar
, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. ICALP 2022: 60:1-60:17 - [c202]Fedor V. Fomin
, Fahad Panolan
, Anurag Patil, Adil Tanveer:
Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice. IJCNN 2022: 1-8 - [c201]Sayan Bandyapadhyay, Fedor V. Fomin
, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
FPT Approximation for Fair Minimum-Load Clustering. IPEC 2022: 4:1-4:14 - [c200]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar
, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. IPEC 2022: 13:1-13:14 - [c199]Fedor V. Fomin
, Petr A. Golovach
, Danil Sagunov
, Kirill Simonov
:
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). MFCS 2022: 1:1-1:4 - [c198]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Algorithmic Extensions of Dirac's Theorem. SODA 2022: 406-416 - [c197]Fedor V. Fomin
, Petr A. Golovach, William Lochet
, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. STACS 2022: 29:1-29:16 - [c196]Fedor V. Fomin
, Tuukka Korhonen
:
Fast FPT-approximation of branchwidth. STOC 2022: 886-899 - [i120]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. CoRR abs/2201.03318 (2022) - [i119]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Longest Cycle above Erdős-Gallai Bound. CoRR abs/2202.03061 (2022) - [i118]Fedor V. Fomin
, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis:
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR abs/2207.07449 (2022) - [i117]Clément Dallard
, Fedor V. Fomin
, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. CoRR abs/2207.09993 (2022) - [i116]Fedor V. Fomin
, Fahad Panolan
, Anurag Patil, Adil Tanveer:
Boolean and Fp-Matrix Factorization: From Theory to Practice. CoRR abs/2207.11917 (2022) - [i115]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. CoRR abs/2208.06847 (2022) - [i114]Fedor V. Fomin
, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles With Monotone Submodular Costs. CoRR abs/2211.04797 (2022) - [i113]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
(Re)packing Equal Disks into Rectangle. CoRR abs/2211.09603 (2022) - 2021
- [j177]Fedor V. Fomin
, Petr A. Golovach
:
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. Algorithmica 83(7): 2170-2214 (2021) - [j176]Fedor V. Fomin
, Petr A. Golovach, Kirill Simonov:
Parameterized k-Clustering: Tractability island. J. Comput. Syst. Sci. 117: 50-74 (2021) - [j175]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): 126-148 (2021) - [j174]Steven Chaplick
, Fedor V. Fomin
, Petr A. Golovach, Dusan Knop
, Peter Zeman
:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM J. Discret. Math. 35(2): 840-892 (2021) - [j173]Fedor V. Fomin
, Petr A. Golovach:
Kernelization of Whitney Switches. SIAM J. Discret. Math. 35(2): 1298-1336 (2021) - [j172]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: 145-146 (2021) - [j171]Fedor V. Fomin
, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory 13(2): 10:1-10:25 (2021) - [j170]Fedor V. Fomin
, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan
, Saket Saurabh, Meirav Zehavi:
Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13(3): 18:1-18:16 (2021) - [c195]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Present-Biased Optimization. AAAI 2021: 5415-5422 - [c194]Fedor V. Fomin
, Petr A. Golovach, Tanmay Inamdar
, Saket Saurabh:
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS 2021: 21:1-21:16 - [c193]Sayan Bandyapadhyay, Fedor V. Fomin
, Kirill Simonov:
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. ICALP 2021: 23:1-23:15 - [c192]