Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFedor 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
- 2023
[j184]Fedor V. Fomin, Danil Sagunov, Kirill Simonov
:
Building large k-cores from sparse graphs. J. Comput. Syst. Sci. 132: 68-88 (2023)- [j183]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) - [c209]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis:
Shortest Cycles With Monotone Submodular Costs. SODA 2023: 2214-2227 - [c208]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 - [i123]Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov:
Proportionally Fair Matching with Multiple Groups. CoRR abs/2301.03862 (2023) - [i122]Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf:
Kernelizing Temporal Exploration Problems. CoRR abs/2302.10110 (2023) - [i121]Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar:
Coresets for Clustering in Geometric Intersection Graphs. CoRR abs/2303.01400 (2023) - 2022
- [j182]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) - [j181]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Present-biased optimization. Math. Soc. Sci. 119: 56-67 (2022) - [j180]Fedor V. Fomin, Vijayaragunathan Ramamoorthi:
On the Parameterized Complexity of the Expected Coverage Problem. Theory Comput. Syst. 66(2): 432-453 (2022) - [j179]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) - [j178]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) - [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]Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:
Fixed-Parameter and Approximation Algorithms for PCA with Outliers. ICML 2021: 2341-2351 - [c191]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. LICS 2021: 1-13 - [c190]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS 2021: 14:1-14:14 - [c189]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. SODA 2021: 2649-2659 - [c188]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. STACS 2021: 31:1-31:14 - [c187]Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit:
Parameterized Complexity of Categorical Clustering with Size Constraints. WADS 2021: 385-398 - [c186]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. WG 2021: 308-320 - [i112]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. CoRR abs/2101.04633 (2021) - [i111]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs. CoRR abs/2102.13409 (2021) - [i110]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. CoRR abs/2104.02998 (2021) - [i109]Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit:
Parameterized Complexity of Categorical Clustering with Size Constraints. CoRR abs/2104.07974 (2021) - [i108]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of Feature Selection for Categorical Data Clustering. CoRR abs/2105.03753 (2021) - [i107]Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR abs/2106.03425 (2021) - [i106]Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh:
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. CoRR abs/2107.06715 (2021) - [i105]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. CoRR abs/2107.07383 (2021) - [i104]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
FPT Approximation for Fair Minimum-Load Clustering. CoRR abs/2107.09481 (2021) - [i103]Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Compound Logics for Modification Problems. CoRR abs/2111.02755 (2021) - [i102]Fedor V. Fomin, Tuukka Korhonen:
Fast FPT-Approximation of Branchwidth. CoRR abs/2111.03492 (2021) - [i101]Yuriy Dementiev, Fedor V. Fomin, Artur Ignatiev:
Inconsistent Planning: When in doubt, toss a coin! CoRR abs/2112.03329 (2021) - [i100]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov:
How to Find a Good Explanation for Clustering? CoRR abs/2112.06580 (2021) - 2020
- [j169]Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Subgraph Complementation. Algorithmica 82(7): 1859-1880 (2020) - [j168]Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the Tractability of Optimization Problems on H-Graphs. Algorithmica 82(9): 2432-2473 (2020) - [j167]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. 34(2): 478-532 (2020) - [j166]Fedor V. Fomin, Vladimir V. Podolskii:
CSR 2018 Special Issue on TOCS. Theory Comput. Syst. 64(1): 1-2 (2020) - [j165]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Theory Comput. Syst. 64(2): 251-271 (2020) - [j164]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. SIAM J. Comput. 49(6): 1397-1422 (2020) - [j163]Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
Path Contraction Faster than 2n. SIAM J. Discret. Math. 34(2): 1302-1325 (2020) - [j162]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far from Degeneracy. SIAM J. Discret. Math. 34(3): 1587-1601 (2020) - [j161]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms 16(1): 12:1-12:39 (2020) - [j160]Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms 16(2): 21:1-21:37 (2020) - [j159]Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the parameterized complexity of [1, j]-domination problems. Theor. Comput. Sci. 804: 207-218 (2020) - [c185]Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:
Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI 2020: 1902-1909 - [c184]Fedor V. Fomin, Torstein J. F. Strømme:
Time-Inconsistent Planning: Simple Motivation Is Hard to Find. AAAI 2020: 9843-9850 - [c183]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov:
Low-Rank Binary Matrix Approximation in Column-Sum Norm. APPROX-RANDOM 2020: 32:1-32:18 - [c182]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG 2020: 44:1-44:18 - [c181]Fedor V. Fomin, Vijayaragunathan Ramamoorthi:
On the Parameterized Complexity of the Expected Coverage Problem. CSR 2020: 224-236 - [c180]Fedor V. Fomin, Petr A. Golovach:
Kernelization of Whitney Switches. ESA 2020: 48:1-48:19 - [c179]Fedor V. Fomin, Petr A. Golovach:
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. ESA 2020: 49:1-49:17 - [c178]Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan:
On the Complexity of Recovering Incidence Matrices. ESA 2020: 50:1-50:13 - [c177]Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ESA 2020: 51:1-51:17 - [c176]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ICALP 2020: 49:1-49:18 - [c175]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Parameterization Above a Multiplicative Guarantee. ITCS 2020: 39:1-39:13 - [c174]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. ISAAC 2020: 26:1-26:12 - [c173]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. IPEC 2020: 12:1-12:11 - [c172]Fedor V. Fomin, Danil Sagunov, Kirill Simonov:
Building Large k-Cores from Sparse Graphs. MFCS 2020: 35:1-35:14 - [c171]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. SODA 2020: 2299-2318 - [c170]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Hitting topological minors is FPT. STOC 2020: 1317-1326 - [c169]Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of PCA (Invited Talk). SWAT 2020: 1:1-1:5 - [c168]Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev:
Knot Diagrams of Treewidth Two. WG 2020: 80-91 - [p2]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms. Beyond the Worst-Case Analysis of Algorithms 2020: 27-51 - [e9]Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen:
Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 12160, Springer 2020, ISBN 978-3-030-42070-3 [contents] - [i99]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. CoRR abs/2001.06867 (2020) - [i98]Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:
Manipulating Districts to Win Elections: Fine-Grained Complexity. CoRR abs/2002.07607 (2020) - [i97]Fedor V. Fomin, Danil Sagunov, Kirill Simonov:
Building large k-cores from sparse graphs. CoRR abs/2002.07612 (2020) - [i96]Fedor V. Fomin, Petr A. Golovach:
Subexponential parameterized algorithms and kernelization on almost chordal graphs. CoRR abs/2002.08226 (2020) - [i95]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR abs/2003.00938 (2020) - [i94]Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi:
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR abs/2004.11621 (2020) - [i93]Fedor V. Fomin, Petr A. Golovach:
Kernelization of Whitney Switches. CoRR abs/2006.13684 (2020) - [i92]Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov:
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. CoRR abs/2007.10137 (2020) - [i91]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. CoRR abs/2009.04567 (2020) - [i90]Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov:
EPTAS for k-means Clustering of Affine Subspaces. CoRR abs/2010.09580 (2020) - [i89]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Algorithmic Extensions of Dirac's Theorem. CoRR abs/2011.03619 (2020) - [i88]Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:
Present-Biased Optimization. CoRR abs/2012.14736 (2020)
2010 – 2019
- 2019
- [j158]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. Algorithmica 81(10): 3844-3864 (2019) - [j157]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. 62(4): 879-911 (2019) - [j156]Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact Algorithms via Monotone Local Search. J. ACM 66(2): 8:1-8:23 (2019) - [j155]Fedor V. Fomin, Michal Pilipczuk:
On width measures and topological problems on semi-complete digraphs. J. Comb. Theory, Ser. B 138: 78-165 (2019) - [j154]Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. 33(1): 327-345 (2019) - [j153]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh:
Editing to Connected F-Degree Graph. SIAM J. Discret. Math. 33(2): 795-836 (2019) - [j152]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33(4): 2326-2345 (2019) - [j151]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms 15(1): 9:1-9:27 (2019) - [j150]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms 15(1): 13:1-13:44 (2019) - [j149]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. ACM Trans. Algorithms 15(4): 52:1-52:38 (2019) - [c167]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. ESA 2019: 47:1-47:14 - [c166]Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized k-Clustering: Tractability Island. FSTTCS 2019: 14:1-14:15 - [c165]Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
Path Contraction Faster Than 2n. ICALP 2019: 11:1-11:13 - [c164]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov,