The following pages link to Exact exponential algorithms. (Q606873):
Displaying 50 items.
- Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
- Enumeration and maximum number of minimal dominating sets for chordal graphs (Q2317861) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Computing exact clustering posteriors with subset convolution (Q2815984) (← links)
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
- Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- End-Vertices of Graph Search Algorithms (Q2947028) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs (Q2958106) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Invitation to Algorithmic Uses of Inclusion–Exclusion (Q3012908) (← links)
- Exact Algorithms for Kayles (Q3104765) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- Exakte Algorithmen für schwere Graphenprobleme (Q3578291) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
