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:
Polyhedral Characteristics of Balanced and Unbalanced Bipartite Subgraph Problems
В. А. Бондаренко, Andrei V. Nikolaev, D. A. Shovgenov
Automatic Control and Computer Sciences (2017) Vol. 51, Iss. 7, pp. 576-585
Open Access | Times Cited: 6
В. А. Бондаренко, Andrei V. Nikolaev, D. A. Shovgenov
Automatic Control and Computer Sciences (2017) Vol. 51, Iss. 7, pp. 576-585
Open Access | Times Cited: 6
Showing 6 citing articles:
On Vertex Adjacencies in the Polytope of Pyramidal Tours with Step-Backs
Andrei V. Nikolaev
Lecture notes in computer science (2019), pp. 247-263
Closed Access | Times Cited: 4
Andrei V. Nikolaev
Lecture notes in computer science (2019), pp. 247-263
Closed Access | Times Cited: 4
On 1-Skeleton of the Cut Polytopes
Andrei V. Nikolaev
Lecture notes in computer science (2024), pp. 142-156
Closed Access
Andrei V. Nikolaev
Lecture notes in computer science (2024), pp. 142-156
Closed Access
The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
A. N. Maksimenko
Automatic Control and Computer Sciences (2021) Vol. 55, Iss. 7, pp. 816-826
Closed Access | Times Cited: 1
A. N. Maksimenko
Automatic Control and Computer Sciences (2021) Vol. 55, Iss. 7, pp. 816-826
Closed Access | Times Cited: 1
On cone partitions for the min-cut and max-cut problems with non-negative edges
Andrei V. Nikolaev, Alexander V. Korostil
arXiv (Cornell University) (2023)
Open Access
Andrei V. Nikolaev, Alexander V. Korostil
arXiv (Cornell University) (2023)
Open Access
On Cone Partitions for the Min-Cut and Max-Cut Problems with Non-negative Edges
Andrei V. Nikolaev, Alexander V. Korostil
Communications in computer and information science (2023), pp. 146-160
Closed Access
Andrei V. Nikolaev, Alexander V. Korostil
Communications in computer and information science (2023), pp. 146-160
Closed Access
Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
A. N. Maksimenko
Modeling and Analysis of Information Systems (2020) Vol. 27, Iss. 1, pp. 72-85
Open Access
A. N. Maksimenko
Modeling and Analysis of Information Systems (2020) Vol. 27, Iss. 1, pp. 72-85
Open Access
