Identifying large robust network clusters via new compact formulations of maximum k-club problems. - Alexander Veremyev; Vladimir Boginski (Eur. J. Oper. Res., 2012)

On the maximum quasi-clique problem. - Jeffrey Pattillo; Alexander Veremyev; Sergiy Butenko; Vladimir Boginski (Discret. Appl. Math., 2013)

Calibrating probability distributions with convex-concave-convex functions: application to CDO pricing. - Alexander Veremyev; Peter Tsyurmasto; Stan Uryasev; R. Tyrrell Rockafellar (Comput. Manag. Sci., 2014)

Finding maximum subgraphs with relatively large vertex connectivity. - Alexander Veremyev; Oleg A. Prokopyev; Vladimir Boginski; Eduardo L. Pasiliao (Eur. J. Oper. Res., 2014)

Minimum vertex cover problem for coupled interdependent networks with cascading failures. - Alexander Veremyev; Alexey Sorokin; Vladimir Boginski; Eduardo L. Pasiliao (Eur. J. Oper. Res., 2014)

Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks. - Grigory Pastukhov; Alexander Veremyev; Vladimir Boginski; Eduardo L. Pasiliao (J. Comb. Optim., 2014)

An integer programming framework for critical elements detection in graphs. - Alexander Veremyev; Oleg A. Prokopyev; Eduardo L. Pasiliao (J. Comb. Optim., 2014)

Exact identification of critical nodes in sparse networks via new compact formulations. - Alexander Veremyev; Vladimir Boginski; Eduardo L. Pasiliao (Optim. Lett., 2014)

Analysis and Design of Robust Network Clusters with Bounded Diameter. - Foad Mahdavi Pajouh; Alexander Veremyev; Vladimir Boginski (Examining Robustness and Vulnerability of Networked Systems, 2014)

Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra. - Alexander Veremyev; Vladimir Boginski; Eduardo L. Pasiliao (J. Glob. Optim., 2015)

Critical nodes for distance-based connectivity and related problems in graphs. - Alexander Veremyev; Oleg A. Prokopyev; Eduardo L. Pasiliao (Networks, 2015)

Potential energy principles in networked systems and their connections to optimization problems on graphs. - Alexander Veremyev; Vladimir Boginski; Eduardo L. Pasiliao (Optim. Lett., 2015)

An integer programming approach for finding the most and the least central cliques. - Chrysafis Vogiatzis; Alexander Veremyev; Eduardo L. Pasiliao; Panos M. Pardalos (Optim. Lett., 2015)

Analysis of Viral Advertisement Re-Posting Activity in Social Media. - Alexander Semenov; Alexander G. Nikolaev; Alexander Veremyev; Vladimir Boginski; Eduardo L. Pasiliao (CSoNet, 2016)

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. - Alexander Veremyev; Oleg A. Prokopyev; Sergiy Butenko; Eduardo L. Pasiliao (Comput. Optim. Appl., 2016)

Detecting large cohesive subgroups with high clustering coefficients in social networks. - Zeynep Ertem; Alexander Veremyev; Sergiy Butenko (Soc. Networks, 2016)

Dynamic risk measures and related risk-averse decision problems. - Getachew K. Befekadu; Alexander Veremyev; Eduardo L. Pasiliao (ACC, 2017)

The Minimum Edge Compact Spanner Network Design Problem. - Tathagata Mukherjee; Alexander Veremyev; Piyush Kumar; Eduardo L. Pasiliao Jr. (CoRR, 2017)

On Laplacian spectra of parametric families of closely connected networks with application to cooperative control. - Alla R. Kammerdiner; Alexander Veremyev; Eduardo L. Pasiliao (J. Glob. Optim., 2017)

Robustness of solutions to critical node detection problems with imperfect data: a computational study. - Colin P. Gillen; Alexander Veremyev; Oleg A. Prokopyev; Eduardo L. Pasiliao (Optim. Methods Softw., 2017)

Finding groups with maximum betweenness centrality. - Alexander Veremyev; Oleg A. Prokopyev; Eduardo L. Pasiliao (Optim. Methods Softw., 2017)

Ranking Academic Advisors: Analyzing Scientific Advising Impact Using MathGenealogy Social Network. - Alexander Semenov; Alexander Veremyev; Alexander G. Nikolaev; Eduardo L. Pasiliao; Vladimir Boginski (CSoNet, 2018)

