4 papers
Maximum independent queen set on polyominoes is NP-complete
Alexis Langlois-Rémillard, Mia MüÃig
Finding a set of vertices in a graph with no edges between them, INDSET, is a well-known NP-complete problem. The queen graph of a chessboard is constructed by taking vertices as t…
Extremal fences with polyforms
Alexis Langlois-Rémillard, Mia N. MüÃig, Ãrika Roldán
We present results around an isoperimetric problem built on polyforms: What is the biggest enclosed area one can build using polyforms in each of the three plane tessellations? We…
Complexity of chess domination problems
Alexis Langlois-Rémillard, Mia MüÃig, Ãrika Róldan
We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximum independe…
Insights from a workshop on gamification of research in mathematics and computer science
Alexis Langlois-Rémillard, Ãlise Raphael, Erika Roldan
Can outreach inspire and lead to research and vice versa? In this work, we introduce our approach to the gamification of research in mathematics and computer science through three…