3 citations · 5 across the 2 of their papers we have counts for
4 papers
Learning Interpretable Error Functions for Combinatorial Optimization Problem Modeling
Florian Richoux, Jean-François Baffier
In Constraint Programming, constraints are usually represented as predicates allowing or forbidding combinations of values. However, some algorithms exploit a finer representation:…
Introducing multilayer stream graphs and layer centralities
Pimprenelle Parmentier, Tiphaine Viard, Benjamin Renoust +1
Graphs are commonly used in mathematics to represent some relationships between items. However, as simple objects, they sometimes fail to capture all relevant aspects of real-world…
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments
Jean-François Baffier, Yago Diez, Matias Korman
The {\em compressed stack} is a data structure designed by Barba {\em et al.} (Algorithmica 2015) that allows to reduce the amount of memory needed by an algorithm (at the cost of…
Hanabi is NP-hard, Even for Cheaters who Look at Their Cards
Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez +5
In this paper we study a cooperative card game called Hanabi from the viewpoint of algorithmic combinatorial game theory. In Hanabi, each card has one among colors and a number…