Alexander Veremyev

Available identifiers

zbMath Open veremyev.alexanderMaRDI QIDQ276861

List of research outcomes

Publication	Date of Publication	Type
Finding groups with maximum betweenness centrality via integer programming with random path sampling	2024-01-26	Paper
Finding the most degree-central walks and paths in a graph: exact and heuristic approaches	2023-07-10	Paper
Fortification Against Cascade Propagation Under Uncertainty	2022-06-28	Paper
Networks of causal relationships in the U.S. stock market	2022-06-24	Paper
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs	2021-11-09	Paper
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees	2021-10-21	Paper
Finding Critical Links for Closeness Centrality	2020-12-03	Paper
Exact algorithms for the minimum \(s\)-club partitioning problem	2019-10-18	Paper
On the maximum small-world subgraph problem	2019-10-15	Paper
Critical nodes in interdependent networks with deterministic and probabilistic cascading failures	2019-10-01	Paper
On exact solution approaches for the longest induced path problem	2019-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q5379104	2019-05-28	Paper
Dense subgraphs in random graphs	2019-05-03	Paper
Detecting critical node structures on graphs: A mathematical programming approach	2019-03-06	Paper
Critical arcs detection in influence networks	2018-09-04	Paper
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches	2018-06-13	Paper
Stochastic decision problems with multiple risk-averse agents	2018-02-06	Paper
Finding groups with maximum betweenness centrality	2017-06-21	Paper
On Laplacian spectra of parametric families of closely connected networks with application to cooperative control	2017-02-01	Paper
Finding maximum subgraphs with relatively large vertex connectivity	2016-06-24	Paper
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs	2016-05-04	Paper
On the hierarchical risk-averse control problems for diffusion processes	2016-03-10	Paper
Calibrating probability distributions with convex-concave-convex functions: application to CDO pricing	2015-07-21	Paper
An integer programming approach for finding the most and the least central cliques	2015-04-23	Paper
Potential energy principles in networked systems and their connections to optimization problems on graphs	2015-03-25	Paper
Minimum vertex cover problem for coupled interdependent networks with cascading failures	2015-02-18	Paper
Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra	2015-01-16	Paper
An integer programming framework for critical elements detection in graphs	2014-09-05	Paper
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks	2014-06-24	Paper
Exact identification of critical nodes in sparse networks via new compact formulations	2014-04-30	Paper
Robustness and Strong Attack Tolerance of Low-Diameter Networks	2013-08-01	Paper
On the maximum quasi-clique problem	2012-11-22	Paper
Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems	2012-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q3094200	2011-10-21	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Alexander Veremyev