3 papers
math.CO2025
On graph classes with constant domination-packing ratio
Marthe Bonamy, Mónika Csikós, Anna Gujgiczer +1
The dominating number of a graph is the minimum size of a vertex set whose closed neighborhood covers all the vertices of the graph. The packing number of is…
cs.CG2025
A Greedy Algorithm for Low-Crossing Partitions for General Set Systems
Mónika Csikós, Alexandre Louvet, Nabil Mustafa
Simplicial partitions are a fundamental structure in computational geometry, as they form the basis of optimal data structures for range searching and several related problems. Cur…
cs.DS2024
Practical Computation of Graph VC-Dimension
David Coudert, Mónika Csikós, Guillaume Ducoffe +1
For any set system , a subset is called \emph{shattered} if every results from the intersection of with some set in…