Alexander Veremyev

According to our database1, Alexander Veremyev authored at least 36 papers between 2012 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On the maximum small-world subgraph problem.
Eur. J. Oper. Res., 2020

Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees.
CoRR, 2020

2019
Detecting critical node structures on graphs: A mathematical programming approach.
Networks, 2019

Critical nodes in interdependent networks with deterministic and probabilistic cascading failures.
J. Glob. Optim., 2019

Finding Critical Links for Closeness Centrality.
INFORMS J. Comput., 2019

On exact solution approaches for the longest induced path problem.
Eur. J. Oper. Res., 2019

Dense subgraphs in random graphs.
Discret. Appl. Math., 2019

Graph-based exploration and clustering analysis of semantic spaces.
Appl. Netw. Sci., 2019

Exact algorithms for the minimum s-club partitioning problem.
Ann. Oper. Res., 2019

Exploring Social Media Network Landscape of Post-Soviet Space.
IEEE Access, 2019

Cascade of Edge Activation in Networks.
Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019

2018
On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches.
Networks, 2018

Critical arcs detection in influence networks.
Networks, 2018

Optimization of Value-at-Risk: computational aspects of MIP formulations.
J. Oper. Res. Soc., 2018

Ranking Academic Advisors: Analyzing Scientific Advising Impact Using MathGenealogy Social Network.
Proceedings of the Computational Data and Social Networks - 7th International Conference, 2018

2017
Finding groups with maximum betweenness centrality.
Optim. Methods Softw., 2017

Robustness of solutions to critical node detection problems with imperfect data: a computational study.
Optim. Methods Softw., 2017

On Laplacian spectra of parametric families of closely connected networks with application to cooperative control.
J. Glob. Optim., 2017

The Minimum Edge Compact Spanner Network Design Problem.
CoRR, 2017

Dynamic risk measures and related risk-averse decision problems.
Proceedings of the 2017 American Control Conference, 2017

2016
Detecting large cohesive subgroups with high clustering coefficients in social networks.
Soc. Networks, 2016

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs.
Comput. Optim. Appl., 2016

Analysis of Viral Advertisement Re-Posting Activity in Social Media.
Proceedings of the Computational Social Networks - 5th International Conference, 2016

2015
An integer programming approach for finding the most and the least central cliques.
Optim. Lett., 2015

Potential energy principles in networked systems and their connections to optimization problems on graphs.
Optim. Lett., 2015

Critical nodes for distance-based connectivity and related problems in graphs.
Networks, 2015

Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra.
J. Glob. Optim., 2015

2014
Analysis and Design of Robust Network Clusters with Bounded Diameter.
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

Exact identification of critical nodes in sparse networks via new compact formulations.
Optim. Lett., 2014

An integer programming framework for critical elements detection in graphs.
J. Comb. Optim., 2014

Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks.
J. Comb. Optim., 2014

Minimum vertex cover problem for coupled interdependent networks with cascading failures.
Eur. J. Oper. Res., 2014

Finding maximum subgraphs with relatively large vertex connectivity.
Eur. J. Oper. Res., 2014

Calibrating probability distributions with convex-concave-convex functions: application to CDO pricing.
Comput. Manag. Sci., 2014

2013
On the maximum quasi-clique problem.
Discret. Appl. Math., 2013

2012
Identifying large robust network clusters via new compact formulations of maximum k-club problems.
Eur. J. Oper. Res., 2012


  Loading...