47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 1-1236, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{szeider_et_al:LIPIcs.MFCS.2022, title = {{LIPIcs, Volume 241, MFCS 2022, Complete Volume}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {1--1236}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022}, URN = {urn:nbn:de:0030-drops-167975}, doi = {10.4230/LIPIcs.MFCS.2022}, annote = {Keywords: LIPIcs, Volume 241, MFCS 2022, Complete Volume} }
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{szeider_et_al:LIPIcs.MFCS.2022.0, author = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {0:i--0:xviii}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.0}, URN = {urn:nbn:de:0030-drops-167981}, doi = {10.4230/LIPIcs.MFCS.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, and Kirill Simonov. Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fomin_et_al:LIPIcs.MFCS.2022.1, author = {Fomin, Fedor V. and Golovach, Petr A. and Sagunov, Danil and Simonov, Kirill}, title = {{Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {1:1--1:4}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.1}, URN = {urn:nbn:de:0030-drops-167999}, doi = {10.4230/LIPIcs.MFCS.2022.1}, annote = {Keywords: Longest path, longest cycle, fixed-parameter tractability, above guarantee parameterization, average degree, dense graph, Dirac theorem, Erd\H{o}s-Gallai theorem} }
Monika Henzinger. Modern Dynamic Data Structures (Invited Talk). In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 2:1-2:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{henzinger:LIPIcs.MFCS.2022.2, author = {Henzinger, Monika}, title = {{Modern Dynamic Data Structures}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {2:1--2:2}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.2}, URN = {urn:nbn:de:0030-drops-168009}, doi = {10.4230/LIPIcs.MFCS.2022.2}, annote = {Keywords: Differential privacy, data structures} }
Guy Avni and Thomas A. Henzinger. An Updated Survey of Bidding Games on Graphs (Invited Talk). In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 3:1-3:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{avni_et_al:LIPIcs.MFCS.2022.3, author = {Avni, Guy and Henzinger, Thomas A.}, title = {{An Updated Survey of Bidding Games on Graphs}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {3:1--3:6}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.3}, URN = {urn:nbn:de:0030-drops-168017}, doi = {10.4230/LIPIcs.MFCS.2022.3}, annote = {Keywords: Bidding games, Richman bidding, poorman bidding, mean-payoff, parity} }
Marta Kwiatkowska, Gethin Norman, David Parker, Gabriel Santos, and Rui Yan. Probabilistic Model Checking for Strategic Equilibria-Based Decision Making: Advances and Challenges (Invited Talk). In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 4:1-4:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kwiatkowska_et_al:LIPIcs.MFCS.2022.4, author = {Kwiatkowska, Marta and Norman, Gethin and Parker, David and Santos, Gabriel and Yan, Rui}, title = {{Probabilistic Model Checking for Strategic Equilibria-Based Decision Making: Advances and Challenges}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {4:1--4:22}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.4}, URN = {urn:nbn:de:0030-drops-168026}, doi = {10.4230/LIPIcs.MFCS.2022.4}, annote = {Keywords: Probabilistic model checking, stochastic games, equilibria} }
Vijay V. Vazirani. Online Bipartite Matching and Adwords (Invited Talk). In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 5:1-5:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{vazirani:LIPIcs.MFCS.2022.5, author = {Vazirani, Vijay V.}, title = {{Online Bipartite Matching and Adwords}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {5:1--5:11}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.5}, URN = {urn:nbn:de:0030-drops-168031}, doi = {10.4230/LIPIcs.MFCS.2022.5}, annote = {Keywords: matching-based market design, online algorithms, ad auctions, competitive analysis} }
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, and Saket Saurabh. Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{abhinav_et_al:LIPIcs.MFCS.2022.6, author = {Abhinav, Ankit and Bandopadhyay, Susobhan and Banik, Aritra and Kobayashi, Yasuaki and Nagano, Shunsuke and Otachi, Yota and Saurabh, Saket}, title = {{Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {6:1--6: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.6}, URN = {urn:nbn:de:0030-drops-168041}, doi = {10.4230/LIPIcs.MFCS.2022.6}, annote = {Keywords: Non-separating path, Parameterized complexity} }
Samson Abramsky and Dan Marsden. Comonadic semantics for hybrid logic. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{abramsky_et_al:LIPIcs.MFCS.2022.7, author = {Abramsky, Samson and Marsden, Dan}, title = {{Comonadic semantics for hybrid logic}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {7:1--7: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.7}, URN = {urn:nbn:de:0030-drops-168055}, doi = {10.4230/LIPIcs.MFCS.2022.7}, annote = {Keywords: comonads, model comparison games, semantic characterizations, hybrid logic, bounded fragment} }
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, and Igor Potapov. The Complexity of Periodic Energy Minimisation. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 8:1-8:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{adamson_et_al:LIPIcs.MFCS.2022.8, author = {Adamson, Duncan and Deligkas, Argyrios and Gusev, Vladimir V. and Potapov, Igor}, title = {{The Complexity of Periodic Energy Minimisation}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {8:1--8: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.8}, URN = {urn:nbn:de:0030-drops-168065}, doi = {10.4230/LIPIcs.MFCS.2022.8}, annote = {Keywords: Optimisation of periodic structures, tiling, undecidability, NP-hardness} }
Antoine Amarilli and Mikaël Monet. Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 9:1-9:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{amarilli_et_al:LIPIcs.MFCS.2022.9, author = {Amarilli, Antoine and Monet, Mika\"{e}l}, title = {{Weighted Counting of Matchings in Unbounded-Treewidth Graph Families}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {9:1--9: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.9}, URN = {urn:nbn:de:0030-drops-168078}, doi = {10.4230/LIPIcs.MFCS.2022.9}, annote = {Keywords: Treewidth, counting complexity, matchings, Fibonacci sequence} }
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, and Giordano Da Lozzo. On Upward-Planar L-Drawings of Graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{angelini_et_al:LIPIcs.MFCS.2022.10, author = {Angelini, Patrizio and Chaplick, Steven and Cornelsen, Sabine and Da Lozzo, Giordano}, title = {{On Upward-Planar L-Drawings of Graphs}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {10:1--10: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.10}, URN = {urn:nbn:de:0030-drops-168085}, doi = {10.4230/LIPIcs.MFCS.2022.10}, annote = {Keywords: graph drawing, planar L-drawings, directed graphs, bitonic st-ordering, upward planarity, series-parallel graphs} }
Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, and Maximilian Pfister. RAC Drawings of Graphs with Low Degree. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{angelini_et_al:LIPIcs.MFCS.2022.11, author = {Angelini, Patrizio and Bekos, Michael A. and Katheder, Julia and Kaufmann, Michael and Pfister, Maximilian}, title = {{RAC Drawings of Graphs with Low Degree}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {11:1--11: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.11}, URN = {urn:nbn:de:0030-drops-168090}, doi = {10.4230/LIPIcs.MFCS.2022.11}, annote = {Keywords: Graph Drawing, RAC graphs, Straight-line and bent drawings} }
David Auger, Pierre Coucheney, and Loric Duhazé. Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{auger_et_al:LIPIcs.MFCS.2022.12, author = {Auger, David and Coucheney, Pierre and Duhaz\'{e}, Loric}, title = {{Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {12:1--12: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.12}, URN = {urn:nbn:de:0030-drops-168103}, doi = {10.4230/LIPIcs.MFCS.2022.12}, annote = {Keywords: Rotor-routing, Rotor Walk, Reachability Problem, Game Theory, Tree-like Multigraph} }
Amotz Bar-Noy, David Peleg, Mor Perry, and Dror Rawitz. Graph Realization of Distance Sets. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{barnoy_et_al:LIPIcs.MFCS.2022.13, author = {Bar-Noy, Amotz and Peleg, David and Perry, Mor and Rawitz, Dror}, title = {{Graph Realization of Distance Sets}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {13:1--13: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.13}, URN = {urn:nbn:de:0030-drops-168119}, doi = {10.4230/LIPIcs.MFCS.2022.13}, annote = {Keywords: Graph Realization, distance realization, network design} }
Amotz Bar-Noy, Toni Böhnlein, David Peleg, and Dror Rawitz. On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{barnoy_et_al:LIPIcs.MFCS.2022.14, author = {Bar-Noy, Amotz and B\"{o}hnlein, Toni and Peleg, David and Rawitz, Dror}, title = {{On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {14:1--14: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.14}, URN = {urn:nbn:de:0030-drops-168121}, doi = {10.4230/LIPIcs.MFCS.2022.14}, annote = {Keywords: Graph Realization, Bipartite Graphs, Degree Sequences, Graphic Sequences, Bigraphic Sequences, Approximate Realization, Multigraph Realization} }
Bartosz Bednarczyk and Reijo Jaakkola. Towards a Model Theory of Ordered Logics: Expressivity and Interpolation. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 15:1-15:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bednarczyk_et_al:LIPIcs.MFCS.2022.15, author = {Bednarczyk, Bartosz and Jaakkola, Reijo}, title = {{Towards a Model Theory of Ordered Logics: Expressivity and Interpolation}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {15:1--15: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.15}, URN = {urn:nbn:de:0030-drops-168132}, doi = {10.4230/LIPIcs.MFCS.2022.15}, annote = {Keywords: ordered fragments, fluted fragment, guarded fragment, model theory, Craig Interpolation Property, expressive power, model checking} }
Gal Beniamini. Algebraic Representations of Unique Bipartite Perfect Matching. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 16:1-16:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{beniamini:LIPIcs.MFCS.2022.16, author = {Beniamini, Gal}, title = {{Algebraic Representations of Unique Bipartite Perfect Matching}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {16:1--16:17}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.16}, URN = {urn:nbn:de:0030-drops-168140}, doi = {10.4230/LIPIcs.MFCS.2022.16}, annote = {Keywords: Bipartite Perfect Matching, Boolean Functions, Partially Ordered Sets} }
Benjamin Aram Berendsohn, Simona Boyadzhiyska, and László Kozma. Fixed-Point Cycles and Approximate EFX Allocations. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 17:1-17:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{berendsohn_et_al:LIPIcs.MFCS.2022.17, author = {Berendsohn, Benjamin Aram and Boyadzhiyska, Simona and Kozma, L\'{a}szl\'{o}}, title = {{Fixed-Point Cycles and Approximate EFX Allocations}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {17:1--17:13}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.17}, URN = {urn:nbn:de:0030-drops-168153}, doi = {10.4230/LIPIcs.MFCS.2022.17}, annote = {Keywords: fixed-point, zero-sum cycle, Ramsey theory, fair allocation, EFX} }
C. S. Bhargav, Sagnik Dutta, and Nitin Saxena. Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bhargav_et_al:LIPIcs.MFCS.2022.18, author = {Bhargav, C. S. and Dutta, Sagnik and Saxena, Nitin}, title = {{Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {18:1--18:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.18}, URN = {urn:nbn:de:0030-drops-168161}, doi = {10.4230/LIPIcs.MFCS.2022.18}, annote = {Keywords: polynomials, lower bounds, algebraic circuits, proof barrier, fibonacci numbers} }
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, and Rogers Mathew. Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bhyravarapu_et_al:LIPIcs.MFCS.2022.19, author = {Bhyravarapu, Sriram and Kalyanasundaram, Subrahmanyam and Mathew, Rogers}, title = {{Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {19:1--19: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.19}, URN = {urn:nbn:de:0030-drops-168173}, doi = {10.4230/LIPIcs.MFCS.2022.19}, annote = {Keywords: Conflict-free coloring, Interval graphs, Bipartite graphs, Claw-free graphs} }
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.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} }
Niclas Boehmer, Klaus Heeger, and Rolf Niedermeier. Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 21:1-21:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{boehmer_et_al:LIPIcs.MFCS.2022.21, author = {Boehmer, Niclas and Heeger, Klaus and Niedermeier, Rolf}, title = {{Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {21:1--21: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.21}, URN = {urn:nbn:de:0030-drops-168194}, doi = {10.4230/LIPIcs.MFCS.2022.21}, annote = {Keywords: Stable Marriage, Stable Roommates, adapting to changing preferences, NP-hardness, W\lbrack1\rbrack-hardness, XP, FPT, master lists, incremental algorithms} }
Dominik Bojko, Karol Gotfryd, Dariusz R. Kowalski, and Dominik Pająk. Tree Exploration in Dual-Memory Model. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bojko_et_al:LIPIcs.MFCS.2022.22, author = {Bojko, Dominik and Gotfryd, Karol and Kowalski, Dariusz R. and Paj\k{a}k, Dominik}, title = {{Tree Exploration in Dual-Memory Model}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {22:1--22:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.22}, URN = {urn:nbn:de:0030-drops-168207}, doi = {10.4230/LIPIcs.MFCS.2022.22}, annote = {Keywords: Graph exploration, agent, memory, tree, deterministic algorithms, lower bound} }
Ilario Bonacina, Nicola Galesi, and Massimo Lauria. On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bonacina_et_al:LIPIcs.MFCS.2022.23, author = {Bonacina, Ilario and Galesi, Nicola and Lauria, Massimo}, title = {{On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {23:1--23: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.23}, URN = {urn:nbn:de:0030-drops-168211}, doi = {10.4230/LIPIcs.MFCS.2022.23}, annote = {Keywords: polynomial calculus, sum-of-squares, roots of unity, knapsack} }
Robert I. Booth and Titouan Carette. Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 24:1-24:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{booth_et_al:LIPIcs.MFCS.2022.24, author = {Booth, Robert I. and Carette, Titouan}, title = {{Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {24:1--24: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.24}, URN = {urn:nbn:de:0030-drops-168225}, doi = {10.4230/LIPIcs.MFCS.2022.24}, annote = {Keywords: ZX-calculus, completeness, quantum, stabiliser, qudits} }
Guido Brückner, Ignaz Rutter, and Peter Stumpf. Extending Partial Representations of Circle Graphs in Near-Linear Time. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bruckner_et_al:LIPIcs.MFCS.2022.25, author = {Br\"{u}ckner, Guido and Rutter, Ignaz and Stumpf, Peter}, title = {{Extending Partial Representations of Circle Graphs in Near-Linear Time}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {25:1--25: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.25}, URN = {urn:nbn:de:0030-drops-168233}, doi = {10.4230/LIPIcs.MFCS.2022.25}, annote = {Keywords: circle graphs, partial representation extension, split decomposition tree, recognition algorithm} }
Martin Bullinger. Boundaries to Single-Agent Stability in Additively Separable Hedonic Games. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bullinger:LIPIcs.MFCS.2022.26, author = {Bullinger, Martin}, title = {{Boundaries to Single-Agent Stability in Additively Separable Hedonic Games}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {26:1--26: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.26}, URN = {urn:nbn:de:0030-drops-168249}, doi = {10.4230/LIPIcs.MFCS.2022.26}, annote = {Keywords: Coalition Formation, Hedonic Games, Stability} }
Jin-Yi Cai and Daniel P. Szabo. Bounded Degree Nonnegative Counting CSP. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cai_et_al:LIPIcs.MFCS.2022.27, author = {Cai, Jin-Yi and Szabo, Daniel P.}, title = {{Bounded Degree Nonnegative Counting CSP}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {27:1--27:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.27}, URN = {urn:nbn:de:0030-drops-168250}, doi = {10.4230/LIPIcs.MFCS.2022.27}, annote = {Keywords: Computational Counting Complexity, Constraint Satisfaction Problems, Counting CSPs, Complexity Dichotomy, Nonnegative Counting CSP, Graph Homomorphisms} }
Olivier Carton and Gaëtan Douéneau-Tabot. Continuous Rational Functions Are Deterministic Regular. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 28:1-28:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{carton_et_al:LIPIcs.MFCS.2022.28, author = {Carton, Olivier and Dou\'{e}neau-Tabot, Ga\"{e}tan}, title = {{Continuous Rational Functions Are Deterministic Regular}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {28:1--28:13}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.28}, URN = {urn:nbn:de:0030-drops-168268}, doi = {10.4230/LIPIcs.MFCS.2022.28}, annote = {Keywords: infinite words, rational functions, determinization, continuity, streaming string transducers, two-way transducers} }
Radovan Červený, Pratibha Choudhary, and Ondřej Suchý. On Kernels for d-Path Vertex Cover. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 29:1-29:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cerveny_et_al:LIPIcs.MFCS.2022.29, author = {\v{C}erven\'{y}, Radovan and Choudhary, Pratibha and Such\'{y}, Ond\v{r}ej}, title = {{On Kernels for d-Path Vertex Cover}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {29:1--29: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.29}, URN = {urn:nbn:de:0030-drops-168279}, doi = {10.4230/LIPIcs.MFCS.2022.29}, annote = {Keywords: Parameterized complexity, Kernelization, d-Hitting Set, d-Path Vertex Cover, Expansion Lemma} }
Supratik Chakraborty and S. Akshay. On Synthesizing Computable Skolem Functions for First Order Logic. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chakraborty_et_al:LIPIcs.MFCS.2022.30, author = {Chakraborty, Supratik and Akshay, S.}, title = {{On Synthesizing Computable Skolem Functions for First Order Logic}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {30:1--30: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.30}, URN = {urn:nbn:de:0030-drops-168285}, doi = {10.4230/LIPIcs.MFCS.2022.30}, annote = {Keywords: Skolem functions, Automated, Synthesis, First order logic, Computability} }
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, and Yann Vaxès. Sample Compression Schemes for Balls in Graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 31:1-31:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chalopin_et_al:LIPIcs.MFCS.2022.31, author = {Chalopin, J\'{e}r\'{e}mie and Chepoi, Victor and Mc Inerney, Fionn and Ratel, S\'{e}bastien and Vax\`{e}s, Yann}, title = {{Sample Compression Schemes for Balls in Graphs}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {31:1--31: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.31}, URN = {urn:nbn:de:0030-drops-168298}, doi = {10.4230/LIPIcs.MFCS.2022.31}, annote = {Keywords: Proper Sample Compression Schemes, Balls, Graphs, VC-dimension} }
Yijia Chen, Jörg Flum, Mingjun Liu, and Zhiyang Xun. On Algorithms Based on Finitely Many Homomorphism Counts. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chen_et_al:LIPIcs.MFCS.2022.32, author = {Chen, Yijia and Flum, J\"{o}rg and Liu, Mingjun and Xun, Zhiyang}, title = {{On Algorithms Based on Finitely Many Homomorphism Counts}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {32:1--32: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.32}, URN = {urn:nbn:de:0030-drops-168301}, doi = {10.4230/LIPIcs.MFCS.2022.32}, annote = {Keywords: homomorphism numbers, hom algorithms, adaptive hom algorithms} }
Dmitry Chistikov, Christoph Haase, Zahra Hadizadeh, and Alessio Mansutti. Higher-Order Quantified Boolean Satisfiability. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 33:1-33:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chistikov_et_al:LIPIcs.MFCS.2022.33, author = {Chistikov, Dmitry and Haase, Christoph and Hadizadeh, Zahra and Mansutti, Alessio}, title = {{Higher-Order Quantified Boolean Satisfiability}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {33:1--33: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.33}, URN = {urn:nbn:de:0030-drops-168313}, doi = {10.4230/LIPIcs.MFCS.2022.33}, annote = {Keywords: Boolean satisfiability problem, higher-order Boolean functions, weak k-EXP hierarchies, non-elementary complexity, Presburger arithmetic} }
Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, and Carsten Thomassen. On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{christiansen_et_al:LIPIcs.MFCS.2022.34, author = {Christiansen, Aleksander B. G. and Holm, Jacob and Rotenberg, Eva and Thomassen, Carsten}, title = {{On Dynamic \alpha + 1 Arboricity Decomposition and Out-Orientation}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {34:1--34: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.34}, URN = {urn:nbn:de:0030-drops-168320}, doi = {10.4230/LIPIcs.MFCS.2022.34}, annote = {Keywords: Dynamic graphs, bounded arboricity, data structures} }
Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, and Benoît Valiron. LO_v-Calculus: A Graphical Language for Linear Optical Quantum Circuits. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 35:1-35:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{clement_et_al:LIPIcs.MFCS.2022.35, author = {Cl\'{e}ment, Alexandre and Heurtel, Nicolas and Mansfield, Shane and Perdrix, Simon and Valiron, Beno\^{i}t}, title = {{LO\underlinev-Calculus: A Graphical Language for Linear Optical Quantum Circuits}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {35:1--35:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.35}, URN = {urn:nbn:de:0030-drops-168334}, doi = {10.4230/LIPIcs.MFCS.2022.35}, annote = {Keywords: Quantum Computing, Graphical Language, Linear Optical Circuits, Linear Optical Quantum Computing, Completeness} }
Alexandre Clément and Simon Perdrix. Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 36:1-36:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{clement_et_al:LIPIcs.MFCS.2022.36, author = {Cl\'{e}ment, Alexandre and Perdrix, Simon}, title = {{Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {36:1--36: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.36}, URN = {urn:nbn:de:0030-drops-168348}, doi = {10.4230/LIPIcs.MFCS.2022.36}, annote = {Keywords: Quantum computing, Graphical language, Coherent control, Completeness, Resource optimisation, NP-hardness} }
Thomas Colcombet and Arthur Jaquard. A Complexity Approach to Tree Algebras: the Polynomial Case. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 37:1-37:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{colcombet_et_al:LIPIcs.MFCS.2022.37, author = {Colcombet, Thomas and Jaquard, Arthur}, title = {{A Complexity Approach to Tree Algebras: the Polynomial Case}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {37:1--37: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.37}, URN = {urn:nbn:de:0030-drops-168357}, doi = {10.4230/LIPIcs.MFCS.2022.37}, annote = {Keywords: Tree algebra, nominal automata, language theory} }
Nadia Creignou, Arnaud Durand, and Heribert Vollmer. Enumeration Classes Defined by Circuits. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 38:1-38:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{creignou_et_al:LIPIcs.MFCS.2022.38, author = {Creignou, Nadia and Durand, Arnaud and Vollmer, Heribert}, title = {{Enumeration Classes Defined by Circuits}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {38:1--38: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.38}, URN = {urn:nbn:de:0030-drops-168364}, doi = {10.4230/LIPIcs.MFCS.2022.38}, annote = {Keywords: Computational complexity, enumeration problem, Boolean circuit} }
Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, and James Worrell. Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 39:1-39:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dcosta_et_al:LIPIcs.MFCS.2022.39, author = {D'Costa, Julian and Lefaucheux, Engel and Neumann, Eike and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {39:1--39: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.39}, URN = {urn:nbn:de:0030-drops-168374}, doi = {10.4230/LIPIcs.MFCS.2022.39}, annote = {Keywords: Discrete linear dynamical systems, Program termination, Compact semialgebraic sets, Uniform termination bounds} }
Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, and James Worrell. The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 40:1-40:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dcosta_et_al:LIPIcs.MFCS.2022.40, author = {D'Costa, Julian and Karimov, Toghrul and Majumdar, Rupak and Ouaknine, Jo\"{e}l and Salamati, Mahmoud and Worrell, James}, title = {{The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {40:1--40:13}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.40}, URN = {urn:nbn:de:0030-drops-168380}, doi = {10.4230/LIPIcs.MFCS.2022.40}, annote = {Keywords: pseudo-orbits, Orbit problem, Skolem problem, linear dynamical systems, reachability} }
Mingyang Deng, Virginia Vassilevska Williams, and Ziqian Zhong. New Lower Bounds and Upper Bounds for Listing Avoidable Vertices. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 41:1-41:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{deng_et_al:LIPIcs.MFCS.2022.41, author = {Deng, Mingyang and Vassilevska Williams, Virginia and Zhong, Ziqian}, title = {{New Lower Bounds and Upper Bounds for Listing Avoidable Vertices}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {41:1--41: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.41}, URN = {urn:nbn:de:0030-drops-168392}, doi = {10.4230/LIPIcs.MFCS.2022.41}, annote = {Keywords: Avoidable Vertex, Fine-Grained Complexity} }
Dariusz Dereniowski and Izajasz Wrosz. Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 42:1-42:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dereniowski_et_al:LIPIcs.MFCS.2022.42, author = {Dereniowski, Dariusz and Wrosz, Izajasz}, title = {{Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {42:1--42: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.42}, URN = {urn:nbn:de:0030-drops-168405}, doi = {10.4230/LIPIcs.MFCS.2022.42}, annote = {Keywords: binary search, graph search, approximation algorithm, query complexity} }
Ruiwen Dong. On the Identity Problem for Unitriangular Matrices of Dimension Four. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 43:1-43:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dong:LIPIcs.MFCS.2022.43, author = {Dong, Ruiwen}, title = {{On the Identity Problem for Unitriangular Matrices of Dimension Four}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {43:1--43: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.43}, URN = {urn:nbn:de:0030-drops-168415}, doi = {10.4230/LIPIcs.MFCS.2022.43}, annote = {Keywords: identity problem, matrix semigroups, unitriangular matrices} }
Matthew Earnshaw and Paweł Sobociński. Regular Monoidal Languages. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 44:1-44:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{earnshaw_et_al:LIPIcs.MFCS.2022.44, author = {Earnshaw, Matthew and Soboci\'{n}ski, Pawe{\l}}, title = {{Regular Monoidal Languages}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {44:1--44: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.44}, URN = {urn:nbn:de:0030-drops-168425}, doi = {10.4230/LIPIcs.MFCS.2022.44}, annote = {Keywords: monoidal categories, string diagrams, formal language theory, cartesian restriction categories} }
Anton Ehrmanntraut, Fabian Egidy, and Christian Glaßer. Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 45:1-45:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ehrmanntraut_et_al:LIPIcs.MFCS.2022.45, author = {Ehrmanntraut, Anton and Egidy, Fabian and Gla{\ss}er, Christian}, title = {{Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {45:1--45: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.45}, URN = {urn:nbn:de:0030-drops-168435}, doi = {10.4230/LIPIcs.MFCS.2022.45}, annote = {Keywords: computational complexity, promise classes, proof complexity, complete sets, oracle construction} }
Nicolas El Maalouly and Raphael Steiner. Exact Matching in Graphs of Bounded Independence Number. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 46:1-46:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{elmaalouly_et_al:LIPIcs.MFCS.2022.46, author = {El Maalouly, Nicolas and Steiner, Raphael}, title = {{Exact Matching in Graphs of Bounded Independence Number}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {46:1--46: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.46}, URN = {urn:nbn:de:0030-drops-168447}, doi = {10.4230/LIPIcs.MFCS.2022.46}, annote = {Keywords: Perfect Matching, Exact Matching, Independence Number, Parameterized Complexity} }
Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, and Nikita Slezkin. CNF Encodings of Parity. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 47:1-47:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{emdin_et_al:LIPIcs.MFCS.2022.47, author = {Emdin, Gregory and Kulikov, Alexander S. and Mihajlin, Ivan and Slezkin, Nikita}, title = {{CNF Encodings of Parity}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {47:1--47: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.47}, URN = {urn:nbn:de:0030-drops-168455}, doi = {10.4230/LIPIcs.MFCS.2022.47}, annote = {Keywords: encoding, parity, lower bounds, circuits, CNF} }
Ronald Fagin, Jonathan Lenchner, Nikhil Vyas, and Ryan Williams. On the Number of Quantifiers as a Complexity Measure. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 48:1-48:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fagin_et_al:LIPIcs.MFCS.2022.48, author = {Fagin, Ronald and Lenchner, Jonathan and Vyas, Nikhil and Williams, Ryan}, title = {{On the Number of Quantifiers as a Complexity Measure}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {48:1--48: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.48}, URN = {urn:nbn:de:0030-drops-168460}, doi = {10.4230/LIPIcs.MFCS.2022.48}, annote = {Keywords: number of quantifiers, multi-structural games, complexity measure, s-t connectivity, trees, rooted trees} }
Alexandre Fernandez, Luidnel Maignan, and Antoine Spicher. Non-Determinism in Lindenmayer Systems and Global Transformations. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 49:1-49:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fernandez_et_al:LIPIcs.MFCS.2022.49, author = {Fernandez, Alexandre and Maignan, Luidnel and Spicher, Antoine}, title = {{Non-Determinism in Lindenmayer Systems and Global Transformations}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {49:1--49:13}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.49}, URN = {urn:nbn:de:0030-drops-168470}, doi = {10.4230/LIPIcs.MFCS.2022.49}, annote = {Keywords: Global Transformations, Non-deterministic Dynamical Systems, Lindenmayer Systems, Category Theory} }
Séverine Fratani, Guillaume Maurras, and Pierre-Alain Reynier. A Robust Class of Languages of 2-Nested Words. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 50:1-50:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fratani_et_al:LIPIcs.MFCS.2022.50, author = {Fratani, S\'{e}verine and Maurras, Guillaume and Reynier, Pierre-Alain}, title = {{A Robust Class of Languages of 2-Nested Words}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {50:1--50: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.50}, URN = {urn:nbn:de:0030-drops-168485}, doi = {10.4230/LIPIcs.MFCS.2022.50}, annote = {Keywords: Nested word, Determinization, Indexed languages} }
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, and Prafullkumar Tale. Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 51:1-51:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{galby_et_al:LIPIcs.MFCS.2022.51, author = {Galby, Esther and Khazaliya, Liana and Mc Inerney, Fionn and Sharma, Roohani and Tale, Prafullkumar}, title = {{Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {51:1--51: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.51}, URN = {urn:nbn:de:0030-drops-168496}, doi = {10.4230/LIPIcs.MFCS.2022.51}, annote = {Keywords: Metric Dimension, Parameterized Complexity, Feedback Vertex Set} }
Timo Gervens and Martin Grohe. Graph Similarity Based on Matrix Norms. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 52:1-52:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gervens_et_al:LIPIcs.MFCS.2022.52, author = {Gervens, Timo and Grohe, Martin}, title = {{Graph Similarity Based on Matrix Norms}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {52:1--52: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.52}, URN = {urn:nbn:de:0030-drops-168509}, doi = {10.4230/LIPIcs.MFCS.2022.52}, annote = {Keywords: graph similarity, approximate graph isomorphism, graph matching} }
Mingyang Gong, Jing Fan, Guohui Lin, and Eiji Miyano. Approximation Algorithms for Covering Vertices by Long Paths. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 53:1-53:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gong_et_al:LIPIcs.MFCS.2022.53, author = {Gong, Mingyang and Fan, Jing and Lin, Guohui and Miyano, Eiji}, title = {{Approximation Algorithms for Covering Vertices by Long Paths}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {53:1--53: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.53}, URN = {urn:nbn:de:0030-drops-168517}, doi = {10.4230/LIPIcs.MFCS.2022.53}, annote = {Keywords: Path cover, k-path, local improvement, amortized analysis, approximation algorithm} }
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.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} }
Tim A. Hartmann and Stefan Lendl. Dispersing Obnoxious Facilities on Graphs by Rounding Distances. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 55:1-55:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hartmann_et_al:LIPIcs.MFCS.2022.55, author = {Hartmann, Tim A. and Lendl, Stefan}, title = {{Dispersing Obnoxious Facilities on Graphs by Rounding Distances}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {55:1--55: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.55}, URN = {urn:nbn:de:0030-drops-168536}, doi = {10.4230/LIPIcs.MFCS.2022.55}, annote = {Keywords: facility location, parameterized complexity, packing} }
Ishay Haviv and Michal Parnas. On the Binary and Boolean Rank of Regular Matrices. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 56:1-56:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{haviv_et_al:LIPIcs.MFCS.2022.56, author = {Haviv, Ishay and Parnas, Michal}, title = {{On the Binary and Boolean Rank of Regular Matrices}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {56:1--56: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.56}, URN = {urn:nbn:de:0030-drops-168545}, doi = {10.4230/LIPIcs.MFCS.2022.56}, annote = {Keywords: Binary rank, Boolean rank, Regular matrices, Non-deterministic communication complexity, Biclique partition number, Chromatic number} }
Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, and Patrick A. Phillips. Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 57:1-57:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hemaspaandra_et_al:LIPIcs.MFCS.2022.57, author = {Hemaspaandra, Lane A. and Juvekar, Mandar and Nadjimzadah, Arian and Phillips, Patrick A.}, title = {{Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {57:1--57: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.57}, URN = {urn:nbn:de:0030-drops-168552}, doi = {10.4230/LIPIcs.MFCS.2022.57}, annote = {Keywords: structural complexity theory, computational complexity theory, ambiguity-limited NP, counting classes, P-printable sets} }
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, and Kunihiro Wasa. Independent Set Reconfiguration on Directed Graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 58:1-58:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ito_et_al:LIPIcs.MFCS.2022.58, author = {Ito, Takehiro and Iwamasa, Yuni and Kobayashi, Yasuaki and Nakahata, Yu and Otachi, Yota and Takahashi, Masahiro and Wasa, Kunihiro}, title = {{Independent Set Reconfiguration on Directed Graphs}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {58:1--58: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.58}, URN = {urn:nbn:de:0030-drops-168567}, doi = {10.4230/LIPIcs.MFCS.2022.58}, annote = {Keywords: Combinatorial reconfiguration, token sliding, directed graph, independent set, graph algorithm} }
Dmitry Itsykson and Artur Riazanov. Automating OBDD proofs is NP-hard. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 59:1-59:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{itsykson_et_al:LIPIcs.MFCS.2022.59, author = {Itsykson, Dmitry and Riazanov, Artur}, title = {{Automating OBDD proofs is NP-hard}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {59:1--59: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.59}, URN = {urn:nbn:de:0030-drops-168575}, doi = {10.4230/LIPIcs.MFCS.2022.59}, annote = {Keywords: proof complexity, OBDD, automatability, lifting, dag-like communication} }
Panagiotis Kanellopoulos, Maria Kyropoulou, and Alexandros A. Voudouris. Not All Strangers Are the Same: The Impact of Tolerance in Schelling Games. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 60:1-60:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kanellopoulos_et_al:LIPIcs.MFCS.2022.60, author = {Kanellopoulos, Panagiotis and Kyropoulou, Maria and Voudouris, Alexandros A.}, title = {{Not All Strangers Are the Same: The Impact of Tolerance in Schelling Games}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {60:1--60: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.60}, URN = {urn:nbn:de:0030-drops-168589}, doi = {10.4230/LIPIcs.MFCS.2022.60}, annote = {Keywords: Schelling games, Equilibria, Price of anarchy, Price of stability} }
George Kenison. On the Skolem Problem for Reversible Sequences. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 61:1-61:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kenison:LIPIcs.MFCS.2022.61, author = {Kenison, George}, title = {{On the Skolem Problem for Reversible Sequences}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {61:1--61: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.61}, URN = {urn:nbn:de:0030-drops-168590}, doi = {10.4230/LIPIcs.MFCS.2022.61}, annote = {Keywords: The Skolem Problem, Linear Recurrences, Verification} }
Nina Klobas, George B. Mertzios, Hendrik Molter, and Paul G. Spirakis. The Complexity of Computing Optimum Labelings for Temporal Connectivity. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 62:1-62:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{klobas_et_al:LIPIcs.MFCS.2022.62, author = {Klobas, Nina and Mertzios, George B. and Molter, Hendrik and Spirakis, Paul G.}, title = {{The Complexity of Computing Optimum Labelings for Temporal Connectivity}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {62:1--62: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.62}, URN = {urn:nbn:de:0030-drops-168603}, doi = {10.4230/LIPIcs.MFCS.2022.62}, annote = {Keywords: Temporal graph, graph labeling, foremost temporal path, temporal connectivity, Steiner Tree} }
Zhuan Khye Koh and Georg Loho. Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 63:1-63:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{koh_et_al:LIPIcs.MFCS.2022.63, author = {Koh, Zhuan Khye and Loho, Georg}, title = {{Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {63:1--63: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.63}, URN = {urn:nbn:de:0030-drops-168619}, doi = {10.4230/LIPIcs.MFCS.2022.63}, annote = {Keywords: parity games, strategy iteration, value iteration, progress measure, universal trees} }
Jędrzej Kołodziejski and Bartek Klin. Countdown μ-Calculus. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 64:1-64:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kolodziejski_et_al:LIPIcs.MFCS.2022.64, author = {Ko{\l}odziejski, J\k{e}drzej and Klin, Bartek}, title = {{Countdown \mu-Calculus}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {64:1--64: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.64}, URN = {urn:nbn:de:0030-drops-168624}, doi = {10.4230/LIPIcs.MFCS.2022.64}, annote = {Keywords: countdown \mu-calculus, games, automata} }
Balagopal Komarath, Anurag Pandey, and Nitin Saurabh. Rabbits Approximate, Cows Compute Exactly!. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 65:1-65:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{komarath_et_al:LIPIcs.MFCS.2022.65, author = {Komarath, Balagopal and Pandey, Anurag and Saurabh, Nitin}, title = {{Rabbits Approximate, Cows Compute Exactly!}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {65:1--65: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.65}, URN = {urn:nbn:de:0030-drops-168637}, doi = {10.4230/LIPIcs.MFCS.2022.65}, annote = {Keywords: Algebraic complexity theory, Algebraic complexity classes, Determinant versus permanent, Algebraic formulas, Algebraic branching programs, Band matrices, Tridiagonal matrices, Tetradiagonal matrices, Continuant, Narayana’s cow sequence, Padovan sequence} }
Christian Komusiewicz and Nils Morawietz. Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 66:1-66:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{komusiewicz_et_al:LIPIcs.MFCS.2022.66, author = {Komusiewicz, Christian and Morawietz, Nils}, title = {{Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {66:1--66: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.66}, URN = {urn:nbn:de:0030-drops-168644}, doi = {10.4230/LIPIcs.MFCS.2022.66}, annote = {Keywords: Local Search, Graph problems, 3-swap neighborhood, PLS-completeness} }
Alexander S. Kulikov, Danila Pechenev, and Nikita Slezkin. SAT-Based Circuit Local Improvement. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 67:1-67:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kulikov_et_al:LIPIcs.MFCS.2022.67, author = {Kulikov, Alexander S. and Pechenev, Danila and Slezkin, Nikita}, title = {{SAT-Based Circuit Local Improvement}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {67:1--67: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.67}, URN = {urn:nbn:de:0030-drops-168659}, doi = {10.4230/LIPIcs.MFCS.2022.67}, annote = {Keywords: circuits, algorithms, complexity theory, SAT, SAT solvers, heuristics} }
Hoang-Oanh Le and Van Bang Le. Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 68:1-68:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{le_et_al:LIPIcs.MFCS.2022.68, author = {Le, Hoang-Oanh and Le, Van Bang}, title = {{Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {68:1--68:10}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.68}, URN = {urn:nbn:de:0030-drops-168663}, doi = {10.4230/LIPIcs.MFCS.2022.68}, annote = {Keywords: Cluster vertex deletion, Vertex cover, Computational complexity, Complexity dichotomy} }
Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau, Uéverton S. Souza, and Prafullkumar Tale. Reducing the Vertex Cover Number via Edge Contractions. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 69:1-69:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lima_et_al:LIPIcs.MFCS.2022.69, author = {Lima, Paloma T. and dos Santos, Vinicius F. and Sau, Ignasi and Souza, U\'{e}verton S. and Tale, Prafullkumar}, title = {{Reducing the Vertex Cover Number via Edge Contractions}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {69:1--69: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.69}, URN = {urn:nbn:de:0030-drops-168671}, doi = {10.4230/LIPIcs.MFCS.2022.69}, annote = {Keywords: Blocker problems, edge contraction, vertex cover, parameterized complexity} }
Mo Liu, Anantha Padmanabha, R. Ramanujam, and Yanjing Wang. Generalized Bundled Fragments for First-Order Modal Logic. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 70:1-70:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{liu_et_al:LIPIcs.MFCS.2022.70, author = {Liu, Mo and Padmanabha, Anantha and Ramanujam, R. and Wang, Yanjing}, title = {{Generalized Bundled Fragments for First-Order Modal Logic}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {70:1--70: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.70}, URN = {urn:nbn:de:0030-drops-168684}, doi = {10.4230/LIPIcs.MFCS.2022.70}, annote = {Keywords: bundled fragments, first-order modal logic, decidability, tableaux} }
Markus Lohrey, Andreas Rosowski, and Georg Zetzsche. Membership Problems in Finite Groups. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 71:1-71:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lohrey_et_al:LIPIcs.MFCS.2022.71, author = {Lohrey, Markus and Rosowski, Andreas and Zetzsche, Georg}, title = {{Membership Problems in Finite Groups}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {71:1--71:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.71}, URN = {urn:nbn:de:0030-drops-168694}, doi = {10.4230/LIPIcs.MFCS.2022.71}, annote = {Keywords: algorithms for finite groups, intersection non-emptiness problems, knapsack problems in groups} }
Markus Lohrey and Lukas Lück. Streaming Word Problems. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 72:1-72:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{lohrey_et_al:LIPIcs.MFCS.2022.72, author = {Lohrey, Markus and L\"{u}ck, Lukas}, title = {{Streaming Word Problems}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {72:1--72: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.72}, URN = {urn:nbn:de:0030-drops-168707}, doi = {10.4230/LIPIcs.MFCS.2022.72}, annote = {Keywords: word problems for groups, streaming algorithms} }
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.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} }
Jakub Michaliszyn and Jan Otop. Learning Deterministic Visibly Pushdown Automata Under Accessible Stack. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 74:1-74:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{michaliszyn_et_al:LIPIcs.MFCS.2022.74, author = {Michaliszyn, Jakub and Otop, Jan}, title = {{Learning Deterministic Visibly Pushdown Automata Under Accessible Stack}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {74:1--74:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.74}, URN = {urn:nbn:de:0030-drops-168729}, doi = {10.4230/LIPIcs.MFCS.2022.74}, annote = {Keywords: visibly pushdown automata, automata inference, minimization} }
Adam Ó Conghaile. Cohomology in Constraint Satisfaction and Structure Isomorphism. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 75:1-75:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{oconghaile:LIPIcs.MFCS.2022.75, author = {\'{O} Conghaile, Adam}, title = {{Cohomology in Constraint Satisfaction and Structure Isomorphism}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {75:1--75:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.75}, URN = {urn:nbn:de:0030-drops-168738}, doi = {10.4230/LIPIcs.MFCS.2022.75}, annote = {Keywords: constraint satisfaction problems, finite model theory, descriptive complexity, rank logic, Weisfeiler-Leman algorithm, cohomology} }
Dominik Peteler and Karin Quaas. Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 76:1-76:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{peteler_et_al:LIPIcs.MFCS.2022.76, author = {Peteler, Dominik and Quaas, Karin}, title = {{Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {76:1--76: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.76}, URN = {urn:nbn:de:0030-drops-168743}, doi = {10.4230/LIPIcs.MFCS.2022.76}, annote = {Keywords: Data Languages, Strings, Constraints, Prefix, Suffix, Automata, Linear Temporal Logic} }
Alexander Rabinovich. On Uniformization in the Full Binary Tree. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 77:1-77:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{rabinovich:LIPIcs.MFCS.2022.77, author = {Rabinovich, Alexander}, title = {{On Uniformization in the Full Binary Tree}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {77:1--77: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.77}, URN = {urn:nbn:de:0030-drops-168757}, doi = {10.4230/LIPIcs.MFCS.2022.77}, annote = {Keywords: Monadic Second-Order Logic, Uniformization} }
M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, and Shaily Verma. An Exact Algorithm for Knot-Free Vertex Deletion. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 78:1-78:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ramanujan_et_al:LIPIcs.MFCS.2022.78, author = {Ramanujan, M. S. and Sahu, Abhishek and Saurabh, Saket and Verma, Shaily}, title = {{An Exact Algorithm for Knot-Free Vertex Deletion}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {78:1--78: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.78}, URN = {urn:nbn:de:0030-drops-168769}, doi = {10.4230/LIPIcs.MFCS.2022.78}, annote = {Keywords: exact algorithm, knot-free graphs, branching algorithm} }
Michel Rigo, Manon Stipulanti, and Markus A. Whiteland. On Extended Boundary Sequences of Morphic and Sturmian Words. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 79:1-79:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{rigo_et_al:LIPIcs.MFCS.2022.79, author = {Rigo, Michel and Stipulanti, Manon and Whiteland, Markus A.}, title = {{On Extended Boundary Sequences of Morphic and Sturmian Words}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {79:1--79:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.79}, URN = {urn:nbn:de:0030-drops-168776}, doi = {10.4230/LIPIcs.MFCS.2022.79}, annote = {Keywords: Boundary sequences, Sturmian words, Numeration systems, Automata, Graph of addition} }
Will Simmons and Aleks Kissinger. Higher-Order Causal Theories Are Models of BV-Logic. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 80:1-80:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{simmons_et_al:LIPIcs.MFCS.2022.80, author = {Simmons, Will and Kissinger, Aleks}, title = {{Higher-Order Causal Theories Are Models of BV-Logic}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {80:1--80: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.80}, URN = {urn:nbn:de:0030-drops-168789}, doi = {10.4230/LIPIcs.MFCS.2022.80}, annote = {Keywords: Causality, linear logic, categorical logic, probabilistic coherence spaces, quantum channels} }
Seiichiro Tani. Space-Bounded Unitary Quantum Computation with Postselection. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 81:1-81:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{tani:LIPIcs.MFCS.2022.81, author = {Tani, Seiichiro}, title = {{Space-Bounded Unitary Quantum Computation with Postselection}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {81:1--81: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.81}, URN = {urn:nbn:de:0030-drops-168798}, doi = {10.4230/LIPIcs.MFCS.2022.81}, annote = {Keywords: quantum complexity theory, space-bounded computation, postselection} }
Haitao Wang and Yiming Zhao. Computing the Minimum Bottleneck Moving Spanning Tree. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 82:1-82:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{wang_et_al:LIPIcs.MFCS.2022.82, author = {Wang, Haitao and Zhao, Yiming}, title = {{Computing the Minimum Bottleneck Moving Spanning Tree}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {82:1--82: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.82}, URN = {urn:nbn:de:0030-drops-168801}, doi = {10.4230/LIPIcs.MFCS.2022.82}, annote = {Keywords: minimum spanning tree, moving points, unit-disk range emptiness query, dynamic data structure} }
Jingyang Zhao, Mingyu Xiao, and Chao Xu. Improved Approximation Algorithms for the Traveling Tournament Problem. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 83:1-83:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{zhao_et_al:LIPIcs.MFCS.2022.83, author = {Zhao, Jingyang and Xiao, Mingyu and Xu, Chao}, title = {{Improved Approximation Algorithms for the Traveling Tournament Problem}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {83:1--83: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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.83}, URN = {urn:nbn:de:0030-drops-168813}, doi = {10.4230/LIPIcs.MFCS.2022.83}, annote = {Keywords: Sports scheduling, Traveling Tournament Problem, Approximation algorithm} }
Feedback for Dagstuhl Publishing