@Proceedings{iwata_et_al:LIPIcs.ISAAC.2023,
title = {{LIPIcs, Volume 283, ISAAC 2023, Complete Volume}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {1--960},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023},
URN = {urn:nbn:de:0030-drops-193011},
doi = {10.4230/LIPIcs.ISAAC.2023},
annote = {Keywords: LIPIcs, Volume 283, ISAAC 2023, Complete Volume}
}
@InProceedings{iwata_et_al:LIPIcs.ISAAC.2023.0,
author = {Iwata, Satoru and Kakimura, Naonori},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.0},
URN = {urn:nbn:de:0030-drops-193029},
doi = {10.4230/LIPIcs.ISAAC.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{elkind:LIPIcs.ISAAC.2023.1,
author = {Elkind, Edith},
title = {{Group Fairness: From Multiwinner Voting to Participatory Budgeting}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {1:1--1:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.1},
URN = {urn:nbn:de:0030-drops-193038},
doi = {10.4230/LIPIcs.ISAAC.2023.1},
annote = {Keywords: multiwinner voting, participatory budgeting, justified representation}
}
@InProceedings{hong:LIPIcs.ISAAC.2023.2,
author = {Hong, Seok-Hee},
title = {{Faithful Graph Drawing}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.2},
URN = {urn:nbn:de:0030-drops-193044},
doi = {10.4230/LIPIcs.ISAAC.2023.2},
annote = {Keywords: Graph drawing, Planar graphs, Beyond planar graphs, Tutte’s barycenter theorem, Steinitz’s theorem, F\'{a}ry’s theorem, Sublinear-time graph drawing algorithm, Faithful graph drawing, Symmetric graph drawing}
}
@InProceedings{a.akitaya_et_al:LIPIcs.ISAAC.2023.3,
author = {A. Akitaya, Hugo and Buchin, Maike and Mirzanezhad, Majid and Ryvkin, Leonie and Wenk, Carola},
title = {{Realizability of Free Spaces of Curves}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {3:1--3:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.3},
URN = {urn:nbn:de:0030-drops-193057},
doi = {10.4230/LIPIcs.ISAAC.2023.3},
annote = {Keywords: Fr\'{e}chet distance, Distance Geometry, free space diagram, inverse problem}
}
@InProceedings{adamson_et_al:LIPIcs.ISAAC.2023.4,
author = {Adamson, Duncan and Fleischmann, Pamela and Huch, Annika and Ko{\ss}, Tore and Manea, Florin and Nowotka, Dirk},
title = {{k-Universality of Regular Languages}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {4:1--4:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.4},
URN = {urn:nbn:de:0030-drops-193064},
doi = {10.4230/LIPIcs.ISAAC.2023.4},
annote = {Keywords: String Algorithms, Regular Languages, Finite Automata, Subsequences}
}
@InProceedings{ahn_et_al:LIPIcs.ISAAC.2023.5,
author = {Ahn, Jungho and Kim, Jinha and Kwon, O-joung},
title = {{Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {5:1--5:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.5},
URN = {urn:nbn:de:0030-drops-193072},
doi = {10.4230/LIPIcs.ISAAC.2023.5},
annote = {Keywords: kernelization, independent set, dominating set, covering, packing}
}
@InProceedings{alkema_et_al:LIPIcs.ISAAC.2023.6,
author = {Alkema, Henk and de Berg, Mark},
title = {{Geometric TSP on Sets}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.6},
URN = {urn:nbn:de:0030-drops-193083},
doi = {10.4230/LIPIcs.ISAAC.2023.6},
annote = {Keywords: Euclidean TSP, TSP on Sets, Rectilinear TSP, TSP on Neighbourhoods}
}
@InProceedings{amano:LIPIcs.ISAAC.2023.7,
author = {Amano, Kazuyuki},
title = {{Depth-Three Circuits for Inner Product and Majority Functions}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.7},
URN = {urn:nbn:de:0030-drops-193092},
doi = {10.4230/LIPIcs.ISAAC.2023.7},
annote = {Keywords: Circuit complexity, depth-3 circuits, upper bounds, lower bounds, computer-assisted proof}
}
@InProceedings{ardevolmartinez_et_al:LIPIcs.ISAAC.2023.8,
author = {Ard\'{e}vol Mart{\'\i}nez, Virginia and Rizzi, Romeo and Sikora, Florian and Vialette, St\'{e}phane},
title = {{Recognizing Unit Multiple Intervals Is Hard}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.8},
URN = {urn:nbn:de:0030-drops-193102},
doi = {10.4230/LIPIcs.ISAAC.2023.8},
annote = {Keywords: Interval graphs, unit multiple interval graphs, recognition, NP-hardness}
}
@InProceedings{bampis_et_al:LIPIcs.ISAAC.2023.9,
author = {Bampis, Evripidis and Kononov, Alexander and Lucarelli, Giorgio and Pascual, Fanny},
title = {{Non-Clairvoyant Makespan Minimization Scheduling with Predictions}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {9:1--9:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.9},
URN = {urn:nbn:de:0030-drops-193114},
doi = {10.4230/LIPIcs.ISAAC.2023.9},
annote = {Keywords: scheduling, online, learning-augmented algorithm}
}
@InProceedings{bathie_et_al:LIPIcs.ISAAC.2023.10,
author = {Bathie, Gabriel and Kociumaka, Tomasz and Starikovskaya, Tatiana},
title = {{Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.10},
URN = {urn:nbn:de:0030-drops-193124},
doi = {10.4230/LIPIcs.ISAAC.2023.10},
annote = {Keywords: Approximate pattern matching, streaming algorithms, palindromes, squares}
}
@InProceedings{bergougnoux_et_al:LIPIcs.ISAAC.2023.11,
author = {Bergougnoux, Benjamin and Gajarsk\'{y}, Jakub and Gu\'{s}piel, Grzegorz and Hlin\v{e}n\'{y}, Petr and Pokr\'{y}vka, Filip and Soko{\l}owski, Marek},
title = {{Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {11:1--11:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.11},
URN = {urn:nbn:de:0030-drops-193130},
doi = {10.4230/LIPIcs.ISAAC.2023.11},
annote = {Keywords: twin-width, tree-width, excluded grid, sparsity}
}
@InProceedings{bernardini_et_al:LIPIcs.ISAAC.2023.12,
author = {Bernardini, Giulia and Fici, Gabriele and Gawrychowski, Pawe{\l} and Pissis, Solon P.},
title = {{Substring Complexity in Sublinear Space}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {12:1--12:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.12},
URN = {urn:nbn:de:0030-drops-193143},
doi = {10.4230/LIPIcs.ISAAC.2023.12},
annote = {Keywords: sublinear-space algorithm, string algorithm, substring complexity}
}
@InProceedings{berndt_et_al:LIPIcs.ISAAC.2023.13,
author = {Berndt, Sebastian and Brinkop, Hauke and Jansen, Klaus and Mnich, Matthias and Stamm, Tobias},
title = {{New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.13},
URN = {urn:nbn:de:0030-drops-193155},
doi = {10.4230/LIPIcs.ISAAC.2023.13},
annote = {Keywords: Integer programming, scheduling algorithms, uniformly related machines, makespan minimization}
}
@InProceedings{blauth_et_al:LIPIcs.ISAAC.2023.14,
author = {Blauth, Jannis and Neuwohner, Meike and Puhlmann, Luise and Vygen, Jens},
title = {{Improved Guarantees for the a Priori TSP}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {14:1--14:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.14},
URN = {urn:nbn:de:0030-drops-193161},
doi = {10.4230/LIPIcs.ISAAC.2023.14},
annote = {Keywords: A priori TSP, random sampling, stochastic combinatorial optimization}
}
@InProceedings{borzechowski_et_al:LIPIcs.ISAAC.2023.15,
author = {Borzechowski, Michaela and Schnider, Patrick and Weber, Simon},
title = {{An FPT Algorithm for Splitting a Necklace Among Two Thieves}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {15:1--15:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.15},
URN = {urn:nbn:de:0030-drops-193178},
doi = {10.4230/LIPIcs.ISAAC.2023.15},
annote = {Keywords: Necklace splitting, n-separability, well-separation, ham sandwich, FPT}
}
@InProceedings{brand_et_al:LIPIcs.ISAAC.2023.16,
author = {Brand, Cornelius and Lassota, Alexandra},
title = {{Fast Convolutions for Near-Convex Sequences}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.16},
URN = {urn:nbn:de:0030-drops-193188},
doi = {10.4230/LIPIcs.ISAAC.2023.16},
annote = {Keywords: (min,+)-convolution, fine-grained complexity, convex sequences}
}
@InProceedings{chakraborty_et_al:LIPIcs.ISAAC.2023.17,
author = {Chakraborty, Diptarka and Dey, Sanjana},
title = {{Matrix Completion: Approximating the Minimum Diameter}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {17:1--17:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.17},
URN = {urn:nbn:de:0030-drops-193197},
doi = {10.4230/LIPIcs.ISAAC.2023.17},
annote = {Keywords: Incomplete Data, Matrix Completion, Hamming Distance, Diameter Minimization, Approximation Algorithms, Hardness of Approximation}
}
@InProceedings{chen_et_al:LIPIcs.ISAAC.2023.18,
author = {Chen, Jingbang and He, Meng and Munro, J. Ian and Peng, Richard and Wu, Kaiyu and Zhang, Daniel J.},
title = {{Distance Queries over Dynamic Interval Graphs}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {18:1--18:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.18},
URN = {urn:nbn:de:0030-drops-193207},
doi = {10.4230/LIPIcs.ISAAC.2023.18},
annote = {Keywords: interval graph, proper interval graph, intersection graph, geometric intersection graph, distance oracle, distance query, shortest path query, dynamic graph}
}
@InProceedings{chu_et_al:LIPIcs.ISAAC.2023.19,
author = {Chu, Huairui and Lin, Bingkai},
title = {{FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {19:1--19:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.19},
URN = {urn:nbn:de:0030-drops-193216},
doi = {10.4230/LIPIcs.ISAAC.2023.19},
annote = {Keywords: FPT approximation algorithm, Treewidth, Capacitated vertex cover, Target set selection, Vector dominating set}
}
@InProceedings{cohen_et_al:LIPIcs.ISAAC.2023.20,
author = {Cohen, Tomer and Kulik, Ariel and Shachnai, Hadas},
title = {{Improved Approximation for Two-Dimensional Vector Multiple Knapsack}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.20},
URN = {urn:nbn:de:0030-drops-193229},
doi = {10.4230/LIPIcs.ISAAC.2023.20},
annote = {Keywords: vector multiple knapsack, two-dimensional packing, randomized rounding, approximation algorithms}
}
@InProceedings{conte_et_al:LIPIcs.ISAAC.2023.21,
author = {Conte, Alessio and Grossi, Roberto and Punzi, Giulia and Uno, Takeaki},
title = {{A Compact DAG for Storing and Searching Maximal Common Subsequences}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.21},
URN = {urn:nbn:de:0030-drops-193231},
doi = {10.4230/LIPIcs.ISAAC.2023.21},
annote = {Keywords: Maximal common subsequence, DAG, Compact data structures, Enumeration, Constant amortized time, Random access}
}
@InProceedings{cotumaccio:LIPIcs.ISAAC.2023.22,
author = {Cotumaccio, Nicola},
title = {{Prefix Sorting DFAs: A Recursive Algorithm}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {22:1--22:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.22},
URN = {urn:nbn:de:0030-drops-193242},
doi = {10.4230/LIPIcs.ISAAC.2023.22},
annote = {Keywords: Suffix Array, Burrows-Wheeler Transform, FM-index, Recursive Algorithms, Graph Theory, Pattern Matching}
}
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2023.23,
author = {de Berg, Mark and Biabani, Leyla and Monemizadeh, Morteza and Theocharous, Leonidas},
title = {{Clustering in Polygonal Domains}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.23},
URN = {urn:nbn:de:0030-drops-193252},
doi = {10.4230/LIPIcs.ISAAC.2023.23},
annote = {Keywords: clustering, geodesic distance, coreset, outliers}
}
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2023.24,
author = {de Berg, Mark and L\'{o}pez Mart{\'\i}nez, Andr\'{e}s and Spieksma, Frits},
title = {{Finding Diverse Minimum s-t Cuts}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {24:1--24:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.24},
URN = {urn:nbn:de:0030-drops-193267},
doi = {10.4230/LIPIcs.ISAAC.2023.24},
annote = {Keywords: S-T MinCut, Diversity, Lattice Theory, Submodular Function Minimization}
}
@InProceedings{dhar_et_al:LIPIcs.ISAAC.2023.25,
author = {Dhar, Anubhav and Hait, Soumita and Kolay, Sudeshna},
title = {{Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.25},
URN = {urn:nbn:de:0030-drops-193273},
doi = {10.4230/LIPIcs.ISAAC.2023.25},
annote = {Keywords: Steiner minimal tree, Euclidean Geometry, Almost Convex point sets, FPTAS, strong NP-completeness}
}
@InProceedings{didimo_et_al:LIPIcs.ISAAC.2023.26,
author = {Didimo, Walter and Kaufmann, Michael and Liotta, Giuseppe and Ortali, Giacomo and Patrignani, Maurizio},
title = {{Rectilinear-Upward Planarity Testing of Digraphs}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {26:1--26:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.26},
URN = {urn:nbn:de:0030-drops-193283},
doi = {10.4230/LIPIcs.ISAAC.2023.26},
annote = {Keywords: Graph drawing, orthogonal drawings, upward drawings, rectilinear planarity, upward planarity}
}
@InProceedings{disser_et_al:LIPIcs.ISAAC.2023.27,
author = {Disser, Yann and Mosis, Nils},
title = {{A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {27:1--27:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.27},
URN = {urn:nbn:de:0030-drops-193292},
doi = {10.4230/LIPIcs.ISAAC.2023.27},
annote = {Keywords: Bland’s pivot rule, Dantzig’s pivot rule, Largest Increase pivot rule, Markov decision process, policy iteration, simplex algorithm}
}
@InProceedings{elmaalouly_et_al:LIPIcs.ISAAC.2023.28,
author = {El Maalouly, Nicolas and Steiner, Raphael and Wulf, Lasse},
title = {{Exact Matching: Correct Parity and FPT Parameterized by Independence Number}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {28:1--28:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.28},
URN = {urn:nbn:de:0030-drops-193302},
doi = {10.4230/LIPIcs.ISAAC.2023.28},
annote = {Keywords: Perfect Matching, Exact Matching, Independence Number, Parameterized Complexity}
}
@InProceedings{englert_et_al:LIPIcs.ISAAC.2023.29,
author = {Englert, Matthias and Matsakis, Nicolaos and Vesel\'{y}, Pavel},
title = {{Approximation Guarantees for Shortest Superstrings: Simpler and Better}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {29:1--29:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.29},
URN = {urn:nbn:de:0030-drops-193319},
doi = {10.4230/LIPIcs.ISAAC.2023.29},
annote = {Keywords: Shortest Superstring problem, Approximation Algorithms}
}
@InProceedings{eppstein_et_al:LIPIcs.ISAAC.2023.30,
author = {Eppstein, David and Frishberg, Daniel},
title = {{Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {30:1--30:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.30},
URN = {urn:nbn:de:0030-drops-193324},
doi = {10.4230/LIPIcs.ISAAC.2023.30},
annote = {Keywords: Glauber dynamics, mixing time, projection-restriction, multicommodity flow}
}
@InProceedings{feghali_et_al:LIPIcs.ISAAC.2023.31,
author = {Feghali, Carl and Lucke, Felicia and Paulusma, Dani\"{e}l and Ries, Bernard},
title = {{Matching Cuts in Graphs of High Girth and H-Free Graphs}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.31},
URN = {urn:nbn:de:0030-drops-193332},
doi = {10.4230/LIPIcs.ISAAC.2023.31},
annote = {Keywords: matching cut, perfect matching, girth, H-free graph}
}
@InProceedings{fomin_et_al:LIPIcs.ISAAC.2023.32,
author = {Fomin, Fedor V. and Golovach, Petr A. and Korhonen, Tuukka and Stamoulis, Giannos},
title = {{Computing Paths of Large Rank in Planar Frameworks Deterministically}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {32:1--32:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.32},
URN = {urn:nbn:de:0030-drops-193341},
doi = {10.4230/LIPIcs.ISAAC.2023.32},
annote = {Keywords: Planar graph, longest path, linear matroid, irrelevant vertex}
}
@InProceedings{gregor_et_al:LIPIcs.ISAAC.2023.33,
author = {Gregor, Petr and M\"{u}tze, Torsten and Namrata},
title = {{Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {33:1--33:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.33},
URN = {urn:nbn:de:0030-drops-193350},
doi = {10.4230/LIPIcs.ISAAC.2023.33},
annote = {Keywords: Generation, binary tree, pattern avoidance, permutation, bijection}
}
@InProceedings{gudmundsson_et_al:LIPIcs.ISAAC.2023.34,
author = {Gudmundsson, Joachim and Huang, Zijin and van Renssen, Andr\'{e} and Wong, Sampson},
title = {{Computing a Subtrajectory Cluster from c-Packed Trajectories}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.34},
URN = {urn:nbn:de:0030-drops-193364},
doi = {10.4230/LIPIcs.ISAAC.2023.34},
annote = {Keywords: Subtrajectory cluster, c-packed trajectories, Computational geometry}
}
@InProceedings{gudmundsson_et_al:LIPIcs.ISAAC.2023.35,
author = {Gudmundsson, Joachim and Sha, Yuan},
title = {{Shortest Beer Path Queries in Digraphs with Bounded Treewidth}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {35:1--35:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.35},
URN = {urn:nbn:de:0030-drops-193379},
doi = {10.4230/LIPIcs.ISAAC.2023.35},
annote = {Keywords: Graph algorithms, Shortest Path, Data structures, Bounded treewidth}
}
@InProceedings{gutowski_et_al:LIPIcs.ISAAC.2023.36,
author = {Gutowski, Grzegorz and Junosza-Szaniawski, Konstanty and Klesen, Felix and Rz\k{a}\.{z}ewski, Pawe{\l} and Wolff, Alexander and Zink, Johannes},
title = {{Coloring and Recognizing Mixed Interval Graphs}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {36:1--36:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.36},
URN = {urn:nbn:de:0030-drops-193388},
doi = {10.4230/LIPIcs.ISAAC.2023.36},
annote = {Keywords: Interval Graphs, Mixed Graphs, Graph Coloring}
}
@InProceedings{hanaka_et_al:LIPIcs.ISAAC.2023.37,
author = {Hanaka, Tesshu and Ono, Hirotaka and Sadakane, Kunihiko and Sugiyama, Kosuke},
title = {{Shortest Beer Path Queries Based on Graph Decomposition}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {37:1--37:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.37},
URN = {urn:nbn:de:0030-drops-193397},
doi = {10.4230/LIPIcs.ISAAC.2023.37},
annote = {Keywords: graph algorithm, shortest path problem, SPQR tree}
}
@InProceedings{harutyunyan_et_al:LIPIcs.ISAAC.2023.38,
author = {Harutyunyan, Hovhannes A. and Koupayi, Kamran and Pankratov, Denis},
title = {{Temporal Separators with Deadlines}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {38:1--38:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.38},
URN = {urn:nbn:de:0030-drops-193407},
doi = {10.4230/LIPIcs.ISAAC.2023.38},
annote = {Keywords: Temporal graphs, dynamic graphs, vertex separator, vertex cut, separating set, deadlines, inapproximability, approximation algorithms}
}
@InProceedings{hirahara_et_al:LIPIcs.ISAAC.2023.39,
author = {Hirahara, Shuichi and Moshkovitz, Dana},
title = {{Regularization of Low Error PCPs and an Application to MCSP}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {39:1--39:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.39},
URN = {urn:nbn:de:0030-drops-193411},
doi = {10.4230/LIPIcs.ISAAC.2023.39},
annote = {Keywords: PCP theorem, regularization, Minimum Circuit Size Problem}
}
@InProceedings{jaffke_et_al:LIPIcs.ISAAC.2023.40,
author = {Jaffke, Lars and Lima, Paloma T. and Sharma, Roohani},
title = {{Structural Parameterizations of b-Coloring}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {40:1--40:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.40},
URN = {urn:nbn:de:0030-drops-193429},
doi = {10.4230/LIPIcs.ISAAC.2023.40},
annote = {Keywords: b-coloring, structural parameterization, XNLP, pathwidth, neighborhood diversity, twin cover}
}
@InProceedings{jaiswal_et_al:LIPIcs.ISAAC.2023.41,
author = {Jaiswal, Ragesh and Kumar, Amit},
title = {{Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {41:1--41:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.41},
URN = {urn:nbn:de:0030-drops-193433},
doi = {10.4230/LIPIcs.ISAAC.2023.41},
annote = {Keywords: clustering, constrained, outlier}
}
@InProceedings{jansen_et_al:LIPIcs.ISAAC.2023.42,
author = {Jansen, Bart M. P. and de Kroon, Jari J. H. and W{\l}odarczyk, Micha{\l}},
title = {{Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {42:1--42:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.42},
URN = {urn:nbn:de:0030-drops-193440},
doi = {10.4230/LIPIcs.ISAAC.2023.42},
annote = {Keywords: fixed-parameter tractability, important separators, secluded subgraphs}
}
@InProceedings{jourdan_et_al:LIPIcs.ISAAC.2023.43,
author = {Jourdan, Ben and Macgregor, Peter and Sun, He},
title = {{Is the Algorithmic Kadison-Singer Problem Hard?}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {43:1--43:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.43},
URN = {urn:nbn:de:0030-drops-193457},
doi = {10.4230/LIPIcs.ISAAC.2023.43},
annote = {Keywords: Kadison-Singer problem, spectral sparsification}
}
@InProceedings{kammer_et_al:LIPIcs.ISAAC.2023.44,
author = {Kammer, Frank and Meintrup, Johannes},
title = {{Succinct Planar Encoding with Minor Operations}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {44:1--44:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.44},
URN = {urn:nbn:de:0030-drops-193460},
doi = {10.4230/LIPIcs.ISAAC.2023.44},
annote = {Keywords: planar graph, r-division, separator, succinct encoding, graph minors}
}
@InProceedings{kao:LIPIcs.ISAAC.2023.45,
author = {Kao, Mong-Jen},
title = {{Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.45},
URN = {urn:nbn:de:0030-drops-193474},
doi = {10.4230/LIPIcs.ISAAC.2023.45},
annote = {Keywords: Capacitated facility location, Hard capacities, Uniform facility cost}
}
@InProceedings{khazaliya_et_al:LIPIcs.ISAAC.2023.46,
author = {Khazaliya, Liana and Kindermann, Philipp and Liotta, Giuseppe and Montecchiani, Fabrizio and Simonov, Kirill},
title = {{The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {46:1--46:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.46},
URN = {urn:nbn:de:0030-drops-193483},
doi = {10.4230/LIPIcs.ISAAC.2023.46},
annote = {Keywords: st-planar graphs, parameterized complexity, upward planarity}
}
@InProceedings{kimura_et_al:LIPIcs.ISAAC.2023.47,
author = {Kimura, Kei and Makino, Kazuhisa},
title = {{A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {47:1--47:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.47},
URN = {urn:nbn:de:0030-drops-193492},
doi = {10.4230/LIPIcs.ISAAC.2023.47},
annote = {Keywords: linear programming problem, certifying algorithm, Horn system}
}
@InProceedings{kobayashi_et_al:LIPIcs.ISAAC.2023.48,
author = {Kobayashi, Yusuke and Mahara, Ryoga and Schwarcz, Tam\'{a}s},
title = {{Reconfiguration of the Union of Arborescences}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {48:1--48:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.48},
URN = {urn:nbn:de:0030-drops-193502},
doi = {10.4230/LIPIcs.ISAAC.2023.48},
annote = {Keywords: Arborescence packing, common matroid basis, combinatorial reconfiguration}
}
@InProceedings{kobayashi_et_al:LIPIcs.ISAAC.2023.49,
author = {Kobayashi, Yusuke and Noguchi, Takashi},
title = {{An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {49:1--49:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.49},
URN = {urn:nbn:de:0030-drops-193514},
doi = {10.4230/LIPIcs.ISAAC.2023.49},
annote = {Keywords: approximation algorithm, survivable network design, minimum 2-edge-connected spanning subgraph, triangle-free 2-matching}
}
@InProceedings{kuo_et_al:LIPIcs.ISAAC.2023.50,
author = {Kuo, Ting-Yu and Chen, Yu-Han and Frosini, Andrea and Hsieh, Sun-Yuan and Tsai, Shi-Chun and Kao, Mong-Jen},
title = {{On Min-Max Graph Balancing with Strict Negative Correlation Constraints}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {50:1--50:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.50},
URN = {urn:nbn:de:0030-drops-193524},
doi = {10.4230/LIPIcs.ISAAC.2023.50},
annote = {Keywords: Unrelated Scheduling, Graph Balancing, Strict Correlation Constraints}
}
@InProceedings{liu_et_al:LIPIcs.ISAAC.2023.51,
author = {Liu, Gang and Wang, Haitao},
title = {{On the Line-Separable Unit-Disk Coverage and Related Problems}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {51:1--51:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.51},
URN = {urn:nbn:de:0030-drops-193535},
doi = {10.4230/LIPIcs.ISAAC.2023.51},
annote = {Keywords: disk coverage, line-separable, unit-disk, line-constrained, half-planes}
}
@InProceedings{manthey_et_al:LIPIcs.ISAAC.2023.52,
author = {Manthey, Bodo and van Rhijn, Jesse},
title = {{Improved Smoothed Analysis of 2-Opt for the Euclidean TSP}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {52:1--52:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.52},
URN = {urn:nbn:de:0030-drops-193549},
doi = {10.4230/LIPIcs.ISAAC.2023.52},
annote = {Keywords: Travelling salesman problem, smoothed analysis, probabilistic analysis, local search, heuristics, 2-opt}
}
@InProceedings{misra_et_al:LIPIcs.ISAAC.2023.53,
author = {Misra, Neeldhara and Mittal, Harshil and Saurabh, Saket and Thakkar, Dhara},
title = {{On the Complexity of the Eigenvalue Deletion Problem}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {53:1--53:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.53},
URN = {urn:nbn:de:0030-drops-193555},
doi = {10.4230/LIPIcs.ISAAC.2023.53},
annote = {Keywords: Graph Modification, Rank Reduction, Eigenvalues}
}
@InProceedings{mukherjee_et_al:LIPIcs.ISAAC.2023.54,
author = {Mukherjee, Joydeep and Saha, Tamojit},
title = {{Connected Vertex Cover on AT-Free Graphs}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {54:1--54:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.54},
URN = {urn:nbn:de:0030-drops-193566},
doi = {10.4230/LIPIcs.ISAAC.2023.54},
annote = {Keywords: Graph Algorithm, AT-free graphs, Connected Vertex Cover, Optimization}
}
@InProceedings{podder_et_al:LIPIcs.ISAAC.2023.55,
author = {Podder, Supartha and Yao, Penghui and Ye, Zekun},
title = {{On the Fine-Grained Query Complexity of Symmetric Functions}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {55:1--55:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.55},
URN = {urn:nbn:de:0030-drops-193570},
doi = {10.4230/LIPIcs.ISAAC.2023.55},
annote = {Keywords: Query complexity, Symmetric functions, Quantum advantages}
}
@InProceedings{roy_et_al:LIPIcs.ISAAC.2023.56,
author = {Roy, Sampriti and Vasudev, Yadu},
title = {{Testing Properties of Distributions in the Streaming Model}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {56:1--56:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.56},
URN = {urn:nbn:de:0030-drops-193588},
doi = {10.4230/LIPIcs.ISAAC.2023.56},
annote = {Keywords: Property testing, distribution testing, streaming}
}
@InProceedings{shao_et_al:LIPIcs.ISAAC.2023.57,
author = {Shao, Shuai and \v{Z}ivn\'{y}, Stanislav},
title = {{A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {57:1--57:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.57},
URN = {urn:nbn:de:0030-drops-193597},
doi = {10.4230/LIPIcs.ISAAC.2023.57},
annote = {Keywords: matchings, factors, edge constraint satisfaction problems, terminal backup problem, delta matroids}
}
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