Arturo Merino

 

Now at: University of Saarland

Email: (lastname)@math.tu-berlin.de

0000-0002-1728-6936
Bibliography on dblp
Google Scholar

Projects

• Combinatorial Structures and Algorithms in Symmetric Graphs
  DFG - Project number 413902284. Project heads: Torsten Mütze and Martin Skutella

Publications

to appear

• Combinatorial generation via permutation languages. III. Rectangulations (Arturo Merino and Torsten Mütze)
  Discret. Comput. Geom., to appear.
  Extended abstract appeared in Proc. of SoCG 2021
  DOI Bibtex
  @article{MerinoMuetze2022,
  author = {Merino, Arturo and M\"{u}tze, Torsten},
  title = {{Combinatorial generation via permutation languages. III. Rectangulations}},
  journal = {Discret. Comput. Geom.},
  year = {to appear},
  doi = {10.48550/arXiv.2103.09333},
  }
  

2022

• On a Combinatorial Generation Problem of Knuth (Arturo Merino, Ondřej Mička and Torsten Mütze)
  SIAM J. Comput., 51(3):379-423, 2022.
  Extended abstract appeared in Proc. of SODA 2021
  DOI Bibtex
  @article{MerinoMickaMuetze2022,
  author = {Merino, Arturo and Mička, Ondřej and M\"{u}tze, Torsten},
  title = {{On a Combinatorial Generation Problem of Knuth}},
  journal = {SIAM J. Comput.},
  year = {2022},
  volume = {51},
  number = {3},
  pages = {379-423},
  doi = {10.1137/20M1377394},
  }
  
• Efficient generation of elimination trees and graph associahedra (Jean Cardinal, Arturo Merino and Torsten Mütze)
  SODA 2022 – Proc. 33rd ACM-SIAM Symposium on Discrete Algorithms, pp. 2128-2140.
  DOI Bibtex
  @inproceedings{CardinalMerinoMuetze2022,
  author = {Cardinal, Jean and Merino, Arturo and Mütze, Torsten},
  booktitle = {SODA 2022 – Proc. 33rd ACM-SIAM Symposium on Discrete Algorithms},
  pages = {2128-2140},
  doi = {10.1137/1.9781611977073.84},
  title = {Efficient generation of elimination trees and graph associahedra},
  year = {2022},
  }
  
• Star Transposition Gray Codes for Multiset Permutations (Petr Gregor, Arturo Merino and Torsten Mütze)
  STACS 2022 – Proc. 39th International Symposium on Theoretical Aspects of Computer Science, pp. 34:1–34:14.
  DOI Bibtex
  @inproceedings{GregorMerinoMuetze2022,
  author = {Gregor, Petr and Merino, Arturo and M\"{u}tze, Torsten},
  booktitle = {STACS 2022 – Proc. 39th International Symposium on Theoretical Aspects of Computer Science},
  pages = {34:1--34:14},
  doi = {10.4230/LIPIcs.STACS.2022.34},
  title = {{Star Transposition Gray Codes for Multiset Permutations}},
  year = {2022},
  }
  
• The Hamilton compression of highly symmetric graphs (Petr Gregor, Arturo Merino and Torsten Mütze)
  MFCS 2022 – Proc. 47th International Symposium on Mathematical Foundations of Computer Science, pp. 54:1–54:14.
  DOI Bibtex
  @inproceedings{GregorMerinoMuetze2022a,
  author = {Gregor, Petr and Merino, Arturo and M\"{u}tze, Torsten},
  booktitle = {MFCS 2022 – Proc. 47th International Symposium on Mathematical Foundations of Computer Science},
  pages = {54:1--54:14},
  doi = {10.4230/LIPIcs.MFCS.2022.54},
  title = {{The Hamilton compression of highly symmetric graphs}},
  year = {2022},
  }
  
• All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges (Arturo Merino, Torsten Mütze and Aaron Williams)
  FUN 2022 – Proc. 11th International Conference on Fun with Algorithms, pp. 22:1–22:28.
  DOI Bibtex
  @inproceedings{MerinoMuetzeWilliams2022,
  author = {Merino, Arturo and M\"{u}tze, Torsten and Williams, Aaron},
  booktitle = {FUN 2022 – Proc. 11th International Conference on Fun with Algorithms},
  pages = {22:1--22:28},
  doi = {10.4230/LIPIcs.FUN.2022.22},
  title = {{All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges}},
  year = {2022},
  }
  

2021

• On a Combinatorial Generation Problem of Knuth (Arturo Merino, Ondřej Mička and Torsten Mütze)
  SODA 2021 – Proc. 32nd ACM-SIAM Symposium on Discrete Algorithms, pp. 735–743.
  DOI Bibtex
  @inproceedings{MerinoMickaMuetze2021,
  author = {Merino, Arturo and Mička, Ondřej and M\"{u}tze, Torsten},
  booktitle = {SODA 2021 – Proc. 32nd ACM-SIAM Symposium on Discrete Algorithms},
  pages = {735–743},
  doi = {10.1137/1.9781611976465.46},
  title = {{On a Combinatorial Generation Problem of Knuth}},
  year = {2021},
  }
  
• Efficient Generation of Rectangulations via Permutation Languages (Arturo Merino and Torsten Mütze)
  SoCG 2021 – Proc. 37th International Symposium on Computational Geometry, pp. 54:1–54:18.
  DOI Bibtex
  @inproceedings{MerinoMuetze2021,
  author = {Merino, Arturo and M\"{u}tze, Torsten},
  booktitle = {SoCG 2021 – Proc. 37th International Symposium on Computational Geometry},
  pages = {54:1--54:18},
  doi = {10.4230/LIPIcs.SoCG.2021.54},
  title = {{Efficient Generation of Rectangulations via Permutation Languages}},
  year = {2021},
  }
  

2020

• On the Two-Dimensional Knapsack Problem for Convex Polygons (Arturo Merino and Andreas Wiese)
  ICALP 2020 – Proc. 47th International Colloquium on Automata, Languages and Programming, pp. 84:1–84:16.
  DOI Bibtex
  @inproceedings{MerinoWiese2020,
  author = {Arturo Merino and Andreas Wiese},
  booktitle = {ICALP 2020 – Proc. 47th International Colloquium on Automata, Languages and Programming},
  pages = {84:1--84:16},
  doi = {10.4230/LIPIcs.ICALP.2020.84},
  title = {{On the Two-Dimensional Knapsack Problem for Convex Polygons}},
  year = {2020},
  }
  

2019

• The Minimum Cost Query Problem on Matroids with Uncertainty Areas (Arturo Merino and José A. Soto)
  ICALP 2019 – Proc. 46th International Colloquium on Automata, Languages and Programming, pp. 83:1–83:14.
  DOI Bibtex
  @inproceedings{MerinoSoto2019,
  author = {Arturo Merino and Jos{\'e} A. Soto},
  booktitle = {ICALP 2019 – Proc. 46th International Colloquium on Automata, Languages and Programming},
  pages = {83:1--83:14},
  doi = {10.4230/LIPIcs.ICALP.2019.83},
  title = {{The Minimum Cost Query Problem on Matroids with Uncertainty Areas}},
  year = {2019},
  }