Youcef Magnouche

Orcid: 0009-0006-3778-703X

According to our database1, Youcef Magnouche authored at least 22 papers between 2014 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Design of survivable networks with low connectivity requirements.
Int. Trans. Oper. Res., March, 2025

2024
Distributed Tactical TE With Segment Routing.
IEEE Trans. Netw. Serv. Manag., October, 2024

Semi-Distributed Coflow Scheduling in Datacenters.
IEEE Trans. Netw. Serv. Manag., August, 2024

In-Band Network Telemetry for Efficient Congestion Mitigation.
Proceedings of the 11th International Network Optimization Conference, 2024

Alternative paths computation for congestion mitigation in segment-routing networks.
Proceedings of the 10th International Conference on Control, 2024

The Multi-commodity Flow Problem: Double Dantzig-Wolfe decomposition.
Proceedings of the 10th International Conference on Control, 2024

2023
Protected load-balancing problem: Neural-network based approximation for non-convex optimization.
Proceedings of the NOMS 2023, 2023

Safe Routing in Energy-aware IP networks.
Proceedings of the 19th International Conference on the Design of Reliable Communication Networks, 2023

The Multi-Commodity Flow Problem with Disjoint Signaling Paths: A Branch-and-Benders-Cut Algorithm.
Proceedings of the 9th International Conference on Control, 2023

2022
Constrained shortest path tour problem: Branch-and-Price algorithm.
Comput. Oper. Res., 2022

Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem.
Proceedings of the 10th International Network Optimization Conference, 2022

2021
The multi-terminal vertex separator problem: Branch-and-Cut-and-Price.
Discret. Appl. Math., 2021

Distributed Utility Maximization From the Edge in IP Networks.
Proceedings of the 17th IFIP/IEEE International Symposium on Integrated Network Management, 2021

Distributed Load Balancing From the Edge in IP Networks.
Proceedings of the ICC 2021, 2021

2020
Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm.
Optim. Lett., 2020

Model predictive control for load balancing.
Proceedings of the SIGCOMM '20: ACM SIGCOMM 2020 Conference, 2020

2019
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut.
Discret. Appl. Math., 2019

2018
The Minimum Rooted-Cycle Cover Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms. (Le problème du séparateur de poids minimum : Complexité, Polyèdres et Algorithmes).
PhD thesis, 2017

2016
The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price.
Proceedings of the International Conference on Control, 2016

2014
On minimal two-edge-connected graphs.
Proceedings of the International Conference on Control, 2014


  Loading...