Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Fernando Fernández
Claudia Calabrese
Fischer, M.
Maria Concetta Palumbo
Lyndon Lee
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
O. YU. TSIDULKO
Author Info
Open Visualization
Name
Affiliation
Papers
O. YU. TSIDULKO
Sobolev Institute of Mathematics SB RAS, Novosibirsk State University, Russia
8
Collaborators
Citations
PageRank
12
1
2.85
Referers
Referees
References
3
26
10
Publications (8 rows)
Collaborators (12 rows)
Referers (3 rows)
Referees (26 rows)
Title
Citations
PageRank
Year
Representative Families For Matroid Intersections, With Applications To Location, Packing, And Covering Problems
0
0.34
2021
The Hierarchical Chinese Postman Problem: The Slightest Disorder Makes It Hard, Yet Disconnectedness Is Manageable
0
0.34
2021
On approximate data reduction for the Rural Postman Problem: Theory and experiments
0
0.34
2020
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
0
0.34
2020
On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem.
0
0.34
2019
Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem.
0
0.34
2017
On Asymptotically Optimal Approach To The M-Peripatetic Salesman Problem On Random Inputs
0
0.34
2016
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
1
0.48
2015
1