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
- 2024
[j203]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. Algorithmica 86(6): 2026-2040 (2024)- [j202]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. Algorithmica 86(8): 2676-2713 (2024) - [j201]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) - [j200]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) - [j199]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) - [j198]Fedor V. Fomin, Tuukka Korhonen:
Fast FPT-Approximation of Branchwidth. SIAM J. Comput. 53(4): 1085-1131 (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) - [c233]Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen:
Structural perspective on constraint-based learning of Markov networks. AISTATS 2024: 1855-1863 - [c232]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 - [c231]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 - [c230]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 - [c229]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 - [c228]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 - [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 - [i143]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach:
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR abs/2402.15348 (2024) - [i142]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR abs/2403.05943 (2024) - [i141]Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen:
Structural perspective on constraint-based learning of Markov networks. CoRR abs/2403.08562 (2024) - [i140]Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. CoRR abs/2404.03979 (2024) - [i139]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. CoRR abs/2405.03321 (2024) - [i138]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) - [i137]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) - [i136]Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh:
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. CoRR abs/2408.13543 (2024) - [i135]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) - 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]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 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, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. ICALP 2019: 59:1-59:13 - [c163]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. ICALP 2019: 60:1-60:15 - [c162]Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Refined Complexity of PCA with Outliers. ICML 2019: 5818-5826 - [c161]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Modification to Planarity is Fixed Parameter Tractable. STACS 2019: 28:1-28:17 - [c160]Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. WADS 2019: 296-310 - [i87]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far From Degeneracy. CoRR abs/1902.02526 (2019) - [i86]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. CoRR abs/1902.06957 (2019) - [i85]Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized k-Clustering: The distance matters! CoRR abs/1902.08559 (2019) - [i84]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Decomposition of Map Graphs with Applications. CoRR abs/1903.01291 (2019) - [i83]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR abs/1904.02944 (2019) - [i82]Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev:
Knot Diagrams of Treewidth Two. CoRR abs/1904.03117 (2019) - [i81]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov:
Low-rank binary matrix approximation in column-sum norm. CoRR abs/1904.06141 (2019) - [i80]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov:
Refined Complexity of PCA with Outliers. CoRR abs/1905.04124 (2019) - [i79]Fedor V. Fomin, Torstein J. F. Strømme:
Time-inconsistent Planning: Simple Motivation Is Hard to Find. CoRR abs/1911.07536 (2019) - [i78]Fedor V. Fomin, Dániel Marx, Saket Saurabh, Meirav Zehavi:
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Dagstuhl Reports 9(1): 67-87 (2019) - 2018
- [j148]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. Algorithmica 80(4): 1146-1169 (2018) - [j147]Fedor V. Fomin, Saket Saurabh:
Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Algorithmica 80(9): 2513-2515 (2018) - [j146]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Long directed (s, t)-path: FPT algorithm. Inf. Process. Lett. 140: 8-12 (2018) - [j145]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. J. ACM 65(2): 10:1-10:44 (2018) - [j144]Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discret. Math. 32(2): 966-985 (2018) - [j143]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering Vectors by Spaces: Regular Matroids. SIAM J. Discret. Math. 32(4): 2512-2565 (2018) - [j142]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Structured Connectivity Augmentation. SIAM J. Discret. Math. 32(4): 2612-2635 (2018) - [j141]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. ACM Trans. Algorithms 14(1): 6:1-6:31 (2018) - [j140]Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms 14(2): 25:1-25:20 (2018) - [j139]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk, Marcin Wrochna:
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms 14(3): 34:1-34:45 (2018) - [j138]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
Subexponential Parameterized Algorithm for Interval Completion. ACM Trans. Algorithms 14(3): 35:1-35:62 (2018) - [c159]Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos:
Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. SoCG 2018: 21:1-21:14 - [c158]Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the Tractability of Optimization Problems on H-Graphs. ESA 2018: 30:1-30:14 - [c157]Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA 2018: 31:1-31:13 - [c156]Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the Parameterized Complexity of [1, j]-Domination Problems. FSTTCS 2018: 34:1-34:14 - [c155]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Parameterized Low-Rank Binary Matrix Approximation. ICALP 2018: 53:1-53:16 - [c154]Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Partial Complementation of Graphs. SWAT 2018: 21:1-21:13 - [e8]Fedor V. Fomin, Vladimir V. Podolskii:
Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings. Lecture Notes in Computer Science 10846, Springer 2018, ISBN 978-3-319-90529-7 [contents] - [i77]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan:
Parameterized Low-Rank Binary Matrix Approximation. CoRR abs/1803.06102 (2018) - [i76]Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Partial complementation of graphs. CoRR abs/1804.10920 (2018) - [i75]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. CoRR abs/1805.04375 (2018) - [i74]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. CoRR abs/1807.07156 (2018) - 2017
- [j137]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. Algorithmica 79(3): 798-813 (2017) - [j136]Fedor V. Fomin, Christos H. Papadimitriou, Jean-Eric Pin:
The EATCS Award 2017 - Laudatio for Eva Tardos. Bull. EATCS 121 (2017) - [j135]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. J. ACM 64(3): 18:1-18:22 (2017) - [j134]Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. 88: 195-207 (2017) - [j133]Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. Theory Comput. Syst. 61(3): 795-819 (2017) - [j132]Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Tree-length Graphs. SIAM J. Discret. Math. 31(2): 1217-1243 (2017) - [j131]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Representative Families of Product Families. ACM Trans. Algorithms 13(3): 36:1-36:29 (2017) - [c153]Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. SoCG 2017: 11:1-11:15 - [c152]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-Parameter Tractable. ICALP 2017: 54:1-54:14 - [c151]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering Vectors by Spaces: Regular Matroids. ICALP 2017: 56:1-56:15 - [c150]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP 2017: 65:1-65:15 - [c149]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. IPEC 2017: 13:1-13:13 - [c148]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Structured Connectivity Augmentation. MFCS 2017: 29:1-29:13 - [c147]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. SODA 2017: 1419-1432 - [c146]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. SODA 2017: 1433-1441 - [c145]Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS 2017: 32:1-32:14 - [i73]Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas:
A Fixed-Parameter Perspective on #BIS. CoRR abs/1702.05543 (2017) - [i72]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR abs/1704.07279 (2017) - [i71]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Structured Connectivity Augmentation. CoRR abs/1706.04255 (2017) - [i70]Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the tractability of optimization problems on H-graphs. CoRR abs/1709.09737 (2017) - [i69]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Covering vectors by spaces: Regular matroids. CoRR abs/1710.02300 (2017) - [i68]Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos:
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. CoRR abs/1712.06747 (2017) - [i67]Marek Cygan, Fedor V. Fomin, Danny Hermelin, Magnus Wahlström:
Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). Dagstuhl Reports 7(1): 103-128 (2017) - 2016
- [j130]Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Algorithmica 76(2): 569-594 (2016) - [j129]Fedor V. Fomin:
The EATCS Award 2017 - Call for Nominations. Bull. EATCS 120 (2016) - [j128]Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk:
How to hunt an invisible rabbit on a graph. Eur. J. Comb. 52: 12-26 (2016) - [j127]Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach:
Parameterized complexity of the anchored k-core problem for directed graphs. Inf. Comput. 247: 11-22 (2016) - [j126]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. J. ACM 63(4): 29:1-29:60 (2016) - [j125]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. J. ACM 63(5): 44:1-44:69 (2016) - [j124]Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
A ck n 5-Approximation Algorithm for Treewidth. SIAM J. Comput. 45(2): 317-378 (2016) - [j123]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. 30(1): 383-410 (2016) - [j122]Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen:
The Firefighter problem on graph classes. Theor. Comput. Sci. 613: 38-50 (2016) - [j121]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Forewords: Special issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 655: 1 (2016) - [c144]Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG 2016: 39:1-39:15 - [c143]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. FOCS 2016: 515-524 - [c142]Fedor V. Fomin:
Graph Decompositions and Algorithms (Invited Talk). FSTTCS 2016: 5:1-5:1 - [c141]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
Subexponential parameterized algorithm for Interval Completion. SODA 2016: 1116-1131 - [c140]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. SODA 2016: 1643-1649 - [c139]Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar:
Kernelization and Sparseness: the Case of Dominating Set. STACS 2016: 31:1-31:14 - [c138]Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh:
Editing to Connected f-Degree Graph. STACS 2016: 36:1-36:14 - [c137]Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact algorithms via monotone local search. STOC 2016: 764-775 - [c136]Fedor V. Fomin, Torstein J. F. Strømme:
Vertex Cover Structural Parameterization Revisited. WG 2016: 171-182 - [r5]Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensionality. Encyclopedia of Algorithms 2016: 203-207 - [r4]Fedor V. Fomin, Dimitrios M. Thilikos:
Branchwidth of Graphs. Encyclopedia of Algorithms 2016: 232-237 - [r3]Fedor V. Fomin:
Subexponential Parameterized Algorithms. Encyclopedia of Algorithms 2016: 2124-2126 - [i66]Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Tree-length Graphs. CoRR abs/1602.02610 (2016) - [i65]Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
Tight Lower Bounds on Graph Embedding Problems. CoRR abs/1602.05016 (2016) - [i64]Fedor V. Fomin, Torstein J. F. Strømme:
Vertex Cover Structural Parameterization Revisited. CoRR abs/1603.00770 (2016) - [i63]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. CoRR abs/1604.05999 (2016) - [i62]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. CoRR abs/1606.05689 (2016) - [i61]Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Fine-grained complexity of integer programming: The case of bounded branch-width and rank. CoRR abs/1607.05342 (2016) - [i60]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. CoRR abs/1607.05516 (2016) - [i59]Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin:
Finding Detours is Fixed-parameter Tractable. CoRR abs/1607.07737 (2016) - 2015
- [b2]Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Parameterized Algorithms. Springer 2015, ISBN 978-3-319-21274-6, pp. 3-555 - [j120]Fedor V. Fomin, Geevarghese Philip, Yngve Villanger:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Algorithmica 71(1): 1-20 (2015) - [j119]Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-Depth Faster Than 2n. Algorithmica 73(1): 202-216 (2015) - [j118]Fedor V. Fomin, Kim Larsen, Vladimiro Sassone:
EATCS Award 2015. Bull. EATCS 115 (2015) - [j117]Fedor V. Fomin, Marta Z. Kwiatkowska, David Peleg:
40th international colloquium on automata, languages and programming. Inf. Comput. 243: 1 (2015) - [j116]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. Theory Comput. Syst. 57(1): 81-96 (2015) - [j115]Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Large Induced Subgraphs via Triangulations and CMSO. SIAM J. Comput. 44(1): 54-87 (2015) - [j114]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Proper Interval Completion. SIAM J. Discret. Math. 29(4): 1961-1987 (2015) - [j113]Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh:
On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theor. Comput. Sci. 565: 1-15 (2015) - [j112]Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Exploring the Subexponential Complexity of Completion Problems. ACM Trans. Comput. Theory 7(4): 14:1-14:38 (2015) - [c135]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CPM 2015: 89-99 - [c134]Fedor V. Fomin, Saket Saurabh, Neeldhara Misra:
Graph Modification Problems: A Modern Perspective. FAW 2015: 3-6 - [c133]Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. FSTTCS 2015: 408-419 - [c132]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Lower Bounds for the Graph Homomorphism Problem. ICALP (1) 2015: 481-493 - [c131]Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) 2015: 494-505 - [c130]Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Width Graphs. MFCS (2) 2015: 115-126 - [c129]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh:
Solving d-SAT via Backdoors to Small Treewidth. SODA 2015: 630-641 - [i58]Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk:
How to Hunt an Invisible Rabbit on a Graph. CTW 2015: 169-172 - [i57]Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh:
Parameterized Complexity of Superstring Problems. CoRR abs/1502.01461 (2015) - [i56]Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. CoRR abs/1502.03989 (2015) - [i55]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Lower Bounds for the Graph Homomorphism Problem. CoRR abs/1502.05447 (2015) - [i54]Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk:
How to Hunt an Invisible Rabbit on a Graph. CoRR abs/1502.05614 (2015) - [i53]Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Tight Bounds for Subgraph Isomorphism and Graph Homomorphism. CoRR abs/1507.03738 (2015) - [i52]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. CoRR abs/1511.01379 (2015) - [i51]Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh:
Exact Algorithms via Monotone Local Search. CoRR abs/1512.01621 (2015) - 2014
- [j111]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica 69(1): 216-231 (2014) - [j110]Fedor V. Fomin, Petr A. Golovach:
Parameterized complexity of connected even/odd subgraph problems. J. Comput. Syst. Sci. 80(1): 157-179 (2014) - [j109]Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk:
Preprocessing subgraph and minor problems: When does a small vertex cover help? J. Comput. Syst. Sci. 80(2): 468-495 (2014) - [j108]Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen:
Parameterized complexity of firefighting. J. Comput. Syst. Sci. 80(7): 1285-1297 (2014) - [j107]Fedor V. Fomin, Yngve Villanger:
Searching for better fill-in. J. Comput. Syst. Sci. 80(7): 1374-1383 (2014) - [j106]Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger:
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. J. Comput. Syst. Sci. 80(7): 1430-1447 (2014) - [j105]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width. SIAM J. Comput. 43(5): 1541-1563 (2014) - [j104]Fedor V. Fomin, Petr A. Golovach:
Long Circuits and Large Euler Subgraphs. SIAM J. Discret. Math. 28(2): 878-892 (2014) - [j103]Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse:
To satisfy impatient Web surfers is hard. Theor. Comput. Sci. 526: 1-17 (2014) - [c128]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Proper Interval Completion. ESA 2014: 173-184 - [c127]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Representative Sets of Product Families. ESA 2014: 443-454 - [c126]Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh:
Connecting Vertices by Independent Trees. FSTTCS 2014: 73-84 - [c125]Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms to Preserve Connectivity. ICALP (1) 2014: 800-811 - [c124]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. SODA 2014: 142-151 - [c123]Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Large induced subgraphs via triangulations and CMSO. SODA 2014: 582-583 - [c122]Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Exploring Subexponential Parameterized Complexity of Completion Problems. STACS 2014: 288-299 - [c121]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca:
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques. SWAT 2014: 182-193 - [p1]Fedor V. Fomin, Saket Saurabh:
Kernelization Methods for Fixed-Parameter Tractability. Tractability 2014: 260-282 - [i50]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A subexponential parameterized algorithm for Proper Interval Completion. CoRR abs/1402.3472 (2014) - [i49]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A subexponential parameterized algorithm for Interval Completion. CoRR abs/1402.3473 (2014) - [i48]Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Representative Sets of Product Families. CoRR abs/1402.3909 (2014) - [i47]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca:
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. CoRR abs/1404.3882 (2014) - [i46]Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization and Sparseness: the case of Dominating Set. CoRR abs/1411.4575 (2014) - 2013
- [j102]Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65(1): 129-145 (2013) - [j101]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh:
Computing Optimal Steiner Trees in Polynomial Space. Algorithmica 65(3): 584-604 (2013) - [j100]Fedor V. Fomin, Petteri Kaski:
Exact exponential algorithms. Commun. ACM 56(3): 80-88 (2013) - [j99]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three complexity results on coloring Pk-free graphs. Eur. J. Comb. 34(3): 609-619 (2013) - [j98]Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. 233: 60-70 (2013) - [j97]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé:
A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. 79(1): 1-6 (2013) - [j96]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. J. Graph Theory 74(4): 417-424 (2013) - [j95]Fedor V. Fomin, Yngve Villanger:
Subexponential Parameterized Algorithm for Minimum Fill-In. SIAM J. Comput. 42(6): 2197-2216 (2013) - [j94]Fedor V. Fomin, Saket Saurabh, Yngve Villanger:
A Polynomial Kernel for Proper Interval Vertex Deletion. SIAM J. Discret. Math. 27(4): 1964-1976 (2013) - [j93]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh:
Distortion is Fixed Parameter Tractable. ACM Trans. Comput. Theory 5(4): 16:1-16:20 (2013) - [c120]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Preventing Unraveling in Social Networks Gets Harder. AAAI 2013: 1085-1091 - [c119]Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA 2013: 193-204 - [c118]Fedor V. Fomin, Petr A. Golovach:
Long Circuits and Large Euler Subgraphs. ESA 2013: 493-504 - [c117]Fedor V. Fomin, Michal Pilipczuk:
Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph. ESA 2013: 505-516 - [c116]Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
An O(c^k n) 5-Approximation Algorithm for Treewidth. FOCS 2013: 499-508 - [c115]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. FSTTCS 2013: 79-90 - [c114]Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-Depth Faster Than 2 n. IPEC 2013: 137-149 - [c113]Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Exact Algorithms for Some Terminal Set Problems. IPEC 2013: 150-162 - [c112]Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen:
On the Parameterized Complexity of Cutting a Few Vertices from a Graph. MFCS 2013: 421-432 - [c111]Fedor V. Fomin, Michal Pilipczuk:
Jungles, bundles, and fixed parameter tractability. SODA 2013: 396-413 - [c110]Fedor V. Fomin, Yngve Villanger:
Searching for better fill-in. STACS 2013: 8-19 - [c109]Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger:
Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43 - [c108]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS 2013: 92-103 - [e7]Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg:
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Lecture Notes in Computer Science 7965, Springer 2013, ISBN 978-3-642-39205-4 [contents] - [e6]Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg:
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Lecture Notes in Computer Science 7966, Springer 2013, ISBN 978-3-642-39211-5 [contents] - [i45]Fedor V. Fomin, Michal Pilipczuk:
Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. CoRR abs/1301.7314 (2013) - [i44]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. CoRR abs/1304.4626 (2013) - [i43]Fedor V. Fomin, Petr A. Golovach:
Long Circuits and Large Euler Subgraphs. CoRR abs/1304.5746 (2013) - [i42]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. CoRR abs/1304.5870 (2013) - [i41]Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen:
On the parameterized complexity of cutting a few vertices from a graph. CoRR abs/1304.6189 (2013) - [i40]Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
A O(c^k n) 5-Approximation Algorithm for Treewidth. CoRR abs/1304.6321 (2013) - [i39]Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Preventing Unraveling in Social Networks Gets Harder. CoRR abs/1304.6420 (2013) - [i38]Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-depth Faster Than 2n. CoRR abs/1306.3857 (2013) - [i37]Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Large induced subgraphs via triangulations and CMSO. CoRR abs/1309.1559 (2013) - [i36]Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Exploring Subexponential Parameterized Complexity of Completion Problems. CoRR abs/1309.4022 (2013) - [i35]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. CoRR abs/1309.6797 (2013) - [i34]Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Largest chordal and interval subgraphs faster than 2^n. CoRR abs/1311.4055 (2013) - [i33]Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). Dagstuhl Reports 3(3): 51-74 (2013) - 2012
- [j92]Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh:
Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica 63(3): 692-706 (2012) - [j91]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. Algorithmica 64(1): 69-84 (2012) - [j90]Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen:
Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012) - [j89]Fedor V. Fomin, Yngve Villanger:
Treewidth computation and extremal combinatorics. Comb. 32(3): 289-308 (2012) - [j88]Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos:
Connected graph searching. Inf. Comput. 219: 1-16 (2012) - [j87]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao:
Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3): 698-706 (2012) - [j86]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger:
Local search: Is brute-force avoidable? J. Comput. Syst. Sci. 78(3): 707-719 (2012) - [j85]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs. J. Comput. Syst. Sci. 78(5): 1606-1622 (2012) - [j84]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. 50(3): 420-432 (2012) - [j83]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Cops and Robber Game Without Recharging. Theory Comput. Syst. 50(4): 611-620 (2012) - [j82]Fedor V. Fomin, Petr A. Golovach, Pawel Pralat:
Cops and Robber with Constraints. SIAM J. Discret. Math. 26(2): 571-590 (2012) - [j81]Omid Amini, Fedor V. Fomin, Saket Saurabh:
Counting Subgraphs via Homomorphisms. SIAM J. Discret. Math. 26(2): 695-717 (2012) - [j80]Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms 8(4): 38:1-38:19 (2012) - [j79]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
On exact algorithms for treewidth. ACM Trans. Algorithms 9(1): 12:1-12:23 (2012) - [j78]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 463: 1 (2012) - [c107]Fedor V. Fomin, Dániel Marx:
FPT Suspects and Tough Customers: Open Problems of Downey and Fellows. The Multivariate Algorithmic Revolution and Beyond 2012: 457-468 - [c106]Fedor V. Fomin, Saket Saurabh, Yngve Villanger:
A Polynomial Kernel for Proper Interval Vertex Deletion. ESA 2012: 467-478 - [c105]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. FOCS 2012: 470-479 - [c104]Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse:
To Satisfy Impatient Web Surfers Is Hard. FUN 2012: 166-176 - [c103]Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen:
Making Life Easier for Firefighters. FUN 2012: 177-188 - [c102]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. ICALP (2) 2012: 525-536 - [c101]Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk:
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? IPEC 2012: 97-108 - [c100]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. LATIN 2012: 350-361 - [c99]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on H-minor-free graphs. SODA 2012: 82-93 - [c98]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Bidimensionality and geometric graphs. SODA 2012: 1563-1575 - [c97]Fedor V. Fomin, Yngve Villanger:
Subexponential parameterized algorithm for minimum fill-in. SODA 2012: 1737-1746 - [c96]Fedor V. Fomin, Petr A. Golovach:
Parameterized Complexity of Connected Even/Odd Subgraph Problems. STACS 2012: 432-440 - [e5]Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx:
The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 7370, Springer 2012, ISBN 978-3-642-30890-1 [contents] - [e4]Fedor V. Fomin, Petteri Kaski:
Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Lecture Notes in Computer Science 7357, Springer 2012, ISBN 978-3-642-31154-3 [contents] - [i32]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Planar F-Deletion: Approximation and Optimal FPT Algorithms. CoRR abs/1204.4230 (2012) - [i31]Fedor V. Fomin, Saket Saurabh, Yngve Villanger:
A Polynomial kernel for Proper Interval Vertex Deletion. CoRR abs/1204.4880 (2012) - [i30]Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk:
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? CoRR abs/1206.4912 (2012) - [i29]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. CoRR abs/1210.0257 (2012) - 2011
- [j77]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica 61(2): 252-273 (2011) - [j76]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer:
How to Guard a Graph? Algorithmica 61(4): 839-856 (2011) - [j75]Michael R. Fellows, Fedor V. Fomin, Gregory Z. Gutin:
Special Issue on Parameterized Complexity of Discrete Optimization. Discret. Optim. 8(1): 1 (2011) - [j74]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen:
On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2): 143-153 (2011) - [j73]Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen:
Spanners of bounded degree graphs. Inf. Process. Lett. 111(3): 142-144 (2011) - [j72]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Subexponential algorithms for partial cover problems. Inf. Process. Lett. 111(16): 814-818 (2011) - [j71]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77(6): 1071-1078 (2011) - [j70]Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6): 1108-1119 (2011) - [j69]Omid Amini, Fedor V. Fomin, Saket Saurabh:
Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. 77(6): 1159-1171 (2011) - [j68]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction obstructions for treewidth. J. Comb. Theory B 101(5): 302-314 (2011) - [j67]Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos:
Strengthening Erdös-Pósa property for minor-closed graph classes. J. Graph Theory 66(3): 235-240 (2011) - [j66]Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle:
On the complexity of reconstructing H-free graphs from their Star Systems. J. Graph Theory 68(2): 113-124 (2011) - [j65]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximating Width Parameters of Hypergraphs with Excluded Minors. SIAM J. Discret. Math. 25(3): 1331-1348 (2011) - [j64]Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. 412(8-10): 846-852 (2011) - [j63]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. 412(24): 2699 (2011) - [j62]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
An exact algorithm for minimum distortion embedding. Theor. Comput. Sci. 412(29): 3530-3536 (2011) - [j61]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. 412(46): 6484-6497 (2011) - [j60]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50): 7018-7028 (2011) - [c95]Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Exact Algorithm for the Maximum Induced Planar Subgraph Problem. ESA 2011: 287-298 - [c94]Fedor V. Fomin, Geevarghese Philip, Yngve Villanger:
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS 2011: 164-175 - [c93]Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen:
Parameterized Complexity of Firefighting Revisited. IPEC 2011: 13-26 - [c92]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Bidimensionality and EPTAS. SODA 2011: 748-759 - [c91]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting forbidden minors: Approximation and Kernelization. STACS 2011: 189-200 - [c90]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger:
Enumerating Minimal Subset Feedback Vertex Sets. WADS 2011: 399-410 - [i28]Fedor V. Fomin, Yngve Villanger:
Subexponential Parameterized Algorithm for Minimum Fill-in. CoRR abs/1104.2230 (2011) - [i27]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
Bidimensionality and Geometric Graphs. CoRR abs/1107.2221 (2011) - [i26]Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen:
Parameterized Complexity of Firefighting Revisited. CoRR abs/1109.4729 (2011) - [i25]Fedor V. Fomin, Michal Pilipczuk:
Jungles, bundles, and fixed parameter tractability. CoRR abs/1112.1538 (2011) - [i24]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. CoRR abs/1112.3244 (2011) - [i23]Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger:
Subexponential fixed-parameter tractability of cluster editing. CoRR abs/1112.4419 (2011) - [i22]Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos:
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports 1(2): 30-46 (2011) - 2010
- [b1]Fedor V. Fomin, Dieter Kratsch:
Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series, Springer 2010, ISBN 978-3-642-16532-0, pp. 1-203 - [j59]Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica 58(3): 790-810 (2010) - [j58]Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos:
Rank-width and tree-width of H-minor-free graphs. Eur. J. Comb. 31(7): 1617-1628 (2010) - [j57]Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh:
Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110(16): 702-706 (2010) - [j56]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. 76(7): 650-662 (2010) - [j55]Fedor V. Fomin, Pinar Heggernes, Rodica Mihai:
Mixed search number and linear-width of interval and split graphs. Networks 56(3): 207-214 (2010) - [j54]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Intractability of Clique-Width Parameterizations. SIAM J. Comput. 39(5): 1941-1956 (2010) - [j53]Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh:
Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7-9): 1045-1053 (2010) - [j52]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan:
Pursuing a fast robber on a graph. Theor. Comput. Sci. 411(7-9): 1167-1181 (2010) - [c89]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI 2010: 65-70 - [c88]Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh:
The Curse of Connectivity: t-Total Vertex (Edge) Cover. COCOON 2010: 34-43 - [c87]Fedor V. Fomin:
Kernelization. CSR 2010: 107-108 - [c86]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109 - [c85]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh:
Ranking and Drawing in Subexponential Time. IWOCA 2010: 337-348 - [c84]Fedor V. Fomin:
Protrusions in Graphs and Their Applications. IPEC 2010: 3 - [c83]Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh:
Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN 2010: 72-83 - [c82]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA 2010: 493-502 - [c81]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Bidimensionality and Kernels. SODA 2010: 503-510 - [c80]Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS 2010: 251-262 - [c79]Fedor V. Fomin, Yngve Villanger:
Finding Induced Subgraphs via Minimal Triangulations. STACS 2010: 383-394 - [c78]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Cops and Robber Game without Recharging. SWAT 2010: 273-284 - [c77]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333 - [c76]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximation Algorithms for Domination Search. WAOA 2010: 130-141 - [i21]Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. CoRR abs/1001.0821 (2010) - [i20]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Bidimensionality and EPTAS. CoRR abs/1005.5449 (2010) - [i19]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting forbidden minors: Approximation and Kernelization. CoRR abs/1010.1365 (2010)
2000 – 2009
- 2009
- [j51]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53(3): 358-373 (2009) - [j50]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov:
On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2): 181-207 (2009) - [j49]Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca:
Computing branchwidth via efficient triangulations and blocks. Discret. Appl. Math. 157(12): 2726-2736 (2009) - [j48]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14): 795-798 (2009) - [j47]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5): 25:1-25:32 (2009) - [j46]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Spanning Directed Trees with Many Leaves. SIAM J. Discret. Math. 23(1): 466-476 (2009) - [c75]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. COCOON 2009: 37-46 - [c74]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction Bidimensionality: The Accurate Picture. ESA 2009: 706-717 - [c73]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. FOCS 2009: 629-638 - [c72]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for Feedback Arc Set In Tournaments. FSTTCS 2009: 37-47 - [c71]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Subexponential Algorithms for Partial Cover Problems. FSTTCS 2009: 193-201 - [c70]Omid Amini, Fedor V. Fomin, Saket Saurabh:
Counting Subgraphs via Homomorphisms. ICALP (1) 2009: 71-82 - [c69]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh:
Distortion Is Fixed Parameter Tractable. ICALP (1) 2009: 463-474 - [c68]Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491 - [c67]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé:
A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC 2009: 275-282 - [c66]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104 - [c65]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Clique-width: on the price of generality. SODA 2009: 825-834 - [c64]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger:
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS 2009: 421-432 - [c63]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS 2009: 445-456 - [c62]Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Guard Games on Graphs: Keep the Intruder Out! WAOA 2009: 147-158 - [c61]Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53 - [c60]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
An Exact Algorithm for Minimum Distortion Embedding. WG 2009: 112-121 - [e3]Jianer Chen, Fedor V. Fomin:
Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5917, Springer 2009, ISBN 978-3-642-11268-3 [contents] - [i18]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction Bidimensionality: the Accurate Picture. Parameterized complexity and approximation algorithms 2009 - [i17]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem. CoRR abs/0903.0938 (2009) - [i16]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. CoRR abs/0904.0727 (2009) - [i15]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for Feedback Arc Set In Tournaments. CoRR abs/0907.2165 (2009) - [i14]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé:
A Linear Vertex Kernel for Maximum Internal Spanning Tree. CoRR abs/0907.3208 (2009) - [i13]Fedor V. Fomin, Yngve Villanger:
Finding Induced Subgraphs via Minimal Triangulations. CoRR abs/0909.5278 (2009) - [i12]Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh:
Faster Algorithms for Finding and Counting Subgraphs. CoRR abs/0912.2371 (2009) - 2008
- [j45]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Solving Connected Dominating Set Faster than 2 n . Algorithmica 52(2): 153-166 (2008) - [j44]Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon:
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica 52(2): 293-307 (2008) - [j43]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Subexponential parameterized algorithms. Comput. Sci. Rev. 2(1): 29-39 (2008) - [j42]Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger:
Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7): 1188-1198 (2008) - [j41]Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger:
Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008) - [j40]Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov:
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algorithms 5(1): 9:1-9:17 (2008) - [j39]Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos:
Forewords: Special issue on graph searching. Theor. Comput. Sci. 399(3): 157 (2008) - [j38]Fedor V. Fomin, Dimitrios M. Thilikos:
An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3): 236-245 (2008) - [c59]Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos:
Improving the gap of Erdös-Pósa property for minor-closed graph classes. CTW 2008: 2-6 - [c58]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Faster Steiner Tree Computation in Polynomial-Space. ESA 2008: 430-441 - [c57]Omid Amini, Fedor V. Fomin, Saket Saurabh:
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS 2008: 1-12 - [c56]Fedor V. Fomin, Yngve Villanger:
Treewidth Computation and Extremal Combinatorics. ICALP (1) 2008: 210-221 - [c55]Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
Spanners in Sparse Graphs. ICALP (1) 2008: 597-608 - [c54]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl:
On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185 - [c53]Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer:
How to Guard a Graph?. ISAAC 2008: 318-329 - [c52]Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle:
On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN 2008: 194-205 - [c51]Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS 2008: 290-298 - [c50]Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh:
Iterative Compression and Exact Algorithms. MFCS 2008: 335-346 - [c49]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs. SODA 2008: 631-640 - [e2]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch:
Moderately Exponential Time Algorithms, 19.10. - 24.10.2008. Dagstuhl Seminar Proceedings 08431, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [r2]Fedor V. Fomin, Dimitrios M. Thilikos:
Branchwidth of Graphs. Encyclopedia of Algorithms 2008 - [r1]Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni:
Exact Algorithms for Dominating Set. Encyclopedia of Algorithms 2008 - [i11]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch:
08431 Abstracts Collection - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i10]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch:
08431 Executive Summary - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i9]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams:
08431 Open Problems - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i8]Omid Amini, Fedor V. Fomin, Saket Saurabh:
Parameterized Algorithms for Partial Cover Problems. CoRR abs/0802.1722 (2008) - [i7]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Spanning directed trees with many leaves. CoRR abs/0803.0701 (2008) - [i6]Fedor V. Fomin, Yngve Villanger:
Treewidth computation and extremal combinatorics. CoRR abs/0803.1321 (2008) - [i5]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh:
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees. CoRR abs/0804.3028 (2008) - [i4]Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximating acyclicity parameters of sparse hypergraphs. CoRR abs/0809.3646 (2008) - [i3]Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger:
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves. CoRR abs/0810.4796 (2008) - 2007
- [j37]Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger:
Eliminating graphs by means of parallel knock-out schemes. Discret. Appl. Math. 155(2): 92-102 (2007) - [j36]Fedor V. Fomin, Dimitrios M. Thilikos:
On self duality of pathwidth in polyhedral graph embeddings. J. Graph Theory 55(1): 42-54 (2007) - [j35]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone colorings for graphs: Tree and path backbones. J. Graph Theory 55(2): 137-152 (2007) - [j34]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. 41(2): 381-393 (2007) - [c48]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen:
On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377 - [c47]Fedor V. Fomin, Serge Gaspers, Saket Saurabh:
Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: 65-74 - [c46]Fedor V. Fomin, Alexey A. Stepanov:
Counting Minimum Weighted Dominating Sets. COCOON 2007: 165-175 - [c45]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327 - [c44]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Subexponential Parameterized Algorithms. ICALP 2007: 15-27 - [c43]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362 - [c42]Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger:
Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433 - [c41]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518 - [c40]Fedor V. Fomin, Pinar Heggernes, Rodica Mihai:
Mixed Search Number and Linear-Width of Interval and Split Graphs. WG 2007: 304-315 - [i2]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems. CoRR abs/0707.1095 (2007) - [i1]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems. CoRR abs/cs/0702049 (2007) - 2006
- [j33]Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger:
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica 44(4): 343-361 (2006) - [j32]Fedor V. Fomin, Kjartan Høie:
Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97(5): 191-196 (2006) - [j31]Fedor V. Fomin, Dimitrios M. Thilikos:
A 3-approximation for the pathwidth of Halin graphs. J. Discrete Algorithms 4(4): 499-510 (2006) - [j30]Fedor V. Fomin, Dimitrios M. Thilikos:
New upper bounds on the decomposability of planar graphs. J. Graph Theory 51(1): 53-81 (2006) - [j29]Fedor V. Fomin, Dimitrios M. Thilikos:
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. SIAM J. Comput. 36(2): 281-309 (2006) - [c39]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
On Exact Algorithms for Treewidth. ESA 2006: 672-683 - [c38]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Solving Connected Dominating Set Faster Than 2n. FSTTCS 2006: 152-163 - [c37]Fedor V. Fomin, Serge Gaspers, Saket Saurabh:
Branching and Treewidth Based Exact Algorithms. ISAAC 2006: 16-25 - [c36]Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin:
Finding a Minimum Feedback Vertex Set in Time O (1.7548n). IWPEC 2006: 184-191 - [c35]Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov:
Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279 - [c34]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Measure and conquer: a simple O(20.288n) independent set algorithm. SODA 2006: 18-25 - [c33]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT 2006: 172-183 - [e1]Fedor V. Fomin:
Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers. Lecture Notes in Computer Science 4271, Springer 2006, ISBN 3-540-48381-0 [contents] - 2005
- [j28]Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica 41(2): 73-87 (2005) - [j27]Hans L. Bodlaender, Fedor V. Fomin:
Tree decompositions with small cost. Discret. Appl. Math. 145(2): 143-154 (2005) - [j26]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bull. EATCS 87: 47-77 (2005) - [j25]Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov:
On maximum number of minimal dominating sets in graphs. Electron. Notes Discret. Math. 22: 157-162 (2005) - [j24]Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca:
Connected Graph Searching in Outerplanar Graphs. Electron. Notes Discret. Math. 22: 213-216 (2005) - [j23]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6): 866-893 (2005) - [j22]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1): 33-47 (2005) - [j21]Hans L. Bodlaender, Fedor V. Fomin:
Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349(1): 22-30 (2005) - [c32]Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA 2005: 95-106 - [c31]Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms. FCT 2005: 161-171 - [c30]Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch:
Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203 - [c29]Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov:
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. ISAAC 2005: 573-582 - [c28]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS 2005: 364-375 - [c27]Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca:
Computing Branchwidth Via Efficient Triangulations and Blocks. WG 2005: 374-384 - 2004
- [j20]Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
Algorithms for graphs with small octopus. Discret. Appl. Math. 134(1-3): 105-128 (2004) - [j19]Fedor V. Fomin:
Searching expenditure and interval graphs. Discret. Appl. Math. 135(1-3): 97-104 (2004) - [j18]Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport:
AT-free graphs: linear bounds for the oriented diameter. Discret. Appl. Math. 141(1-3): 135-148 (2004) - [j17]Fedor V. Fomin, Dimitrios M. Thilikos:
A 3-approximation for the pathwidth of Halin graphs. Electron. Notes Discret. Math. 17: 157-162 (2004) - [j16]Fedor V. Fomin, Martín Matamala, Ivan Rapaport:
Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory 45(4): 255-269 (2004) - [j15]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth. SIAM J. Discret. Math. 18(3): 501-511 (2004) - [j14]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Preassigned Frequencies. SIAM J. Optim. 15(1): 1-16 (2004) - [j13]Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin:
On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1-3): 261-292 (2004) - [c26]Fedor V. Fomin, Dimitrios M. Thilikos:
A 3-Approximation for the Pathwidth of Halin Graphs. CTW 2004: 137-141 - [c25]Fedor V. Fomin, Dieter Kratsch, Ioan Todinca:
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP 2004: 568-580 - [c24]Fedor V. Fomin, Dimitrios M. Thilikos:
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ICALP 2004: 581-592 - [c23]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118 - [c22]Hans L. Bodlaender, Fedor V. Fomin:
Equitable Colorings of Bounded Treewidth Graphs. MFCS 2004: 180-190 - [c21]Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger:
Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214 - [c20]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. SODA 2004: 830-839 - [c19]Fedor V. Fomin, Dimitrios M. Thilikos:
A Simple and Fast Approach for Solving Problems on Planar Graphs. STACS 2004: 56-67 - [c18]Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger:
Exact (Exponential) Algorithms for the Dominating Set Problem. WG 2004: 245-256 - 2003
- [j12]Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
On the Domination Search Number. Discret. Appl. Math. 127(3): 565-580 (2003) - [j11]Fedor V. Fomin, Petr A. Golovach:
Interval degree and bandwidth of a graph. Discret. Appl. Math. 129(2-3): 345-359 (2003) - [j10]Fedor V. Fomin, Dimitrios M. Thilikos:
On the monotonicity of games generated by symmetric submodular functions. Discret. Appl. Math. 131(2): 323-335 (2003) - [j9]Fedor V. Fomin:
Pathwidth of Planar and Line Graphs. Graphs Comb. 19(1): 91-99 (2003) - [c17]Fedor V. Fomin, Dimitrios M. Thilikos:
Dominating Sets and Local Treewidth. ESA 2003: 221-229 - [c16]Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT 2003: 73-85 - [c15]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. ICALP 2003: 829-844 - [c14]Fedor V. Fomin, Dimitrios M. Thilikos:
Dominating sets in planar graphs: branch-width and exponential speed-up. SODA 2003: 168-177 - [c13]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone Colorings for Networks. WG 2003: 131-142 - 2002
- [j8]Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
More About Subcolorings. Computing 69(3): 187-203 (2002) - [j7]Fedor V. Fomin, Andrzej Lingas:
Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83(2): 57-62 (2002) - [j6]Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli:
Approximating minimum cocolorings. Inf. Process. Lett. 84(5): 285-290 (2002) - [j5]Hans L. Bodlaender, Fedor V. Fomin:
Approximation of pathwidth of outerplanar graphs. J. Algorithms 43(2): 190-200 (2002) - [c12]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222 - [c11]Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger:
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT 2002: 160-169 - [c10]Hans L. Bodlaender, Fedor V. Fomin:
Tree Decompositions with Small Cost. SWAT 2002: 378-387 - [c9]Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
More about Subcolorings. WG 2002: 68-79 - [c8]Fedor V. Fomin, Martín Matamala, Ivan Rapaport:
The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG 2002: 211-222 - 2001
- [j4]Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport:
Bilateral Orientations and Domination. Electron. Notes Discret. Math. 7: 26-29 (2001) - [c7]Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin:
Online and Offline Distance Constrained Labeling of Disk Graphs. ESA 2001: 464-475 - [c6]Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli:
Approximating Minimum Cocolourings. FCT 2001: 118-125 - [c5]Fedor V. Fomin, Andrzej Lingas:
Approximation Algorithms for Time-Dependent Orienteering. FCT 2001: 508-515 - [c4]Fedor V. Fomin, Hans L. Bodlaender:
Approximation of Pathwidth of Outerplanar Graphs. WG 2001: 166-176 - [c3]Fedor V. Fomin, Dimitrios M. Thilikos:
On the Monotonicity of Games Generated by Symmetric Submodular Functions. WG 2001: 177-188 - 2000
- [j3]Fedor V. Fomin, Petr A. Golovach:
Graph Searching and Interval Completion. SIAM J. Discret. Math. 13(4): 454-464 (2000) - [c2]Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
On the Domination Search Number. WG 2000: 161-171
1990 – 1999
- 1999
- [j2]Fedor V. Fomin:
Note on a Helicopter Search Problem on Graphs. Discret. Appl. Math. 95(1-3): 241-249 (1999) - 1998
- [j1]Fedor V. Fomin:
Helicopter Search Problems, Bandwidth and Pathwidth. Discret. Appl. Math. 85(1): 59-70 (1998) - [c1]Fedor V. Fomin, Petr A. Golovach:
Interval Completion with the Smallest Max-degree. WG 1998: 359-371
Coauthor Index
[j203] [j202] [j201] [j199] [j197] [j196] [j195] [c232] [c231] [c230] [c229] [c228] [c226] [c225] [i143] [i142] [i140] [i138] [i137] [i135] [j194] [j193] [j190] [j188] [j187] [j185] [j184] [c221] [c219] [c218] [c217] [c216] [c215] [c214] [c213] [c212] [c209] [c208] [i133] [i131] [i130] [i129] [i128] [i126] [i124] [i123] [i122] [i121] [j183] [j182] [j179] [j178] [c207] [c205] [c204] [c203] [c201] [c200] [c199] [c198] [c197] [i120] [i119] [i118] [i117] [i115] [i114] [i113] [j177] [j176] [j174] [j173] [j170] [c195] [c194] [c191] [c190] [c189] [c188] [c187] [c186] [i112] [i111] [i110] [i109] [i108] [i107] [i106] [i105] [i104] [i103] [i100] [j169] [j168] [j167] [j165] [j162] [j161] [c183] [c180] [c179] [c178] [c177] [c175] [c174] [c173] [c169] [i99] [i96] [i93] [i91] [i90] [i89] [i88] [j153] [j151] [j149] [c167] [c166] [c164] [c162] [c161] [c160] [i87] [i86] [i85] [i81] [i80] [j143] [j142] [c158] [c155] [c154] [i77] [i76] [i75] [i74] [j137] [j133] [j132] [c151] [c148] [c146] [i71] [i70] [i69] [j128] [j127] [c138] [i66] [i60] [j116] [c135] [c133] [c130] [i58] [i57] [i56] [i54] [j110] [j105] [j104] [c126] [c125] [j99] [c120] [c118] [c115] [c112] [i43] [i42] [i41] [i39] [i35] [j90] [j83] [j82] [c102] [c100] [c96] [j77] [j76] [j73] [j70] [j68] [j65] [j64] [j61] [i24] [j57] [j54] [j52] [c82] [c78] [c76] [j48] [c74] [c66] [c65] [c63] [c62] [i18] [c55] [c54] [c53] [c51] [i4] [j35] [c41] [j11] [c13] [j3] [c1]
[j197] [c220] [c213] [i125] [j180] [i114] [j175] [j171] [j170] [j164] [j163] [j162] [j161] [j160] [c182] [c176] [c175] [c171] [c170] [p2] [i95] [i94] [j157] [j156] [j154] [j151] [j150] [j149] [c167] [c165] [c164] [c163] [i87] [i86] [i84] [i83] [j146] [j145] [j144] [j143] [j141] [j139] [c159] [i74] [j134] [j131] [c151] [c150] [c147] [c146] [c145] [i72] [i69] [i68] [j126] [j125] [j124] [j123] [c144] [c143] [c139] [c137] [i63] [i62] [i60] [b2] [c131] [c129] [i52] [i51] [j105] [c127] [c124] [i48] [i46] [j101] [j98] [j96] [j93] [c116] [c113] [c108] [i44] [i40] [j92] [j87] [j86] [j83] [j80] [c105] [c99] [c98] [i32] [i29] [j74] [j72] [j66] [j62] [j61] [c92] [c91] [i27] [j54] [c89] [c85] [c83] [c82] [c81] [c80] [c78] [i21] [i20] [i19] [c73] [c71] [c69] [c68] [c65] [c64] [c62] [c60] [i16] [i12] [c52] [i5] [i3] [c48]
[j199] [j186] [c211] [c202] [i116] [j175] [j170] [c192] [c189] [c188] [i112] [j167] [j162] [j161] [j160] [j159] [c185] [c183] [c182] [c175] [c170] [i98] [i95] [i90] [j157] [j154] [j153] [c167] [c163] [c162] [i87] [i84] [i83] [i81] [i80] [j146] [c157] [c156] [c155] [i77] [i74] [j131] [c150] [i72] [j126] [c144] [c138] [i61] [c131] [c127] [i48]
[j199] [c232] [c230] [c225] [i140] [i138] [i137] [i136] [j187] [j186] [c221] [c220] [i125] [i124] [j183] [j180] [c200] [c197] [i120] [i115] [i113] [j175] [j171] [j170] [c194] [c188] [i112] [i106] [j164] [j163] [j162] [j161] [j160] [c182] [c176] [c175] [c173] [c171] [c170] [p2] [i95] [i94] [j157] [j156] [j154] [j153] [j151] [j150] [j149] [c167] [c165] [c164] [c163] [i87] [i86] [i84] [i83] [i78] [j147] [j146] [j145] [j144] [j143] [j141] [j140] [j139] [c159] [c157] [i74] [j137] [j134] [j131] [c153] [c151] [c150] [c147] [c146] [c145] [i72] [i69] [i68] [j126] [j125] [j123] [c144] [c143] [c139] [c138] [c137] [i63] [i62] [i61] [i60] [b2] [j113] [c135] [c134] [c131] [c129] [i57] [i52] [i51] [j105] [c127] [c126] [c125] [c124] [p1] [i48] [i46] [j101] [j98] [j97] [j96] [j94] [j93] [c113] [c108] [i44] [j92] [j87] [j86] [j81] [j80] [c106] [c105] [c99] [c98] [i32] [i31] [i29] [j74] [j72] [j71] [j69] [j67] [j62] [c92] [c91] [i27] [j57] [j56] [j54] [j53] [c89] [c88] [c85] [c83] [c82] [c81] [c80] [i21] [i20] [i19] [j50] [j46] [c75] [c73] [c72] [c71] [c70] [c69] [c68] [c67] [c65] [c64] [c60] [i17] [i16] [i15] [i14] [i12] [c59] [c57] [c50] [i8] [i7] [i5] [i3] [c48] [c47] [c45] [c43] [i2] [i1] [c37]
[j202] [j200] [j196] [c226] [i142] [j194] [j189] [j187] [j185] [j184] [c218] [c212] [c211] [c210] [c208] [i134] [i129] [i126] [i121] [c207] [c205] [c204] [c201] [c199] [c198] [c197] [i120] [i119] [i118] [j176] [c193] [c192] [c190] [c189] [i108] [i105] [i104] [i100] [c185] [c183] [c172] [c169] [i98] [i97] [i92] [i90] [i89] [c166] [c162] [i85] [i81] [i80]
[j190] [c217] [j179] [j178] [c191] [c186] [i111] [i110] [i107] [i103] [j169] [j165] [j164] [c177] [c161] [j142] [j141] [c154] [i76] [i75] [c148] [i71] [j125] [j121] [r5] [r4] [i62] [c108] [i33] [j91] [j88] [j85] [j84] [j79] [j78] [c99] [i29] [j68] [j67] [j65] [j63] [j60] [i22] [j58] [c86] [c81] [c77] [c76] [c74] [c73] [c63] [i18] [i16] [j43] [j39] [j38] [c59] [c49] [r2] [i4] [j36] [c44] [j31] [j30] [j29] [c39] [c33] [j24] [j23] [j22] [j17] [j15] [c26] [c24] [c23] [c20] [c19] [j10] [c17] [c15] [c14] [c3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
