Published in: Dagstuhl Reports, Volume 13, Issue 10 (2024)
Andrej Bauer, Katja Berčič, Florian Rabe, Nicolas Thiéry, and Jure Taslak. Automated mathematics: integrating proofs, algorithms and data (Dagstuhl Seminar 23401). In Dagstuhl Reports, Volume 13, Issue 10, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{bauer_et_al:DagRep.13.10.1, author = {Bauer, Andrej and Ber\v{c}i\v{c}, Katja and Rabe, Florian and Thi\'{e}ry, Nicolas and Taslak, Jure}, title = {{Automated mathematics: integrating proofs, algorithms and data (Dagstuhl Seminar 23401)}}, pages = {1--23}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {13}, number = {10}, editor = {Bauer, Andrej and Ber\v{c}i\v{c}, Katja and Rabe, Florian and Thi\'{e}ry, Nicolas and Taslak, Jure}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.10.1}, URN = {urn:nbn:de:0030-drops-198319}, doi = {10.4230/DagRep.13.10.1}, annote = {Keywords: mathematical knowledge management, mathematical software, formalized mathematics, computer algebra, databases of mathematical structures} }
Published in: Dagstuhl Reports, Volume 13, Issue 8 (2024)
George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, and Albert-Jan Yzelman. Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). In Dagstuhl Reports, Volume 13, Issue 8, pp. 1-45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{karypis_et_al:DagRep.13.8.1, author = {Karypis, George and Schulz, Christian and Strash, Darren and Ajwani, Deepak and Bisseling, Rob H. and Casel, Katrin and \c{C}ataly\"{u}rek, \"{U}mit V. and Chevalier, C\'{e}dric and Chudigiewitsch, Florian and Faraj, Marcelo Fonseca and Fellows, Michael and Gottesb\"{u}ren, Lars and Heuer, Tobias and Kaya, Kamer and Lacki, Jakub and Langguth, Johannes and Li, Xiaoye Sherry and Mayer, Ruben and Meintrup, Johannes and Mizutani, Yosuke and Pellegrini, Fran\c{c}ois and Petrini, Fabrizio and Rosamond, Frances and Safro, Ilya and Schlag, Sebastian and Sharma, Roohani and Sullivan, Blair D. and U\c{c}ar, Bora and Yzelman, Albert-Jan}, title = {{Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331)}}, pages = {1--45}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {13}, number = {8}, editor = {Karypis, George and Schulz, Christian and Strash, Darren}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.8.1}, URN = {urn:nbn:de:0030-drops-198114}, doi = {10.4230/DagRep.13.8.1}, annote = {Keywords: combinatorial optimization, experimental algorithmics, parallel algorithms} }
Published in: LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)
Max Bannach, Florian Andreas Marwitz, and Till Tantau. Faster Graph Algorithms Through DAG Compression. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bannach_et_al:LIPIcs.STACS.2024.8, author = {Bannach, Max and Marwitz, Florian Andreas and Tantau, Till}, title = {{Faster Graph Algorithms Through DAG Compression}}, booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-311-9}, ISSN = {1868-8969}, year = {2024}, volume = {289}, editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.8}, URN = {urn:nbn:de:0030-drops-197188}, doi = {10.4230/LIPIcs.STACS.2024.8}, annote = {Keywords: graph compression, graph traversal, twinwidth, parameterized algorithms} }
Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, and Stéphane Vialette. Recognizing Unit Multiple Intervals Is Hard. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{ardevolmartinez_et_al:LIPIcs.ISAAC.2023.8, author = {Ard\'{e}vol Mart{\'\i}nez, Virginia and Rizzi, Romeo and Sikora, Florian and Vialette, St\'{e}phane}, title = {{Recognizing Unit Multiple Intervals Is Hard}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {8:1--8:18}, 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.8}, URN = {urn:nbn:de:0030-drops-193102}, doi = {10.4230/LIPIcs.ISAAC.2023.8}, annote = {Keywords: Interval graphs, unit multiple interval graphs, recognition, NP-hardness} }
Published in: LIPIcs, Volume 278, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023)
Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, and Angelo Montanari. LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa. In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 2:1-2:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{artale_et_al:LIPIcs.TIME.2023.2, author = {Artale, Alessandro and Geatti, Luca and Gigante, Nicola and Mazzullo, Andrea and Montanari, Angelo}, title = {{LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa}}, booktitle = {30th International Symposium on Temporal Representation and Reasoning (TIME 2023)}, pages = {2:1--2:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-298-3}, ISSN = {1868-8969}, year = {2023}, volume = {278}, editor = {Artikis, Alexander and Bruse, Florian and Hunsberger, Luke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2023.2}, URN = {urn:nbn:de:0030-drops-190927}, doi = {10.4230/LIPIcs.TIME.2023.2}, annote = {Keywords: Temporal Logic, Succinctness, LTLf, Finite Traces, Pure past LTL} }
Published in: LIPIcs, Volume 278, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023)
Alexis Baudin, Lionel Tabourier, and Clémence Magnien. LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method. In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 3:1-3:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{baudin_et_al:LIPIcs.TIME.2023.3, author = {Baudin, Alexis and Tabourier, Lionel and Magnien, Cl\'{e}mence}, title = {{LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method}}, booktitle = {30th International Symposium on Temporal Representation and Reasoning (TIME 2023)}, pages = {3:1--3:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-298-3}, ISSN = {1868-8969}, year = {2023}, volume = {278}, editor = {Artikis, Alexander and Bruse, Florian and Hunsberger, Luke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2023.3}, URN = {urn:nbn:de:0030-drops-190932}, doi = {10.4230/LIPIcs.TIME.2023.3}, annote = {Keywords: Temporal network, Link stream, k-clique, Community detection, Clique Percolation Method, Real-world interactions} }
Published in: LIPIcs, Volume 278, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023)
Saumya Shankar, Srinivas Pinisetty, and Thierry Jéron. Bounded-Memory Runtime Enforcement of Timed Properties. In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 6:1-6:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{shankar_et_al:LIPIcs.TIME.2023.6, author = {Shankar, Saumya and Pinisetty, Srinivas and J\'{e}ron, Thierry}, title = {{Bounded-Memory Runtime Enforcement of Timed Properties}}, booktitle = {30th International Symposium on Temporal Representation and Reasoning (TIME 2023)}, pages = {6:1--6:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-298-3}, ISSN = {1868-8969}, year = {2023}, volume = {278}, editor = {Artikis, Alexander and Bruse, Florian and Hunsberger, Luke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2023.6}, URN = {urn:nbn:de:0030-drops-190962}, doi = {10.4230/LIPIcs.TIME.2023.6}, annote = {Keywords: Formal methods, Runtime enforcement, Bounded-memory, Timed automata} }
Published in: LIPIcs, Volume 278, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023)
Curtis E. Dyreson. Optimization of Nonsequenced Queries Using Log-Segmented Timestamps. In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dyreson:LIPIcs.TIME.2023.13, author = {Dyreson, Curtis E.}, title = {{Optimization of Nonsequenced Queries Using Log-Segmented Timestamps}}, booktitle = {30th International Symposium on Temporal Representation and Reasoning (TIME 2023)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-298-3}, ISSN = {1868-8969}, year = {2023}, volume = {278}, editor = {Artikis, Alexander and Bruse, Florian and Hunsberger, Luke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2023.13}, URN = {urn:nbn:de:0030-drops-191036}, doi = {10.4230/LIPIcs.TIME.2023.13}, annote = {Keywords: Temporal databases, nonsequenced semantics, query evaluation, query performance} }
Published in: LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023)
Radu Iosif and Florian Zuleger. Expressiveness Results for an Inductive Logic of Separated Relations. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 20:1-20:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{iosif_et_al:LIPIcs.CONCUR.2023.20, author = {Iosif, Radu and Zuleger, Florian}, title = {{Expressiveness Results for an Inductive Logic of Separated Relations}}, booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)}, pages = {20:1--20:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-299-0}, ISSN = {1868-8969}, year = {2023}, volume = {279}, editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.20}, URN = {urn:nbn:de:0030-drops-190146}, doi = {10.4230/LIPIcs.CONCUR.2023.20}, annote = {Keywords: Separation Logic, Model Theory, Monadic Second Order Logic, Treewidth} }
Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Florian Frank, Stefan Milius, and Henning Urbat. Positive Data Languages. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 48:1-48:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{frank_et_al:LIPIcs.MFCS.2023.48, author = {Frank, Florian and Milius, Stefan and Urbat, Henning}, title = {{Positive Data Languages}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {48:1--48:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.48}, URN = {urn:nbn:de:0030-drops-185828}, doi = {10.4230/LIPIcs.MFCS.2023.48}, annote = {Keywords: Data Languages, Register Automata, MSO, Nominal Sets, Presheaves} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Markus A. Whiteland, and James Worrell. Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{baier_et_al:LIPIcs.CONCUR.2022.10, author = {Baier, Christel and Funke, Florian and Jantsch, Simon and Karimov, Toghrul and Lefaucheux, Engel and Ouaknine, Jo\"{e}l and Purser, David and Whiteland, Markus A. and Worrell, James}, title = {{Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.10}, URN = {urn:nbn:de:0030-drops-170732}, doi = {10.4230/LIPIcs.CONCUR.2022.10}, annote = {Keywords: Model checking, parametric Markov chains, distribution transformer semantics} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, and James Worrell. Skolem Meets Schanuel. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 20:1-20:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bilu_et_al:LIPIcs.MFCS.2022.20, author = {Bilu, Yuri and Luca, Florian and Nieuwveld, Joris and Ouaknine, Jo\"{e}l and Purser, David and Worrell, James}, title = {{Skolem Meets Schanuel}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {20:1--20:15}, 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.20}, URN = {urn:nbn:de:0030-drops-168180}, doi = {10.4230/LIPIcs.MFCS.2022.20}, annote = {Keywords: Skolem Problem, Skolem Conjecture, Exponential Local-Global Principle, p-adic Schanuel Conjecture} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Florian Luca, Joël Ouaknine, and James Worrell. A Universal Skolem Set of Positive Lower Density. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 73:1-73:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{luca_et_al:LIPIcs.MFCS.2022.73, author = {Luca, Florian and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{A Universal Skolem Set of Positive Lower Density}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {73:1--73:12}, 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.73}, URN = {urn:nbn:de:0030-drops-168711}, doi = {10.4230/LIPIcs.MFCS.2022.73}, annote = {Keywords: Linear Recurrence Sequences, Skolem Problem, Exponential Diophantine Equations, Sieve Methods} }
Published in: LIPIcs, Volume 232, 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)
Harry Buhrman, Bruno Loff, Subhasree Patro, and Florian Speelman. Memory Compression with Quantum Random-Access Gates. In 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 232, pp. 10:1-10:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{buhrman_et_al:LIPIcs.TQC.2022.10, author = {Buhrman, Harry and Loff, Bruno and Patro, Subhasree and Speelman, Florian}, title = {{Memory Compression with Quantum Random-Access Gates}}, booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)}, pages = {10:1--10:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-237-2}, ISSN = {1868-8969}, year = {2022}, volume = {232}, editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.10}, URN = {urn:nbn:de:0030-drops-165177}, doi = {10.4230/LIPIcs.TQC.2022.10}, annote = {Keywords: complexity theory, data structures, algorithms, quantum walk} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Florian Fontan, Pascal Lafourcade, Luc Libralesso, and Benjamin Momège. Local Search with Weighting Schemes for the CG:SHOP 2022 Competition (CG Challenge). In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 73:1-73:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fontan_et_al:LIPIcs.SoCG.2022.73, author = {Fontan, Florian and Lafourcade, Pascal and Libralesso, Luc and Mom\`{e}ge, Benjamin}, title = {{Local Search with Weighting Schemes for the CG:SHOP 2022 Competition}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {73:1--73:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.73}, URN = {urn:nbn:de:0030-drops-160811}, doi = {10.4230/LIPIcs.SoCG.2022.73}, annote = {Keywords: heuristics, vertex coloring, digital geometry} }
Feedback for Dagstuhl Publishing