The following pages link to (Q4252376):
Displaying 24 items.
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- A 4D-sequencing approach for air traffic management (Q2514871) (← links)
- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs (Q3503578) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Solving NP-Complete Problems with Quantum Search (Q5458579) (← links)
- Homogeneous genetic algorithms (Q5852153) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)
