Pavel Arkhipov

3 Publications

Mark all

[3]
2026 | Published | Conference Paper | IST-REx-ID: 21140 | OA
P. Arkhipov and V. Kolmogorov, “Faster algorithms for packing forests in graphs and related problems,” in Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, Canada, 2026, pp. 4023–4042.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2024 | Submitted | Preprint | IST-REx-ID: 17136 | OA
P. Arkhipov, “Majority dynamics and internal partitions of random regular graphs: Experimental results,” arXiv. .
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2024 | Published | Journal Article | IST-REx-ID: 18482
P. Arkhipov, “An algorithm for finding the generalized Chebyshev center of sets defined via their support functions,” Automation and Remote Control, vol. 85, no. 6. Springer Nature, pp. 522–532, 2024.
View | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


3 Publications

Mark all

[3]
2026 | Published | Conference Paper | IST-REx-ID: 21140 | OA
P. Arkhipov and V. Kolmogorov, “Faster algorithms for packing forests in graphs and related problems,” in Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, Canada, 2026, pp. 4023–4042.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2024 | Submitted | Preprint | IST-REx-ID: 17136 | OA
P. Arkhipov, “Majority dynamics and internal partitions of random regular graphs: Experimental results,” arXiv. .
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2024 | Published | Journal Article | IST-REx-ID: 18482
P. Arkhipov, “An algorithm for finding the generalized Chebyshev center of sets defined via their support functions,” Automation and Remote Control, vol. 85, no. 6. Springer Nature, pp. 522–532, 2024.
View | DOI | WoS
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed