Properties of minimally t-tough graphs. - Gyula Y. Katona; Daniel Soltész; Kitti Varga (Discret. Math., 2018)

Decomposition of a Graph into Two Disjoint Odd Subgraphs. - Mikio Kano; Gyula Y. Katona; Kitti Varga (Graphs Comb., 2018)

On the Complexity of Color-Avoiding Site and Bond Percolation. - Roland Molontay; Kitti Varga (SOFSEM, 2019)

The complexity of recognizing minimally tough graphs. - Gyula Y. Katona; István Kovács; Kitti Varga (Discret. Appl. Math., 2021)

Conditions for minimally tough graphs. - Clément Dallard; Blas Fernández; Gyula Y. Katona; Martin Milanic; Kitti Varga (CoRR, 2022)

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and 𝓁∞-norm objectives. - Kristóf Bérczi; Lydia Mirabel Mendoza Cadena; Kitti Varga (CoRR, 2023)

Newton-type algorithms for inverse optimization II: weighted span objective. - Kristóf Bérczi; Lydia Mirabel Mendoza Cadena; Kitti Varga (CoRR, 2023)

Inverse optimization problems with multiple weight functions. - Kristóf Bérczi; Lydia Mirabel Mendoza Cadena; Kitti Varga (Discret. Appl. Math., 2023)

Strengthening some complexity results on toughness of graphs. - Gyula Y. Katona; Kitti Varga (Discuss. Math. Graph Theory, 2023)

Minimal toughness in special graph classes. - Gyula Y. Katona; Kitti Varga (Discret. Math. Theor. Comput. Sci., 2023)

Edges Not Covered by Monochromatic Bipartite Graph. - Xiutao Zhu; Ervin Györi; Zhen He; Zequn Lv; Nika Salia; Casey Tompkins; Kitti Varga (SIAM J. Discret. Math., 2023)

Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective. - Kristóf Bérczi; Lydia Mirabel Mendoza Cadena; Kitti Varga (LATIN (2), 2024)

Extremal Results for Graphs Avoiding a Rainbow Subgraph. - Zhen He; Peter Frankl; Ervin Györi; Zequn Lv; Nika Salia; Casey Tompkins; Kitti Varga; Xiutao Zhu (Electron. J. Comb., 2024)

Color-avoiding connected spanning subgraphs with minimum number of edges. - József Pintér; Kitti Varga (Discret. Appl. Math., 2024)

Color-avoiding percolation and branching processes. - Panna Tímea Fekete; Roland Molontay; Balázs Ráth; Kitti Varga (J. Appl. Probab., 2024)

Generalized Turán numbers for the edge blow-up of a graph. - Zequn Lv; Ervin Györi; Zhen He; Nika Salia; Casey Tompkins; Kitti Varga; Xiutao Zhu (Discret. Math., 2024)

A New Construction for the Planar Turán Number of Cycles. - Ervin Györi; Kitti Varga; Xiutao Zhu (Graphs Comb., 2024)

On the rainbow planar Turán number of paths. - Ervin Györi; Ryan R. Martin; Addisu Paulos; Casey Tompkins; Kitti Varga (Discret. Math., 2025)

Simultaneous Network Design with Restricted Link Usage. - Naonori Kakimura; Péter Madarasi; Jannik Matuschke; Kitti Varga (CoRR, 2025)

On graphs without cycles of length 0 modulo 4. - Ervin Györi; Binlong Li; Nika Salia; Casey Tompkins; Kitti Varga; Manran Zhu (J. Comb. Theory B, 2026)