Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
"This is the (work in progress) book "Algorithms for Programmers". Publication as soon as possible, content is (modulo copy editing) close to final version. I will p...
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...