The following pages link to Anders Yeo (Q168085):
Displaying 50 items.
- The complexity of finding arc-disjoint branching flows (Q298947) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value'' (Q385510) (← links)
- The complexity of multicut and mixed multicut problems in (di)graphs (Q391767) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture (Q400496) (← links)
- A maximum degree theorem for diameter-2-critical graphs (Q403217) (← links)
- A new lower bound on the independence number of a graph and applications (Q405126) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Arc-disjoint spanning sub(di)graphs in digraphs (Q441857) (← links)
- An algorithm for finding input-output constrained convex sets in an acyclic digraph (Q450526) (← links)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
- A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs (Q539864) (← links)
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs (Q558238) (← links)
- (Q592312) (redirect page) (← links)
- A new bound on the domination number of graphs with minimum degree two (Q625374) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- On a conjecture of Murty and Simon on diameter two critical graphs. II. (Q658055) (← links)
- Perfect matchings in total domination critical graphs (Q659733) (← links)
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free (Q666001) (← links)
- Transversals and matchings in 3-uniform hypergraphs (Q691579) (← links)
- Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width (Q713329) (← links)
- Transversals in 4-uniform hypergraphs (Q727047) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Hamilton cycles in digraphs of unitary matrices (Q856886) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- Independence in 5-uniform hypergraphs (Q898167) (← links)
- A problem of finding an acceptable variant in generalized project networks (Q930769) (← links)
- Hoàng-Reed conjecture holds for tournaments (Q932618) (← links)
- Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134) (← links)
- Total domination of graphs and small transversals of hypergraphs (Q949753) (← links)
- Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- A new upper bound on the total domination number of a graph (Q1010625) (← links)
- Total domination in graphs with given girth (Q1014823) (← links)
- On the number of connected convex subgraphs of a connected acyclic digraph (Q1028149) (← links)
- Some complexity problems on single input double output controllers (Q1028446) (← links)
- Total domination in partitioned graphs (Q1043811) (← links)
- Algorithms for generating convex sets in acyclic digraphs (Q1044043) (← links)
- Maximal and minimal vertex-critical graphs of diameter two (Q1127872) (← links)
- A new sufficient condition for a digraph to be Hamiltonian (Q1302145) (← links)
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour (Q1302598) (← links)
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← links)
