OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
Andrei V. Nikolaev, Anna Kozlova
Journal of Combinatorial Optimization (2020) Vol. 42, Iss. 2, pp. 212-230
Closed Access | Times Cited: 7
Andrei V. Nikolaev, Anna Kozlova
Journal of Combinatorial Optimization (2020) Vol. 42, Iss. 2, pp. 212-230
Closed Access | Times Cited: 7
Showing 7 citing articles:
A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology
Adnan A. Hnaif, Abdelfatah A. Tamimi, Ayman M. Abdalla, et al.
Computers, materials & continua/Computers, materials & continua (Print) (2021) Vol. 68, Iss. 1, pp. 505-519
Open Access | Times Cited: 11
Adnan A. Hnaif, Abdelfatah A. Tamimi, Ayman M. Abdalla, et al.
Computers, materials & continua/Computers, materials & continua (Print) (2021) Vol. 68, Iss. 1, pp. 505-519
Open Access | Times Cited: 11
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
Andrei V. Nikolaev, Egor V. Klimov
Journal of Combinatorial Optimization (2024) Vol. 47, Iss. 5
Closed Access
Andrei V. Nikolaev, Egor V. Klimov
Journal of Combinatorial Optimization (2024) Vol. 47, Iss. 5
Closed Access
Maximizing Neutrality in News Ordering
Rishi Advani, Paolo Papotti, Abolfazl Asudeh
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2023), pp. 11-24
Open Access | Times Cited: 1
Rishi Advani, Paolo Papotti, Abolfazl Asudeh
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2023), pp. 11-24
Open Access | Times Cited: 1
An Iterative ILP Approach for Constructing a Hamiltonian Decomposition of a Regular Multigraph
Andrey Kostenko, Andrei V. Nikolaev
Communications in computer and information science (2021), pp. 216-232
Open Access | Times Cited: 2
Andrey Kostenko, Andrei V. Nikolaev
Communications in computer and information science (2021), pp. 216-232
Open Access | Times Cited: 2
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
Andrei V. Nikolaev, Egor V. Klimov
arXiv (Cornell University) (2022)
Open Access
Andrei V. Nikolaev, Egor V. Klimov
arXiv (Cornell University) (2022)
Open Access
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-Regular Multigraph
Alexander V. Korostil, Andrei V. Nikolaev
Automatic Control and Computer Sciences (2022) Vol. 56, Iss. 7, pp. 688-700
Open Access
Alexander V. Korostil, Andrei V. Nikolaev
Automatic Control and Computer Sciences (2022) Vol. 56, Iss. 7, pp. 688-700
Open Access
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Alexander V. Korostil, Andrei V. Nikolaev
Modeling and Analysis of Information Systems (2021) Vol. 28, Iss. 1, pp. 6-21
Open Access
Alexander V. Korostil, Andrei V. Nikolaev
Modeling and Analysis of Information Systems (2021) Vol. 28, Iss. 1, pp. 6-21
Open Access
