@Proceedings{ahn_et_al:LIPIcs.ISAAC.2021,
title = {{LIPIcs, Volume 212, ISAAC 2021, Complete Volume}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {1--1188},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021},
URN = {urn:nbn:de:0030-drops-154329},
doi = {10.4230/LIPIcs.ISAAC.2021},
annote = {Keywords: LIPIcs, Volume 212, ISAAC 2021, Complete Volume}
}
@InProceedings{ahn_et_al:LIPIcs.ISAAC.2021.0,
author = {Ahn, Hee-Kap and Sadakane, Kunihiko},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {0:i--0:xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.0},
URN = {urn:nbn:de:0030-drops-154330},
doi = {10.4230/LIPIcs.ISAAC.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{starikovskaya:LIPIcs.ISAAC.2021.1,
author = {Starikovskaya, Tatiana},
title = {{Streaming Pattern Matching}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.1},
URN = {urn:nbn:de:0030-drops-154345},
doi = {10.4230/LIPIcs.ISAAC.2021.1},
annote = {Keywords: Streaming algorithms, Pattern matching, Hamming distance, Edit distance}
}
@InProceedings{bose:LIPIcs.ISAAC.2021.2,
author = {Bose, Prosenjit},
title = {{Spanning Properties of Variants of the Delaunay Graph}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.2},
URN = {urn:nbn:de:0030-drops-154352},
doi = {10.4230/LIPIcs.ISAAC.2021.2},
annote = {Keywords: Delaunay Graph, Geometric Graph, Graph Spanner}
}
@InProceedings{aronov_et_al:LIPIcs.ISAAC.2021.3,
author = {Aronov, Boris and de Berg, Mark and Cardinal, Jean and Ezra, Esther and Iacono, John and Sharir, Micha},
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)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.3},
URN = {urn:nbn:de:0030-drops-154363},
doi = {10.4230/LIPIcs.ISAAC.2021.3},
annote = {Keywords: Computational geometry, Algebraic decision-tree model, Polynomial partitioning, Primal-dual range searching, Order types, Point location, Hierarchical partitions}
}
@InProceedings{matheny_et_al:LIPIcs.ISAAC.2021.4,
author = {Matheny, Michael and Phillips, Jeff M.},
title = {{Approximate Maximum Halfspace Discrepancy}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {4:1--4:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.4},
URN = {urn:nbn:de:0030-drops-154377},
doi = {10.4230/LIPIcs.ISAAC.2021.4},
annote = {Keywords: range spaces, halfspaces, scan statistics, fine-grained complexity}
}
@InProceedings{gibsonlopez_et_al:LIPIcs.ISAAC.2021.5,
author = {Gibson-Lopez, Matt and Yang, Zhongxiu},
title = {{The VC-Dimension of Limited Visibility Terrains}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {5:1--5:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.5},
URN = {urn:nbn:de:0030-drops-154386},
doi = {10.4230/LIPIcs.ISAAC.2021.5},
annote = {Keywords: VC-dimension, Terrain Guarding, Limited Visibility}
}
@InProceedings{huang_et_al:LIPIcs.ISAAC.2021.6,
author = {Huang, Hongyao and Klimenko, Georgiy and Raichel, Benjamin},
title = {{Clustering with Neighborhoods}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.6},
URN = {urn:nbn:de:0030-drops-154398},
doi = {10.4230/LIPIcs.ISAAC.2021.6},
annote = {Keywords: Clustering, Approximation, Hardness}
}
@InProceedings{biniaz:LIPIcs.ISAAC.2021.7,
author = {Biniaz, Ahmad},
title = {{Approximating Longest Spanning Tree with Neighborhoods}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {7:1--7:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.7},
URN = {urn:nbn:de:0030-drops-154401},
doi = {10.4230/LIPIcs.ISAAC.2021.7},
annote = {Keywords: Euclidean maximum spanning tree, spanning tree with neighborhoods, approximation algorithms}
}
@InProceedings{cheng_et_al:LIPIcs.ISAAC.2021.8,
author = {Cheng, Siu-Wing and Wong, Man Ting},
title = {{Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {8:1--8:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.8},
URN = {urn:nbn:de:0030-drops-154418},
doi = {10.4230/LIPIcs.ISAAC.2021.8},
annote = {Keywords: entropy, Voronoi diagram, convex distance function, hidden mixture of product distributions}
}
@InProceedings{fekete_et_al:LIPIcs.ISAAC.2021.9,
author = {Fekete, S\'{a}ndor P. and Keldenich, Phillip and Kosfeld, Ramin and Rieck, Christian and Scheffer, Christian},
title = {{Connected Coordinated Motion Planning with Bounded Stretch}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.9},
URN = {urn:nbn:de:0030-drops-154423},
doi = {10.4230/LIPIcs.ISAAC.2021.9},
annote = {Keywords: Motion planning, parallel motion, bounded stretch, scaled shape, makespan, connectivity, swarm robotics}
}
@InProceedings{schnider:LIPIcs.ISAAC.2021.10,
author = {Schnider, Patrick},
title = {{Enclosing Depth and Other Depth Measures}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.10},
URN = {urn:nbn:de:0030-drops-154431},
doi = {10.4230/LIPIcs.ISAAC.2021.10},
annote = {Keywords: Depth measures, Tukey depth, Tverberg theorem, Combinatorial Geometry}
}
@InProceedings{nilsson_et_al:LIPIcs.ISAAC.2021.11,
author = {Nilsson, Bengt J. and Orden, David and Palios, Leonidas and Seara, Carlos and \.{Z}yli\'{n}ski, Pawe{\l}},
title = {{Illuminating the x-Axis by \alpha-Floodlights}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {11:1--11:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.11},
URN = {urn:nbn:de:0030-drops-154444},
doi = {10.4230/LIPIcs.ISAAC.2021.11},
annote = {Keywords: Computational Geometry, Visibility, Art Gallery Problems, Floodlights}
}
@InProceedings{banik_et_al:LIPIcs.ISAAC.2021.12,
author = {Banik, Aritra and Raman, Rajiv and Ray, Saurabh},
title = {{On Geometric Priority Set Cover Problems}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.12},
URN = {urn:nbn:de:0030-drops-154459},
doi = {10.4230/LIPIcs.ISAAC.2021.12},
annote = {Keywords: Approximation algorithms, geometric set cover, local search, quasi-uniform sampling}
}
@InProceedings{schnider:LIPIcs.ISAAC.2021.13,
author = {Schnider, Patrick},
title = {{The Complexity of Sharing a Pizza}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.13},
URN = {urn:nbn:de:0030-drops-154460},
doi = {10.4230/LIPIcs.ISAAC.2021.13},
annote = {Keywords: pizza sharing, Ham-Sandwich theorem, PPA, computational geometry, computational complexity}
}
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2021.14,
author = {de Berg, Sarita and Staals, Frank},
title = {{Dynamic Data Structures for k-Nearest Neighbor Queries}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.14},
URN = {urn:nbn:de:0030-drops-154473},
doi = {10.4230/LIPIcs.ISAAC.2021.14},
annote = {Keywords: data structure, simple polygon, geodesic distance, nearest neighbor searching}
}
@InProceedings{barth_et_al:LIPIcs.ISAAC.2021.15,
author = {Barth, Florian and Funke, Stefan and Proissl, Claudius},
title = {{Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {15:1--15:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.15},
URN = {urn:nbn:de:0030-drops-154481},
doi = {10.4230/LIPIcs.ISAAC.2021.15},
annote = {Keywords: Route planning, personalization, computational geometry}
}
@InProceedings{barr_et_al:LIPIcs.ISAAC.2021.16,
author = {Barr, Sam and Biedl, Therese},
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)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.16},
URN = {urn:nbn:de:0030-drops-154492},
doi = {10.4230/LIPIcs.ISAAC.2021.16},
annote = {Keywords: 1-planar graphs, edge partitions, algorithms, data structures}
}
@InProceedings{francis_et_al:LIPIcs.ISAAC.2021.17,
author = {Francis, Mathew C. and Hell, Pavol and Jacob, Dalu},
title = {{On the Kernel and Related Problems in Interval Digraphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.17},
URN = {urn:nbn:de:0030-drops-154505},
doi = {10.4230/LIPIcs.ISAAC.2021.17},
annote = {Keywords: Interval digraphs, kernel, absorbing set, dominating set, independent set, algorithms, approximation hardness}
}
@InProceedings{kumabe:LIPIcs.ISAAC.2021.18,
author = {Kumabe, Soh},
title = {{Interval Query Problem on Cube-Free Median Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {18:1--18:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.18},
URN = {urn:nbn:de:0030-drops-154510},
doi = {10.4230/LIPIcs.ISAAC.2021.18},
annote = {Keywords: Data Structures, Range Query Problems, Median Graphs}
}
@InProceedings{bhore_et_al:LIPIcs.ISAAC.2021.19,
author = {Bhore, Sujoy and Li, Guangping and N\"{o}llenburg, Martin and Rutter, Ignaz and Wu, Hsiang-Yun},
title = {{Untangling Circular Drawings: Algorithms and Complexity}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {19:1--19:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.19},
URN = {urn:nbn:de:0030-drops-154528},
doi = {10.4230/LIPIcs.ISAAC.2021.19},
annote = {Keywords: graph drawing, straight-line drawing, outerplanarity, NP-hardness, untangling}
}
@InProceedings{equi_et_al:LIPIcs.ISAAC.2021.20,
author = {Equi, Massimo and Norri, Tuukka and Alanko, Jarno and Cazaux, Bastien and Tomescu, Alexandru I. and M\"{a}kinen, Veli},
title = {{Algorithms and Complexity on Indexing Elastic Founder Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.20},
URN = {urn:nbn:de:0030-drops-154532},
doi = {10.4230/LIPIcs.ISAAC.2021.20},
annote = {Keywords: orthogonal vectors hypothesis, multiple sequence alignment, segmentation}
}
@InProceedings{brause_et_al:LIPIcs.ISAAC.2021.21,
author = {Brause, Christoph and Golovach, Petr and Martin, Barnaby and Paulusma, Dani\"{e}l and Smith, Siani},
title = {{Partitioning H-Free Graphs of Bounded Diameter}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {21:1--21:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.21},
URN = {urn:nbn:de:0030-drops-154543},
doi = {10.4230/LIPIcs.ISAAC.2021.21},
annote = {Keywords: vertex partitioning problem, H-free, diameter, complexity dichotomy}
}
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2021.22,
author = {de Berg, Mark and Kisfaludi-Bak, S\'{a}ndor and Monemizadeh, Morteza and Theocharous, Leonidas},
title = {{Clique-Based Separators for Geometric Intersection Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {22:1--22:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.22},
URN = {urn:nbn:de:0030-drops-154556},
doi = {10.4230/LIPIcs.ISAAC.2021.22},
annote = {Keywords: Computational geometry, intersection graphs, separator theorems}
}
@InProceedings{evald_et_al:LIPIcs.ISAAC.2021.23,
author = {Evald, Jacob and Fredslund-Hansen, Viktor and Wulff-Nilsen, Christian},
title = {{Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.23},
URN = {urn:nbn:de:0030-drops-154566},
doi = {10.4230/LIPIcs.ISAAC.2021.23},
annote = {Keywords: distance oracle, vertex labels, color distance oracle, planar graph}
}
@InProceedings{anders_et_al:LIPIcs.ISAAC.2021.24,
author = {Anders, Markus and Brachter, Jendrik and Schweitzer, Pascal},
title = {{A Characterization of Individualization-Refinement Trees}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {24:1--24:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.24},
URN = {urn:nbn:de:0030-drops-154578},
doi = {10.4230/LIPIcs.ISAAC.2021.24},
annote = {Keywords: individualization refinement algorithms, backtracking trees, graph isomorphism}
}
@InProceedings{fredslundhansen_et_al:LIPIcs.ISAAC.2021.25,
author = {Fredslund-Hansen, Viktor and Mozes, Shay and Wulff-Nilsen, Christian},
title = {{Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {25:1--25:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.25},
URN = {urn:nbn:de:0030-drops-154586},
doi = {10.4230/LIPIcs.ISAAC.2021.25},
annote = {Keywords: distance oracle, planar graph, shortest paths, subquadratic}
}
@InProceedings{malafiejska_et_al:LIPIcs.ISAAC.2021.26,
author = {Ma{\l}afiejska, Anna and Ma{\l}afiejski, Micha{\l} and Ocetkiewicz, Krzysztof M. and Pastuszak, Krzysztof},
title = {{Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {26:1--26:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.26},
URN = {urn:nbn:de:0030-drops-154596},
doi = {10.4230/LIPIcs.ISAAC.2021.26},
annote = {Keywords: interval edge coloring, biregular graphs, coloring algorithm}
}
@InProceedings{barnoy_et_al:LIPIcs.ISAAC.2021.27,
author = {Bar-Noy, Amotz and Peleg, David and Rawitz, Dror and Yehezkel, Elad},
title = {{Selected Neighbor Degree Forest Realization}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {27:1--27:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.27},
URN = {urn:nbn:de:0030-drops-154609},
doi = {10.4230/LIPIcs.ISAAC.2021.27},
annote = {Keywords: network realization, graph algorithms, lower bound}
}
@InProceedings{nikoletseas_et_al:LIPIcs.ISAAC.2021.28,
author = {Nikoletseas, Sotiris and Raptopoulos, Christoforos and Spirakis, Paul},
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)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.28},
URN = {urn:nbn:de:0030-drops-154612},
doi = {10.4230/LIPIcs.ISAAC.2021.28},
annote = {Keywords: Random Intersection Graphs, Maximum Cut, Discrepancy}
}
@InProceedings{blasius_et_al:LIPIcs.ISAAC.2021.29,
author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Krejca, Martin S. and Molitor, Louise},
title = {{The Impact of Geometry on Monochrome Regions in the Flip Schelling Process}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {29:1--29:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.29},
URN = {urn:nbn:de:0030-drops-154623},
doi = {10.4230/LIPIcs.ISAAC.2021.29},
annote = {Keywords: Agent-based Model, Schelling Segregation, Spin System}
}
@InProceedings{aurenhammer_et_al:LIPIcs.ISAAC.2021.30,
author = {Aurenhammer, Franz and Papadopoulou, Evanthia and Suderland, Martin},
title = {{Piecewise-Linear Farthest-Site Voronoi Diagrams}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {30:1--30:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.30},
URN = {urn:nbn:de:0030-drops-154633},
doi = {10.4230/LIPIcs.ISAAC.2021.30},
annote = {Keywords: Voronoi diagram, farthest-site, polyhedral distance, polyhedral sites, general dimensions}
}
@InProceedings{black_et_al:LIPIcs.ISAAC.2021.31,
author = {Black, Mitchell and Maxwell, William},
title = {{Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {31:1--31:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.31},
URN = {urn:nbn:de:0030-drops-154641},
doi = {10.4230/LIPIcs.ISAAC.2021.31},
annote = {Keywords: Simplicial complexes, quantum computing}
}
@InProceedings{hebertjohnson_et_al:LIPIcs.ISAAC.2021.32,
author = {H\'{e}bert-Johnson, \'{U}rsula and Sonar, Chinmay and Suri, Subhash and Surianarayanan, Vaishali},
title = {{Anonymity-Preserving Space Partitions}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {32:1--32:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.32},
URN = {urn:nbn:de:0030-drops-154654},
doi = {10.4230/LIPIcs.ISAAC.2021.32},
annote = {Keywords: Anonymity, Hitting Set, LP, Constant Approximation, Fixed-Parameter Tractable, Space Partitions, Parameterized Complexity}
}
@InProceedings{li_et_al:LIPIcs.ISAAC.2021.33,
author = {Li, Shibo and Scheder, Dominik},
title = {{Impatient PPSZ - A Faster Algorithm for CSP}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {33:1--33:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.33},
URN = {urn:nbn:de:0030-drops-154662},
doi = {10.4230/LIPIcs.ISAAC.2021.33},
annote = {Keywords: Randomized algorithms, Constraint Satisfaction Problems, exponential-time algorithms}
}
@InProceedings{lampis_et_al:LIPIcs.ISAAC.2021.34,
author = {Lampis, Michael and Mitsou, Valia},
title = {{Fine-Grained Meta-Theorems for Vertex Integrity}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.34},
URN = {urn:nbn:de:0030-drops-154674},
doi = {10.4230/LIPIcs.ISAAC.2021.34},
annote = {Keywords: Model-Checking, Fine-grained complexity, Vertex Integrity}
}
@InProceedings{koana_et_al:LIPIcs.ISAAC.2021.35,
author = {Koana, Tomohiro and Komusiewicz, Christian and Sommer, Frank},
title = {{Essentially Tight Kernels For (Weakly) Closed Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {35:1--35:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.35},
URN = {urn:nbn:de:0030-drops-154681},
doi = {10.4230/LIPIcs.ISAAC.2021.35},
annote = {Keywords: Fixed-parameter tractability, kernelization, c-closure, weak \gamma-closure, Independent Set, Induced Matching, Connected Vertex Cover, Ramsey numbers, Dominating Set}
}
@InProceedings{gourves_et_al:LIPIcs.ISAAC.2021.36,
author = {Gourv\`{e}s, Laurent and Harutyunyan, Ararat and Lampis, Michael and Melissinos, Nikolaos},
title = {{Filling Crosswords Is Very Hard}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {36:1--36:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.36},
URN = {urn:nbn:de:0030-drops-154690},
doi = {10.4230/LIPIcs.ISAAC.2021.36},
annote = {Keywords: Crossword Puzzle, Treewidth, ETH}
}
@InProceedings{gupta_et_al:LIPIcs.ISAAC.2021.37,
author = {Gupta, Siddharth and Sa'ar, Guy and Zehavi, Meirav},
title = {{Grid Recognition: Classical and Parameterized Computational Perspectives}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {37:1--37:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.37},
URN = {urn:nbn:de:0030-drops-154703},
doi = {10.4230/LIPIcs.ISAAC.2021.37},
annote = {Keywords: Grid Recognition, Grid Graph, Parameterized Complexity}
}
@InProceedings{cheriyan_et_al:LIPIcs.ISAAC.2021.38,
author = {Cheriyan, Joseph and Cummings, Robert and Dippel, Jack and Zhu, Jasper},
title = {{An Improved Approximation Algorithm for the Matching Augmentation Problem}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {38:1--38:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.38},
URN = {urn:nbn:de:0030-drops-154714},
doi = {10.4230/LIPIcs.ISAAC.2021.38},
annote = {Keywords: 2-Edge connected graph, 2-edge covers, approximation algorithms, connectivity augmentation, forest augmentation problem, matching augmentation problem, network design}
}
@InProceedings{gu_et_al:LIPIcs.ISAAC.2021.39,
author = {Gu, Qian-Ping and Liang, JiaJian},
title = {{Multimodal Transportation with Ridesharing of Personal Vehicles}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {39:1--39:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.39},
URN = {urn:nbn:de:0030-drops-154727},
doi = {10.4230/LIPIcs.ISAAC.2021.39},
annote = {Keywords: Multimodal transportation, ridesharing, approximation algorithms, computational study}
}
@InProceedings{araujo_et_al:LIPIcs.ISAAC.2021.40,
author = {Araujo, Eloi and Rozante, Luiz C. and Rubert, Diego P. and Martinez, F\'{a}bio V.},
title = {{Algorithms for Normalized Multiple Sequence Alignments}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {40:1--40:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.40},
URN = {urn:nbn:de:0030-drops-154734},
doi = {10.4230/LIPIcs.ISAAC.2021.40},
annote = {Keywords: Multiple sequence alignment, Normalized multiple sequence alignment, Algorithms and complexity}
}
@InProceedings{eskandari_et_al:LIPIcs.ISAAC.2021.41,
author = {Eskandari, Marzieh and Khare, Bhavika and Kumar, Nirman},
title = {{Separated Red Blue Center Clustering}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {41:1--41:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.41},
URN = {urn:nbn:de:0030-drops-154740},
doi = {10.4230/LIPIcs.ISAAC.2021.41},
annote = {Keywords: Algorithms, Facility Location, Clustering, Approximation Algorithms, Computational Geometry}
}
@InProceedings{mestre_et_al:LIPIcs.ISAAC.2021.42,
author = {Mestre, Juli\'{a}n and Pupyrev, Sergey and Umboh, Seeun William},
title = {{On the Extended TSP Problem}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {42:1--42:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.42},
URN = {urn:nbn:de:0030-drops-154751},
doi = {10.4230/LIPIcs.ISAAC.2021.42},
annote = {Keywords: profile-guided optimization, approximation algorithms, bandwidth, TSP}
}
@InProceedings{mathieu_et_al:LIPIcs.ISAAC.2021.43,
author = {Mathieu, Claire and Zhou, Hang},
title = {{Probabilistic Analysis of Euclidean Capacitated Vehicle Routing}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {43:1--43:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.43},
URN = {urn:nbn:de:0030-drops-154769},
doi = {10.4230/LIPIcs.ISAAC.2021.43},
annote = {Keywords: capacitated vehicle routing, iterated tour partitioning, probabilistic analysis, approximation algorithms}
}
@InProceedings{bandyapadhyay_et_al:LIPIcs.ISAAC.2021.44,
author = {Bandyapadhyay, Sayan and Maheshwari, Anil and Smid, Michiel},
title = {{Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {44:1--44:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.44},
URN = {urn:nbn:de:0030-drops-154779},
doi = {10.4230/LIPIcs.ISAAC.2021.44},
annote = {Keywords: Many-to-many matching, bipartite, planar, geometric, approximation}
}
@InProceedings{gudmundsson_et_al:LIPIcs.ISAAC.2021.45,
author = {Gudmundsson, Joachim and Sha, Yuan and Yao, Fan},
title = {{Augmenting Graphs to Minimize the Radius}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {45:1--45:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.45},
URN = {urn:nbn:de:0030-drops-154785},
doi = {10.4230/LIPIcs.ISAAC.2021.45},
annote = {Keywords: graph augmentation, radius, approximation algorithm}
}
@InProceedings{cho_et_al:LIPIcs.ISAAC.2021.46,
author = {Cho, Kyungjin and Oh, Eunjin},
title = {{Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {46:1--46:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.46},
URN = {urn:nbn:de:0030-drops-154794},
doi = {10.4230/LIPIcs.ISAAC.2021.46},
annote = {Keywords: k-means clustering, affine subspaces}
}
@InProceedings{an_et_al:LIPIcs.ISAAC.2021.47,
author = {An, Shinwoo and Oh, Eunjin},
title = {{Feedback Vertex Set on Geometric Intersection Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {47:1--47:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.47},
URN = {urn:nbn:de:0030-drops-154807},
doi = {10.4230/LIPIcs.ISAAC.2021.47},
annote = {Keywords: Feedback vertex set, intersection graphs, parameterized algorithm}
}
@InProceedings{chen_et_al:LIPIcs.ISAAC.2021.48,
author = {Chen, Jianer and Huang, Qin and Kanj, Iyad and Li, Qian and Xia, Ge},
title = {{Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {48:1--48:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.48},
URN = {urn:nbn:de:0030-drops-154816},
doi = {10.4230/LIPIcs.ISAAC.2021.48},
annote = {Keywords: streaming algorithms, matching, parameterized algorithms, lower bounds}
}
@InProceedings{shin_et_al:LIPIcs.ISAAC.2021.49,
author = {Shin, Yongho and An, Hyung-Chan},
title = {{Making Three out of Two: Three-Way Online Correlated Selection}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {49:1--49:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.49},
URN = {urn:nbn:de:0030-drops-154822},
doi = {10.4230/LIPIcs.ISAAC.2021.49},
annote = {Keywords: online correlated selection, multi-way OCS, online algorithms, negative correlation, edge-weighted online bipartite matching}
}
@InProceedings{liang_et_al:LIPIcs.ISAAC.2021.50,
author = {Liang, Ya-Chun and Lai, Kuan-Yun and Chen, Ho-Lin and Iwama, Kazuo},
title = {{Tight Competitive Analyses of Online Car-Sharing Problems}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {50:1--50:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.50},
URN = {urn:nbn:de:0030-drops-154835},
doi = {10.4230/LIPIcs.ISAAC.2021.50},
annote = {Keywords: Car-sharing, Competitive analysis, On-line scheduling, Randomized algorithm}
}
@InProceedings{antoniadis_et_al:LIPIcs.ISAAC.2021.51,
author = {Antoniadis, Antonios and Kumar, Gunjan and Kumar, Nikhil},
title = {{Skeletons and Minimum Energy Scheduling}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {51:1--51:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.51},
URN = {urn:nbn:de:0030-drops-154849},
doi = {10.4230/LIPIcs.ISAAC.2021.51},
annote = {Keywords: scheduling, energy-efficiency, approximation algorithms, dynamic programming, combinatorial algorithms}
}
@InProceedings{albers_et_al:LIPIcs.ISAAC.2021.52,
author = {Albers, Susanne and G\'{a}lvez, Waldo and Janke, Maximilian},
title = {{Machine Covering in the Random-Order Model}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {52:1--52:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.52},
URN = {urn:nbn:de:0030-drops-154858},
doi = {10.4230/LIPIcs.ISAAC.2021.52},
annote = {Keywords: Machine Covering, Online Algorithm, Random-Order, Competitive Analysis, Scheduling}
}
@InProceedings{touitou:LIPIcs.ISAAC.2021.53,
author = {Touitou, Noam},
title = {{Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {53:1--53:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.53},
URN = {urn:nbn:de:0030-drops-154865},
doi = {10.4230/LIPIcs.ISAAC.2021.53},
annote = {Keywords: Network Design, Deadlines, Delay, Online, Set Cover}
}
@InProceedings{allender_et_al:LIPIcs.ISAAC.2021.54,
author = {Allender, Eric and Gouwar, John and Hirahara, Shuichi and Robelle, Caleb},
title = {{Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {54:1--54:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.54},
URN = {urn:nbn:de:0030-drops-154875},
doi = {10.4230/LIPIcs.ISAAC.2021.54},
annote = {Keywords: Kolmogorov Complexity, Interactive Proofs, Minimum Circuit Size Problem, Worst-case to Average-case Reductions}
}
@InProceedings{canonne_et_al:LIPIcs.ISAAC.2021.55,
author = {Canonne, Cl\'{e}ment L. and Wimmer, Karl},
title = {{Identity Testing Under Label Mismatch}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {55:1--55:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.55},
URN = {urn:nbn:de:0030-drops-154880},
doi = {10.4230/LIPIcs.ISAAC.2021.55},
annote = {Keywords: distribution testing, property testing, permutations, lower bounds}
}
@InProceedings{kaufman_et_al:LIPIcs.ISAAC.2021.56,
author = {Kaufman, Tali and Mass, David},
title = {{Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {56:1--56:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.56},
URN = {urn:nbn:de:0030-drops-154898},
doi = {10.4230/LIPIcs.ISAAC.2021.56},
annote = {Keywords: High dimensional expanders, Unique-neighbor-like expansion, Cosystolic expansion}
}
@InProceedings{czyzowicz_et_al:LIPIcs.ISAAC.2021.57,
author = {Czyzowicz, Jurek and Killick, Ryan and Kranakis, Evangelos and Krizanc, Danny and Narayanan, Lata and Opatrny, Jaroslav and Pankratov, Denis and Shende, Sunil},
title = {{Group Evacuation on a Line by Agents with Different Communication Abilities}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {57:1--57:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.57},
URN = {urn:nbn:de:0030-drops-154903},
doi = {10.4230/LIPIcs.ISAAC.2021.57},
annote = {Keywords: Agent, Communication, Evacuation, Mobile, Receiver, Search, Sender}
}
@InProceedings{legall_et_al:LIPIcs.ISAAC.2021.58,
author = {Le Gall, Fran\c{c}ois and Miyamoto, Masayuki},
title = {{Lower Bounds for Induced Cycle Detection in Distributed Computing}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {58:1--58:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.58},
URN = {urn:nbn:de:0030-drops-154919},
doi = {10.4230/LIPIcs.ISAAC.2021.58},
annote = {Keywords: Distributed computing, Lower bounds, Subgraph detection}
}
@InProceedings{czygrinow_et_al:LIPIcs.ISAAC.2021.59,
author = {Czygrinow, Andrzej and Han\'{c}kowiak, Micha{\l} and Witkowski, Marcin},
title = {{Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {59:1--59:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.59},
URN = {urn:nbn:de:0030-drops-154925},
doi = {10.4230/LIPIcs.ISAAC.2021.59},
annote = {Keywords: Distributed algorithms, f-matching, b-matching}
}
@InProceedings{patel_et_al:LIPIcs.ISAAC.2021.60,
author = {Patel, Dhrumil and Shah, Rahul},
title = {{Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {60:1--60:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.60},
URN = {urn:nbn:de:0030-drops-154932},
doi = {10.4230/LIPIcs.ISAAC.2021.60},
annote = {Keywords: Pattern Matching, Succinct Data Structures}
}
@InProceedings{das_et_al:LIPIcs.ISAAC.2021.61,
author = {Das, Rathish and Lincoln, Andrea and Lynch, Jayson and Munro, J. Ian},
title = {{Dynamic Boolean Formula Evaluation}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {61:1--61:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.61},
URN = {urn:nbn:de:0030-drops-154945},
doi = {10.4230/LIPIcs.ISAAC.2021.61},
annote = {Keywords: Data Structures, SAT, Dynamic Algorithms, Boolean Formulas, Fine-grained Complexity, Parallel Algorithms}
}
@InProceedings{bacic_et_al:LIPIcs.ISAAC.2021.62,
author = {Bacic, Joyce and Mehrabi, Saeed and Smid, Michiel},
title = {{Shortest Beer Path Queries in Outerplanar Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {62:1--62:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.62},
URN = {urn:nbn:de:0030-drops-154950},
doi = {10.4230/LIPIcs.ISAAC.2021.62},
annote = {Keywords: shortest paths, outerplanar graph}
}
@InProceedings{bhore_et_al:LIPIcs.ISAAC.2021.63,
author = {Bhore, Sujoy and Jain, Rahul},
title = {{Space-Efficient Algorithms for Reachability in Directed Geometric Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {63:1--63:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.63},
URN = {urn:nbn:de:0030-drops-154961},
doi = {10.4230/LIPIcs.ISAAC.2021.63},
annote = {Keywords: Reachablity, Geometric intersection graphs, Space-efficient algorithms}
}
@InProceedings{ferragina_et_al:LIPIcs.ISAAC.2021.64,
author = {Ferragina, Paolo and Manzini, Giovanni and Vinciguerra, Giorgio},
title = {{Repetition- and Linearity-Aware Rank/Select Dictionaries}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {64:1--64:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.64},
URN = {urn:nbn:de:0030-drops-154974},
doi = {10.4230/LIPIcs.ISAAC.2021.64},
annote = {Keywords: Data compression, Compressed data structures, Entropy}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.ISAAC.2021.65,
author = {Charalampopoulos, Panagiotis and Chen, Huiping and Christen, Peter and Loukides, Grigorios and Pisanti, Nadia and Pissis, Solon P. and Radoszewski, Jakub},
title = {{Pattern Masking for Dictionary Matching}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {65:1--65:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.65},
URN = {urn:nbn:de:0030-drops-154982},
doi = {10.4230/LIPIcs.ISAAC.2021.65},
annote = {Keywords: string algorithms, dictionary matching, wildcards, record linkage, query term dropping}
}
@InProceedings{guala_et_al:LIPIcs.ISAAC.2021.66,
author = {Gual\`{a}, Luciano and Leucci, Stefano and Ziccardi, Isabella},
title = {{Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {66:1--66:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.66},
URN = {urn:nbn:de:0030-drops-154998},
doi = {10.4230/LIPIcs.ISAAC.2021.66},
annote = {Keywords: level ancestor queries, lowest common ancestor queries, bottleneck vertex queries, resilient data structures, faulty-RAM model, dynamic trees}
}
@InProceedings{tan:LIPIcs.ISAAC.2021.67,
author = {Tan, Shuhao},
title = {{Computing Shapley Values for Mean Width in 3-D}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {67:1--67:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.67},
URN = {urn:nbn:de:0030-drops-155008},
doi = {10.4230/LIPIcs.ISAAC.2021.67},
annote = {Keywords: Shapley value, mean width, dynamic convolution}
}
@InProceedings{asano:LIPIcs.ISAAC.2021.68,
author = {Asano, Takao},
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)},
pages = {68:1--68:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.68},
URN = {urn:nbn:de:0030-drops-155011},
doi = {10.4230/LIPIcs.ISAAC.2021.68},
annote = {Keywords: cake-cutting problem, envy-freeness, fairness, truthfulness, mechanism design}
}
@InProceedings{tang_et_al:LIPIcs.ISAAC.2021.69,
author = {Tang, Shaojie and Yuan, Jing},
title = {{Adaptive Regularized Submodular Maximization}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {69:1--69:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.69},
URN = {urn:nbn:de:0030-drops-155029},
doi = {10.4230/LIPIcs.ISAAC.2021.69},
annote = {Keywords: Adaptive submodularity, approximation algorithms, active learning}
}
@InProceedings{kim_et_al:LIPIcs.ISAAC.2021.70,
author = {Kim, Donggyu and Lee, Duksang and Oum, Sang-il},
title = {{\Gamma-Graphic Delta-Matroids and Their Applications}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {70:1--70:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.70},
URN = {urn:nbn:de:0030-drops-155038},
doi = {10.4230/LIPIcs.ISAAC.2021.70},
annote = {Keywords: delta-matroid, group-labelled graph, greedy algorithm, tree packing}
}
@InProceedings{yokoi:LIPIcs.ISAAC.2021.71,
author = {Yokoi, Yu},
title = {{An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {71:1--71:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.71},
URN = {urn:nbn:de:0030-drops-155047},
doi = {10.4230/LIPIcs.ISAAC.2021.71},
annote = {Keywords: Stable matching, Approximation algorithm, Matroid, Strategy-proofness}
}
@InProceedings{enoch_et_al:LIPIcs.ISAAC.2021.72,
author = {Enoch, Julian and Fox, Kyle and Mesica, Dor and Mozes, Shay},
title = {{A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {72:1--72:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.72},
URN = {urn:nbn:de:0030-drops-155057},
doi = {10.4230/LIPIcs.ISAAC.2021.72},
annote = {Keywords: flow, planar graphs, vertex capacities}
}
@InProceedings{biabani_et_al:LIPIcs.ISAAC.2021.73,
author = {Biabani, Leyla and de Berg, Mark and Monemizadeh, Morteza},
title = {{Maximum-Weight Matching in Sliding Windows and Beyond}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {73:1--73:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.73},
URN = {urn:nbn:de:0030-drops-155061},
doi = {10.4230/LIPIcs.ISAAC.2021.73},
annote = {Keywords: maximum-weight matching, sliding-window model, approximation algorithm, and subadditve functions}
}
@InProceedings{hasegawa_et_al:LIPIcs.ISAAC.2021.74,
author = {Hasegawa, Atsuya and Le Gall, Fran\c{c}ois},
title = {{Quantum Advantage with Shallow Circuits Under Arbitrary Corruption}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {74:1--74:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.74},
URN = {urn:nbn:de:0030-drops-155076},
doi = {10.4230/LIPIcs.ISAAC.2021.74},
annote = {Keywords: Quantum computing, circuit complexity, constant-depth circuits}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing