Pages that link to "Item:Q5056440"
From MaRDI portal
The following pages link to EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs (Q5056440):
Displaying 4 items.
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- Computing list homomorphisms in geometric intersection graphs (Q6039432) (← links)
- Induced odd cycle packing number, independent sets, and chromatic number (Q6074594) (← links)
- Faster algorithms for cycle hitting problems on disk graphs (Q6138985) (← links)