# Alexander Veremyev

According to our database

Collaborative distances:

^{1}, Alexander Veremyev authored at least 36 papers between 2012 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

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

INFORMS J. Comput., 2019

Eur. J. Oper. Res., 2019

Discret. Appl. Math., 2019

Appl. Netw. Sci., 2019

Ann. Oper. Res., 2019

IEEE Access, 2019

Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019

2018

Networks, 2018

Networks, 2018

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

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

CoRR, 2017

Proceedings of the 2017 American Control Conference, 2017

2016

Detecting large cohesive subgroups with high clustering coefficients in social networks.

Soc. Networks, 2016

Comput. Optim. Appl., 2016

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

Networks, 2015

Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra.

J. Glob. Optim., 2015

2014

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

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

Eur. J. Oper. Res., 2014

Calibrating probability distributions with convex-concave-convex functions: application to CDO pricing.

Comput. Manag. Sci., 2014

2013

Discret. Appl. Math., 2013

2012

Identifying large robust network clusters via new compact formulations of maximum k-club problems.

Eur. J. Oper. Res., 2012