Alexander Veremyev
Alexander Veremyev
Research Assistant Professor
Verified email at
Cited by
Cited by
On the maximum quasi-clique problem
J Pattillo, A Veremyev, S Butenko, V Boginski
Discrete Applied Mathematics 161 (1-2), 244-257, 2013
Critical nodes for distance‐based connectivity and related problems in graphs
A Veremyev, OA Prokopyev, EL Pasiliao
Networks 66 (3), 170-195, 2015
An integer programming framework for critical elements detection in graphs
A Veremyev, OA Prokopyev, EL Pasiliao
Journal of Combinatorial Optimization 28, 233-273, 2014
Exact identification of critical nodes in sparse networks via new compact formulations
A Veremyev, V Boginski, EL Pasiliao
Optimization Letters 8, 1245-1259, 2014
Identifying large robust network clusters via new compact formulations of maximum k-club problems
A Veremyev, V Boginski
European Journal of Operational Research 218 (2), 316-326, 2012
Critical nodes in river networks
S Sarker, A Veremyev, V Boginski, A Singh
Scientific reports 9 (1), 11178, 2019
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
A Veremyev, OA Prokopyev, S Butenko, EL Pasiliao
Computational Optimization and Applications 64 (1), 177-214, 2016
Minimum vertex cover problem for coupled interdependent networks with cascading failures
A Veremyev, A Sorokin, V Boginski, EL Pasiliao
European Journal of Operational Research 232 (3), 499-511, 2014
Detecting large cohesive subgroups with high clustering coefficients in social networks
Z Ertem, A Veremyev, S Butenko
Social Networks 46, 1-10, 2016
An integer programming approach for finding the most and the least central cliques
C Vogiatzis, A Veremyev, EL Pasiliao, PM Pardalos
Optimization Letters 9, 615-633, 2015
Finding groups with maximum betweenness centrality
A Veremyev, OA Prokopyev, EL Pasiliao
Optimization Methods and Software 32 (2), 369-399, 2017
Detecting critical node structures on graphs: A mathematical programming approach
JL Walteros, A Veremyev, PM Pardalos, EL Pasiliao
Networks 73 (1), 48-88, 2019
On maximum degree‐based‐quasi‐clique problem: Complexity and exact approaches
G Pastukhov, A Veremyev, V Boginski, OA Prokopyev
Networks 71 (2), 136-152, 2018
Finding maximum subgraphs with relatively large vertex connectivity
A Veremyev, OA Prokopyev, V Boginski, EL Pasiliao
European Journal of Operational Research 239 (2), 349-362, 2014
Graph-based exploration and clustering analysis of semantic spaces
A Veremyev, A Semenov, EL Pasiliao, V Boginski
Applied Network Science 4, 1-26, 2019
Finding critical links for closeness centrality
A Veremyev, OA Prokopyev, EL Pasiliao
INFORMS Journal on Computing 31 (2), 367-389, 2019
Robustness and strong attack tolerance of low-diameter networks
A Veremyev, V Boginski
Dynamics of information systems: Mathematical foundations, 137-156, 2012
Dense subgraphs in random graphs
P Balister, B Bollobás, J Sahasrabudhe, A Veremyev
Discrete Applied Mathematics 260, 66-74, 2019
Exploring social media network landscape of post-Soviet space
A Semenov, AV Mantzaris, A Nikolaev, A Veremyev, J Veijalainen, ...
IEEE Access 7, 411-426, 2018
On exact solution approaches for the longest induced path problem
D Matsypura, A Veremyev, OA Prokopyev, EL Pasiliao
European Journal of Operational Research 278 (2), 546-562, 2019
The system can't perform the operation now. Try again later.
Articles 1–20