Optimal Bounds on the VC-dimension. - Mónika Csikós; Andrey Kupavskii; Nabil H. Mustafa (CoRR, 2018)

Induced saturation of graphs. - Maria Axenovich; Mónika Csikós (Discret. Math., 2019)

Tight Lower Bounds on the VC-dimension of Geometric Set Systems. - Mónika Csikós; Nabil H. Mustafa; Andrey Kupavskii (J. Mach. Learn. Res., 2019)

A Simple Proof of Optimal Approximations. - Mónika Csikós; Nabil H. Mustafa (CoRR, 2020)

Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications. - Mónika Csikós; Nabil H. Mustafa (SoCG, 2021)

Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical. - Mónika Csikós; Nabil H. Mustafa (CoRR, 2022)

Optimal approximations made easy. - Mónika Csikós; Nabil H. Mustafa (Inf. Process. Lett., 2022)

Optimal Embedded and Enclosing Isosceles Triangles. - Áron Ambrus; Mónika Csikós; Gergely Kiss; János Pach; Gábor Somlai (Int. J. Found. Comput. Sci., 2023)

An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations. - Mónika Csikós; Nabil H. Mustafa (ICALP, 2024)

Practical Computation of Graph VC-Dimension. - David Coudert; Mónika Csikós; Guillaume Ducoffe; Laurent Viennot (SEA, 2024)

Forbidden patterns in temporal graphs resulting from encounters in a corridor. - Mónika Csikós; Michel Habib; Minh-Hang Nguyen; Mikaël Rabie; Laurent Viennot (J. Comput. Syst. Sci., 2025)

A Greedy Algorithm for Low-Crossing Partitions for General Set Systems. - Mónika Csikós; Alexandre Louvet; Nabil H. Mustafa (CoRR, 2025)

On graph classes with constant domination-packing ratio. - Marthe Bonamy; Mónika Csikós; Anna Gujgiczer; Yelena Yuditsky (CoRR, 2025)