default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArturo Merino
Person information
- affiliation: University of Chile, Department of Computer Science, Santiago, Chile
- affiliation (former): University of O'Higgins, Institute of Engineering Sciences, Rancagua, Chile
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation (former): Saarland University, Saarbrücken, Germany
- affiliation (former, PhD 2023): TU Berlin, Department of Mathematics, Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j11]Sofia Brenner
, Jirí Fink, Hung P. Hoang, Arturo Merino, Vincent Pilaud:
Minimum Maximal Matchings in Permutahedra. Electron. J. Comb. 33(2) (2026)- [j10]Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka:
Generating all invertible matrices by row operations. Discret. Math. 349(3): 114851 (2026) - [j9]Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze:
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements. Eur. J. Comb. 135: 104367 (2026) - [c19]Arturo Merino, Bernardo Subercaseaux:
A Demigod's Number for the Rubik's Cube. FUN 2026: 31:1-31:20 - [c18]Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen, Kevin Schewior:
Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules. ICALP 2026: 142:1-142:23 - [c17]Christoph Dürr, Arturo Merino, José A. Soto, José Verschae:
Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds. IWOCA 2026: 281-295 - [c16]Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze:
Traversing regions of supersolvable hyperplane arrangements and their lattice quotients. SODA 2026: 4953-4968 - [c15]Nastaran Behrooznia, Sofia Brenner, Arturo Merino, Torsten Mütze, Christian Rieck, Francesco Verciani:
Listing faces of polytopes. SODA 2026: 6212-6222 - [i16]Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen, Kevin Schewior:
Combinatorial Perpetual Scheduling. CoRR abs/2602.11826 (2026) - 2025
- [j8]Petr Gregor, Arturo Merino, Torsten Mütze, Francesco Verciani:
Graphs that admit a Hamilton path are cup-stackable. Discret. Math. 348(5): 114375 (2025) - [j7]Jean Cardinal, Arturo Merino, Torsten Mütze:
Combinatorial Generation via Permutation Languages. IV. Elimination Trees. ACM Trans. Algorithms 21(1): 13:1-13:41 (2025) - [c14]Waldo Gálvez, Mayank Goswami, Arturo Merino, GiBeom Park, Meng-Tsung Tsai:
Computing Diverse and Nice Triangulations. FCT 2025: 180-193 - [i15]Arturo Merino, Bernardo Subercaseaux:
A Demigod's Number for the Rubik's Cube. CoRR abs/2501.00144 (2025) - [i14]Waldo Gálvez, Mayank Goswami, Arturo Merino, GiBeom Park, Meng-Tsung Tsai, Victor Verdugo:
A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions. CoRR abs/2501.12261 (2025) - [i13]Waldo Gálvez, Mayank Goswami, Arturo Merino, GiBeom Park, Meng-Tsung Tsai:
Computing Diverse and Nice Triangulations. CoRR abs/2506.01323 (2025) - 2024
- [j6]Arturo Merino, Torsten Mütze:
Traversing Combinatorial 0/1-Polytopes via Optimization. SIAM J. Comput. 53(5): 1257-1292 (2024) - [j5]Arturo Merino, Andreas Wiese:
On the Two-Dimensional Knapsack Problem for Convex Polygons. ACM Trans. Algorithms 20(2): 16 (2024) - [c13]Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka:
Generating All Invertible Matrices by Row Operations. ISAAC 2024: 35:1-35:14 - [c12]Arturo Merino, Namrata, Aaron Williams:
On the Hardness of Gray Code Problems for Combinatorial Objects. WALCOM 2024: 103-117 - [i12]Arturo Merino, Namrata, Aaron Williams:
On the Hardness of Gray Code Problems for Combinatorial Objects. CoRR abs/2401.14963 (2024) - [i11]Christoph Dürr, Arturo Merino, José A. Soto, José Verschae:
Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds. CoRR abs/2404.17214 (2024) - [i10]Javier Cembrano, Max Klimm, Arturo Merino:
Impartial Selection Under Combinatorial Constraints. CoRR abs/2409.20477 (2024) - 2023
- [b1]Arturo Ignacio Merino Figueroa:
Combinatorial generation: greedy approaches and symmetry (Kombinatorische Generierung: Greedy-Ansätze und Symmetrie). TU Berlin, Germany, 2023 - [j4]Arturo Merino, Torsten Mütze:
Combinatorial Generation via Permutation Languages. III. Rectangulations. Discret. Comput. Geom. 70(1): 51-122 (2023) - [j3]Petr Gregor, Arturo Merino, Torsten Mütze:
Star transposition Gray codes for multiset permutations. J. Graph Theory 103(2): 212-270 (2023) - [j2]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze:
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. SIAM J. Discret. Math. 37(3): 1509-1547 (2023) - [c11]Arturo Merino, Torsten Mütze:
Traversing combinatorial 0/1-polytopes via optimization. FOCS 2023: 1282-1291 - [c10]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mütze:
Zigzagging through acyclic orientations of chordal graphs and hypergraphs. SODA 2023: 3029-3042 - [c9]Arturo Merino, Torsten Mütze, Namrata:
Kneser Graphs Are Hamiltonian. STOC 2023: 963-970 - [i9]Arturo Merino, Torsten Mütze:
Traversing combinatorial 0/1-polytopes via optimization. CoRR abs/2304.08567 (2023) - 2022
- [j1]Arturo Merino, Ondrej Micka, Torsten Mütze:
On a Combinatorial Generation Problem of Knuth. SIAM J. Comput. 51(3): 379-423 (2022) - [c8]Arturo Merino, Torsten Mütze, Aaron Williams:
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. FUN 2022: 22:1-22:28 - [c7]Petr Gregor, Arturo Merino, Torsten Mütze:
The Hamilton Compression of Highly Symmetric Graphs. MFCS 2022: 54:1-54:14 - [c6]Jean Cardinal, Arturo Merino, Torsten Mütze:
Efficient generation of elimination trees and graph associahedra. SODA 2022: 2128-2140 - [c5]Petr Gregor, Torsten Mütze, Arturo Merino:
Star Transposition Gray Codes for Multiset Permutations. STACS 2022: 34:1-34:14 - [i8]Petr Gregor, Arturo Merino, Torsten Mütze:
The Hamilton compression of highly symmetric graphs. CoRR abs/2205.08126 (2022) - [i7]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze:
Combinatorial generation via permutation languages. V. Acyclic orientations. CoRR abs/2212.03915 (2022) - 2021
- [c4]Arturo Merino, Torsten Mütze:
Efficient Generation of Rectangulations via Permutation Languages. SoCG 2021: 54:1-54:18 - [c3]Arturo Merino, Ondrej Micka, Torsten Mütze:
On a combinatorial generation problem of Knuth. SODA 2021: 735-743 - [i6]Arturo Merino, Torsten Mütze:
Combinatorial generation via permutation languages. III. Rectangulations. CoRR abs/2103.09333 (2021) - [i5]Jean Cardinal, Arturo Merino, Torsten Mütze:
Combinatorial generation via permutation languages. IV. Elimination trees. CoRR abs/2106.16204 (2021) - [i4]Petr Gregor, Arturo Merino, Torsten Mütze:
Star transposition Gray codes for multiset permutations. CoRR abs/2108.07465 (2021) - 2020
- [c2]Arturo Merino, Andreas Wiese:
On the Two-Dimensional Knapsack Problem for Convex Polygons. ICALP 2020: 84:1-84:16 - [i3]Arturo Merino, Ondrej Micka, Torsten Mütze:
On a combinatorial generation problem of Knuth. CoRR abs/2007.07164 (2020) - [i2]Arturo Merino, Andreas Wiese:
On the Two-Dimensional Knapsack Problem for Convex Polygons. CoRR abs/2007.16144 (2020)
2010 – 2019
- 2019
- [c1]Arturo Merino, José A. Soto:
The Minimum Cost Query Problem on Matroids with Uncertainty Areas. ICALP 2019: 83:1-83:14 - [i1]Arturo Merino, José A. Soto:
The minimum cost query problem on matroids with uncertainty areas. CoRR abs/1904.11668 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-20 02:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
