Alexander Veremyev

48 papers A 1C 1Journal 40Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Bandpass Threshold Models for Activation and Influence Propagation in Social Networks. IEEE Access Alexander Semenov, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir Boginski
2025	A	`conf`	Sparsified Neural Network Architectures Inspired by Optimal Strongly Attack Tolerant Network Configurations. DIS Alexander Semenov, Alexander Veremyev, Donald McMann, Eduardo L. Pasiliao, Vladimir Boginski
2025	J	`jnl`	Ultra-small world detection in networks: subgraphs with prescribed distance distributions. Comput. Optim. Appl. Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao, Oleg A. Prokopyev
2024	J	`jnl`	Finding groups with maximum betweenness centrality via integer programming with random path sampling. J. Glob. Optim. Tomás Lagos, Oleg A. Prokopyev, Alexander Veremyev
2024	—	`conf`	Graph-Based Approaches for Image Space Exploration and Representative Set Selection. CSoNet Alexander Veremyev, Alexander Semenov, Eduardo L. Pasiliao, Vladimir Boginski
2023	J	`jnl`	Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches. Eur. J. Oper. Res. Dmytro Matsypura, Alexander Veremyev, Eduardo L. Pasiliao, Oleg A. Prokopyev
2022	J	`jnl`	On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs. Eur. J. Oper. Res. Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao, Oleg A. Prokopyev
2021	J	`jnl`	Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees. Discret. Appl. Math. Mikhail V. Goubko, Alexander Veremyev
2021	J	`jnl`	Failure Mitigation and Restoration in Interdependent Networks via Mixed-Integer Optimization. IEEE Trans. Netw. Sci. Eng. Cheng-Lung Chen, Qipeng P. Zheng, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir Boginski
2021	J	`jnl`	Fortification Against Cascade Propagation Under Uncertainty. INFORMS J. Comput. Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
2021	J	`jnl`	Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem. CoRR Alexander Veremyev, Mikhail V. Goubko
2020	J	`jnl`	Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees. CoRR Mikhail V. Goubko, Alexander Veremyev
2020	—	`conf`	Double-Threshold Models for Network Influence Propagation. CSoNet Alexander Semenov, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir Boginski
2020	J	`jnl`	On the maximum small-world subgraph problem. Eur. J. Oper. Res. Jongeun Kim, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev
2019	—	`conf`	Cascade of Edge Activation in Networks. CSoNet Gabriel L. Zenarosa, Alexander Veremyev, Eduardo L. Pasiliao
2019	J	`jnl`	Critical nodes in interdependent networks with deterministic and probabilistic cascading failures. J. Glob. Optim. Alexander Veremyev, Konstantin Pavlikov, Eduardo L. Pasiliao, My T. Thai, Vladimir Boginski
2019	J	`jnl`	Dense subgraphs in random graphs. Discret. Appl. Math. Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev
2019	J	`jnl`	Detecting critical node structures on graphs: A mathematical programming approach. Networks Jose L. Walteros, Alexander Veremyev, Panos M. Pardalos, Eduardo L. Pasiliao
2019	J	`jnl`	Exact algorithms for the minimum s-club partitioning problem. Ann. Oper. Res. Oleksandra Yezerska, Foad Mahdavi Pajouh, Alexander Veremyev, Sergiy Butenko
2019	J	`jnl`	Exploring Social Media Network Landscape of Post-Soviet Space. IEEE Access Alexander Semenov, Alexander V. Mantzaris, Alexander G. Nikolaev, Alexander Veremyev, Jari Veijalainen, Eduardo L. Pasiliao, Vladimir Boginski
2019	J	`jnl`	Finding Critical Links for Closeness Centrality. INFORMS J. Comput. Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
2019	J	`jnl`	Graph-based exploration and clustering analysis of semantic spaces. Appl. Netw. Sci. Alexander Veremyev, Alexander Semenov, Eduardo L. Pasiliao, Vladimir Boginski
2019	J	`jnl`	On exact solution approaches for the longest induced path problem. Eur. J. Oper. Res. Dmytro Matsypura, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
2018	J	`jnl`	Critical arcs detection in influence networks. Networks Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
2018	J	`jnl`	On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches. Networks Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev
2018	J	`jnl`	Optimization of Value-at-Risk: computational aspects of MIP formulations. J. Oper. Res. Soc. Konstantin Pavlikov, Alexander Veremyev, Eduardo L. Pasiliao
2018	—	`conf`	Ranking Academic Advisors: Analyzing Scientific Advising Impact Using MathGenealogy Social Network. CSoNet Alexander Semenov, Alexander Veremyev, Alexander G. Nikolaev, Eduardo L. Pasiliao, Vladimir Boginski
2017	C	`conf`	Dynamic risk measures and related risk-averse decision problems. ACC Getachew K. Befekadu, Alexander Veremyev, Eduardo L. Pasiliao
2017	J	`jnl`	Finding groups with maximum betweenness centrality. Optim. Methods Softw. Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
2017	J	`jnl`	On Laplacian spectra of parametric families of closely connected networks with application to cooperative control. J. Glob. Optim. Alla R. Kammerdiner, Alexander Veremyev, Eduardo L. Pasiliao
2017	J	`jnl`	Robustness of solutions to critical node detection problems with imperfect data: a computational study. Optim. Methods Softw. Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
2017	J	`jnl`	The Minimum Edge Compact Spanner Network Design Problem. CoRR Tathagata Mukherjee, Alexander Veremyev, Piyush Kumar, Eduardo L. Pasiliao Jr.
2016	—	`conf`	Analysis of Viral Advertisement Re-Posting Activity in Social Media. CSoNet Alexander Semenov, Alexander G. Nikolaev, Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
2016	J	`jnl`	Detecting large cohesive subgroups with high clustering coefficients in social networks. Soc. Networks Zeynep Ertem, Alexander Veremyev, Sergiy Butenko
2016	J	`jnl`	Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. Comput. Optim. Appl. Alexander Veremyev, Oleg A. Prokopyev, Sergiy Butenko, Eduardo L. Pasiliao
2015	J	`jnl`	An integer programming approach for finding the most and the least central cliques. Optim. Lett. Chrysafis Vogiatzis, Alexander Veremyev, Eduardo L. Pasiliao, Panos M. Pardalos
2015	J	`jnl`	Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra. J. Glob. Optim. Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
2015	J	`jnl`	Critical nodes for distance-based connectivity and related problems in graphs. Networks Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
2015	J	`jnl`	Potential energy principles in networked systems and their connections to optimization problems on graphs. Optim. Lett. Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
2014	J	`jnl`	An integer programming framework for critical elements detection in graphs. J. Comb. Optim. Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
2014	—	`ch.`	Analysis and Design of Robust Network Clusters with Bounded Diameter. Examining Robustness and Vulnerability of Networked Systems Foad Mahdavi Pajouh, Alexander Veremyev, Vladimir Boginski
2014	J	`jnl`	Calibrating probability distributions with convex-concave-convex functions: application to CDO pricing. Comput. Manag. Sci. Alexander Veremyev, Peter Tsyurmasto, Stan Uryasev, R. Tyrrell Rockafellar
2014	J	`jnl`	Exact identification of critical nodes in sparse networks via new compact formulations. Optim. Lett. Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
2014	J	`jnl`	Finding maximum subgraphs with relatively large vertex connectivity. Eur. J. Oper. Res. Alexander Veremyev, Oleg A. Prokopyev, Vladimir Boginski, Eduardo L. Pasiliao
2014	J	`jnl`	Minimum vertex cover problem for coupled interdependent networks with cascading failures. Eur. J. Oper. Res. Alexander Veremyev, Alexey Sorokin, Vladimir Boginski, Eduardo L. Pasiliao
2014	J	`jnl`	Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks. J. Comb. Optim. Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
2013	J	`jnl`	On the maximum quasi-clique problem. Discret. Appl. Math. Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski
2012	J	`jnl`	Identifying large robust network clusters via new compact formulations of maximum k-club problems. Eur. J. Oper. Res. Alexander Veremyev, Vladimir Boginski