Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/isaac/isaac2020.bht:"
download as .bib file
@inproceedings{DBLP:conf/isaac/000120,
author = {Ke Yi},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Worst-Case Optimal Join Algorithms (Invited Talk)},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {2:1--2:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.2},
doi = {10.4230/LIPICS.ISAAC.2020.2},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/isaac/000120.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/000120a,
author = {Nikhil Kumar},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Multicommodity Flows in Planar Graphs with Demands on Faces},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {41:1--41:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.41},
doi = {10.4230/LIPICS.ISAAC.2020.41},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/000120a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/000120b,
author = {Eunjin Oh},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Shortest-Path Queries in Geometric Networks},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {52:1--52:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.52},
doi = {10.4230/LIPICS.ISAAC.2020.52},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/000120b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0001G20,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles
in Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {23:1--23:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.23},
doi = {10.4230/LIPICS.ISAAC.2020.23},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/0001G20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0001MNWW20,
author = {Meng He and
J. Ian Munro and
Yakov Nekrich and
Sebastian Wild and
Kaiyu Wu},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Distance Oracles for Interval Graphs via Breadth-First Rank/Select
in Succinct Trees},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {25:1--25:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.25},
doi = {10.4230/LIPICS.ISAAC.2020.25},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/0001MNWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0004R20,
author = {Trung Thanh Nguyen and
J{\"{o}}rg Rothe},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated
Machines with Costs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.14},
doi = {10.4230/LIPICS.ISAAC.2020.14},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/0004R20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0011D20,
author = {Ke Chen and
Adrian Dumitrescu},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Multiparty Selection},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {42:1--42:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.42},
doi = {10.4230/LIPICS.ISAAC.2020.42},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/0011D20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AgrawalG20,
author = {Anadi Agrawal and
Pawel Gawrychowski},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {A Faster Subquadratic Algorithm for the Longest Common Increasing
Subsequence Problem},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {4:1--4:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.4},
doi = {10.4230/LIPICS.ISAAC.2020.4},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AgrawalG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Ahn0L20,
author = {Jungho Ahn and
Eun Jung Kim and
Euiwoong Lee},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Towards Constant-Factor Approximation for Chordal / Distance-Hereditary
Vertex Deletion},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {62:1--62:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.62},
doi = {10.4230/LIPICS.ISAAC.2020.62},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Ahn0L20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AlcockABBCDEHHH20,
author = {Leo Alcock and
Sualeh Asif and
Jeffrey Bosboom and
Josh Brunner and
Charlotte Chen and
Erik D. Demaine and
Rogers Epstein and
Adam Hesterberg and
Lior Hirschfeld and
William Hu and
Jayson Lynch and
Sarah Scheffler and
Lillian Zhang},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Arithmetic Expression Construction},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {12:1--12:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.12},
doi = {10.4230/LIPICS.ISAAC.2020.12},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AlcockABBCDEHHH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AmirB20,
author = {Amihood Amir and
Itai Boneh},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Update Query Time Trade-Off for Dynamic Suffix Arrays},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {63:1--63:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.63},
doi = {10.4230/LIPICS.ISAAC.2020.63},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AmirB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AronovC20,
author = {Boris Aronov and
Jean Cardinal},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Geometric Pattern Matching Reduces to k-SUM},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {32:1--32:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.32},
doi = {10.4230/LIPICS.ISAAC.2020.32},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AronovC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AsanoU20,
author = {Takao Asano and
Hiroyuki Umeda},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
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, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {15:1--15:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.15},
doi = {10.4230/LIPICS.ISAAC.2020.15},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AsanoU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BartierBDLM20,
author = {Valentin Bartier and
Nicolas Bousquet and
Cl{\'{e}}ment Dallard and
Kyle Lomer and
Amer E. Mouawad},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {On Girth and the Parameterized Complexity of Token Sliding and Token
Jumping},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {44:1--44:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.44},
doi = {10.4230/LIPICS.ISAAC.2020.44},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BartierBDLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BellittoLOPS20,
author = {Thomas Bellitto and
Shaohua Li and
Karolina Okrasa and
Marcin Pilipczuk and
Manuel Sorge},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {The Complexity of Connectivity Problems in Forbidden-Transition Graphs
And Edge-Colored Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {59:1--59:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.59},
doi = {10.4230/LIPICS.ISAAC.2020.59},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BellittoLOPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BentertHK20,
author = {Matthias Bentert and
Klaus Heeger and
Dusan Knop},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {36:1--36:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.36},
doi = {10.4230/LIPICS.ISAAC.2020.36},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BentertHK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BercziK020,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Naonori Kakimura and
Yusuke Kobayashi},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Market Pricing for Matroid Rank Valuations},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {39:1--39:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.39},
doi = {10.4230/LIPICS.ISAAC.2020.39},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BercziK020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Berg0U20,
author = {Mark de Berg and
Aleksandar Markovic and
Seeun William Umboh},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {The Online Broadcast Range-Assignment Problem},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {60:1--60:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.60},
doi = {10.4230/LIPICS.ISAAC.2020.60},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Berg0U20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BhaskarK20,
author = {Umang Bhaskar and
Gunjan Kumar},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Partial Function Extension with Applications to Learning and Property
Testing},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {46:1--46:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.46},
doi = {10.4230/LIPICS.ISAAC.2020.46},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BhaskarK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BilleG20,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Random Access in Persistent Strings},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {48:1--48:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.48},
doi = {10.4230/LIPICS.ISAAC.2020.48},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BilleG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BousquetJO20,
author = {Nicolas Bousquet and
Alice Joffard and
Paul Ouvrard},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Linear Transformations Between Dominating Sets in the TAR-Model},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {37:1--37:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.37},
doi = {10.4230/LIPICS.ISAAC.2020.37},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BousquetJO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BradshawMS20,
author = {Peter Bradshaw and
Tom{\'{a}}s Masar{\'{\i}}k and
Ladislav Stacho},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Flexible List Colorings in Graphs with Special Degeneracy Conditions},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {31:1--31:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.31},
doi = {10.4230/LIPICS.ISAAC.2020.31},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BradshawMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrucknerR20,
author = {Guido Br{\"{u}}ckner and
Ignaz Rutter},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {An SPQR-Tree-Like Embedding Representation for Level Planarity},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {8:1--8:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.8},
doi = {10.4230/LIPICS.ISAAC.2020.8},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BrucknerR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrunnerDHW20,
author = {Josh Brunner and
Erik D. Demaine and
Dylan H. Hendrickson and
Julian Wellman},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative
Chess Is Hard},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {17:1--17:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.17},
doi = {10.4230/LIPICS.ISAAC.2020.17},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BrunnerDHW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CantuLSW20,
author = {Angel A. Cantu and
Austin Luchsinger and
Robert T. Schweller and
Tim Wylie},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Signal Passing Self-Assembly Simulates Tile Automata},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {53:1--53:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.53},
doi = {10.4230/LIPICS.ISAAC.2020.53},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/CantuLSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CasteigtsHMZ20,
author = {Arnaud Casteigts and
Anne{-}Sophie Himmel and
Hendrik Molter and
Philipp Zschoche},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Finding Temporal Paths Under Waiting Time Constraints},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {30:1--30:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.30},
doi = {10.4230/LIPICS.ISAAC.2020.30},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CasteigtsHMZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Chakraborty0FGL20,
author = {Dibyayan Chakraborty and
Sandip Das and
Florent Foucaud and
Harmender Gahlawat and
Dimitri Lajou and
Bodhayan Roy},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Algorithms and Complexity for Geodetic Sets on Planar and Chordal
Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {7:1--7:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.7},
doi = {10.4230/LIPICS.ISAAC.2020.7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Chakraborty0FGL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenJOPR20,
author = {Hubie Chen and
Bart M. P. Jansen and
Karolina Okrasa and
Astrid Pieterse and
Pawel Rzazewski},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Sparsification Lower Bounds for List H-Coloring},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {58:1--58:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.58},
doi = {10.4230/LIPICS.ISAAC.2020.58},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChenJOPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChiaGLLTW20,
author = {Nai{-}Hui Chia and
Andr{\'{a}}s Gily{\'{e}}n and
Han{-}Hsuan Lin and
Seth Lloyd and
Ewin Tang and
Chunhao Wang},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
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, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {47:1--47:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.47},
doi = {10.4230/LIPICS.ISAAC.2020.47},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ChiaGLLTW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DemaineKL20,
author = {Erik D. Demaine and
Justin Kopinsky and
Jayson Lynch},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Recursed Is Not Recursive: {A} Jarring Result},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {50:1--50:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.50},
doi = {10.4230/LIPICS.ISAAC.2020.50},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DemaineKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DeyFNS20,
author = {Sanjana Dey and
Florent Foucaud and
Subhas C. Nandy and
Arunabha Sen},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Discriminating Codes in Geometric Setups},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {24:1--24:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.24},
doi = {10.4230/LIPICS.ISAAC.2020.24},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/DeyFNS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DubloisHGLM20,
author = {Louis Dublois and
Tesshu Hanaka and
Mehdi Khosravian Ghadikolaei and
Michael Lampis and
Nikolaos Melissinos},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {(In)approximability of Maximum Minimal {FVS}},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {3:1--3:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.3},
doi = {10.4230/LIPICS.ISAAC.2020.3},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DubloisHGLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DulebaGJ20,
author = {Maciej Duleba and
Pawel Gawrychowski and
Wojciech Janczewski},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Efficient Labeling for Reachability in Directed Acyclic Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.27},
doi = {10.4230/LIPICS.ISAAC.2020.27},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DulebaGJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DumitrescuGT20,
author = {Adrian Dumitrescu and
Anirban Ghosh and
Csaba D. T{\'{o}}th},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Sparse Hop Spanners for Unit Disk Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {57:1--57:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.57},
doi = {10.4230/LIPICS.ISAAC.2020.57},
timestamp = {Mon, 22 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/DumitrescuGT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FengZH0020,
author = {Qilong Feng and
Zhen Zhang and
Ziyun Huang and
Jinhui Xu and
Jianxin Wang},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {A Unified Framework of {FPT} Approximation Algorithms for Clustering
Problems},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {5:1--5:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.5},
doi = {10.4230/LIPICS.ISAAC.2020.5},
timestamp = {Thu, 23 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FengZH0020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FluschnikNSZ20,
author = {Till Fluschnik and
Rolf Niedermeier and
Carsten Schubert and
Philipp Zschoche},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Multistage s-t Path: Confronting Similarity with Dissimilarity in
Temporal Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {43:1--43:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.43},
doi = {10.4230/LIPICS.ISAAC.2020.43},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FluschnikNSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FominGJPS20,
author = {Fedor V. Fomin and
Petr A. Golovach and
Lars Jaffke and
Geevarghese Philip and
Danil Sagunov},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Diverse Pairs of Matchings},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {26:1--26:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.26},
doi = {10.4230/LIPICS.ISAAC.2020.26},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FominGJPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FreiHR20,
author = {Fabian Frei and
Edith Hemaspaandra and
J{\"{o}}rg Rothe},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Complexity of Stability},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {19:1--19:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.19},
doi = {10.4230/LIPICS.ISAAC.2020.19},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FreiHR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FunkeW20,
author = {Stefan Funke and
Felix Weitbrecht},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Efficiently Computing All Delaunay Triangles Occurring over All Contiguous
Subsequences},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {28:1--28:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.28},
doi = {10.4230/LIPICS.ISAAC.2020.28},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FunkeW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GeorgiadisK20,
author = {Loukas Georgiadis and
Evangelos Kosinas},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Linear-Time Algorithms for Computing Twinless Strong Articulation
Points and Related Problems},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {38:1--38:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.38},
doi = {10.4230/LIPICS.ISAAC.2020.38},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GeorgiadisK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GowdaLPP020,
author = {Kishen N. Gowda and
Aditya Lonkar and
Fahad Panolan and
Vraj Patel and
Saket Saurabh},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Improved {FPT} Algorithms for Deletion to Forest-Like Structures},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {34:1--34:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.34},
doi = {10.4230/LIPICS.ISAAC.2020.34},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/GowdaLPP020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GudmundssonSW20,
author = {Joachim Gudmundsson and
Yuan Sha and
Sampson Wong},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Approximating the Packedness of Polygonal Curves},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {9:1--9:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.9},
doi = {10.4230/LIPICS.ISAAC.2020.9},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/GudmundssonSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HamersmaKUZ20,
author = {Joep Hamersma and
Marc J. van Kreveld and
Yushi Uno and
Tom C. van der Zanden},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Gourds: {A} Sliding-Block Puzzle with Turning},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {33:1--33:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.33},
doi = {10.4230/LIPICS.ISAAC.2020.33},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/HamersmaKUZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HollandWZ20,
author = {William L. Holland and
Anthony Wirth and
Justin Zobel},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Recency Queries with Succinct Representation},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {49:1--49:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.49},
doi = {10.4230/LIPICS.ISAAC.2020.49},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/HollandWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Huang20,
author = {Xuangui Huang},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Space Hardness of Solving Structured Linear Systems},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {56:1--56:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.56},
doi = {10.4230/LIPICS.ISAAC.2020.56},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Huang20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Hyatt-DenesikRS20,
author = {Dylan Hyatt{-}Denesik and
Mirmahdi Rahgoshay and
Mohammad R. Salavatipour},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Approximations for Throughput Maximization},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {11:1--11:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.11},
doi = {10.4230/LIPICS.ISAAC.2020.11},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Hyatt-DenesikRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KernP20,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Contracting to a Longest Path in H-Free Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {22:1--22:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.22},
doi = {10.4230/LIPICS.ISAAC.2020.22},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KernP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KimC20,
author = {Sung{-}Hwan Kim and
Hwan{-}Gue Cho},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Indexing Isodirectional Pointer Sequences},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.35},
doi = {10.4230/LIPICS.ISAAC.2020.35},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KimC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KimSA20,
author = {Kangsan Kim and
Yongho Shin and
Hyung{-}Chan An},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Constant-Factor Approximation Algorithms for the Parity-Constrained
Facility Location Problem},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {21:1--21:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.21},
doi = {10.4230/LIPICS.ISAAC.2020.21},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KimSA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KoanaKS20,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Computing Dense and Sparse Subgraphs of Weakly Closed Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.20},
doi = {10.4230/LIPICS.ISAAC.2020.20},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KoanaKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KouteckyZ20,
author = {Martin Kouteck{\'{y}} and
Johannes Zink},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Complexity of Scheduling Few Types of Jobs on Related and Unrelated
Machines},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {18:1--18:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.18},
doi = {10.4230/LIPICS.ISAAC.2020.18},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KouteckyZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KreveldMOSV20,
author = {Marc J. van Kreveld and
Tillmann Miltzow and
Tim Ophelders and
Willem Sonke and
Jordi L. Vermeulen},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Between Shapes, Using the Hausdorff Distance},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {13:1--13:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.13},
doi = {10.4230/LIPICS.ISAAC.2020.13},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KreveldMOSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KrneticM0W20,
author = {Predrag Krnetic and
Darya Melnyk and
Yuyi Wang and
Roger Wattenhofer},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {The k-Server Problem with Delays on the Uniform Metric Space},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {61:1--61:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.61},
doi = {10.4230/LIPICS.ISAAC.2020.61},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KrneticM0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Labarre20,
author = {Anthony Labarre},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Sorting by Prefix Block-Interchanges},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {55:1--55:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.55},
doi = {10.4230/LIPICS.ISAAC.2020.55},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Labarre20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MontealegreRR20,
author = {Pedro Montealegre and
Diego Ram{\'{\i}}rez{-}Romero and
Ivan Rapaport},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Shared vs Private Randomness in Distributed Interactive Proofs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {51:1--51:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.51},
doi = {10.4230/LIPICS.ISAAC.2020.51},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/MontealegreRR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MulzerW20,
author = {Wolfgang Mulzer and
Max Willert},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Compact Routing in Unit Disk Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {16:1--16:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.16},
doi = {10.4230/LIPICS.ISAAC.2020.16},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MulzerW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/OnoderaS20,
author = {Taku Onodera and
Tetsuo Shibuya},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Wear Leveling Revisited},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {65:1--65:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.65},
doi = {10.4230/LIPICS.ISAAC.2020.65},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/OnoderaS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Oum20,
author = {Sang{-}il Oum},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {How to Decompose a Graph into a Tree-Like Structure (Invited Talk)},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {1:1--1:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.1},
doi = {10.4230/LIPICS.ISAAC.2020.1},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Oum20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/PangS20,
author = {Haozhou Pang and
Mohammad R. Salavatipour},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Approximation Algorithms for Generalized Path Scheduling},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {10:1--10:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.10},
doi = {10.4230/LIPICS.ISAAC.2020.10},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/PangS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/SakaiI20,
author = {Yoshifumi Sakai and
Shunsuke Inenaga},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
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, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {6:1--6:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.6},
doi = {10.4230/LIPICS.ISAAC.2020.6},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/SakaiI20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/SantiagoY20,
author = {Richard Santiago and
Yuichi Yoshida},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Weakly Submodular Function Maximization Using Local Submodularity
Ratio},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {64:1--64:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.64},
doi = {10.4230/LIPICS.ISAAC.2020.64},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/SantiagoY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/SumigawaCSS20,
author = {Kentaro Sumigawa and
Sankardeep Chakraborty and
Kunihiko Sadakane and
Srinivasa Rao Satti},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Enumerating Range Modes},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {29:1--29:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.29},
doi = {10.4230/LIPICS.ISAAC.2020.29},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/SumigawaCSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/TamuraI020,
author = {Yuma Tamura and
Takehiro Ito and
Xiao Zhou},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Minimization and Parameterized Variants of Vertex Partition Problems
on Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {40:1--40:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.40},
doi = {10.4230/LIPICS.ISAAC.2020.40},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/TamuraI020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Thang20,
author = {Kim Thang Nguyen},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Online Primal-Dual Algorithms with Configuration Linear Programs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {45:1--45:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.45},
doi = {10.4230/LIPICS.ISAAC.2020.45},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Thang20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Uchizawa20,
author = {Kei Uchizawa},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Size, Depth and Energy of Threshold Circuits Computing Parity Function},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {54:1--54:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.54},
doi = {10.4230/LIPICS.ISAAC.2020.54},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Uchizawa20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/X20,
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {0:1--0:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.0},
doi = {10.4230/LIPICS.ISAAC.2020.0},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/X20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2020,
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-173-3},
isbn = {978-3-95977-173-3},
timestamp = {Mon, 21 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-07 18:47 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
