1 citations · 2 across the 13 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2025
CNFs and DNFs with Exactly Solutions
L. Sunil Chandran, Rishikesh Gajjala, Kuldeep S. Meel
Model counting is a fundamental problem that consists of determining the number of satisfying assignments for a given Boolean formula. The weighted variant, which computes the weig…
cs.DM2024
Improved upper bounds for the Heilbronn's Problem for -gons
Rishikesh Gajjala, Jayanth Ravi
The Heilbronn triangle problem asks for the placement of points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In ,…
cs.DM2022
Edge-coloured graphs with only monochromatic perfect matchings and their connection to quantum physics
L. Sunil Chandran, Rishikesh Gajjala
Krenn, Gu and Zeilinger initiated the study of PMValid edge-colourings because of its connection to a problem from quantum physics. A graph is defined to have a PMValid -edge-co…