Alexander Veremyev

J. Glob. Optim., January, 2024

2023

Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., August, 2023

2022

On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

2021

Failure Mitigation and Restoration in Interdependent Networks via Mixed-Integer Optimization.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Sci. Eng., 2021

Fortification Against Cascade Propagation Under Uncertainty.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2021

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

[BibT_eX]

[DOI]

Mikhail V. Goubko

Discret. Appl. Math., 2021

Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem.

[BibT_eX]

[DOI]

Mikhail V. Goubko

CoRR, 2021

2020

On the maximum small-world subgraph problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Double-Threshold Models for Network Influence Propagation.

[BibT_eX]

[DOI]

Proceedings of the Computational Data and Social Networks - 9th International Conference, 2020

2019

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

[BibT_eX]

[DOI]

Networks, 2019

Critical nodes in interdependent networks with deterministic and probabilistic cascading failures.

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

Finding Critical Links for Closeness Centrality.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2019

On exact solution approaches for the longest induced path problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Dense subgraphs in random graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Graph-based exploration and clustering analysis of semantic spaces.

[BibT_eX]

[DOI]

Appl. Netw. Sci., 2019

Exact algorithms for the minimum s-club partitioning problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

Exploring Social Media Network Landscape of Post-Soviet Space.

[BibT_eX]

[DOI]

Alexander Semenov

Alexander V. Mantzaris

Alexander G. Nikolaev

IEEE Access, 2019

Cascade of Edge Activation in Networks.

[BibT_eX]

[DOI]

Gabriel L. Zenarosa

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

2018

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

[BibT_eX]

[DOI]

Networks, 2018

Critical arcs detection in influence networks.

[BibT_eX]

[DOI]

Networks, 2018

Optimization of Value-at-Risk: computational aspects of MIP formulations.

[BibT_eX]

[DOI]

Konstantin Pavlikov

J. Oper. Res. Soc., 2018

Ranking Academic Advisors: Analyzing Scientific Advising Impact Using MathGenealogy Social Network.

[BibT_eX]

[DOI]

Alexander Semenov

Alexander G. Nikolaev

Proceedings of the Computational Data and Social Networks - 7th International Conference, 2018

2017

Finding groups with maximum betweenness centrality.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2017

Robustness of solutions to critical node detection problems with imperfect data: a computational study.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2017

On Laplacian spectra of parametric families of closely connected networks with application to cooperative control.

[BibT_eX]

[DOI]

Alla R. Kammerdiner

J. Glob. Optim., 2017

The Minimum Edge Compact Spanner Network Design Problem.

[BibT_eX]

[DOI]

Tathagata Mukherjee

Piyush Kumar

Eduardo L. Pasiliao Jr.

CoRR, 2017

Dynamic risk measures and related risk-averse decision problems.

[BibT_eX]

[DOI]

Getachew K. Befekadu

Proceedings of the 2017 American Control Conference, 2017

2016

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

[BibT_eX]

[DOI]

Zeynep Ertem

Sergiy Butenko

Soc. Networks, 2016

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2016

Analysis of Viral Advertisement Re-Posting Activity in Social Media.

[BibT_eX]

[DOI]

Alexander Semenov

Alexander G. Nikolaev

Proceedings of the Computational Social Networks - 5th International Conference, 2016

2015

An integer programming approach for finding the most and the least central cliques.

[BibT_eX]

[DOI]

Optim. Lett., 2015

Potential energy principles in networked systems and their connections to optimization problems on graphs.

[BibT_eX]

[DOI]

Optim. Lett., 2015

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

[BibT_eX]

[DOI]

Networks, 2015

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

[BibT_eX]

[DOI]

J. Glob. Optim., 2015

2014

Analysis and Design of Robust Network Clusters with Bounded Diameter.

[BibT_eX]

[DOI]

Foad Mahdavi Pajouh

Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

Exact identification of critical nodes in sparse networks via new compact formulations.

[BibT_eX]

[DOI]

Optim. Lett., 2014

An integer programming framework for critical elements detection in graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Minimum vertex cover problem for coupled interdependent networks with cascading failures.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Finding maximum subgraphs with relatively large vertex connectivity.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

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

[BibT_eX]

[DOI]

Peter Tsyurmasto

Stan Uryasev

R. Tyrrell Rockafellar

Comput. Manag. Sci., 2014

2013

On the maximum quasi-clique problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

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

[BibT_eX]

[DOI]