Arturo I. Merino

activity

20192026

most citedOn the Two-Dimensional Knapsack Problem for Convex Polygons

3 citations · 6 across the 12 of their papers we have counts for

collaborators

18 papers

cs.DS2026

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 $(E, I)$ , a schedule consists of an independent…

math.CO2025

Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements

Sofia Brenner, Jean Cardinal, Thomas McConville +2

For an arrangement $H$ of hyperplanes in $R^{n}$ through the origin, a region is a connected subset of $R^{n} ∖ H$ . The graph of regions $G(…

math.CO2024

A Demigod's Number for the Rubik's Cube

Arturo Merino, Bernardo Subercaseaux

It is well-known by now that any state of the $3 \times 3 \times 3$ Rubik's Cube can be solved in at most 20 moves, a result often referred to as "God's Number". However, this resul…

math.CO2024

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…

cs.GT2024

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…

cs.DS2024

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.…

cs.DM2024★ 1 cited

On the Hardness of Gray Code Problems for Combinatorial Objects

Arturo Merino, Namrata, Aaron Williams

Can a list of binary strings be ordered so that consecutive strings differ in a single bit? Can a list of permutations be ordered so that consecutive permutations differ by a swap?…

math.CO2024

Graphs that admit a Hamilton path are cup-stackable

Petr Gregor, Arturo Merino, Torsten Mütze +1

Fay, Hurlbert and Tennant recently introduced a one-player game on a finite connected graph $G$ , which they called cup stacking. Stacks of cups are placed at the vertices of $G$ , a…

cs.DM2023

Traversing combinatorial 0/1-polytopes via optimization

Arturo Merino, Torsten Mütze

In this paper, we present a new framework that exploits combinatorial optimization for efficiently generating a large variety of combinatorial objects based on graphs, matroids, po…

math.CO2022

Combinatorial generation via permutation languages. V. Acyclic orientations

Jean Cardinal, Hung P. Hoang, Arturo Merino +2

In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provi…

math.CO2022

Kneser graphs are Hamiltonian

Arturo Merino, Torsten Mütze, Namrata

For integers $k \geq 1$ and $n \geq 2 k + 1$ , the Kneser graph $K (n, k)$ has as vertices all $k$ -element subsets of an $n$ -element ground set, and an edge between any two disjoint sets.…

math.CO2022

The Hamilton compression of highly symmetric graphs

Petr Gregor, Arturo Merino, Torsten Mütze

We say that a Hamilton cycle $C = (x_{1}, \dots, x_{n})$ in a graph $G$ is $k$ -symmetric, if the mapping $x_{i} \mapsto x_{i + n / k}$ for all $i = 1, \dots, n$ , where indices are considered modulo…

math.CO2021

Star transposition Gray codes for multiset permutations

Petr Gregor, Arturo Merino, Torsten Mütze

Given integers $k \geq 2$ and $a_{1}, \dots, a_{k} \geq 1$ , let $a := (a_{1}, \dots, a_{k})$ and $n := a_{1} + \dots + a_{k}$ . An $a$ -multiset permutation is a string of length…

cs.DM2021★ 2 cited

Combinatorial generation via permutation languages. IV. Elimination trees

Jean Cardinal, Arturo Merino, Torsten Mütze

An elimination tree for a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $x$ and recursing on the connected components of $G - x$ to produce…

math.CO2021

Combinatorial generation via permutation languages. III. Rectangulations

Arturo Merino, Torsten Mütze

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a vers…

cs.DS2020★ 3 cited

On the Two-Dimensional Knapsack Problem for Convex Polygons

Arturo Merino, Andreas Wiese

We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitabl…

math.CO2020

On a combinatorial generation problem of Knuth

Arturo Merino, Ondřej Mička, Torsten Mütze

The well-known middle levels conjecture asserts that for every integer $n \geq 1$ , all binary strings of length $2 (n + 1)$ with exactly $n + 1$ many 0s and 1s can be ordered cyclically…

cs.DS2019

The minimum cost query problem on matroids with uncertainty areas

Arturo I. Merino, José A. Soto

We study the minimum weight basis problem on matroid when elements' weights are uncertain. For each element we only know a set of possible values (an uncertainty area) that contain…