@Proceedings{beyersdorff_et_al:LIPIcs.STACS.2024,
title = {{LIPIcs, Volume 289, STACS 2024, Complete Volume}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {1--1048},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024},
URN = {urn:nbn:de:0030-drops-197098},
doi = {10.4230/LIPIcs.STACS.2024},
annote = {Keywords: LIPIcs, Volume 289, STACS 2024, Complete Volume}
}
@InProceedings{beyersdorff_et_al:LIPIcs.STACS.2024.0,
author = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {0:i--0:xx},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.0},
URN = {urn:nbn:de:0030-drops-197108},
doi = {10.4230/LIPIcs.STACS.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{oliveira:LIPIcs.STACS.2024.1,
author = {Oliveira, Igor C.},
title = {{Polynomial-Time Pseudodeterministic Constructions}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.1},
URN = {urn:nbn:de:0030-drops-197112},
doi = {10.4230/LIPIcs.STACS.2024.1},
annote = {Keywords: Pseudorandomness, Explicit Constructions, Pseudodeterministic Algorithms}
}
@InProceedings{raskhodnikova:LIPIcs.STACS.2024.2,
author = {Raskhodnikova, Sofya},
title = {{The Role of Local Algorithms in Privacy}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.2},
URN = {urn:nbn:de:0030-drops-197123},
doi = {10.4230/LIPIcs.STACS.2024.2},
annote = {Keywords: Sublinear algorithms, differential privacy, reconstruction of Lipschitz functions, local algorithms}
}
@InProceedings{torunczyk:LIPIcs.STACS.2024.3,
author = {Toru\'{n}czyk, Szymon},
title = {{Structurally Tractable Graph Classes}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.3},
URN = {urn:nbn:de:0030-drops-197134},
doi = {10.4230/LIPIcs.STACS.2024.3},
annote = {Keywords: Structural graph theory, Monadic dependence, monadic NIP, twin-width}
}
@InProceedings{abrishami_et_al:LIPIcs.STACS.2024.4,
author = {Abrishami, Tara and Chudnovsky, Maria and Pilipczuk, Marcin and Rz\k{a}\.{z}ewski, Pawe{\l}},
title = {{Max Weight Independent Set in Sparse Graphs with No Long Claws}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {4:1--4:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.4},
URN = {urn:nbn:de:0030-drops-197148},
doi = {10.4230/LIPIcs.STACS.2024.4},
annote = {Keywords: Max Weight Independent Set, subdivided claw, hereditary classes}
}
@InProceedings{aiswarya_et_al:LIPIcs.STACS.2024.5,
author = {Aiswarya, C. and Mal, Soumodev and Saivasan, Prakash},
title = {{Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.5},
URN = {urn:nbn:de:0030-drops-197154},
doi = {10.4230/LIPIcs.STACS.2024.5},
annote = {Keywords: satisfiability, subword, string constraints, context-free, transducers}
}
@InProceedings{arvind_et_al:LIPIcs.STACS.2024.6,
author = {Arvind, V. and Fuhlbr\"{u}ck, Frank and K\"{o}bler, Johannes and Verbitsky, Oleg},
title = {{On a Hierarchy of Spectral Invariants for Graphs}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {6:1--6:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.6},
URN = {urn:nbn:de:0030-drops-197166},
doi = {10.4230/LIPIcs.STACS.2024.6},
annote = {Keywords: Graph Isomorphism, spectra of graphs, combinatorial refinement, strongly regular graphs}
}
@InProceedings{balaban_et_al:LIPIcs.STACS.2024.7,
author = {Balab\'{a}n, Jakub and Ganian, Robert and Rocton, Mathis},
title = {{Computing Twin-Width Parameterized by the Feedback Edge Number}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {7:1--7:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.7},
URN = {urn:nbn:de:0030-drops-197170},
doi = {10.4230/LIPIcs.STACS.2024.7},
annote = {Keywords: twin-width, parameterized complexity, kernelization, feedback edge number}
}
@InProceedings{bannach_et_al:LIPIcs.STACS.2024.8,
author = {Bannach, Max and Marwitz, Florian Andreas and Tantau, Till},
title = {{Faster Graph Algorithms Through DAG Compression}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.8},
URN = {urn:nbn:de:0030-drops-197188},
doi = {10.4230/LIPIcs.STACS.2024.8},
annote = {Keywords: graph compression, graph traversal, twinwidth, parameterized algorithms}
}
@InProceedings{baraskar_et_al:LIPIcs.STACS.2024.9,
author = {Baraskar, Omkar and Dewan, Agrim and Saha, Chandan},
title = {{Testing Equivalence to Design Polynomials}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {9:1--9:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.9},
URN = {urn:nbn:de:0030-drops-197193},
doi = {10.4230/LIPIcs.STACS.2024.9},
annote = {Keywords: Polynomial equivalence, design polynomials, graph isomorphism, vector space decomposition}
}
@InProceedings{beohar_et_al:LIPIcs.STACS.2024.10,
author = {Beohar, Harsh and Gurke, Sebastian and K\"{o}nig, Barbara and Messing, Karla and Forster, Jonas and Schr\"{o}der, Lutz and Wild, Paul},
title = {{Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.10},
URN = {urn:nbn:de:0030-drops-197203},
doi = {10.4230/LIPIcs.STACS.2024.10},
annote = {Keywords: modal logics, coalgebras, behavioural equivalences, behavioural metrics, linear-time semantics, Eilenberg-Moore categories}
}
@InProceedings{berkholz_et_al:LIPIcs.STACS.2024.11,
author = {Berkholz, Christoph and Mengel, Stefan and Wilhelm, Hermann},
title = {{A Characterization of Efficiently Compilable Constraint Languages}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {11:1--11:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.11},
URN = {urn:nbn:de:0030-drops-197214},
doi = {10.4230/LIPIcs.STACS.2024.11},
annote = {Keywords: constraint satisfaction, knowledge compilation, dichotomy, DNNF}
}
@InProceedings{berkholz_et_al:LIPIcs.STACS.2024.12,
author = {Berkholz, Christoph and Kuske, Dietrich and Schwarz, Christian},
title = {{Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.12},
URN = {urn:nbn:de:0030-drops-197228},
doi = {10.4230/LIPIcs.STACS.2024.12},
annote = {Keywords: succinctness, modal logic}
}
@InProceedings{bessy_et_al:LIPIcs.STACS.2024.13,
author = {Bessy, St\'{e}phane and Thomass\'{e}, St\'{e}phan and Viennot, Laurent},
title = {{Temporalizing Digraphs via Linear-Size Balanced Bi-Trees}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {13:1--13:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.13},
URN = {urn:nbn:de:0030-drops-197235},
doi = {10.4230/LIPIcs.STACS.2024.13},
annote = {Keywords: digraph, temporal graph, temporalization, bi-tree, #1\{in-branching, out-branching, in-tree, out-tree\}, forward connected pairs, left-maximal DFS}
}
@InProceedings{bienkowski_et_al:LIPIcs.STACS.2024.14,
author = {Bienkowski, Marcin and Schmid, Stefan},
title = {{A Subquadratic Bound for Online Bisection}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.14},
URN = {urn:nbn:de:0030-drops-197247},
doi = {10.4230/LIPIcs.STACS.2024.14},
annote = {Keywords: Bisection, Graph Partitioning, online balanced Repartitioning, online Algorithms, competitive Analysis}
}
@InProceedings{bienkowski_et_al:LIPIcs.STACS.2024.15,
author = {Bienkowski, Marcin and Even, Guy},
title = {{An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.15},
URN = {urn:nbn:de:0030-drops-197252},
doi = {10.4230/LIPIcs.STACS.2024.15},
annote = {Keywords: Minimum Linear Arrangement, dynamic Variant, Optimization Problems, Graph Problems, approximation Algorithms}
}
@InProceedings{bille_et_al:LIPIcs.STACS.2024.16,
author = {Bille, Philip and G{\o}rtz, Inge Li and Lewenstein, Moshe and Pissis, Solon P. and Rotenberg, Eva and Steiner, Teresa Anna},
title = {{Gapped String Indexing in Subquadratic Space and Sublinear Query Time}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {16:1--16:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.16},
URN = {urn:nbn:de:0030-drops-197262},
doi = {10.4230/LIPIcs.STACS.2024.16},
annote = {Keywords: data structures, string indexing, indexing with gaps, two patterns}
}
@InProceedings{bitar:LIPIcs.STACS.2024.17,
author = {Bitar, Nicol\'{a}s},
title = {{Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {17:1--17:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.17},
URN = {urn:nbn:de:0030-drops-197275},
doi = {10.4230/LIPIcs.STACS.2024.17},
annote = {Keywords: Tilings, Domino problem, SAT, Computability, Finitely generated groups}
}
@InProceedings{bockenhauer_et_al:LIPIcs.STACS.2024.18,
author = {B\"{o}ckenhauer, Hans-Joachim and Frei, Fabian and Rossmanith, Peter},
title = {{Removable Online Knapsack and Advice}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {18:1--18:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.18},
URN = {urn:nbn:de:0030-drops-197283},
doi = {10.4230/LIPIcs.STACS.2024.18},
annote = {Keywords: Removable Online Knapsack, Multiple Knapsack, Advice Analysis, Advice Applications, Machine Learning and AI}
}
@InProceedings{boker_et_al:LIPIcs.STACS.2024.19,
author = {B\"{o}ker, Jan and H\"{a}rtel, Louis and Runde, Nina and Seppelt, Tim and Standke, Christoph},
title = {{The Complexity of Homomorphism Reconstructibility}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {19:1--19:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.19},
URN = {urn:nbn:de:0030-drops-197298},
doi = {10.4230/LIPIcs.STACS.2024.19},
annote = {Keywords: graph homomorphism, counting complexity, parameterised complexity}
}
@InProceedings{bournez_et_al:LIPIcs.STACS.2024.20,
author = {Bournez, Olivier and Gozzi, Riccardo},
title = {{Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.20},
URN = {urn:nbn:de:0030-drops-197308},
doi = {10.4230/LIPIcs.STACS.2024.20},
annote = {Keywords: Analog models, computability, transfinite computations, dynamical systems}
}
@InProceedings{bousquet_et_al:LIPIcs.STACS.2024.21,
author = {Bousquet, Nicolas and Feuilloley, Laurent and Zeitoun, S\'{e}bastien},
title = {{Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {21:1--21:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.21},
URN = {urn:nbn:de:0030-drops-197317},
doi = {10.4230/LIPIcs.STACS.2024.21},
annote = {Keywords: Local certification, local properties, proof-labeling schemes, locally checkable proofs, optimal certification size, colorability, dominating set, perfect matching, fault-tolerance, graph structure}
}
@InProceedings{caillatgrenier_et_al:LIPIcs.STACS.2024.22,
author = {Caillat-Grenier, Geoffroy and Romashchenko, Andrei},
title = {{Spectral Approach to the Communication Complexity of Multi-Party Key Agreement}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {22:1--22:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.22},
URN = {urn:nbn:de:0030-drops-197323},
doi = {10.4230/LIPIcs.STACS.2024.22},
annote = {Keywords: communication complexity, Kolmogorov complexity, information-theoretic cryptography, multiparty secret key agreement, expander mixing lemma, information inequalities}
}
@InProceedings{chakrabarty_et_al:LIPIcs.STACS.2024.23,
author = {Chakrabarty, Deeparnab and Cote, Luc and Sarkar, Ankita},
title = {{Fault-tolerant k-Supplier with Outliers}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {23:1--23:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.23},
URN = {urn:nbn:de:0030-drops-197336},
doi = {10.4230/LIPIcs.STACS.2024.23},
annote = {Keywords: Clustering, approximation algorithms, round-or-cut}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.STACS.2024.24,
author = {Charalampopoulos, Panagiotis and Pissis, Solon P. and Radoszewski, Jakub and Rytter, Wojciech and Wale\'{n}, Tomasz and Zuba, Wiktor},
title = {{Approximate Circular Pattern Matching Under Edit Distance}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {24:1--24:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.24},
URN = {urn:nbn:de:0030-drops-197346},
doi = {10.4230/LIPIcs.STACS.2024.24},
annote = {Keywords: circular pattern matching, approximate pattern matching, edit distance}
}
@InProceedings{choudhury_et_al:LIPIcs.STACS.2024.25,
author = {Choudhury, Tameem and Sreenivasaiah, Karteek},
title = {{Depth-3 Circuit Lower Bounds for k-OV}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.25},
URN = {urn:nbn:de:0030-drops-197359},
doi = {10.4230/LIPIcs.STACS.2024.25},
annote = {Keywords: fine grained complexity, k-OV, circuit lower bounds, depth-3 circuits}
}
@InProceedings{cotumaccio:LIPIcs.STACS.2024.26,
author = {Cotumaccio, Nicola},
title = {{A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {26:1--26:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.26},
URN = {urn:nbn:de:0030-drops-197369},
doi = {10.4230/LIPIcs.STACS.2024.26},
annote = {Keywords: Generalized Automata, Myhill-Nerode Theorem, Regular Languages, Wheeler Graphs, FM-index, Burrows-Wheeler Transform}
}
@InProceedings{dcosta_et_al:LIPIcs.STACS.2024.27,
author = {D'Costa, Julian and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{Nonnegativity Problems for Matrix Semigroups}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {27:1--27:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.27},
URN = {urn:nbn:de:0030-drops-197371},
doi = {10.4230/LIPIcs.STACS.2024.27},
annote = {Keywords: Decidability, Linear Recurrence Sequences, Schanuel’s Conjecture}
}
@InProceedings{dippel_et_al:LIPIcs.STACS.2024.28,
author = {Dippel, Jack and Vetta, Adrian},
title = {{One n Remains to Settle the Tree Conjecture}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.28},
URN = {urn:nbn:de:0030-drops-197388},
doi = {10.4230/LIPIcs.STACS.2024.28},
annote = {Keywords: Algorithmic Game Theory, Network Creation Games, Tree Conjecture}
}
@InProceedings{draghici_et_al:LIPIcs.STACS.2024.29,
author = {Draghici, Andrei and Haase, Christoph and Manea, Florin},
title = {{Sem\"{e}nov Arithmetic, Affine \{VASS\}, and String Constraints}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {29:1--29:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.29},
URN = {urn:nbn:de:0030-drops-197393},
doi = {10.4230/LIPIcs.STACS.2024.29},
annote = {Keywords: arithmetic theories, B\"{u}chi arithmetic, exponentiation, vector addition systems with states, string constraints}
}
@InProceedings{dutta_et_al:LIPIcs.STACS.2024.30,
author = {Dutta, Pranjal and Gesmundo, Fulvio and Ikenmeyer, Christian and Jindal, Gorav and Lysikov, Vladimir},
title = {{Fixed-Parameter Debordering of Waring Rank}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {30:1--30:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.30},
URN = {urn:nbn:de:0030-drops-197403},
doi = {10.4230/LIPIcs.STACS.2024.30},
annote = {Keywords: border complexity, Waring rank, debordering, apolarity}
}
@InProceedings{dutta_et_al:LIPIcs.STACS.2024.31,
author = {Dutta, Pranjal and Ikenmeyer, Christian and Komarath, Balagopal and Mittal, Harshil and Nanoti, Saraswati Girish and Thakkar, Dhara},
title = {{On the Power of Border Width-2 ABPs over Fields of Characteristic 2}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.31},
URN = {urn:nbn:de:0030-drops-197419},
doi = {10.4230/LIPIcs.STACS.2024.31},
annote = {Keywords: Algebraic branching programs, border complexity, characteristic 2}
}
@InProceedings{eberle:LIPIcs.STACS.2024.32,
author = {Eberle, Franziska},
title = {{O(1/\epsilon) Is the Answer in Online Weighted Throughput Maximization}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {32:1--32:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.32},
URN = {urn:nbn:de:0030-drops-197428},
doi = {10.4230/LIPIcs.STACS.2024.32},
annote = {Keywords: Deadline scheduling, weighted throughput, online algorithms, competitive analysis}
}
@InProceedings{elmaalouly_et_al:LIPIcs.STACS.2024.33,
author = {El Maalouly, Nicolas and Haslebacher, Sebastian and Wulf, Lasse},
title = {{On the Exact Matching Problem in Dense Graphs}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {33:1--33:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.33},
URN = {urn:nbn:de:0030-drops-197437},
doi = {10.4230/LIPIcs.STACS.2024.33},
annote = {Keywords: Exact Matching, Perfect Matching, Red-Blue Matching, Bounded Color Matching, Local Search, Derandomization}
}
@InProceedings{filakovsky_et_al:LIPIcs.STACS.2024.34,
author = {Filakovsk\'{y}, Marek and Nakajima, Tamio-Vesa and Opr\v{s}al, Jakub and Tasinato, Gianluca and Wagner, Uli},
title = {{Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {34:1--34:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.34},
URN = {urn:nbn:de:0030-drops-197445},
doi = {10.4230/LIPIcs.STACS.2024.34},
annote = {Keywords: constraint satisfaction problem, hypergraph colouring, promise problem, topological methods}
}
@InProceedings{fuchs_et_al:LIPIcs.STACS.2024.35,
author = {Fuchs, Janosch and Whittington, Philip},
title = {{The 2-Attractor Problem Is NP-Complete}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {35:1--35:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.35},
URN = {urn:nbn:de:0030-drops-197457},
doi = {10.4230/LIPIcs.STACS.2024.35},
annote = {Keywords: String attractors, dictionary compression, computational complexity}
}
@InProceedings{ganardi_et_al:LIPIcs.STACS.2024.36,
author = {Ganardi, Moses and Sa\u{g}lam, Irmak and Zetzsche, Georg},
title = {{Directed Regular and Context-Free Languages}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {36:1--36:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.36},
URN = {urn:nbn:de:0030-drops-197465},
doi = {10.4230/LIPIcs.STACS.2024.36},
annote = {Keywords: Subword, ideal, language, regular, context-free, equivalence, downward closure, compression}
}
@InProceedings{gehnen_et_al:LIPIcs.STACS.2024.37,
author = {Gehnen, Matthias and Lotze, Henri and Rossmanith, Peter},
title = {{Online Simple Knapsack with Bounded Predictions}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {37:1--37:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.37},
URN = {urn:nbn:de:0030-drops-197476},
doi = {10.4230/LIPIcs.STACS.2024.37},
annote = {Keywords: Online problem, Simple Knapsack, Predictions, Machine-Learned Advice}
}
@InProceedings{goller_et_al:LIPIcs.STACS.2024.38,
author = {G\"{o}ller, Stefan and Grosshans, Nathan},
title = {{The AC⁰-Complexity of Visibly Pushdown Languages}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {38:1--38:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.38},
URN = {urn:nbn:de:0030-drops-197483},
doi = {10.4230/LIPIcs.STACS.2024.38},
annote = {Keywords: Visibly pushdown languages, Circuit Complexity, AC0}
}
@InProceedings{guan_et_al:LIPIcs.STACS.2024.39,
author = {Guan, Ziyi and Huang, Yunqi and Yao, Penghui and Ye, Zekun},
title = {{Quantum and Classical Communication Complexity of Permutation-Invariant Functions}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {39:1--39:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.39},
URN = {urn:nbn:de:0030-drops-197498},
doi = {10.4230/LIPIcs.STACS.2024.39},
annote = {Keywords: Communication complexity, Permutation-invariant functions, Log-rank Conjecture, Quantum advantages}
}
@InProceedings{harris_et_al:LIPIcs.STACS.2024.40,
author = {Harris, David G. and Narayanaswamy, N. S.},
title = {{A Faster Algorithm for Vertex Cover Parameterized by Solution Size}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {40:1--40:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.40},
URN = {urn:nbn:de:0030-drops-197508},
doi = {10.4230/LIPIcs.STACS.2024.40},
annote = {Keywords: Vertex cover, FPT, Graph algorithm}
}
@InProceedings{hitarth_et_al:LIPIcs.STACS.2024.41,
author = {Hitarth, S. and Kenison, George and Kov\'{a}cs, Laura and Varonka, Anton},
title = {{Linear Loop Synthesis for Quadratic Invariants}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {41:1--41:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.41},
URN = {urn:nbn:de:0030-drops-197512},
doi = {10.4230/LIPIcs.STACS.2024.41},
annote = {Keywords: program synthesis, loop invariants, verification, Diophantine equations}
}
@InProceedings{hoefer_et_al:LIPIcs.STACS.2024.42,
author = {Hoefer, Martin and Ventre, Carmine and Wilhelmi, Lisa},
title = {{Algorithms for Claims Trading}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {42:1--42:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.42},
URN = {urn:nbn:de:0030-drops-197523},
doi = {10.4230/LIPIcs.STACS.2024.42},
annote = {Keywords: Financial Networks, Claims Trade, Systemic Risk}
}
@InProceedings{jansson_et_al:LIPIcs.STACS.2024.43,
author = {Jansson, Jesper and Sung, Wing-Kin and Tabatabaee, Seyed Ali and Yang, Yutong},
title = {{A Faster Algorithm for Constructing the Frequency Difference Consensus Tree}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {43:1--43:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.43},
URN = {urn:nbn:de:0030-drops-197539},
doi = {10.4230/LIPIcs.STACS.2024.43},
annote = {Keywords: phylogenetic tree, frequency difference consensus tree, tree algorithm, centroid path decomposition, max-Manhattan Skyline Problem}
}
@InProceedings{kanesh_et_al:LIPIcs.STACS.2024.44,
author = {Kanesh, Lawqueen and Panolan, Fahad and Ramanujan, M. S. and Strulo, Peter},
title = {{Decremental Sensitivity Oracles for Covering and Packing Minors}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {44:1--44:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.44},
URN = {urn:nbn:de:0030-drops-197544},
doi = {10.4230/LIPIcs.STACS.2024.44},
annote = {Keywords: Sensitivity oracles, Data Structures, FPT algorithms}
}
@InProceedings{kawalek_et_al:LIPIcs.STACS.2024.45,
author = {Kawa{\l}ek, Piotr and Kompatscher, Michael and Krzaczkowski, Jacek},
title = {{Circuit Equivalence in 2-Nilpotent Algebras}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {45:1--45:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.45},
URN = {urn:nbn:de:0030-drops-197554},
doi = {10.4230/LIPIcs.STACS.2024.45},
annote = {Keywords: circuit equivalence, identity checking, nilpotent algebra}
}
@InProceedings{kompatscher:LIPIcs.STACS.2024.46,
author = {Kompatscher, Michael},
title = {{The Subpower Membership Problem of 2-Nilpotent Algebras}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {46:1--46:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.46},
URN = {urn:nbn:de:0030-drops-197562},
doi = {10.4230/LIPIcs.STACS.2024.46},
annote = {Keywords: subpower membership problem, Mal'tsev algebra, compact representation, nilpotence, clonoids}
}
@InProceedings{kowalska_et_al:LIPIcs.STACS.2024.47,
author = {Kowalska, Katarzyna and Pilipczuk, Micha{\l}},
title = {{Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {47:1--47:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.47},
URN = {urn:nbn:de:0030-drops-197572},
doi = {10.4230/LIPIcs.STACS.2024.47},
annote = {Keywords: Geometric Set Cover, fixed-parameter tractability, weighted parameterized problems, parameterized approximation scheme}
}
@InProceedings{lanzinger_et_al:LIPIcs.STACS.2024.48,
author = {Lanzinger, Matthias and Razgon, Igor},
title = {{FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {48:1--48:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.48},
URN = {urn:nbn:de:0030-drops-197588},
doi = {10.4230/LIPIcs.STACS.2024.48},
annote = {Keywords: generalized hypertree width, hypergraphs, parameterized algorithms, approximation algorithms}
}
@InProceedings{liu_et_al:LIPIcs.STACS.2024.49,
author = {Liu, Ying and Chen, Shiteng},
title = {{Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {49:1--49:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.49},
URN = {urn:nbn:de:0030-drops-197593},
doi = {10.4230/LIPIcs.STACS.2024.49},
annote = {Keywords: computational complexity, planar Holant, polynomial interpolation, rETH, sub-exponential, #ETH, #Matching, #VC}
}
@InProceedings{main:LIPIcs.STACS.2024.50,
author = {Main, James C. A.},
title = {{Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {50:1--50:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.50},
URN = {urn:nbn:de:0030-drops-197603},
doi = {10.4230/LIPIcs.STACS.2024.50},
annote = {Keywords: multiplayer games on graphs, Nash equilibrium, finite-memory strategies}
}
@InProceedings{maletti_et_al:LIPIcs.STACS.2024.51,
author = {Maletti, Andreas and N\'{a}sz, Andreea-Teodora and Paul, Erik},
title = {{Weighted HOM-Problem for Nonnegative Integers}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {51:1--51:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.51},
URN = {urn:nbn:de:0030-drops-197614},
doi = {10.4230/LIPIcs.STACS.2024.51},
annote = {Keywords: Weighted Tree Automaton, Decision Problem, Subtree Equality Constraint, Tree Homomorphism, HOM-Problem, Weighted Tree Grammar, Weighted HOM-Problem}
}
@InProceedings{manthey_et_al:LIPIcs.STACS.2024.52,
author = {Manthey, Bodo and van Rhijn, Jesse},
title = {{Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {52:1--52:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.52},
URN = {urn:nbn:de:0030-drops-197628},
doi = {10.4230/LIPIcs.STACS.2024.52},
annote = {Keywords: k-means clustering, smoothed analysis, probabilistic analysis, local search, heuristics}
}
@InProceedings{neuen:LIPIcs.STACS.2024.53,
author = {Neuen, Daniel},
title = {{Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {53:1--53:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.53},
URN = {urn:nbn:de:0030-drops-197630},
doi = {10.4230/LIPIcs.STACS.2024.53},
annote = {Keywords: homomorphism indistinguishability, tree-width, Weisfeiler-Leman algorithm, subgraph counts}
}
@InProceedings{ohlmann_et_al:LIPIcs.STACS.2024.54,
author = {Ohlmann, Pierre and Skrzypczak, Micha{\l}},
title = {{Positionality in \Sigma⁰₂ and a Completeness Result}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {54:1--54:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.54},
URN = {urn:nbn:de:0030-drops-197643},
doi = {10.4230/LIPIcs.STACS.2024.54},
annote = {Keywords: infinite duration games, positionality, Borel class \Sigma⁰₂, history determinism}
}
@InProceedings{paul_et_al:LIPIcs.STACS.2024.55,
author = {Paul, Christophe and Protopapas, Evangelos},
title = {{Tree-Layout Based Graph Classes: Proper Chordal Graphs}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {55:1--55:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.55},
URN = {urn:nbn:de:0030-drops-197652},
doi = {10.4230/LIPIcs.STACS.2024.55},
annote = {Keywords: Graph classes, Graph representation, Graph isomorphism}
}
@InProceedings{sanyal:LIPIcs.STACS.2024.56,
author = {Sanyal, Swagato},
title = {{Randomized Query Composition and Product Distributions}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {56:1--56:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.56},
URN = {urn:nbn:de:0030-drops-197668},
doi = {10.4230/LIPIcs.STACS.2024.56},
annote = {Keywords: Randomized query complexity, Decision Tree, Boolean function complexity, Analysis of Boolean functions}
}
@InProceedings{schlotter:LIPIcs.STACS.2024.57,
author = {Schlotter, Ildik\'{o}},
title = {{Shortest Two Disjoint Paths in Conservative Graphs}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {57:1--57:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.57},
URN = {urn:nbn:de:0030-drops-197678},
doi = {10.4230/LIPIcs.STACS.2024.57},
annote = {Keywords: Shortest paths, disjoint paths, conservative weights, graph algorithm}
}
@InProceedings{wang:LIPIcs.STACS.2024.58,
author = {Wang, Haitao},
title = {{Algorithms for Computing Closest Points for Segments}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {58:1--58:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.58},
URN = {urn:nbn:de:0030-drops-197683},
doi = {10.4230/LIPIcs.STACS.2024.58},
annote = {Keywords: Closest points, Voronoi diagrams, Segment dragging queries, Hopcroft’s problem, Algebraic decision tree model}
}
@InProceedings{yolcu:LIPIcs.STACS.2024.59,
author = {Yolcu, Emre},
title = {{Lower Bounds for Set-Blocked Clauses Proofs}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {59:1--59:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.59},
URN = {urn:nbn:de:0030-drops-197698},
doi = {10.4230/LIPIcs.STACS.2024.59},
annote = {Keywords: proof complexity, separations, resolution, extended resolution, blocked clauses}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing