Network disconnection games: A game theoretic approach to checkpoint evaluation in networks
- 2022
- Discrete Applied Mathematics
Publications
This is our catalog of recent publications authored by IBM researchers, in collaboration with the global research community. We’re currently adding our back catalog of more than 110,000 publications. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
10 results for Mourad Baiou
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods
- 2020
- ITOR
An Algorithm to Compute the Nucleolus of Shortest Path Games
- 2019
- Algorithmica
Network strength games: the core and the nucleolus
- 2018
- Mathematical Programming
Faster Algorithms for Security Games on Matroids
- 2018
- Algorithmica
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs
- 2018
- Networks
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- 2018
- Mathematical Programming
On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs
- 2016
- Discrete Optimization
Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- 2016
- SIAM Journal on Discrete Mathematics
Stackelberg Bipartite Vertex Cover and the Preflow Algorithm
- 2015
- Algorithmica