Stepan Artamonov

According to our database, Stepan Artamonov authored at least 4 papers between 2012 and 2024.

Collaborative distances:

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

2024

Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings.

Stepan Artamonov, Maxim A. Babenko

Algorithmica, March, 2024

2018

A fast scaling algorithm for the weighted triangle-free 2-matching problem.

Stepan Artamonov, Maxim A. Babenko

Eur. J. Comb., 2018

2017

Faster Algorithms for Half-Integral T-Path Packing.

Maxim A. Babenko, Stepan Artamonov

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2012

An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks.

Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012