The following pages link to Vladimir L. Boginski (Q839809):
Displaying 46 items.
- (Q297248) (redirect page) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Minimum edge blocker dominating set problem (Q319914) (← 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)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Robust multi-sensor scheduling for multi-site surveillance (Q543509) (← links)
- A network-based data mining approach to portfolio selection via weighted clique relaxations (Q744697) (← links)
- Polynomial-time identification of robust network flows under uncertain arc failures (Q839810) (← links)
- Statistical analysis of financial networks (Q957122) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- Mathematical programming techniques for sensor networks (Q1662467) (← links)
- Stochastic decision problems with multiple risk-averse agents (Q1695076) (← links)
- (Q1756797) (redirect page) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- On the maximum quasi-clique problem (Q1759884) (← links)
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
- Topology design for on-demand dual-path routing in wireless networks (Q1947619) (← 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)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
- Networks of causal relationships in the U.S. stock market (Q2148732) (← 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)
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- Computational study of the US stock market evolution: a rank correlation-based network model (Q2438061) (← links)
- Optimization of discrete broadcast under uncertainty using conditional value-at-risk (Q2439489) (← links)
- Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196) (← links)
- Mining market data: a network approach (Q2499151) (← links)
- (Q3094200) (← links)
- (Q3155246) (← links)
- The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures (Q3186660) (← links)
- (Q4429163) (← links)
- On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches (Q4565788) (← links)
- Minimum vertex blocker clique problem (Q4642478) (← links)
- New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- (Q5379104) (← links)
- Optimization Techniques in Medicine (Q5421805) (← links)
- (Q5493638) (← links)
- (Q5493660) (← links)
- Network-based Models and Algorithms in Data Mining and Knowledge Discovery (Q5692515) (← links)
