Networks
How vulnerable is an undirected planar graph with respect to max flow
Networks, Volume 83, Issue 3, Page 570-586, April 2024.
Networks
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
Networks, Volume 83, Issue 3, Page 547-569, April 2024.
Networks
Generalizing Horn’s conditions for preemptive scheduling on identical parallel machines via network flow techniques
Networks, Volume 83, Issue 3, Page 527-546, April 2024.
Networks
Learning to repeatedly solve routing problems
Networks, Volume 83, Issue 3, Page 503-526, April 2024.
Networks
Asymptotic bounds for clustering problems in random graphs
Networks, Volume 83, Issue 3, Page 485-502, April 2024.
Networks
The complexity landscape of disaster‐aware network extension problems
Networks, Volume 83, Issue 3, Page 471-484, April 2024.
Networks
Maximizing SDN resilience to node‐targeted attacks through joint optimization of the primary and backup controllers placements
Networks, Volume 83, Issue 2, Page 428-467, March 2024.
Networks
Solving the routing and spectrum assignment problem, driven by combinatorial properties
Networks, Volume 83, Issue 2, Page 390-407, March 2024.
Networks
Topology reconstruction using time series data in telecommunication networks
Networks, Volume 83, Issue 2, Page 408-427, March 2024.