Published in: LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)
Mayank Goswami and Riko Jacob. On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 23:1-23:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{goswami_et_al:LIPIcs.APPROX/RANDOM.2024.23, author = {Goswami, Mayank and Jacob, Riko}, title = {{On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)}, pages = {23:1--23:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-348-5}, ISSN = {1868-8969}, year = {2024}, volume = {317}, editor = {Kumar, Amit and Ron-Zewi, Noga}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.23}, URN = {urn:nbn:de:0030-drops-210168}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.23}, annote = {Keywords: Sorting, Priced Information, Instance Optimality, Nuts and Bolts} }
Published in: LIPIcs, Volume 206, 28th International Symposium on Temporal Representation and Reasoning (TIME 2021)
Alexandros Spitalas, Anastasios Gounaris, Kostas Tsichlas, and Andreas Kosmatopoulos. Investigation of Database Models for Evolving Graphs. In 28th International Symposium on Temporal Representation and Reasoning (TIME 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 206, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{spitalas_et_al:LIPIcs.TIME.2021.6, author = {Spitalas, Alexandros and Gounaris, Anastasios and Tsichlas, Kostas and Kosmatopoulos, Andreas}, title = {{Investigation of Database Models for Evolving Graphs}}, booktitle = {28th International Symposium on Temporal Representation and Reasoning (TIME 2021)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-206-8}, ISSN = {1868-8969}, year = {2021}, volume = {206}, editor = {Combi, Carlo and Eder, Johann and Reynolds, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2021.6}, URN = {urn:nbn:de:0030-drops-147821}, doi = {10.4230/LIPIcs.TIME.2021.6}, annote = {Keywords: Temporal Graphs, Indexing} }
Published in: LIPIcs, Volume 161, 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)
Evangelos Kipouridis and Kostas Tsichlas. Longest Common Subsequence on Weighted Sequences. In 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 161, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kipouridis_et_al:LIPIcs.CPM.2020.19, author = {Kipouridis, Evangelos and Tsichlas, Kostas}, title = {{Longest Common Subsequence on Weighted Sequences}}, booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-149-8}, ISSN = {1868-8969}, year = {2020}, volume = {161}, editor = {G{\o}rtz, Inge Li and Weimann, Oren}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2020.19}, URN = {urn:nbn:de:0030-drops-121443}, doi = {10.4230/LIPIcs.CPM.2020.19}, annote = {Keywords: WLCS, LCS, weighted sequences, approximation algorithms, lower bound} }
Feedback for Dagstuhl Publishing