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/isaac2021.bht:"
download as .bib file
@inproceedings{DBLP:conf/isaac/0002SZ21,
author = {Siddharth Gupta and
Guy Sa'ar and
Meirav Zehavi},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Grid Recognition: Classical and Parameterized Computational Perspectives},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {37:1--37:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.37},
doi = {10.4230/LIPICS.ISAAC.2021.37},
timestamp = {Tue, 30 Nov 2021 14:09:45 +0100},
biburl = {https://dblp.org/rec/conf/isaac/0002SZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AlbersGJ21,
author = {Susanne Albers and
Waldo G{\'{a}}lvez and
Maximilian Janke},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Machine Covering in the Random-Order Model},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {52:1--52:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.52},
doi = {10.4230/LIPICS.ISAAC.2021.52},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AlbersGJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AllenderGHR21,
author = {Eric Allender and
John Gouwar and
Shuichi Hirahara and
Caleb Robelle},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov
Complexity},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {54:1--54:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.54},
doi = {10.4230/LIPICS.ISAAC.2021.54},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AllenderGHR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/An021,
author = {Shinwoo An and
Eunjin Oh},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Feedback Vertex Set on Geometric Intersection Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {47:1--47:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.47},
doi = {10.4230/LIPICS.ISAAC.2021.47},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/An021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AndersBS21,
author = {Markus Anders and
Jendrik Brachter and
Pascal Schweitzer},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {A Characterization of Individualization-Refinement Trees},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {24:1--24:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.24},
doi = {10.4230/LIPICS.ISAAC.2021.24},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AndersBS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AntoniadisK021,
author = {Antonios Antoniadis and
Gunjan Kumar and
Nikhil Kumar},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Skeletons and Minimum Energy Scheduling},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {51:1--51:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.51},
doi = {10.4230/LIPICS.ISAAC.2021.51},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AntoniadisK021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AraujoRRM21,
author = {Eloi Araujo and
Luiz C. S. Rozante and
Diego P. Rubert and
F{\'{a}}bio Viduani Martinez},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Algorithms for Normalized Multiple Sequence Alignments},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {40:1--40:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.40},
doi = {10.4230/LIPICS.ISAAC.2021.40},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AraujoRRM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AronovBCEIS21,
author = {Boris Aronov and
Mark de Berg and
Jean Cardinal and
Esther Ezra and
John Iacono and
Micha Sharir},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the
Algebraic Decision Tree Model},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {3:1--3:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.3},
doi = {10.4230/LIPICS.ISAAC.2021.3},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AronovBCEIS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Asano21,
author = {Takao Asano},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small
Number of Cuts},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {68:1--68:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.68},
doi = {10.4230/LIPICS.ISAAC.2021.68},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Asano21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AurenhammerPS21,
author = {Franz Aurenhammer and
Evanthia Papadopoulou and
Martin Suderland},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Piecewise-Linear Farthest-Site Voronoi Diagrams},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {30:1--30:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.30},
doi = {10.4230/LIPICS.ISAAC.2021.30},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AurenhammerPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Bacic0S21,
author = {Joyce Bacic and
Saeed Mehrabi and
Michiel Smid},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Shortest Beer Path Queries in Outerplanar Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {62:1--62:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.62},
doi = {10.4230/LIPICS.ISAAC.2021.62},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Bacic0S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BandyapadhyayMS21,
author = {Sayan Bandyapadhyay and
Anil Maheshwari and
Michiel Smid},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Exact and Approximation Algorithms for Many-To-Many Point Matching
in the Plane},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {44:1--44:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.44},
doi = {10.4230/LIPICS.ISAAC.2021.44},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BandyapadhyayMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Banik0R21,
author = {Aritra Banik and
Rajiv Raman and
Saurabh Ray},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {On Geometric Priority Set Cover Problems},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {12:1--12:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.12},
doi = {10.4230/LIPICS.ISAAC.2021.12},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Banik0R21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Bar-NoyPRY21,
author = {Amotz Bar{-}Noy and
David Peleg and
Dror Rawitz and
Elad Yehezkel},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Selected Neighbor Degree Forest Realization},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {27:1--27:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.27},
doi = {10.4230/LIPICS.ISAAC.2021.27},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Bar-NoyPRY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BarrB21,
author = {Sam Barr and
Therese Biedl},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar
Graph and a Forest},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {16:1--16:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.16},
doi = {10.4230/LIPICS.ISAAC.2021.16},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BarrB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BarthFP21,
author = {Florian Barth and
Stefan Funke and
Claudius Proissl},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Preference-Based Trajectory Clustering - An Application of Geometric
Hitting Sets},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {15:1--15:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.15},
doi = {10.4230/LIPICS.ISAAC.2021.15},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BarthFP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BergKMT21,
author = {Mark de Berg and
S{\'{a}}ndor Kisfaludi{-}Bak and
Morteza Monemizadeh and
Leonidas Theocharous},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Clique-Based Separators for Geometric Intersection Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {22:1--22:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.22},
doi = {10.4230/LIPICS.ISAAC.2021.22},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BergKMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BergS21,
author = {Sarita de Berg and
Frank Staals},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Dynamic Data Structures for k-Nearest Neighbor Queries},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.14},
doi = {10.4230/LIPICS.ISAAC.2021.14},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BergS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Bhore021,
author = {Sujoy Bhore and
Rahul Jain},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Space-Efficient Algorithms for Reachability in Directed Geometric
Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {63:1--63:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.63},
doi = {10.4230/LIPICS.ISAAC.2021.63},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Bhore021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Bhore0NRW21,
author = {Sujoy Bhore and
Guangping Li and
Martin N{\"{o}}llenburg and
Ignaz Rutter and
Hsiang{-}Yun Wu},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Untangling Circular Drawings: Algorithms and Complexity},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {19:1--19:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.19},
doi = {10.4230/LIPICS.ISAAC.2021.19},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Bhore0NRW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BiabaniBM21,
author = {Leyla Biabani and
Mark de Berg and
Morteza Monemizadeh},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Maximum-Weight Matching in Sliding Windows and Beyond},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {73:1--73:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.73},
doi = {10.4230/LIPICS.ISAAC.2021.73},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BiabaniBM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Biniaz21,
author = {Ahmad Biniaz},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Approximating Longest Spanning Tree with Neighborhoods},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {7:1--7:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.7},
doi = {10.4230/LIPICS.ISAAC.2021.7},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Biniaz21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BlackM21,
author = {Mitchell Black and
William Maxwell},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Effective Resistance and Capacitance in Simplicial Complexes and a
Quantum Algorithm},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {31:1--31:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.31},
doi = {10.4230/LIPICS.ISAAC.2021.31},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BlackM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Blasius0KM21,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Martin S. Krejca and
Louise Molitor},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {The Impact of Geometry on Monochrome Regions in the Flip Schelling
Process},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {29:1--29:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.29},
doi = {10.4230/LIPICS.ISAAC.2021.29},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Blasius0KM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Bose21,
author = {Prosenjit Bose},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Spanning Properties of Variants of the Delaunay Graph (Invited Talk)},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {2:1--2:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.2},
doi = {10.4230/LIPICS.ISAAC.2021.2},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Bose21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BrauseGMPS21,
author = {Christoph Brause and
Petr A. Golovach and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Partitioning H-Free Graphs of Bounded Diameter},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {21:1--21:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.21},
doi = {10.4230/LIPICS.ISAAC.2021.21},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BrauseGMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CanonneW21,
author = {Cl{\'{e}}ment L. Canonne and
Karl Wimmer},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Identity Testing Under Label Mismatch},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {55:1--55:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.55},
doi = {10.4230/LIPICS.ISAAC.2021.55},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/CanonneW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Charalampopoulos21,
author = {Panagiotis Charalampopoulos and
Huiping Chen and
Peter Christen and
Grigorios Loukides and
Nadia Pisanti and
Solon P. Pissis and
Jakub Radoszewski},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Pattern Masking for Dictionary Matching},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {65:1--65:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.65},
doi = {10.4230/LIPICS.ISAAC.2021.65},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Charalampopoulos21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenHK0X21,
author = {Jianer Chen and
Qin Huang and
Iyad Kanj and
Qian Li and
Ge Xia},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal
Update Time},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {48:1--48:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.48},
doi = {10.4230/LIPICS.ISAAC.2021.48},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ChenHK0X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChengW21,
author = {Siu{-}Wing Cheng and
Man Ting Wong},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Self-Improving Voronoi Construction for a Hidden Mixture of Product
Distributions},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.8},
doi = {10.4230/LIPICS.ISAAC.2021.8},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ChengW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CheriyanCDZ21,
author = {Joseph Cheriyan and
Robert Cummings and
Jack Dippel and
Jasper Zhu},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {An Improved Approximation Algorithm for the Matching Augmentation
Problem},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {38:1--38:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.38},
doi = {10.4230/LIPICS.ISAAC.2021.38},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/CheriyanCDZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Cho021,
author = {Kyungjin Cho and
Eunjin Oh},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel
Affine Subspaces},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {46:1--46:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.46},
doi = {10.4230/LIPICS.ISAAC.2021.46},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Cho021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CzygrinowHW21,
author = {Andrzej Czygrinow and
Michal Hanckowiak and
Marcin Witkowski},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Distributed Approximations of f-Matchings and b-Matchings in Graphs
of Sub-Logarithmic Expansion},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {59:1--59:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.59},
doi = {10.4230/LIPICS.ISAAC.2021.59},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/CzygrinowHW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CzyzowiczKKKNOP21,
author = {Jurek Czyzowicz and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov and
Sunil M. Shende},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Group Evacuation on a Line by Agents with Different Communication
Abilities},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {57:1--57:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.57},
doi = {10.4230/LIPICS.ISAAC.2021.57},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/CzyzowiczKKKNOP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DasLLM21,
author = {Rathish Das and
Andrea Lincoln and
Jayson Lynch and
J. Ian Munro},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Dynamic Boolean Formula Evaluation},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {61:1--61:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.61},
doi = {10.4230/LIPICS.ISAAC.2021.61},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/DasLLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EnochFMM21,
author = {Julian Enoch and
Kyle Fox and
Dor Mesica and
Shay Mozes},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {A Faster Algorithm for Maximum Flow in Directed Planar Graphs with
Vertex Capacities},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {72:1--72:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.72},
doi = {10.4230/LIPICS.ISAAC.2021.72},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/EnochFMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EquiNACTM21,
author = {Massimo Equi and
Tuukka Norri and
Jarno Alanko and
Bastien Cazaux and
Alexandru I. Tomescu and
Veli M{\"{a}}kinen},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Algorithms and Complexity on Indexing Elastic Founder Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {20:1--20:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.20},
doi = {10.4230/LIPICS.ISAAC.2021.20},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/EquiNACTM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EskandariKK21,
author = {Marzieh Eskandari and
Bhavika B. Khare and
Nirman Kumar},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Separated Red Blue Center Clustering},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {41:1--41:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.41},
doi = {10.4230/LIPICS.ISAAC.2021.41},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/EskandariKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EvaldFW21,
author = {Jacob Evald and
Viktor Fredslund{-}Hansen and
Christian Wulff{-}Nilsen},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {23:1--23:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.23},
doi = {10.4230/LIPICS.ISAAC.2021.23},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/EvaldFW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FeketeKKRS21,
author = {S{\'{a}}ndor P. Fekete and
Phillip Keldenich and
Ramin Kosfeld and
Christian Rieck and
Christian Scheffer},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Connected Coordinated Motion Planning with Bounded Stretch},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {9:1--9:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.9},
doi = {10.4230/LIPICS.ISAAC.2021.9},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FeketeKKRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FerraginaMV21,
author = {Paolo Ferragina and
Giovanni Manzini and
Giorgio Vinciguerra},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Repetition- and Linearity-Aware Rank/Select Dictionaries},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {64:1--64:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.64},
doi = {10.4230/LIPICS.ISAAC.2021.64},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FerraginaMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FrancisHJ21,
author = {Mathew C. Francis and
Pavol Hell and
Dalu Jacob},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {On the Kernel and Related Problems in Interval Digraphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {17:1--17:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.17},
doi = {10.4230/LIPICS.ISAAC.2021.17},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FrancisHJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Fredslund-Hansen21,
author = {Viktor Fredslund{-}Hansen and
Shay Mozes and
Christian Wulff{-}Nilsen},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Truly Subquadratic Exact Distance Oracles with Constant Query Time
for Planar Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {25:1--25:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.25},
doi = {10.4230/LIPICS.ISAAC.2021.25},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Fredslund-Hansen21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GallM21,
author = {Fran{\c{c}}ois Le Gall and
Masayuki Miyamoto},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Lower Bounds for Induced Cycle Detection in Distributed Computing},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {58:1--58:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.58},
doi = {10.4230/LIPICS.ISAAC.2021.58},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/GallM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Gibson-LopezY21,
author = {Matt Gibson{-}Lopez and
Zhongxiu Yang},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {The VC-Dimension of Limited Visibility Terrains},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {5:1--5:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.5},
doi = {10.4230/LIPICS.ISAAC.2021.5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Gibson-LopezY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GourvesHLM21,
author = {Laurent Gourv{\`{e}}s and
Ararat Harutyunyan and
Michael Lampis and
Nikolaos Melissinos},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Filling Crosswords Is Very Hard},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {36:1--36:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.36},
doi = {10.4230/LIPICS.ISAAC.2021.36},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GourvesHLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GuL21,
author = {Qian{-}Ping Gu and
Jiajian Leo Liang},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Multimodal Transportation with Ridesharing of Personal Vehicles},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {39:1--39:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.39},
doi = {10.4230/LIPICS.ISAAC.2021.39},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/GuL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Guala0Z21,
author = {Luciano Gual{\`{a}} and
Stefano Leucci and
Isabella Ziccardi},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries
in Dynamic Trees},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {66:1--66:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.66},
doi = {10.4230/LIPICS.ISAAC.2021.66},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Guala0Z21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GudmundssonSY21,
author = {Joachim Gudmundsson and
Yuan Sha and
Fan Yao},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Augmenting Graphs to Minimize the Radius},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {45:1--45:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.45},
doi = {10.4230/LIPICS.ISAAC.2021.45},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/GudmundssonSY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HasegawaG21,
author = {Atsuya Hasegawa and
Fran{\c{c}}ois Le Gall},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Quantum Advantage with Shallow Circuits Under Arbitrary Corruption},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {74:1--74:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.74},
doi = {10.4230/LIPICS.ISAAC.2021.74},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/HasegawaG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Hebert-JohnsonS21,
author = {{\'{U}}rsula H{\'{e}}bert{-}Johnson and
Chinmay Sonar and
Subhash Suri and
Vaishali Surianarayanan},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Anonymity-Preserving Space Partitions},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {32:1--32:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.32},
doi = {10.4230/LIPICS.ISAAC.2021.32},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Hebert-JohnsonS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HuangKR21,
author = {Hongyao Huang and
Georgiy Klimenko and
Benjamin Raichel},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Clustering with Neighborhoods},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {6:1--6:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.6},
doi = {10.4230/LIPICS.ISAAC.2021.6},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/HuangKR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KaufmanM21,
author = {Tali Kaufman and
David Mass},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {56:1--56:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.56},
doi = {10.4230/LIPICS.ISAAC.2021.56},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KaufmanM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KimLO21,
author = {Donggyu Kim and
Duksang Lee and
Sang{-}il Oum},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {{\(\Gamma\)}-Graphic Delta-Matroids and Their Applications},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {70:1--70:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.70},
doi = {10.4230/LIPICS.ISAAC.2021.70},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KimLO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KoanaKS21,
author = {Tomohiro Koana and
Christian Komusiewicz and
Frank Sommer},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Essentially Tight Kernels For (Weakly) Closed Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.35},
doi = {10.4230/LIPICS.ISAAC.2021.35},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KoanaKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Kumabe21,
author = {Soh Kumabe},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Interval Query Problem on Cube-Free Median Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.18},
doi = {10.4230/LIPICS.ISAAC.2021.18},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Kumabe21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LampisM21,
author = {Michael Lampis and
Valia Mitsou},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Fine-Grained Meta-Theorems for Vertex Integrity},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {34:1--34:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.34},
doi = {10.4230/LIPICS.ISAAC.2021.34},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/LampisM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LiS21,
author = {Shibo Li and
Dominik Scheder},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Impatient {PPSZ} - {A} Faster Algorithm for {CSP}},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {33:1--33:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.33},
doi = {10.4230/LIPICS.ISAAC.2021.33},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/LiS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LiangLCI21,
author = {Ya{-}Chun Liang and
Kuan{-}Yun Lai and
Ho{-}Lin Chen and
Kazuo Iwama},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Tight Competitive Analyses of Online Car-Sharing Problems},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {50:1--50:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.50},
doi = {10.4230/LIPICS.ISAAC.2021.50},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/LiangLCI21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MalafiejskaMOP21,
author = {Anna Malafiejska and
Michal Malafiejski and
Krzysztof M. Ocetkiewicz and
Krzysztof Pastuszak},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {26:1--26:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.26},
doi = {10.4230/LIPICS.ISAAC.2021.26},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/MalafiejskaMOP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MathenyP21,
author = {Michael Matheny and
Jeff M. Phillips},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Approximate Maximum Halfspace Discrepancy},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {4:1--4:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.4},
doi = {10.4230/LIPICS.ISAAC.2021.4},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/MathenyP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Mathieu021,
author = {Claire Mathieu and
Hang Zhou},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Probabilistic Analysis of Euclidean Capacitated Vehicle Routing},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {43:1--43:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.43},
doi = {10.4230/LIPICS.ISAAC.2021.43},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Mathieu021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MestrePU21,
author = {Juli{\'{a}}n Mestre and
Sergey Pupyrev and
Seeun William Umboh},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {On the Extended {TSP} Problem},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {42:1--42:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.42},
doi = {10.4230/LIPICS.ISAAC.2021.42},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MestrePU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/NikoletseasRS21,
author = {Sotiris E. Nikoletseas and
Christoforos L. Raptopoulos and
Paul G. Spirakis},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {{MAX} {CUT} in Weighted Random Intersection Graphs and Discrepancy
of Sparse Random Set Systems},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {28:1--28:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.28},
doi = {10.4230/LIPICS.ISAAC.2021.28},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/NikoletseasRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/NilssonOPSZ21,
author = {Bengt J. Nilsson and
David Orden and
Leonidas Palios and
Carlos Seara and
Pawel Zylinski},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Illuminating the x-Axis by {\(\alpha\)}-Floodlights},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {11:1--11:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.11},
doi = {10.4230/LIPICS.ISAAC.2021.11},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/NilssonOPSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/PatelS21,
author = {Dhrumil Patel and
Rahul Shah},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in
Near-Compact Space},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {60:1--60:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.60},
doi = {10.4230/LIPICS.ISAAC.2021.60},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/PatelS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Schnider21,
author = {Patrick Schnider},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Enclosing Depth and Other Depth Measures},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {10:1--10:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.10},
doi = {10.4230/LIPICS.ISAAC.2021.10},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Schnider21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Schnider21a,
author = {Patrick Schnider},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {The Complexity of Sharing a Pizza},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.13},
doi = {10.4230/LIPICS.ISAAC.2021.13},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Schnider21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ShinA21,
author = {Yongho Shin and
Hyung{-}Chan An},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Making Three out of Two: Three-Way Online Correlated Selection},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {49:1--49:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.49},
doi = {10.4230/LIPICS.ISAAC.2021.49},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ShinA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Starikovskaya21,
author = {Tatiana Starikovskaya},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Streaming Pattern Matching (Invited Talk)},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {1:1--1:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.1},
doi = {10.4230/LIPICS.ISAAC.2021.1},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Starikovskaya21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Tan21,
author = {Shuhao Tan},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Computing Shapley Values for Mean Width in 3-D},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {67:1--67:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.67},
doi = {10.4230/LIPICS.ISAAC.2021.67},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Tan21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Tang021,
author = {Shaojie Tang and
Jing Yuan},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Adaptive Regularized Submodular Maximization},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {69:1--69:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.69},
doi = {10.4230/LIPICS.ISAAC.2021.69},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Tang021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Touitou21,
author = {Noam Touitou},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {53:1--53:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.53},
doi = {10.4230/LIPICS.ISAAC.2021.53},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Touitou21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/X21,
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {0:1--0:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.0},
doi = {10.4230/LIPICS.ISAAC.2021.0},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Yokoi21,
author = {Yu Yokoi},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {An Approximation Algorithm for Maximum Stable Matching with Ties and
Constraints},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {71:1--71:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.71},
doi = {10.4230/LIPICS.ISAAC.2021.71},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Yokoi21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2021,
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-214-3},
isbn = {978-3-95977-214-3},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/2021.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-06-11 10:52 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:
