Pages that link to "Item:Q2920136"
From MaRDI portal
The following pages link to A Fine-grained Analysis of a Simple Independent Set Algorithm (Q2920136):
Displaying 14 items.
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← 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)
- The many facets of upper domination (Q1704853) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Exponential Time Complexity of Weighted Counting of Independent Sets (Q3058702) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)