The following pages link to Alexander Veremyev (Q276861):
Displayed 34 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
- Stochastic decision problems with multiple risk-averse agents (Q1695076) (← links)
- Dense subgraphs in random graphs (Q1741497) (← links)
- On the maximum quasi-clique problem (Q1759884) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Potential energy principles in networked systems and their connections to optimization problems on graphs (Q2018871) (← links)
- Networks of causal relationships in the U.S. stock market (Q2148732) (← links)
- Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees (Q2235240) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Minimum vertex cover problem for coupled interdependent networks with cascading failures (Q2255970) (← links)
- Critical nodes in interdependent networks with deterministic and probabilistic cascading failures (Q2274858) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- Calibrating probability distributions with convex-concave-convex functions: application to CDO pricing (Q2355189) (← links)
- Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196) (← links)
- (Q3094200) (← links)
- On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches (Q4565788) (← links)
- Critical arcs detection in influence networks (Q4584871) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Fortification Against Cascade Propagation Under Uncertainty (Q5084610) (← links)
- Finding Critical Links for Closeness Centrality (Q5138269) (← links)
- Finding groups with maximum betweenness centrality (Q5268927) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- (Q5379104) (← links)
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)
- Finding groups with maximum betweenness centrality via integer programming with random path sampling (Q6183091) (← links)
- On the hierarchical risk-averse control problems for diffusion processes (Q6271343) (← links)