54 citations · 152 across the 16 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CG2017
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim +2
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Cliq…
cs.AI2017
The shortest way to visit all metro lines in a city
Florian Sikora
What if a tourist, a train addict, Dr. Sheldon Cooper, somebody who likes to waste time wants to visit all metro lines or carriages in a given network in a minimum number o…