Pages that link to "Item:Q3452221"
From MaRDI portal
The following pages link to A measure & conquer approach for the analysis of exact algorithms (Q3452221):
Displaying 50 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- MP or not MP: that is the question (Q283264) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Exact algorithms for Kayles (Q476858) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Capacitated domination faster than \(O(2^n)\) (Q1944213) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- A note on the fine-grained complexity of MIS on regular graphs (Q2032165) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- From matchings to independent sets (Q2403787) (← links)
