Pages that link to "Item:Q5311520"
From MaRDI portal
The following pages link to Parameterized and Exact Computation (Q5311520):
Displaying 23 items.
- Exact algorithms for dominating set (Q411862) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- An exact algorithm for MAX-CUT in sparse graphs (Q2467485) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- (Q5075820) (← links)
