4 citations · 4 across the 5 of their papers we have counts for
5 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…
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…
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…
Finite-dimensional representations of the symmetry algebra of the dihedral Dunkl--Dirac operator
Hendrik De Bie, Alexis Langlois-Rémillard, Roy Oste +1
The Dunkl--Dirac operator is a deformation of the Dirac operator by means of Dunkl derivatives. We investigate the symmetry algebra generated by the elements supercommuting with th…