The Robust Traveling Salesman Problem with Interval Data. - Roberto Montemanni; János Barta; Monaldo Mastrolilli; Luca Maria Gambardella (Transp. Sci., 2007)

Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem. - János Barta; Valeria Leggieri; Roberto Montemanni; Paolo Nobili; Chefi Triki (Electron. Notes Discret. Math., 2010)

Minimum power multicasting in wireless networks under probabilistic node failures. - János Barta; Valeria Leggieri; Roberto Montemanni; Paolo Nobili; Chefi Triki (Comput. Optim. Appl., 2011)

Statistical modelling of delays in a rail freight transportation network. - János Barta; Andrea Emilio Rizzoli; Matteo Salani; Luca Maria Gambardella (WSC, 2012)

Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms. - Roberto Montemanni; János Barta; Derek H. Smith (WorldCIST (1), 2016)

The Maximum Clique Problem for Permutation Hamming Graphs. - János Barta; Roberto Montemanni (J. Optim. Theory Appl., 2022)

On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach. - Eleonora Vercesi; János Barta; Luca Maria Gambardella; Stefano Gualandi; Monaldo Mastrolilli (Discret. Optim., 2025)

The Integrality Gap of the Traveling Salesman Problem is 4/3 if the LP Solution Has at Most n+6 Non-zero Components. - Tullio Villa; Eleonora Vercesi; János Barta; Monaldo Mastrolilli (CoRR, 2025)