| Publication | Date of Publication | Type |
|---|
A polyhedral approach to least cost influence maximization in social networks
Journal of Combinatorial Optimization | 2023-01-16 | Paper |
Continuous cubic formulations for cluster detection problems in networks
Mathematical Programming. Series A. Series B | 2022-11-14 | Paper |
Networks of causal relationships in the U.S. stock market
Dependence Modeling | 2022-06-24 | Paper |
A Polyhedral Approach to Least Cost Influence Maximization in Social Networks
| 2022-05-02 | 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 |
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 |
A cutting plane method for risk-constrained traveling salesman problem with random arc costs
Journal of Global Optimization | 2019-10-01 | Paper |
Analysis and design of robust network clusters with bounded diameter
| 2019-05-28 | Paper |
A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
Journal of Global Optimization | 2018-12-27 | Paper |
Mathematical programming techniques for sensor networks
Algorithms | 2018-08-20 | Paper |
Detecting robust cliques in graphs subject to uncertain edge failures
Annals of Operations Research | 2018-06-13 | Paper |
On maximum degree-based \(\gamma\)-quasi-clique problem: complexity and exact approaches
Networks | 2018-06-13 | Paper |
Minimum vertex blocker clique problem
Networks | 2018-05-23 | Paper |
Stochastic decision problems with multiple risk-averse agents
| 2018-02-06 | Paper |
New analytical lower bounds on the clique number of a graph
Optimization Methods & Software | 2017-06-21 | Paper |
A simple greedy heuristic for linear assignment interdiction
Annals of Operations Research | 2017-03-07 | Paper |
Minimum edge blocker dominating set problem
European Journal of Operational Research | 2016-10-06 | Paper |
The minimum spanning \(k\)-core problem with bounded CVaR under probabilistic edge failures
INFORMS Journal on Computing | 2016-08-12 | Paper |
Finding maximum subgraphs with relatively large vertex connectivity
European Journal of Operational Research | 2016-06-24 | Paper |
On connected dominating sets of restricted diameter
European Journal of Operational Research | 2015-07-29 | 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 |
A network-based data mining approach to portfolio selection via weighted clique relaxations
Annals of Operations Research | 2014-09-26 | 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 |
Optimization of discrete broadcast under uncertainty using conditional value-at-risk
Optimization Letters | 2014-03-14 | Paper |
Computational study of the US stock market evolution: a rank correlation-based network model
Computational Management Science | 2014-03-10 | Paper |
Robustness and strong attack tolerance of low-diameter networks
Springer Proceedings in Mathematics & Statistics | 2013-08-01 | Paper |
Topology design for on-demand dual-path routing in wireless networks
Optimization Letters | 2013-04-23 | Paper |
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
Journal of Combinatorial Optimization | 2013-04-08 | 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 |
Robust multi-sensor scheduling for multi-site surveillance
Journal of Combinatorial Optimization | 2011-06-17 | Paper |
Polynomial-time identification of robust network flows under uncertain arc failures
Optimization Letters | 2009-09-03 | Paper |
Statistical analysis of financial networks
Computational Statistics and Data Analysis | 2008-11-26 | Paper |
Optimization Techniques in Medicine
Essays and Surveys in Global Optimization | 2007-10-24 | Paper |
Matrix-based methods for college football rankings
| 2006-10-16 | Paper |
scientific article; zbMATH DE number 5064312 (Why is no real title available?)
| 2006-10-16 | Paper |
Mining market data: a network approach
Computers & Operations Research | 2006-08-14 | Paper |
Network-based Models and Algorithms in Data Mining and Knowledge Discovery
Handbook of Combinatorial Optimization | 2005-09-28 | Paper |
scientific article; zbMATH DE number 2128217 (Why is no real title available?)
| 2005-01-14 | Paper |
scientific article; zbMATH DE number 1985299 (Why is no real title available?)
| 2003-09-24 | Paper |
