pith. sign in

Fedor V. Fomin

Identifiers

  • name variant Fedor V. Fomin 0.60 · backfill

Papers (70)

  1. Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study cs.DS · 2026 · author #2
  2. Refined Complexity of PCA with Outliers cs.DS · 2019 · author #1
  3. Low-rank binary matrix approximation in column-sum norm cs.DS · 2019 · author #1
  4. Knot Diagrams of Treewidth Two cs.DS · 2019 · author #3
  5. Decomposition of Map Graphs with Applications cs.DS · 2019 · author #1
  6. Parameterized k-Clustering: The distance matters! cs.DS · 2019 · author #1
  7. Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals cs.DS · 2019 · author #1
  8. Going Far From Degeneracy cs.DS · 2019 · author #1
  9. Approximation Schemes for Low-Rank Binary Matrix Approximation Problems cs.DS · 2018 · author #1
  10. On the Parameterized Complexity of Graph Modification to First-Order Logic Properties cs.DS · 2018 · author #1
  11. Parameterized Low-Rank Binary Matrix Approximation cs.DS · 2018 · author #1
  12. Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces cs.CG · 2017 · author #2
  13. Covering vectors by spaces: Regular matroids cs.DS · 2017 · author #1
  14. Structured Connectivity Augmentation cs.DS · 2017 · author #1
  15. Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs cs.DS · 2017 · author #1
  16. Finding Detours is Fixed-parameter Tractable cs.DS · 2016 · author #4
  17. Spanning Circuits in Regular Matroids cs.DS · 2016 · author #1
  18. On the Optimality of Pseudo-polynomial Algorithms for Integer Programming cs.DS · 2016 · author #1
  19. Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering cs.DS · 2016 · author #1
  20. Vertex Cover Structural Parameterization Revisited cs.DS · 2016 · author #1
  21. Tight Lower Bounds on Graph Embedding Problems cs.DS · 2016 · author #2
  22. Metric Dimension of Bounded Tree-length Graphs cs.DS · 2016 · author #2
  23. Exact Algorithms via Monotone Local Search cs.DS · 2015 · author #1
  24. Fully polynomial-time parameterized computations for graphs and matrices of low treewidth cs.DS · 2015 · author #1
  25. Tight Bounds for Subgraph Isomorphism and Graph Homomorphism cs.DS · 2015 · author #1
  26. How to Hunt an Invisible Rabbit on a Graph math.CO · 2015 · author #2
  27. Lower Bounds for the Graph Homomorphism Problem cs.DS · 2015 · author #1
  28. Parameterized Complexity of Secluded Connectivity Problems cs.DS · 2015 · author #1
  29. Parameterized Complexity of Superstring Problems cs.DS · 2015 · author #2
  30. Kernelization and Sparseness: the case of Dominating Set cs.DS · 2014 · author #3
  31. Algorithms parameterized by vertex cover and modular width, through potential maximal cliques cs.DS · 2014 · author #1
  32. Representative Sets of Product Families cs.DS · 2014 · author #1
  33. A subexponential parameterized algorithm for Interval Completion cs.DS · 2014 · author #2
  34. A subexponential parameterized algorithm for Proper Interval Completion cs.DS · 2014 · author #2
  35. Largest chordal and interval subgraphs faster than 2^n cs.DS · 2013 · author #2
  36. Minimizing Rosenthal Potential in Multicast Games cs.GT · 2013 · author #1
  37. Exploring Subexponential Parameterized Complexity of Completion Problems cs.DS · 2013 · author #2
  38. Computing Tree-depth Faster Than $2^{n}$ cs.DS · 2013 · author #1
  39. Preventing Unraveling in Social Networks Gets Harder cs.SI · 2013 · author #2
  40. A O(c^k n) 5-Approximation Algorithm for Treewidth cs.DS · 2013 · author #4
  41. On the parameterized complexity of cutting a few vertices from a graph cs.DS · 2013 · author #1
  42. Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs cs.DS · 2013 · author #2
  43. Long Circuits and Large Euler Subgraphs cs.DS · 2013 · author #1
  44. Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms cs.DS · 2013 · author #1
  45. Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph cs.DS · 2013 · author #1
  46. Kernels for (connected) Dominating Set on graphs with Excluded Topological subgraphs cs.DS · 2012 · author #1
  47. Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? cs.DS · 2012 · author #1
  48. A Polynomial kernel for Proper Interval Vertex Deletion cs.DS · 2012 · author #1
  49. Subexponential fixed-parameter tractability of cluster editing cs.CC · 2011 · author #1
  50. k-Gap Interval Graphs cs.DS · 2011 · author #1
  51. Jungles, bundles, and fixed parameter tractability cs.DS · 2011 · author #1
  52. Parameterized Complexity of Firefighting Revisited cs.DM · 2011 · author #2
  53. Bidimensionality and Geometric Graphs cs.DS · 2011 · author #1
  54. Subexponential Parameterized Algorithm for Minimum Fill-in cs.DS · 2011 · author #1
  55. Hitting forbidden minors: Approximation and Kernelization cs.DS · 2010 · author #1
  56. Bidimensionality and EPTAS cs.DS · 2010 · author #1
  57. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs cs.DS · 2010 · author #2
  58. Faster Algorithms for Finding and Counting Subgraphs cs.DS · 2009 · author #1
  59. Rank-width and Tree-width of H-minor-free Graphs math.CO · 2009 · author #1
  60. Finding Induced Subgraphs via Minimal Triangulations cs.DS · 2009 · author #1
  61. A Linear Vertex Kernel for Maximum Internal Spanning Tree cs.DS · 2009 · author #1
  62. Kernels for Feedback Arc Set In Tournaments cs.DS · 2009 · author #2
  63. (Meta) Kernelization cs.DM · 2009 · author #2
  64. Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem cs.DS · 2009 · author #2
  65. Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves cs.DS · 2008 · author #2
  66. Approximating acyclicity parameters of sparse hypergraphs cs.DS · 2008 · author #1
  67. Treewidth computation and extremal combinatorics cs.DS · 2008 · author #1
  68. Parameterized Algorithms for Partial Cover Problems cs.DS · 2008 · author #2
  69. Better Algorithms and Bounds for Directed Maximum Leaf Problems cs.DS · 2007 · author #2
  70. Using Combinatorics to Prune Search Trees: Independent and Dominating Set cs.DS · 2006 · author #1

Mentions

  • 1404.3882 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1402.3909 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1402.3473 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 1402.3472 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 1311.4055 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 1309.6797 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1309.4022 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 1306.3857 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1304.6420 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 1304.6321 #4 · backfill · confidence 0.70 Fedor V. Fomin
  • 1304.6189 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1304.5870 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 1304.5746 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1304.4626 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1301.7314 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1210.0257 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1206.4912 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1204.4880 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1112.4419 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1112.3244 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1112.1538 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1109.4729 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 1107.2221 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1104.2230 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1010.1365 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1005.5449 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 1001.0821 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 0912.2371 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 0910.0079 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 0909.5278 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 0907.3208 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 0907.2165 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 0904.0727 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 0903.0938 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 0810.4796 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 0809.3646 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 0803.1321 #1 · backfill · confidence 0.70 Fedor V. Fomin
  • 0802.1722 #2 · backfill · confidence 0.70 Fedor V. Fomin
  • 0707.1095 #2 · backfill · confidence 0.70 Fedor V. Fomin

Frequent Coauthors