The following pages link to Exact exponential algorithms. (Q606873):
Displaying 50 items.
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Fixing balanced knockout and double elimination tournaments (Q1711876) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
- A note on the eternal dominating set problem (Q1791289) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Review on nature-inspired algorithms (Q1981936) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- Analyzing clustering and partitioning problems in selected VLSI models (Q2032285) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations (Q2077398) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- On zero-error codes produced by greedy algorithms (Q2084654) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Polynomial kernels for tracking shortest paths (Q2094386) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- Exact algorithms for scheduling programs with shared tasks (Q2156317) (← links)
- Real-valued group testing for quantitative molecular assays (Q2170137) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- Exponential upper bounds for the runtime of randomized search heuristics (Q2220808) (← links)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
