default search action
Arturo Merino
Person information
- affiliation: Universidad de O'Higgins, Chile
- affiliation (former): TU Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 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) - [c12]Arturo Merino, Namrata, Aaron Williams:
On the Hardness of Gray Code Problems for Combinatorial Objects. WALCOM 2024: 103-117 - [i11]Arturo Merino, Namrata, Aaron Williams:
On the Hardness of Gray Code Problems for Combinatorial Objects. CoRR abs/2401.14963 (2024) - [i10]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) - 2023
- [b1]Arturo Merino:
Combinatorial generation: greedy approaches and symmetry (Kombinatorische Generierung: Greedy-Ansätze und Symmetrie). TU Berlin, Germany, 2023 - [j4]Arturo Merino
Combinatorial Generation via Permutation Languages. III. Rectangulations. Discret. Comput. Geom. 70(1): 51-122 (2023) - [j3]Petr Gregor
Star transposition Gray codes for multiset permutations. J. Graph Theory 103(2): 212-270 (2023) - [j2]Jean Cardinal, Hung Phuc Hoang, Arturo Merino
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
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
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
Star Transposition Gray Codes for Multiset Permutations. STACS 2022: 34:1-34:14 - [i8]Petr Gregor
The Hamilton compression of highly symmetric graphs. CoRR abs/2205.08126 (2022) - [i7]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka
Combinatorial generation via permutation languages. V. Acyclic orientations. CoRR abs/2212.03915 (2022) - 2021
- [c4]Arturo Merino
Efficient Generation of Rectangulations via Permutation Languages. SoCG 2021: 54:1-54:18 - [c3]Arturo Merino
On a combinatorial generation problem of Knuth. SODA 2021: 735-743 - [i6]Arturo Merino
Combinatorial generation via permutation languages. III. Rectangulations. CoRR abs/2103.09333 (2021) - [i5]Jean Cardinal, Arturo Merino
Combinatorial generation via permutation languages. IV. Elimination trees. CoRR abs/2106.16204 (2021) - [i4]Petr Gregor, Arturo Merino
Star transposition Gray codes for multiset permutations. CoRR abs/2108.07465 (2021) - 2020
- [c2]Arturo Merino
On the Two-Dimensional Knapsack Problem for Convex Polygons. ICALP 2020: 84:1-84:16 - [i3]Arturo Merino
On a combinatorial generation problem of Knuth. CoRR abs/2007.07164 (2020) - [i2]Arturo Merino
On the Two-Dimensional Knapsack Problem for Convex Polygons. CoRR abs/2007.16144 (2020)
2010 – 2019
- 2019
- [c1]Arturo Merino
The Minimum Cost Query Problem on Matroids with Uncertainty Areas. ICALP 2019: 83:1-83:14 - [i1]Arturo Merino
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 2024-09-21 01:43 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 and maintained by:
the dblp computer science bibliography is funded and supported by: