13 citations · 77 across the 56 of their papers we have counts for
7 papers · 1 filter
Optimality program in segment and string graphs
Édouard Bonnet, Paweł Rzążewski
Planar graphs are known to allow subexponential algorithms running in time or for most of the paradigmatic problems, while the brute-force…
Completeness for the Complexity Class and Area-Universality
Michael G. Dobbins, Linda Kleist, Tillmann Miltzow +1
Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class plays a crucial role in the study of geometric problems.…
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…
On edge intersection graphs of paths with 2 bends
Martin Pergel, Paweł Rzążewski
An EPG-representation of a graph is a collection of paths in a plane square grid, each corresponding to a single vertex of , so that two vertices are adjacent if and only if…
Sequences of radius for complete bipartite graphs
Michał Dębski, Zbigniew Lonc, Paweł Rzążewski
A \emph{-radius sequence} for a graph is a sequence of vertices of (typically with repetitions) such that for every edge of vertices and appear at least…
Designing RNA Secondary Structures is Hard
Édouard Bonnet, Paweł Rzążewski, Florian Sikora
An RNA sequence is a word over an alphabet on four elements called bases. RNA sequences fold into secondary structures where some bases match one another while others…