Vladimir Boginski

According to our database1, Vladimir Boginski authored at least 33 papers between 2004 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches.
Networks, 2018

A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique.
J. Global Optimization, 2018

Detecting robust cliques in graphs subject to uncertain edge failures.
Annals OR, 2018

2017
New analytical lower bounds on the clique number of a graph.
Optimization Methods and Software, 2017

A simple greedy heuristic for linear assignment interdiction.
Annals OR, 2017

2016
The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures.
INFORMS Journal on Computing, 2016

Analysis of Viral Advertisement Re-Posting Activity in Social Media.
Proceedings of the Computational Social Networks - 5th International Conference, 2016

2015
Potential energy principles in networked systems and their connections to optimization problems on graphs.
Optimization Letters, 2015

Special issue on optimization in military applications.
Optimization Letters, 2015

Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra.
J. Global Optimization, 2015

Minimum edge blocker dominating set problem.
European Journal of Operational Research, 2015

2014
Analysis and Design of Robust Network Clusters with Bounded Diameter.
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

Exact identification of critical nodes in sparse networks via new compact formulations.
Optimization Letters, 2014

Optimization of discrete broadcast under uncertainty using conditional value-at-risk.
Optimization Letters, 2014

Minimum vertex blocker clique problem.
Networks, 2014

Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks.
J. Comb. Optim., 2014

Minimum vertex cover problem for coupled interdependent networks with cascading failures.
European Journal of Operational Research, 2014

Finding maximum subgraphs with relatively large vertex connectivity.
European Journal of Operational Research, 2014

On connected dominating sets of restricted diameter.
European Journal of Operational Research, 2014

A network-based data mining approach to portfolio selection via weighted clique relaxations.
Annals OR, 2014

2013
Topology design for on-demand dual-path routing in wireless networks.
Optimization Letters, 2013

Computational risk management techniques for fixed charge network flow problems with uncertain arc failures.
J. Comb. Optim., 2013

On the maximum quasi-clique problem.
Discrete Applied Mathematics, 2013

Computational study of the US stock market evolution: a rank correlation-based network model.
Comput. Manag. Science, 2013

2012
Identifying large robust network clusters via new compact formulations of maximum k-club problems.
European Journal of Operational Research, 2012

2011
Robust multi-sensor scheduling for multi-site surveillance.
J. Comb. Optim., 2011

2009
Polynomial-time identification of robust network flows under uncertain arc failures.
Optimization Letters, 2009

Mathematical Programming Techniques for Sensor Networks.
Algorithms, 2009

A Retrospective Review of Social Networks.
Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009

Predicting the Nexus between Post-Secondary Education Affordability and Student Success: An Application of Network-Based Approaches.
Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009

2006
Mining market data: A network approach.
Computers & OR, 2006

2005
Statistical analysis of financial networks.
Computational Statistics & Data Analysis, 2005

2004
Network models of massive datasets.
Comput. Sci. Inf. Syst., 2004


  Loading...