One-Way Cellular Automata on Cayley Graphs. - Zsuzsanna Róka (Theor. Comput. Sci., 1994)

Simulations between Cellular Automata on Cayley Graphs. - Zsuzsanna Róka (Theor. Comput. Sci., 1999)

The firing squad synchronization problem on Cayley graphs. - Zsuzsanna Róka (Theor. Comput. Sci., 2000)

Number conserving cellular automata: new results on decidability and dynamics. - Bruno Durand 001; Enrico Formenti; Aristide Grange; Zsuzsanna Róka (DMCS, 2003)

Number-conserving cellular automata I: decidability. - Bruno Durand 001; Enrico Formenti; Zsuzsanna Róka (Theor. Comput. Sci., 2003)

Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 2014)

Optimization of tire noise by solving an Integer Linear Program (ILP). - Matthias Becker 002; Nicolas Ginoux; Sébastien Martin; Zsuzsanna Róka (SMC, 2016)

Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 2017)

Tire Noise Optimization Problem: a Mixed Integer Linear Program Approach. - Matthias Becker 002; Nicolas Ginoux; Sébastien Martin; Zsuzsanna Róka (CoRR, 2018)

Exact and Heuristic Solutions to the Connected k-Partitioning Problem. - Patrick Healy; Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (CoDIT, 2020)

Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. - Pierre Laroche; Franc Marchetti; Sébastien Martin; Anass Nagih; Zsuzsanna Róka (Discret. Optim., 2020)

Tire noise optimization problem: a mixed integer linear programming approach. - Matthias Becker 002; Nicolas Ginoux; Sébastien Martin; Zsuzsanna Róka (RAIRO Oper. Res., 2021)

A branch-and-cut algorithm for the connected max-k-cut problem. - Patrick Healy; Nicolas Jozefowiez; Pierre Laroche; Franc Marchetti; Sébastien Martin; Zsuzsanna Róka (Eur. J. Oper. Res., 2024)