This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…

This paper presents a randomized algorithm that runs in $ ilde{O}(n^2)$ time and, with high probability, guarantees a 2-approximation for all pairs at distance at least $c$ in an undirected, unweighte…

The authors map the problem of finding the maximum cut of a planar graph with arbitrary weights to a minimum T-join problem in the absolute dual graph, enabling the use of shortest paths and adapting…

This paper introduces a new variant of the Traveling Salesman Problem where the goal is to find two paths connecting a set of sites while minimizing the Fréchet distance between the two paths.

This paper demonstrates that a complex deep reinforcement learning policy for power grid control can be successfully distilled into a lightweight, auditable decision tree and random forest surrogate t…

The paper proposes S3TS, a novel tree search algorithm that simultaneously handles both non-linear system models and explicit uncertainties (scenarios) for advanced energy planning, achieving near-opt…

The paper presents an algorithm for updating a Directed Minimum Spanning Tree using the weighted matroid intersection algorithm and a dynamic auxiliary graph.

This paper proves that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time.