The following pages link to STACS 2005 (Q5710689):
Displaying 17 items.
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- Time-explicit Darwin PIC algorithm (Q2671300) (← links)
- On the complexity of circuit satisfiability (Q2875150) (← links)
- An Improved SAT Algorithm in Terms of Formula Length (Q3183448) (← links)
- Computing in Finite Time (Q3408878) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- New Computational Paradigms (Q5717070) (← links)
