Pavel A. Arkhipov

According to our database, Pavel A. Arkhipov authored at least 7 papers between 2022 and 2026.

Collaborative distances:

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

2026

Tighter relaxations for MAP-MRF optimization via Singleton Arc Consistency.

Asaf Lev-Ran, Pavel A. Arkhipov, Vladimir Kolmogorov

CoRR, May, 2026

Blossom VI: A Practical Minimum Weight Perfect Matching Algorithm.

Pavel A. Arkhipov, Vladimir Kolmogorov

CoRR, April, 2026

Faster algorithms for packing forests in graphs and related problems.

Pavel A. Arkhipov, Vladimir Kolmogorov

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Greedy matroid base packings with applications to dynamic graph density and orientations.

Pavel A. Arkhipov, Vladimir Kolmogorov

CoRR, November, 2025

2024

An Algorithm for Finding the Generalized Chebyshev Center of Sets Defined via Their Support Functions.

Pavel A. Arkhipov

Autom. Remote. Control., June, 2024

A faster algorithm for the <i>k</i>-forest problem: breaking the O_k(n^3/2) complexity barrier.

Pavel A. Arkhipov, Vladimir Kolmogorov

CoRR, 2024

2022

Synchronization on star-like graphs and emerging $\mathbb{Z}_{p}$ symmetries at strong coupling.

Artem Alexandrov, Pavel A. Arkhipov, Alexander Gorsky

J. Complex Networks, 2022