The following pages link to Fedor V. Fomin (Q259035):
Displaying 50 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- More about subcolorings (Q424720) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- (Q586126) (redirect page) (← links)
- Exact exponential algorithms. (Q606873) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- How to guard a graph? (Q652526) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Connected graph searching (Q690489) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- Eliminating graphs by means of parallel knock-out schemes (Q867852) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- On \(k\)-partitioning of Hamming graphs (Q1302152) (← links)
- Note on a helicopter search problem on graphs (Q1302160) (← links)
- On graceful graphs: Union of \(n\) copies of edge deleted subgraphs of \(K_4\) (Q1307656) (← links)
- (Q1373640) (redirect page) (← links)
