We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...