| On the maximum quasi-clique problem J Pattillo, A Veremyev, S Butenko, V Boginski Discrete Applied Mathematics 161 (1-2), 244-257, 2013 | 101 | 2013 |
| Critical nodes for distance‐based connectivity and related problems in graphs A Veremyev, OA Prokopyev, EL Pasiliao Networks 66 (3), 170-195, 2015 | 77 | 2015 |
| 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 | 74 | 2012 |
| Exact identification of critical nodes in sparse networks via new compact formulations A Veremyev, V Boginski, EL Pasiliao Optimization Letters 8 (4), 1245-1259, 2014 | 72 | 2014 |
| An integer programming framework for critical elements detection in graphs A Veremyev, OA Prokopyev, EL Pasiliao Journal of Combinatorial Optimization 28 (1), 233-273, 2014 | 69 | 2014 |
| 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 | 35 | 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 | 30 | 2014 |
| Detecting large cohesive subgroups with high clustering coefficients in social networks Z Ertem, A Veremyev, S Butenko Social Networks 46, 1-10, 2016 | 26 | 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 (4), 615-633, 2015 | 26 | 2015 |
| Finding groups with maximum betweenness centrality A Veremyev, OA Prokopyev, EL Pasiliao Optimization Methods and Software 32 (2), 369-399, 2017 | 17 | 2017 |
| 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 | 17 | 2014 |
| Robustness and strong attack tolerance of low-diameter networks A Veremyev, V Boginski Dynamics of information systems: Mathematical foundations, 137-156, 2012 | 17 | 2012 |
| Detecting critical node structures on graphs: A mathematical programming approach JL Walteros, A Veremyev, PM Pardalos, EL Pasiliao Networks 73 (1), 48-88, 2019 | 13 | 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 | 12 | 2018 |
| Robust connectivity issues in dynamic sensor networks for area surveillance under uncertainty K Kalinchenko, A Veremyev, V Boginski, DE Jeffcoat, S Uryasev Structural and Multidisciplinary Optimization 7 (2), 235-248, 2011 | 12 | 2011 |
| Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks G Pastukhov, A Veremyev, V Boginski, EL Pasiliao Journal of Combinatorial Optimization 27 (3), 462-486, 2014 | 10 | 2014 |
| Critical arcs detection in influence networks CP Gillen, A Veremyev, OA Prokopyev, EL Pasiliao Networks 71 (4), 412-431, 2018 | 8 | 2018 |
| Dense percolation in large-scale mean-field random networks is provably “explosive” A Veremyev, V Boginski, PA Krokhmal, DE Jeffcoat PloS one 7 (12), e51883, 2012 | 8 | 2012 |
| Dense subgraphs in random graphs P Balister, B Bollobás, J Sahasrabudhe, A Veremyev Discrete Applied Mathematics 260, 66-74, 2019 | 5 | 2019 |
| Optimization of Value-at-Risk: computational aspects of MIP formulations K Pavlikov, A Veremyev, EL Pasiliao Journal of the Operational Research Society 69 (1), 127-141, 2018 | 5 | 2018 |
