3 citations · 4 across the 9 of their papers we have counts for
18 papers
Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen +1
This paper considers a framework for combinatorial variants of perpetual-scheduling problems. Given an independence system , a schedule consists of an independent…
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements
Sofia Brenner, Jean Cardinal, Thomas McConville +2
For an arrangement of hyperplanes in through the origin, a region is a connected subset of . The graph of regions $G(…
A Demigod's Number for the Rubik's Cube
Arturo Merino, Bernardo Subercaseaux
It is well-known by now that any state of the Rubik's Cube can be solved in at most 20 moves, a result often referred to as "God's Number". However, this resul…
Listing faces of polytopes
Nastaran Behrooznia, Sofia Brenner, Arturo Merino +3
This paper investigates the problem of listing faces of polytopes that represent combinatorial objects, such as hypercubes, permutahedra, associahedra, and their generalizations. F…
Impartial Selection Under Combinatorial Constraints
Javier Cembrano, Max Klimm, Arturo Merino
Impartial selection problems are concerned with the selection of one or more agents from a set based on mutual nominations from within the set. To avoid strategic nominations of th…
Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
Christoph Dürr, Arturo Merino, José A. Soto +1
We study set selection problems where the weights are uncertain. Instead of its exact weight, only an uncertainty interval containing its true weight is available for each element.…