default search action
Search dblp for Publications
export results for "stream:streams/conf/isaac:"
more than 1000 matches, exporting first 1000 hits only!
@inproceedings{DBLP:conf/isaac/000123, author = {Seok{-}Hee Hong}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Faithful Graph Drawing (Invited Talk)}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {2:1--2:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.2}, doi = {10.4230/LIPICS.ISAAC.2023.2}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/000123.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001BJMS23, author = {Sebastian Berndt and Hauke Brinkop and Klaus Jansen and Matthias Mnich and Tobias Stamm}, editor = {Satoru Iwata and Naonori Kakimura}, 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, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {13:1--13:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.13}, doi = {10.4230/LIPICS.ISAAC.2023.13}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0001BJMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001FGP23, author = {Giulia Bernardini and Gabriele Fici and Pawel Gawrychowski and Solon P. Pissis}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Substring Complexity in Sublinear Space}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {12:1--12:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.12}, doi = {10.4230/LIPICS.ISAAC.2023.12}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001FGP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001MS23, author = {Yusuke Kobayashi and Ryoga Mahara and Tam{\'{a}}s Schwarcz}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Reconfiguration of the Union of Arborescences}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {48:1--48:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.48}, doi = {10.4230/LIPICS.ISAAC.2023.48}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001MS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001N23, author = {Yusuke Kobayashi and Takashi Noguchi}, editor = {Satoru Iwata and Naonori Kakimura}, 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, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {49:1--49:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.49}, doi = {10.4230/LIPICS.ISAAC.2023.49}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001N23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001Z23, author = {Shuai Shao and Stanislav Zivn{\'{y}}}, editor = {Satoru Iwata and Naonori Kakimura}, title = {A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {57:1--57:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.57}, doi = {10.4230/LIPICS.ISAAC.2023.57}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001Z23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AdamsonFHKMN23, author = {Duncan Adamson and Pamela Fleischmann and Annika Huch and Tore Ko{\ss} and Florin Manea and Dirk Nowotka}, editor = {Satoru Iwata and Naonori Kakimura}, title = {k-Universality of Regular Languages}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {4:1--4:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.4}, doi = {10.4230/LIPICS.ISAAC.2023.4}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AdamsonFHKMN23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AhnKK23, author = {Jungho Ahn and Jinha Kim and O{-}joung Kwon}, editor = {Satoru Iwata and Naonori Kakimura}, 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, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {5:1--5:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.5}, doi = {10.4230/LIPICS.ISAAC.2023.5}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AhnKK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AkitayaBMRW23, author = {Hugo A. Akitaya and Maike Buchin and Majid Mirzanezhad and Leonie Ryvkin and Carola Wenk}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Realizability of Free Spaces of Curves}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {3:1--3:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.3}, doi = {10.4230/LIPICS.ISAAC.2023.3}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AkitayaBMRW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AlkemaB23, author = {Henk Alkema and Mark de Berg}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Geometric {TSP} on Sets}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {6:1--6:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.6}, doi = {10.4230/LIPICS.ISAAC.2023.6}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AlkemaB23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Amano23, author = {Kazuyuki Amano}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Depth-Three Circuits for Inner Product and Majority Functions}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {7:1--7:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.7}, doi = {10.4230/LIPICS.ISAAC.2023.7}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Amano23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BampisKLP23, author = {Evripidis Bampis and Alexander V. Kononov and Giorgio Lucarelli and Fanny Pascual}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Non-Clairvoyant Makespan Minimization Scheduling with Predictions}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {9:1--9:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.9}, doi = {10.4230/LIPICS.ISAAC.2023.9}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BampisKLP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BathieKS23, author = {Gabriel Bathie and Tomasz Kociumaka and Tatiana Starikovskaya}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {10:1--10:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.10}, doi = {10.4230/LIPICS.ISAAC.2023.10}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BathieKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergBMT23, author = {Mark de Berg and Leyla Biabani and Morteza Monemizadeh and Leonidas Theocharous}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Clustering in Polygonal Domains}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {23:1--23:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.23}, doi = {10.4230/LIPICS.ISAAC.2023.23}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BergBMT23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergMS23, author = {Mark de Berg and Andr{\'{e}}s L{\'{o}}pez Mart{\'{\i}}nez and Frits C. R. Spieksma}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Finding Diverse Minimum s-t Cuts}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {24:1--24:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.24}, doi = {10.4230/LIPICS.ISAAC.2023.24}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BergMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergougnouxGGHP23, author = {Benjamin Bergougnoux and Jakub Gajarsk{\'{y}} and Grzegorz Guspiel and Petr Hlinen{\'{y}} and Filip Pokr{\'{y}}vka and Marek Sokolowski}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {11:1--11:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.11}, doi = {10.4230/LIPICS.ISAAC.2023.11}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BergougnouxGGHP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BlauthNPV23, author = {Jannis Blauth and Meike Neuwohner and Luise Puhlmann and Jens Vygen}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Improved Guarantees for the a Priori {TSP}}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {14:1--14:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.14}, doi = {10.4230/LIPICS.ISAAC.2023.14}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BlauthNPV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BorzechowskiS023, author = {Michaela Borzechowski and Patrick Schnider and Simon Weber}, editor = {Satoru Iwata and Naonori Kakimura}, title = {An {FPT} Algorithm for Splitting a Necklace Among Two Thieves}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {15:1--15:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.15}, doi = {10.4230/LIPICS.ISAAC.2023.15}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BorzechowskiS023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrandL23, author = {Cornelius Brand and Alexandra Lassota}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Fast Convolutions for Near-Convex Sequences}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {16:1--16:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.16}, doi = {10.4230/LIPICS.ISAAC.2023.16}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BrandL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChakrabortyD23, author = {Diptarka Chakraborty and Sanjana Dey}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Matrix Completion: Approximating the Minimum Diameter}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {17:1--17:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.17}, doi = {10.4230/LIPICS.ISAAC.2023.17}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChakrabortyD23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Chen0MPWZ23, author = {Jingbang Chen and Meng He and J. Ian Munro and Richard Peng and Kaiyu Wu and Daniel J. Zhang}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Distance Queries over Dynamic Interval Graphs}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {18:1--18:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.18}, doi = {10.4230/LIPICS.ISAAC.2023.18}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Chen0MPWZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChuL23, author = {Huairui Chu and Bingkai Lin}, editor = {Satoru Iwata and Naonori Kakimura}, 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, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {19:1--19:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.19}, doi = {10.4230/LIPICS.ISAAC.2023.19}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChuL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CohenKS23, author = {Tomer Cohen and Ariel Kulik and Hadas Shachnai}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Improved Approximation for Two-Dimensional Vector Multiple Knapsack}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {20:1--20:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.20}, doi = {10.4230/LIPICS.ISAAC.2023.20}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CohenKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ConteGPU23, author = {Alessio Conte and Roberto Grossi and Giulia Punzi and Takeaki Uno}, editor = {Satoru Iwata and Naonori Kakimura}, title = {A Compact {DAG} for Storing and Searching Maximal Common Subsequences}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {21:1--21:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.21}, doi = {10.4230/LIPICS.ISAAC.2023.21}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ConteGPU23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Cotumaccio23, author = {Nicola Cotumaccio}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Prefix Sorting DFAs: {A} Recursive Algorithm}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {22:1--22:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.22}, doi = {10.4230/LIPICS.ISAAC.2023.22}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Cotumaccio23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DharHK23, author = {Anubhav Dhar and Soumita Hait and Sudeshna Kolay}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {25:1--25:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.25}, doi = {10.4230/LIPICS.ISAAC.2023.25}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DharHK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Didimo0LOP23, author = {Walter Didimo and Michael Kaufmann and Giuseppe Liotta and Giacomo Ortali and Maurizio Patrignani}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Rectilinear-Upward Planarity Testing of Digraphs}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {26:1--26:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.26}, doi = {10.4230/LIPICS.ISAAC.2023.26}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Didimo0LOP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DisserM23, author = {Yann Disser and Nils Mosis}, editor = {Satoru Iwata and Naonori Kakimura}, title = {A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {27:1--27:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.27}, doi = {10.4230/LIPICS.ISAAC.2023.27}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DisserM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Elkind23, author = {Edith Elkind}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk)}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {1:1--1:3}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.1}, doi = {10.4230/LIPICS.ISAAC.2023.1}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Elkind23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EnglertM023, author = {Matthias Englert and Nicolaos Matsakis and Pavel Vesel{\'{y}}}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Approximation Guarantees for Shortest Superstrings: Simpler and Better}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {29:1--29:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.29}, doi = {10.4230/LIPICS.ISAAC.2023.29}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/EnglertM023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EppsteinF23, author = {David Eppstein and Daniel Frishberg}, editor = {Satoru Iwata and Naonori Kakimura}, 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, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {30:1--30:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.30}, doi = {10.4230/LIPICS.ISAAC.2023.30}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/EppsteinF23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FeghaliLPR23, author = {Carl Feghali and Felicia Lucke and Dani{\"{e}}l Paulusma and Bernard Ries}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Matching Cuts in Graphs of High Girth and H-Free Graphs}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {31:1--31:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.31}, doi = {10.4230/LIPICS.ISAAC.2023.31}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FeghaliLPR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FominGKS23, author = {Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Giannos Stamoulis}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Computing Paths of Large Rank in Planar Frameworks Deterministically}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {32:1--32:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.32}, doi = {10.4230/LIPICS.ISAAC.2023.32}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FominGKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GregorMN23, author = {Petr Gregor and Torsten M{\"{u}}tze and Namrata}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {33:1--33:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.33}, doi = {10.4230/LIPICS.ISAAC.2023.33}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GregorMN23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GudmundssonHRW23, author = {Joachim Gudmundsson and Zijin Huang and Andr{\'{e}} van Renssen and Sampson Wong}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Computing a Subtrajectory Cluster from c-Packed Trajectories}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {34:1--34:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.34}, doi = {10.4230/LIPICS.ISAAC.2023.34}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GudmundssonHRW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GudmundssonS23, author = {Joachim Gudmundsson and Yuan Sha}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Shortest Beer Path Queries in Digraphs with Bounded Treewidth}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {35:1--35:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.35}, doi = {10.4230/LIPICS.ISAAC.2023.35}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GudmundssonS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GutowskiJKR0Z23, author = {Grzegorz Gutowski and Konstanty Junosza{-}Szaniawski and Felix Klesen and Pawel Rzazewski and Alexander Wolff and Johannes Zink}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Coloring and Recognizing Mixed Interval Graphs}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {36:1--36:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.36}, doi = {10.4230/LIPICS.ISAAC.2023.36}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GutowskiJKR0Z23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HanakaOSS23, author = {Tesshu Hanaka and Hirotaka Ono and Kunihiko Sadakane and Kosuke Sugiyama}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Shortest Beer Path Queries Based on Graph Decomposition}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {37:1--37:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.37}, doi = {10.4230/LIPICS.ISAAC.2023.37}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HanakaOSS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HarutyunyanKP23, author = {Hovhannes A. Harutyunyan and Kamran Koupayi and Denis Pankratov}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Temporal Separators with Deadlines}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {38:1--38:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.38}, doi = {10.4230/LIPICS.ISAAC.2023.38}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HarutyunyanKP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HiraharaM23, author = {Shuichi Hirahara and Dana Moshkovitz}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Regularization of Low Error PCPs and an Application to {MCSP}}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {39:1--39:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.39}, doi = {10.4230/LIPICS.ISAAC.2023.39}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HiraharaM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JaffkeLS23, author = {Lars Jaffke and Paloma T. Lima and Roohani Sharma}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Structural Parameterizations of b-Coloring}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {40:1--40:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.40}, doi = {10.4230/LIPICS.ISAAC.2023.40}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/JaffkeLS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Jaiswal023, author = {Ragesh Jaiswal and Amit Kumar}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {41:1--41:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.41}, doi = {10.4230/LIPICS.ISAAC.2023.41}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Jaiswal023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JansenK023, author = {Bart M. P. Jansen and Jari J. H. de Kroon and Michal Wlodarczyk}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Single-Exponential {FPT} Algorithms for Enumerating Secluded {\(\mathscr{F}\)}-Free Subgraphs and Deleting to Scattered Graph Classes}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {42:1--42:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.42}, doi = {10.4230/LIPICS.ISAAC.2023.42}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/JansenK023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JourdanM023, author = {Ben Jourdan and Peter Macgregor and He Sun}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Is the Algorithmic Kadison-Singer Problem Hard?}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {43:1--43:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.43}, doi = {10.4230/LIPICS.ISAAC.2023.43}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/JourdanM023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KammerM23, author = {Frank Kammer and Johannes Meintrup}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Succinct Planar Encoding with Minor Operations}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {44:1--44:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.44}, doi = {10.4230/LIPICS.ISAAC.2023.44}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KammerM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Kao23, author = {Mong{-}Jen Kao}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {45:1--45:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.45}, doi = {10.4230/LIPICS.ISAAC.2023.45}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Kao23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KhazaliyaKLMS23, author = {Liana Khazaliya and Philipp Kindermann and Giuseppe Liotta and Fabrizio Montecchiani and Kirill Simonov}, editor = {Satoru Iwata and Naonori Kakimura}, title = {The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {46:1--46:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.46}, doi = {10.4230/LIPICS.ISAAC.2023.46}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KhazaliyaKLMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KimuraM23, author = {Kei Kimura and Kazuhisa Makino}, editor = {Satoru Iwata and Naonori Kakimura}, title = {A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {47:1--47:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.47}, doi = {10.4230/LIPICS.ISAAC.2023.47}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KimuraM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KuoCFHTK23, author = {Ting{-}Yu Kuo and Yu{-}Han Chen and Andrea Frosini and Sun{-}Yuan Hsieh and Shi{-}Chun Tsai and Mong{-}Jen Kao}, editor = {Satoru Iwata and Naonori Kakimura}, title = {On Min-Max Graph Balancing with Strict Negative Correlation Constraints}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {50:1--50:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.50}, doi = {10.4230/LIPICS.ISAAC.2023.50}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KuoCFHTK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Liu023, author = {Gang Liu and Haitao Wang}, editor = {Satoru Iwata and Naonori Kakimura}, title = {On the Line-Separable Unit-Disk Coverage and Related Problems}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {51:1--51:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.51}, doi = {10.4230/LIPICS.ISAAC.2023.51}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Liu023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MaaloulySW23, author = {Nicolas El Maalouly and Raphael Steiner and Lasse Wulf}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Exact Matching: Correct Parity and {FPT} Parameterized by Independence Number}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {28:1--28:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.28}, doi = {10.4230/LIPICS.ISAAC.2023.28}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MaaloulySW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MantheyR23, author = {Bodo Manthey and Jesse van Rhijn}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Improved Smoothed Analysis of 2-Opt for the Euclidean {TSP}}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {52:1--52:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.52}, doi = {10.4230/LIPICS.ISAAC.2023.52}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MantheyR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MartinezRSV23, author = {Ard{\'{e}}vol Mart{\'{\i}}nez, Virginia and Romeo Rizzi and Florian Sikora and St{\'{e}}phane Vialette}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Recognizing Unit Multiple Intervals Is Hard}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {8:1--8:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.8}, doi = {10.4230/LIPICS.ISAAC.2023.8}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MartinezRSV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MisraM0T23, author = {Neeldhara Misra and Harshil Mittal and Saket Saurabh and Dhara Thakkar}, editor = {Satoru Iwata and Naonori Kakimura}, title = {On the Complexity of the Eigenvalue Deletion Problem}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {53:1--53:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.53}, doi = {10.4230/LIPICS.ISAAC.2023.53}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MisraM0T23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MukherjeeS23, author = {Joydeep Mukherjee and Tamojit Saha}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Connected Vertex Cover on AT-Free Graphs}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {54:1--54:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.54}, doi = {10.4230/LIPICS.ISAAC.2023.54}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MukherjeeS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PodderYY23, author = {Supartha Podder and Penghui Yao and Zekun Ye}, editor = {Satoru Iwata and Naonori Kakimura}, title = {On the Fine-Grained Query Complexity of Symmetric Functions}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {55:1--55:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.55}, doi = {10.4230/LIPICS.ISAAC.2023.55}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/PodderYY23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/RoyV23, author = {Sampriti Roy and Yadu Vasudev}, editor = {Satoru Iwata and Naonori Kakimura}, title = {Testing Properties of Distributions in the Streaming Model}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {56:1--56:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.56}, doi = {10.4230/LIPICS.ISAAC.2023.56}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/RoyV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/X23, editor = {Satoru Iwata and Naonori Kakimura}, title = {Front Matter, Table of Contents, Preface, Conference Organization}, booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, pages = {0:1--0:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.0}, doi = {10.4230/LIPICS.ISAAC.2023.0}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/X23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2023, editor = {Satoru Iwata and Naonori Kakimura}, title = {34th International Symposium on Algorithms and Computation, {ISAAC} 2023, December 3-6, 2023, Kyoto, Japan}, series = {LIPIcs}, volume = {283}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-289-1}, isbn = {978-3-95977-289-1}, timestamp = {Wed, 21 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/000122, author = {Jeff Erickson}, editor = {Sang Won Bae and Heejin Park}, title = {The Tragedy of Being Almost but Not Quite Planar (Invited Talk)}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {2:1--2:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.2}, doi = {10.4230/LIPICS.ISAAC.2022.2}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/000122.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001G22, author = {Sandip Das and Harmender Gahlawat}, editor = {Sang Won Bae and Heejin Park}, title = {On the Cop Number of String Graphs}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {45:1--45:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.45}, doi = {10.4230/LIPICS.ISAAC.2022.45}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001G22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001M22, author = {Yusuke Kobayashi and Ryoga Mahara}, editor = {Sang Won Bae and Heejin Park}, title = {Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {55:1--55:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.55}, doi = {10.4230/LIPICS.ISAAC.2022.55}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001M22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001T22, author = {Yusuke Kobayashi and Tatsuya Terao}, editor = {Sang Won Bae and Heejin Park}, title = {One-Face Shortest Disjoint Paths with a Deviation Terminal}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {47:1--47:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.47}, doi = {10.4230/LIPICS.ISAAC.2022.47}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0001T22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AfshaniKL22, author = {Peyman Afshani and Rasmus Killmann and Kasper Green Larsen}, editor = {Sang Won Bae and Heejin Park}, title = {Hierarchical Categories in Colored Searching}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {25:1--25:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.25}, doi = {10.4230/LIPICS.ISAAC.2022.25}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AfshaniKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgarwalGH022, author = {Pankaj K. Agarwal and Tzvika Geft and Dan Halperin and Erin Taylor}, editor = {Sang Won Bae and Heejin Park}, title = {Multi-Robot Motion Planning for Unit Discs with Revolving Areas}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {35:1--35:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.35}, doi = {10.4230/LIPICS.ISAAC.2022.35}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AgarwalGH022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgarwalKS22, author = {Pankaj K. Agarwal and Matthew J. Katz and Micha Sharir}, editor = {Sang Won Bae and Heejin Park}, title = {On Reverse Shortest Paths in Geometric Proximity Graphs}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {42:1--42:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.42}, doi = {10.4230/LIPICS.ISAAC.2022.42}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AgarwalKS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgrawalHM22, author = {Akanksha Agrawal and Soumita Hait and Amer E. Mouawad}, editor = {Sang Won Bae and Heejin Park}, title = {On Finding Short Reconfiguration Sequences Between Independent Sets}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {39:1--39:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.39}, doi = {10.4230/LIPICS.ISAAC.2022.39}, timestamp = {Tue, 02 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AgrawalHM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AkutsuMNKUS22, author = {Tatsuya Akutsu and Tomoya Mori and Naotoshi Nakamura and Satoshi Kozawa and Yuhei Ueno and Thomas N. Sato}, editor = {Sang Won Bae and Heejin Park}, title = {On the Complexity of Tree Edit Distance with Variables}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {44:1--44:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.44}, doi = {10.4230/LIPICS.ISAAC.2022.44}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AkutsuMNKUS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Amano22, author = {Kazuyuki Amano}, editor = {Sang Won Bae and Heejin Park}, title = {Integer Complexity and Mixed Binary-Ternary Representation}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {29:1--29:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.29}, doi = {10.4230/LIPICS.ISAAC.2022.29}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Amano22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AzarPT22, author = {Yossi Azar and Eldad Peretz and Noam Touitou}, editor = {Sang Won Bae and Heejin Park}, title = {Distortion-Oblivious Algorithms for Scheduling on Multiple Machines}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {16:1--16:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.16}, doi = {10.4230/LIPICS.ISAAC.2022.16}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AzarPT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BaghirovaGRS22, author = {Narmina Baghirova and Carolina Luc{\'{\i}}a Gonzalez and Bernard Ries and David Schindl}, editor = {Sang Won Bae and Heejin Park}, title = {Locally Checkable Problems Parameterized by Clique-Width}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {31:1--31:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.31}, doi = {10.4230/LIPICS.ISAAC.2022.31}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BaghirovaGRS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BekosLH022, author = {Michael A. Bekos and Giordano Da Lozzo and Petr Hlinen{\'{y}} and Michael Kaufmann}, editor = {Sang Won Bae and Heejin Park}, title = {Graph Product Structure for h-Framed Graphs}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {23:1--23:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.23}, doi = {10.4230/LIPICS.ISAAC.2022.23}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BekosLH022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BelovaB22, author = {Tatiana Belova and Ivan Bliznets}, editor = {Sang Won Bae and Heejin Park}, title = {Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {24:1--24:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.24}, doi = {10.4230/LIPICS.ISAAC.2022.24}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BelovaB22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BhoreKLNTV22, author = {Sujoy Bhore and Fabian Klute and Maarten L{\"{o}}ffler and Martin N{\"{o}}llenburg and Soeren Terziadis and Ana{\"{\i}}s Villedieu}, editor = {Sang Won Bae and Heejin Park}, title = {Minimum Link Fencing}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {34:1--34:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.34}, doi = {10.4230/LIPICS.ISAAC.2022.34}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BhoreKLNTV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BoseCS22, author = {Prosenjit Bose and Jean{-}Lou De Carufel and Thomas C. Shermer}, editor = {Sang Won Bae and Heejin Park}, title = {Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {56:1--56:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.56}, doi = {10.4230/LIPICS.ISAAC.2022.56}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BoseCS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BuchinCHL0RS22, author = {Kevin Buchin and Bram Custers and Ivor {van der Hoog} and Maarten L{\"{o}}ffler and Aleksandr Popov and Marcel Roeloffzen and Frank Staals}, editor = {Sang Won Bae and Heejin Park}, title = {Segment Visibility Counting Queries in Polygons}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {58:1--58:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.58}, doi = {10.4230/LIPICS.ISAAC.2022.58}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BuchinCHL0RS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CaoFLMRU22, author = {Nairen Cao and Jeremy T. Fineman and Shi Li and Juli{\'{a}}n Mestre and Katina Russell and Seeun William Umboh}, editor = {Sang Won Bae and Heejin Park}, title = {Nested Active-Time Scheduling}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {36:1--36:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.36}, doi = {10.4230/LIPICS.ISAAC.2022.36}, timestamp = {Thu, 24 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CaoFLMRU22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChakrabortyD0FG22, author = {Dibyayan Chakraborty and Antoine Dailly and Sandip Das and Florent Foucaud and Harmender Gahlawat and Subir Kumar Ghosh}, editor = {Sang Won Bae and Heejin Park}, title = {Complexity and Algorithms for {ISOMETRIC} {PATH} {COVER} on Chordal Graphs and Beyond}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {12:1--12:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.12}, doi = {10.4230/LIPICS.ISAAC.2022.12}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChakrabortyD0FG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChatterjeeN22, author = {Kushagra Chatterjee and Prajakta Nimbhorkar}, editor = {Sang Won Bae and Heejin Park}, title = {Popular Edges with Critical Nodes}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {54:1--54:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.54}, doi = {10.4230/LIPICS.ISAAC.2022.54}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChatterjeeN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChungDHL22, author = {Lily Chung and Erik D. Demaine and Dylan H. Hendrickson and Jayson Lynch}, editor = {Sang Won Bae and Heejin Park}, title = {Lower Bounds on Retroactive Data Structures}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {32:1--32:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.32}, doi = {10.4230/LIPICS.ISAAC.2022.32}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChungDHL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CicaleseDM22, author = {Ferdinando Cicalese and Cl{\'{e}}ment Dallard and Martin Milanic}, editor = {Sang Won Bae and Heejin Park}, title = {On Constrained Intersection Representations of Graphs and Digraphs}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {38:1--38:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.38}, doi = {10.4230/LIPICS.ISAAC.2022.38}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CicaleseDM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DAngeloDG22, author = {Gianlorenzo D'Angelo and Esmaeil Delfaraz and Hugo Gilbert}, editor = {Sang Won Bae and Heejin Park}, title = {Budgeted Out-Tree Maximization with Submodular Prizes}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {9:1--9:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.9}, doi = {10.4230/LIPICS.ISAAC.2022.9}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DAngeloDG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Das0KMNW22, author = {Rathish Das and Meng He and Eitan Kondratovsky and J. Ian Munro and Anurag Murty Naredla and Kaiyu Wu}, editor = {Sang Won Bae and Heejin Park}, title = {Shortest Beer Path Queries in Interval Graphs}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {59:1--59:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.59}, doi = {10.4230/LIPICS.ISAAC.2022.59}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Das0KMNW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DasIN22, author = {Rathish Das and John Iacono and Yakov Nekrich}, editor = {Sang Won Bae and Heejin Park}, title = {External-Memory Dictionaries with Worst-Case Update Cost}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {21:1--21:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.21}, doi = {10.4230/LIPICS.ISAAC.2022.21}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DasIN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DayKMS22, author = {Joel D. Day and Maria Kosche and Florin Manea and Markus L. Schmid}, editor = {Sang Won Bae and Heejin Park}, title = {Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {64:1--64:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.64}, doi = {10.4230/LIPICS.ISAAC.2022.64}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DayKMS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DebskiLOPR22, author = {Michal Debski and Zbigniew Lonc and Karolina Okrasa and Marta Piecyk and Pawel Rzazewski}, editor = {Sang Won Bae and Heejin Park}, title = {Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {14:1--14:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.14}, doi = {10.4230/LIPICS.ISAAC.2022.14}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DebskiLOPR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DreierMMSV22, author = {Jan Dreier and Nikolas M{\"{a}}hlmann and Amer E. Mouawad and Sebastian Siebertz and Alexandre Vigny}, editor = {Sang Won Bae and Heejin Park}, title = {Combinatorial and Algorithmic Aspects of Monadic Stability}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {11:1--11:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.11}, doi = {10.4230/LIPICS.ISAAC.2022.11}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DreierMMSV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DumasF0T22, author = {Ma{\"{e}}l Dumas and Florent Foucaud and Anthony Perez and Ioan Todinca}, editor = {Sang Won Bae and Heejin Park}, title = {On Graphs Coverable by k Shortest Paths}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {40:1--40:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.40}, doi = {10.4230/LIPICS.ISAAC.2022.40}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DumasF0T22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DvorakM0KRZ22, author = {Pavel Dvor{\'{a}}k and Tom{\'{a}}s Masar{\'{\i}}k and Jana Novotn{\'{a}} and Monika Krawczyk and Pawel Rzazewski and Aneta Zuk}, editor = {Sang Won Bae and Heejin Park}, title = {List Locally Surjective Homomorphisms in Hereditary Graph Classes}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {30:1--30:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.30}, doi = {10.4230/LIPICS.ISAAC.2022.30}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DvorakM0KRZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DyrsethL22, author = {Jakob Dyrseth and Paloma T. Lima}, editor = {Sang Won Bae and Heejin Park}, title = {On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {43:1--43:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.43}, doi = {10.4230/LIPICS.ISAAC.2022.43}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DyrsethL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ErlebachLS22, author = {Thomas Erlebach and Kelin Luo and Frits C. R. Spieksma}, editor = {Sang Won Bae and Heejin Park}, title = {Package Delivery Using Drones with Restricted Movement Areas}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {49:1--49:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.49}, doi = {10.4230/LIPICS.ISAAC.2022.49}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ErlebachLS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FangUYZ22, author = {Junbin Fang and Dominique Unruh and Jun Yan and Dehua Zhou}, editor = {Sang Won Bae and Heejin Park}, title = {How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment?}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {26:1--26:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.26}, doi = {10.4230/LIPICS.ISAAC.2022.26}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FangUYZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FazekasKMST22, author = {Szil{\'{a}}rd Zsolt Fazekas and Hwee Kim and Ryuichi Matsuoka and Shinnosuke Seki and Hinano Takeuchi}, editor = {Sang Won Bae and Heejin Park}, title = {On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {37:1--37:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.37}, doi = {10.4230/LIPICS.ISAAC.2022.37}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FazekasKMST22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FeketeKRS022, author = {S{\'{a}}ndor P. Fekete and Peter Kramer and Christian Rieck and Christian Scheffer and Arne Schmidt}, editor = {Sang Won Bae and Heejin Park}, title = {Efficiently Reconfiguring a Connected Swarm of Labeled Robots}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {17:1--17:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.17}, doi = {10.4230/LIPICS.ISAAC.2022.17}, timestamp = {Fri, 15 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FeketeKRS022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FoxHR22, author = {Kyle Fox and Hongyao Huang and Benjamin Raichel}, editor = {Sang Won Bae and Heejin Park}, title = {Clustering with Faulty Centers}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {10:1--10:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.10}, doi = {10.4230/LIPICS.ISAAC.2022.10}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FoxHR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FoxS22, author = {Kyle Fox and Thomas Stanley}, editor = {Sang Won Bae and Heejin Park}, title = {Computation of Cycle Bases in Surface Embedded Graphs}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {13:1--13:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.13}, doi = {10.4230/LIPICS.ISAAC.2022.13}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FoxS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FriggstadM22, author = {Zachary Friggstad and Ramin Mousavi}, editor = {Sang Won Bae and Heejin Park}, title = {Bi-Criteria Approximation Algorithms for Bounded-Degree Subset {TSP}}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {8:1--8:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.8}, doi = {10.4230/LIPICS.ISAAC.2022.8}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FriggstadM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FujiiIKS22, author = {Soichiro Fujii and Yuni Iwamasa and Kei Kimura and Akira Suzuki}, editor = {Sang Won Bae and Heejin Park}, title = {Algorithms for Coloring Reconfiguration Under Recolorability Digraphs}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {4:1--4:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.4}, doi = {10.4230/LIPICS.ISAAC.2022.4}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FujiiIKS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GeorgiouGK22, author = {Konstantinos Georgiou and Nikos Giachoudis and Evangelos Kranakis}, editor = {Sang Won Bae and Heejin Park}, title = {Evacuation from a Disk for Robots with Asymmetric Communication}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {19:1--19:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.19}, doi = {10.4230/LIPICS.ISAAC.2022.19}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GeorgiouGK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GimaO22, author = {Tatsuya Gima and Yota Otachi}, editor = {Sang Won Bae and Heejin Park}, title = {Extended {MSO} Model Checking via Small Vertex Integrity}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {20:1--20:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.20}, doi = {10.4230/LIPICS.ISAAC.2022.20}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GimaO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GuoL0022, author = {Xiangyu Guo and Kelin Luo and Shi Li and Yuhao Zhang}, editor = {Sang Won Bae and Heejin Park}, title = {Minimizing the Maximum Flow Time in the Online Food Delivery Problem}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {33:1--33:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.33}, doi = {10.4230/LIPICS.ISAAC.2022.33}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GuoL0022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HasegawaG22, author = {Atsuya Hasegawa and Fran{\c{c}}ois Le Gall}, editor = {Sang Won Bae and Heejin Park}, title = {An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {6:1--6:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.6}, doi = {10.4230/LIPICS.ISAAC.2022.6}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HasegawaG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HellersteinLW22, author = {Lisa Hellerstein and Thomas Lidbetter and R. Teal Witter}, editor = {Sang Won Bae and Heejin Park}, title = {A Local Search Algorithm for the Min-Sum Submodular Cover Problem}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {3:1--3:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.3}, doi = {10.4230/LIPICS.ISAAC.2022.3}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HellersteinLW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Holland22, author = {William L. Holland}, editor = {Sang Won Bae and Heejin Park}, title = {Succinct List Indexing in Optimal Time}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {65:1--65:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.65}, doi = {10.4230/LIPICS.ISAAC.2022.65}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Holland22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/IgnatievMS22, author = {Artur Ignatiev and Ivan Mihajlin and Alexander Smal}, editor = {Sang Won Bae and Heejin Park}, title = {Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {66:1--66:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.66}, doi = {10.4230/LIPICS.ISAAC.2022.66}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/IgnatievMS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KammerM22, author = {Frank Kammer and Johannes Meintrup}, editor = {Sang Won Bae and Heejin Park}, title = {Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {62:1--62:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.62}, doi = {10.4230/LIPICS.ISAAC.2022.62}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KammerM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KimC22, author = {Sung{-}Hwan Kim and Hwan{-}Gue Cho}, editor = {Sang Won Bae and Heejin Park}, title = {Simple Order-Isomorphic Matching Index with Expected Compact Space}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {61:1--61:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.61}, doi = {10.4230/LIPICS.ISAAC.2022.61}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KimC22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KimKH22, author = {Sungmin Kim and Sang{-}Ki Ko and Yo{-}Sub Han}, editor = {Sang Won Bae and Heejin Park}, title = {Simon's Congruence Pattern Matching}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {60:1--60:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.60}, doi = {10.4230/LIPICS.ISAAC.2022.60}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KimKH22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LapeyW22, author = {Paul W. Lapey and Aaron Williams}, editor = {Sang Won Bae and Heejin Park}, title = {Pop {\&} Push: Ordered Tree Iteration in {\unicode{119978}}(1)-Time}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {53:1--53:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.53}, doi = {10.4230/LIPICS.ISAAC.2022.53}, timestamp = {Tue, 02 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LapeyW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Lee22, author = {Eunou Lee}, editor = {Sang Won Bae and Heejin Park}, title = {Optimizing Quantum Circuit Parameters via {SDP}}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {48:1--48:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.48}, doi = {10.4230/LIPICS.ISAAC.2022.48}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Lee22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiangIL22, author = {Ya{-}Chun Liang and Kazuo Iwama and Chung{-}Shou Liao}, editor = {Sang Won Bae and Heejin Park}, title = {Improving the Bounds of the Online Dynamic Power Management Problem}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {28:1--28:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.28}, doi = {10.4230/LIPICS.ISAAC.2022.28}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LiangIL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Lu022, author = {Shangqi Lu and Yufei Tao}, editor = {Sang Won Bae and Heejin Park}, title = {Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {57:1--57:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.57}, doi = {10.4230/LIPICS.ISAAC.2022.57}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Lu022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LuckePR22, author = {Felicia Lucke and Dani{\"{e}}l Paulusma and Bernard Ries}, editor = {Sang Won Bae and Heejin Park}, title = {Finding Matching Cuts in H-Free Graphs}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {22:1--22:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.22}, doi = {10.4230/LIPICS.ISAAC.2022.22}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LuckePR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MestreP22, author = {Juli{\'{a}}n Mestre and Sergey Pupyrev}, editor = {Sang Won Bae and Heejin Park}, title = {Approximating the Minimum Logarithmic Arrangement Problem}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {7:1--7:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.7}, doi = {10.4230/LIPICS.ISAAC.2022.7}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MestreP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MienoFI22, author = {Takuya Mieno and Mitsuru Funakoshi and Shunsuke Inenaga}, editor = {Sang Won Bae and Heejin Park}, title = {Computing Palindromes on a Trie in Linear Time}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {15:1--15:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.15}, doi = {10.4230/LIPICS.ISAAC.2022.15}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MienoFI22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MozesWW22, author = {Shay Mozes and Nathan Wallheimer and Oren Weimann}, editor = {Sang Won Bae and Heejin Park}, title = {Improved Compression of the Okamura-Seymour Metric}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {27:1--27:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.27}, doi = {10.4230/LIPICS.ISAAC.2022.27}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MozesWW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MunchRS22, author = {Miriam M{\"{u}}nch and Ignaz Rutter and Peter Stumpf}, editor = {Sang Won Bae and Heejin Park}, title = {Partial and Simultaneous Transitive Orientations via Modular Decompositions}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {51:1--51:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.51}, doi = {10.4230/LIPICS.ISAAC.2022.51}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MunchRS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Ohsaka22, author = {Naoto Ohsaka}, editor = {Sang Won Bae and Heejin Park}, title = {On the Parameterized Intractability of Determinant Maximization}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {46:1--46:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.46}, doi = {10.4230/LIPICS.ISAAC.2022.46}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Ohsaka22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PodolskiiP22, author = {Vladimir V. Podolskii and Nikolay V. Proskurin}, editor = {Sang Won Bae and Heejin Park}, title = {Polynomial Threshold Functions for Decision Lists}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {52:1--52:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.52}, doi = {10.4230/LIPICS.ISAAC.2022.52}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/PodolskiiP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Qi22, author = {Benjamin Qi}, editor = {Sang Won Bae and Heejin Park}, title = {On Maximizing Sums of Non-Monotone Submodular and Linear Functions}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {41:1--41:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.41}, doi = {10.4230/LIPICS.ISAAC.2022.41}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Qi22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/RieckS22, author = {Christian Rieck and Christian Scheffer}, editor = {Sang Won Bae and Heejin Park}, title = {The Dispersive Art Gallery Problem}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {67:1--67:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.67}, doi = {10.4230/LIPICS.ISAAC.2022.67}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/RieckS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Sadakane22, author = {Kunihiko Sadakane}, editor = {Sang Won Bae and Heejin Park}, title = {Succinct Representations of Graphs (Invited Talk)}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {1:1--1:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.1}, doi = {10.4230/LIPICS.ISAAC.2022.1}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Sadakane22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Skorski22, author = {Maciej Skorski}, editor = {Sang Won Bae and Heejin Park}, title = {Entropy Matters: Understanding Performance of Sparse Random Embeddings}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {18:1--18:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.18}, doi = {10.4230/LIPICS.ISAAC.2022.18}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Skorski22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Storandt22, author = {Sabine Storandt}, editor = {Sang Won Bae and Heejin Park}, title = {Algorithms for Landmark Hub Labeling}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {5:1--5:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.5}, doi = {10.4230/LIPICS.ISAAC.2022.5}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Storandt22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Tu22, author = {Ta{-}Wei Tu}, editor = {Sang Won Bae and Heejin Park}, title = {Subquadratic Weighted Matroid Intersection Under Rank Oracles}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {63:1--63:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.63}, doi = {10.4230/LIPICS.ISAAC.2022.63}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Tu22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/X22, editor = {Sang Won Bae and Heejin Park}, title = {Front Matter, Table of Contents, Preface, Conference Organization}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {0:1--0:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.0}, doi = {10.4230/LIPICS.ISAAC.2022.0}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/X22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ZhouLG22, author = {Jianqi Zhou and Peihua Li and Jiong Guo}, editor = {Sang Won Bae and Heejin Park}, title = {Parameterized Approximation Algorithms for {TSP}}, booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, pages = {50:1--50:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.50}, doi = {10.4230/LIPICS.ISAAC.2022.50}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ZhouLG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2022, editor = {Sang Won Bae and Heejin Park}, title = {33rd International Symposium on Algorithms and Computation, {ISAAC} 2022, December 19-21, 2022, Seoul, Korea}, series = {LIPIcs}, volume = {248}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-258-7}, isbn = {978-3-95977-258-7}, timestamp = {Wed, 21 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0002SZ21, author = {Siddharth Gupta and Guy Sa'ar and Meirav Zehavi}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Grid Recognition: Classical and Parameterized Computational Perspectives}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {37:1--37:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.37}, doi = {10.4230/LIPICS.ISAAC.2021.37}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0002SZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AlbersGJ21, author = {Susanne Albers and Waldo G{\'{a}}lvez and Maximilian Janke}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Machine Covering in the Random-Order Model}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {52:1--52:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.52}, doi = {10.4230/LIPICS.ISAAC.2021.52}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AlbersGJ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AllenderGHR21, author = {Eric Allender and John Gouwar and Shuichi Hirahara and Caleb Robelle}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {54:1--54:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.54}, doi = {10.4230/LIPICS.ISAAC.2021.54}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AllenderGHR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/An021, author = {Shinwoo An and Eunjin Oh}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Feedback Vertex Set on Geometric Intersection Graphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {47:1--47:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.47}, doi = {10.4230/LIPICS.ISAAC.2021.47}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/An021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AndersBS21, author = {Markus Anders and Jendrik Brachter and Pascal Schweitzer}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {A Characterization of Individualization-Refinement Trees}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {24:1--24:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.24}, doi = {10.4230/LIPICS.ISAAC.2021.24}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AndersBS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AntoniadisK021, author = {Antonios Antoniadis and Gunjan Kumar and Nikhil Kumar}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Skeletons and Minimum Energy Scheduling}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {51:1--51:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.51}, doi = {10.4230/LIPICS.ISAAC.2021.51}, timestamp = {Wed, 10 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AntoniadisK021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AraujoRRM21, author = {Eloi Araujo and Luiz C. S. Rozante and Diego P. Rubert and F{\'{a}}bio Viduani Martinez}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Algorithms for Normalized Multiple Sequence Alignments}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {40:1--40:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.40}, doi = {10.4230/LIPICS.ISAAC.2021.40}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AraujoRRM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AronovBCEIS21, author = {Boris Aronov and Mark de Berg and Jean Cardinal and Esther Ezra and John Iacono and Micha Sharir}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {3:1--3:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.3}, doi = {10.4230/LIPICS.ISAAC.2021.3}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AronovBCEIS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Asano21, author = {Takao Asano}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {68:1--68:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.68}, doi = {10.4230/LIPICS.ISAAC.2021.68}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Asano21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AurenhammerPS21, author = {Franz Aurenhammer and Evanthia Papadopoulou and Martin Suderland}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Piecewise-Linear Farthest-Site Voronoi Diagrams}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {30:1--30:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.30}, doi = {10.4230/LIPICS.ISAAC.2021.30}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AurenhammerPS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bacic0S21, author = {Joyce Bacic and Saeed Mehrabi and Michiel Smid}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Shortest Beer Path Queries in Outerplanar Graphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {62:1--62:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.62}, doi = {10.4230/LIPICS.ISAAC.2021.62}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Bacic0S21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BandyapadhyayMS21, author = {Sayan Bandyapadhyay and Anil Maheshwari and Michiel Smid}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {44:1--44:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.44}, doi = {10.4230/LIPICS.ISAAC.2021.44}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BandyapadhyayMS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Banik0R21, author = {Aritra Banik and Rajiv Raman and Saurabh Ray}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {On Geometric Priority Set Cover Problems}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {12:1--12:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.12}, doi = {10.4230/LIPICS.ISAAC.2021.12}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Banik0R21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bar-NoyPRY21, author = {Amotz Bar{-}Noy and David Peleg and Dror Rawitz and Elad Yehezkel}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Selected Neighbor Degree Forest Realization}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {27:1--27:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.27}, doi = {10.4230/LIPICS.ISAAC.2021.27}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Bar-NoyPRY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BarrB21, author = {Sam Barr and Therese Biedl}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {16:1--16:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.16}, doi = {10.4230/LIPICS.ISAAC.2021.16}, timestamp = {Thu, 11 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BarrB21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BarthFP21, author = {Florian Barth and Stefan Funke and Claudius Proissl}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {15:1--15:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.15}, doi = {10.4230/LIPICS.ISAAC.2021.15}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BarthFP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergKMT21, author = {Mark de Berg and S{\'{a}}ndor Kisfaludi{-}Bak and Morteza Monemizadeh and Leonidas Theocharous}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Clique-Based Separators for Geometric Intersection Graphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {22:1--22:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.22}, doi = {10.4230/LIPICS.ISAAC.2021.22}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BergKMT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergS21, author = {Sarita de Berg and Frank Staals}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Dynamic Data Structures for k-Nearest Neighbor Queries}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {14:1--14:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.14}, doi = {10.4230/LIPICS.ISAAC.2021.14}, timestamp = {Mon, 01 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BergS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bhore021, author = {Sujoy Bhore and Rahul Jain}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Space-Efficient Algorithms for Reachability in Directed Geometric Graphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {63:1--63:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.63}, doi = {10.4230/LIPICS.ISAAC.2021.63}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Bhore021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bhore0NRW21, author = {Sujoy Bhore and Guangping Li and Martin N{\"{o}}llenburg and Ignaz Rutter and Hsiang{-}Yun Wu}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Untangling Circular Drawings: Algorithms and Complexity}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {19:1--19:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.19}, doi = {10.4230/LIPICS.ISAAC.2021.19}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Bhore0NRW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BiabaniBM21, author = {Leyla Biabani and Mark de Berg and Morteza Monemizadeh}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Maximum-Weight Matching in Sliding Windows and Beyond}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {73:1--73:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.73}, doi = {10.4230/LIPICS.ISAAC.2021.73}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BiabaniBM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Biniaz21, author = {Ahmad Biniaz}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Approximating Longest Spanning Tree with Neighborhoods}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {7:1--7:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.7}, doi = {10.4230/LIPICS.ISAAC.2021.7}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Biniaz21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BlackM21, author = {Mitchell Black and William Maxwell}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {31:1--31:27}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.31}, doi = {10.4230/LIPICS.ISAAC.2021.31}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BlackM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Blasius0KM21, author = {Thomas Bl{\"{a}}sius and Tobias Friedrich and Martin S. Krejca and Louise Molitor}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {The Impact of Geometry on Monochrome Regions in the Flip Schelling Process}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {29:1--29:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.29}, doi = {10.4230/LIPICS.ISAAC.2021.29}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Blasius0KM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bose21, author = {Prosenjit Bose}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Spanning Properties of Variants of the Delaunay Graph (Invited Talk)}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {2:1--2:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.2}, doi = {10.4230/LIPICS.ISAAC.2021.2}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Bose21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrauseGMPS21, author = {Christoph Brause and Petr A. Golovach and Barnaby Martin and Dani{\"{e}}l Paulusma and Siani Smith}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Partitioning H-Free Graphs of Bounded Diameter}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {21:1--21:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.21}, doi = {10.4230/LIPICS.ISAAC.2021.21}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BrauseGMPS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CanonneW21, author = {Cl{\'{e}}ment L. Canonne and Karl Wimmer}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Identity Testing Under Label Mismatch}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {55:1--55:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.55}, doi = {10.4230/LIPICS.ISAAC.2021.55}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CanonneW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Charalampopoulos21, author = {Panagiotis Charalampopoulos and Huiping Chen and Peter Christen and Grigorios Loukides and Nadia Pisanti and Solon P. Pissis and Jakub Radoszewski}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Pattern Masking for Dictionary Matching}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {65:1--65:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.65}, doi = {10.4230/LIPICS.ISAAC.2021.65}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Charalampopoulos21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenHK0X21, author = {Jianer Chen and Qin Huang and Iyad Kanj and Qian Li and Ge Xia}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {48:1--48:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.48}, doi = {10.4230/LIPICS.ISAAC.2021.48}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChenHK0X21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChengW21, author = {Siu{-}Wing Cheng and Man Ting Wong}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {8:1--8:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.8}, doi = {10.4230/LIPICS.ISAAC.2021.8}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChengW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CheriyanCDZ21, author = {Joseph Cheriyan and Robert Cummings and Jack Dippel and Jasper Zhu}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {An Improved Approximation Algorithm for the Matching Augmentation Problem}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {38:1--38:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.38}, doi = {10.4230/LIPICS.ISAAC.2021.38}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CheriyanCDZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Cho021, author = {Kyungjin Cho and Eunjin Oh}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {46:1--46:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.46}, doi = {10.4230/LIPICS.ISAAC.2021.46}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Cho021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CzygrinowHW21, author = {Andrzej Czygrinow and Michal Hanckowiak and Marcin Witkowski}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {59:1--59:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.59}, doi = {10.4230/LIPICS.ISAAC.2021.59}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CzygrinowHW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CzyzowiczKKKNOP21, author = {Jurek Czyzowicz and Ryan Killick and Evangelos Kranakis and Danny Krizanc and Lata Narayanan and Jaroslav Opatrny and Denis Pankratov and Sunil M. Shende}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Group Evacuation on a Line by Agents with Different Communication Abilities}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {57:1--57:24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.57}, doi = {10.4230/LIPICS.ISAAC.2021.57}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CzyzowiczKKKNOP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DasLLM21, author = {Rathish Das and Andrea Lincoln and Jayson Lynch and J. Ian Munro}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Dynamic Boolean Formula Evaluation}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {61:1--61:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.61}, doi = {10.4230/LIPICS.ISAAC.2021.61}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DasLLM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EnochFMM21, author = {Julian Enoch and Kyle Fox and Dor Mesica and Shay Mozes}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {72:1--72:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.72}, doi = {10.4230/LIPICS.ISAAC.2021.72}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/EnochFMM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EquiNACTM21, author = {Massimo Equi and Tuukka Norri and Jarno Alanko and Bastien Cazaux and Alexandru I. Tomescu and Veli M{\"{a}}kinen}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Algorithms and Complexity on Indexing Elastic Founder Graphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {20:1--20:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.20}, doi = {10.4230/LIPICS.ISAAC.2021.20}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/EquiNACTM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EskandariKK21, author = {Marzieh Eskandari and Bhavika B. Khare and Nirman Kumar}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Separated Red Blue Center Clustering}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {41:1--41:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.41}, doi = {10.4230/LIPICS.ISAAC.2021.41}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/EskandariKK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EvaldFW21, author = {Jacob Evald and Viktor Fredslund{-}Hansen and Christian Wulff{-}Nilsen}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {23:1--23:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.23}, doi = {10.4230/LIPICS.ISAAC.2021.23}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/EvaldFW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FeketeKKRS21, author = {S{\'{a}}ndor P. Fekete and Phillip Keldenich and Ramin Kosfeld and Christian Rieck and Christian Scheffer}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Connected Coordinated Motion Planning with Bounded Stretch}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {9:1--9:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.9}, doi = {10.4230/LIPICS.ISAAC.2021.9}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FeketeKKRS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FerraginaMV21, author = {Paolo Ferragina and Giovanni Manzini and Giorgio Vinciguerra}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Repetition- and Linearity-Aware Rank/Select Dictionaries}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {64:1--64:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.64}, doi = {10.4230/LIPICS.ISAAC.2021.64}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FerraginaMV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FrancisHJ21, author = {Mathew C. Francis and Pavol Hell and Dalu Jacob}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {On the Kernel and Related Problems in Interval Digraphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {17:1--17:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.17}, doi = {10.4230/LIPICS.ISAAC.2021.17}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FrancisHJ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Fredslund-Hansen21, author = {Viktor Fredslund{-}Hansen and Shay Mozes and Christian Wulff{-}Nilsen}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {25:1--25:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.25}, doi = {10.4230/LIPICS.ISAAC.2021.25}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Fredslund-Hansen21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GallM21, author = {Fran{\c{c}}ois Le Gall and Masayuki Miyamoto}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Lower Bounds for Induced Cycle Detection in Distributed Computing}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {58:1--58:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.58}, doi = {10.4230/LIPICS.ISAAC.2021.58}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GallM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Gibson-LopezY21, author = {Matt Gibson{-}Lopez and Zhongxiu Yang}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {The VC-Dimension of Limited Visibility Terrains}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {5:1--5:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.5}, doi = {10.4230/LIPICS.ISAAC.2021.5}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Gibson-LopezY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GourvesHLM21, author = {Laurent Gourv{\`{e}}s and Ararat Harutyunyan and Michael Lampis and Nikolaos Melissinos}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Filling Crosswords Is Very Hard}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {36:1--36:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.36}, doi = {10.4230/LIPICS.ISAAC.2021.36}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GourvesHLM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GuL21, author = {Qian{-}Ping Gu and Jiajian Leo Liang}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Multimodal Transportation with Ridesharing of Personal Vehicles}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {39:1--39:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.39}, doi = {10.4230/LIPICS.ISAAC.2021.39}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GuL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Guala0Z21, author = {Luciano Gual{\`{a}} and Stefano Leucci and Isabella Ziccardi}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {66:1--66:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.66}, doi = {10.4230/LIPICS.ISAAC.2021.66}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Guala0Z21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GudmundssonSY21, author = {Joachim Gudmundsson and Yuan Sha and Fan Yao}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Augmenting Graphs to Minimize the Radius}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {45:1--45:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.45}, doi = {10.4230/LIPICS.ISAAC.2021.45}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GudmundssonSY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HasegawaG21, author = {Atsuya Hasegawa and Fran{\c{c}}ois Le Gall}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Quantum Advantage with Shallow Circuits Under Arbitrary Corruption}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {74:1--74:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.74}, doi = {10.4230/LIPICS.ISAAC.2021.74}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HasegawaG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Hebert-JohnsonS21, author = {{\'{U}}rsula H{\'{e}}bert{-}Johnson and Chinmay Sonar and Subhash Suri and Vaishali Surianarayanan}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Anonymity-Preserving Space Partitions}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {32:1--32:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.32}, doi = {10.4230/LIPICS.ISAAC.2021.32}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Hebert-JohnsonS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HuangKR21, author = {Hongyao Huang and Georgiy Klimenko and Benjamin Raichel}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Clustering with Neighborhoods}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {6:1--6:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.6}, doi = {10.4230/LIPICS.ISAAC.2021.6}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HuangKR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KaufmanM21, author = {Tali Kaufman and David Mass}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {56:1--56:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.56}, doi = {10.4230/LIPICS.ISAAC.2021.56}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KaufmanM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KimLO21, author = {Donggyu Kim and Duksang Lee and Sang{-}il Oum}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {{\(\Gamma\)}-Graphic Delta-Matroids and Their Applications}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {70:1--70:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.70}, doi = {10.4230/LIPICS.ISAAC.2021.70}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KimLO21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KoanaKS21, author = {Tomohiro Koana and Christian Komusiewicz and Frank Sommer}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Essentially Tight Kernels For (Weakly) Closed Graphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {35:1--35:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.35}, doi = {10.4230/LIPICS.ISAAC.2021.35}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KoanaKS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Kumabe21, author = {Soh Kumabe}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Interval Query Problem on Cube-Free Median Graphs}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {18:1--18:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.18}, doi = {10.4230/LIPICS.ISAAC.2021.18}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Kumabe21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LampisM21, author = {Michael Lampis and Valia Mitsou}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Fine-Grained Meta-Theorems for Vertex Integrity}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {34:1--34:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.34}, doi = {10.4230/LIPICS.ISAAC.2021.34}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LampisM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiS21, author = {Shibo Li and Dominik Scheder}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Impatient {PPSZ} - {A} Faster Algorithm for {CSP}}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {33:1--33:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.33}, doi = {10.4230/LIPICS.ISAAC.2021.33}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LiS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiangLCI21, author = {Ya{-}Chun Liang and Kuan{-}Yun Lai and Ho{-}Lin Chen and Kazuo Iwama}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Tight Competitive Analyses of Online Car-Sharing Problems}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {50:1--50:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.50}, doi = {10.4230/LIPICS.ISAAC.2021.50}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LiangLCI21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MalafiejskaMOP21, author = {Anna Malafiejska and Michal Malafiejski and Krzysztof M. Ocetkiewicz and Krzysztof Pastuszak}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {26:1--26:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.26}, doi = {10.4230/LIPICS.ISAAC.2021.26}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MalafiejskaMOP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MathenyP21, author = {Michael Matheny and Jeff M. Phillips}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Approximate Maximum Halfspace Discrepancy}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {4:1--4:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.4}, doi = {10.4230/LIPICS.ISAAC.2021.4}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MathenyP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Mathieu021, author = {Claire Mathieu and Hang Zhou}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Probabilistic Analysis of Euclidean Capacitated Vehicle Routing}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {43:1--43:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.43}, doi = {10.4230/LIPICS.ISAAC.2021.43}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Mathieu021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MestrePU21, author = {Juli{\'{a}}n Mestre and Sergey Pupyrev and Seeun William Umboh}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {On the Extended {TSP} Problem}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {42:1--42:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.42}, doi = {10.4230/LIPICS.ISAAC.2021.42}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MestrePU21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NikoletseasRS21, author = {Sotiris E. Nikoletseas and Christoforos L. Raptopoulos and Paul G. Spirakis}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {{MAX} {CUT} in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {28:1--28:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.28}, doi = {10.4230/LIPICS.ISAAC.2021.28}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/NikoletseasRS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NilssonOPSZ21, author = {Bengt J. Nilsson and David Orden and Leonidas Palios and Carlos Seara and Pawel Zylinski}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Illuminating the x-Axis by {\(\alpha\)}-Floodlights}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {11:1--11:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.11}, doi = {10.4230/LIPICS.ISAAC.2021.11}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/NilssonOPSZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PatelS21, author = {Dhrumil Patel and Rahul Shah}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {60:1--60:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.60}, doi = {10.4230/LIPICS.ISAAC.2021.60}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/PatelS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Schnider21, author = {Patrick Schnider}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Enclosing Depth and Other Depth Measures}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {10:1--10:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.10}, doi = {10.4230/LIPICS.ISAAC.2021.10}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Schnider21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Schnider21a, author = {Patrick Schnider}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {The Complexity of Sharing a Pizza}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {13:1--13:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.13}, doi = {10.4230/LIPICS.ISAAC.2021.13}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Schnider21a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ShinA21, author = {Yongho Shin and Hyung{-}Chan An}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Making Three out of Two: Three-Way Online Correlated Selection}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {49:1--49:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.49}, doi = {10.4230/LIPICS.ISAAC.2021.49}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ShinA21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Starikovskaya21, author = {Tatiana Starikovskaya}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Streaming Pattern Matching (Invited Talk)}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {1:1--1:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.1}, doi = {10.4230/LIPICS.ISAAC.2021.1}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Starikovskaya21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Tan21, author = {Shuhao Tan}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Computing Shapley Values for Mean Width in 3-D}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {67:1--67:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.67}, doi = {10.4230/LIPICS.ISAAC.2021.67}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Tan21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Tang021, author = {Shaojie Tang and Jing Yuan}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Adaptive Regularized Submodular Maximization}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {69:1--69:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.69}, doi = {10.4230/LIPICS.ISAAC.2021.69}, timestamp = {Tue, 02 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Tang021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Touitou21, author = {Noam Touitou}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {53:1--53:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.53}, doi = {10.4230/LIPICS.ISAAC.2021.53}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Touitou21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/X21, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Front Matter, Table of Contents, Preface, Conference Organization}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {0:1--0:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.0}, doi = {10.4230/LIPICS.ISAAC.2021.0}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/X21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Yokoi21, author = {Yu Yokoi}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {71:1--71:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.71}, doi = {10.4230/LIPICS.ISAAC.2021.71}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Yokoi21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2021, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-214-3}, isbn = {978-3-95977-214-3}, timestamp = {Wed, 21 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/000120, author = {Ke Yi}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Worst-Case Optimal Join Algorithms (Invited Talk)}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {2:1--2:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.2}, doi = {10.4230/LIPICS.ISAAC.2020.2}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/000120.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/000120a, author = {Nikhil Kumar}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Multicommodity Flows in Planar Graphs with Demands on Faces}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {41:1--41:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.41}, doi = {10.4230/LIPICS.ISAAC.2020.41}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/000120a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/000120b, author = {Eunjin Oh}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Shortest-Path Queries in Geometric Networks}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {52:1--52:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.52}, doi = {10.4230/LIPICS.ISAAC.2020.52}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/000120b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001G20, author = {Bartlomiej Dudek and Pawel Gawrychowski}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {23:1--23:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.23}, doi = {10.4230/LIPICS.ISAAC.2020.23}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0001G20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001MNWW20, author = {Meng He and J. Ian Munro and Yakov Nekrich and Sebastian Wild and Kaiyu Wu}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {25:1--25:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.25}, doi = {10.4230/LIPICS.ISAAC.2020.25}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0001MNWW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0004R20, author = {Trung Thanh Nguyen and J{\"{o}}rg Rothe}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {14:1--14:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.14}, doi = {10.4230/LIPICS.ISAAC.2020.14}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0004R20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0011D20, author = {Ke Chen and Adrian Dumitrescu}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Multiparty Selection}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {42:1--42:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.42}, doi = {10.4230/LIPICS.ISAAC.2020.42}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0011D20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgrawalG20, author = {Anadi Agrawal and Pawel Gawrychowski}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {4:1--4:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.4}, doi = {10.4230/LIPICS.ISAAC.2020.4}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AgrawalG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Ahn0L20, author = {Jungho Ahn and Eun Jung Kim and Euiwoong Lee}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {62:1--62:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.62}, doi = {10.4230/LIPICS.ISAAC.2020.62}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Ahn0L20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AlcockABBCDEHHH20, author = {Leo Alcock and Sualeh Asif and Jeffrey Bosboom and Josh Brunner and Charlotte Chen and Erik D. Demaine and Rogers Epstein and Adam Hesterberg and Lior Hirschfeld and William Hu and Jayson Lynch and Sarah Scheffler and Lillian Zhang}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Arithmetic Expression Construction}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {12:1--12:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.12}, doi = {10.4230/LIPICS.ISAAC.2020.12}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AlcockABBCDEHHH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AmirB20, author = {Amihood Amir and Itai Boneh}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Update Query Time Trade-Off for Dynamic Suffix Arrays}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {63:1--63:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.63}, doi = {10.4230/LIPICS.ISAAC.2020.63}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AmirB20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AronovC20, author = {Boris Aronov and Jean Cardinal}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Geometric Pattern Matching Reduces to k-SUM}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {32:1--32:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.32}, doi = {10.4230/LIPICS.ISAAC.2020.32}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AronovC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AsanoU20, author = {Takao Asano and Hiroyuki Umeda}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {15:1--15:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.15}, doi = {10.4230/LIPICS.ISAAC.2020.15}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AsanoU20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BartierBDLM20, author = {Valentin Bartier and Nicolas Bousquet and Cl{\'{e}}ment Dallard and Kyle Lomer and Amer E. Mouawad}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {On Girth and the Parameterized Complexity of Token Sliding and Token Jumping}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {44:1--44:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.44}, doi = {10.4230/LIPICS.ISAAC.2020.44}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BartierBDLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BellittoLOPS20, author = {Thomas Bellitto and Shaohua Li and Karolina Okrasa and Marcin Pilipczuk and Manuel Sorge}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {59:1--59:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.59}, doi = {10.4230/LIPICS.ISAAC.2020.59}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BellittoLOPS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BentertHK20, author = {Matthias Bentert and Klaus Heeger and Dusan Knop}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {36:1--36:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.36}, doi = {10.4230/LIPICS.ISAAC.2020.36}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BentertHK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BercziK020, author = {Krist{\'{o}}f B{\'{e}}rczi and Naonori Kakimura and Yusuke Kobayashi}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Market Pricing for Matroid Rank Valuations}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {39:1--39:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.39}, doi = {10.4230/LIPICS.ISAAC.2020.39}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BercziK020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Berg0U20, author = {Mark de Berg and Aleksandar Markovic and Seeun William Umboh}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {The Online Broadcast Range-Assignment Problem}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {60:1--60:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.60}, doi = {10.4230/LIPICS.ISAAC.2020.60}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Berg0U20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BhaskarK20, author = {Umang Bhaskar and Gunjan Kumar}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Partial Function Extension with Applications to Learning and Property Testing}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {46:1--46:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.46}, doi = {10.4230/LIPICS.ISAAC.2020.46}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BhaskarK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BilleG20, author = {Philip Bille and Inge Li G{\o}rtz}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Random Access in Persistent Strings}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {48:1--48:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.48}, doi = {10.4230/LIPICS.ISAAC.2020.48}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BilleG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BousquetJO20, author = {Nicolas Bousquet and Alice Joffard and Paul Ouvrard}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Linear Transformations Between Dominating Sets in the TAR-Model}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {37:1--37:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.37}, doi = {10.4230/LIPICS.ISAAC.2020.37}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BousquetJO20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BradshawMS20, author = {Peter Bradshaw and Tom{\'{a}}s Masar{\'{\i}}k and Ladislav Stacho}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Flexible List Colorings in Graphs with Special Degeneracy Conditions}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {31:1--31:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.31}, doi = {10.4230/LIPICS.ISAAC.2020.31}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BradshawMS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrucknerR20, author = {Guido Br{\"{u}}ckner and Ignaz Rutter}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {An SPQR-Tree-Like Embedding Representation for Level Planarity}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {8:1--8:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.8}, doi = {10.4230/LIPICS.ISAAC.2020.8}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrucknerR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrunnerDHW20, author = {Josh Brunner and Erik D. Demaine and Dylan H. Hendrickson and Julian Wellman}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {17:1--17:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.17}, doi = {10.4230/LIPICS.ISAAC.2020.17}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrunnerDHW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CantuLSW20, author = {Angel A. Cantu and Austin Luchsinger and Robert T. Schweller and Tim Wylie}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Signal Passing Self-Assembly Simulates Tile Automata}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {53:1--53:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.53}, doi = {10.4230/LIPICS.ISAAC.2020.53}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CantuLSW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CasteigtsHMZ20, author = {Arnaud Casteigts and Anne{-}Sophie Himmel and Hendrik Molter and Philipp Zschoche}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Finding Temporal Paths Under Waiting Time Constraints}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {30:1--30:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.30}, doi = {10.4230/LIPICS.ISAAC.2020.30}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CasteigtsHMZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Chakraborty0FGL20, author = {Dibyayan Chakraborty and Sandip Das and Florent Foucaud and Harmender Gahlawat and Dimitri Lajou and Bodhayan Roy}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {7:1--7:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.7}, doi = {10.4230/LIPICS.ISAAC.2020.7}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Chakraborty0FGL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenJOPR20, author = {Hubie Chen and Bart M. P. Jansen and Karolina Okrasa and Astrid Pieterse and Pawel Rzazewski}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Sparsification Lower Bounds for List H-Coloring}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {58:1--58:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.58}, doi = {10.4230/LIPICS.ISAAC.2020.58}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenJOPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChiaGLLTW20, author = {Nai{-}Hui Chia and Andr{\'{a}}s Gily{\'{e}}n and Han{-}Hsuan Lin and Seth Lloyd and Ewin Tang and Chunhao Wang}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {47:1--47:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.47}, doi = {10.4230/LIPICS.ISAAC.2020.47}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChiaGLLTW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DemaineKL20, author = {Erik D. Demaine and Justin Kopinsky and Jayson Lynch}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Recursed Is Not Recursive: {A} Jarring Result}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {50:1--50:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.50}, doi = {10.4230/LIPICS.ISAAC.2020.50}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DemaineKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DeyFNS20, author = {Sanjana Dey and Florent Foucaud and Subhas C. Nandy and Arunabha Sen}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Discriminating Codes in Geometric Setups}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {24:1--24:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.24}, doi = {10.4230/LIPICS.ISAAC.2020.24}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DeyFNS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DubloisHGLM20, author = {Louis Dublois and Tesshu Hanaka and Mehdi Khosravian Ghadikolaei and Michael Lampis and Nikolaos Melissinos}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {(In)approximability of Maximum Minimal {FVS}}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {3:1--3:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.3}, doi = {10.4230/LIPICS.ISAAC.2020.3}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DubloisHGLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DulebaGJ20, author = {Maciej Duleba and Pawel Gawrychowski and Wojciech Janczewski}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Efficient Labeling for Reachability in Directed Acyclic Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {27:1--27:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.27}, doi = {10.4230/LIPICS.ISAAC.2020.27}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DulebaGJ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DumitrescuGT20, author = {Adrian Dumitrescu and Anirban Ghosh and Csaba D. T{\'{o}}th}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Sparse Hop Spanners for Unit Disk Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {57:1--57:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.57}, doi = {10.4230/LIPICS.ISAAC.2020.57}, timestamp = {Mon, 22 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DumitrescuGT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FengZH0020, author = {Qilong Feng and Zhen Zhang and Ziyun Huang and Jinhui Xu and Jianxin Wang}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {A Unified Framework of {FPT} Approximation Algorithms for Clustering Problems}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {5:1--5:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.5}, doi = {10.4230/LIPICS.ISAAC.2020.5}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FengZH0020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FluschnikNSZ20, author = {Till Fluschnik and Rolf Niedermeier and Carsten Schubert and Philipp Zschoche}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {43:1--43:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.43}, doi = {10.4230/LIPICS.ISAAC.2020.43}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FluschnikNSZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FominGJPS20, author = {Fedor V. Fomin and Petr A. Golovach and Lars Jaffke and Geevarghese Philip and Danil Sagunov}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Diverse Pairs of Matchings}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {26:1--26:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.26}, doi = {10.4230/LIPICS.ISAAC.2020.26}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FominGJPS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FreiHR20, author = {Fabian Frei and Edith Hemaspaandra and J{\"{o}}rg Rothe}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Complexity of Stability}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {19:1--19:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.19}, doi = {10.4230/LIPICS.ISAAC.2020.19}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FreiHR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FunkeW20, author = {Stefan Funke and Felix Weitbrecht}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Efficiently Computing All Delaunay Triangles Occurring over All Contiguous Subsequences}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {28:1--28:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.28}, doi = {10.4230/LIPICS.ISAAC.2020.28}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FunkeW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GeorgiadisK20, author = {Loukas Georgiadis and Evangelos Kosinas}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {38:1--38:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.38}, doi = {10.4230/LIPICS.ISAAC.2020.38}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GeorgiadisK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GowdaLPP020, author = {Kishen N. Gowda and Aditya Lonkar and Fahad Panolan and Vraj Patel and Saket Saurabh}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Improved {FPT} Algorithms for Deletion to Forest-Like Structures}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {34:1--34:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.34}, doi = {10.4230/LIPICS.ISAAC.2020.34}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GowdaLPP020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GudmundssonSW20, author = {Joachim Gudmundsson and Yuan Sha and Sampson Wong}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Approximating the Packedness of Polygonal Curves}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {9:1--9:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.9}, doi = {10.4230/LIPICS.ISAAC.2020.9}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GudmundssonSW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HamersmaKUZ20, author = {Joep Hamersma and Marc J. van Kreveld and Yushi Uno and Tom C. van der Zanden}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Gourds: {A} Sliding-Block Puzzle with Turning}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {33:1--33:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.33}, doi = {10.4230/LIPICS.ISAAC.2020.33}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HamersmaKUZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HollandWZ20, author = {William L. Holland and Anthony Wirth and Justin Zobel}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Recency Queries with Succinct Representation}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {49:1--49:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.49}, doi = {10.4230/LIPICS.ISAAC.2020.49}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HollandWZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Huang20, author = {Xuangui Huang}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Space Hardness of Solving Structured Linear Systems}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {56:1--56:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.56}, doi = {10.4230/LIPICS.ISAAC.2020.56}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Huang20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Hyatt-DenesikRS20, author = {Dylan Hyatt{-}Denesik and Mirmahdi Rahgoshay and Mohammad R. Salavatipour}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Approximations for Throughput Maximization}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {11:1--11:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.11}, doi = {10.4230/LIPICS.ISAAC.2020.11}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Hyatt-DenesikRS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KernP20, author = {Walter Kern and Dani{\"{e}}l Paulusma}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Contracting to a Longest Path in H-Free Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {22:1--22:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.22}, doi = {10.4230/LIPICS.ISAAC.2020.22}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KernP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KimC20, author = {Sung{-}Hwan Kim and Hwan{-}Gue Cho}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Indexing Isodirectional Pointer Sequences}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {35:1--35:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.35}, doi = {10.4230/LIPICS.ISAAC.2020.35}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KimC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KimSA20, author = {Kangsan Kim and Yongho Shin and Hyung{-}Chan An}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {21:1--21:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.21}, doi = {10.4230/LIPICS.ISAAC.2020.21}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KimSA20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KoanaKS20, author = {Tomohiro Koana and Christian Komusiewicz and Frank Sommer}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Computing Dense and Sparse Subgraphs of Weakly Closed Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {20:1--20:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.20}, doi = {10.4230/LIPICS.ISAAC.2020.20}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KoanaKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KouteckyZ20, author = {Martin Kouteck{\'{y}} and Johannes Zink}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {18:1--18:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.18}, doi = {10.4230/LIPICS.ISAAC.2020.18}, timestamp = {Wed, 14 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KouteckyZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KreveldMOSV20, author = {Marc J. van Kreveld and Tillmann Miltzow and Tim Ophelders and Willem Sonke and Jordi L. Vermeulen}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Between Shapes, Using the Hausdorff Distance}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {13:1--13:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.13}, doi = {10.4230/LIPICS.ISAAC.2020.13}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KreveldMOSV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KrneticM0W20, author = {Predrag Krnetic and Darya Melnyk and Yuyi Wang and Roger Wattenhofer}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {The k-Server Problem with Delays on the Uniform Metric Space}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {61:1--61:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.61}, doi = {10.4230/LIPICS.ISAAC.2020.61}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KrneticM0W20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Labarre20, author = {Anthony Labarre}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Sorting by Prefix Block-Interchanges}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {55:1--55:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.55}, doi = {10.4230/LIPICS.ISAAC.2020.55}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Labarre20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MontealegreRR20, author = {Pedro Montealegre and Diego Ram{\'{\i}}rez{-}Romero and Ivan Rapaport}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Shared vs Private Randomness in Distributed Interactive Proofs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {51:1--51:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.51}, doi = {10.4230/LIPICS.ISAAC.2020.51}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MontealegreRR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MulzerW20, author = {Wolfgang Mulzer and Max Willert}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Compact Routing in Unit Disk Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {16:1--16:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.16}, doi = {10.4230/LIPICS.ISAAC.2020.16}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MulzerW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/OnoderaS20, author = {Taku Onodera and Tetsuo Shibuya}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Wear Leveling Revisited}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {65:1--65:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.65}, doi = {10.4230/LIPICS.ISAAC.2020.65}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/OnoderaS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Oum20, author = {Sang{-}il Oum}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {How to Decompose a Graph into a Tree-Like Structure (Invited Talk)}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {1:1--1:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.1}, doi = {10.4230/LIPICS.ISAAC.2020.1}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Oum20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PangS20, author = {Haozhou Pang and Mohammad R. Salavatipour}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Approximation Algorithms for Generalized Path Scheduling}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {10:1--10:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.10}, doi = {10.4230/LIPICS.ISAAC.2020.10}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/PangS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SakaiI20, author = {Yoshifumi Sakai and Shunsuke Inenaga}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {6:1--6:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.6}, doi = {10.4230/LIPICS.ISAAC.2020.6}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/SakaiI20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SantiagoY20, author = {Richard Santiago and Yuichi Yoshida}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Weakly Submodular Function Maximization Using Local Submodularity Ratio}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {64:1--64:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.64}, doi = {10.4230/LIPICS.ISAAC.2020.64}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/SantiagoY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SumigawaCSS20, author = {Kentaro Sumigawa and Sankardeep Chakraborty and Kunihiko Sadakane and Srinivasa Rao Satti}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Enumerating Range Modes}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {29:1--29:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.29}, doi = {10.4230/LIPICS.ISAAC.2020.29}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SumigawaCSS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/TamuraI020, author = {Yuma Tamura and Takehiro Ito and Xiao Zhou}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Minimization and Parameterized Variants of Vertex Partition Problems on Graphs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {40:1--40:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.40}, doi = {10.4230/LIPICS.ISAAC.2020.40}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/TamuraI020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Thang20, author = {Kim Thang Nguyen}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Online Primal-Dual Algorithms with Configuration Linear Programs}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {45:1--45:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.45}, doi = {10.4230/LIPICS.ISAAC.2020.45}, timestamp = {Tue, 01 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Thang20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Uchizawa20, author = {Kei Uchizawa}, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Size, Depth and Energy of Threshold Circuits Computing Parity Function}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {54:1--54:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.54}, doi = {10.4230/LIPICS.ISAAC.2020.54}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Uchizawa20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/X20, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {Front Matter, Table of Contents, Preface, Conference Organization}, booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, pages = {0:1--0:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.0}, doi = {10.4230/LIPICS.ISAAC.2020.0}, timestamp = {Fri, 04 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/X20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2020, editor = {Yixin Cao and Siu{-}Wing Cheng and Minming Li}, title = {31st International Symposium on Algorithms and Computation, {ISAAC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)}, series = {LIPIcs}, volume = {181}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://www.dagstuhl.de/dagpub/978-3-95977-173-3}, isbn = {978-3-95977-173-3}, timestamp = {Wed, 21 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001K19, author = {Meng He and Serikzhan Kazi}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Path and Ancestor Queries over Trees with Multidimensional Weight Vectors}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {45:1--45:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.45}, doi = {10.4230/LIPICS.ISAAC.2019.45}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0001K19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001WRW19, author = {Yixin Cao and Zhifeng Wang and Guozhen Rong and Jianxin Wang}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Graph Searches and Their End Vertices}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {1:1--1:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.1}, doi = {10.4230/LIPICS.ISAAC.2019.1}, timestamp = {Thu, 18 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001WRW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0002GSTXZ19, author = {Yong Chen and Randy Goebel and Bing Su and Weitian Tong and Yao Xu and An Zhang}, editor = {Pinyan Lu and Guochuan Zhang}, title = {A 21/16-Approximation for the Minimum 3-Path Partition Problem}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {46:1--46:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.46}, doi = {10.4230/LIPICS.ISAAC.2019.46}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0002GSTXZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgrawalKM019, author = {Akanksha Agrawal and Sudeshna Kolay and Jayakrishnan Madathil and Saket Saurabh}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {41:1--41:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.41}, doi = {10.4230/LIPICS.ISAAC.2019.41}, timestamp = {Tue, 02 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AgrawalKM019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AkitayaBKSW19, author = {Hugo A. Akitaya and Maike Buchin and Bernhard Kilgus and Stef Sijben and Carola Wenk}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Distance Measures for Embedded Graphs}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {55:1--55:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.55}, doi = {10.4230/LIPICS.ISAAC.2019.55}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AkitayaBKSW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AkitayaBRU19, author = {Hugo Alves Akitaya and Maike Buchin and Leonie Ryvkin and J{\'{e}}r{\^{o}}me Urhausen}, editor = {Pinyan Lu and Guochuan Zhang}, title = {The k-Fr{\'{e}}chet Distance: How to Walk Your Dog While Teleporting}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {50:1--50:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.50}, doi = {10.4230/LIPICS.ISAAC.2019.50}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AkitayaBRU19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AlbersL19, author = {Susanne Albers and Leon Ladewig}, editor = {Pinyan Lu and Guochuan Zhang}, title = {New Results for the k-Secretary Problem}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {18:1--18:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.18}, doi = {10.4230/LIPICS.ISAAC.2019.18}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AlbersL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Arvind0DM19, author = {Vikraman Arvind and Abhranil Chatterjee and Rajit Datta and Partha Mukhopadhyay}, editor = {Pinyan Lu and Guochuan Zhang}, title = {On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {38:1--38:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.38}, doi = {10.4230/LIPICS.ISAAC.2019.38}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Arvind0DM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AshvinkumarGLNR19, author = {Vikrant Ashvinkumar and Joachim Gudmundsson and Christos Levcopoulos and Bengt J. Nilsson and Andr{\'{e}} van Renssen}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Local Routing in Sparse and Lightweight Geometric Graphs}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {30:1--30:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.30}, doi = {10.4230/LIPICS.ISAAC.2019.30}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AshvinkumarGLNR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bae19, author = {Sang Won Bae}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Minimum-Width Double-Strip and Parallelogram Annulus}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {25:1--25:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.25}, doi = {10.4230/LIPICS.ISAAC.2019.25}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Bae19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bar-NoyBLPR19, author = {Amotz Bar{-}Noy and Toni B{\"{o}}hnlein and Zvi Lotker and David Peleg and Dror Rawitz}, editor = {Pinyan Lu and Guochuan Zhang}, title = {The Generalized Microscopic Image Reconstruction Problem}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {42:1--42:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.42}, doi = {10.4230/LIPICS.ISAAC.2019.42}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Bar-NoyBLPR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bar-NoyCPR19, author = {Amotz Bar{-}Noy and Keerti Choudhary and David Peleg and Dror Rawitz}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Efficiently Realizing Interval Sequences}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {47:1--47:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.47}, doi = {10.4230/LIPICS.ISAAC.2019.47}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Bar-NoyCPR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BarequetPS19, author = {Gill Barequet and Evanthia Papadopoulou and Martin Suderland}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {62:1--62:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.62}, doi = {10.4230/LIPICS.ISAAC.2019.62}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BarequetPS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BecchettiCPR19, author = {Luca Becchetti and Emilio Cruciani and Francesco Pasquale and Sara Rizzo}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Step-By-Step Community Detection in Volume-Regular Graphs}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {20:1--20:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.20}, doi = {10.4230/LIPICS.ISAAC.2019.20}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BecchettiCPR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergKM19, author = {Mark de Berg and S{\'{a}}ndor Kisfaludi{-}Bak and Mehran Mehr}, editor = {Pinyan Lu and Guochuan Zhang}, title = {On One-Round Discrete Voronoi Games}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {37:1--37:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.37}, doi = {10.4230/LIPICS.ISAAC.2019.37}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BergKM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bhattacharya0D19, author = {Binay Bhattacharya and Sandip Das and Subhadeep Ranjan Dev}, editor = {Pinyan Lu and Guochuan Zhang}, title = {The Weighted k-Center Problem in Trees for Fixed k}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {27:1--27:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.27}, doi = {10.4230/LIPICS.ISAAC.2019.27}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Bhattacharya0D19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BhattacharyaBGM19, author = {Anup Bhattacharya and Arijit Bishnu and Arijit Ghosh and Gopinath Mishra}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Triangle Estimation Using Tripartite Independent Set Queries}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {19:1--19:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.19}, doi = {10.4230/LIPICS.ISAAC.2019.19}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BhattacharyaBGM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BienkowskiJS19, author = {Marcin Bienkowski and Lukasz Jez and Pawel Schmidt}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {14:1--14:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.14}, doi = {10.4230/LIPICS.ISAAC.2019.14}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BienkowskiJS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BilleGGLW19, author = {Philip Bille and Pawel Gawrychowski and Inge Li G{\o}rtz and Gad M. Landau and Oren Weimann}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Top Tree Compression of Tries}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {4:1--4:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.4}, doi = {10.4230/LIPICS.ISAAC.2019.4}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BilleGGLW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BonnetBTW19, author = {{\'{E}}douard Bonnet and Nicolas Bousquet and St{\'{e}}phan Thomass{\'{e}} and R{\'{e}}mi Watrigant}, editor = {Pinyan Lu and Guochuan Zhang}, title = {When Maximum Stable Set Can Be Solved in {FPT} Time}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {49:1--49:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.49}, doi = {10.4230/LIPICS.ISAAC.2019.49}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BonnetBTW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BredereckHKN19, author = {Robert Bredereck and Klaus Heeger and Dusan Knop and Rolf Niedermeier}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {44:1--44:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.44}, doi = {10.4230/LIPICS.ISAAC.2019.44}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BredereckHKN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrokkelkampPSV19, author = {Ruben Brokkelkamp and Sven C. Polak and Guido Sch{\"{a}}fer and Yllka Velaj}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {13:1--13:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.13}, doi = {10.4230/LIPICS.ISAAC.2019.13}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrokkelkampPSV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bshouty19, author = {Nader H. Bshouty}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Lower Bound for Non-Adaptive Estimation of the Number of Defective Items}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {2:1--2:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.2}, doi = {10.4230/LIPICS.ISAAC.2019.2}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Bshouty19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Charalampopoulos19, author = {Panagiotis Charalampopoulos and Tomasz Kociumaka and Manal Mohamed and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Internal Dictionary Matching}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {22:1--22:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.22}, doi = {10.4230/LIPICS.ISAAC.2019.22}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Charalampopoulos19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenP19, author = {Wei Chen and Binghui Peng}, editor = {Pinyan Lu and Guochuan Zhang}, title = {On Adaptivity Gaps of Influence Maximization Under the Independent Cascade Model with Full-Adoption Feedback}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {24:1--24:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.24}, doi = {10.4230/LIPICS.ISAAC.2019.24}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChenP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CormodeH19, author = {Graham Cormode and Chris Hickey}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Efficient Interactive Proofs for Linear Algebra}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {48:1--48:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.48}, doi = {10.4230/LIPICS.ISAAC.2019.48}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CormodeH19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CrespelleFG19, author = {Christophe Crespelle and Carl Feghali and Petr A. Golovach}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Cyclability in Graph Classes}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {16:1--16:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.16}, doi = {10.4230/LIPICS.ISAAC.2019.16}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CrespelleFG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DaslerM19, author = {Philip Dasler and David M. Mount}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Online Algorithms for Warehouse Management}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {56:1--56:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.56}, doi = {10.4230/LIPICS.ISAAC.2019.56}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DaslerM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DefrainN19, author = {Oscar Defrain and Lhouari Nourine}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P\({}_{\mbox{7}}\)-Free and P\({}_{\mbox{8}}\)-Free Chordal Graphs}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {63:1--63:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.63}, doi = {10.4230/LIPICS.ISAAC.2019.63}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DefrainN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/El-Zein0MNS19, author = {Hicham El{-}Zein and Meng He and J. Ian Munro and Yakov Nekrich and Bryce Sandlund}, editor = {Pinyan Lu and Guochuan Zhang}, title = {On Approximate Range Mode and Range Selection}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {57:1--57:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.57}, doi = {10.4230/LIPICS.ISAAC.2019.57}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/El-Zein0MNS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EpaGW19, author = {Narthana S. Epa and Junhao Gan and Anthony Wirth}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Result-Sensitive Binary Search with Noisy Information}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {60:1--60:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.60}, doi = {10.4230/LIPICS.ISAAC.2019.60}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/EpaGW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EppsteinGLM19, author = {David Eppstein and Michael T. Goodrich and James A. Liu and Pedro Matias}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Tracking Paths in Planar Graphs}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {54:1--54:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.54}, doi = {10.4230/LIPICS.ISAAC.2019.54}, timestamp = {Sat, 18 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/EppsteinGLM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FagerbergH019, author = {Rolf Fagerberg and David Hammer and Ulrich Meyer}, editor = {Pinyan Lu and Guochuan Zhang}, title = {On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {35:1--35:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.35}, doi = {10.4230/LIPICS.ISAAC.2019.35}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FagerbergH019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FengZHXW19, author = {Qilong Feng and Zhen Zhang and Ziyun Huang and Jinhui Xu and Jianxin Wang}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Improved Algorithms for Clustering with Outliers}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {61:1--61:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.61}, doi = {10.4230/LIPICS.ISAAC.2019.61}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FengZHXW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FlocchiniKKSY19, author = {Paola Flocchini and Ryan Killick and Evangelos Kranakis and Nicola Santoro and Masafumi Yamashita}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Gathering and Election by Mobile Robots in a Continuous Cycle}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {8:1--8:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.8}, doi = {10.4230/LIPICS.ISAAC.2019.8}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FlocchiniKKSY19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FoxL19, author = {Kyle Fox and Xinyi Li}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Approximating the Geometric Edit Distance}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {23:1--23:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.23}, doi = {10.4230/LIPICS.ISAAC.2019.23}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FoxL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FreiW19, author = {Fabian Frei and Koichi Wada}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Efficient Circuit Simulation in MapReduce}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {52:1--52:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.52}, doi = {10.4230/LIPICS.ISAAC.2019.52}, timestamp = {Mon, 22 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FreiW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FujishigeNIBT19, author = {Yuta Fujishige and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Pinyan Lu and Guochuan Zhang}, title = {An Improved Data Structure for Left-Right Maximal Generic Words Problem}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {40:1--40:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.40}, doi = {10.4230/LIPICS.ISAAC.2019.40}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FujishigeNIBT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GalbyLR19, author = {Esther Galby and Paloma T. Lima and Bernard Ries}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Blocking Dominating Sets for H-Free Graphs via Edge Contractions}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {21:1--21:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.21}, doi = {10.4230/LIPICS.ISAAC.2019.21}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GalbyLR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GanardiHLS19, author = {Moses Ganardi and Danny Hucke and Markus Lohrey and Tatiana Starikovskaya}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Sliding Window Property Testing for Regular Languages}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {6:1--6:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.6}, doi = {10.4230/LIPICS.ISAAC.2019.6}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GanardiHLS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GaspersL19, author = {Serge Gaspers and Joshua Lau}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Minimizing and Computing the Inverse Geodesic Length on Trees}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {59:1--59:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.59}, doi = {10.4230/LIPICS.ISAAC.2019.59}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GaspersL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Geissmann0LPP19, author = {Barbara Geissmann and Stefano Leucci and Chih{-}Hung Liu and Paolo Penna and Guido Proietti}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Dual-Mode Greedy Algorithms Can Save Energy}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {64:1--64:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.64}, doi = {10.4230/LIPICS.ISAAC.2019.64}, timestamp = {Tue, 14 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Geissmann0LPP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GhodselahiKT19, author = {Abdolhamid Ghodselahi and Fabian Kuhn and Volker Turau}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Concurrent Distributed Serving with Mobile Servers}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {53:1--53:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.53}, doi = {10.4230/LIPICS.ISAAC.2019.53}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GhodselahiKT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GoldsteinLP19, author = {Isaac Goldstein and Moshe Lewenstein and Ely Porat}, editor = {Pinyan Lu and Guochuan Zhang}, title = {On the Hardness of Set Disjointness and Set Intersection with Bounded Universe}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {7:1--7:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.7}, doi = {10.4230/LIPICS.ISAAC.2019.7}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GoldsteinLP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HamadaMY19, author = {Koki Hamada and Shuichi Miyazaki and Hiroki Yanagisawa}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {9:1--9:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.9}, doi = {10.4230/LIPICS.ISAAC.2019.9}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HamadaMY19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HanKMY19, author = {Xin Han and Yasushi Kawase and Kazuhisa Makino and Haruki Yokomaku}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Online Knapsack Problems with a Resource Buffer}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {28:1--28:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.28}, doi = {10.4230/LIPICS.ISAAC.2019.28}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HanKMY19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HaraguchiN19, author = {Kazuya Haraguchi and Hiroshi Nagamochi}, editor = {Pinyan Lu and Guochuan Zhang}, title = {A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {3:1--3:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.3}, doi = {10.4230/LIPICS.ISAAC.2019.3}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HaraguchiN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Hoi019, author = {Gordon Hoi and Frank Stephan}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Measure and Conquer for Max Hamming Distance {XSAT}}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {15:1--15:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.15}, doi = {10.4230/LIPICS.ISAAC.2019.15}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Hoi019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HuangFW019, author = {Ziyun Huang and Qilong Feng and Jianxin Wang and Jinhui Xu}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Small Candidate Set for Translational Pattern Search}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {26:1--26:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.26}, doi = {10.4230/LIPICS.ISAAC.2019.26}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HuangFW019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/IaconoKK19, author = {John Iacono and Ben Karsin and Grigorios Koumoutsos}, editor = {Pinyan Lu and Guochuan Zhang}, title = {External Memory Planar Point Location with Fast Updates}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {58:1--58:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.58}, doi = {10.4230/LIPICS.ISAAC.2019.58}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/IaconoKK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/InkuluK19, author = {R. Inkulu and Sanjiv Kapoor}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Approximate Euclidean Shortest Paths in Polygonal Domains}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {11:1--11:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.11}, doi = {10.4230/LIPICS.ISAAC.2019.11}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/InkuluK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JainT19, author = {Rahul Jain and Raghunath Tewari}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Reachability in High Treewidth Graphs}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {12:1--12:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.12}, doi = {10.4230/LIPICS.ISAAC.2019.12}, timestamp = {Tue, 21 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/JainT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KahleTW19, author = {Matthew Kahle and Minghao Tian and Yusu Wang}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Local Cliques in ER-Perturbed Random Geometric Graphs}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {29:1--29:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.29}, doi = {10.4230/LIPICS.ISAAC.2019.29}, timestamp = {Mon, 02 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KahleTW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Kisfaludi-BakMZ19, author = {S{\'{a}}ndor Kisfaludi{-}Bak and D{\'{a}}niel Marx and Tom C. van der Zanden}, editor = {Pinyan Lu and Guochuan Zhang}, title = {How Does Object Fatness Impact the Complexity of Packing in d Dimensions?}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {36:1--36:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.36}, doi = {10.4230/LIPICS.ISAAC.2019.36}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Kisfaludi-BakMZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KobayashiSTU19, author = {Yasuaki Kobayashi and Koki Suetsugu and Hideki Tsuiki and Ryuhei Uehara}, editor = {Pinyan Lu and Guochuan Zhang}, title = {On the Complexity of Lattice Puzzles}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {32:1--32:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.32}, doi = {10.4230/LIPICS.ISAAC.2019.32}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KobayashiSTU19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KulikovMMP19, author = {Alexander S. Kulikov and Ivan Mikhailin and Andrey Mokhov and Vladimir V. Podolskii}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Complexity of Linear Operators}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {17:1--17:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.17}, doi = {10.4230/LIPICS.ISAAC.2019.17}, timestamp = {Thu, 19 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KulikovMMP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MamanoEEFGKMP19, author = {Nil Mamano and Alon Efrat and David Eppstein and Daniel Frishberg and Michael T. Goodrich and Stephen G. Kobourov and Pedro Matias and Valentin Polishchuk}, editor = {Pinyan Lu and Guochuan Zhang}, title = {New Applications of Nearest-Neighbor Chains: Euclidean {TSP} and Motorcycle Graphs}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {51:1--51:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.51}, doi = {10.4230/LIPICS.ISAAC.2019.51}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MamanoEEFGKMP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MazzettoPP19, author = {Alessio Mazzetto and Andrea Pietracaprina and Geppino Pucci}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {34:1--34:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.34}, doi = {10.4230/LIPICS.ISAAC.2019.34}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MazzettoPP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NaoriR19, author = {David Naori and Danny Raz}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Online Multidimensional Packing Problems in the Random-Order Model}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {10:1--10:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.10}, doi = {10.4230/LIPICS.ISAAC.2019.10}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/NaoriR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PappW19, author = {P{\'{a}}l Andr{\'{a}}s Papp and Roger Wattenhofer}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Stabilization Time in Minority Processes}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {43:1--43:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.43}, doi = {10.4230/LIPICS.ISAAC.2019.43}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/PappW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SchederTZ19, author = {Dominik Scheder and Shuyang Tang and Jiaheng Zhang}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Searching for Cryptogenography Upper Bounds via Sum of Square Programming}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {31:1--31:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.31}, doi = {10.4230/LIPICS.ISAAC.2019.31}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SchederTZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Stefani19, author = {Lorenzo De Stefani}, editor = {Pinyan Lu and Guochuan Zhang}, title = {The {I/O} Complexity of Hybrid Algorithms for Square Matrix Multiplication}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {33:1--33:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.33}, doi = {10.4230/LIPICS.ISAAC.2019.33}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Stefani19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Thang19, author = {Kim Thang Nguyen}, editor = {Pinyan Lu and Guochuan Zhang}, title = {A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {39:1--39:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.39}, doi = {10.4230/LIPICS.ISAAC.2019.39}, timestamp = {Tue, 01 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Thang19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/X19, editor = {Pinyan Lu and Guochuan Zhang}, title = {Front Matter, Table of Contents, Preface, Symposium Organization}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {0:1--0:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.0}, doi = {10.4230/LIPICS.ISAAC.2019.0}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/X19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Zehmakan19, author = {Ahad N. Zehmakan}, editor = {Pinyan Lu and Guochuan Zhang}, title = {Two Phase Transitions in Two-Way Bootstrap Percolation}, booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, pages = {5:1--5:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.5}, doi = {10.4230/LIPICS.ISAAC.2019.5}, timestamp = {Thu, 28 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Zehmakan19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2019, editor = {Pinyan Lu and Guochuan Zhang}, title = {30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China}, series = {LIPIcs}, volume = {149}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {http://www.dagstuhl.de/dagpub/978-3-95977-130-6}, isbn = {978-3-95977-130-6}, timestamp = {Wed, 21 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001I18, author = {Hiroshi Hirai and Yuni Iwamasa}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Reconstructing Phylogenetic Tree From Multipartite Quartet System}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {57:1--57:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.57}, doi = {10.4230/LIPICS.ISAAC.2018.57}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001I18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0002ST18, author = {Eun Jung Kim and Maria J. Serna and Dimitrios M. Thilikos}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Data-Compression for Parametrized Counting Problems on Sparse Graphs}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {20:1--20:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.20}, doi = {10.4230/LIPICS.ISAAC.2018.20}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0002ST18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgarwalKKMRSX18, author = {Pankaj K. Agarwal and Haim Kaplan and Geva Kipper and Wolfgang Mulzer and G{\"{u}}nter Rote and Micha Sharir and Allen Xiao}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Approximate Minimum-Weight Matching with Outliers Under Translation}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {26:1--26:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.26}, doi = {10.4230/LIPICS.ISAAC.2018.26}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AgarwalKKMRSX18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AggarwalM18, author = {Divesh Aggarwal and Priyanka Mukhopadhyay}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {35:1--35:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.35}, doi = {10.4230/LIPICS.ISAAC.2018.35}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AggarwalM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AkutsuJLTT18, author = {Tatsuya Akutsu and Jesper Jansson and Ruiming Li and Atsuhiro Takasu and Takeyuki Tamura}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {New and Improved Algorithms for Unordered Tree Inclusion}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {27:1--27:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.27}, doi = {10.4230/LIPICS.ISAAC.2018.27}, timestamp = {Tue, 17 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AkutsuJLTT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AngeliniB0PU18, author = {Patrizio Angelini and Michael A. Bekos and Michael Kaufmann and Maximilian Pfister and Torsten Ueckerdt}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Beyond-Planarity: Tur{\'{a}}n-Type Results for Non-Planar Bipartite Graphs}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {28:1--28:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.28}, doi = {10.4230/LIPICS.ISAAC.2018.28}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AngeliniB0PU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ArsenevaCK0OORR18, author = {Elena Arseneva and Man{-}Kwun Chiu and Matias Korman and Aleksandar Markovic and Yoshio Okamoto and Aur{\'{e}}lien Ooms and Andr{\'{e}} van Renssen and Marcel Roeloffzen}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {58:1--58:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.58}, doi = {10.4230/LIPICS.ISAAC.2018.58}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ArsenevaCK0OORR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AurenhammerSK18, author = {Franz Aurenhammer and Michael Steinkogler and Rolf Klein}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Partially Walking a Polygon}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {60:1--60:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.60}, doi = {10.4230/LIPICS.ISAAC.2018.60}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AurenhammerSK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AvarikiotiWW18, author = {Georgia Avarikioti and Yuyi Wang and Roger Wattenhofer}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Algorithmic Channel Design}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {16:1--16:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.16}, doi = {10.4230/LIPICS.ISAAC.2018.16}, timestamp = {Fri, 07 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AvarikiotiWW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Ben-BasatJSU18, author = {Ran Ben{-}Basat and Seungbum Jo and Srinivasa Rao Satti and Shubham Ugare}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Approximate Query Processing over Static Sets and Sliding Windows}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {54:1--54:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.54}, doi = {10.4230/LIPICS.ISAAC.2018.54}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Ben-BasatJSU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BentertDKNN18, author = {Matthias Bentert and Alexander Dittmann and Leon Kellerhals and Andr{\'{e}} Nichterlein and Rolf Niedermeier}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {An Adaptive Version of Brandes' Algorithm for Betweenness Centrality}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {36:1--36:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.36}, doi = {10.4230/LIPICS.ISAAC.2018.36}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BentertDKNN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BezakovaS18, author = {Ivona Bez{\'{a}}kov{\'{a}} and Andrew Searns}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {On Counting Oracles for Path Problems}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {56:1--56:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.56}, doi = {10.4230/LIPICS.ISAAC.2018.56}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BezakovaS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BhattacharyaHKK18, author = {Binay Bhattacharya and Yuya Higashikawa and Tsunehiko Kameda and Naoki Katoh}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {An O(n2 log2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {14:1--14:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.14}, doi = {10.4230/LIPICS.ISAAC.2018.14}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BhattacharyaHKK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bilo18, author = {Davide Bil{\`{o}}}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {40:1--40:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.40}, doi = {10.4230/LIPICS.ISAAC.2018.40}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Bilo18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BiloP18, author = {Davide Bil{\`{o}} and Kleitos Papadopoulos}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {7:1--7:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.7}, doi = {10.4230/LIPICS.ISAAC.2018.7}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BiloP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BishnuGKM018, author = {Arijit Bishnu and Arijit Ghosh and Sudeshna Kolay and Gopinath Mishra and Saket Saurabh}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {25:1--25:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.25}, doi = {10.4230/LIPICS.ISAAC.2018.25}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BishnuGKM018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bjorklund18, author = {Andreas Bj{\"{o}}rklund}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Exploiting Sparsity for Bipartite Hamiltonicity}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {3:1--3:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.3}, doi = {10.4230/LIPICS.ISAAC.2018.3}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Bjorklund18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BjorklundH18, author = {Andreas Bj{\"{o}}rklund and Thore Husfeldt}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an {NC} Algorithm}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {19:1--19:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.19}, doi = {10.4230/LIPICS.ISAAC.2018.19}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BjorklundH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BjorklundHKK18, author = {Andreas Bj{\"{o}}rklund and Thore Husfeldt and Petteri Kaski and Mikko Koivisto}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Counting Connected Subgraphs with Maximum-Degree-Aware Sieving}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {17:1--17:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.17}, doi = {10.4230/LIPICS.ISAAC.2018.17}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BjorklundHKK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BlomerBB18, author = {Johannes Bl{\"{o}}mer and Sascha Brauer and Kathrin Bujna}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Coresets for Fuzzy K-Means with Applications}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {46:1--46:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.46}, doi = {10.4230/LIPICS.ISAAC.2018.46}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BlomerBB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BouchardDPP18, author = {S{\'{e}}bastien Bouchard and Yoann Dieudonn{\'{e}} and Andrzej Pelc and Franck Petit}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Deterministic Treasure Hunt in the Plane with Angular Hints}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {48:1--48:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.48}, doi = {10.4230/LIPICS.ISAAC.2018.48}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BouchardDPP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BoutsCGKM18, author = {Quirijn W. Bouts and Thom Castermans and Arthur van Goethem and Marc J. van Kreveld and Wouter Meulemans}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Competitive Searching for a Line on a Line Arrangement}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {49:1--49:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.49}, doi = {10.4230/LIPICS.ISAAC.2018.49}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BoutsCGKM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BshoutyM18, author = {Nader H. Bshouty and Waseem Makhoul}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {On Polynomial Time Constructions of Minimum Height Decision Tree}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {34:1--34:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.34}, doi = {10.4230/LIPICS.ISAAC.2018.34}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BshoutyM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CevallosEM18, author = {Alfonso Cevallos and Friedrich Eisenbrand and Sarah Morell}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Diversity Maximization in Doubling Metrics}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {33:1--33:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.33}, doi = {10.4230/LIPICS.ISAAC.2018.33}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CevallosEM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChalermsookG0MS18, author = {Parinya Chalermsook and Mayank Goswami and L{\'{a}}szl{\'{o}} Kozma and Kurt Mehlhorn and Thatchaphol Saranurak}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Multi-Finger Binary Search Trees}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {55:1--55:26}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.55}, doi = {10.4230/LIPICS.ISAAC.2018.55}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChalermsookG0MS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChanD0SW18, author = {Timothy M. Chan and Thomas C. van Dijk and Krzysztof Fleszar and Joachim Spoerhase and Alexander Wolff}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {61:1--61:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.61}, doi = {10.4230/LIPICS.ISAAC.2018.61}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChanD0SW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenBCB18, author = {Jian{-}Jia Chen and Nikhil Bansal and Samarjit Chakraborty and Georg von der Br{\"{u}}ggen}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {71:1--71:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.71}, doi = {10.4230/LIPICS.ISAAC.2018.71}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenBCB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenMSS18, author = {Jiehua Chen and Hendrik Molter and Manuel Sorge and Ondrej Such{\'{y}}}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Cluster Editing in Multi-Layer and Temporal Graphs}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {24:1--24:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.24}, doi = {10.4230/LIPICS.ISAAC.2018.24}, timestamp = {Mon, 27 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenMSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenTT18, author = {Yen{-}Ting Chen and Meng{-}Tsung Tsai and Shi{-}Chun Tsai}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {A Dichotomy Result for Cyclic-Order Traversing Games}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {29:1--29:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.29}, doi = {10.4230/LIPICS.ISAAC.2018.29}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenTT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChengY18, author = {Siu{-}Wing Cheng and Lie Yan}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Extensions of Self-Improving Sorters}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {63:1--63:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.63}, doi = {10.4230/LIPICS.ISAAC.2018.63}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChengY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CzygrinowHWW18, author = {Andrzej Czygrinow and Michal Hanckowiak and Wojciech Wawrzyniak and Marcin Witkowski}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Distributed Approximation Algorithms for the Minimum Dominating Set in K{\_}h-Minor-Free Graphs}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {22:1--22:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.22}, doi = {10.4230/LIPICS.ISAAC.2018.22}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CzygrinowHWW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DattaKK018, author = {Samir Datta and Raghav Kulkarni and Ashish Kumar and Anish Mukherjee}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Planar Maximum Matching: Towards a Parallel Algorithm}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {21:1--21:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.21}, doi = {10.4230/LIPICS.ISAAC.2018.21}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DattaKK018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Ducoffe018, author = {Guillaume Ducoffe and Alexandru Popa}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {6:1--6:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.6}, doi = {10.4230/LIPICS.ISAAC.2018.6}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Ducoffe018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Ducoffe018a, author = {Guillaume Ducoffe and Alexandru Popa}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {The b-Matching Problem in Distance-Hereditary Graphs and Beyond}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {30:1--30:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.30}, doi = {10.4230/LIPICS.ISAAC.2018.30}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Ducoffe018a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DvorakKT18, author = {Pavel Dvor{\'{a}}k and Dusan Knop and Tom{\'{a}}s Toufar}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Target Set Selection in Dense Graph Classes}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {18:1--18:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.18}, doi = {10.4230/LIPICS.ISAAC.2018.18}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DvorakKT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Farach-ColtonLT18, author = {Martin Farach{-}Colton and Meng Li and Meng{-}Tsung Tsai}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Streaming Algorithms for Planar Convex Hulls}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {47:1--47:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.47}, doi = {10.4230/LIPICS.ISAAC.2018.47}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Farach-ColtonLT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FengTZFW18, author = {Qilong Feng and Guanlan Tan and Senmin Zhu and Bin Fu and Jianxin Wang}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {New Algorithms for Edge Induced K{\"{o}}nig-Egerv{\'{a}}ry Subgraph Based on Gallai-Edmonds Decomposition}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {31:1--31:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.31}, doi = {10.4230/LIPICS.ISAAC.2018.31}, timestamp = {Tue, 25 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FengTZFW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FickerEMS18, author = {Annette M. C. Ficker and Thomas Erlebach and Mat{\'{u}}s Mihal{\'{a}}k and Frits C. R. Spieksma}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {45:1--45:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.45}, doi = {10.4230/LIPICS.ISAAC.2018.45}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FickerEMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FotakisGMS18, author = {Dimitris Fotakis and Laurent Gourv{\`{e}}s and Claire Mathieu and Abhinav Srivastav}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Covering Clients with Types and Budgets}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {73:1--73:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.73}, doi = {10.4230/LIPICS.ISAAC.2018.73}, timestamp = {Thu, 24 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FotakisGMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Gagie0N18, author = {Travis Gagie and Meng He and Gonzalo Navarro}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Tree Path Majority Data Structures}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {68:1--68:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.68}, doi = {10.4230/LIPICS.ISAAC.2018.68}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Gagie0N18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GarijoMRS18, author = {Delia Garijo and Alberto M{\'{a}}rquez and Natalia Rodr{\'{\i}}guez and Rodrigo I. Silveira}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Computing Optimal Shortcuts for Networks}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {15:1--15:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.15}, doi = {10.4230/LIPICS.ISAAC.2018.15}, timestamp = {Mon, 28 Oct 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GarijoMRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GearyMSS18, author = {Cody W. Geary and Pierre{-}{\'{E}}tienne Meunier and Nicolas Schabanel and Shinnosuke Seki}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Proving the Turing Universality of Oritatami Co-Transcriptional Folding}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {23:1--23:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.23}, doi = {10.4230/LIPICS.ISAAC.2018.23}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GearyMSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GiacomoELMM18, author = {Emilio Di Giacomo and Peter Eades and Giuseppe Liotta and Henk Meijer and Fabrizio Montecchiani}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Polyline Drawings with Topological Constraints}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {39:1--39:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.39}, doi = {10.4230/LIPICS.ISAAC.2018.39}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GiacomoELMM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GleichVW18, author = {David F. Gleich and Nate Veldt and Anthony Wirth}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Correlation Clustering Generalized}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {44:1--44:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.44}, doi = {10.4230/LIPICS.ISAAC.2018.44}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GleichVW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Har-PeledKMRSSW18, author = {Sariel Har{-}Peled and Haim Kaplan and Wolfgang Mulzer and Liam Roditty and Paul Seiferth and Micha Sharir and Max Willert}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Stabbing Pairwise Intersecting Disks by Five Points}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {50:1--50:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.50}, doi = {10.4230/LIPICS.ISAAC.2018.50}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Har-PeledKMRSSW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HoeferW18, author = {Martin Hoefer and Lisa Wilhelmi}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Packing Returning Secretaries}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {65:1--65:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.65}, doi = {10.4230/LIPICS.ISAAC.2018.65}, timestamp = {Fri, 26 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HoeferW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HongK18, author = {Eunpyeong Hong and Mong{-}Jen Kao}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Approximation Algorithm for Vertex Cover with Multiple Covering Constraints}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {43:1--43:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.43}, doi = {10.4230/LIPICS.ISAAC.2018.43}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HongK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HooverIMS18, author = {Kenneth Hoover and Russell Impagliazzo and Ivan Mihajlin and Alexander V. Smal}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Half-Duplex Communication Complexity}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {10:1--10:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.10}, doi = {10.4230/LIPICS.ISAAC.2018.10}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HooverIMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/IshizukaK18, author = {Takashi Ishizuka and Naoyuki Kamiyama}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {On the Complexity of Stable Fractional Hypergraph Matching}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {11:1--11:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.11}, doi = {10.4230/LIPICS.ISAAC.2018.11}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/IshizukaK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JoS18, author = {Seungbum Jo and Srinivasa Rao Satti}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Encoding Two-Dimensional Range Top-k Queries Revisited}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {69:1--69:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.69}, doi = {10.4230/LIPICS.ISAAC.2018.69}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/JoS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Johnson18, author = {Matthew P. Johnson}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {12:1--12:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.12}, doi = {10.4230/LIPICS.ISAAC.2018.12}, timestamp = {Thu, 13 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Johnson18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KammerS18, author = {Frank Kammer and Andrej Sajenko}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Simple 2f-Color Choice Dictionaries}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {66:1--66:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.66}, doi = {10.4230/LIPICS.ISAAC.2018.66}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KammerS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KeikhaKKKLSUVW18, author = {Vahideh Keikha and Mees van de Kerkhof and Marc J. van Kreveld and Irina Kostitsyna and Maarten L{\"{o}}ffler and Frank Staals and J{\'{e}}r{\^{o}}me Urhausen and Jordi L. Vermeulen and Lionov Wiratma}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Convex Partial Transversals of Planar Regions}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {52:1--52:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.52}, doi = {10.4230/LIPICS.ISAAC.2018.52}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KeikhaKKKLSUVW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KlimosovaMMNPS18, author = {Tereza Klimosov{\'{a}} and Josef Mal{\'{\i}}k and Tom{\'{a}}s Masar{\'{\i}}k and Jana Novotn{\'{a}} and Dani{\"{e}}l Paulusma and Veronika Sl{\'{i}}vov{\'{a}}}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Colouring (P{\_}r+P{\_}s)-Free Graphs}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {5:1--5:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.5}, doi = {10.4230/LIPICS.ISAAC.2018.5}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KlimosovaMMNPS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KociumakaKMP18, author = {Tomasz Kociumaka and Ritu Kundu and Manal Mohamed and Solon P. Pissis}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Longest Unbordered Factor in Quasilinear Time}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {70:1--70:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.70}, doi = {10.4230/LIPICS.ISAAC.2018.70}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KociumakaKMP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Kunysz18, author = {Adam Kunysz}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {An Algorithm for the Maximum Weight Strongly Stable Matching Problem}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {42:1--42:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.42}, doi = {10.4230/LIPICS.ISAAC.2018.42}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Kunysz18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KuritaWAU18, author = {Kazuhiro Kurita and Kunihiro Wasa and Hiroki Arimura and Takeaki Uno}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Efficient Enumeration of Dominating Sets for Sparse Graphs}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {8:1--8:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.8}, doi = {10.4230/LIPICS.ISAAC.2018.8}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KuritaWAU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiuPWW18, author = {Xingwu Liu and Zhida Pan and Yuyi Wang and Roger Wattenhofer}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Impatient Online Matching}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {62:1--62:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.62}, doi = {10.4230/LIPICS.ISAAC.2018.62}, timestamp = {Fri, 07 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiuPWW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LoS18, author = {On{-}Hei Solomon Lo and Jens M. Schmidt}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {A Cut Tree Representation for Pendant Pairs}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {38:1--38:9}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.38}, doi = {10.4230/LIPICS.ISAAC.2018.38}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LoS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LozzoR18, author = {Giordano Da Lozzo and Ignaz Rutter}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Approximation Algorithms for Facial Cycles in Planar Embeddings}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {41:1--41:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.41}, doi = {10.4230/LIPICS.ISAAC.2018.41}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LozzoR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LuoEX18, author = {Kelin Luo and Thomas Erlebach and Yinfeng Xu}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {64:1--64:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.64}, doi = {10.4230/LIPICS.ISAAC.2018.64}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LuoEX18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MathenyP18, author = {Michael Matheny and Jeff M. Phillips}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Computing Approximate Statistical Discrepancy}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {32:1--32:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.32}, doi = {10.4230/LIPICS.ISAAC.2018.32}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MathenyP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MunroW18, author = {J. Ian Munro and Kaiyu Wu}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Succinct Data Structures for Chordal Graphs}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {67:1--67:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.67}, doi = {10.4230/LIPICS.ISAAC.2018.67}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MunroW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Oh18, author = {Eunjin Oh}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Point Location in Incremental Planar Subdivisions}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {51:1--51:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.51}, doi = {10.4230/LIPICS.ISAAC.2018.51}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Oh18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Oh18a, author = {Eunjin Oh}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Minimizing Distance-to-Sight in Polygonal Domains}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {59:1--59:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.59}, doi = {10.4230/LIPICS.ISAAC.2018.59}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Oh18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/OsawaSIZ18, author = {Hiroki Osawa and Akira Suzuki and Takehiro Ito and Xiao Zhou}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Algorithms for Coloring Reconfiguration Under Recolorability Constraints}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {37:1--37:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.37}, doi = {10.4230/LIPICS.ISAAC.2018.37}, timestamp = {Wed, 17 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/OsawaSIZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PilzS18, author = {Alexander Pilz and Patrick Schnider}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Extending the Centerpoint Theorem to Multiple Points}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {53:1--53:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.53}, doi = {10.4230/LIPICS.ISAAC.2018.53}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/PilzS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PreisserS18, author = {Johanna E. Prei{\ss}er and Jens M. Schmidt}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Computing Vertex-Disjoint Paths in Large Graphs Using MAOs}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {13:1--13:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.13}, doi = {10.4230/LIPICS.ISAAC.2018.13}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/PreisserS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Rahman018, author = {Md Lutfar Rahman and Thomas Watson}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Complexity of Unordered {CNF} Games}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {9:1--9:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.9}, doi = {10.4230/LIPICS.ISAAC.2018.9}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Rahman018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ShabtaiRS18, author = {Galia Shabtai and Danny Raz and Yuval Shavitt}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {A Relaxed {FPTAS} for Chance-Constrained Knapsack}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {72:1--72:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.72}, doi = {10.4230/LIPICS.ISAAC.2018.72}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ShabtaiRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Stein18, author = {Clifford Stein}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Approximate Matchings in Massive Graphs via Local Structure (Invited Talk)}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {2:1--2:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.2}, doi = {10.4230/LIPICS.ISAAC.2018.2}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Stein18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Teng18, author = {Shang{-}Hua Teng}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk)}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {1:1--1:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.1}, doi = {10.4230/LIPICS.ISAAC.2018.1}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Teng18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/X18, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Front Matter, Table of Contents, Preface, Conference Organization}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {0:i--0:xviii}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.0}, doi = {10.4230/LIPICS.ISAAC.2018.0}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/X18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Zehmakan18, author = {Ahad N. Zehmakan}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Opinion Forming in Erd{\"{o}}s-R{\'{e}}nyi Random Graph and Expanders}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {4:1--4:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.4}, doi = {10.4230/LIPICS.ISAAC.2018.4}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Zehmakan18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2018, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {http://www.dagstuhl.de/dagpub/978-3-95977-094-1}, isbn = {978-3-95977-094-1}, timestamp = {Tue, 11 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/2018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001A17, author = {Eunjin Oh and Hee{-}Kap Ahn}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Finding Pairwise Intersections of Rectangles in a Query Rectangle}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {60:1--60:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.60}, doi = {10.4230/LIPICS.ISAAC.2017.60}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001A17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001A17a, author = {Eunjin Oh and Hee{-}Kap Ahn}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {61:1--61:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.61}, doi = {10.4230/LIPICS.ISAAC.2017.61}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001A17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0002ST17, author = {Arnab Ganguly and Rahul Shah and Sharma V. Thankachan}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Structural Pattern Matching - Succinctly}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {35:1--35:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.35}, doi = {10.4230/LIPICS.ISAAC.2017.35}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0002ST17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AhnBCKM0PRV17, author = {Hee{-}Kap Ahn and Sang Won Bae and Jong Min Choi and Matias Korman and Wolfgang Mulzer and Eunjin Oh and Ji{-}won Park and Andr{\'{e}} van Renssen and Antoine Vigneron}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Faster Algorithms for Growing Prioritized Disks and Rectangles}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {3:1--3:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.3}, doi = {10.4230/LIPICS.ISAAC.2017.3}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AhnBCKM0PRV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AltBCCKKS17, author = {Helmut Alt and Kevin Buchin and Steven Chaplick and Otfried Cheong and Philipp Kindermann and Christian Knauer and Fabian Stehn}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Placing your Coins on a Shelf}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {4:1--4:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.4}, doi = {10.4230/LIPICS.ISAAC.2017.4}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AltBCCKKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AmanoH17, author = {Kazuyuki Amano and Yoshinobu Haruyama}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {On the Number of p4-Tilings by an n-Omino}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {5:1--5:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.5}, doi = {10.4230/LIPICS.ISAAC.2017.5}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AmanoH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ArkinBCCJKMM17, author = {Esther M. Arkin and Aritra Banik and Paz Carmi and Gui Citovsky and Su Jia and Matthew J. Katz and Tyler Mayer and Joseph S. B. Mitchell}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Network Optimization on Partitioned Pairs of Points}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {6:1--6:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.6}, doi = {10.4230/LIPICS.ISAAC.2017.6}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ArkinBCCJKMM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AurenhammerJP17, author = {Franz Aurenhammer and Bert J{\"{u}}ttler and G{\"{u}}nter Paulini}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Voronoi Diagrams for Parallel Halflines and Line Segments in Space}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {7:1--7:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.7}, doi = {10.4230/LIPICS.ISAAC.2017.7}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AurenhammerJP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BabenkoA17, author = {Maxim A. Babenko and Stepan Artamonov}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Faster Algorithms for Half-Integral T-Path Packing}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {8:1--8:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.8}, doi = {10.4230/LIPICS.ISAAC.2017.8}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BabenkoA17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BaeBCGL17, author = {Sang Won Bae and Mark de Berg and Otfried Cheong and Joachim Gudmundsson and Christos Levcopoulos}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Shortcuts for the Circle}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {9:1--9:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.9}, doi = {10.4230/LIPICS.ISAAC.2017.9}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BaeBCGL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BanyassadyCKMRR17, author = {Bahareh Banyassady and Man{-}Kwun Chiu and Matias Korman and Wolfgang Mulzer and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Paul Seiferth and Yannik Stein and Birgit Vogtenhuber and Max Willert}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Routing in Polygonal Domains}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {10:1--10:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.10}, doi = {10.4230/LIPICS.ISAAC.2017.10}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BanyassadyCKMRR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BeckerFKKRSS17, author = {Aaron T. Becker and S{\'{a}}ndor P. Fekete and Phillip Keldenich and Dominik Krupke and Christian Rieck and Christian Scheffer and Arne Schmidt}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {11:1--11:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.11}, doi = {10.4230/LIPICS.ISAAC.2017.11}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BeckerFKKRSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Berg017, author = {Mark de Berg and Aleksandar Markovic}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Dynamic Conflict-Free Colorings in the Plane}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {27:1--27:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.27}, doi = {10.4230/LIPICS.ISAAC.2017.27}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Berg017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergGR17, author = {Mark de Berg and Ade Gunawan and Marcel Roeloffzen}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {25:1--25:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.25}, doi = {10.4230/LIPICS.ISAAC.2017.25}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BergGR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergL0RRW17, author = {Mark de Berg and Tim Leijsen and Aleksandar Markovic and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Gerhard J. Woeginger}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {26:1--26:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.26}, doi = {10.4230/LIPICS.ISAAC.2017.26}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BergL0RRW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BerglinB17, author = {Edvin Berglin and Gerth St{\o}lting Brodal}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {A Simple Greedy Algorithm for Dynamic Graph Orientation}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {12:1--12:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.12}, doi = {10.4230/LIPICS.ISAAC.2017.12}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BerglinB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BiedlCDM17, author = {Therese Biedl and Markus Chimani and Martin Derka and Petra Mutzel}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Crossing Number for Graphs with Bounded{\textasciitilde}Pathwidth}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {13:1--13:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.13}, doi = {10.4230/LIPICS.ISAAC.2017.13}, timestamp = {Thu, 11 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BiedlCDM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BiloCG0P17, author = {Davide Bil{\`{o}} and Feliciano Colella and Luciano Gual{\`{a}} and Stefano Leucci and Guido Proietti}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {14:1--14:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.14}, doi = {10.4230/LIPICS.ISAAC.2017.14}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BiloCG0P17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BirmeleMPV17, author = {Etienne Birmel{\'{e}} and Fabien de Montgolfier and L{\'{e}}o Planche and Laurent Viennot}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Decomposing a Graph into Shortest Paths with Bounded Eccentricity}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {15:1--15:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.15}, doi = {10.4230/LIPICS.ISAAC.2017.15}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BirmeleMPV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BonamyDF0P17, author = {Marthe Bonamy and Konrad K. Dabrowski and Carl Feghali and Matthew Johnson and Dani{\"{e}}l Paulusma}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Independent Feedback Vertex Set for P{\_}5-free Graphs}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {16:1--16:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.16}, doi = {10.4230/LIPICS.ISAAC.2017.16}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BonamyDF0P17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bonifaci17, author = {Vincenzo Bonifaci}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {On the Convergence Time of a Natural Dynamics for Linear Programming}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {17:1--17:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.17}, doi = {10.4230/LIPICS.ISAAC.2017.17}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Bonifaci17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BoseKRV17, author = {Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Sander Verdonschot}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Routing on the Visibility Graph}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {18:1--18:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.18}, doi = {10.4230/LIPICS.ISAAC.2017.18}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BoseKRV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CalinescuJLW17, author = {Gruia C{\u{a}}linescu and Florian Jaehn and Minming Li and Kai Wang}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {An {FPTAS} of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {19:1--19:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.19}, doi = {10.4230/LIPICS.ISAAC.2017.19}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CalinescuJLW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Chen0GSLS17, author = {Lin Chen and Lei Xu and Zhimin Gao and Nolan Shah and Yang Lu and Weidong Shi}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Smart Contract Execution - the (+-)-Biased Ballot Problem}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {21:1--21:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.21}, doi = {10.4230/LIPICS.ISAAC.2017.21}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Chen0GSLS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenHHR17, author = {Li{-}Hsuan Chen and Sun{-}Yuan Hsieh and Ling{-}Ju Hung and Peter Rossmanith}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {20:1--20:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.20}, doi = {10.4230/LIPICS.ISAAC.2017.20}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChenHHR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CohenINP17, author = {Nathann Cohen and Fionn Mc Inerney and Nicolas Nisse and St{\'{e}}phane P{\'{e}}rennes}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Study of a Combinatorial Game in Graphs Through Linear Programming}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {22:1--22:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.22}, doi = {10.4230/LIPICS.ISAAC.2017.22}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CohenINP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ConteKUW17, author = {Alessio Conte and Mamadou Moustapha Kant{\'{e}} and Takeaki Uno and Kunihiro Wasa}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {On Maximal Cliques with Connectivity Constraints in Directed Graphs}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {23:1--23:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.23}, doi = {10.4230/LIPICS.ISAAC.2017.23}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ConteKUW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DeyRS17, author = {Tamal K. Dey and Alfred Rossi and Anastasios Sidiropoulos}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Temporal Hierarchical Clustering}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {28:1--28:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.28}, doi = {10.4230/LIPICS.ISAAC.2017.28}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DeyRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Ding17, author = {Ning Ding}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Agnostically Learning Boolean Functions with Finite Polynomial Representation}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {29:1--29:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.29}, doi = {10.4230/LIPICS.ISAAC.2017.29}, timestamp = {Tue, 24 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Ding17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/El-ZeinMN17, author = {Hicham El{-}Zein and J. Ian Munro and Yakov Nekrich}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Succinct Color Searching in One Dimension}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {30:1--30:11}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.30}, doi = {10.4230/LIPICS.ISAAC.2017.30}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/El-ZeinMN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FeketeK17, author = {S{\'{a}}ndor P. Fekete and Phillip Keldenich}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Conflict-Free Coloring of Intersection Graphs}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {31:1--31:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.31}, doi = {10.4230/LIPICS.ISAAC.2017.31}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FeketeK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FreksenL17, author = {Casper Benjamin Freksen and Kasper Green Larsen}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {32:1--32:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.32}, doi = {10.4230/LIPICS.ISAAC.2017.32}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FreksenL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FujishigeNIBT17, author = {Yuta Fujishige and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {33:1--33:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.33}, doi = {10.4230/LIPICS.ISAAC.2017.33}, timestamp = {Mon, 24 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FujishigeNIBT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Fulek17, author = {Radoslav Fulek}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Embedding Graphs into Embedded Graphs}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {34:1--34:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.34}, doi = {10.4230/LIPICS.ISAAC.2017.34}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Fulek17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GanianOS17, author = {Robert Ganian and Sebastian Ordyniak and Ramanujan Sridharan}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {On Structural Parameterizations of the Edge Disjoint Paths Problem}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {36:1--36:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.36}, doi = {10.4230/LIPICS.ISAAC.2017.36}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GanianOS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GaspersGMR17, author = {Serge Gaspers and Joachim Gudmundsson and Juli{\'{a}}n Mestre and Stefan R{\"{u}}mmele}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {37:1--37:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.37}, doi = {10.4230/LIPICS.ISAAC.2017.37}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GaspersGMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Geissmann0LP17, author = {Barbara Geissmann and Stefano Leucci and Chih{-}Hung Liu and Paolo Penna}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Sorting with Recurrent Comparison Errors}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {38:1--38:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.38}, doi = {10.4230/LIPICS.ISAAC.2017.38}, timestamp = {Tue, 14 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Geissmann0LP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GoldS17, author = {Omer Gold and Micha Sharir}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Dominance Product and High-Dimensional Closest Pair under L{\_}infty}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {39:1--39:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.39}, doi = {10.4230/LIPICS.ISAAC.2017.39}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GoldS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GoldsteinLP17, author = {Isaac Goldstein and Moshe Lewenstein and Ely Porat}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Orthogonal Vectors Indexing}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {40:1--40:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.40}, doi = {10.4230/LIPICS.ISAAC.2017.40}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GoldsteinLP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolinKQ17, author = {Mordecai J. Golin and Hadi Khodabande and Bo Qin}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {41:1--41:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.41}, doi = {10.4230/LIPICS.ISAAC.2017.41}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GolinKQ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GudmundssonP17, author = {Joachim Gudmundsson and Rasmus Pagh}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {42:1--42:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.42}, doi = {10.4230/LIPICS.ISAAC.2017.42}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GudmundssonP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HabibM17, author = {Michel Habib and Lalla Mouatadid}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Maximum Induced Matching Algorithms via Vertex Ordering Characterizations}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {43:1--43:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.43}, doi = {10.4230/LIPICS.ISAAC.2017.43}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HabibM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HagerupK17, author = {Torben Hagerup and Frank Kammer}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {On-the-Fly Array Initialization in Less Space}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {44:1--44:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.44}, doi = {10.4230/LIPICS.ISAAC.2017.44}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HagerupK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HanakaNO17, author = {Tesshu Hanaka and Naomi Nishimura and Hirotaka Ono}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {On Directed Covering and Domination Problems}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {45:1--45:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.45}, doi = {10.4230/LIPICS.ISAAC.2017.45}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HanakaNO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HayakawaIOU17, author = {Hitoshi Hayakawa and Toshimasa Ishii and Hirotaka Ono and Yushi Uno}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Settlement Fund Circulation Problem}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {46:1--46:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.46}, doi = {10.4230/LIPICS.ISAAC.2017.46}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HayakawaIOU17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Huang017, author = {Ziyun Huang and Jinhui Xu}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {47:1--47:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.47}, doi = {10.4230/LIPICS.ISAAC.2017.47}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Huang017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItoK017, author = {Takehiro Ito and Naonori Kakimura and Yusuke Kobayashi}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Complexity of the Multi-Service Center Problem}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {48:1--48:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.48}, doi = {10.4230/LIPICS.ISAAC.2017.48}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ItoK017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Iwata17, author = {Satoru Iwata}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Weighted Linear Matroid Parity}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {1:1--1:5}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.1}, doi = {10.4230/LIPICS.ISAAC.2017.1}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Iwata17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JahanjouKR17, author = {Hamidreza Jahanjou and Erez Kantor and Rajmohan Rajaraman}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Improved Algorithms for Scheduling Unsplittable Flows on Paths}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {49:1--49:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.49}, doi = {10.4230/LIPICS.ISAAC.2017.49}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/JahanjouKR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KatsikarelisLP17, author = {Ioannis Katsikarelis and Michael Lampis and Vangelis Th. Paschos}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {50:1--50:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.50}, doi = {10.4230/LIPICS.ISAAC.2017.50}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KatsikarelisLP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KawaseKMS17, author = {Yasushi Kawase and Kei Kimura and Kazuhisa Makino and Hanna Sumita}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Optimal Matroid Partitioning Problems}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {51:1--51:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.51}, doi = {10.4230/LIPICS.ISAAC.2017.51}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KawaseKMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Kobayashi17, author = {Koji M. Kobayashi}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Improved Bounds for Online Dominating Sets of Trees}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {52:1--52:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.52}, doi = {10.4230/LIPICS.ISAAC.2017.52}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Kobayashi17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KonstantinidisP17, author = {Athanasios L. Konstantinidis and Charis Papadopoulos}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {53:1--53:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.53}, doi = {10.4230/LIPICS.ISAAC.2017.53}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KonstantinidisP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KostitsynaSV17, author = {Irina Kostitsyna and Bettina Speckmann and Kevin Verbeek}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Non-Crossing Geometric Steiner Arborescences}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {54:1--54:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.54}, doi = {10.4230/LIPICS.ISAAC.2017.54}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KostitsynaSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LozzoDEJ17, author = {Giordano Da Lozzo and William E. Devanny and David Eppstein and Timothy Johnson}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {24:1--24:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.24}, doi = {10.4230/LIPICS.ISAAC.2017.24}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LozzoDEJ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/McClintockMW17, author = {Jessica McClintock and Juli{\'{a}}n Mestre and Anthony Wirth}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Precedence-Constrained Min Sum Set Cover}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {55:1--55:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.55}, doi = {10.4230/LIPICS.ISAAC.2017.55}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/McClintockMW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MiyazakiO17, author = {Shuichi Miyazaki and Kazuya Okamoto}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Jointly Stable Matchings}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {56:1--56:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.56}, doi = {10.4230/LIPICS.ISAAC.2017.56}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MiyazakiO17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MunroNN17, author = {J. Ian Munro and Gonzalo Navarro and Yakov Nekrich}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Fast Compressed Self-Indexes with Deterministic Linear-Time Construction}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {57:1--57:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.57}, doi = {10.4230/LIPICS.ISAAC.2017.57}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MunroNN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NagaoST17, author = {Atsuki Nagao and Kazuhisa Seto and Junichi Teruyama}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Satisfiability Algorithm for Syntactic Read-{\textdollar}k{\textdollar}-times Branching Programs}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {58:1--58:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.58}, doi = {10.4230/LIPICS.ISAAC.2017.58}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/NagaoST17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Nakamura17, author = {Kengo Nakamura}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Fully Dynamic Connectivity Oracles under General Vertex Updates}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {59:1--59:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.59}, doi = {10.4230/LIPICS.ISAAC.2017.59}, timestamp = {Fri, 10 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Nakamura17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/OsawaSIZ17, author = {Hiroki Osawa and Akira Suzuki and Takehiro Ito and Xiao Zhou}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Complexity of Coloring Reconfiguration under Recolorability Constraints}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {62:1--62:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.62}, doi = {10.4230/LIPICS.ISAAC.2017.62}, timestamp = {Wed, 17 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/OsawaSIZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SankowskiW17, author = {Piotr Sankowski and Piotr Wygocki}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Approximate Nearest Neighbors Search Without False Negatives For l{\_}2 For c{\textgreater}sqrt\{loglog\{n\}\}}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {63:1--63:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.63}, doi = {10.4230/LIPICS.ISAAC.2017.63}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SankowskiW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ShiauKLL17, author = {Jia{-}Yau Shiau and Mong{-}Jen Kao and Ching{-}Chi Lin and D. T. Lee}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Tight Approximation for Partial Vertex Cover with Hard Capacities}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {64:1--64:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.64}, doi = {10.4230/LIPICS.ISAAC.2017.64}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ShiauKLL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Takhanov17, author = {Rustem Takhanov}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Hybrid VCSPs with Crisp and Valued Conservative Templates}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {65:1--65:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.65}, doi = {10.4230/LIPICS.ISAAC.2017.65}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Takhanov17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Venkatasubramanian17, author = {Suresh Venkatasubramanian}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Computational Philosophy: On Fairness in Automated Decision Making}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {2:1--2:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.2}, doi = {10.4230/LIPICS.ISAAC.2017.2}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Venkatasubramanian17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/X17, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Front Matter, Table of Contents, Preface, External Reviewers}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {0:i--0:xvi}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.0}, doi = {10.4230/LIPICS.ISAAC.2017.0}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/X17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/XuCLLL017, author = {Yao Xu and Yong Chen and Guohui Lin and Tian Liu and Taibo Luo and Peng Zhang}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {A {(1.4} + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {66:1--66:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.66}, doi = {10.4230/LIPICS.ISAAC.2017.66}, timestamp = {Mon, 03 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/XuCLLL017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Yokoi17, author = {Yu Yokoi}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {Envy-free Matchings with Lower Quotas}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {67:1--67:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.67}, doi = {10.4230/LIPICS.ISAAC.2017.67}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Yokoi17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2017, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {http://www.dagstuhl.de/dagpub/978-3-95977-054-5}, isbn = {978-3-95977-054-5}, timestamp = {Tue, 11 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/2017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001A16, author = {Eunjin Oh and Hee{-}Kap Ahn}, editor = {Seok{-}Hee Hong}, title = {Assigning Weights to Minimize the Covering Radius in the Plane}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {58:1--58:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.58}, doi = {10.4230/LIPICS.ISAAC.2016.58}, timestamp = {Thu, 27 Apr 2023 14:57:19 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0001A16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0001A16a, author = {Eunjin Oh and Hee{-}Kap Ahn}, editor = {Seok{-}Hee Hong}, title = {A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {59:1--59:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.59}, doi = {10.4230/LIPICS.ISAAC.2016.59}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0001A16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0002HST16, author = {Arnab Ganguly and Wing{-}Kai Hon and Rahul Shah and Sharma V. Thankachan}, editor = {Seok{-}Hee Hong}, title = {Space-Time Trade-Offs for the Shortest Unique Substring Problem}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {34:1--34:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.34}, doi = {10.4230/LIPICS.ISAAC.2016.34}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/0002HST16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AbdullahDRV16, author = {Amirali Abdullah and Samira Daruki and Chitradeep Dutta Roy and Suresh Venkatasubramanian}, editor = {Seok{-}Hee Hong}, title = {Streaming Verification of Graph Properties}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {3:1--3:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.3}, doi = {10.4230/LIPICS.ISAAC.2016.3}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AbdullahDRV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Abu-KhzamBCF16, author = {Faisal N. Abu{-}Khzam and Cristina Bazgan and Katrin Casel and Henning Fernau}, editor = {Seok{-}Hee Hong}, title = {Building Clusters with Lower-Bounded Sizes}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {4:1--4:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.4}, doi = {10.4230/LIPICS.ISAAC.2016.4}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Abu-KhzamBCF16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgarwalPV16, author = {Pankaj K. Agarwal and Jiangwei Pan and Will Victor}, editor = {Seok{-}Hee Hong}, title = {An Efficient Algorithm for Placing Electric Vehicle Charging Stations}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {7:1--7:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.7}, doi = {10.4230/LIPICS.ISAAC.2016.7}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AgarwalPV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgarwalR16, author = {Udit Agarwal and Vijaya Ramachandran}, editor = {Seok{-}Hee Hong}, title = {Finding k Simple Shortest Paths and Cycles}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {8:1--8:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.8}, doi = {10.4230/LIPICS.ISAAC.2016.8}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AgarwalR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgrawalPSZ16, author = {Akanksha Agrawal and Fahad Panolan and Saket Saurabh and Meirav Zehavi}, editor = {Seok{-}Hee Hong}, title = {Simultaneous Feedback Edge Set: {A} Parameterized Perspective}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {5:1--5:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.5}, doi = {10.4230/LIPICS.ISAAC.2016.5}, timestamp = {Tue, 02 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AgrawalPSZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgrawalSSZ16, author = {Akanksha Agrawal and Saket Saurabh and Roohani Sharma and Meirav Zehavi}, editor = {Seok{-}Hee Hong}, title = {Kernels for Deletion to Classes of Acyclic Digraphs}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {6:1--6:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.6}, doi = {10.4230/LIPICS.ISAAC.2016.6}, timestamp = {Tue, 02 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AgrawalSSZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AichholzerHKPRR16, author = {Oswin Aichholzer and Thomas Hackl and Matias Korman and Alexander Pilz and G{\"{u}}nter Rote and Andr{\'{e}} van Renssen and Marcel Roeloffzen and Birgit Vogtenhuber}, editor = {Seok{-}Hee Hong}, title = {Packing Short Plane Spanning Trees in Complete Geometric Graphs}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {9:1--9:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.9}, doi = {10.4230/LIPICS.ISAAC.2016.9}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AichholzerHKPRR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AkitayaT16, author = {Hugo A. Akitaya and Csaba D. T{\'{o}}th}, editor = {Seok{-}Hee Hong}, title = {Reconstruction of Weakly Simple Polygons from their Edges}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {10:1--10:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.10}, doi = {10.4230/LIPICS.ISAAC.2016.10}, timestamp = {Tue, 02 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AkitayaT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AltS16, author = {Helmut Alt and Nadja Scharf}, editor = {Seok{-}Hee Hong}, title = {Approximating Smallest Containers for Packing Three-Dimensional Convex Objects}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {11:1--11:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.11}, doi = {10.4230/LIPICS.ISAAC.2016.11}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AltS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AmirKLPPS16, author = {Amihood Amir and Tsvi Kopelowitz and Avivit Levy and Seth Pettie and Ely Porat and B. Riva Shalom}, editor = {Seok{-}Hee Hong}, title = {Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {12:1--12:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.12}, doi = {10.4230/LIPICS.ISAAC.2016.12}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AmirKLPPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AngeliniL16, author = {Patrizio Angelini and Giordano Da Lozzo}, editor = {Seok{-}Hee Hong}, title = {Clustered Planarity with Pipes}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {13:1--13:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.13}, doi = {10.4230/LIPICS.ISAAC.2016.13}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AngeliniL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bae16, author = {Sang Won Bae}, editor = {Seok{-}Hee Hong}, title = {L{\_}1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {14:1--14:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.14}, doi = {10.4230/LIPICS.ISAAC.2016.14}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Bae16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BandyapadhyayV16, author = {Sayan Bandyapadhyay and Kasturi R. Varadarajan}, editor = {Seok{-}Hee Hong}, title = {Approximate Clustering via Metric Partitioning}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {15:1--15:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.15}, doi = {10.4230/LIPICS.ISAAC.2016.15}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BandyapadhyayV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BerndtL16, author = {Sebastian Berndt and Maciej Liskiewicz}, editor = {Seok{-}Hee Hong}, title = {Hard Communication Channels for Steganography}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {16:1--16:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.16}, doi = {10.4230/LIPICS.ISAAC.2016.16}, timestamp = {Wed, 28 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BerndtL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Biedl016, author = {Therese Biedl and Saeed Mehrabi}, editor = {Seok{-}Hee Hong}, title = {On r-Guarding Thin Orthogonal Polygons}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {17:1--17:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.17}, doi = {10.4230/LIPICS.ISAAC.2016.17}, timestamp = {Thu, 11 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Biedl016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BilleCGSVV16, author = {Philip Bille and Patrick Hagge Cording and Inge Li G{\o}rtz and Frederik Rye Skjoldjensen and Hjalte Wedel Vildh{\o}j and S{\o}ren Vind}, editor = {Seok{-}Hee Hong}, title = {Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {18:1--18:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.18}, doi = {10.4230/LIPICS.ISAAC.2016.18}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BilleCGSVV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BiniazBCGMS16, author = {Ahmad Biniaz and Prosenjit Bose and Jean{-}Lou De Carufel and Cyril Gavoille and Anil Maheshwari and Michiel H. M. Smid}, editor = {Seok{-}Hee Hong}, title = {Towards Plane Spanners of Degree 3}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {19:1--19:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.19}, doi = {10.4230/LIPICS.ISAAC.2016.19}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BiniazBCGMS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BodlaenderOO16, author = {Hans L. Bodlaender and Hirotaka Ono and Yota Otachi}, editor = {Seok{-}Hee Hong}, title = {Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {20:1--20:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.20}, doi = {10.4230/LIPICS.ISAAC.2016.20}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BodlaenderOO16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BohmCJLSV16, author = {Martin B{\"{o}}hm and Marek Chrobak and Lukasz Jez and Fei Li and Jir{\'{\i}} Sgall and Pavel Vesel{\'{y}}}, editor = {Seok{-}Hee Hong}, title = {Online Packet Scheduling with Bounded Delay and Lookahead}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {21:1--21:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.21}, doi = {10.4230/LIPICS.ISAAC.2016.21}, timestamp = {Tue, 29 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BohmCJLSV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Chakraborty0S16, author = {Sankardeep Chakraborty and Venkatesh Raman and Srinivasa Rao Satti}, editor = {Seok{-}Hee Hong}, title = {Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {22:1--22:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.22}, doi = {10.4230/LIPICS.ISAAC.2016.22}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Chakraborty0S16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChanS16, author = {Timothy M. Chan and Dimitrios Skrepetos}, editor = {Seok{-}Hee Hong}, title = {All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {24:1--24:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.24}, doi = {10.4230/LIPICS.ISAAC.2016.24}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChanS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChanTW16, author = {T.{-}H. Hubert Chan and Zhihao Gavin Tang and Xiaowei Wu}, editor = {Seok{-}Hee Hong}, title = {On (1, epsilon)-Restricted Max-Min Fair Allocation Problem}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {23:1--23:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.23}, doi = {10.4230/LIPICS.ISAAC.2016.23}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChanTW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Chen16, author = {Lijie Chen}, editor = {Seok{-}Hee Hong}, title = {Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {26:1--26:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.26}, doi = {10.4230/LIPICS.ISAAC.2016.26}, timestamp = {Fri, 05 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Chen16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenG16, author = {Di Chen and Mordecai J. Golin}, editor = {Seok{-}Hee Hong}, title = {Sink Evacuation on Trees with Dynamic Confluent Flows}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {25:1--25:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.25}, doi = {10.4230/LIPICS.ISAAC.2016.25}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenG16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CzyzowiczGKKNOS16, author = {Jurek Czyzowicz and Konstantinos Georgiou and Evangelos Kranakis and Danny Krizanc and Lata Narayanan and Jaroslav Opatrny and Sunil M. Shende}, editor = {Seok{-}Hee Hong}, title = {Search on a Line by Byzantine Robots}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {27:1--27:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.27}, doi = {10.4230/LIPICS.ISAAC.2016.27}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CzyzowiczGKKNOS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DomanicLP16, author = {Nevzat Onur Domani{\c{c}} and Chi{-}Kit Lam and C. Gregory Plaxton}, editor = {Seok{-}Hee Hong}, title = {Bipartite Matching with Linear Edge Weights}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {28:1--28:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.28}, doi = {10.4230/LIPICS.ISAAC.2016.28}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DomanicLP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/El-ZeinMR16, author = {Hicham El{-}Zein and J. Ian Munro and Matthew Robertson}, editor = {Seok{-}Hee Hong}, title = {Raising Permutations to Powers in Place}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {29:1--29:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.29}, doi = {10.4230/LIPICS.ISAAC.2016.29}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/El-ZeinMR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ElmasryK16, author = {Amr Elmasry and Frank Kammer}, editor = {Seok{-}Hee Hong}, title = {Space-Efficient Plane-Sweep Algorithms}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {30:1--30:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.30}, doi = {10.4230/LIPICS.ISAAC.2016.30}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ElmasryK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EtscheidM16, author = {Michael Etscheid and Matthias Mnich}, editor = {Seok{-}Hee Hong}, title = {Linear Kernels and Linear-Time Algorithms for Finding Large Cuts}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {31:1--31:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.31}, doi = {10.4230/LIPICS.ISAAC.2016.31}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/EtscheidM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FeketeLMS16, author = {S{\'{a}}ndor P. Fekete and Qian Li and Joseph S. B. Mitchell and Christian Scheffer}, editor = {Seok{-}Hee Hong}, title = {Universal Guard Problems}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {32:1--32:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.32}, doi = {10.4230/LIPICS.ISAAC.2016.32}, timestamp = {Wed, 27 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FeketeLMS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FeldmannKPS16, author = {Andreas Emil Feldmann and Jochen K{\"{o}}nemann and Kanstantsin Pashkovich and Laura Sanit{\`{a}}}, editor = {Seok{-}Hee Hong}, title = {Fast Approximation Algorithms for the Generalized Survivable Network Design Problem}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {33:1--33:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.33}, doi = {10.4230/LIPICS.ISAAC.2016.33}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FeldmannKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Ghandeharizadeh16, author = {Shahram Ghandeharizadeh and Sandy Irani and Jenny Lam}, editor = {Seok{-}Hee Hong}, title = {The Subset Assignment Problem for Data Placement in Caches}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {35:1--35:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.35}, doi = {10.4230/LIPICS.ISAAC.2016.35}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Ghandeharizadeh16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Ham16, author = {Lucy Ham}, editor = {Seok{-}Hee Hong}, title = {A Gap Trichotomy for Boolean Constraint Problems: Extending Schaefer's Theorem}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {36:1--36:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.36}, doi = {10.4230/LIPICS.ISAAC.2016.36}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Ham16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HoangU16, author = {Duc A. Hoang and Ryuhei Uehara}, editor = {Seok{-}Hee Hong}, title = {Sliding Tokens on a Cactus}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {37:1--37:26}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.37}, doi = {10.4230/LIPICS.ISAAC.2016.37}, timestamp = {Mon, 15 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HoangU16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItsyksonKS16, author = {Dmitry Itsykson and Alexander Knop and Dmitry Sokolov}, editor = {Seok{-}Hee Hong}, title = {Complexity of Distributions and Average-Case Hardness}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {38:1--38:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.38}, doi = {10.4230/LIPICS.ISAAC.2016.38}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ItsyksonKS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Jin16, author = {Kai Jin}, editor = {Seok{-}Hee Hong}, title = {Computing the Pattern Waiting Time: {A} Revisit of the Intuitive Approach}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {39:1--39:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.39}, doi = {10.4230/LIPICS.ISAAC.2016.39}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Jin16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KaoTL16, author = {Mong{-}Jen Kao and Hai{-}Lun Tu and D. T. Lee}, editor = {Seok{-}Hee Hong}, title = {O(f) Bi-Approximation for Capacitated Covering with Hard Capacities}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {40:1--40:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.40}, doi = {10.4230/LIPICS.ISAAC.2016.40}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KaoTL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KawaseM16, author = {Yasushi Kawase and Kazuhisa Makino}, editor = {Seok{-}Hee Hong}, title = {Surrogate Optimization for p-Norms}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {41:1--41:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.41}, doi = {10.4230/LIPICS.ISAAC.2016.41}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KawaseM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KawaseM16a, author = {Yasushi Kawase and Atsushi Miyauchi}, editor = {Seok{-}Hee Hong}, title = {The Densest Subgraph Problem with a Convex/Concave Size Function}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {44:1--44:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.44}, doi = {10.4230/LIPICS.ISAAC.2016.44}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KawaseM16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KawaseMM16, author = {Yasushi Kawase and Tomomi Matsui and Atsushi Miyauchi}, editor = {Seok{-}Hee Hong}, title = {Additive Approximation Algorithms for Modularity Maximization}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {43:1--43:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.43}, doi = {10.4230/LIPICS.ISAAC.2016.43}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KawaseMM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KawaseMS16, author = {Yasushi Kawase and Kazuhisa Makino and Kento Seimi}, editor = {Seok{-}Hee Hong}, title = {Optimal Composition Ordering Problems for Piecewise Linear Functions}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {42:1--42:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.42}, doi = {10.4230/LIPICS.ISAAC.2016.42}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KawaseMS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KlavikOS16, author = {Pavel Klav{\'{\i}}k and Yota Otachi and Jir{\'{\i}} Sejnoha}, editor = {Seok{-}Hee Hong}, title = {On the Classes of Interval Graphs of Limited Nesting and Count of Lengths}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {45:1--45:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.45}, doi = {10.4230/LIPICS.ISAAC.2016.45}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KlavikOS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KociumakaPR16, author = {Tomasz Kociumaka and Solon P. Pissis and Jakub Radoszewski}, editor = {Seok{-}Hee Hong}, title = {Pattern Matching and Consensus Problems on Weighted Sequences and Profiles}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {46:1--46:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.46}, doi = {10.4230/LIPICS.ISAAC.2016.46}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KociumakaPR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KontogiannisWZ16, author = {Spyros C. Kontogiannis and Dorothea Wagner and Christos D. Zaroliagis}, editor = {Seok{-}Hee Hong}, title = {Hierarchical Time-Dependent Oracles}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {47:1--47:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.47}, doi = {10.4230/LIPICS.ISAAC.2016.47}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KontogiannisWZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KreveldLSW16, author = {Marc J. van Kreveld and Maarten L{\"{o}}ffler and Frank Staals and Lionov Wiratma}, editor = {Seok{-}Hee Hong}, title = {A Refined Definition for Groups of Moving Entities and its Computation}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {48:1--48:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.48}, doi = {10.4230/LIPICS.ISAAC.2016.48}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KreveldLSW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KurzM16, author = {Denis Kurz and Petra Mutzel}, editor = {Seok{-}Hee Hong}, title = {A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {49:1--49:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.49}, doi = {10.4230/LIPICS.ISAAC.2016.49}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KurzM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LeL16, author = {Ho{\`{a}}ng{-}Oanh Le and Van Bang Le}, editor = {Seok{-}Hee Hong}, title = {On the Complexity of Matching Cut in Graphs of Fixed Diameter}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {50:1--50:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.50}, doi = {10.4230/LIPICS.ISAAC.2016.50}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LeL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiSZ16, author = {Qian Li and Xiaoming Sun and Jialin Zhang}, editor = {Seok{-}Hee Hong}, title = {On the Optimality of Tape Merge of Two Lists with Similar Size}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {51:1--51:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.51}, doi = {10.4230/LIPICS.ISAAC.2016.51}, timestamp = {Wed, 26 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiSZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiW16, author = {Shimin Li and Haitao Wang}, editor = {Seok{-}Hee Hong}, title = {Dispersing Points on Intervals}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {52:1--52:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.52}, doi = {10.4230/LIPICS.ISAAC.2016.52}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Lin16, author = {Xuemin Lin}, editor = {Seok{-}Hee Hong}, title = {Towards Processing of Big Graphs: from Theory, Algorithm to System (Invited Talk)}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {1:1--1:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.1}, doi = {10.4230/LIPICS.ISAAC.2016.1}, timestamp = {Mon, 16 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Lin16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiuDH016, author = {Yangwei Liu and Hu Ding and Ziyun Huang and Jinhui Xu}, editor = {Seok{-}Hee Hong}, title = {Distributed and Robust Support Vector Machine}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {54:1--54:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.54}, doi = {10.4230/LIPICS.ISAAC.2016.54}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiuDH016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiuLW16, author = {Fu{-}Hong Liu and Hsiang{-}Hsuan Liu and Prudence W. H. Wong}, editor = {Seok{-}Hee Hong}, title = {Optimal Nonpreemptive Scheduling in a Smart Grid Model}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {53:1--53:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.53}, doi = {10.4230/LIPICS.ISAAC.2016.53}, timestamp = {Wed, 14 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiuLW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LuoXTL16, author = {Wenchang Luo and Yao Xu and Weitian Tong and Guohui Lin}, editor = {Seok{-}Hee Hong}, title = {Single Machine Scheduling with Job-Dependent Machine Deterioration}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {55:1--55:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.55}, doi = {10.4230/LIPICS.ISAAC.2016.55}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LuoXTL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MartinS16, author = {Christopher S. Martin and Mohammad R. Salavatipour}, editor = {Seok{-}Hee Hong}, title = {Approximation Algorithms for Capacitated k-Travelling Repairmen Problems}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {56:1--56:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.56}, doi = {10.4230/LIPICS.ISAAC.2016.56}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MartinS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MoriguchiMTT16, author = {Satoko Moriguchi and Kazuo Murota and Akihisa Tamura and Fabio Tardella}, editor = {Seok{-}Hee Hong}, title = {Scaling and Proximity Properties of Integrally Convex Functions}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {57:1--57:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.57}, doi = {10.4230/LIPICS.ISAAC.2016.57}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MoriguchiMTT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Park16, author = {Kunsoo Park}, editor = {Seok{-}Hee Hong}, title = {Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk)}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {2:1--2:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.2}, doi = {10.4230/LIPICS.ISAAC.2016.2}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Park16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SchefferV16, author = {Christian Scheffer and Jan Vahrenhold}, editor = {Seok{-}Hee Hong}, title = {Approximate Shortest Distances Among Smooth Obstacles in 3D}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {60:1--60:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.60}, doi = {10.4230/LIPICS.ISAAC.2016.60}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SchefferV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WangYC16, author = {Te{-}Li Wang and Chih{-}Kuan Yeh and Ho{-}Lin Chen}, editor = {Seok{-}Hee Hong}, title = {An Improved Tax Scheme for Selfish Routing}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {61:1--61:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.61}, doi = {10.4230/LIPICS.ISAAC.2016.61}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/WangYC16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/X16, editor = {Seok{-}Hee Hong}, title = {Front Matter, Table of Contents, Preface, Program Committee, External Reviewers}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {0:i--0:xiv}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.0}, doi = {10.4230/LIPICS.ISAAC.2016.0}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/X16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/XiaoN16, author = {Mingyu Xiao and Hiroshi Nagamochi}, editor = {Seok{-}Hee Hong}, title = {A Linear-Time Algorithm for Integral Multiterminal Flows in Trees}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {62:1--62:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.62}, doi = {10.4230/LIPICS.ISAAC.2016.62}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/XiaoN16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Yamaguchi16, author = {Yutaro Yamaguchi}, editor = {Seok{-}Hee Hong}, title = {Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {63:1--63:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.63}, doi = {10.4230/LIPICS.ISAAC.2016.63}, timestamp = {Wed, 17 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Yamaguchi16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/YuLL16, author = {Hung{-}I Yu and Tien{-}Ching Lin and Der{-}Tsai Lee}, editor = {Seok{-}Hee Hong}, title = {The (1{\(\vert\)}1)-Centroid Problem on the Plane Concerning Distance Constraints}, booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, pages = {64:1--64:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.64}, doi = {10.4230/LIPICS.ISAAC.2016.64}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/YuLL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2016, editor = {Seok{-}Hee Hong}, title = {27th International Symposium on Algorithms and Computation, {ISAAC} 2016, December 12-14, 2016, Sydney, Australia}, series = {LIPIcs}, volume = {64}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {http://www.dagstuhl.de/dagpub/978-3-95977-026-2}, isbn = {978-3-95977-026-2}, timestamp = {Thu, 27 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgarwalFNSW15, author = {Pankaj K. Agarwal and Kyle Fox and Abhinandan Nath and Anastasios Sidiropoulos and Yusu Wang}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Computing the Gromov-Hausdorff Distance for Metric Trees}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {529--540}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_45}, doi = {10.1007/978-3-662-48971-0\_45}, timestamp = {Mon, 02 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AgarwalFNSW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AichholzerKMPW15, author = {Oswin Aichholzer and Vincent Kusters and Wolfgang Mulzer and Alexander Pilz and Manuel Wettstein}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {505--516}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_43}, doi = {10.1007/978-3-662-48971-0\_43}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AichholzerKMPW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AngelBCK15, author = {Eric Angel and Evripidis Bampis and Vincent Chau and Alexander V. Kononov}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Min-Power Covering Problems}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {367--377}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_32}, doi = {10.1007/978-3-662-48971-0\_32}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AngelBCK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ArkinBCCKMS15, author = {Esther M. Arkin and Aritra Banik and Paz Carmi and Gui Citovsky and Matthew J. Katz and Joseph S. B. Mitchell and Marina Simakov}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Choice Is Hard}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {318--328}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_28}, doi = {10.1007/978-3-662-48971-0\_28}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ArkinBCCKMS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ArulselvanCGMM15, author = {Ashwin Arulselvan and {\'{A}}gnes Cseh and Martin Gro{\ss} and David F. Manlove and Jannik Matuschke}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Many-to-one Matchings with Lower Quotas: Algorithms and Complexity}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {176--187}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_16}, doi = {10.1007/978-3-662-48971-0\_16}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ArulselvanCGMM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AshokDK15, author = {Pradeesha Ashok and Aditi Dudeja and Sudeshna Kolay}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Exact and {FPT} Algorithms for Max-Conflict Free Coloring in Hypergraphs}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {271--282}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_24}, doi = {10.1007/978-3-662-48971-0\_24}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AshokDK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BehrischHMS15, author = {Mike Behrisch and Miki Hermann and Stefan Mengel and Gernot Salzer}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Give Me Another One!}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {664--676}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_56}, doi = {10.1007/978-3-662-48971-0\_56}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BehrischHMS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BenderMM0V15, author = {Michael A. Bender and Samuel McCauley and Andrew McGregor and Shikha Singh and Hoa T. Vu}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Run Generation Revisited: What Goes Up May or May Not Come Down}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {703--714}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_59}, doi = {10.1007/978-3-662-48971-0\_59}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BenderMM0V15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BeregFKPSW15, author = {Sergey Bereg and Krzysztof Fleszar and Philipp Kindermann and Sergey Pupyrev and Joachim Spoerhase and Alexander Wolff}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Colored Non-crossing Euclidean Steiner Forest}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {429--441}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_37}, doi = {10.1007/978-3-662-48971-0\_37}, timestamp = {Sun, 04 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BeregFKPSW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BoseFRV15, author = {Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Competitive Local Routing with Constraints}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {23--34}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_3}, doi = {10.1007/978-3-662-48971-0\_3}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BoseFRV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrandtMSW15, author = {Sebastian Brandt and Nicolas Mattia and Jochen Seidel and Roger Wattenhofer}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Toehold {DNA} Languages are Regular}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {780--790}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_65}, doi = {10.1007/978-3-662-48971-0\_65}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BrandtMSW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BringmannK15, author = {Karl Bringmann and Marvin K{\"{u}}nnemann}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Improved Approximation for Fr{\'{e}}chet Distance on c-packed Curves Matching Conditional Lower Bounds}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {517--528}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_44}, doi = {10.1007/978-3-662-48971-0\_44}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BringmannK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BuchinS15, author = {Maike Buchin and Stef Sijben}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Model-Based Classification of Trajectories}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {393--403}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_34}, doi = {10.1007/978-3-662-48971-0\_34}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BuchinS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CarmiC15, author = {Paz Carmi and Lilach Chaitman{-}Yerushalmi}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {On the Minimum Cost Range Assignment Problem}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {95--105}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_9}, doi = {10.1007/978-3-662-48971-0\_9}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CarmiC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CattaneoP15, author = {David Cattan{\'{e}}o and Simon Perdrix}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {259--270}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_23}, doi = {10.1007/978-3-662-48971-0\_23}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CattaneoP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChakrabortyT15, author = {Diptarka Chakraborty and Raghunath Tewari}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {An O(n{\(\epsilon\)} {)} Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {614--624}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_52}, doi = {10.1007/978-3-662-48971-0\_52}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChakrabortyT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChanZ15, author = {Timothy M. Chan and Gelin Zhou}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Multidimensional Range Selection}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {83--92}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_8}, doi = {10.1007/978-3-662-48971-0\_8}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChanZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChangY15, author = {Yi{-}Jun Chang and Hsu{-}Chun Yen}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Unfolding Orthogonal Polyhedra with Linear Refinement}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {415--425}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_36}, doi = {10.1007/978-3-662-48971-0\_36}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChangY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChengCJV15, author = {Siu{-}Wing Cheng and Man{-}Kwun Chiu and Jiongxin Jin and Antoine Vigneron}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Navigating Weighted Regions with Scattered Skinny Tetrahedra}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {35--45}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_4}, doi = {10.1007/978-3-662-48971-0\_4}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChengCJV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChengL15, author = {Siu{-}Wing Cheng and Man{-}Kit Lau}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Adaptive Point Location in Planar Convex Subdivisions}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {14--22}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_2}, doi = {10.1007/978-3-662-48971-0\_2}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChengL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChrobakGMY15, author = {Marek Chrobak and Mordecai J. Golin and J. Ian Munro and Neal E. Young}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Optimal Search Trees with 2-Way Comparisons}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {71--82}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_7}, doi = {10.1007/978-3-662-48971-0\_7}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChrobakGMY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CzyzowiczGKKKT15, author = {Jurek Czyzowicz and Leszek Gasieniec and Adrian Kosowski and Evangelos Kranakis and Danny Krizanc and Najmeh Taleb}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {343--354}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_30}, doi = {10.1007/978-3-662-48971-0\_30}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CzyzowiczGKKKT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DarukiTV15, author = {Samira Daruki and Justin Thaler and Suresh Venkatasubramanian}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Streaming Verification in Data Analysis}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {715--726}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_60}, doi = {10.1007/978-3-662-48971-0\_60}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DarukiTV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/El-ZeinMY15, author = {Hicham El{-}Zein and J. Ian Munro and Siwei Yang}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {On the Succinct Representation of Unlabeled Permutations}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {49--59}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_5}, doi = {10.1007/978-3-662-48971-0\_5}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/El-ZeinMY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ErnstLR15, author = {Matthias Ernst and Maciej Liskiewicz and R{\"{u}}diger Reischuk}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Algorithmic Learning for Steganography: Proper Learning of k-term {DNF} Formulas from Positive Samples}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {151--162}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_14}, doi = {10.1007/978-3-662-48971-0\_14}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ErnstLR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Farach-ColtonT15, author = {Martin Farach{-}Colton and Meng{-}Tsung Tsai}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {On the Complexity of Computing Prime Tables}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {677--688}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_57}, doi = {10.1007/978-3-662-48971-0\_57}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Farach-ColtonT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FeketeSW15, author = {S{\'{a}}ndor P. Fekete and Robert T. Schweller and Andrew Winslow}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {296--306}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_26}, doi = {10.1007/978-3-662-48971-0\_26}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FeketeSW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FennerGMST15, author = {Stephen A. Fenner and Daniel Grier and Jochen Messner and Luke Schaeffer and Thomas Thierauf}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {689--699}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_58}, doi = {10.1007/978-3-662-48971-0\_58}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FennerGMST15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FertinRV15, author = {Guillaume Fertin and Irena Rusu and St{\'{e}}phane Vialette}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Obtaining a Triangular Matrix by Independent Row-Column Permutations}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {165--175}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_15}, doi = {10.1007/978-3-662-48971-0\_15}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FertinRV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FolwarcznyS15, author = {Luk'av{s} Folwarczn'y and Jir{\'{\i}} Sgall}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {General Caching Is Hard: Even with Small Pages}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {116--126}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_11}, doi = {10.1007/978-3-662-48971-0\_11}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FolwarcznyS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Fox-EpsteinHOU15, author = {Eli Fox{-}Epstein and Duc A. Hoang and Yota Otachi and Ryuhei Uehara}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Sliding Token on Bipartite Permutation Graphs}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {237--247}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_21}, doi = {10.1007/978-3-662-48971-0\_21}, timestamp = {Mon, 15 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Fox-EpsteinHOU15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FriedrichKK15, author = {Tobias Friedrich and Maximilian Katzmann and Anton Krohmer}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Unbounded Discrepancy of Deterministic Random Walks on Grids}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {212--222}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_19}, doi = {10.1007/978-3-662-48971-0\_19}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FriedrichKK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FriedrichKKS15, author = {Tobias Friedrich and Timo K{\"{o}}tzing and Martin S. Krejca and Andrew M. Sutton}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {The Benefit of Recombination in Noisy Evolutionary Search}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {140--150}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_13}, doi = {10.1007/978-3-662-48971-0\_13}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FriedrichKKS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FunkeS15, author = {Stefan Funke and Sabine Storandt}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {479--490}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_41}, doi = {10.1007/978-3-662-48971-0\_41}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FunkeS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GallN15, author = {Fran{\c{c}}ois Le Gall and Shogo Nakajima}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Quantum Algorithm for Triangle Finding in Sparse Graphs}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {590--600}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_50}, doi = {10.1007/978-3-662-48971-0\_50}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GallN15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GavenciakGJKK15, author = {Tomas Gavenciak and Przemyslaw Gordinowicz and V{\'{\i}}t Jel{\'{\i}}nek and Pavel Klav{\'{\i}}k and Jan Kratochv{\'{\i}}l}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Cops and Robbers on String Graphs}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {355--366}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_31}, doi = {10.1007/978-3-662-48971-0\_31}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GavenciakGJKK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GhodselahiK15, author = {Abdolhamid Ghodselahi and Fabian Kuhn}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Serving Online Requests with Mobile Servers}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {740--751}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_62}, doi = {10.1007/978-3-662-48971-0\_62}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GhodselahiK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GibsonKW15, author = {Matt Gibson and Erik Krohn and Qing Wang}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {The VC-Dimension of Visibility on the Boundary of a Simple Polygon}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {541--551}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_46}, doi = {10.1007/978-3-662-48971-0\_46}, timestamp = {Tue, 09 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GibsonKW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolovachHKKSV15, author = {Petr A. Golovach and Pinar Heggernes and Mamadou Moustapha Kant{\'{e}} and Dieter Kratsch and Sigve Hortemo S{\ae}ther and Yngve Villanger}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {248--258}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_22}, doi = {10.1007/978-3-662-48971-0\_22}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GolovachHKKSV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GrochowQ15, author = {Joshua A. Grochow and Youming Qiao}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract)}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {578--589}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_49}, doi = {10.1007/978-3-662-48971-0\_49}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GrochowQ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GuX15, author = {Qian{-}Ping Gu and Gengchun Xu}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Constant Query Time (1+{\textbackslash}epsilon {)} -Approximate Distance Oracle for Planar Graphs}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {625--636}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_53}, doi = {10.1007/978-3-662-48971-0\_53}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GuX15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HlinenyS15, author = {Petr Hlinen{\'{y}} and Gelasio Salazar}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {On Hardness of the Joint Crossing Number}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {603--613}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_51}, doi = {10.1007/978-3-662-48971-0\_51}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HlinenyS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HonTX15, author = {Wing{-}Kai Hon and Sharma V. Thankachan and Bojian Xu}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {An In-place Framework for Exact and Approximate Shortest Unique Substring Queries}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {755--767}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_63}, doi = {10.1007/978-3-662-48971-0\_63}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HonTX15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HuangLSZ15, author = {Qin Huang and Xingwu Liu and Xiaoming Sun and Jialin Zhang}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {How to Select the Top k Elements from Evolving Data?}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {60--70}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_6}, doi = {10.1007/978-3-662-48971-0\_6}, timestamp = {Wed, 26 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HuangLSZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItsyksonKS15, author = {Dmitry Itsykson and Alexander Knop and Dmitry Sokolov}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Heuristic Time Hierarchies via Hierarchies for Sampling Distributions}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {201--211}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_18}, doi = {10.1007/978-3-662-48971-0\_18}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ItsyksonKS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KamaliL15, author = {Shahin Kamali and Alejandro L{\'{o}}pez{-}Ortiz}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {All-Around Near-Optimal Solutions for the Online Bin Packing Problem}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {727--739}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_61}, doi = {10.1007/978-3-662-48971-0\_61}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KamaliL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Kawase15, author = {Yasushi Kawase}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {The Secretary Problem with a Choice Function}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {129--139}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_12}, doi = {10.1007/978-3-662-48971-0\_12}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Kawase15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KhramtcovaP15, author = {Elena Khramtcova and Evanthia Papadopoulou}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {404--414}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_35}, doi = {10.1007/978-3-662-48971-0\_35}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KhramtcovaP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KolmogorovRT15, author = {Vladimir Kolmogorov and Michal Rol{\'{\i}}nek and Rustem Takhanov}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Effectiveness of Structural Restrictions for Hybrid CSPs}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {566--577}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_48}, doi = {10.1007/978-3-662-48971-0\_48}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KolmogorovRT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiuM15, author = {Chih{-}Hung Liu and Sandro Montanari}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Minimizing the Diameter of a Spanning Tree for Imprecise Points}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {381--392}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_33}, doi = {10.1007/978-3-662-48971-0\_33}, timestamp = {Tue, 14 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiuM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LoozMP15, author = {Moritz von Looz and Henning Meyerhenke and Roman Prutkin}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Generating Random Hyperbolic Graphs in Subquadratic Time}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {467--478}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_40}, doi = {10.1007/978-3-662-48971-0\_40}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LoozMP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MastinJC15, author = {Andrew Mastin and Patrick Jaillet and Sang Chin}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {491--501}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_42}, doi = {10.1007/978-3-662-48971-0\_42}, timestamp = {Thu, 29 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MastinJC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NishidaIIBT15, author = {Makoto Nishida and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Inferring Strings from Full Abelian Periods}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {768--779}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_64}, doi = {10.1007/978-3-662-48971-0\_64}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/NishidaIIBT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NollenburgPR15, author = {Martin N{\"{o}}llenburg and Roman Prutkin and Ignaz Rutter}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {637--649}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_54}, doi = {10.1007/978-3-662-48971-0\_54}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/NollenburgPR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/OhCA15, author = {Eunjin Oh and Jean{-}Lou De Carufel and Hee{-}Kap Ahn}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {The 2-Center Problem in a Simple Polygon}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {307--317}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_27}, doi = {10.1007/978-3-662-48971-0\_27}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/OhCA15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PontecorviR15, author = {Matteo Pontecorvi and Vijaya Ramachandran}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Fully Dynamic Betweenness Centrality}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {331--342}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_29}, doi = {10.1007/978-3-662-48971-0\_29}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/PontecorviR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SaettlerLC15, author = {Aline Medeiros Saettler and Eduardo Sany Laber and Ferdinando Cicalese}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Trading off Worst and Expected Cost in Decision Tree Problems}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {223--234}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_20}, doi = {10.1007/978-3-662-48971-0\_20}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SaettlerLC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Skorski15, author = {Maciej Sk{\'{o}}rski}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {A New Approximate Min-Max Theorem with Applications in Cryptography}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {653--663}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_55}, doi = {10.1007/978-3-662-48971-0\_55}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Skorski15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Storandt15, author = {Sabine Storandt}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Approximation Algorithms in the Successive Hitting Set Model}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {453--464}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_39}, doi = {10.1007/978-3-662-48971-0\_39}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Storandt15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/TirodkarV15, author = {Sumedh Tirodkar and Sundar Vishwanathan}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {106--115}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_10}, doi = {10.1007/978-3-662-48971-0\_10}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/TirodkarV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WangZ15, author = {Haitao Wang and Xiao Zhang}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Minimizing the Maximum Moving Cost of Interval Coverage}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {188--198}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_17}, doi = {10.1007/978-3-662-48971-0\_17}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/WangZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Winslow15, author = {Andrew Winslow}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {An Optimal Algorithm for Tiling the Plane with a Translated Polyomino}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {3--13}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_1}, doi = {10.1007/978-3-662-48971-0\_1}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Winslow15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Xiao15, author = {Mingyu Xiao}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {On a Generalization of Nemhauser and Trotter's Local Optimization Theorem}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {442--452}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_38}, doi = {10.1007/978-3-662-48971-0\_38}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Xiao15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/YanWLQ15, author = {Jun Yan and Jian Weng and Dongdai Lin and Yujuan Quan}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {555--565}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_47}, doi = {10.1007/978-3-662-48971-0\_47}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/YanWLQ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/YoonKSA15, author = {Sang Duk Yoon and Min{-}Gyu Kim and Wanbin Son and Hee{-}Kap Ahn}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Geometric Matching Algorithms for Two Realistic Terrains}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {285--295}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_25}, doi = {10.1007/978-3-662-48971-0\_25}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/YoonKSA15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2015, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0}, doi = {10.1007/978-3-662-48971-0}, isbn = {978-3-662-48970-3}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Abu-KhzamBCF14, author = {Faisal N. Abu{-}Khzam and Cristina Bazgan and Morgan Chopin and Henning Fernau}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Approximation Algorithms Inspired by Kernelization Methods}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {479--490}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_38}, doi = {10.1007/978-3-319-13075-0\_38}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Abu-KhzamBCF14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AichholzerCKLV14, author = {Oswin Aichholzer and Jean Cardinal and Vincent Kusters and Stefan Langerman and Pavel Valtr}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Reconstructing Point Set Order Typesfrom Radial Orderings}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {15--26}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_2}, doi = {10.1007/978-3-319-13075-0\_2}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AichholzerCKLV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AndoK14, author = {Ei Ando and Shuji Kijima}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {An {FPTAS} for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {376--386}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_30}, doi = {10.1007/978-3-319-13075-0\_30}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AndoK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AngelBCT14, author = {Eric Angel and Evripidis Bampis and Vincent Chau and Kim Thang Nguyen}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Throughput Maximization in Multiprocessor Speed-Scaling}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {247--258}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_20}, doi = {10.1007/978-3-319-13075-0\_20}, timestamp = {Tue, 01 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AngelBCT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ArulselvanGS14, author = {Ashwin Arulselvan and Martin Gro{\ss} and Martin Skutella}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Graph Orientation and Flows over Time}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {741--752}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_58}, doi = {10.1007/978-3-319-13075-0\_58}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ArulselvanGS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AsanoIKKOOSTU14, author = {Tetsuo Asano and Taisuke Izumi and Masashi Kiyomi and Matsuo Konagaya and Hirotaka Ono and Yota Otachi and Pascal Schweitzer and Jun Tarui and Ryuhei Uehara}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Depth-First Search Using O(n) Bits}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {553--564}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_44}, doi = {10.1007/978-3-319-13075-0\_44}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AsanoIKKOOSTU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AuroraM14, author = {Pawan Aurora and Shashank K. Mehta}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {A Geometric Approach to Graph Isomorphism}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {674--685}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_53}, doi = {10.1007/978-3-319-13075-0\_53}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AuroraM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BampisLL14, author = {Evripidis Bampis and Dimitrios Letsios and Giorgio Lucarelli}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Speed-Scaling with No Preemptions}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {259--269}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_21}, doi = {10.1007/978-3-319-13075-0\_21}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BampisLL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BeckerK14, author = {Ruben Becker and Andreas Karrenbauer}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {A Simple Efficient Interior Point Method for Min-Cost Flow}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {753--765}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_59}, doi = {10.1007/978-3-319-13075-0\_59}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BeckerK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BiedlHP14, author = {Therese Biedl and Stefan Huber and Peter Palfrader}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Planar Matchings for Weighted Straight Skeletons}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {117--127}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_10}, doi = {10.1007/978-3-319-13075-0\_10}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BiedlHP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BohlerLPZ14, author = {Cecilia Bohler and Chih{-}Hung Liu and Evanthia Papadopoulou and Maksym Zavershynskyi}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {27--37}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_3}, doi = {10.1007/978-3-319-13075-0\_3}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BohlerLPZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BoseDIL14, author = {Prosenjit Bose and Karim Dou{\"{\i}}eb and John Iacono and Stefan Langerman}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {The Power and Limitations of Static Binary Search Trees with Lazy Finger}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {181--192}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_15}, doi = {10.1007/978-3-319-13075-0\_15}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BoseDIL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BoseMR14, author = {Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {The Price of Order}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {313--325}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_25}, doi = {10.1007/978-3-319-13075-0\_25}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BoseMR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BulteauFHN14, author = {Laurent Bulteau and Vincent Froese and Sepp Hartung and Rolf Niedermeier}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Co-Clustering Under the Maximum Norm}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {298--309}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_24}, doi = {10.1007/978-3-319-13075-0\_24}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BulteauFHN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChengE14, author = {Zhanpeng Cheng and David Eppstein}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Linear-Time Algorithms for Proportional Apportionment}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {581--592}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_46}, doi = {10.1007/978-3-319-13075-0\_46}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChengE14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CrochemoreIKRRW14, author = {Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Covering Problems for Partial Words and for Indeterminate Strings}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {220--232}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_18}, doi = {10.1007/978-3-319-13075-0\_18}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CrochemoreIKRRW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DahlgaardKR14, author = {S{\o}ren Dahlgaard and Mathias B{\ae}k Tejs Knudsen and Noy Rotbart}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Dynamic and Multi-Functional Labeling Schemes}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {141--153}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_12}, doi = {10.1007/978-3-319-13075-0\_12}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DahlgaardKR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DemaineDFHIOOUY14, author = {Erik D. Demaine and Martin L. Demaine and Eli Fox{-}Epstein and Duc A. Hoang and Takehiro Ito and Hirotaka Ono and Yota Otachi and Ryuhei Uehara and Takeshi Yamada}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Polynomial-Time Algorithm for Sliding Tokens on Trees}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {389--400}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_31}, doi = {10.1007/978-3-319-13075-0\_31}, timestamp = {Mon, 15 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DemaineDFHIOOUY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DomanicP14, author = {Nevzat Onur Domani{\c{c}} and C. Gregory Plaxton}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {646--657}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_51}, doi = {10.1007/978-3-319-13075-0\_51}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DomanicP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DrangeDH14, author = {P{\aa}l Gr{\o}n{\aa}s Drange and Markus Sortland Dregi and Pim van 't Hof}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {On the Computational Complexity of Vertex Integrity and Component Order Connectivity}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {285--297}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_23}, doi = {10.1007/978-3-319-13075-0\_23}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DrangeDH14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DroschinskyHKM14, author = {Andre Droschinsky and Bernhard Heinemann and Nils M. Kriege and Petra Mutzel}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {81--93}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_7}, doi = {10.1007/978-3-319-13075-0\_7}, timestamp = {Tue, 02 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DroschinskyHKM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/El-ZeinMR14, author = {Hicham El{-}Zein and J. Ian Munro and Venkatesh Raman}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {543--552}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_43}, doi = {10.1007/978-3-319-13075-0\_43}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/El-ZeinMR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FelsnerP14, author = {Stefan Felsner and Alexander Pilz}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Ham-Sandwich Cuts for Abstract Order Types}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {726--737}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_57}, doi = {10.1007/978-3-319-13075-0\_57}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FelsnerP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FloderusJLLS14, author = {Peter Floderus and Jesper Jansson and Christos Levcopoulos and Andrzej Lingas and Dzmitry Sledneu}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {3D Rectangulations and Geometric Matrix Multiplication}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {65--78}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_6}, doi = {10.1007/978-3-319-13075-0\_6}, timestamp = {Tue, 17 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FloderusJLLS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FongLLYY14, author = {Ken C. K. Fong and Minming Li and Hongyu Liang and Linji Yang and Hao Yuan}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Average-Case Complexity of the Min-Sum Matrix Product Problem}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {41--52}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_4}, doi = {10.1007/978-3-319-13075-0\_4}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FongLLYY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GajarskyHOO14, author = {Jakub Gajarsk{\'{y}} and Petr Hlinen{\'{y}} and Jan Obdrz{\'{a}}lek and Sebastian Ordyniak}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Faster Existential {FO} Model Checking on Posets}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {441--451}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_35}, doi = {10.1007/978-3-319-13075-0\_35}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GajarskyHOO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GasieniecLL14, author = {Leszek Gasieniec and Christos Levcopoulos and Andrzej Lingas}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Efficiently Correcting Matrix Products}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {53--64}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_5}, doi = {10.1007/978-3-319-13075-0\_5}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GasieniecLL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GavruskinKKL14, author = {Alexander Gavruskin and Bakhadyr Khoussainov and Mikhail Kokho and Jiamou Liu}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Dynamic Interval Scheduling for Multiple Machines}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {235--246}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_19}, doi = {10.1007/978-3-319-13075-0\_19}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GavruskinKKL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GawrychowskiR14, author = {Pawel Gawrychowski and Damian Rusak}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Euclidean {TSP} with Few Inner Points in Linear Space}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {701--713}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_55}, doi = {10.1007/978-3-319-13075-0\_55}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GawrychowskiR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GhoshalNN14, author = {Pratik Ghosal and Meghana Nasre and Prajakta Nimbhorkar}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Rank-Maximal Matchings - Structure and Algorithms}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {593--605}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_47}, doi = {10.1007/978-3-319-13075-0\_47}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GhoshalNN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GutowskiKMZ14, author = {Grzegorz Gutowski and Jakub Kozik and Piotr Micek and Xuding Zhu}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Lower Bounds for On-line Graph Colorings}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {507--515}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_40}, doi = {10.1007/978-3-319-13075-0\_40}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GutowskiKMZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HeMZ14, author = {Meng He and J. Ian Munro and Gelin Zhou}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Dynamic Path Counting and Reporting in Linear Space}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {565--577}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_45}, doi = {10.1007/978-3-319-13075-0\_45}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HeMZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HeTZ14, author = {Meng He and Ganggui Tang and Norbert Zeh}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {128--140}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_11}, doi = {10.1007/978-3-319-13075-0\_11}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HeTZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HenzeJ14, author = {Matthias Henze and Rafel Jaume}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Bottleneck Partial-Matching Voronoi Diagrams and Applications}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {714--725}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_56}, doi = {10.1007/978-3-319-13075-0\_56}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HenzeJ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HuangB14, author = {Norman Huang and Allan Borodin}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {528--539}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_42}, doi = {10.1007/978-3-319-13075-0\_42}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HuangB14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/InoueM14, author = {Yuma Inoue and Shin{-}ichi Minato}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {An Efficient Method for Indexing All Topological Orders of a Directed Graph}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {103--114}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_9}, doi = {10.1007/978-3-319-13075-0\_9}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/InoueM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItoKKKO14, author = {Takehiro Ito and Naonori Kakimura and Naoyuki Kamiyama and Yusuke Kobayashi and Yoshio Okamoto}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Minimum-Cost b -Edge Dominating Sets on Trees}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {195--207}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_16}, doi = {10.1007/978-3-319-13075-0\_16}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ItoKKKO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItoKO14, author = {Takehiro Ito and Marcin Jakub Kaminski and Hirotaka Ono}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Fixed-Parameter Tractability of Token Jumping on Planar Graphs}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {208--219}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_17}, doi = {10.1007/978-3-319-13075-0\_17}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ItoKO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JanssonSVY14, author = {Jesper Jansson and Wing{-}Kin Sung and Hoa Vu and Siu{-}Ming Yiu}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Faster Algorithms for Computing the R* Consensus Tree}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {414--425}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_33}, doi = {10.1007/978-3-319-13075-0\_33}, timestamp = {Tue, 17 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/JanssonSVY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JiangFZ14, author = {Haitao Jiang and Haodi Feng and Daming Zhu}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {491--503}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_39}, doi = {10.1007/978-3-319-13075-0\_39}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/JiangFZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Kane014, author = {Daniel M. Kane and Osamu Watanabe}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {A Short Implicant of a {CNF} Formula with Many Satisfying Assignments}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {273--284}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_22}, doi = {10.1007/978-3-319-13075-0\_22}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Kane014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KlavikS14, author = {Pavel Klav{\'{\i}}k and Maria Saumell}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Minimal Obstructions for Partial Representations of Interval Graphs}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {401--413}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_32}, doi = {10.1007/978-3-319-13075-0\_32}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KlavikS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KolevS14, author = {Pavel Kolev and He Sun}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {621--632}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_49}, doi = {10.1007/978-3-319-13075-0\_49}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KolevS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LehreW14, author = {Per Kristian Lehre and Carsten Witt}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {686--697}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_54}, doi = {10.1007/978-3-319-13075-0\_54}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LehreW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiW14, author = {Jian Li and Haitao Wang}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Range Queries on Uncertain Data}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {326--337}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_26}, doi = {10.1007/978-3-319-13075-0\_26}, timestamp = {Sat, 06 Jan 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/LiW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiZ14, author = {Xingfu Li and Daming Zhu}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {467--478}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_37}, doi = {10.1007/978-3-319-13075-0\_37}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LozzoJKR14, author = {Giordano Da Lozzo and V{\'{\i}}t Jel{\'{\i}}nek and Jan Kratochv{\'{\i}}l and Ignaz Rutter}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Planar Embeddings with Small and Uniform Faces}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {633--645}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_50}, doi = {10.1007/978-3-319-13075-0\_50}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LozzoJKR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MatsuiKKT14, author = {Tomomi Matsui and Yukihide Kohira and Chikaaki Kodama and Atsushi Takahashi}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {365--375}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_29}, doi = {10.1007/978-3-319-13075-0\_29}, timestamp = {Mon, 01 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MatsuiKKT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MicekW14, author = {Piotr Micek and Veit Wiechert}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {An On-line Competitive Algorithm for Coloring P{\_}8 -free Bipartite Graphs}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {516--527}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_41}, doi = {10.1007/978-3-319-13075-0\_41}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MicekW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MouawadNR14, author = {Amer E. Mouawad and Naomi Nishimura and Venkatesh Raman}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Vertex Cover Reconfiguration and Beyond}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {452--463}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_36}, doi = {10.1007/978-3-319-13075-0\_36}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MouawadNR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MunroNNST14, author = {J. Ian Munro and Gonzalo Navarro and Jesper Sindahl Nielsen and Rahul Shah and Sharma V. Thankachan}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Top- k Term-Proximity in Succinct Space}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {169--180}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_14}, doi = {10.1007/978-3-319-13075-0\_14}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MunroNNST14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NasrePR14, author = {Meghana Nasre and Matteo Pontecorvi and Vijaya Ramachandran}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Decremental All-Pairs {ALL} Shortest Paths and Betweenness Centrality}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {766--778}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_60}, doi = {10.1007/978-3-319-13075-0\_60}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/NasrePR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PolicritiP14, author = {Alberto Policriti and Nicola Prezza}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Hashing and Indexing: Succinct DataStructures and Smoothed Analysis}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {157--168}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_13}, doi = {10.1007/978-3-319-13075-0\_13}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/PolicritiP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SunZZ14, author = {Xiaoming Sun and Jia Zhang and Jialin Zhang}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {661--673}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_52}, doi = {10.1007/978-3-319-13075-0\_52}, timestamp = {Wed, 26 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SunZZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SuriV14, author = {Subhash Suri and Kevin Verbeek}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {On the Most Likely Voronoi Diagramand Nearest Neighbor Searching}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {338--350}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_27}, doi = {10.1007/978-3-319-13075-0\_27}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SuriV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/TongL14, author = {Weitian Tong and Guohui Lin}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {353--364}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_28}, doi = {10.1007/978-3-319-13075-0\_28}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/TongL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WangZ14, author = {Haitao Wang and Jingru Zhang}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Line-Constrained k -Median, k -Means, and k -Center Problems in the Plane}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {3--14}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_1}, doi = {10.1007/978-3-319-13075-0\_1}, timestamp = {Thu, 29 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/WangZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WasaAU14, author = {Kunihiro Wasa and Hiroki Arimura and Takeaki Uno}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {94--102}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_8}, doi = {10.1007/978-3-319-13075-0\_8}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/WasaAU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WuLWC14, author = {Yen{-}Wei Wu and Wei{-}Yin Lin and Hung{-}Lung Wang and Kun{-}Mao Chao}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {The Generalized Popular Condensation Problem}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {606--617}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_48}, doi = {10.1007/978-3-319-13075-0\_48}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/WuLWC14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/XiaoN14, author = {Mingyu Xiao and Hiroshi Nagamochi}, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs}, booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, pages = {429--440}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0\_34}, doi = {10.1007/978-3-319-13075-0\_34}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/XiaoN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2014, editor = {Hee{-}Kap Ahn and Chan{-}Su Shin}, title = {Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8889}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13075-0}, doi = {10.1007/978-3-319-13075-0}, isbn = {978-3-319-13074-3}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/0002PL13, author = {Matthew Johnson and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {130--140}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_13}, doi = {10.1007/978-3-642-45030-3\_13}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/0002PL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AichholzerHKPV13, author = {Oswin Aichholzer and Thomas Hackl and Matias Korman and Alexander Pilz and Birgit Vogtenhuber}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Geodesic-Preserving Polygon Simplification}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {11--21}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_2}, doi = {10.1007/978-3-642-45030-3\_2}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AichholzerHKPV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AmirP13, author = {Amihood Amir and Benny Porat}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {55--65}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_6}, doi = {10.1007/978-3-642-45030-3\_6}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AmirP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AngeliniBR13, author = {Patrizio Angelini and Thomas Bl{\"{a}}sius and Ignaz Rutter}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Testing Mutual Duality of Planar Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {350--360}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_33}, doi = {10.1007/978-3-642-45030-3\_33}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AngeliniBR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AngeliniEFG13, author = {Patrizio Angelini and William S. Evans and Fabrizio Frati and Joachim Gudmundsson}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {{SEFE} with No Mapping via Large Induced Outerplane Graphs in Plane Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {185--195}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_18}, doi = {10.1007/978-3-642-45030-3\_18}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AngeliniEFG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ArgeT13, author = {Lars Arge and Mikkel Thorup}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {RAM-Efficient External Memory Sorting}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {491--501}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_46}, doi = {10.1007/978-3-642-45030-3\_46}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ArgeT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AurenhammerW13, author = {Franz Aurenhammer and Gernot Walzl}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Structure and Computation of Straight Skeletons in 3-Space}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {44--54}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_5}, doi = {10.1007/978-3-642-45030-3\_5}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AurenhammerW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BaiouBLL13, author = {Mourad Ba{\"{\i}}ou and Laurent Beaudou and Zhentao Li and Vincent Limouzy}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Hardness and Algorithms for Variants of Line Graphs of Directed Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {196--206}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_19}, doi = {10.1007/978-3-642-45030-3\_19}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BaiouBLL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BalkoKO13, author = {Martin Balko and Pavel Klav{\'{\i}}k and Yota Otachi}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Bounded Representations of Interval and Proper Interval Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {535--546}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_50}, doi = {10.1007/978-3-642-45030-3\_50}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BalkoKO13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BelazzouguiPRV13, author = {Djamal Belazzougui and Adeline Pierrot and Mathieu Raffinot and St{\'{e}}phane Vialette}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Single and Multiple Consecutive Permutation Motif Search}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {66--77}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_7}, doi = {10.1007/978-3-642-45030-3\_7}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BelazzouguiPRV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BeregHKPT13, author = {Sergey Bereg and Seok{-}Hee Hong and Naoki Katoh and Sheung{-}Hung Poon and Shin{-}ichi Tanigawa}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {33--43}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_4}, doi = {10.1007/978-3-642-45030-3\_4}, timestamp = {Thu, 27 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BeregHKPT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BevernFGR13, author = {Ren{\'{e}} van Bevern and Michael R. Fellows and Serge Gaspers and Frances A. Rosamond}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Myhill-Nerode Methods for Hypergraphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {372--382}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_35}, doi = {10.1007/978-3-642-45030-3\_35}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BevernFGR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BohlerK13, author = {Cecilia Bohler and Rolf Klein}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Abstract Voronoi Diagrams with Disconnected Regions}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {306--316}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_29}, doi = {10.1007/978-3-642-45030-3\_29}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BohlerK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BredereckHNW13, author = {Robert Bredereck and Sepp Hartung and Andr{\'{e}} Nichterlein and Gerhard J. Woeginger}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {The Complexity of Finding a Large Subgraph under Anonymity Constraints}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {152--162}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_15}, doi = {10.1007/978-3-642-45030-3\_15}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BredereckHNW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BuchinG13, author = {Kevin Buchin and Dirk H. P. Gerrits}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Dynamic Point Labeling is Strongly PSPACE-Complete}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {262--272}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_25}, doi = {10.1007/978-3-642-45030-3\_25}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BuchinG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CaiD13, author = {Xing Shi Cai and Luc Devroye}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {A Probabilistic Analysis of Kademlia Networks}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {711--721}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_66}, doi = {10.1007/978-3-642-45030-3\_66}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CaiD13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChanMR13, author = {Timothy M. Chan and J. Ian Munro and Venkatesh Raman}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {405--412}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_38}, doi = {10.1007/978-3-642-45030-3\_38}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChanMR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenGHI13, author = {Jing Chen and He Guo and Xin Han and Kazuo Iwama}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {The Train Delivery Problem Revisited}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {601--611}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_56}, doi = {10.1007/978-3-642-45030-3\_56}, timestamp = {Tue, 21 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenGHI13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenKNSSW13, author = {Jiehua Chen and Christian Komusiewicz and Rolf Niedermeier and Manuel Sorge and Ondrej Such{\'{y}} and Mathias Weller}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Effective and Efficient Data Reduction for the Subset Interconnection Design Problem}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {361--371}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_34}, doi = {10.1007/978-3-642-45030-3\_34}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenKNSSW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChengLZ13, author = {Qi Cheng and Jiyou Li and Jincheng Zhuang}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {On Determining Deep Holes of Generalized Reed-Solomon Codes}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {100--110}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_10}, doi = {10.1007/978-3-642-45030-3\_10}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChengLZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CheongHKK13, author = {Otfried Cheong and Sariel Har{-}Peled and Heuna Kim and Hyo{-}Sil Kim}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {On the Number of Edges of Fan-Crossing Free Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {163--173}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_16}, doi = {10.1007/978-3-642-45030-3\_16}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CheongHKK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChunGT13, author = {Jinhee Chun and Ricardo Garcia de Gonzalo and Takeshi Tokuyama}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {22--32}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_3}, doi = {10.1007/978-3-642-45030-3\_3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChunGT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DasFKSVW13, author = {Aparna Das and Krzysztof Fleszar and Stephen G. Kobourov and Joachim Spoerhase and Sankar Veeramoni and Alexander Wolff}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Approximating the Generalized Minimum Manhattan Network Problem}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {722--732}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_67}, doi = {10.1007/978-3-642-45030-3\_67}, timestamp = {Sun, 04 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DasFKSVW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Etscheid13, author = {Michael Etscheid}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {207--217}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_20}, doi = {10.1007/978-3-642-45030-3\_20}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Etscheid13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FanLZ13, author = {Chenglin Fan and Jun Luo and Binhai Zhu}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Tight Approximation Bounds for Connectivity with a Color-Spanning Set}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {590--600}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_55}, doi = {10.1007/978-3-642-45030-3\_55}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FanLZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Farach-ColtonT13, author = {Martin Farach{-}Colton and Meng{-}Tsung Tsai}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Exact Sublinear Binomial Sampling}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {240--250}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_23}, doi = {10.1007/978-3-642-45030-3\_23}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Farach-ColtonT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FloderusKLL13, author = {Peter Floderus and Miroslaw Kowaluk and Andrzej Lingas and Eva{-}Marta Lundell}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Detecting and Counting Small Pattern Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {547--557}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_51}, doi = {10.1007/978-3-642-45030-3\_51}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FloderusKLL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FraserHKLMN13, author = {Robert Fraser and Meng He and Akitoshi Kawamura and Alejandro L{\'{o}}pez{-}Ortiz and J. Ian Munro and Patrick K. Nicholson}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {The Distance 4-Sector of Two Points Is Unique}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {612--622}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_57}, doi = {10.1007/978-3-642-45030-3\_57}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FraserHKLMN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FratiGGM13, author = {Fabrizio Frati and Serge Gaspers and Joachim Gudmundsson and Luke Mathieson}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Augmenting Graphs to Minimize the Diameter}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {383--393}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_36}, doi = {10.1007/978-3-642-45030-3\_36}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FratiGGM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FrederiksenM13, author = {S{\o}ren Kristoffer Stiil Frederiksen and Peter Bro Miltersen}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {457--467}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_43}, doi = {10.1007/978-3-642-45030-3\_43}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FrederiksenM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GavenciakJKK13, author = {Tomas Gavenciak and V{\'{\i}}t Jel{\'{\i}}nek and Pavel Klav{\'{\i}}k and Jan Kratochv{\'{\i}}l}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Cops and Robbers on Intersection Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {174--184}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_17}, doi = {10.1007/978-3-642-45030-3\_17}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GavenciakJKK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GawrychowskiS13, author = {Pawel Gawrychowski and Damian Straszak}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Beating {\textdollar}{\textbackslash}mathcal\{O\}(nm){\textdollar} in Approximate LZW-Compressed Pattern Matching}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {78--88}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_8}, doi = {10.1007/978-3-642-45030-3\_8}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GawrychowskiS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GemsaNN13, author = {Andreas Gemsa and Benjamin Niedermann and Martin N{\"{o}}llenburg}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Trajectory-Based Dynamic Map Labeling}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {413--423}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_39}, doi = {10.1007/978-3-642-45030-3\_39}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GemsaNN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HoriyamaS13, author = {Takashi Horiyama and Wataru Shoji}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {The Number of Different Unfoldings of Polyhedra}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {623--633}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_58}, doi = {10.1007/978-3-642-45030-3\_58}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HoriyamaS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HurtadoLMSSSS13, author = {Ferran Hurtado and Maarten L{\"{o}}ffler and In{\^{e}}s Matos and Vera Sacrist{\'{a}}n and Maria Saumell and Rodrigo I. Silveira and Frank Staals}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Terrain Visibility with Multiple Viewpoints}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {317--327}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_30}, doi = {10.1007/978-3-642-45030-3\_30}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HurtadoLMSSSS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JohnsenKS13, author = {Aleck C. Johnsen and Ming{-}Yang Kao and Shinnosuke Seki}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Computing Minimum Tile Sets to Self-Assemble Color Patterns}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {699--710}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_65}, doi = {10.1007/978-3-642-45030-3\_65}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/JohnsenKS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KamousiS13, author = {Pegah Kamousi and Subhash Suri}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Euclidean Traveling Salesman Tours through Stochastic Neighborhoods}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {644--654}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_60}, doi = {10.1007/978-3-642-45030-3\_60}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KamousiS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KanteLMNU13, author = {Mamadou Moustapha Kant{\'{e}} and Vincent Limouzy and Arnaud Mary and Lhouari Nourine and Takeaki Uno}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {339--349}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_32}, doi = {10.1007/978-3-642-45030-3\_32}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KanteLMNU13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KarpinskiLS13, author = {Marek Karpinski and Michael Lampis and Richard Schmied}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {New Inapproximability Bounds for {TSP}}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {568--578}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_53}, doi = {10.1007/978-3-642-45030-3\_53}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KarpinskiLS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KawaharaKM13, author = {Jun Kawahara and Koji M. Kobayashi and Shuichi Miyazaki}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Better Bounds for Online k-Frame Throughput Maximization in Network Switches}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {218--228}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_21}, doi = {10.1007/978-3-642-45030-3\_21}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KawaharaKM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KawaseHM13, author = {Yasushi Kawase and Xin Han and Kazuhisa Makino}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Unit Cost Buyback Problem}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {435--445}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_41}, doi = {10.1007/978-3-642-45030-3\_41}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KawaseHM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KerberS13, author = {Michael Kerber and R. Sharathkumar}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Approximate {\v{C}}ech Complex in Low and High Dimensions}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {666--676}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_62}, doi = {10.1007/978-3-642-45030-3\_62}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KerberS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KhanteimouriMAK13, author = {Payam Khanteimouri and Ali Mohades and Mohammad Ali Abam and Mohammad Reza Kazemi}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Computing the Smallest Color-Spanning Axis-Parallel Square}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {634--643}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_59}, doi = {10.1007/978-3-642-45030-3\_59}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KhanteimouriMAK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KleinS13, author = {Kyle Klein and Subhash Suri}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Pursuit Evasion on Polyhedral Surfaces}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {284--294}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_27}, doi = {10.1007/978-3-642-45030-3\_27}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KleinS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KrushevskajaM13, author = {Darja Krushevskaja and S. Muthukrishnan}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Market Approach to Social Ads: The MyLikes Example and Related Problems}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {1--10}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_1}, doi = {10.1007/978-3-642-45030-3\_1}, timestamp = {Tue, 11 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KrushevskajaM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LelargeZ13, author = {Marc Lelarge and Hang Zhou}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {141--151}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_14}, doi = {10.1007/978-3-642-45030-3\_14}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LelargeZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LewensteinMR13, author = {Moshe Lewenstein and J. Ian Munro and Venkatesh Raman}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Succinct Data Structures for Representing Equivalence Classes}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {502--512}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_47}, doi = {10.1007/978-3-642-45030-3\_47}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LewensteinMR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LewensteinMRT13, author = {Moshe Lewenstein and J. Ian Munro and Venkatesh Raman and Sharma V. Thankachan}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Less Space: Indexing for Queries with Wildcards}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {89--99}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_9}, doi = {10.1007/978-3-642-45030-3\_9}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LewensteinMRT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiP13, author = {Angsheng Li and Pan Peng}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {655--665}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_61}, doi = {10.1007/978-3-642-45030-3\_61}, timestamp = {Fri, 13 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LinMS13, author = {Min Chih Lin and Michel J. Mizrahi and Jayme Luiz Szwarcfiter}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {An {O} *(1.1939 n {)} Time Algorithm for Minimum Weighted Dominating Induced Matching}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {558--567}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_52}, doi = {10.1007/978-3-642-45030-3\_52}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LinMS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MantheyV13, author = {Bodo Manthey and Rianne Veenstra}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Smoothed Analysis of the 2-Opt Heuristic for the {TSP:} Polynomial Bounds for Gaussian Noise}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {579--589}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_54}, doi = {10.1007/978-3-642-45030-3\_54}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MantheyV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MulzerS13, author = {Wolfgang Mulzer and Yannik Stein}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Algorithms for Tolerated Tverberg Partitions}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {295--305}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_28}, doi = {10.1007/978-3-642-45030-3\_28}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MulzerS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MurotaSY13, author = {Kazuo Murota and Akiyoshi Shioura and Zaifu Yang}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {468--478}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_44}, doi = {10.1007/978-3-642-45030-3\_44}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MurotaSY13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NaorY13, author = {Moni Naor and Eylon Yogev}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Sliding Bloom Filters}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {513--523}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_48}, doi = {10.1007/978-3-642-45030-3\_48}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/NaorY13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NavarroT13, author = {Gonzalo Navarro and Sharma V. Thankachan}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Top-k Document Retrieval in Compact Space and Near-Optimal Time}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {394--404}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_37}, doi = {10.1007/978-3-642-45030-3\_37}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/NavarroT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/OtachiS13, author = {Yota Otachi and Pascal Schweitzer}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Isomorphism on Subgraph-Closed Graph Classes: {A} Complexity Dichotomy and Intermediate Graph Classes}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {111--118}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_11}, doi = {10.1007/978-3-642-45030-3\_11}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/OtachiS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PanagiotouPS13, author = {Konstantinos Panagiotou and Ali Pourmiri and Thomas Sauerwald}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Faster Rumor Spreading with Multiple Calls}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {446--456}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_42}, doi = {10.1007/978-3-642-45030-3\_42}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/PanagiotouPS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PanagiotouS13, author = {Konstantinos Panagiotou and Leo Speidel}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Asynchronous Rumor Spreading on Random Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {424--434}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_40}, doi = {10.1007/978-3-642-45030-3\_40}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/PanagiotouS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Plaxton13, author = {C. Gregory Plaxton}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {524--534}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_49}, doi = {10.1007/978-3-642-45030-3\_49}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Plaxton13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/QiaoSY13, author = {Youming Qiao and Xiaoming Sun and Nengkun Yu}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Determinantal Complexities and Field Extensions}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {119--129}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_12}, doi = {10.1007/978-3-642-45030-3\_12}, timestamp = {Wed, 26 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/QiaoSY13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Scheder13, author = {Dominik Scheder}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Trivial, Tractable, Hard. {A} Not So Sudden Complexity Jump in Neighborhood Restricted {CNF} Formulas}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {251--261}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_24}, doi = {10.1007/978-3-642-45030-3\_24}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Scheder13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Scheder13a, author = {Dominik Scheder}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Unsatisfiable {CNF} Formulas contain Many Conflicts}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {273--283}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_26}, doi = {10.1007/978-3-642-45030-3\_26}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Scheder13a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SlivovskyS13, author = {Friedrich Slivovsky and Stefan Szeider}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Model Counting for Formulas of Bounded Clique-Width}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {677--687}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_63}, doi = {10.1007/978-3-642-45030-3\_63}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SlivovskyS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WalkerZ13, author = {Sam Walker and Yakov Zinder}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {The Solvable Cases of a Scheduling Algorithm}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {229--239}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_22}, doi = {10.1007/978-3-642-45030-3\_22}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/WalkerZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Wang13, author = {Haitao Wang}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Minmax Regret 1-Facility Location on Uncertain Path Networks}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {733--743}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_68}, doi = {10.1007/978-3-642-45030-3\_68}, timestamp = {Thu, 13 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Wang13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WuLWC13, author = {Yen{-}Wei Wu and Wei{-}Yin Lin and Hung{-}Lung Wang and Kun{-}Mao Chao}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Computing Plurality Points and Condorcet Points in Euclidean Space}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {688--698}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_64}, doi = {10.1007/978-3-642-45030-3\_64}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/WuLWC13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Xiang13, author = {Xiangzhong Xiang}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {New Results on the Online Pricing Problem}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {479--490}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_45}, doi = {10.1007/978-3-642-45030-3\_45}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Xiang13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/XiaoN13, author = {Mingyu Xiao and Hiroshi Nagamochi}, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Exact Algorithms for Maximum Independent Set}, booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, pages = {328--338}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3\_31}, doi = {10.1007/978-3-642-45030-3\_31}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/XiaoN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2013, editor = {Leizhen Cai and Siu{-}Wing Cheng and Tak Wah Lam}, title = {Algorithms and Computation - 24th International Symposium, {ISAAC} 2013, Hong Kong, China, December 16-18, 2013, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8283}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45030-3}, doi = {10.1007/978-3-642-45030-3}, isbn = {978-3-642-45029-7}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2013.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AhnBT12, author = {Hee{-}Kap Ahn and Sang Won Bae and Shin{-}ichi Tanigawa}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Rectilinear Covering for Imprecise Input Points - (Extended Abstract)}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {309--318}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_34}, doi = {10.1007/978-3-642-35261-4\_34}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AhnBT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AhnKKS12, author = {Hee{-}Kap Ahn and Hyo{-}Sil Kim and Sang{-}Sub Kim and Wanbin Son}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Computing k-center over Streaming Data for Small k}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {54--63}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_9}, doi = {10.1007/978-3-642-35261-4\_9}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AhnKKS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AkutsuT12, author = {Tatsuya Akutsu and Takeyuki Tamura}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {146--155}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_18}, doi = {10.1007/978-3-642-35261-4\_18}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AkutsuT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AngeliniBEHLMMO12, author = {Patrizio Angelini and Carla Binucci and William S. Evans and Ferran Hurtado and Giuseppe Liotta and Tamara Mchedlidze and Henk Meijer and Yoshio Okamoto}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Universal Point Subsets for Planar Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {423--432}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_45}, doi = {10.1007/978-3-642-35261-4\_45}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AngeliniBEHLMMO12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AssadiENYZ12, author = {Sepehr Assadi and Ehsan Emamjomeh{-}Zadeh and Ashkan Norouzi{-}Fard and Sadra Yazdanbod and Hamid Zarrabi{-}Zadeh}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {The Minimum Vulnerability Problem}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {382--391}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_41}, doi = {10.1007/978-3-642-35261-4\_41}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AssadiENYZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BaeOS12, author = {Sang Won Bae and Yoshio Okamoto and Chan{-}Su Shin}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Area Bounds of Rectilinear Polygons Realized by Angle Sequences}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {629--638}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_65}, doi = {10.1007/978-3-642-35261-4\_65}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BaeOS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BampisLL12, author = {Evripidis Bampis and Dimitrios Letsios and Giorgio Lucarelli}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Green Scheduling, Flows and Matchings}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {106--115}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_14}, doi = {10.1007/978-3-642-35261-4\_14}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BampisLL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BelmonteHK12, author = {R{\'{e}}my Belmonte and Pim van 't Hof and Marcin Kaminski}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Induced Immersions}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {299--308}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_33}, doi = {10.1007/978-3-642-35261-4\_33}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BelmonteHK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BevernMNW12, author = {Ren{\'{e}} van Bevern and Matthias Mnich and Rolf Niedermeier and Mathias Weller}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Interval Scheduling and Colorful Independent Sets}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {247--256}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_28}, doi = {10.1007/978-3-642-35261-4\_28}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BevernMNW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BhattacharyaKS12, author = {Binay K. Bhattacharya and Tsunehiko Kameda and Zhao Song}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {588--597}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_61}, doi = {10.1007/978-3-642-35261-4\_61}, timestamp = {Tue, 01 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BhattacharyaKS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrandstadtLR12, author = {Andreas Brandst{\"{a}}dt and Arne Leitert and Dieter Rautenbach}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {267--277}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_30}, doi = {10.1007/978-3-642-35261-4\_30}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrandstadtLR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrodalNT12, author = {Gerth St{\o}lting Brodal and Jesper Sindahl Nielsen and Jakob Truelsen}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Finger Search in the Implicit Model}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {527--536}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_55}, doi = {10.1007/978-3-642-35261-4\_55}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrodalNT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrodnikG12, author = {Andrej Brodnik and Marko Grgurovic}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Speeding Up Shortest Path Algorithms}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {156--165}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_19}, doi = {10.1007/978-3-642-35261-4\_19}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrodnikG12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Chan12, author = {Timothy M. Chan}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Combinatorial Geometry and Approximation Algorithms}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {2}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_2}, doi = {10.1007/978-3-642-35261-4\_2}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Chan12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CheilarisGRS12, author = {Panagiotis Cheilaris and Luisa Gargano and Adele A. Rescigno and Shakhar Smorodinsky}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Strong Conflict-Free Coloring for Intervals}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {4--13}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_4}, doi = {10.1007/978-3-642-35261-4\_4}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CheilarisGRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenFHM12, author = {Wei Chen and Wenjie Fang and Guangda Hu and Michael W. Mahoney}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {On the Hyperbolicity of Small-World and Tree-Like Random Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {278--288}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_31}, doi = {10.1007/978-3-642-35261-4\_31}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChenFHM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenTWW12, author = {Danny Z. Chen and Xuehou Tan and Haitao Wang and Gangshan Wu}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Optimal Point Movement for Covering Circular Regions}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {332--341}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_36}, doi = {10.1007/978-3-642-35261-4\_36}, timestamp = {Tue, 27 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenTWW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenW12, author = {Danny Z. Chen and Haitao Wang}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Weak Visibility Queries of Line Segments in Simple Polygons}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {609--618}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_63}, doi = {10.1007/978-3-642-35261-4\_63}, timestamp = {Tue, 27 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Demaine12, author = {Erik D. Demaine}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Origami Robots and Star Trek Replicators}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {3}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_3}, doi = {10.1007/978-3-642-35261-4\_3}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Demaine12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DengGTZ12, author = {Xiaotie Deng and Paul W. Goldberg and Bo Tang and Jinshan Zhang}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Revenue Maximization in a Bayesian Double Auction Market}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {690--699}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_71}, doi = {10.1007/978-3-642-35261-4\_71}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DengGTZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DisserM12, author = {Yann Disser and Jannik Matuschke}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Degree-Constrained Orientations of Embedded Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {506--516}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_53}, doi = {10.1007/978-3-642-35261-4\_53}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DisserM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DorrigivHZ12, author = {Reza Dorrigiv and Meng He and Norbert Zeh}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {On the Advice Complexity of Buffer Management}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {136--145}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_17}, doi = {10.1007/978-3-642-35261-4\_17}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/DorrigivHZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DurocherLMS12, author = {Stephane Durocher and Alexandre Leblanc and Jason Morrison and Matthew Skala}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Robust Nonparametric Data Approximation of Point Sets via Data Reduction}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {319--331}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_35}, doi = {10.1007/978-3-642-35261-4\_35}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DurocherLMS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DuttaR12, author = {Chinmoy Dutta and Jaikumar Radhakrishnan}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {More on a Problem of Zarankiewicz}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {257--266}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_29}, doi = {10.1007/978-3-642-35261-4\_29}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DuttaR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FratiGW12, author = {Fabrizio Frati and Joachim Gudmundsson and Emo Welzl}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {On the Number of Upward Planar Orientations of Maximal Planar Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {413--422}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_44}, doi = {10.1007/978-3-642-35261-4\_44}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FratiGW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FriedrichK12, author = {Tobias Friedrich and Anton Krohmer}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Parameterized Clique on Scale-Free Networks}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {659--668}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_68}, doi = {10.1007/978-3-642-35261-4\_68}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FriedrichK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Fu12, author = {Norie Fu}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {392--401}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_42}, doi = {10.1007/978-3-642-35261-4\_42}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Fu12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Gall12, author = {Fran{\c{c}}ois Le Gall}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {639--648}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_66}, doi = {10.1007/978-3-642-35261-4\_66}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Gall12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Ganguly12, author = {Sumit Ganguly}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Precision vs Confidence Tradeoffs for {\(\mathscr{l}\)}2-Based Frequency Estimation in Data Streams}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {64--74}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_10}, doi = {10.1007/978-3-642-35261-4\_10}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Ganguly12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolovachKP12, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Detecting Induced Minors in AT-Free Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {495--505}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_52}, doi = {10.1007/978-3-642-35261-4\_52}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GolovachKP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolovachPS12, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Closing Complexity Gaps for Coloring Problems on H-Free Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {14--23}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_5}, doi = {10.1007/978-3-642-35261-4\_5}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GolovachPS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GuoS12, author = {Jiong Guo and Yash Raj Shrestha}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Kernelization and Parameterized Complexity of Star Editing and Union Editing}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {126--135}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_16}, doi = {10.1007/978-3-642-35261-4\_16}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GuoS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HartmannRR12, author = {Tanja Hartmann and Jonathan Rollin and Ignaz Rutter}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Cubic Augmentation of Planar Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {402--412}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_43}, doi = {10.1007/978-3-642-35261-4\_43}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HartmannRR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HartmannW12, author = {Tanja Hartmann and Dorothea Wagner}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Fast and Simple Fully-Dynamic Cut Tree Construction}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {95--105}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_13}, doi = {10.1007/978-3-642-35261-4\_13}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HartmannW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HeMZ12, author = {Meng He and J. Ian Munro and Gelin Zhou}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {A Framework for Succinct Labeled Ordinal Trees over Large Alphabets}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {537--547}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_56}, doi = {10.1007/978-3-642-35261-4\_56}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HeMZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HeNZ12, author = {Meng He and Patrick K. Nicholson and Norbert Zeh}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {A Space-Efficient Framework for Dynamic Point Location}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {548--557}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_57}, doi = {10.1007/978-3-642-35261-4\_57}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HeNZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HellHN12, author = {Pavol Hell and Miki Hermann and Mayssam Mohammadi Nevisi}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Counting Partitions of Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {227--236}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_26}, doi = {10.1007/978-3-642-35261-4\_26}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HellHN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HermelinRV12, author = {Danny Hermelin and Romeo Rizzi and St{\'{e}}phane Vialette}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {465--474}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_49}, doi = {10.1007/978-3-642-35261-4\_49}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HermelinRV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Hopcroft12, author = {John E. Hopcroft}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Future Directions in Computer Science Research}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {1}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_1}, doi = {10.1007/978-3-642-35261-4\_1}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Hopcroft12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HuangL12, author = {Yamming Huang and Chung{-}Shou Liao}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {The Canadian Traveller Problem Revisited}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {352--361}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_38}, doi = {10.1007/978-3-642-35261-4\_38}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HuangL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItoKOZ12, author = {Takehiro Ito and Kazuto Kawamura and Hirotaka Ono and Xiao Zhou}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Reconfiguration of List L(2, 1)-Labelings in a Graph}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {34--43}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_7}, doi = {10.1007/978-3-642-35261-4\_7}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ItoKOZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItoNOOUUU12, author = {Takehiro Ito and Shin{-}Ichi Nakano and Yoshio Okamoto and Yota Otachi and Ryuhei Uehara and Takeaki Uno and Yushi Uno}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {372--381}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_40}, doi = {10.1007/978-3-642-35261-4\_40}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ItoNOOUUU12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Junosza-SzaniawskiKPR12, author = {Konstanty Junosza{-}Szaniawski and Jan Kratochv{\'{\i}}l and Martin Pergel and Pawel Rzazewski}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Beyond Homothetic Polygons: Recognition and Maximum Clique}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {619--628}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_64}, doi = {10.1007/978-3-642-35261-4\_64}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Junosza-SzaniawskiKPR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KanHH12, author = {Tomohiro Kan and Shoichi Higuchi and Kouichi Hirata}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Segmental Mapping and Distance for Rooted Labeled Ordered Trees}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {485--494}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_51}, doi = {10.1007/978-3-642-35261-4\_51}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KanHH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KanteLMN12, author = {Mamadou Moustapha Kant{\'{e}} and Vincent Limouzy and Arnaud Mary and Lhouari Nourine}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {289--298}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_32}, doi = {10.1007/978-3-642-35261-4\_32}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KanteLMN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KaoCRW12, author = {Mong{-}Jen Kao and Jian{-}Jia Chen and Ignaz Rutter and Dorothea Wagner}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {75--84}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_11}, doi = {10.1007/978-3-642-35261-4\_11}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KaoCRW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KappmeierMP12, author = {Jan{-}Philipp W. Kappmeier and Jannik Matuschke and Britta Peis}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Abstract Flows over Time: {A} First Step towards Solving Dynamic Packing Problems}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {433--443}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_46}, doi = {10.1007/978-3-642-35261-4\_46}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KappmeierMP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KawamuraK12, author = {Akitoshi Kawamura and Yusuke Kobayashi}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Fence Patrolling by Mobile Agents with Distinct Speeds}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {598--608}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_62}, doi = {10.1007/978-3-642-35261-4\_62}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KawamuraK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Kita12, author = {Nanao Kita}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {85--94}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_12}, doi = {10.1007/978-3-642-35261-4\_12}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Kita12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KlavikKOS12, author = {Pavel Klav{\'{\i}}k and Jan Kratochv{\'{\i}}l and Yota Otachi and Toshiki Saitoh}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Extending Partial Representations of Subclasses of Chordal Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {444--454}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_47}, doi = {10.1007/978-3-642-35261-4\_47}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KlavikKOS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KoblerKW12, author = {Johannes K{\"{o}}bler and Sebastian Kuhnert and Osamu Watanabe}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Interval Graph Representation with Given Interval and Intersection Lengths}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {517--526}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_54}, doi = {10.1007/978-3-642-35261-4\_54}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KoblerKW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KociumakaPRRW12, author = {Tomasz Kociumaka and Jakub Pachocki and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Efficient Counting of Square Substrings in a Tree}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {207--216}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_24}, doi = {10.1007/978-3-642-35261-4\_24}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KociumakaPRRW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KopelowitzT12, author = {Tsvi Kopelowitz and Nimrod Talmon}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {558--567}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_58}, doi = {10.1007/978-3-642-35261-4\_58}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KopelowitzT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KreveldLP12, author = {Marc J. van Kreveld and Maarten L{\"{o}}ffler and J{\'{a}}nos Pach}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {How Many Potatoes Are in a Mesh?}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {166--176}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_20}, doi = {10.1007/978-3-642-35261-4\_20}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KreveldLP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KuoL12, author = {Ching{-}Chen Kuo and Hsueh{-}I Lu}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {24--33}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_6}, doi = {10.1007/978-3-642-35261-4\_6}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KuoL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiuW12, author = {Yunlong Liu and Xiaodong Wu}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Solving Circular Integral Block Decomposition in Polynomial Time}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {342--351}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_37}, doi = {10.1007/978-3-642-35261-4\_37}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiuW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MakrisT12, author = {Christos Makris and Konstantinos Tsakalidis}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {568--577}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_59}, doi = {10.1007/978-3-642-35261-4\_59}, timestamp = {Mon, 01 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MakrisT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Mazumdar12, author = {Arya Mazumdar}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {On Almost Disjunct Matrices for Group Testing}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {649--658}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_67}, doi = {10.1007/978-3-642-35261-4\_67}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Mazumdar12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Nagamochi12, author = {Hiroshi Nagamochi}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Linear Layouts in Submodular Systems}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {475--484}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_50}, doi = {10.1007/978-3-642-35261-4\_50}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Nagamochi12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Otachi12, author = {Yota Otachi}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Isomorphism for Graphs of Bounded Connected-Path-Distance-Width}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {455--464}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_48}, doi = {10.1007/978-3-642-35261-4\_48}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Otachi12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Paluch12, author = {Katarzyna E. Paluch}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Popular and Clan-Popular b-Matchings}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {116--125}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_15}, doi = {10.1007/978-3-642-35261-4\_15}, timestamp = {Thu, 20 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Paluch12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PapadopoulouD12, author = {Evanthia Papadopoulou and Sandeep K. Dey}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {On the Farthest Line-Segment Voronoi Diagram}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {187--196}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_22}, doi = {10.1007/978-3-642-35261-4\_22}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/PapadopoulouD12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PapadopoulouZ12, author = {Evanthia Papadopoulou and Maksym Zavershynskyi}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {On Higher Order Voronoi Diagrams of Line Segments}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {177--186}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_21}, doi = {10.1007/978-3-642-35261-4\_21}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/PapadopoulouZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SaikkonenS12, author = {Riku Saikkonen and Eljas Soisalon{-}Soininen}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {A General Method for Improving Insertion-Based Adaptive Sorting}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {217--226}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_25}, doi = {10.1007/978-3-642-35261-4\_25}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SaikkonenS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Sakai12, author = {Yoshifumi Sakai}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Computing the Longest Common Subsequence of Two Run-Length Encoded Strings}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {197--206}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_23}, doi = {10.1007/978-3-642-35261-4\_23}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Sakai12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/TingX12, author = {H. F. Ting and Xiangzhong Xiang}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Multi-unit Auctions with Budgets and Non-uniform Valuations}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {669--678}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_69}, doi = {10.1007/978-3-642-35261-4\_69}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/TingX12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Uno12, author = {Takeaki Uno}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Efficient Computation of Power Indices for Weighted Majority Games}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {679--689}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_70}, doi = {10.1007/978-3-642-35261-4\_70}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Uno12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WongYB12, author = {Prudence W. H. Wong and Fencol C. C. Yung and Mihai Burcea}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {An 8/3 Lower Bound for Online Dynamic Bin Packing}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {44--53}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_8}, doi = {10.1007/978-3-642-35261-4\_8}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/WongYB12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Yamakami12, author = {Tomoyuki Yamakami}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {237--246}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_27}, doi = {10.1007/978-3-642-35261-4\_27}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Yamakami12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/YuGZ12, author = {Wei Yu and Mordecai J. Golin and Guochuan Zhang}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Vehicle Scheduling on a Graph Revisited}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {362--371}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_39}, doi = {10.1007/978-3-642-35261-4\_39}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/YuGZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/YuL12, author = {Hung{-}I Yu and Cheng{-}Chung Li}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {The Multi-Service Center Problem}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {578--587}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_60}, doi = {10.1007/978-3-642-35261-4\_60}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/YuL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2012, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4}, doi = {10.1007/978-3-642-35261-4}, isbn = {978-3-642-35260-7}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2012.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AbelDDELSS11, author = {Zachary Abel and Erik D. Demaine and Martin L. Demaine and Sarah Eisenstat and Jayson Lynch and Tao B. Schardl and Isaac Shapiro{-}Ellowitz}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Folding Equilateral Plane Graphs}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {574--583}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_59}, doi = {10.1007/978-3-642-25591-5\_59}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AbelDDELSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AhnBKLSV11, author = {Hee{-}Kap Ahn and Sang Won Bae and Christian Knauer and Mira Lee and Chan{-}Su Shin and Antoine Vigneron}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Generating Realistic Roofs over a Rectilinear Polygon}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {60--69}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_8}, doi = {10.1007/978-3-642-25591-5\_8}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AhnBKLSV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AhnKKSSV11, author = {Hee{-}Kap Ahn and Sang{-}Sub Kim and Christian Knauer and Lena Schlipf and Chan{-}Su Shin and Antoine Vigneron}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Covering and Piercing Disks with Two Centers}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {50--59}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_7}, doi = {10.1007/978-3-642-25591-5\_7}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AhnKKSSV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AlamBFGKK11, author = {Muhammad Jawaherul Alam and Therese Biedl and Stefan Felsner and Andreas Gerasch and Michael Kaufmann and Stephen G. Kobourov}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {281--291}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_30}, doi = {10.1007/978-3-642-25591-5\_30}, timestamp = {Thu, 11 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AlamBFGKK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AleardiD11, author = {Luca Castelli Aleardi and Olivier Devillers}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Explicit Array-Based Compact Data Structures for Triangulations}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {312--322}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_33}, doi = {10.1007/978-3-642-25591-5\_33}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AleardiD11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AmirALLLP11, author = {Amihood Amir and Alberto Apostolico and Gad M. Landau and Avivit Levy and Moshe Lewenstein and Ely Porat}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Range {LCP}}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {683--692}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_70}, doi = {10.1007/978-3-642-25591-5\_70}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AmirALLLP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AmirELL11, author = {Amihood Amir and Estrella Eisenberg and Avivit Levy and Noa Lewenstein}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Closest Periodic Vectors in {L} p Spaces}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {714--723}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_73}, doi = {10.1007/978-3-642-25591-5\_73}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AmirELL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AndoM11, author = {Ryuta Ando and Tomomi Matsui}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {474--483}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_49}, doi = {10.1007/978-3-642-25591-5\_49}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AndoM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AngeliniBF11, author = {Patrizio Angelini and Giuseppe Di Battista and Fabrizio Frati}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Simultaneous Embedding of Embedded Planar Graphs}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {271--280}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_29}, doi = {10.1007/978-3-642-25591-5\_29}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AngeliniBF11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AngelinoGMT11, author = {Elaine Angelino and Michael T. Goodrich and Michael Mitzenmacher and Justin Thaler}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {External-Memory Multimaps}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {384--394}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_40}, doi = {10.1007/978-3-642-25591-5\_40}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AngelinoGMT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Arora11, author = {Sanjeev Arora}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Semidefinite Programming and Approximation Algorithms: {A} Survey}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {6--9}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_2}, doi = {10.1007/978-3-642-25591-5\_2}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Arora11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AtsoniosBHK11, author = {Ioannis Atsonios and Olivier Beaumont and Nicolas Hanusse and Yusik Kim}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {504--513}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_52}, doi = {10.1007/978-3-642-25591-5\_52}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AtsoniosBHK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AvisIP11, author = {David Avis and Kazuo Iwama and Daichi Paku}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {415--424}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_43}, doi = {10.1007/978-3-642-25591-5\_43}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AvisIP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BarbaKLS11, author = {Luis Barba and Matias Korman and Stefan Langerman and Rodrigo I. Silveira}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Computing the Visibility Polygon Using Few Variables}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {70--79}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_9}, doi = {10.1007/978-3-642-25591-5\_9}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BarbaKLS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BazganCF11, author = {Cristina Bazgan and Morgan Chopin and Michael R. Fellows}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Parameterized Complexity of the Firefighter Problem}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {643--652}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_66}, doi = {10.1007/978-3-642-25591-5\_66}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BazganCF11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BelmonteGHHKP11, author = {R{\'{e}}my Belmonte and Petr A. Golovach and Pinar Heggernes and Pim van 't Hof and Marcin Kaminski and Dani{\"{e}}l Paulusma}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {110--119}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_13}, doi = {10.1007/978-3-642-25591-5\_13}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BelmonteGHHKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergCG11, author = {Mark de Berg and Atlas F. Cook IV and Joachim Gudmundsson}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Fast Fr{\'{e}}chet Queries}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {240--249}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_26}, doi = {10.1007/978-3-642-25591-5\_26}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BergCG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BergSW11, author = {Mark de Berg and Bettina Speckmann and Vincent van der Weele}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Treemaps with Bounded Aspect Ratio}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {260--270}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_28}, doi = {10.1007/978-3-642-25591-5\_28}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BergSW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BockGKS11, author = {Adrian Bock and Elyot Grant and Jochen K{\"{o}}nemann and Laura Sanit{\`{a}}}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {The School Bus Problem on Trees}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {10--19}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_3}, doi = {10.1007/978-3-642-25591-5\_3}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BockGKS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrandstadtM11, author = {Andreas Brandst{\"{a}}dt and Raffaele Mosca}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Dominating Induced Matchings for {P} 7-free Graphs in Linear Time}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {100--109}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_12}, doi = {10.1007/978-3-642-25591-5\_12}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrandstadtM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BuchinSV11, author = {Kevin Buchin and Bettina Speckmann and Kevin Verbeek}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Angle-Restricted Steiner Arborescences for Flow Map Layout}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {250--259}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_27}, doi = {10.1007/978-3-642-25591-5\_27}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BuchinSV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CamposKSS11, author = {Victor A. Campos and Sulamita Klein and Rudini Menezes Sampaio and Ana Silva}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Two Fixed-Parameter Algorithms for the Cocoloring Problem}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {634--642}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_65}, doi = {10.1007/978-3-642-25591-5\_65}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CamposKSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChanLLPTZ11, author = {Ho{-}Leung Chan and Tak Wah Lam and Lap{-}Kei Lee and Jiangwei Pan and Hing{-}Fung Ting and Qin Zhang}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Edit Distance to Monotonicity in Sliding Windows}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {564--573}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_58}, doi = {10.1007/978-3-642-25591-5\_58}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChanLLPTZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenDS11, author = {Ho{-}Lin Chen and David Doty and Shinnosuke Seki}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Program Size and Temperature in Self-Assembly}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {445--453}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_46}, doi = {10.1007/978-3-642-25591-5\_46}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenDS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenW11, author = {Danny Z. Chen and Haitao Wang}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Efficient Algorithms for the Weighted k-Center Problem on a Real Line}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {584--593}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_60}, doi = {10.1007/978-3-642-25591-5\_60}, timestamp = {Tue, 27 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenW11a, author = {Danny Z. Chen and Haitao Wang}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Outlier Respecting Points Approximation}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {594--603}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_61}, doi = {10.1007/978-3-642-25591-5\_61}, timestamp = {Tue, 27 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenW11a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenW11b, author = {Danny Z. Chen and Haitao Wang}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {604--613}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_62}, doi = {10.1007/978-3-642-25591-5\_62}, timestamp = {Tue, 27 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenW11b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChimaniW11, author = {Markus Chimani and Matthias Woste}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Contraction-Based Steiner Tree Approximations in Practice}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {40--49}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_6}, doi = {10.1007/978-3-642-25591-5\_6}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChimaniW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChinLY11, author = {Francis Y. L. Chin and Henry C. M. Leung and Siu{-}Ming Yiu}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Adaptive Phenotype Testing for {AND/OR} Items}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {754--763}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_77}, doi = {10.1007/978-3-642-25591-5\_77}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChinLY11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CuiJS11, author = {Yun Cui and Jesper Jansson and Wing{-}Kin Sung}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Algorithms for Building Consensus MUL-trees}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {744--753}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_76}, doi = {10.1007/978-3-642-25591-5\_76}, timestamp = {Tue, 17 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CuiJS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DornfelderGKW11, author = {Martin D{\"{o}}rnfelder and Jiong Guo and Christian Komusiewicz and Mathias Weller}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {On the Parameterized Complexity of Consensus Clustering}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {624--633}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_64}, doi = {10.1007/978-3-642-25591-5\_64}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DornfelderGKW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DumitrescuH11, author = {Adrian Dumitrescu and Evan Hilscher}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Animal Testing}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {220--229}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_24}, doi = {10.1007/978-3-642-25591-5\_24}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DumitrescuH11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DumitrescuH11a, author = {Adrian Dumitrescu and Masud Hasan}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Cutting Out Polygons with a Circular Saw}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {230--239}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_25}, doi = {10.1007/978-3-642-25591-5\_25}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DumitrescuH11a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ElmasryHMN11, author = {Amr Elmasry and Meng He and J. Ian Munro and Patrick K. Nicholson}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Dynamic Range Majority Data Structures}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {150--159}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_17}, doi = {10.1007/978-3-642-25591-5\_17}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ElmasryHMN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FarzanF11, author = {Arash Farzan and Johannes Fischer}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Compact Representation of Posets}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {302--311}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_32}, doi = {10.1007/978-3-642-25591-5\_32}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FarzanF11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FriedrichSS11, author = {Tobias Friedrich and Thomas Sauerwald and Alexandre Stauffer}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {190--199}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_21}, doi = {10.1007/978-3-642-25591-5\_21}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FriedrichSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FujiwaraKF11, author = {Hiroshi Fujiwara and Takuma Kitano and Toshihiro Fujito}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {On the Best Possible Competitive Ratio for Multislope Ski Rental}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {544--553}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_56}, doi = {10.1007/978-3-642-25591-5\_56}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/FujiwaraKF11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FurerY11, author = {Martin F{\"{u}}rer and Huiwen Yu}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Packing-Based Approximation Algorithm for the k-Set Cover Problem}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {484--493}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_50}, doi = {10.1007/978-3-642-25591-5\_50}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FurerY11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GagieGP11, author = {Travis Gagie and Pawel Gawrychowski and Simon J. Puglisi}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Faster Approximate Pattern Matching in Compressed Repetitive Texts}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {653--662}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_67}, doi = {10.1007/978-3-642-25591-5\_67}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GagieGP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GibsonHSW11, author = {Matt Gibson and Dongfeng Han and Milan Sonka and Xiaodong Wu}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {724--733}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_74}, doi = {10.1007/978-3-642-25591-5\_74}, timestamp = {Fri, 26 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GibsonHSW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GoetzmannHKM11, author = {Kai{-}Simon Goetzmann and Tobias Harks and Max Klimm and Konstantin Miller}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Optimal File Distribution in Peer-to-Peer Networks}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {210--219}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_23}, doi = {10.1007/978-3-642-25591-5\_23}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GoetzmannHKM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolinIKRR11, author = {Mordecai J. Golin and John Iacono and Danny Krizanc and Rajeev Raman and S. Srinivasa Rao}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Encoding 2D Range Maximum Queries}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {180--189}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_20}, doi = {10.1007/978-3-642-25591-5\_20}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GolinIKRR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GoodrichS11, author = {Michael T. Goodrich and Joseph A. Simons}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Fully Retroactive Approximate Range and Nearest Neighbor Searching}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {292--301}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_31}, doi = {10.1007/978-3-642-25591-5\_31}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GoodrichS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GoodrichSZ11, author = {Michael T. Goodrich and Nodari Sitchinava and Qin Zhang}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Sorting, Searching, and Simulation in the MapReduce Framework}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {374--383}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_39}, doi = {10.1007/978-3-642-25591-5\_39}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GoodrichSZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Guillemot11, author = {Sylvain Guillemot}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Parameterized Algorithms for Inclusion of Linear Matchings}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {354--363}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_37}, doi = {10.1007/978-3-642-25591-5\_37}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Guillemot11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GuoHNS11, author = {Jiong Guo and Sepp Hartung and Rolf Niedermeier and Ondrej Such{\'{y}}}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {The Parameterized Complexity of Local Search for TSP, More Refined}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {614--623}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_63}, doi = {10.1007/978-3-642-25591-5\_63}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GuoHNS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HeMN11, author = {Meng He and J. Ian Munro and Patrick K. Nicholson}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Dynamic Range Selection in Linear Space}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {160--169}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_18}, doi = {10.1007/978-3-642-25591-5\_18}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HeMN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HeMZ11, author = {Meng He and J. Ian Munro and Gelin Zhou}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Path Queries in Weighted Trees}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {140--149}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_16}, doi = {10.1007/978-3-642-25591-5\_16}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HeMZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HellersteinOS11, author = {Lisa Hellerstein and {\"{O}}zg{\"{u}}r {\"{O}}zkan and Linda Sellie}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Max-Throughput for (Conservative) k-of-n Testing}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {703--713}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_72}, doi = {10.1007/978-3-642-25591-5\_72}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HellersteinOS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HonLST11, author = {Wing{-}Kai Hon and Chen{-}Hua Lu and Rahul Shah and Sharma V. Thankachan}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Succinct Indexes for Circular Patterns}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {673--682}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_69}, doi = {10.1007/978-3-642-25591-5\_69}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HonLST11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Hsiao11, author = {Sheng{-}Ying Hsiao}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {344--353}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_36}, doi = {10.1007/978-3-642-25591-5\_36}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Hsiao11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Hurwitz11, author = {Jeremy Hurwitz}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {A Nearly-Quadratic Gap between Adaptive and Non-adaptive Property Testers - (Extended Abstract)}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {524--533}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_54}, doi = {10.1007/978-3-642-25591-5\_54}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Hurwitz11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItsyksonS11, author = {Dmitry Itsykson and Dmitry Sokolov}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Lower Bounds for Myopic {DPLL} Algorithms with a Cut Heuristic}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {464--473}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_48}, doi = {10.1007/978-3-642-25591-5\_48}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ItsyksonS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KakimuraMS11, author = {Naonori Kakimura and Kazuhisa Makino and Kento Seimi}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Computing Knapsack Solutions with Cardinality Robustness}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {693--702}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_71}, doi = {10.1007/978-3-642-25591-5\_71}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KakimuraMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Kamiyama11, author = {Naoyuki Kamiyama}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Robustness of Minimum Cost Arborescences}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {130--139}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_15}, doi = {10.1007/978-3-642-25591-5\_15}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Kamiyama11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KaoL11, author = {Mong{-}Jen Kao and D. T. Lee}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Capacitated Domination: Constant Factor Approximations for Planar Graphs}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {494--503}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_51}, doi = {10.1007/978-3-642-25591-5\_51}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KaoL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KhaniS11, author = {M. Reza Khani and Mohammad R. Salavatipour}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {20--29}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_4}, doi = {10.1007/978-3-642-25591-5\_4}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KhaniS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Korman11, author = {Matias Korman}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {80--89}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_10}, doi = {10.1007/978-3-642-25591-5\_10}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Korman11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LassigS11, author = {J{\"{o}}rg L{\"{a}}ssig and Dirk Sudholt}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract)}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {405--414}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_42}, doi = {10.1007/978-3-642-25591-5\_42}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LassigS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LeN11, author = {Van Bang Le and Ragnar Nevries}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Recognizing Polar Planar Graphs Using New Results for Monopolarity}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {120--129}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_14}, doi = {10.1007/978-3-642-25591-5\_14}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LeN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MisraRRS11, author = {Pranabendu Misra and Venkatesh Raman and M. S. Ramanujan and Saket Saurabh}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {333--343}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_35}, doi = {10.1007/978-3-642-25591-5\_35}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/MisraRRS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MontgolfierSV11, author = {Fabien de Montgolfier and Mauricio Soto and Laurent Viennot}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Asymptotic Modularity of Some Graph Classes}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {435--444}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_45}, doi = {10.1007/978-3-642-25591-5\_45}, timestamp = {Wed, 16 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MontgolfierSV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NavarroR11, author = {Gonzalo Navarro and Lu{\'{\i}}s M. S. Russo}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Space-Efficient Data-Analysis Queries on Grids}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {323--332}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_34}, doi = {10.1007/978-3-642-25591-5\_34}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/NavarroR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Nekrich11, author = {Yakov Nekrich}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {170--179}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_19}, doi = {10.1007/978-3-642-25591-5\_19}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Nekrich11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Nekrich11a, author = {Yakov Nekrich}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {External Memory Orthogonal Range Reporting with Fast Updates}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {395--404}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_41}, doi = {10.1007/978-3-642-25591-5\_41}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Nekrich11a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NisgavP11, author = {Aviv Nisgav and Boaz Patt{-}Shamir}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Improved Collaborative Filtering}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {425--434}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_44}, doi = {10.1007/978-3-642-25591-5\_44}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/NisgavP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/OgataYKY11, author = {Masatora Ogata and Yukiko Yamauchi and Shuji Kijima and Masafumi Yamashita}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {514--523}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_53}, doi = {10.1007/978-3-642-25591-5\_53}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/OgataYKY11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/OnoderaS11, author = {Taku Onodera and Tetsuo Shibuya}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {An Index Structure for Spaced Seed Search}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {764--772}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_78}, doi = {10.1007/978-3-642-25591-5\_78}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/OnoderaS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/RadoszewskiR11, author = {Jakub Radoszewski and Wojciech Rytter}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Hamiltonian Paths in the Square of a Tree}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {90--99}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_11}, doi = {10.1007/978-3-642-25591-5\_11}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/RadoszewskiR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Sakai11, author = {Yoshifumi Sakai}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {663--672}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_68}, doi = {10.1007/978-3-642-25591-5\_68}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Sakai11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/TsengK11, author = {Kuan{-}Chieh Robert Tseng and David G. Kirkpatrick}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Input-Thrifty Extrema Testing}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {554--563}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_57}, doi = {10.1007/978-3-642-25591-5\_57}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/TsengK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/TsouCL11, author = {Cheng{-}Hsiao Tsou and Gen{-}Huey Chen and Ching{-}Chi Lin}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Broadcasting in Heterogeneous Tree Networks with Uncertainty}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {200--209}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_22}, doi = {10.1007/978-3-642-25591-5\_22}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/TsouCL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Wagner11, author = {Dorothea Wagner}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Algorithm Engineering for Route Planning - An Update -}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {1--5}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_1}, doi = {10.1007/978-3-642-25591-5\_1}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Wagner11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WangG11, author = {Chunhao Wang and Qian{-}Ping Gu}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {364--373}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_38}, doi = {10.1007/978-3-642-25591-5\_38}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/WangG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Yamakami11, author = {Tomoyuki Yamakami}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {454--463}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_47}, doi = {10.1007/978-3-642-25591-5\_47}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Yamakami11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/YasutakeHKTT11, author = {Shota Yasutake and Kohei Hatano and Shuji Kijima and Eiji Takimoto and Masayuki Takeda}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Online Linear Optimization over Permutations}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {534--543}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_55}, doi = {10.1007/978-3-642-25591-5\_55}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/YasutakeHKTT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/YuLL11, author = {Hung{-}I Yu and Tien{-}Ching Lin and D. T. Lee}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Finding Maximum Sum Segments in Sequences with Uncertainty}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {734--743}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_75}, doi = {10.1007/978-3-642-25591-5\_75}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/YuLL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/YuZ11, author = {Wei Yu and Guochuan Zhang}, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Improved Approximation Algorithms for Routing Shop Scheduling}, booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, pages = {30--39}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5\_5}, doi = {10.1007/978-3-642-25591-5\_5}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/YuZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2011, editor = {Takao Asano and Shin{-}Ichi Nakano and Yoshio Okamoto and Osamu Watanabe}, title = {Algorithms and Computation - 22nd International Symposium, {ISAAC} 2011, Yokohama, Japan, December 5-8, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7074}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25591-5}, doi = {10.1007/978-3-642-25591-5}, isbn = {978-3-642-25590-8}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2011.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AdamaszekP10, author = {Anna Adamaszek and Alexandru Popa}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Approximation and Hardness Results for the Maximum Edge \emph{q}-coloring Problem}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {132--143}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_12}, doi = {10.1007/978-3-642-17514-5\_12}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AdamaszekP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AdigaCS10, author = {Abhijin Adiga and Rajesh Hemant Chitnis and Saket Saurabh}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Parameterized Algorithms for Boxicity}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {366--377}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_33}, doi = {10.1007/978-3-642-17517-6\_33}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AdigaCS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AhnCR10, author = {Hee{-}Kap Ahn and Siu{-}Wing Cheng and Iris Reinbacher}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Maximum Overlap of Convex Polytopes under Translation}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {97--108}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_9}, doi = {10.1007/978-3-642-17514-5\_9}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AhnCR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AhnKSSV10, author = {Hee{-}Kap Ahn and Christian Knauer and Marc Scherfenberg and Lena Schlipf and Antoine Vigneron}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Computing the Discrete Fr{\'{e}}chet Distance with Imprecise Input}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {422--433}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_36}, doi = {10.1007/978-3-642-17514-5\_36}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AhnKSSV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Amano10, author = {Kazuyuki Amano}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {New Upper Bounds on the Average {PTF} Density of Boolean Functions}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {304--315}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_28}, doi = {10.1007/978-3-642-17517-6\_28}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Amano10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AmirEL10, author = {Amihood Amir and Estrella Eisenberg and Avivit Levy}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Approximate Periodicity}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {25--36}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_5}, doi = {10.1007/978-3-642-17517-6\_5}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AmirEL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AugustineG10, author = {John Augustine and Nick Gravin}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {On the Continuous {CNN} Problem}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {254--265}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_22}, doi = {10.1007/978-3-642-17514-5\_22}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AugustineG10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Babenko10, author = {Maxim A. Babenko}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {A Faster Algorithm for the Maximum Even Factor Problem}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {451--462}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_40}, doi = {10.1007/978-3-642-17517-6\_40}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Babenko10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BaeS10, author = {Sang Won Bae and Chan{-}Su Shin}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {The Onion Diagram: {A} Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract)}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {230--241}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_20}, doi = {10.1007/978-3-642-17514-5\_20}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BaeS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BampisKLM10, author = {Evripidis Bampis and Alexander V. Kononov and Giorgio Lucarelli and Ioannis Milis}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Bounded Max-colorings of Graphs}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {353--365}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_32}, doi = {10.1007/978-3-642-17517-6\_32}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BampisKLM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BarbayGNN10, author = {J{\'{e}}r{\'{e}}my Barbay and Travis Gagie and Gonzalo Navarro and Yakov Nekrich}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Alphabet Partitioning for Compressed Rank/Select and Applications}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {315--326}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_27}, doi = {10.1007/978-3-642-17514-5\_27}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BarbayGNN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BermanKZ10, author = {Piotr Berman and Marek Karpinski and Alexander Zelikovsky}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {15--24}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_4}, doi = {10.1007/978-3-642-17517-6\_4}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BermanKZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BhattacharyaH10, author = {Binay K. Bhattacharya and Yuzhuang Hu}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Approximation Algorithms for the Multi-Vehicle Scheduling Problem}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {192--205}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_17}, doi = {10.1007/978-3-642-17514-5\_17}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BhattacharyaH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BomzeCJLMZ10, author = {Immanuel M. Bomze and Markus Chimani and Michael J{\"{u}}nger and Ivana Ljubic and Petra Mutzel and Bernd Zey}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {427--439}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_38}, doi = {10.1007/978-3-642-17517-6\_38}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BomzeCJLMZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BoseD10, author = {Prosenjit Bose and Karim Dou{\"{\i}}eb}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Should Static Search Trees Ever Be Unbalanced?}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {109--120}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_12}, doi = {10.1007/978-3-642-17517-6\_12}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BoseD10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BoseDDOSSW10, author = {Prosenjit Bose and Mirela Damian and Karim Dou{\"{\i}}eb and Joseph O'Rourke and Ben Seamone and Michiel H. M. Smid and Stefanie Wuhrer}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {\emph{pi}/2-Angle Yao Graphs Are Spanners}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {446--457}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_38}, doi = {10.1007/978-3-642-17514-5\_38}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BoseDDOSSW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrankovicF10, author = {Ljiljana Brankovic and Henning Fernau}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Combining Two Worlds: Parameterised Approximation for Vertex Cover}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {390--402}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_35}, doi = {10.1007/978-3-642-17517-6\_35}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BrankovicF10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrodalKT10, author = {Gerth St{\o}lting Brodal and Casper Kejlberg{-}Rasmussen and Jakob Truelsen}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {A Cache-Oblivious Implicit Dictionary with the Working Set Property}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {37--48}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_4}, doi = {10.1007/978-3-642-17514-5\_4}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrodalKT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrodalSTZ10, author = {Gerth St{\o}lting Brodal and Spyros Sioutas and Kostas Tsichlas and Christos D. Zaroliagis}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {D\({}^{\mbox{2}}\)-Tree: {A} New Overlay with Deterministic Bounds}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {1--12}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_1}, doi = {10.1007/978-3-642-17514-5\_1}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrodalSTZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrodnikI10, author = {Andrej Brodnik and John Iacono}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Unit-Time Predecessor Queries on Massive Data Sets}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {133--144}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_14}, doi = {10.1007/978-3-642-17517-6\_14}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrodnikI10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BroersmaGPS10, author = {Hajo Broersma and Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {On Coloring Graphs without Induced Forests}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {156--167}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_14}, doi = {10.1007/978-3-642-17514-5\_14}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BroersmaGPS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CaiHL10, author = {Jin{-}yi Cai and Sangxia Huang and Pinyan Lu}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {From Holant to {\#}CSP and Back: Dichotomy for Holant\({}^{\mbox{\emph{c}}}\) Problems}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {253--265}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_24}, doi = {10.1007/978-3-642-17517-6\_24}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CaiHL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CanzarEER10, author = {Stefan Canzar and Khaled M. Elbassioni and Amr Elmasry and Rajiv Raman}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {On the Approximability of the Maximum Interval Constrained Coloring Problem}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {168--179}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_15}, doi = {10.1007/978-3-642-17514-5\_15}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CanzarEER10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CarmiS10, author = {Paz Carmi and Michiel H. M. Smid}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {An Optimal Algorithm for Computing Angle-Constrained Spanners}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {316--327}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_29}, doi = {10.1007/978-3-642-17517-6\_29}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CarmiS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChambersE10, author = {Erin W. Chambers and David Eppstein}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Flows in One-Crossing-Minor-Free Graphs}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {241--252}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_23}, doi = {10.1007/978-3-642-17517-6\_23}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChambersE10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChambersEFLSSSSWW10, author = {Erin W. Chambers and Alejandro Erickson and S{\'{a}}ndor P. Fekete and Jonathan Lenchner and Jeff Sember and Srinivasan Venkatesh and Ulrike Stege and Svetlana Stolpner and Christophe Weibel and Sue Whitesides}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Connectivity Graphs of Uncertainty Regions}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {434--445}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_37}, doi = {10.1007/978-3-642-17514-5\_37}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChambersEFLSSSSWW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChenHC10, author = {Kuan{-}Yu Chen and Ping{-}Hui Hsu and Kun{-}Mao Chao}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Identifying Approximate Palindromes in Run-Length Encoded Strings}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {339--350}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_29}, doi = {10.1007/978-3-642-17514-5\_29}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ChenHC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChengJVW10, author = {Siu{-}Wing Cheng and Jiongxin Jin and Antoine Vigneron and Yajun Wang}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Approximate Shortest Homotopic Paths in Weighted Regions}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {109--120}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_10}, doi = {10.1007/978-3-642-17514-5\_10}, timestamp = {Wed, 18 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChengJVW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ChengKLS10, author = {Siu{-}Wing Cheng and Christian Knauer and Stefan Langerman and Michiel H. M. Smid}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Approximating the Average Stretch Factor of Geometric Graphs}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {37--48}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_6}, doi = {10.1007/978-3-642-17517-6\_6}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ChengKLS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CheungMWYZ10, author = {David W. Cheung and Nikos Mamoulis and Wai Kit Wong and Siu{-}Ming Yiu and Ye Zhang}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Anonymous Fuzzy Identity-Based Encryption for Similarity Search}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {61--72}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_8}, doi = {10.1007/978-3-642-17517-6\_8}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/CheungMWYZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/CicaleseJLM10, author = {Ferdinando Cicalese and Tobias Jacobs and Eduardo Sany Laber and Marco Molinaro}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {On Greedy Algorithms for Decision Trees}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {206--217}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_18}, doi = {10.1007/978-3-642-17514-5\_18}, timestamp = {Sat, 05 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/CicaleseJLM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DuchierDS10, author = {Denys Duchier and J{\'{e}}r{\^{o}}me Durand{-}Lose and Maxime Senot}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Fractal Parallelism: Solving {SAT} in Bounded Space and Time}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {279--290}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_26}, doi = {10.1007/978-3-642-17517-6\_26}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DuchierDS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Elmasry10, author = {Amr Elmasry}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {375--386}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_32}, doi = {10.1007/978-3-642-17514-5\_32}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Elmasry10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Eppstein10, author = {David Eppstein}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Regular Labelings and Geometric Structures}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {1}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_1}, doi = {10.1007/978-3-642-17517-6\_1}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Eppstein10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/EppsteinLS10, author = {David Eppstein and Maarten L{\"{o}}ffler and Darren Strash}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {403--414}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_36}, doi = {10.1007/978-3-642-17517-6\_36}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/EppsteinLS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FarzanGN10, author = {Arash Farzan and Travis Gagie and Gonzalo Navarro}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Entropy-Bounded Representation of Point Grids}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {327--338}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_28}, doi = {10.1007/978-3-642-17514-5\_28}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FarzanGN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/FereeHHP10, author = {Hugo F{\'{e}}r{\'{e}}e and Emmanuel Hainry and Mathieu Hoyrup and Romain P{\'{e}}choux}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {291--303}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_27}, doi = {10.1007/978-3-642-17517-6\_27}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/FereeHHP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Franklin10, author = {Matt Franklin}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Algorithmic Aspects of Secure Computation and Communication}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {2}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_2}, doi = {10.1007/978-3-642-17517-6\_2}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Franklin10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GiacomoDLM10, author = {Emilio Di Giacomo and Walter Didimo and Giuseppe Liotta and Henk Meijer}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Drawing a Tree as a Minimum Spanning Tree Approximation}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {61--72}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_6}, doi = {10.1007/978-3-642-17514-5\_6}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GiacomoDLM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GiesbrechtRT10, author = {Mark Giesbrecht and Daniel S. Roche and Hrushikesh Tilak}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Computing Sparse Multiples of Polynomials}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {266--278}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_25}, doi = {10.1007/978-3-642-17517-6\_25}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GiesbrechtRT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GoodrichS10, author = {Michael T. Goodrich and Darren Strash}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Priority Range Trees}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {97--108}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_11}, doi = {10.1007/978-3-642-17517-6\_11}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/GoodrichS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GruneLYKLLP10, author = {Ansgar Gr{\"{u}}ne and Tien{-}Ching Lin and Teng{-}Kai Yu and Rolf Klein and Elmar Langetepe and D. T. Lee and Sheung{-}Hung Poon}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Spanning Ratio and Maximum Detour of Rectilinear Paths in the \emph{L}\({}_{\mbox{1}}\) Plane}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {121--131}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_11}, doi = {10.1007/978-3-642-17514-5\_11}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GruneLYKLLP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GuT10, author = {Qian{-}Ping Gu and Hisao Tamaki}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {85--96}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_8}, doi = {10.1007/978-3-642-17514-5\_8}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GuT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HaeuplerJL10, author = {Bernhard Haeupler and Krishnam Raju Jampani and Anna Lubiw}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Testing Simultaneous Planarity When the Common Graph Is 2-Connected}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {410--421}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_35}, doi = {10.1007/978-3-642-17514-5\_35}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HaeuplerJL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HansenZ10, author = {Thomas Dueholm Hansen and Uri Zwick}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {415--426}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_37}, doi = {10.1007/978-3-642-17517-6\_37}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HansenZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HasunumaIOU10, author = {Toru Hasunuma and Toshimasa Ishii and Hirotaka Ono and Yushi Uno}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {The (\emph{p}, \emph{q})-total Labeling Problem for Trees}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {49--60}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_5}, doi = {10.1007/978-3-642-17514-5\_5}, timestamp = {Fri, 29 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/HasunumaIOU10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HeggernesMV10, author = {Pinar Heggernes and Daniel Meister and Yngve Villanger}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Induced Subgraph Isomorphism on Interval and Proper Interval Graphs}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {399--409}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_34}, doi = {10.1007/978-3-642-17514-5\_34}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HeggernesMV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/HsiehC10, author = {Sun{-}Yuan Hsieh and Chun{-}An Chen}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Computing the (\emph{t}, \emph{k})-Diagnosability of Component-Composition Graphs and Its Application}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {363--374}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_31}, doi = {10.1007/978-3-642-17514-5\_31}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/HsiehC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItoHZN10, author = {Takehiro Ito and Takuya Hara and Xiao Zhou and Takao Nishizeki}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Minimum Cost Partitions of Trees with Supply and Demand}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {351--362}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_30}, doi = {10.1007/978-3-642-17514-5\_30}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ItoHZN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/IwamaNRT10, author = {Kazuo Iwama and Harumichi Nishimura and Rudy Raymond and Junichi Teruyama}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Quantum Counterfeit Coin Problems}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {85--96}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_10}, doi = {10.1007/978-3-642-17517-6\_10}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/IwamaNRT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/IwamaSTT10, author = {Kazuo Iwama and Kazuhisa Seto and Tadashi Takai and Suguru Tamaki}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Improved Randomized Algorithms for 3-SAT}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {73--84}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_9}, doi = {10.1007/978-3-642-17517-6\_9}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/IwamaSTT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JampaniL10, author = {Krishnam Raju Jampani and Anna Lubiw}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Simultaneous Interval Graphs}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {206--217}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_20}, doi = {10.1007/978-3-642-17517-6\_20}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/JampaniL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Jiang10, author = {Minghui Jiang}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Approximability of Constrained {LCS}}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {180--191}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_16}, doi = {10.1007/978-3-642-17514-5\_16}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Jiang10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/JirasekK10, author = {Jozef Jir{\'{a}}sek and Pavel Klav{\'{\i}}k}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Structural and Complexity Aspects of Line Systems of Graphs}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {157--168}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_16}, doi = {10.1007/978-3-642-17517-6\_16}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/JirasekK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KarpinskiS10, author = {Marek Karpinski and Warren Schudy}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {3--14}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_3}, doi = {10.1007/978-3-642-17517-6\_3}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KarpinskiS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KavithaNN10, author = {Telikepalli Kavitha and Meghana Nasre and Prajakta Nimbhorkar}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Popularity at Minimum Cost}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {145--156}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_15}, doi = {10.1007/978-3-642-17517-6\_15}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/KavithaNN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KobayashiMT10, author = {Yasuaki Kobayashi and Yuichiro Miyamoto and Hisao Tamaki}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {\emph{k}-cyclic Orientations of Graphs}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {73--84}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_7}, doi = {10.1007/978-3-642-17514-5\_7}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KobayashiMT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiZ10, author = {Angsheng Li and Peng Zhang}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Unbalanced Graph Partitioning}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {218--229}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_21}, doi = {10.1007/978-3-642-17517-6\_21}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/LiangH10, author = {Hongyu Liang and Jing He}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Satisfiability with Index Dependency}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {49--60}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_7}, doi = {10.1007/978-3-642-17517-6\_7}, timestamp = {Mon, 15 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/LiangH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Limouzy10, author = {Vincent Limouzy}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Seidel Minor, Permutation Graphs and Combinatorial Properties}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {194--205}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_19}, doi = {10.1007/978-3-642-17517-6\_19}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Limouzy10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MertziosZ10, author = {George B. Mertzios and Shmuel Zaks}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {On the Intersection of Tolerance and Cocomparability Graphs}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {230--240}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_22}, doi = {10.1007/978-3-642-17517-6\_22}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MertziosZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Meyerhenke10, author = {Henning Meyerhenke}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {387--398}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_33}, doi = {10.1007/978-3-642-17514-5\_33}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Meyerhenke10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/MiyamotoUK10, author = {Yuichiro Miyamoto and Takeaki Uno and Mikio Kubo}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Levelwise Mesh Sparsification for Shortest Path Queries}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {121--132}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_13}, doi = {10.1007/978-3-642-17517-6\_13}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/MiyamotoUK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Nekrich10, author = {Yakov Nekrich}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Dynamic Range Reporting in External Memory}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {25--36}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_3}, doi = {10.1007/978-3-642-17514-5\_3}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Nekrich10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/NichterleinNUW10, author = {Andr{\'{e}} Nichterlein and Rolf Niedermeier and Johannes Uhlmann and Mathias Weller}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {On Tractable Cases of Target Set Selection}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {378--389}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_34}, doi = {10.1007/978-3-642-17517-6\_34}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/NichterleinNUW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PatitzS10, author = {Matthew J. Patitz and Scott M. Summers}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Identifying Shapes Using Self-assembly - (Extended Abstract)}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {458--469}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_39}, doi = {10.1007/978-3-642-17514-5\_39}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/PatitzS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/PeisSW10, author = {Britta Peis and Sebastian Stiller and Andreas Wiese}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Policies for Periodic Packet Routing}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {266--278}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_23}, doi = {10.1007/978-3-642-17514-5\_23}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/PeisSW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Shioura10, author = {Akiyoshi Shioura}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {169--181}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_17}, doi = {10.1007/978-3-642-17517-6\_17}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Shioura10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Spoerhase10, author = {Joachim Spoerhase}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {440--450}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_39}, doi = {10.1007/978-3-642-17517-6\_39}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/Spoerhase10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Stacho10, author = {Juraj Stacho}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {3-Colouring AT-Free Graphs in Polynomial Time}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {144--155}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_13}, doi = {10.1007/978-3-642-17514-5\_13}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Stacho10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/StillerW10, author = {Sebastian Stiller and Andreas Wiese}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Increasing Speed Scheduling and Flow Scheduling}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {279--290}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_24}, doi = {10.1007/978-3-642-17514-5\_24}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/StillerW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/SudholtZ10, author = {Dirk Sudholt and Christine Zarges}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Analysis of an Iterated Local Search Algorithm for Vertex Coloring}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {340--352}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_31}, doi = {10.1007/978-3-642-17517-6\_31}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/SudholtZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/TchiboukdjianGTRB10, author = {Marc Tchiboukdjian and Nicolas Gast and Denis Trystram and Jean{-}Louis Roch and Julien Bernard}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {A Tighter Analysis of Work Stealing}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {291--302}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_25}, doi = {10.1007/978-3-642-17514-5\_25}, timestamp = {Fri, 13 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/TchiboukdjianGTRB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ThielenW10, author = {Clemens Thielen and Stephan Westphal}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Approximating the Traveling Tournament Problem with Maximum Tour Length 2}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {303--314}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_26}, doi = {10.1007/978-3-642-17514-5\_26}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ThielenW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WuTLXC10, author = {Weiwei Wu and Wanyong Tian and Minming Li and Chun Jason Xue and Enhong Chen}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Single and Multiple Device {DSA} Problem, Complexities and Online Algorithms}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {218--229}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_19}, doi = {10.1007/978-3-642-17514-5\_19}, timestamp = {Thu, 23 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/WuTLXC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/XuXX10, author = {Jinhui Xu and Lei Xu and Yulai Xie}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Approximating Minimum Bending Energy Path in a Simple Corridor}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {328--339}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_30}, doi = {10.1007/978-3-642-17517-6\_30}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/XuXX10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/YuWK10, author = {Chih{-}Chiang Yu and Biing{-}Feng Wang and Chung{-}Chin Kuo}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {13--24}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_2}, doi = {10.1007/978-3-642-17514-5\_2}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/YuWK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ZhangCCHTT10, author = {Yong Zhang and Jing{-}Chi Chen and Francis Y. L. Chin and Xin Han and Hing{-}Fung Ting and Yung H. Tsin}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, pages = {242--253}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5\_21}, doi = {10.1007/978-3-642-17514-5\_21}, timestamp = {Thu, 22 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ZhangCCHTT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ZhuangN10, author = {Bingbing Zhuang and Hiroshi Nagamochi}, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Generating Trees on Multisets}, booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, pages = {182--193}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6\_18}, doi = {10.1007/978-3-642-17517-6\_18}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ZhuangN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2010-1, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6506}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17517-6}, doi = {10.1007/978-3-642-17517-6}, isbn = {978-3-642-17516-9}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2010-1.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/isaac/2010-2, editor = {Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park}, title = {Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {6507}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-17514-5}, doi = {10.1007/978-3-642-17514-5}, isbn = {978-3-642-17513-8}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/2010-2.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AdamaszekCL09, author = {Anna Adamaszek and Artur Czumaj and Andrzej Lingas}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {{PTAS} for \emph{k}-Tour Cover Problem on the Plane for Moderately Large Values of \emph{k}}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {994--1003}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_100}, doi = {10.1007/978-3-642-10631-6\_100}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AdamaszekCL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AgarwalNS09, author = {Shivali Agarwal and Ankur Narang and R. K. Shyamasundar}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Distributed Scheduling of Parallel Hybrid Computations}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {1144--1154}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_115}, doi = {10.1007/978-3-642-10631-6\_115}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AgarwalNS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Al-JubehIRST09, author = {Marwan Al{-}Jubeh and Mashhood Ishaque and Krist{\'{o}}f R{\'{e}}dei and Diane L. Souvaine and Csaba D. T{\'{o}}th}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {902--912}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_91}, doi = {10.1007/978-3-642-10631-6\_91}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Al-JubehIRST09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AlistarhGGT09, author = {Dan Alistarh and Seth Gilbert and Rachid Guerraoui and Corentin Travers}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {943--953}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_95}, doi = {10.1007/978-3-642-10631-6\_95}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/AlistarhGGT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AnderssonM09, author = {Daniel Andersson and Peter Bro Miltersen}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {The Complexity of Solving Stochastic Games on Graphs}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {112--121}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_13}, doi = {10.1007/978-3-642-10631-6\_13}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AnderssonM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/AnshelevichCHS09, author = {Elliot Anshelevich and Deeparnab Chakrabarty and Ameya Hate and Chaitanya Swamy}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {974--983}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_98}, doi = {10.1007/978-3-642-10631-6\_98}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/AnshelevichCHS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ArgeR09, author = {Lars Arge and Morten Revsb{\ae}k}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {I/O-Efficient Contour Tree Simplification}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {1155--1165}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_116}, doi = {10.1007/978-3-642-10631-6\_116}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ArgeR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ArroyueloCDDHLMNSS09, author = {Diego Arroyuelo and Francisco Claude and Reza Dorrigiv and Stephane Durocher and Meng He and Alejandro L{\'{o}}pez{-}Ortiz and J. Ian Munro and Patrick K. Nicholson and Alejandro Salinger and Matthew Skala}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Untangled Monotonic Chains and Adaptive Range Search}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {203--212}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_22}, doi = {10.1007/978-3-642-10631-6\_22}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/ArroyueloCDDHLMNSS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ArvindJS09, author = {Vikraman Arvind and Pushkar S. Joglekar and Srikanth Srinivasan}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {On Lower Bounds for Constant Width Arithmetic Circuits}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {637--646}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_65}, doi = {10.1007/978-3-642-10631-6\_65}, timestamp = {Tue, 17 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ArvindJS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BaeCLT09, author = {Sang Won Bae and Sunghee Choi and Chunseok Lee and Shin{-}ichi Tanigawa}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Exact Algorithms for the Bottleneck Steiner Tree Problem}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {24--33}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_5}, doi = {10.1007/978-3-642-10631-6\_5}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BaeCLT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BaeO09, author = {Sang Won Bae and Yoshio Okamoto}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Querying Two Boundary Points for Shortest Paths in a Polygonal Domain}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {1054--1063}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_106}, doi = {10.1007/978-3-642-10631-6\_106}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BaeO09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BansalCJPS09, author = {Nikhil Bansal and Alberto Caprara and Klaus Jansen and Lars Pr{\"{a}}del and Maxim Sviridenko}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {77--86}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_10}, doi = {10.1007/978-3-642-10631-6\_10}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BansalCJPS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/Bar-NoyL09, author = {Amotz Bar{-}Noy and Michael Lampis}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Online Maximum Directed Cut}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {1124--1133}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_113}, doi = {10.1007/978-3-642-10631-6\_113}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/Bar-NoyL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BazganCT09, author = {Cristina Bazgan and Basile Cou{\"{e}}toux and Zsolt Tuza}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Covering a Graph with a Constrained Forest (Extended Abstract)}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {892--901}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_90}, doi = {10.1007/978-3-642-10631-6\_90}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BazganCT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BellP09, author = {Paul Bell and Igor Potapov}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {The Identity Correspondence Problem and Its Applications}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {657--667}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_67}, doi = {10.1007/978-3-642-10631-6\_67}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BellP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BiedlDS09, author = {Therese Biedl and Stephane Durocher and Jack Snoeyink}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Reconstructing Polygons from Scanner Data}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {862--871}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_87}, doi = {10.1007/978-3-642-10631-6\_87}, timestamp = {Tue, 02 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BiedlDS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BockenhauerKKKM09, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Dennis Komm and Rastislav Kr{\'{a}}lovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {On the Advice Complexity of Online Problems}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {331--340}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_35}, doi = {10.1007/978-3-642-10631-6\_35}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BockenhauerKKKM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BonsmaB09, author = {Paul S. Bonsma and Felix Breuer}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Finding Fullerene Patches in Polynomial Time}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {750--759}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_76}, doi = {10.1007/978-3-642-10631-6\_76}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BonsmaB09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BourgeoisCEP09, author = {Nicolas Bourgeois and Federico Della Croce and Bruno Escoffier and Vangelis Th. Paschos}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Exact Algorithms for Dominating Clique Problems}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {4--13}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_3}, doi = {10.1007/978-3-642-10631-6\_3}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BourgeoisCEP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrodalFGL09, author = {Gerth St{\o}lting Brodal and Rolf Fagerberg and Mark Greve and Alejandro L{\'{o}}pez{-}Ortiz}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Online Sorted Range Reporting}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {173--182}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_19}, doi = {10.1007/978-3-642-10631-6\_19}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrodalFGL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrodalJ09, author = {Gerth St{\o}lting Brodal and Allan Gr{\o}nlund J{\o}rgensen}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Data Structures for Range Median Queries}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {822--831}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_83}, doi = {10.1007/978-3-642-10631-6\_83}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrodalJ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrodalJMM09, author = {Gerth St{\o}lting Brodal and Allan Gr{\o}nlund J{\o}rgensen and Gabriel Moruz and Thomas M{\o}lhave}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Counting in the Presence of Memory Faults}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {842--851}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_85}, doi = {10.1007/978-3-642-10631-6\_85}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrodalJMM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrodalKSTT09, author = {Gerth St{\o}lting Brodal and Alexis C. Kaporis and Spyros Sioutas and Konstantinos Tsakalidis and Kostas Tsichlas}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {193--202}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_21}, doi = {10.1007/978-3-642-10631-6\_21}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BrodalKSTT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BruceHS09, author = {Daniel Bruce and Ch{\'{\i}}nh T. Ho{\`{a}}ng and Joe Sawada}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {A Certifying Algorithm for 3-Colorability of \emph{P}\({}_{\mbox{5}}\)-Free Graphs}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {594--604}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_61}, doi = {10.1007/978-3-642-10631-6\_61}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BruceHS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BulteauFR09, author = {Laurent Bulteau and Guillaume Fertin and Irena Rusu}, editor = {Yingfei Dong and Ding{-}Zhu Du and Oscar H. Ibarra}, title = {Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms}, booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5878}, pages = {710--719}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10631-6\_72}, doi = {10.1007/978-3-642-10631-6\_72}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/BulteauFR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.