Optimization of Value-at-Risk: computational aspects of MIP formulations. - Konstantin Pavlikov; Alexander Veremyev; Eduardo L. Pasiliao (J. Oper. Res. Soc., 2018)

Critical arcs detection in influence networks. - Colin P. Gillen; Alexander Veremyev; Oleg A. Prokopyev; Eduardo L. Pasiliao (Networks, 2018)

On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches. - Grigory Pastukhov; Alexander Veremyev; Vladimir Boginski; Oleg A. Prokopyev (Networks, 2018)

Cascade of Edge Activation in Networks. - Gabriel L. Zenarosa; Alexander Veremyev; Eduardo L. Pasiliao (CSoNet, 2019)

Exploring Social Media Network Landscape of Post-Soviet Space. - Alexander Semenov; Alexander V. Mantzaris; Alexander G. Nikolaev; Alexander Veremyev; Jari Veijalainen; Eduardo L. Pasiliao; Vladimir Boginski (IEEE Access, 2019)

Exact algorithms for the minimum s-club partitioning problem. - Oleksandra Yezerska; Foad Mahdavi Pajouh; Alexander Veremyev; Sergiy Butenko (Ann. Oper. Res., 2019)

Graph-based exploration and clustering analysis of semantic spaces. - Alexander Veremyev; Alexander Semenov; Eduardo L. Pasiliao; Vladimir Boginski (Appl. Netw. Sci., 2019)

Dense subgraphs in random graphs. - Paul Balister; Béla Bollobás; Julian Sahasrabudhe; Alexander Veremyev (Discret. Appl. Math., 2019)

On exact solution approaches for the longest induced path problem. - Dmytro Matsypura; Alexander Veremyev; Oleg A. Prokopyev; Eduardo L. Pasiliao (Eur. J. Oper. Res., 2019)

Finding Critical Links for Closeness Centrality. - Alexander Veremyev; Oleg A. Prokopyev; Eduardo L. Pasiliao (INFORMS J. Comput., 2019)

Critical nodes in interdependent networks with deterministic and probabilistic cascading failures. - Alexander Veremyev; Konstantin Pavlikov; Eduardo L. Pasiliao; My T. Thai; Vladimir Boginski (J. Glob. Optim., 2019)

Detecting critical node structures on graphs: A mathematical programming approach. - Jose L. Walteros; Alexander Veremyev; Panos M. Pardalos; Eduardo L. Pasiliao (Networks, 2019)

Double-Threshold Models for Network Influence Propagation. - Alexander Semenov; Alexander Veremyev; Eduardo L. Pasiliao; Vladimir Boginski (CSoNet, 2020)

On the maximum small-world subgraph problem. - Jongeun Kim; Alexander Veremyev; Vladimir Boginski; Oleg A. Prokopyev (Eur. J. Oper. Res., 2020)

Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem. - Alexander Veremyev; Mikhail V. Goubko (CoRR, 2021)

Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees. - Mikhail V. Goubko; Alexander Veremyev (Discret. Appl. Math., 2021)

Fortification Against Cascade Propagation Under Uncertainty. - Colin P. Gillen; Alexander Veremyev; Oleg A. Prokopyev; Eduardo L. Pasiliao (INFORMS J. Comput., 2021)

Failure Mitigation and Restoration in Interdependent Networks via Mixed-Integer Optimization. - Cheng-Lung Chen; Qipeng P. Zheng; Alexander Veremyev; Eduardo L. Pasiliao; Vladimir Boginski (IEEE Trans. Netw. Sci. Eng., 2021)

On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs. - Alexander Veremyev; Vladimir Boginski; Eduardo L. Pasiliao; Oleg A. Prokopyev (Eur. J. Oper. Res., 2022)

Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches. - Dmytro Matsypura; Alexander Veremyev; Eduardo L. Pasiliao; Oleg A. Prokopyev (Eur. J. Oper. Res., 2023)

Graph-Based Approaches for Image Space Exploration and Representative Set Selection. - Alexander Veremyev; Alexander Semenov; Eduardo L. Pasiliao; Vladimir Boginski (CSoNet, 2024)

Finding groups with maximum betweenness centrality via integer programming with random path sampling. - Tomás Lagos; Oleg A. Prokopyev; Alexander Veremyev (J. Glob. Optim., 2024)

Bandpass Threshold Models for Activation and Influence Propagation in Social Networks. - Alexander Semenov; Alexander Veremyev; Eduardo L. Pasiliao; Vladimir Boginski (IEEE Access, 2025)