2 citations · 8 across the 13 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2024
Eliminating Crossings in Ordered Graphs
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann +4
Drawing a graph in the plane with as few crossings as possible is one of the central problems in graph drawing and computational geometry. Another option is to remove the smallest…
cs.CG2020★ 2 cited
The Parameterized Complexity of Guarding Almost Convex Polygons
Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov +2
Art Gallery is a fundamental visibility problem in Computational Geometry. The input consists of a simple polygon P, (possibly infinite) sets G and C of points within P, and an int…