Finding critical links for closeness centrality

von Veremyev, Alexander
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2019)

Graph-Based Supervised Clustering in Vector Space

von Schleider, Lily
Veröffentlicht in CSoNet (9. : 2020 : Online) Computational data and social networks (2020)

A Cutting Plane Method for Least Cost Influence Maximization

von Chen, Cheng-Lung
Veröffentlicht in CSoNet (9. : 2020 : Online) Computational data and social networks (2020)

Finding clique clusters with the highest betweenness centrality

von Rysz, Maciej
Veröffentlicht in European journal of operational research (162018)

On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs

von Veremyev, Alexander
Veröffentlicht in European journal of operational research (2022)

Target Set Selection in Social Networks with Influence and Activation Thresholds

von Oiang, Zhecheng
Veröffentlicht in CSoNet (10. : 2021 : Online) Computational data and social networks (2021)

On exact solution approaches for the longest induced path problem

von Matsypura, Dmytro
Veröffentlicht in European journal of operational research (2019)

Double-Threshold Models for Network Influence Propagation

von Semenov, Alexander
Veröffentlicht in CSoNet (9. : 2020 : Online) Computational data and social networks (2020)

Finding the most degree-central walks and paths in a graph : exact and heuristic approaches

von Matsypura, Dmytro
Veröffentlicht in European journal of operational research (2023)

An integer programming approach for fault-tolerant connected dominating sets

Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2015)

A scenario decomposition algorithm for stochastic programming problems with a class of downside risk measures

Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2015)

Minimum vertex cover problem for coupled interdependent networks with cascading failures

Veröffentlicht in European journal of operational research (2014)

Fortification against cascade propagation under uncertainty

von Gillen, Colin P.
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2021)

Efficient methods for the distance-based critical node detection problem in complex networks

von Alozie, Glory Uche
Veröffentlicht in Computers & operations research (2021)

A simple greedy heuristic for linear assignment interdiction

von Stozhkov, Vladimir
Veröffentlicht in Applied optimization and data mining (2017)

Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios

von Huang, Zhouchun
Veröffentlicht in Applied optimization and data mining (2017)

Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights

von Rysz, Maciej
Veröffentlicht in Risk management approaches in engineering applications (2018)

Finding maximum subgraphs with relatively large vertex connectivity

Veröffentlicht in European journal of operational research (2014)

Minimum edge blocker dominating set problem

Veröffentlicht in European journal of operational research (2015)