Showing cs.CGShow all
2 papers · 1 filter
cs.CG2025
Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints
J. Mark Keil, Debajyoti Mondal
A geometric intersection graph is constructed over a set of geometric objects, where each vertex represents a distinct object and an edge connects two vertices if and only if the c…
cs.CG2024
Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond
J. Mark Keil, Fraser McLeod, Debajyoti Mondal
The classical 3SUM conjecture states that the class of 3SUM-hard problems does not admit a truly subquadratic -time algorithm, where , in classical computing. The…