Pages that link to "Item:Q391091"
From MaRDI portal
The following pages link to Incremental list coloring of graphs, parameterized by conservation (Q391091):
Displaying 14 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Multistage graph problems on a global budget (Q831134) (← links)
- On the parameterized complexity of dynamic problems (Q896122) (← links)
- Turbocharging treewidth heuristics (Q1725636) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Multistage vertex cover (Q2135630) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem (Q2240131) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215) (← links)
- Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)
