Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, and Daniel J. Zhang. Distance Queries over Dynamic Interval Graphs. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 18:1-18:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2023.18, author = {Chen, Jingbang and He, Meng and Munro, J. Ian and Peng, Richard and Wu, Kaiyu and Zhang, Daniel J.}, title = {{Distance Queries over Dynamic Interval Graphs}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {18:1--18:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.18}, URN = {urn:nbn:de:0030-drops-193207}, doi = {10.4230/LIPIcs.ISAAC.2023.18}, annote = {Keywords: interval graph, proper interval graph, intersection graph, geometric intersection graph, distance oracle, distance query, shortest path query, dynamic graph} }
Published in: Dagstuhl Reports, Volume 12, Issue 3 (2022)
Katarzyna Budzynska, Chris Reed, Manfred Stede, Benno Stein, and Zhang He. Framing in Communication: From Theories to Computation (Dagstuhl Seminar 22131). In Dagstuhl Reports, Volume 12, Issue 3, pp. 117-140, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{budzynska_et_al:DagRep.12.3.117, author = {Budzynska, Katarzyna and Reed, Chris and Stede, Manfred and Stein, Benno and He, Zhang}, title = {{Framing in Communication: From Theories to Computation (Dagstuhl Seminar 22131)}}, pages = {117--140}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {12}, number = {3}, editor = {Budzynska, Katarzyna and Reed, Chris and Stede, Manfred and Stein, Benno and He, Zhang}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.3.117}, URN = {urn:nbn:de:0030-drops-172713}, doi = {10.4230/DagRep.12.3.117}, annote = {Keywords: Communication Strategies, Discourse and Dialogue, Computational Argumentation, Natural Language Processing} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Karl Bringmann and Alejandro Cassis. Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 31:1-31:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bringmann_et_al:LIPIcs.ICALP.2022.31, author = {Bringmann, Karl and Cassis, Alejandro}, title = {{Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {31:1--31:21}, 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.31}, URN = {urn:nbn:de:0030-drops-163727}, doi = {10.4230/LIPIcs.ICALP.2022.31}, annote = {Keywords: Knapsack, Approximation Schemes, Fine-Grained Complexity, Min-Plus Convolution} }
Published in: LIPIcs, Volume 199, 2nd Conference on Information-Theoretic Cryptography (ITC 2021)
Xinze Li, Qiang Tang, and Zhenfeng Zhang. Fooling an Unbounded Adversary with a Short Key, Repeatedly: The Honey Encryption Perspective. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 23:1-23:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{li_et_al:LIPIcs.ITC.2021.23, author = {Li, Xinze and Tang, Qiang and Zhang, Zhenfeng}, title = {{Fooling an Unbounded Adversary with a Short Key, Repeatedly: The Honey Encryption Perspective}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {23:1--23:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.23}, URN = {urn:nbn:de:0030-drops-143425}, doi = {10.4230/LIPIcs.ITC.2021.23}, annote = {Keywords: unconditional security, information theoretic encryption, honey encryption} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Ran Duan, Haoqing He, and Tianyi Zhang. A Scaling Algorithm for Weighted f-Factors in General Graphs. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 41:1-41:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{duan_et_al:LIPIcs.ICALP.2020.41, author = {Duan, Ran and He, Haoqing and Zhang, Tianyi}, title = {{A Scaling Algorithm for Weighted f-Factors in General Graphs}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {41:1--41:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.41}, URN = {urn:nbn:de:0030-drops-124487}, doi = {10.4230/LIPIcs.ICALP.2020.41}, annote = {Keywords: Scaling Algorithm, f-Factors, General Graphs} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Yihan Zhang, Amitalok J. Budkuley, and Sidharth Jaggi. Generalized List Decoding. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 51:1-51:83, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{zhang_et_al:LIPIcs.ITCS.2020.51, author = {Zhang, Yihan and Budkuley, Amitalok J. and Jaggi, Sidharth}, title = {{Generalized List Decoding}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {51:1--51:83}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.51}, URN = {urn:nbn:de:0030-drops-117368}, doi = {10.4230/LIPIcs.ITCS.2020.51}, annote = {Keywords: Generalized Plotkin bound, general adversarial channels, equicoupled codes, random coding, completely positive tensors, copositive tensors, hypergraph Ramsey theory} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Mark de Berg, Sándor Kisfaludi-Bak, and Mehran Mehr. On One-Round Discrete Voronoi Games. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2019.37, author = {de Berg, Mark and Kisfaludi-Bak, S\'{a}ndor and Mehr, Mehran}, title = {{On One-Round Discrete Voronoi Games}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {37:1--37:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.37}, URN = {urn:nbn:de:0030-drops-115339}, doi = {10.4230/LIPIcs.ISAAC.2019.37}, annote = {Keywords: competitive facility location, plurality point} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Meng He and Serikzhan Kazi. Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 45:1-45:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{he_et_al:LIPIcs.ISAAC.2019.45, author = {He, Meng and Kazi, Serikzhan}, title = {{Path and Ancestor Queries over Trees with Multidimensional Weight Vectors}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {45:1--45:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.45}, URN = {urn:nbn:de:0030-drops-115415}, doi = {10.4230/LIPIcs.ISAAC.2019.45}, annote = {Keywords: path queries, range queries, algorithms, data structures, theory} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, and Bryce Sandlund. On Approximate Range Mode and Range Selection. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 57:1-57:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{elzein_et_al:LIPIcs.ISAAC.2019.57, author = {El-Zein, Hicham and He, Meng and Munro, J. Ian and Nekrich, Yakov and Sandlund, Bryce}, title = {{On Approximate Range Mode and Range Selection}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {57:1--57:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.57}, URN = {urn:nbn:de:0030-drops-115531}, doi = {10.4230/LIPIcs.ISAAC.2019.57}, annote = {Keywords: data structures, approximate range query, range mode, range median} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Xiaoming Sun, David P. Woodruff, Guang Yang, and Jialin Zhang. Querying a Matrix Through Matrix-Vector Products. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 94:1-94:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{sun_et_al:LIPIcs.ICALP.2019.94, author = {Sun, Xiaoming and Woodruff, David P. and Yang, Guang and Zhang, Jialin}, title = {{Querying a Matrix Through Matrix-Vector Products}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {94:1--94:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.94}, URN = {urn:nbn:de:0030-drops-106709}, doi = {10.4230/LIPIcs.ICALP.2019.94}, annote = {Keywords: Communication complexity, linear algebra, sketching} }
Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)
Véronique Bruyère, Quentin Hautem, and Jean-François Raskin. Parameterized complexity of games with monotonically ordered omega-regular objectives. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bruyere_et_al:LIPIcs.CONCUR.2018.29, author = {Bruy\`{e}re, V\'{e}ronique and Hautem, Quentin and Raskin, Jean-Fran\c{c}ois}, title = {{Parameterized complexity of games with monotonically ordered omega-regular objectives}}, booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-087-3}, ISSN = {1868-8969}, year = {2018}, volume = {118}, editor = {Schewe, Sven and Zhang, Lijun}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.29}, URN = {urn:nbn:de:0030-drops-95673}, doi = {10.4230/LIPIcs.CONCUR.2018.29}, annote = {Keywords: two-player zero-sum games played on graphs, omega-regular objectives, ordered objectives, parameterized complexity} }
Feedback for Dagstuhl Publishing