Roland Vincze

According to our database, Roland Vincze authored at least 7 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Approximating Maximum Edge 2-Coloring by Normalizing Graphs.

Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze

Discret. Math. Theor. Comput. Sci., 2025

2022

A 3/2-Approximation for the Metric Many-Visits Path TSP.

Kristóf Bérczi, Matthias Mnich, Roland Vincze

SIAM J. Discret. Math., December, 2022

Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems.

Kristóf Bérczi, Matthias Mnich, Roland Vincze

CoRR, 2022

2020

Time- and Space-optimal Algorithm for the Many-visits TSP.

André Berger, László Kozma, Matthias Mnich, Roland Vincze

ACM Trans. Algorithms, 2020

2019

Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP.

Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze

CoRR, 2019

2018

SciSports: Learning football kinematics through two-dimensional tracking data.

Anatoliy Babic, Harshit Bansal, Gianluca Finocchio, Julian Golak, Mark A. Peletier, Jim Portegies, Clara Stegehuis, Anuj Tyagi, Roland Vincze, William Weimin Yoo

CoRR, 2018

Time- and space-optimal algorithms for the many-visits TSP.

André Berger, László Kozma, Matthias Mnich, Roland Vincze

CoRR, 2018