The following pages link to Measure and conquer (Q3581486):
Displaying 34 items.
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Independent sets in graphs (Q501998) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- On maximum independent sets in \(P_{5}\)-free graphs (Q708334) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Improved edge-coloring with three colors (Q837164) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Exponential-time approximation of weighted set cover (Q989538) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- A 4D-sequencing approach for air traffic management (Q2514871) (← links)
- On the independent set problem in random graphs (Q2804023) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- An Improved SAT Algorithm in Terms of Formula Length (Q3183448) (← links)
- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree (Q3502671) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- (Q5090449) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
