Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Andrzej Czygrinow, Michał Hanćkowiak, and Marcin Witkowski. Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 59:1-59:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{czygrinow_et_al:LIPIcs.ISAAC.2021.59, author = {Czygrinow, Andrzej and Han\'{c}kowiak, Micha{\l} and Witkowski, Marcin}, title = {{Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {59:1--59:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.59}, URN = {urn:nbn:de:0030-drops-154925}, doi = {10.4230/LIPIcs.ISAAC.2021.59}, annote = {Keywords: Distributed algorithms, f-matching, b-matching} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, and Marcin Witkowski. Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 22:1-22:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{czygrinow_et_al:LIPIcs.ISAAC.2018.22, author = {Czygrinow, Andrzej and Hanckowiak, Michal and Wawrzyniak, Wojciech and Witkowski, Marcin}, title = {{Distributed Approximation Algorithms for the Minimum Dominating Set in K\underlineh-Minor-Free Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {22:1--22:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22}, URN = {urn:nbn:de:0030-drops-99705}, doi = {10.4230/LIPIcs.ISAAC.2018.22}, annote = {Keywords: Distributed algorithms, minor-closed family of graphs, MDS} }
Published in: LIPIcs, Volume 98, 21st International Conference on Database Theory (ICDT 2018)
Johannes Doleschal, Wim Martens, Frank Neven, and Adam Witkowski. Satisfiability for SCULPT-Schemas for CSV-Like Data. In 21st International Conference on Database Theory (ICDT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 98, pp. 14:1-14:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{doleschal_et_al:LIPIcs.ICDT.2018.14, author = {Doleschal, Johannes and Martens, Wim and Neven, Frank and Witkowski, Adam}, title = {{Satisfiability for SCULPT-Schemas for CSV-Like Data}}, booktitle = {21st International Conference on Database Theory (ICDT 2018)}, pages = {14:1--14:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-063-7}, ISSN = {1868-8969}, year = {2018}, volume = {98}, editor = {Kimelfeld, Benny and Amsterdamer, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.14}, URN = {urn:nbn:de:0030-drops-85969}, doi = {10.4230/LIPIcs.ICDT.2018.14}, annote = {Keywords: CSV, schema languages, semi-structured data} }
Feedback for Dagstuhl Publishing