Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Petr Gregor, Torsten Mütze, and Namrata. Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 33:1-33:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{gregor_et_al:LIPIcs.ISAAC.2023.33, author = {Gregor, Petr and M\"{u}tze, Torsten and Namrata}, title = {{Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {33:1--33:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.33}, URN = {urn:nbn:de:0030-drops-193350}, doi = {10.4230/LIPIcs.ISAAC.2023.33}, annote = {Keywords: Generation, binary tree, pattern avoidance, permutation, bijection} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, and Torsten Ueckerdt. Axis-Parallel Right Angle Crossing Graphs. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 9:1-9:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{angelini_et_al:LIPIcs.ESA.2023.9, author = {Angelini, Patrizio and Bekos, Michael A. and Katheder, Julia and Kaufmann, Michael and Pfister, Maximilian and Ueckerdt, Torsten}, title = {{Axis-Parallel Right Angle Crossing Graphs}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {9:1--9:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.9}, URN = {urn:nbn:de:0030-drops-186623}, doi = {10.4230/LIPIcs.ESA.2023.9}, annote = {Keywords: Graph drawing, RAC graphs, Graph drawing algorithms} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Petr Gregor, Arturo Merino, and Torsten Mütze. The Hamilton Compression of Highly Symmetric Graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 54:1-54:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gregor_et_al:LIPIcs.MFCS.2022.54, author = {Gregor, Petr and Merino, Arturo and M\"{u}tze, Torsten}, title = {{The Hamilton Compression of Highly Symmetric Graphs}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {54:1--54:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.54}, URN = {urn:nbn:de:0030-drops-168529}, doi = {10.4230/LIPIcs.MFCS.2022.54}, annote = {Keywords: Hamilton cycle, Gray code, hypercube, permutahedron, Johnson graph, Cayley graph, abelian group, vertex-transitive} }
Published in: LIPIcs, Volume 226, 11th International Conference on Fun with Algorithms (FUN 2022)
Arturo Merino, Torsten Mütze, and Aaron Williams. All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 22:1-22:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{merino_et_al:LIPIcs.FUN.2022.22, author = {Merino, Arturo and M\"{u}tze, Torsten and Williams, Aaron}, title = {{All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {22:1--22:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.22}, URN = {urn:nbn:de:0030-drops-159928}, doi = {10.4230/LIPIcs.FUN.2022.22}, annote = {Keywords: Matroids, base exchange, Gray codes, combinatorial generation, greedy algorithms, spanning trees} }
Published in: LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Petr Gregor, Torsten Mütze, and Arturo Merino. Star Transposition Gray Codes for Multiset Permutations. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 34:1-34:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gregor_et_al:LIPIcs.STACS.2022.34, author = {Gregor, Petr and M\"{u}tze, Torsten and Merino, Arturo}, title = {{Star Transposition Gray Codes for Multiset Permutations}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.34}, URN = {urn:nbn:de:0030-drops-158448}, doi = {10.4230/LIPIcs.STACS.2022.34}, annote = {Keywords: Gray code, permutation, combination, transposition, Hamilton cycle} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Arturo Merino and Torsten Mütze. Efficient Generation of Rectangulations via Permutation Languages. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 54:1-54:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{merino_et_al:LIPIcs.SoCG.2021.54, author = {Merino, Arturo and M\"{u}tze, Torsten}, title = {{Efficient Generation of Rectangulations via Permutation Languages}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {54:1--54:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.54}, URN = {urn:nbn:de:0030-drops-138534}, doi = {10.4230/LIPIcs.SoCG.2021.54}, annote = {Keywords: Exhaustive generation, Gray code, flip graph, polytope, generic rectangulation, diagonal rectangulation, cartogram, floorplan, permutation pattern} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Petr Gregor, Ondřej Mička, and Torsten Mütze. On the Central Levels Problem. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 60:1-60:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gregor_et_al:LIPIcs.ICALP.2020.60, author = {Gregor, Petr and Mi\v{c}ka, Ond\v{r}ej and M\"{u}tze, Torsten}, title = {{On the Central Levels Problem}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {60:1--60:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.60}, URN = {urn:nbn:de:0030-drops-124678}, doi = {10.4230/LIPIcs.ICALP.2020.60}, annote = {Keywords: Gray code, Hamilton cycle, hypercube, middle levels, symmetric chain decomposition} }
Published in: LIPIcs, Volume 114, 10th International Conference on Geographic Information Science (GIScience 2018)
Gaurav Sinha, Samantha T. Arundel, Torsten Hahmann, E. Lynn Usery, Kathleen Stewart, and David M. Mark. The Landform Reference Ontology (LFRO): A Foundation for Exploring Linguistic and Geospatial Conceptualization of Landforms (Short Paper). In 10th International Conference on Geographic Information Science (GIScience 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 114, pp. 59:1-59:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{sinha_et_al:LIPIcs.GISCIENCE.2018.59, author = {Sinha, Gaurav and Arundel, Samantha T. and Hahmann, Torsten and Usery, E. Lynn and Stewart, Kathleen and Mark, David M.}, title = {{The Landform Reference Ontology (LFRO): A Foundation for Exploring Linguistic and Geospatial Conceptualization of Landforms}}, booktitle = {10th International Conference on Geographic Information Science (GIScience 2018)}, pages = {59:1--59:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-083-5}, ISSN = {1868-8969}, year = {2018}, volume = {114}, editor = {Winter, Stephan and Griffin, Amy and Sester, Monika}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GISCIENCE.2018.59}, URN = {urn:nbn:de:0030-drops-93873}, doi = {10.4230/LIPIcs.GISCIENCE.2018.59}, annote = {Keywords: landform, reference ontology, terrain reasoning, dependence, support} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Petr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, and Kaja Wille. Gray Codes and Symmetric Chains. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 66:1-66:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gregor_et_al:LIPIcs.ICALP.2018.66, author = {Gregor, Petr and J\"{a}ger, Sven and M\"{u}tze, Torsten and Sawada, Joe and Wille, Kaja}, title = {{Gray Codes and Symmetric Chains}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {66:1--66:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.66}, URN = {urn:nbn:de:0030-drops-90703}, doi = {10.4230/LIPIcs.ICALP.2018.66}, annote = {Keywords: Gray code, Hamilton cycle, hypercube, poset, symmetric chain} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Stefan Felsner, Linda Kleist, Torsten Mütze, and Leon Sering. Rainbow Cycles in Flip Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 38:1-38:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{felsner_et_al:LIPIcs.SoCG.2018.38, author = {Felsner, Stefan and Kleist, Linda and M\"{u}tze, Torsten and Sering, Leon}, title = {{Rainbow Cycles in Flip Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {38:1--38:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.38}, URN = {urn:nbn:de:0030-drops-87514}, doi = {10.4230/LIPIcs.SoCG.2018.38}, annote = {Keywords: flip graph, cycle, rainbow, Gray code, triangulation, spanning tree, matching, permutation, subset, combination} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, and Frieder Smolny. Distance-Preserving Graph Contractions. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 51:1-51:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bernstein_et_al:LIPIcs.ITCS.2018.51, author = {Bernstein, Aaron and D\"{a}ubel, Karl and Disser, Yann and Klimm, Max and M\"{u}tze, Torsten and Smolny, Frieder}, title = {{Distance-Preserving Graph Contractions}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.51}, URN = {urn:nbn:de:0030-drops-83427}, doi = {10.4230/LIPIcs.ITCS.2018.51}, annote = {Keywords: distance oracle, contraction, spanner} }
Published in: LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Petr Gregor and Torsten Mütze. Trimming and Gluing Gray Codes. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 40:1-40:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gregor_et_al:LIPIcs.STACS.2017.40, author = {Gregor, Petr and M\"{u}tze, Torsten}, title = {{Trimming and Gluing Gray Codes}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {40:1--40:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.40}, URN = {urn:nbn:de:0030-drops-69930}, doi = {10.4230/LIPIcs.STACS.2017.40}, annote = {Keywords: Gray code, subset, combination, loopless algorithm} }
Published in: LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010)
Luis Moniz Pereira and Alexandre Miguel Pinto. Tight Semantics for Logic Programs. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 134-143, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{pereira_et_al:LIPIcs.ICLP.2010.134, author = {Pereira, Luis Moniz and Pinto, Alexandre Miguel}, title = {{Tight Semantics for Logic Programs}}, booktitle = {Technical Communications of the 26th International Conference on Logic Programming}, pages = {134--143}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-17-0}, ISSN = {1868-8969}, year = {2010}, volume = {7}, editor = {Hermenegildo, Manuel and Schaub, Torsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.134}, URN = {urn:nbn:de:0030-drops-25919}, doi = {10.4230/LIPIcs.ICLP.2010.134}, annote = {Keywords: Normal Logic Programs, Relevance, Cumulativity, Stable Models, Well-Founded Semantics, Program Remainder} }
Published in: Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)
Benjamin Hiller, Torsten Klug, and Andreas Tuchscherer. Improving the perfomance of elevator systems using exact reoptimization algorithms. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{hiller_et_al:DagSemProc.09261.11, author = {Hiller, Benjamin and Torsten Klug and Andreas Tuchscherer}, title = {{Improving the perfomance of elevator systems using exact reoptimization algorithms}}, booktitle = {Models and Algorithms for Optimization in Logistics}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9261}, editor = {Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.11}, URN = {urn:nbn:de:0030-drops-21799}, doi = {10.4230/DagSemProc.09261.11}, annote = {Keywords: Elevator control, reoptimization, online optimization} }
Feedback for Dagstuhl Publishing