@Proceedings{cao_et_al:LIPIcs.ISAAC.2020,
title = {{LIPIcs, Volume 181, ISAAC 2020, Complete Volume}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {1--1012},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020},
URN = {urn:nbn:de:0030-drops-133439},
doi = {10.4230/LIPIcs.ISAAC.2020},
annote = {Keywords: LIPIcs, Volume 181, ISAAC 2020, Complete Volume}
}
@InProceedings{cao_et_al:LIPIcs.ISAAC.2020.0,
author = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {0:i--0:xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.0},
URN = {urn:nbn:de:0030-drops-133448},
doi = {10.4230/LIPIcs.ISAAC.2020.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{oum:LIPIcs.ISAAC.2020.1,
author = {Oum, Sang-il},
title = {{How to Decompose a Graph into a Tree-Like Structure}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.1},
URN = {urn:nbn:de:0030-drops-133458},
doi = {10.4230/LIPIcs.ISAAC.2020.1},
annote = {Keywords: tree-width, rank-width}
}
@InProceedings{yi:LIPIcs.ISAAC.2020.2,
author = {Yi, Ke},
title = {{Worst-Case Optimal Join Algorithms}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.2},
URN = {urn:nbn:de:0030-drops-133462},
doi = {10.4230/LIPIcs.ISAAC.2020.2},
annote = {Keywords: query evaluation}
}
@InProceedings{dublois_et_al:LIPIcs.ISAAC.2020.3,
author = {Dublois, Louis and Hanaka, Tesshu and Khosravian Ghadikolaei, Mehdi and Lampis, Michael and Melissinos, Nikolaos},
title = {{(In)approximability of Maximum Minimal FVS}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {3:1--3:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.3},
URN = {urn:nbn:de:0030-drops-133477},
doi = {10.4230/LIPIcs.ISAAC.2020.3},
annote = {Keywords: Approximation Algorithms, ETH, Inapproximability}
}
@InProceedings{agrawal_et_al:LIPIcs.ISAAC.2020.4,
author = {Agrawal, Anadi and Gawrychowski, Pawe{\l}},
title = {{A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {4:1--4:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.4},
URN = {urn:nbn:de:0030-drops-133487},
doi = {10.4230/LIPIcs.ISAAC.2020.4},
annote = {Keywords: Longest Common Increasing Subsequence, Four Russians}
}
@InProceedings{feng_et_al:LIPIcs.ISAAC.2020.5,
author = {Feng, Qilong and Zhang, Zhen and Huang, Ziyun and Xu, Jinhui and Wang, Jianxin},
title = {{A Unified Framework of FPT Approximation Algorithms for Clustering Problems}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {5:1--5:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.5},
URN = {urn:nbn:de:0030-drops-133495},
doi = {10.4230/LIPIcs.ISAAC.2020.5},
annote = {Keywords: clustering, approximation algorithms, fixed-parameter tractability}
}
@InProceedings{sakai_et_al:LIPIcs.ISAAC.2020.6,
author = {Sakai, Yoshifumi and Inenaga, Shunsuke},
title = {{A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.6},
URN = {urn:nbn:de:0030-drops-133508},
doi = {10.4230/LIPIcs.ISAAC.2020.6},
annote = {Keywords: algorithms, dynamic time warping distance, longest increasing subsequence, semi-local sequence comparison}
}
@InProceedings{chakraborty_et_al:LIPIcs.ISAAC.2020.7,
author = {Chakraborty, Dibyayan and Das, Sandip and Foucaud, Florent and Gahlawat, Harmender and Lajou, Dimitri and Roy, Bodhayan},
title = {{Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.7},
URN = {urn:nbn:de:0030-drops-133516},
doi = {10.4230/LIPIcs.ISAAC.2020.7},
annote = {Keywords: Geodetic set, Planar graph, Chordal graph, Interval graph, FPT algorithm}
}
@InProceedings{bruckner_et_al:LIPIcs.ISAAC.2020.8,
author = {Br\"{u}ckner, Guido and Rutter, Ignaz},
title = {{An SPQR-Tree-Like Embedding Representation for Level Planarity}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.8},
URN = {urn:nbn:de:0030-drops-133526},
doi = {10.4230/LIPIcs.ISAAC.2020.8},
annote = {Keywords: SPQR-tree, Level planarity, Partial drawings, Simultaneous drawings}
}
@InProceedings{gudmundsson_et_al:LIPIcs.ISAAC.2020.9,
author = {Gudmundsson, Joachim and Sha, Yuan and Wong, Sampson},
title = {{Approximating the Packedness of Polygonal Curves}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {9:1--9:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.9},
URN = {urn:nbn:de:0030-drops-133530},
doi = {10.4230/LIPIcs.ISAAC.2020.9},
annote = {Keywords: Computational geometry, trajectories, realistic input models}
}
@InProceedings{pang_et_al:LIPIcs.ISAAC.2020.10,
author = {Pang, Haozhou and Salavatipour, Mohammad R.},
title = {{Approximation Algorithms for Generalized Path Scheduling}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.10},
URN = {urn:nbn:de:0030-drops-133547},
doi = {10.4230/LIPIcs.ISAAC.2020.10},
annote = {Keywords: Approximation Algorithms, Path Scheduling, Flow shop, Job Shop}
}
@InProceedings{hyattdenesik_et_al:LIPIcs.ISAAC.2020.11,
author = {Hyatt-Denesik, Dylan and Rahgoshay, Mirmahdi and Salavatipour, Mohammad R.},
title = {{Approximations for Throughput Maximization}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.11},
URN = {urn:nbn:de:0030-drops-133555},
doi = {10.4230/LIPIcs.ISAAC.2020.11},
annote = {Keywords: Scheduling, Approximation Algorithms, Throughput Maximization}
}
@InProceedings{alcock_et_al:LIPIcs.ISAAC.2020.12,
author = {Alcock, Leo and Asif, Sualeh and Bosboom, Jeffrey and Brunner, Josh and Chen, Charlotte and Demaine, Erik D. and Epstein, Rogers and Hesterberg, Adam and Hirschfeld, Lior and Hu, William and Lynch, Jayson and Scheffler, Sarah and Zhang, Lillian},
title = {{Arithmetic Expression Construction}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.12},
URN = {urn:nbn:de:0030-drops-133568},
doi = {10.4230/LIPIcs.ISAAC.2020.12},
annote = {Keywords: Hardness, algebraic complexity, expression trees}
}
@InProceedings{vankreveld_et_al:LIPIcs.ISAAC.2020.13,
author = {van Kreveld, Marc and Miltzow, Tillmann and Ophelders, Tim and Sonke, Willem and Vermeulen, Jordi L.},
title = {{Between Shapes, Using the Hausdorff Distance}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.13},
URN = {urn:nbn:de:0030-drops-133572},
doi = {10.4230/LIPIcs.ISAAC.2020.13},
annote = {Keywords: computational geometry, Hausdorff distance, shape interpolation}
}
@InProceedings{nguyen_et_al:LIPIcs.ISAAC.2020.14,
author = {Nguyen, Trung Thanh and Rothe, J\"{o}rg},
title = {{Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.14},
URN = {urn:nbn:de:0030-drops-133582},
doi = {10.4230/LIPIcs.ISAAC.2020.14},
annote = {Keywords: bi-criteria approximation algorithm, polynomial-time approximation algorithm, load balancing, machine scheduling}
}
@InProceedings{asano_et_al:LIPIcs.ISAAC.2020.15,
author = {Asano, Takao and Umeda, Hiroyuki},
title = {{Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.15},
URN = {urn:nbn:de:0030-drops-133599},
doi = {10.4230/LIPIcs.ISAAC.2020.15},
annote = {Keywords: cake-cutting problem, envy-freeness, fairness, truthfulness, mechanism design}
}
@InProceedings{mulzer_et_al:LIPIcs.ISAAC.2020.16,
author = {Mulzer, Wolfgang and Willert, Max},
title = {{Compact Routing in Unit Disk Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.16},
URN = {urn:nbn:de:0030-drops-133602},
doi = {10.4230/LIPIcs.ISAAC.2020.16},
annote = {Keywords: routing scheme, unit disk graph, separator}
}
@InProceedings{brunner_et_al:LIPIcs.ISAAC.2020.17,
author = {Brunner, Josh and Demaine, Erik D. and Hendrickson, Dylan and Wellman, Julian},
title = {{Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.17},
URN = {urn:nbn:de:0030-drops-133618},
doi = {10.4230/LIPIcs.ISAAC.2020.17},
annote = {Keywords: hardness, board games, PSPACE}
}
@InProceedings{koutecky_et_al:LIPIcs.ISAAC.2020.18,
author = {Kouteck\'{y}, Martin and Zink, Johannes},
title = {{Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {18:1--18:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.18},
URN = {urn:nbn:de:0030-drops-133620},
doi = {10.4230/LIPIcs.ISAAC.2020.18},
annote = {Keywords: Scheduling, cutting stock, hardness, parameterized complexity}
}
@InProceedings{frei_et_al:LIPIcs.ISAAC.2020.19,
author = {Frei, Fabian and Hemaspaandra, Edith and Rothe, J\"{o}rg},
title = {{Complexity of Stability}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.19},
URN = {urn:nbn:de:0030-drops-133631},
doi = {10.4230/LIPIcs.ISAAC.2020.19},
annote = {Keywords: Stability, Robustness, Complexity, Local Modifications, Colorability, Vertex Cover, Clique, Independent Set, Satisfiability, Unfrozenness, Criticality, DP, coDP, Parallel Access to NP}
}
@InProceedings{koana_et_al:LIPIcs.ISAAC.2020.20,
author = {Koana, Tomohiro and Komusiewicz, Christian and Sommer, Frank},
title = {{Computing Dense and Sparse Subgraphs of Weakly Closed Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.20},
URN = {urn:nbn:de:0030-drops-133646},
doi = {10.4230/LIPIcs.ISAAC.2020.20},
annote = {Keywords: Fixed-parameter tractability, c-closure, degeneracy, clique relaxations, bicliques, dominating set}
}
@InProceedings{kim_et_al:LIPIcs.ISAAC.2020.21,
author = {Kim, Kangsan and Shin, Yongho and An, Hyung-Chan},
title = {{Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {21:1--21:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.21},
URN = {urn:nbn:de:0030-drops-133652},
doi = {10.4230/LIPIcs.ISAAC.2020.21},
annote = {Keywords: Facility location problems, approximation algorithms, clustering problems, parity constraints}
}
@InProceedings{kern_et_al:LIPIcs.ISAAC.2020.22,
author = {Kern, Walter and Paulusma, Dani\"{e}l},
title = {{Contracting to a Longest Path in H-Free Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.22},
URN = {urn:nbn:de:0030-drops-133664},
doi = {10.4230/LIPIcs.ISAAC.2020.22},
annote = {Keywords: dichotomy, edge contraction, path, cycle, H-free graph}
}
@InProceedings{dudek_et_al:LIPIcs.ISAAC.2020.23,
author = {Dudek, Bart{\l}omiej and Gawrychowski, Pawe{\l}},
title = {{Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {23:1--23:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.23},
URN = {urn:nbn:de:0030-drops-133678},
doi = {10.4230/LIPIcs.ISAAC.2020.23},
annote = {Keywords: Permutations, pattern avoidance, counting cycles}
}
@InProceedings{dey_et_al:LIPIcs.ISAAC.2020.24,
author = {Dey, Sanjana and Foucaud, Florent and Nandy, Subhas C. and Sen, Arunabha},
title = {{Discriminating Codes in Geometric Setups}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {24:1--24:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.24},
URN = {urn:nbn:de:0030-drops-133686},
doi = {10.4230/LIPIcs.ISAAC.2020.24},
annote = {Keywords: Discriminating code, Approximation algorithm, Segment stabbing, Geometric Hitting set}
}
@InProceedings{he_et_al:LIPIcs.ISAAC.2020.25,
author = {He, Meng and Munro, J. Ian and Nekrich, Yakov and Wild, Sebastian and Wu, Kaiyu},
title = {{Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {25:1--25:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.25},
URN = {urn:nbn:de:0030-drops-133693},
doi = {10.4230/LIPIcs.ISAAC.2020.25},
annote = {Keywords: succinct data structures, distance oracles, ordinal tree, level order, breadth-first order, interval graphs, proper interval graphs, succinct graph representation}
}
@InProceedings{fomin_et_al:LIPIcs.ISAAC.2020.26,
author = {Fomin, Fedor V. and Golovach, Petr A. and Jaffke, Lars and Philip, Geevarghese and Sagunov, Danil},
title = {{Diverse Pairs of Matchings}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {26:1--26:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.26},
URN = {urn:nbn:de:0030-drops-133706},
doi = {10.4230/LIPIcs.ISAAC.2020.26},
annote = {Keywords: Matching, Solution Diversity, Fixed-Parameter Tractability}
}
@InProceedings{duleba_et_al:LIPIcs.ISAAC.2020.27,
author = {Dul\k{e}ba, Maciej and Gawrychowski, Pawe{\l} and Janczewski, Wojciech},
title = {{Efficient Labeling for Reachability in Directed Acyclic Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.27},
URN = {urn:nbn:de:0030-drops-133710},
doi = {10.4230/LIPIcs.ISAAC.2020.27},
annote = {Keywords: informative labeling scheme, reachability, DAG}
}
@InProceedings{funke_et_al:LIPIcs.ISAAC.2020.28,
author = {Funke, Stefan and Weitbrecht, Felix},
title = {{Efficiently Computing All Delaunay Triangles Occurring over All Contiguous Subsequences}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {28:1--28:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.28},
URN = {urn:nbn:de:0030-drops-133725},
doi = {10.4230/LIPIcs.ISAAC.2020.28},
annote = {Keywords: Computational Geometry, Delaunay Triangulation, Randomized Analysis}
}
@InProceedings{sumigawa_et_al:LIPIcs.ISAAC.2020.29,
author = {Sumigawa, Kentaro and Chakraborty, Sankardeep and Sadakane, Kunihiko and Satti, Srinivasa Rao},
title = {{Enumerating Range Modes}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {29:1--29:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.29},
URN = {urn:nbn:de:0030-drops-133732},
doi = {10.4230/LIPIcs.ISAAC.2020.29},
annote = {Keywords: range mode, space-efficient data structure, enumeration algorithm}
}
@InProceedings{casteigts_et_al:LIPIcs.ISAAC.2020.30,
author = {Casteigts, Arnaud and Himmel, Anne-Sophie and Molter, Hendrik and Zschoche, Philipp},
title = {{Finding Temporal Paths Under Waiting Time Constraints}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {30:1--30:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.30},
URN = {urn:nbn:de:0030-drops-133745},
doi = {10.4230/LIPIcs.ISAAC.2020.30},
annote = {Keywords: Temporal graphs, disease spreading, waiting-time policies, restless temporal paths, timed feedback vertex set, NP-hard problems, parameterized algorithms}
}
@InProceedings{bradshaw_et_al:LIPIcs.ISAAC.2020.31,
author = {Bradshaw, Peter and Masa\v{r}k, Tom\'{a}\v{s} and Stacho, Ladislav},
title = {{Flexible List Colorings in Graphs with Special Degeneracy Conditions}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {31:1--31:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.31},
URN = {urn:nbn:de:0030-drops-133750},
doi = {10.4230/LIPIcs.ISAAC.2020.31},
annote = {Keywords: Flexibility, List Coloring, Choosability, Degeneracy}
}
@InProceedings{aronov_et_al:LIPIcs.ISAAC.2020.32,
author = {Aronov, Boris and Cardinal, Jean},
title = {{Geometric Pattern Matching Reduces to k-SUM}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {32:1--32:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.32},
URN = {urn:nbn:de:0030-drops-133760},
doi = {10.4230/LIPIcs.ISAAC.2020.32},
annote = {Keywords: Geometric pattern matching, k-SUM problem, Linear decision trees}
}
@InProceedings{hamersma_et_al:LIPIcs.ISAAC.2020.33,
author = {Hamersma, Joep and van Kreveld, Marc and Uno, Yushi and van der Zanden, Tom C.},
title = {{Gourds: A Sliding-Block Puzzle with Turning}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {33:1--33:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.33},
URN = {urn:nbn:de:0030-drops-133773},
doi = {10.4230/LIPIcs.ISAAC.2020.33},
annote = {Keywords: computational complexity, divide-and-conquer, Hamiltonian cycle, puzzle game, (combinatorial) reconfiguration, sliding-block puzzle}
}
@InProceedings{gowda_et_al:LIPIcs.ISAAC.2020.34,
author = {Gowda, Kishen N. and Lonkar, Aditya and Panolan, Fahad and Patel, Vraj and Saurabh, Saket},
title = {{Improved FPT Algorithms for Deletion to Forest-Like Structures}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {34:1--34:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.34},
URN = {urn:nbn:de:0030-drops-133781},
doi = {10.4230/LIPIcs.ISAAC.2020.34},
annote = {Keywords: Parameterized Complexity, Independent Feedback Vertex Set, PseudoForest, Almost Forest, Cut and Count, Treewidth}
}
@InProceedings{kim_et_al:LIPIcs.ISAAC.2020.35,
author = {Kim, Sung-Hwan and Cho, Hwan-Gue},
title = {{Indexing Isodirectional Pointer Sequences}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {35:1--35:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.35},
URN = {urn:nbn:de:0030-drops-133797},
doi = {10.4230/LIPIcs.ISAAC.2020.35},
annote = {Keywords: String Matching, Suffix Array, FM-index, Wavelet Tree, Range Minimum Query, Parameterized String Matching, Cartesian Tree Matching}
}
@InProceedings{bentert_et_al:LIPIcs.ISAAC.2020.36,
author = {Bentert, Matthias and Heeger, Klaus and Knop, Du\v{s}an},
title = {{Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {36:1--36:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.36},
URN = {urn:nbn:de:0030-drops-133800},
doi = {10.4230/LIPIcs.ISAAC.2020.36},
annote = {Keywords: Edge-disjoint paths, pathwidth, feedback vertex number}
}
@InProceedings{bousquet_et_al:LIPIcs.ISAAC.2020.37,
author = {Bousquet, Nicolas and Joffard, Alice and Ouvrard, Paul},
title = {{Linear Transformations Between Dominating Sets in the TAR-Model}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {37:1--37:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.37},
URN = {urn:nbn:de:0030-drops-133812},
doi = {10.4230/LIPIcs.ISAAC.2020.37},
annote = {Keywords: reconfiguration, dominating sets, addition removal, connectivity, diameter, minor, treewidth}
}
@InProceedings{georgiadis_et_al:LIPIcs.ISAAC.2020.38,
author = {Georgiadis, Loukas and Kosinas, Evangelos},
title = {{Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {38:1--38:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.38},
URN = {urn:nbn:de:0030-drops-133820},
doi = {10.4230/LIPIcs.ISAAC.2020.38},
annote = {Keywords: 2-connectivity, cut pairs, strongly connected components}
}
@InProceedings{berczi_et_al:LIPIcs.ISAAC.2020.39,
author = {B\'{e}rczi, Krist\'{o}f and Kakimura, Naonori and Kobayashi, Yusuke},
title = {{Market Pricing for Matroid Rank Valuations}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {39:1--39:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.39},
URN = {urn:nbn:de:0030-drops-133833},
doi = {10.4230/LIPIcs.ISAAC.2020.39},
annote = {Keywords: Pricing schemes, Walrasian equilibrium, gross substitutes valuations, matroid rank functions}
}
@InProceedings{tamura_et_al:LIPIcs.ISAAC.2020.40,
author = {Tamura, Yuma and Ito, Takehiro and Zhou, Xiao},
title = {{Minimization and Parameterized Variants of Vertex Partition Problems on Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {40:1--40:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.40},
URN = {urn:nbn:de:0030-drops-133844},
doi = {10.4230/LIPIcs.ISAAC.2020.40},
annote = {Keywords: Graph Algorithms, Approximability, Fixed-Parameter Tractability, Vertex Partition Problem, Feedback Vertex Set Problem}
}
@InProceedings{kumar:LIPIcs.ISAAC.2020.41,
author = {Kumar, Nikhil},
title = {{Multicommodity Flows in Planar Graphs with Demands on Faces}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {41:1--41:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.41},
URN = {urn:nbn:de:0030-drops-133857},
doi = {10.4230/LIPIcs.ISAAC.2020.41},
annote = {Keywords: Combinatorial Optimization, Multicommodity Flow, Network Design}
}
@InProceedings{chen_et_al:LIPIcs.ISAAC.2020.42,
author = {Chen, Ke and Dumitrescu, Adrian},
title = {{Multiparty Selection}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {42:1--42:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.42},
URN = {urn:nbn:de:0030-drops-133867},
doi = {10.4230/LIPIcs.ISAAC.2020.42},
annote = {Keywords: approximate selection, mediocre element, comparison algorithm, i-th order statistic, tournaments, quantiles, communication complexity}
}
@InProceedings{fluschnik_et_al:LIPIcs.ISAAC.2020.43,
author = {Fluschnik, Till and Niedermeier, Rolf and Schubert, Carsten and Zschoche, Philipp},
title = {{Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {43:1--43:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.43},
URN = {urn:nbn:de:0030-drops-133879},
doi = {10.4230/LIPIcs.ISAAC.2020.43},
annote = {Keywords: Temporal graphs, shortest paths, consecutive similarity, consecutive dissimilarity, parameterized complexity, kernelization, representative sets in temporal graphs}
}
@InProceedings{bartier_et_al:LIPIcs.ISAAC.2020.44,
author = {Bartier, Valentin and Bousquet, Nicolas and Dallard, Cl\'{e}ment and Lomer, Kyle and Mouawad, Amer E.},
title = {{On Girth and the Parameterized Complexity of Token Sliding and Token Jumping}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {44:1--44:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.44},
URN = {urn:nbn:de:0030-drops-133886},
doi = {10.4230/LIPIcs.ISAAC.2020.44},
annote = {Keywords: Combinatorial reconfiguration, Independent Set, Token Jumping, Token Sliding, Parameterized Complexity}
}
@InProceedings{thang:LIPIcs.ISAAC.2020.45,
author = {Thắng, Nguy\~{ê}n Kim},
title = {{Online Primal-Dual Algorithms with Configuration Linear Programs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {45:1--45:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.45},
URN = {urn:nbn:de:0030-drops-133891},
doi = {10.4230/LIPIcs.ISAAC.2020.45},
annote = {Keywords: Configuration Linear Programs, Primal-Dual, Smoothness}
}
@InProceedings{bhaskar_et_al:LIPIcs.ISAAC.2020.46,
author = {Bhaskar, Umang and Kumar, Gunjan},
title = {{Partial Function Extension with Applications to Learning and Property Testing}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {46:1--46:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.46},
URN = {urn:nbn:de:0030-drops-133906},
doi = {10.4230/LIPIcs.ISAAC.2020.46},
annote = {Keywords: Partial function extension, subadditivity, matroid rank, approximation algorithms, learning, property testing}
}
@InProceedings{chia_et_al:LIPIcs.ISAAC.2020.47,
author = {Chia, Nai-Hui and Gily\'{e}n, Andr\'{a}s and Lin, Han-Hsuan and Lloyd, Seth and Tang, Ewin and Wang, Chunhao},
title = {{Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {47:1--47:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.47},
URN = {urn:nbn:de:0030-drops-133916},
doi = {10.4230/LIPIcs.ISAAC.2020.47},
annote = {Keywords: sublinear algorithms, quantum-inspired, regression, importance sampling, quantum machine learning}
}
@InProceedings{bille_et_al:LIPIcs.ISAAC.2020.48,
author = {Bille, Philip and G{\o}rtz, Inge Li},
title = {{Random Access in Persistent Strings}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {48:1--48:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.48},
URN = {urn:nbn:de:0030-drops-133922},
doi = {10.4230/LIPIcs.ISAAC.2020.48},
annote = {Keywords: Data compression, data structures, persistent strings}
}
@InProceedings{holland_et_al:LIPIcs.ISAAC.2020.49,
author = {Holland, William L. and Wirth, Anthony and Zobel, Justin},
title = {{Recency Queries with Succinct Representation}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {49:1--49:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.49},
URN = {urn:nbn:de:0030-drops-133931},
doi = {10.4230/LIPIcs.ISAAC.2020.49},
annote = {Keywords: Succinct Data Structures, Data Streams, Sliding Dictionary}
}
@InProceedings{demaine_et_al:LIPIcs.ISAAC.2020.50,
author = {Demaine, Erik D. and Kopinsky, Justin and Lynch, Jayson},
title = {{Recursed Is Not Recursive: A Jarring Result}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {50:1--50:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.50},
URN = {urn:nbn:de:0030-drops-133940},
doi = {10.4230/LIPIcs.ISAAC.2020.50},
annote = {Keywords: Computational Complexity, Undecidable, Video Games}
}
@InProceedings{montealegre_et_al:LIPIcs.ISAAC.2020.51,
author = {Montealegre, Pedro and Ram{\'\i}rez-Romero, Diego and Rapaport, Ivan},
title = {{Shared vs Private Randomness in Distributed Interactive Proofs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {51:1--51:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.51},
URN = {urn:nbn:de:0030-drops-133959},
doi = {10.4230/LIPIcs.ISAAC.2020.51},
annote = {Keywords: Distributed interactive proofs, Distributed verification, Shared randomness, Private randomness}
}
@InProceedings{oh:LIPIcs.ISAAC.2020.52,
author = {Oh, Eunjin},
title = {{Shortest-Path Queries in Geometric Networks}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {52:1--52:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.52},
URN = {urn:nbn:de:0030-drops-133963},
doi = {10.4230/LIPIcs.ISAAC.2020.52},
annote = {Keywords: Shortest path, Euclidean spanner, data structure}
}
@InProceedings{cantu_et_al:LIPIcs.ISAAC.2020.53,
author = {Cantu, Angel A. and Luchsinger, Austin and Schweller, Robert and Wylie, Tim},
title = {{Signal Passing Self-Assembly Simulates Tile Automata}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {53:1--53:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.53},
URN = {urn:nbn:de:0030-drops-133978},
doi = {10.4230/LIPIcs.ISAAC.2020.53},
annote = {Keywords: self-assembly, signal-passing tile assembly model, tile automata, cellular automata, simulation}
}
@InProceedings{uchizawa:LIPIcs.ISAAC.2020.54,
author = {Uchizawa, Kei},
title = {{Size, Depth and Energy of Threshold Circuits Computing Parity Function}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {54:1--54:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.54},
URN = {urn:nbn:de:0030-drops-133988},
doi = {10.4230/LIPIcs.ISAAC.2020.54},
annote = {Keywords: Circuit complexity, neural networks, threshold circuits, sprase activity, tradeoffs}
}
@InProceedings{labarre:LIPIcs.ISAAC.2020.55,
author = {Labarre, Anthony},
title = {{Sorting by Prefix Block-Interchanges}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {55:1--55:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.55},
URN = {urn:nbn:de:0030-drops-133991},
doi = {10.4230/LIPIcs.ISAAC.2020.55},
annote = {Keywords: permutations, genome rearrangements, interconnection network, sorting, edit distance, prefix block-interchange}
}
@InProceedings{huang:LIPIcs.ISAAC.2020.56,
author = {Huang, Xuangui},
title = {{Space Hardness of Solving Structured Linear Systems}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {56:1--56:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.56},
URN = {urn:nbn:de:0030-drops-134001},
doi = {10.4230/LIPIcs.ISAAC.2020.56},
annote = {Keywords: linear system solver, logarithmic space, threshold circuit}
}
@InProceedings{dumitrescu_et_al:LIPIcs.ISAAC.2020.57,
author = {Dumitrescu, Adrian and Ghosh, Anirban and T\'{o}th, Csaba D.},
title = {{Sparse Hop Spanners for Unit Disk Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {57:1--57:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.57},
URN = {urn:nbn:de:0030-drops-134018},
doi = {10.4230/LIPIcs.ISAAC.2020.57},
annote = {Keywords: graph approximation, \epsilon-net, hop-spanner, unit disk graph, lower bound}
}
@InProceedings{chen_et_al:LIPIcs.ISAAC.2020.58,
author = {Chen, Hubie and Jansen, Bart M. P. and Okrasa, Karolina and Pieterse, Astrid and Rz\k{a}\.{z}ewski, Pawe{\l}},
title = {{Sparsification Lower Bounds for List H-Coloring}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {58:1--58:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.58},
URN = {urn:nbn:de:0030-drops-134027},
doi = {10.4230/LIPIcs.ISAAC.2020.58},
annote = {Keywords: List H-Coloring, Sparsification, Constraint Satisfaction Problem}
}
@InProceedings{bellitto_et_al:LIPIcs.ISAAC.2020.59,
author = {Bellitto, Thomas and Li, Shaohua and Okrasa, Karolina and Pilipczuk, Marcin and Sorge, Manuel},
title = {{The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {59:1--59:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.59},
URN = {urn:nbn:de:0030-drops-134036},
doi = {10.4230/LIPIcs.ISAAC.2020.59},
annote = {Keywords: Graph algorithms, fixed-parameter tractability, parameterized complexity}
}
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2020.60,
author = {de Berg, Mark and Markovic, Aleksandar and Umboh, Seeun William},
title = {{The Online Broadcast Range-Assignment Problem}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {60:1--60:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.60},
URN = {urn:nbn:de:0030-drops-134042},
doi = {10.4230/LIPIcs.ISAAC.2020.60},
annote = {Keywords: Computational geometry, online algorithms, range assignment, broadcast}
}
@InProceedings{krnetic_et_al:LIPIcs.ISAAC.2020.61,
author = {Krneti\'{c}, Predrag and Melnyk, Darya and Wang, Yuyi and Wattenhofer, Roger},
title = {{The k-Server Problem with Delays on the Uniform Metric Space}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {61:1--61:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.61},
URN = {urn:nbn:de:0030-drops-134056},
doi = {10.4230/LIPIcs.ISAAC.2020.61},
annote = {Keywords: Online k-Server, Paging, Delayed Service, Conservative Algorithms}
}
@InProceedings{ahn_et_al:LIPIcs.ISAAC.2020.62,
author = {Ahn, Jungho and Kim, Eun Jung and Lee, Euiwoong},
title = {{Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {62:1--62:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.62},
URN = {urn:nbn:de:0030-drops-134063},
doi = {10.4230/LIPIcs.ISAAC.2020.62},
annote = {Keywords: ptolemaic, approximation algorithm, linear programming, feedback vertex set}
}
@InProceedings{amir_et_al:LIPIcs.ISAAC.2020.63,
author = {Amir, Amihood and Boneh, Itai},
title = {{Update Query Time Trade-Off for Dynamic Suffix Arrays}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {63:1--63:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.63},
URN = {urn:nbn:de:0030-drops-134070},
doi = {10.4230/LIPIcs.ISAAC.2020.63},
annote = {Keywords: String Algorithms, Dynamic Algorithms, Suffix Array, Inverse Suffix Array}
}
@InProceedings{santiago_et_al:LIPIcs.ISAAC.2020.64,
author = {Santiago, Richard and Yoshida, Yuichi},
title = {{Weakly Submodular Function Maximization Using Local Submodularity Ratio}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {64:1--64:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.64},
URN = {urn:nbn:de:0030-drops-134082},
doi = {10.4230/LIPIcs.ISAAC.2020.64},
annote = {Keywords: weakly submodular, non-monotone, local submodularity ratio}
}
@InProceedings{onodera_et_al:LIPIcs.ISAAC.2020.65,
author = {Onodera, Taku and Shibuya, Tetsuo},
title = {{Wear Leveling Revisited}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {65:1--65:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.65},
URN = {urn:nbn:de:0030-drops-134092},
doi = {10.4230/LIPIcs.ISAAC.2020.65},
annote = {Keywords: Wear leveling, Randomized algorithm, Non-volatile memory}
}
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