Published in: Dagstuhl Reports, Volume 13, Issue 10 (2024)
Sven Dietrich, Frank Kargl, Hartmut König, Pavel Laskov, and Artur Hermann. Network Attack Detection and Defense - AI-Powered Threats and Responses (Dagstuhl Seminar 23431). In Dagstuhl Reports, Volume 13, Issue 10, pp. 90-129, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{dietrich_et_al:DagRep.13.10.90, author = {Dietrich, Sven and Kargl, Frank and K\"{o}nig, Hartmut and Laskov, Pavel and Hermann, Artur}, title = {{Network Attack Detection and Defense - AI-Powered Threats and Responses (Dagstuhl Seminar 23431)}}, pages = {90--129}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {13}, number = {10}, editor = {Dietrich, Sven and Kargl, Frank and K\"{o}nig, Hartmut and Laskov, Pavel and Hermann, Artur}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.10.90}, URN = {urn:nbn:de:0030-drops-198365}, doi = {10.4230/DagRep.13.10.90}, annote = {Keywords: artificial intelligence, cybersecurity, intrusion detection, machine learning} }
Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Euiwoong Lee and Pasin Manurangsi. Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 71:1-71:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{lee_et_al:LIPIcs.ITCS.2024.71, author = {Lee, Euiwoong and Manurangsi, Pasin}, title = {{Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {71:1--71:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.71}, URN = {urn:nbn:de:0030-drops-195996}, doi = {10.4230/LIPIcs.ITCS.2024.71}, annote = {Keywords: Hardness of Approximation, Bounded Degree, Constraint Satisfaction Problems, Independent Set} }
Published in: LIPIcs, Volume 255, 26th International Conference on Database Theory (ICDT 2023)
Pavel Raykov. An Optimal Algorithm for Sliding Window Order Statistics. In 26th International Conference on Database Theory (ICDT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 255, pp. 5:1-5:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{raykov:LIPIcs.ICDT.2023.5, author = {Raykov, Pavel}, title = {{An Optimal Algorithm for Sliding Window Order Statistics}}, booktitle = {26th International Conference on Database Theory (ICDT 2023)}, pages = {5:1--5:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-270-9}, ISSN = {1868-8969}, year = {2023}, volume = {255}, editor = {Geerts, Floris and Vandevoort, Brecht}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2023.5}, URN = {urn:nbn:de:0030-drops-177479}, doi = {10.4230/LIPIcs.ICDT.2023.5}, annote = {Keywords: sliding window, order statistics, median, selection algorithms} }
Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Cezar-Mihail Alexandru, Pavel Dvořák, Christian Konrad, and Kheeran K. Naidu. Improved Weighted Matching in the Sliding Window Model. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 6:1-6:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{alexandru_et_al:LIPIcs.STACS.2023.6, author = {Alexandru, Cezar-Mihail and Dvo\v{r}\'{a}k, Pavel and Konrad, Christian and Naidu, Kheeran K.}, title = {{Improved Weighted Matching in the Sliding Window Model}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {6:1--6:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-266-2}, ISSN = {1868-8969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.6}, URN = {urn:nbn:de:0030-drops-176585}, doi = {10.4230/LIPIcs.STACS.2023.6}, annote = {Keywords: Sliding window algorithms, Streaming algorithms, Maximum-weight matching} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Pavel Dvořák, Tomáš Masařík, Jana Novotná, Monika Krawczyk, Paweł Rzążewski, and Aneta Żuk. List Locally Surjective Homomorphisms in Hereditary Graph Classes. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dvorak_et_al:LIPIcs.ISAAC.2022.30, author = {Dvo\v{r}\'{a}k, Pavel and Masa\v{r}{\'\i}k, Tom\'{a}\v{s} and Novotn\'{a}, Jana and Krawczyk, Monika and Rz\k{a}\.{z}ewski, Pawe{\l} and \.{Z}uk, Aneta}, title = {{List Locally Surjective Homomorphisms in Hereditary Graph Classes}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.30}, URN = {urn:nbn:de:0030-drops-173154}, doi = {10.4230/LIPIcs.ISAAC.2022.30}, annote = {Keywords: Homomorphism, Hereditary graphs, Subexponential-time algorithms} }
Published in: LIPIcs, Volume 242, 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022)
Leena Salmela. Efficient Solutions to Biological Problems Using de Bruijn Graphs (Invited Talk). In 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 242, pp. 1:1-1:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{salmela:LIPIcs.WABI.2022.1, author = {Salmela, Leena}, title = {{Efficient Solutions to Biological Problems Using de Bruijn Graphs}}, booktitle = {22nd International Workshop on Algorithms in Bioinformatics (WABI 2022)}, pages = {1:1--1:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-243-3}, ISSN = {1868-8969}, year = {2022}, volume = {242}, editor = {Boucher, Christina and Rahmann, Sven}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2022.1}, URN = {urn:nbn:de:0030-drops-170357}, doi = {10.4230/LIPIcs.WABI.2022.1}, annote = {Keywords: de Bruijn graph, variable order de Bruijn graph, genome assembly, sequencing error correction, k-mers} }
Published in: LIPIcs, Volume 234, 37th Computational Complexity Conference (CCC 2022)
Svyatoslav Gryaznov, Pavel Pudlák, and Navid Talebanfard. Linear Branching Programs and Directional Affine Extractors. In 37th Computational Complexity Conference (CCC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 234, pp. 4:1-4:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gryaznov_et_al:LIPIcs.CCC.2022.4, author = {Gryaznov, Svyatoslav and Pudl\'{a}k, Pavel and Talebanfard, Navid}, title = {{Linear Branching Programs and Directional Affine Extractors}}, booktitle = {37th Computational Complexity Conference (CCC 2022)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-241-9}, ISSN = {1868-8969}, year = {2022}, volume = {234}, editor = {Lovett, Shachar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.4}, URN = {urn:nbn:de:0030-drops-165664}, doi = {10.4230/LIPIcs.CCC.2022.4}, annote = {Keywords: Boolean Functions, Average-Case Lower Bounds, AC0\lbrack2\rbrack, Affine Dispersers, Affine Extractors} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Pavel Veselý. Streaming Algorithms for Geometric Steiner Forest. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 47:1-47:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{czumaj_et_al:LIPIcs.ICALP.2022.47, author = {Czumaj, Artur and Jiang, Shaofeng H.-C. and Krauthgamer, Robert and Vesel\'{y}, Pavel}, title = {{Streaming Algorithms for Geometric Steiner Forest}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {47:1--47:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.47}, URN = {urn:nbn:de:0030-drops-163880}, doi = {10.4230/LIPIcs.ICALP.2022.47}, annote = {Keywords: Steiner forest, streaming, sublinear algorithms, dynamic programming} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Martin Balko, Manfred Scheucher, and Pavel Valtr. Erdős-Szekeres-Type Problems in the Real Projective Plane. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{balko_et_al:LIPIcs.SoCG.2022.10, author = {Balko, Martin and Scheucher, Manfred and Valtr, Pavel}, title = {{Erd\H{o}s-Szekeres-Type Problems in the Real Projective Plane}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.10}, URN = {urn:nbn:de:0030-drops-160182}, doi = {10.4230/LIPIcs.SoCG.2022.10}, annote = {Keywords: real projective plane, point set, convex position, k-gon, k-hole, Erd\H{o}s-Szekeres theorem, Horton set, random point set} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Pavel Dvořák, Michal Koucký, Karel Král, and Veronika Slívová. Data Structures Lower Bounds and Popular Conjectures. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 39:1-39:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dvorak_et_al:LIPIcs.ESA.2021.39, author = {Dvo\v{r}\'{a}k, Pavel and Kouck\'{y}, Michal and Kr\'{a}l, Karel and Sl{\'\i}vov\'{a}, Veronika}, title = {{Data Structures Lower Bounds and Popular Conjectures}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {39:1--39:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.39}, URN = {urn:nbn:de:0030-drops-146207}, doi = {10.4230/LIPIcs.ESA.2021.39}, annote = {Keywords: Data structures, Circuits, Lower bounds, Network Coding Conjecture} }
Published in: LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Pavel Dvořák and Michal Koucký. Barrington Plays Cards: The Complexity of Card-Based Protocols. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 26:1-26:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dvorak_et_al:LIPIcs.STACS.2021.26, author = {Dvo\v{r}\'{a}k, Pavel and Kouck\'{y}, Michal}, title = {{Barrington Plays Cards: The Complexity of Card-Based Protocols}}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}, pages = {26:1--26:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-180-1}, ISSN = {1868-8969}, year = {2021}, volume = {187}, editor = {Bl\"{a}ser, Markus and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.26}, URN = {urn:nbn:de:0030-drops-136715}, doi = {10.4230/LIPIcs.STACS.2021.26}, annote = {Keywords: Efficient card-based protocol, Branching program, Turing machine} }
Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)
Pavel Dvořák and Bruno Loff. Lower Bounds for Semi-adaptive Data Structures via Corruption. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 20:1-20:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dvorak_et_al:LIPIcs.FSTTCS.2020.20, author = {Dvo\v{r}\'{a}k, Pavel and Loff, Bruno}, title = {{Lower Bounds for Semi-adaptive Data Structures via Corruption}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {20:1--20:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-174-0}, ISSN = {1868-8969}, year = {2020}, volume = {182}, editor = {Saxena, Nitin and Simon, Sunil}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.20}, URN = {urn:nbn:de:0030-drops-132617}, doi = {10.4230/LIPIcs.FSTTCS.2020.20}, annote = {Keywords: semi-adaptive dynamic data structure, polynomial lower bound, corruption bound, information theory} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Martin Balko, Manfred Scheucher, and Pavel Valtr. Holes and Islands in Random Point Sets. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{balko_et_al:LIPIcs.SoCG.2020.14, author = {Balko, Martin and Scheucher, Manfred and Valtr, Pavel}, title = {{Holes and Islands in Random Point Sets}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {14:1--14:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.14}, URN = {urn:nbn:de:0030-drops-121722}, doi = {10.4230/LIPIcs.SoCG.2020.14}, annote = {Keywords: stochastic geometry, random point set, Erd\H{o}s-Szekeres type problem, k-hole, k-island, empty polytope, convex position, Horton set} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Zuzana Patáková. Bounding Radon Number via Betti Numbers. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 61:1-61:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{patakova:LIPIcs.SoCG.2020.61, author = {Pat\'{a}kov\'{a}, Zuzana}, title = {{Bounding Radon Number via Betti Numbers}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {61:1--61:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.61}, URN = {urn:nbn:de:0030-drops-122198}, doi = {10.4230/LIPIcs.SoCG.2020.61}, annote = {Keywords: Radon number, topological complexity, constrained chain maps, fractional Helly theorem, convexity spaces} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Zuzana Patáková, Martin Tancer, and Uli Wagner. Barycentric Cuts Through a Convex Body. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 62:1-62:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{patakova_et_al:LIPIcs.SoCG.2020.62, author = {Pat\'{a}kov\'{a}, Zuzana and Tancer, Martin and Wagner, Uli}, title = {{Barycentric Cuts Through a Convex Body}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {62:1--62:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.62}, URN = {urn:nbn:de:0030-drops-122201}, doi = {10.4230/LIPIcs.SoCG.2020.62}, annote = {Keywords: convex body, barycenter, Tukey depth, smooth manifold, critical points} }
Feedback for Dagstuhl Publishing