Pages that link to "Item:Q5244381"
From MaRDI portal
The following pages link to Exact Algorithms via Monotone Local Search (Q5244381):
Displaying 33 items.
- Dynamic parameterized problems (Q722546) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Heuristics and exact algorithms for solving the Monden problem (Q1266568) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- (Q5009483) (← links)
- (Q5092393) (← links)
- (Q5092437) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- Exact Algorithms via Monotone Local Search (Q5244381) (← links)
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
- (Q5361878) (redirect page) (← links)
- Algorithmic local monomialization of a binomial: A comparison of different approaches (Q5877368) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
- Subset feedback vertex set in chordal and split graphs (Q5919404) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs (Q6140360) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs (Q6591469) (← links)
