| Publication | Date of Publication | Type |
|---|
Ultra-small world detection in networks: subgraphs with prescribed distance distributions
Computational Optimization and Applications | 2026-01-05 | Paper |
Finding groups with maximum betweenness centrality via integer programming with random path sampling
Journal of Global Optimization | 2024-01-26 | Paper |
Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
European Journal of Operational Research | 2023-07-10 | Paper |
Fortification Against Cascade Propagation Under Uncertainty
INFORMS Journal on Computing | 2022-06-28 | Paper |
Networks of causal relationships in the U.S. stock market
Dependence Modeling | 2022-06-24 | Paper |
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
European Journal of Operational Research | 2021-11-09 | Paper |
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
Discrete Applied Mathematics | 2021-10-21 | Paper |
Finding critical links for closeness centrality
INFORMS Journal on Computing | 2020-12-03 | Paper |
Exact algorithms for the minimum \(s\)-club partitioning problem
Annals of Operations Research | 2019-10-18 | Paper |
On the maximum small-world subgraph problem
European Journal of Operational Research | 2019-10-15 | Paper |
Critical nodes in interdependent networks with deterministic and probabilistic cascading failures
Journal of Global Optimization | 2019-10-01 | Paper |
On exact solution approaches for the longest induced path problem
European Journal of Operational Research | 2019-06-26 | Paper |
| Analysis and design of robust network clusters with bounded diameter | 2019-05-28 | Paper |
Dense subgraphs in random graphs
Discrete Applied Mathematics | 2019-05-03 | Paper |
Detecting critical node structures on graphs: a mathematical programming approach
Networks | 2019-03-06 | Paper |
Critical arcs detection in influence networks
Networks | 2018-09-04 | Paper |
On maximum degree-based -quasi-clique problem: complexity and exact approaches
Networks | 2018-06-13 | Paper |
Stochastic decision problems with multiple risk-averse agents
(available as arXiv preprint) | 2018-02-06 | Paper |
Finding groups with maximum betweenness centrality
Optimization Methods & Software | 2017-06-21 | Paper |
On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
Journal of Global Optimization | 2017-02-01 | Paper |
Finding maximum subgraphs with relatively large vertex connectivity
European Journal of Operational Research | 2016-06-24 | Paper |
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
Computational Optimization and Applications | 2016-05-04 | Paper |
| On the hierarchical risk-averse control problems for diffusion processes | 2016-03-10 | Paper |
On the hierarchical risk-averse control problems for diffusion processes
(available as arXiv preprint) | 2016-01-01 | Paper |
Calibrating probability distributions with convex-concave-convex functions: application to CDO pricing
Computational Management Science | 2015-07-21 | Paper |
An integer programming approach for finding the most and the least central cliques
Optimization Letters | 2015-04-23 | Paper |
Potential energy principles in networked systems and their connections to optimization problems on graphs
Optimization Letters | 2015-03-25 | Paper |
Minimum vertex cover problem for coupled interdependent networks with cascading failures
European Journal of Operational Research | 2015-02-18 | Paper |
Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
Journal of Global Optimization | 2015-01-16 | Paper |
An integer programming framework for critical elements detection in graphs
Journal of Combinatorial Optimization | 2014-09-05 | Paper |
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
Exact identification of critical nodes in sparse networks via new compact formulations
Optimization Letters | 2014-04-30 | Paper |
Robustness and strong attack tolerance of low-diameter networks
Springer Proceedings in Mathematics & Statistics | 2013-08-01 | Paper |
On the maximum quasi-clique problem
Discrete Applied Mathematics | 2012-11-22 | Paper |
Identifying large robust network clusters via new compact formulations of maximum k-club problems
European Journal of Operational Research | 2012-08-16 | Paper |
| scientific article; zbMATH DE number 5961780 (Why is no real title available?) | 2011-10-21 | Paper |
