Laboratoire d’Informatique et Systèmes

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover

Abstract. We investigate fine-grained algorithmic aspects for classical identification problems in graphs, namely, Locating-Dominating Set, and in set systems, namely, Test Cover. In the first problem, an input is a graph [Formula: see text] on [Formula: see text] vertices and an...

Dynamic Trajectory Planning for Urban Traffic Using Deep Learning-Based Traffic Prediction

Abstract Traditional trajectory planning systems in navigation applications generate routes based on the current traffi conditions at the time of departure. However, traffi dynamics are highly variable, and aroute that is initially optimal may become congested during the trip, le...

Regulation-aware combinatorial optimization of energy community formation under geographic proximity constraints

Renewable Energy Communities (RECs) enable collective self-consumption by allowing geographically proximate households to share locally generated renewable energy. While most existing studies optimize the operation of a pre-defined community, the prior problem of how to partition...