Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

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:

Combinatorial and geometric properties of the Max-Cut and Min-Cut problems
В. А. Бондаренко, Andrei V. Nikolaev
Doklady Mathematics (2013) Vol. 88, Iss. 2, pp. 516-517
Closed Access | Times Cited: 14

Showing 14 citing articles:

On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems
В. А. Бондаренко, Andrei V. Nikolaev
International Journal of Mathematics and Mathematical Sciences (2016) Vol. 2016, pp. 1-6
Open Access | Times Cited: 16
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
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
1-Skeletons of the Spanning Tree Problems with Additional Constraints
В. А. Бондаренко, Andrei V. Nikolaev, D. A. Shovgenov
Modeling and Analysis of Information Systems (2015) Vol. 22, Iss. 4, pp. 453-453
Open Access | Times Cited: 4
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
1-Skeletons of the Spanning Tree Problems with Additional Constraints
В. А. Бондаренко, Andrei V. Nikolaev, D. A. Shovgenov
Automatic Control and Computer Sciences (2017) Vol. 51, Iss. 7, pp. 682-688
Open Access | Times Cited: 3
Polyhedral Characteristics of Balanced and Unbalanced Bipartite Subgraph Problems
В. А. Бондаренко, Andrei V. Nikolaev, D. A. Shovgenov
Modeling and Analysis of Information Systems (2017) Vol. 24, Iss. 2, pp. 141-154
Open Access | Times Cited: 2
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
Complexity of LP in Terms of the Face Lattice
A. N. Maksimenko
arXiv (Cornell University) (2014)
Open Access
Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
A. N. Maksimenko
Journal of Applied and Industrial Mathematics (2016) Vol. 10, Iss. 3, pp. 370-379
Open Access
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
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
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search.
Andrei V. Nikolaev, Anna Kozlova
arXiv (Cornell University) (2020)
Closed Access
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
Page 1

Scroll to top