Wen-Lian Hsu, Der-Tsai Lee, and Chung-Shou Liao. LIPIcs, Volume 123, ISAAC'18, Complete Volume. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@Proceedings{hsu_et_al:LIPIcs.ISAAC.2018, title = {{LIPIcs, Volume 123, ISAAC'18, Complete Volume}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2019}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018}, URN = {urn:nbn:de:0030-drops-101600}, doi = {10.4230/LIPIcs.ISAAC.2018}, annote = {Keywords: Mathematics of computing, Theory of computation, Data structures design and analysis, Computing methodologies} }
Wen-Lian Hsu, Der-Tsai Lee, and Chung-Shou Liao. Front Matter, Table of Contents, Preface, Conference Organization. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 0:i-0:xviii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{hsu_et_al:LIPIcs.ISAAC.2018.0, author = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.0}, URN = {urn:nbn:de:0030-drops-99488}, doi = {10.4230/LIPIcs.ISAAC.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Shang-Hua Teng. Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk). In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, p. 1:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{teng:LIPIcs.ISAAC.2018.1, author = {Teng, Shang-Hua}, title = {{Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.1}, URN = {urn:nbn:de:0030-drops-99495}, doi = {10.4230/LIPIcs.ISAAC.2018.1}, annote = {Keywords: scalable algorithms, axiomatization, graph sparsification, local algorithms, advanced sampling, big data, network sciences, machine learning, social influence, beyond graph theory} }
Clifford Stein. Approximate Matchings in Massive Graphs via Local Structure (Invited Talk). In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, p. 2:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{stein:LIPIcs.ISAAC.2018.2, author = {Stein, Clifford}, title = {{Approximate Matchings in Massive Graphs via Local Structure}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.2}, URN = {urn:nbn:de:0030-drops-99505}, doi = {10.4230/LIPIcs.ISAAC.2018.2}, annote = {Keywords: matching, dynamic algorithms, parallel algorithms, approximation algorithms} }
Andreas Björklund. Exploiting Sparsity for Bipartite Hamiltonicity. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 3:1-3:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bjorklund:LIPIcs.ISAAC.2018.3, author = {Bj\"{o}rklund, Andreas}, title = {{Exploiting Sparsity for Bipartite Hamiltonicity}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {3:1--3:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.3}, URN = {urn:nbn:de:0030-drops-99510}, doi = {10.4230/LIPIcs.ISAAC.2018.3}, annote = {Keywords: Hamiltonian cycle, bipartite graph} }
Ahad N. Zehmakan. Opinion Forming in Erdös-Rényi Random Graph and Expanders. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 4:1-4:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{n.zehmakan:LIPIcs.ISAAC.2018.4, author = {N. Zehmakan, Ahad}, title = {{Opinion Forming in Erd\"{o}s-R\'{e}nyi Random Graph and Expanders}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {4:1--4:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.4}, URN = {urn:nbn:de:0030-drops-99529}, doi = {10.4230/LIPIcs.ISAAC.2018.4}, annote = {Keywords: majority model, random graph, expander graphs, dynamic monopoly, bootstrap percolation} }
Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, and Veronika Slívová. Colouring (P_r+P_s)-Free Graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 5:1-5:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{klimosova_et_al:LIPIcs.ISAAC.2018.5, author = {Klimosov\'{a}, Tereza and Mal{\'\i}k, Josef and Masar{\'\i}k, Tom\'{a}s and Novotn\'{a}, Jana and Paulusma, Dani\"{e}l and Sl{\'\i}vov\'{a}, Veronika}, title = {{Colouring (P\underliner+P\underlines)-Free Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {5:1--5:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.5}, URN = {urn:nbn:de:0030-drops-99533}, doi = {10.4230/LIPIcs.ISAAC.2018.5}, annote = {Keywords: vertex colouring, H-free graph, linear forest} }
Guillaume Ducoffe and Alexandru Popa. The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 6:1-6:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ducoffe_et_al:LIPIcs.ISAAC.2018.6, author = {Ducoffe, Guillaume and Popa, Alexandru}, 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)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.6}, URN = {urn:nbn:de:0030-drops-99549}, doi = {10.4230/LIPIcs.ISAAC.2018.6}, annote = {Keywords: maximum matching, FPT in P, modular decomposition, pruned graphs, one-vertex extensions, P\underline4-structure} }
Davide Bilò and Kleitos Papadopoulos. A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 7:1-7:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bilo_et_al:LIPIcs.ISAAC.2018.7, author = {Bil\`{o}, Davide and Papadopoulos, Kleitos}, title = {{A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {7:1--7:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.7}, URN = {urn:nbn:de:0030-drops-99557}, doi = {10.4230/LIPIcs.ISAAC.2018.7}, annote = {Keywords: Transient edge failure, best swap edges, tree spanner} }
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, and Takeaki Uno. Efficient Enumeration of Dominating Sets for Sparse Graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 8:1-8:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kurita_et_al:LIPIcs.ISAAC.2018.8, author = {Kurita, Kazuhiro and Wasa, Kunihiro and Arimura, Hiroki and Uno, Takeaki}, title = {{Efficient Enumeration of Dominating Sets for Sparse Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.8}, URN = {urn:nbn:de:0030-drops-99560}, doi = {10.4230/LIPIcs.ISAAC.2018.8}, annote = {Keywords: Enumeration algorithm, polynomial amortized time, dominating set, girth, degeneracy} }
Md Lutfar Rahman and Thomas Watson. Complexity of Unordered CNF Games. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 9:1-9:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{rahman_et_al:LIPIcs.ISAAC.2018.9, author = {Rahman, Md Lutfar and Watson, Thomas}, title = {{Complexity of Unordered CNF Games}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {9:1--9:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.9}, URN = {urn:nbn:de:0030-drops-99574}, doi = {10.4230/LIPIcs.ISAAC.2018.9}, annote = {Keywords: CNF, Games, PSPACE-complete, SAT, Linear Time} }
Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, and Alexander V. Smal. Half-Duplex Communication Complexity. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 10:1-10:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{hoover_et_al:LIPIcs.ISAAC.2018.10, author = {Hoover, Kenneth and Impagliazzo, Russell and Mihajlin, Ivan and Smal, Alexander V.}, title = {{Half-Duplex Communication Complexity}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {10:1--10:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.10}, URN = {urn:nbn:de:0030-drops-99583}, doi = {10.4230/LIPIcs.ISAAC.2018.10}, annote = {Keywords: communication complexity, half-duplex channel, information theory} }
Takashi Ishizuka and Naoyuki Kamiyama. On the Complexity of Stable Fractional Hypergraph Matching. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 11:1-11:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ishizuka_et_al:LIPIcs.ISAAC.2018.11, author = {Ishizuka, Takashi and Kamiyama, Naoyuki}, title = {{On the Complexity of Stable Fractional Hypergraph Matching}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {11:1--11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.11}, URN = {urn:nbn:de:0030-drops-99590}, doi = {10.4230/LIPIcs.ISAAC.2018.11}, annote = {Keywords: fractional hypergraph matching, stable matching, PPAD-completeness} }
Matthew P. Johnson. Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 12:1-12:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{johnson:LIPIcs.ISAAC.2018.12, author = {Johnson, Matthew P.}, title = {{Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {12:1--12:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.12}, URN = {urn:nbn:de:0030-drops-99600}, doi = {10.4230/LIPIcs.ISAAC.2018.12}, annote = {Keywords: phylogenetic trees, rooted triple entailment, NP-Completeness, directed hypergraphs, acyclic induced subgraphs, computational complexity} }
Johanna E. Preißer and Jens M. Schmidt. Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 13:1-13:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{preier_et_al:LIPIcs.ISAAC.2018.13, author = {Prei{\ss}er, Johanna E. and Schmidt, Jens M.}, title = {{Computing Vertex-Disjoint Paths in Large Graphs Using MAOs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {13:1--13:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.13}, URN = {urn:nbn:de:0030-drops-99613}, doi = {10.4230/LIPIcs.ISAAC.2018.13}, annote = {Keywords: Computing Disjoint Paths, Large Graphs, Vertex-Connectivity, Linear-Time, Maximal Adjacency Ordering, Maximum Cardinality Search, Big Data, Certifying Algorithm} }
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, and Naoki Katoh. An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 14:1-14:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bhattacharya_et_al:LIPIcs.ISAAC.2018.14, author = {Bhattacharya, Binay and Higashikawa, Yuya and Kameda, Tsunehiko and Katoh, Naoki}, title = {{An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.14}, URN = {urn:nbn:de:0030-drops-99624}, doi = {10.4230/LIPIcs.ISAAC.2018.14}, annote = {Keywords: Facility location, minsum sink, evacuation problem, minmax regret, dynamic flow path network} }
Delia Garijo, Alberto Márquez, Natalia Rodríguez, and Rodrigo I. Silveira. Computing Optimal Shortcuts for Networks. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 15:1-15:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{garijo_et_al:LIPIcs.ISAAC.2018.15, author = {Garijo, Delia and M\'{a}rquez, Alberto and Rodr{\'\i}guez, Natalia and Silveira, Rodrigo I.}, title = {{Computing Optimal Shortcuts for Networks}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {15:1--15:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.15}, URN = {urn:nbn:de:0030-drops-99634}, doi = {10.4230/LIPIcs.ISAAC.2018.15}, annote = {Keywords: graph augmentation, shortcut, diameter, geometric graph} }
Georgia Avarikioti, Yuyi Wang, and Roger Wattenhofer. Algorithmic Channel Design. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 16:1-16:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{avarikioti_et_al:LIPIcs.ISAAC.2018.16, author = {Avarikioti, Georgia and Wang, Yuyi and Wattenhofer, Roger}, title = {{Algorithmic Channel Design}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {16:1--16:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.16}, URN = {urn:nbn:de:0030-drops-99648}, doi = {10.4230/LIPIcs.ISAAC.2018.16}, annote = {Keywords: blockchain, payment channels, layer 2 solution, network design, payment hubs, routing} }
Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 17:1-17:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bjorklund_et_al:LIPIcs.ISAAC.2018.17, author = {Bj\"{o}rklund, Andreas and Husfeldt, Thore and Kaski, Petteri and Koivisto, Mikko}, title = {{Counting Connected Subgraphs with Maximum-Degree-Aware Sieving}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {17:1--17:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.17}, URN = {urn:nbn:de:0030-drops-99655}, doi = {10.4230/LIPIcs.ISAAC.2018.17}, annote = {Keywords: graph embedding, k-path, subgraph counting, maximum degree} }
Pavel Dvorák, Dusan Knop, and Tomás Toufar. Target Set Selection in Dense Graph Classes. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 18:1-18:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{dvorak_et_al:LIPIcs.ISAAC.2018.18, author = {Dvor\'{a}k, Pavel and Knop, Dusan and Toufar, Tom\'{a}s}, title = {{Target Set Selection in Dense Graph Classes}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {18:1--18:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.18}, URN = {urn:nbn:de:0030-drops-99666}, doi = {10.4230/LIPIcs.ISAAC.2018.18}, annote = {Keywords: parameterized complexity, target set selection, dense graphs} }
Andreas Björklund and Thore Husfeldt. Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 19:1-19:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bjorklund_et_al:LIPIcs.ISAAC.2018.19, author = {Bj\"{o}rklund, Andreas and Husfeldt, Thore}, title = {{Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {19:1--19:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.19}, URN = {urn:nbn:de:0030-drops-99670}, doi = {10.4230/LIPIcs.ISAAC.2018.19}, annote = {Keywords: Shortest disjoint paths, Cubic planar graph} }
Eun Jung Kim, Maria Serna, and Dimitrios M. Thilikos. Data-Compression for Parametrized Counting Problems on Sparse Graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 20:1-20:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kim_et_al:LIPIcs.ISAAC.2018.20, author = {Kim, Eun Jung and Serna, Maria and Thilikos, Dimitrios M.}, title = {{Data-Compression for Parametrized Counting Problems on Sparse Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {20:1--20:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.20}, URN = {urn:nbn:de:0030-drops-99688}, doi = {10.4230/LIPIcs.ISAAC.2018.20}, annote = {Keywords: Parameterized counting, compactor, protrusion decomposition} }
Samir Datta, Raghav Kulkarni, Ashish Kumar, and Anish Mukherjee. Planar Maximum Matching: Towards a Parallel Algorithm. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 21:1-21:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{datta_et_al:LIPIcs.ISAAC.2018.21, author = {Datta, Samir and Kulkarni, Raghav and Kumar, Ashish and Mukherjee, Anish}, title = {{Planar Maximum Matching: Towards a Parallel Algorithm}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {21:1--21:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.21}, URN = {urn:nbn:de:0030-drops-99695}, doi = {10.4230/LIPIcs.ISAAC.2018.21}, annote = {Keywords: maximum matching, planar graphs, parallel complexity, reductions} }
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, and Marcin Witkowski. Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 22:1-22:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{czygrinow_et_al:LIPIcs.ISAAC.2018.22, author = {Czygrinow, Andrzej and Hanckowiak, Michal and Wawrzyniak, Wojciech and Witkowski, Marcin}, title = {{Distributed Approximation Algorithms for the Minimum Dominating Set in K\underlineh-Minor-Free Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {22:1--22:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.22}, URN = {urn:nbn:de:0030-drops-99705}, doi = {10.4230/LIPIcs.ISAAC.2018.22}, annote = {Keywords: Distributed algorithms, minor-closed family of graphs, MDS} }
Cody Geary, Pierre-Étienne Meunier, Nicolas Schabanel, and Shinnosuke Seki. Proving the Turing Universality of Oritatami Co-Transcriptional Folding. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 23:1-23:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{geary_et_al:LIPIcs.ISAAC.2018.23, author = {Geary, Cody and Meunier, Pierre-\'{E}tienne and Schabanel, Nicolas and Seki, Shinnosuke}, title = {{Proving the Turing Universality of Oritatami Co-Transcriptional Folding}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {23:1--23:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.23}, URN = {urn:nbn:de:0030-drops-99715}, doi = {10.4230/LIPIcs.ISAAC.2018.23}, annote = {Keywords: Molecular computing, Turing universality, co-transcriptional folding} }
Jiehua Chen, Hendrik Molter, Manuel Sorge, and Ondrej Suchý. Cluster Editing in Multi-Layer and Temporal Graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 24:1-24:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2018.24, author = {Chen, Jiehua and Molter, Hendrik and Sorge, Manuel and Such\'{y}, Ondrej}, title = {{Cluster Editing in Multi-Layer and Temporal Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {24:1--24:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.24}, URN = {urn:nbn:de:0030-drops-99729}, doi = {10.4230/LIPIcs.ISAAC.2018.24}, annote = {Keywords: Cluster Editing, Temporal Graphs, Multi-Layer Graphs, Fixed-Parameter Algorithms, Polynomial Kernels, Parameterized Complexity} }
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, and Saket Saurabh. Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 25:1-25:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bishnu_et_al:LIPIcs.ISAAC.2018.25, author = {Bishnu, Arijit and Ghosh, Arijit and Kolay, Sudeshna and Mishra, Gopinath and Saurabh, Saket}, title = {{Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {25:1--25:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.25}, URN = {urn:nbn:de:0030-drops-99735}, doi = {10.4230/LIPIcs.ISAAC.2018.25}, annote = {Keywords: Query complexity, Hitting set, Parameterized complexity} }
Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, and Allen Xiao. Approximate Minimum-Weight Matching with Outliers Under Translation. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 26:1-26:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{agarwal_et_al:LIPIcs.ISAAC.2018.26, author = {Agarwal, Pankaj K. and Kaplan, Haim and Kipper, Geva and Mulzer, Wolfgang and Rote, G\"{u}nter and Sharir, Micha and Xiao, Allen}, title = {{Approximate Minimum-Weight Matching with Outliers Under Translation}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.26}, URN = {urn:nbn:de:0030-drops-99747}, doi = {10.4230/LIPIcs.ISAAC.2018.26}, annote = {Keywords: Minimum-weight partial matching, Pattern matching, Approximation} }
Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, and Takeyuki Tamura. New and Improved Algorithms for Unordered Tree Inclusion. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 27:1-27:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{akutsu_et_al:LIPIcs.ISAAC.2018.27, author = {Akutsu, Tatsuya and Jansson, Jesper and Li, Ruiming and Takasu, Atsuhiro and Tamura, Takeyuki}, title = {{New and Improved Algorithms for Unordered Tree Inclusion}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {27:1--27:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.27}, URN = {urn:nbn:de:0030-drops-99752}, doi = {10.4230/LIPIcs.ISAAC.2018.27}, annote = {Keywords: parameterized algorithms, tree inclusion, unordered trees, dynamic programming} }
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, and Torsten Ueckerdt. Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 28:1-28:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{angelini_et_al:LIPIcs.ISAAC.2018.28, author = {Angelini, Patrizio and Bekos, Michael A. and Kaufmann, Michael and Pfister, Maximilian and Ueckerdt, Torsten}, title = {{Beyond-Planarity: Tur\'{a}n-Type Results for Non-Planar Bipartite Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {28:1--28:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.28}, URN = {urn:nbn:de:0030-drops-99763}, doi = {10.4230/LIPIcs.ISAAC.2018.28}, annote = {Keywords: Bipartite topological graphs, beyond planarity, density, Crossing Lemma} }
Yen-Ting Chen, Meng-Tsung Tsai, and Shi-Chun Tsai. A Dichotomy Result for Cyclic-Order Traversing Games. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 29:1-29:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2018.29, author = {Chen, Yen-Ting and Tsai, Meng-Tsung and Tsai, Shi-Chun}, title = {{A Dichotomy Result for Cyclic-Order Traversing Games}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {29:1--29:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.29}, URN = {urn:nbn:de:0030-drops-99775}, doi = {10.4230/LIPIcs.ISAAC.2018.29}, annote = {Keywords: st-planar graphs, biconnectivity, fault-tolerant routing algorithms, software defined network} }
Guillaume Ducoffe and Alexandru Popa. The b-Matching Problem in Distance-Hereditary Graphs and Beyond. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 30:1-30:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ducoffe_et_al:LIPIcs.ISAAC.2018.30, author = {Ducoffe, Guillaume and Popa, Alexandru}, title = {{The b-Matching Problem in Distance-Hereditary Graphs and Beyond}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {30:1--30:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.30}, URN = {urn:nbn:de:0030-drops-99783}, doi = {10.4230/LIPIcs.ISAAC.2018.30}, annote = {Keywords: maximum-cardinality matching, b-matching, FPT in P, split decomposition, distance-hereditary graphs} }
Qilong Feng, Guanlan Tan, Senmin Zhu, Bin Fu, and Jianxin Wang. New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 31:1-31:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{feng_et_al:LIPIcs.ISAAC.2018.31, author = {Feng, Qilong and Tan, Guanlan and Zhu, Senmin and Fu, Bin and Wang, Jianxin}, 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)}, pages = {31:1--31:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.31}, URN = {urn:nbn:de:0030-drops-99790}, doi = {10.4230/LIPIcs.ISAAC.2018.31}, annote = {Keywords: K\"{o}nig-Egerv\'{a}ry graph, Gallai-Edmonds decomposition} }
Michael Matheny and Jeff M. Phillips. Computing Approximate Statistical Discrepancy. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 32:1-32:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{matheny_et_al:LIPIcs.ISAAC.2018.32, author = {Matheny, Michael and Phillips, Jeff M.}, title = {{Computing Approximate Statistical Discrepancy}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {32:1--32:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.32}, URN = {urn:nbn:de:0030-drops-99800}, doi = {10.4230/LIPIcs.ISAAC.2018.32}, annote = {Keywords: Scan Statistics, Discrepancy, Rectangles} }
Alfonso Cevallos, Friedrich Eisenbrand, and Sarah Morell. Diversity Maximization in Doubling Metrics. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 33:1-33:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{cevallos_et_al:LIPIcs.ISAAC.2018.33, author = {Cevallos, Alfonso and Eisenbrand, Friedrich and Morell, Sarah}, title = {{Diversity Maximization in Doubling Metrics}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {33:1--33:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.33}, URN = {urn:nbn:de:0030-drops-99818}, doi = {10.4230/LIPIcs.ISAAC.2018.33}, annote = {Keywords: Remote-clique, remote-star, remote-bipartition, doubling dimension, grid rounding, epsilon-nets, polynomial time approximation scheme, facility location, information retrieval} }
Nader H. Bshouty and Waseem Makhoul. On Polynomial Time Constructions of Minimum Height Decision Tree. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 34:1-34:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{h.bshouty_et_al:LIPIcs.ISAAC.2018.34, author = {H. Bshouty, Nader and Makhoul, Waseem}, title = {{On Polynomial Time Constructions of Minimum Height Decision Tree}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {34:1--34:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.34}, URN = {urn:nbn:de:0030-drops-99824}, doi = {10.4230/LIPIcs.ISAAC.2018.34}, annote = {Keywords: Decision Tree, Minimal Depth, Approximation algorithms} }
Divesh Aggarwal and Priyanka Mukhopadhyay. Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 35:1-35:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{aggarwal_et_al:LIPIcs.ISAAC.2018.35, author = {Aggarwal, Divesh and Mukhopadhyay, Priyanka}, 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)}, pages = {35:1--35:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.35}, URN = {urn:nbn:de:0030-drops-99837}, doi = {10.4230/LIPIcs.ISAAC.2018.35}, annote = {Keywords: Lattice, Shortest Vector Problem, Closest Vector Problem, l\underlineinfty norm} }
Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, and Rolf Niedermeier. An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 36:1-36:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bentert_et_al:LIPIcs.ISAAC.2018.36, author = {Bentert, Matthias and Dittmann, Alexander and Kellerhals, Leon and Nichterlein, Andr\'{e} and Niedermeier, Rolf}, title = {{An Adaptive Version of Brandes' Algorithm for Betweenness Centrality}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {36:1--36:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.36}, URN = {urn:nbn:de:0030-drops-99846}, doi = {10.4230/LIPIcs.ISAAC.2018.36}, annote = {Keywords: network science, social network analysis, centrality measures, shortest paths, tree-like graphs, efficient pre- and postprocessing, FPT in P} }
Hiroki Osawa, Akira Suzuki, Takehiro Ito, and Xiao Zhou. Algorithms for Coloring Reconfiguration Under Recolorability Constraints. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 37:1-37:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{osawa_et_al:LIPIcs.ISAAC.2018.37, author = {Osawa, Hiroki and Suzuki, Akira and Ito, Takehiro and Zhou, Xiao}, title = {{Algorithms for Coloring Reconfiguration Under Recolorability Constraints}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {37:1--37:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.37}, URN = {urn:nbn:de:0030-drops-99850}, doi = {10.4230/LIPIcs.ISAAC.2018.37}, annote = {Keywords: combinatorial reconfiguration, graph algorithm, graph coloring} }
On-Hei S. Lo and Jens M. Schmidt. A Cut Tree Representation for Pendant Pairs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 38:1-38:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{lo_et_al:LIPIcs.ISAAC.2018.38, author = {Lo, On-Hei S. and Schmidt, Jens M.}, title = {{A Cut Tree Representation for Pendant Pairs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {38:1--38:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.38}, URN = {urn:nbn:de:0030-drops-99869}, doi = {10.4230/LIPIcs.ISAAC.2018.38}, annote = {Keywords: Pendant Pairs, Pendant Tree, Maximal Adjacency Ordering, Maximum Cardinality Search, Testing Edge-Connectivity, Gomory-Hu Tree} }
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, and Fabrizio Montecchiani. Polyline Drawings with Topological Constraints. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 39:1-39:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{digiacomo_et_al:LIPIcs.ISAAC.2018.39, author = {Di Giacomo, Emilio and Eades, Peter and Liotta, Giuseppe and Meijer, Henk and Montecchiani, Fabrizio}, title = {{Polyline Drawings with Topological Constraints}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {39:1--39:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.39}, URN = {urn:nbn:de:0030-drops-99871}, doi = {10.4230/LIPIcs.ISAAC.2018.39}, annote = {Keywords: Topological graphs, graph drawing, curve complexity, skewness-k graphs, k-planar graphs} }
Davide Bilò. Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 40:1-40:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bilo:LIPIcs.ISAAC.2018.40, author = {Bil\`{o}, Davide}, title = {{Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {40:1--40:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.40}, URN = {urn:nbn:de:0030-drops-99888}, doi = {10.4230/LIPIcs.ISAAC.2018.40}, annote = {Keywords: Graph diameter, augmentation problem, trees, time-efficient algorithms} }
Giordano Da Lozzo and Ignaz Rutter. Approximation Algorithms for Facial Cycles in Planar Embeddings. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 41:1-41:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{dalozzo_et_al:LIPIcs.ISAAC.2018.41, author = {Da Lozzo, Giordano and Rutter, Ignaz}, title = {{Approximation Algorithms for Facial Cycles in Planar Embeddings}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {41:1--41:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.41}, URN = {urn:nbn:de:0030-drops-99895}, doi = {10.4230/LIPIcs.ISAAC.2018.41}, annote = {Keywords: Planar Embeddings, Facial Cycles, Complexity, Approximation Algorithms} }
Adam Kunysz. An Algorithm for the Maximum Weight Strongly Stable Matching Problem. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 42:1-42:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kunysz:LIPIcs.ISAAC.2018.42, author = {Kunysz, Adam}, title = {{An Algorithm for the Maximum Weight Strongly Stable Matching Problem}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {42:1--42:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.42}, URN = {urn:nbn:de:0030-drops-99902}, doi = {10.4230/LIPIcs.ISAAC.2018.42}, annote = {Keywords: Stable marriage, Strongly stable matching, Weighted matching, Rotation} }
Eunpyeong Hong and Mong-Jen Kao. Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 43:1-43:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{hong_et_al:LIPIcs.ISAAC.2018.43, author = {Hong, Eunpyeong and Kao, Mong-Jen}, title = {{Approximation Algorithm for Vertex Cover with Multiple Covering Constraints}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {43:1--43:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.43}, URN = {urn:nbn:de:0030-drops-99919}, doi = {10.4230/LIPIcs.ISAAC.2018.43}, annote = {Keywords: Vertex cover, multiple cover constraints, Approximation algorithm} }
David F. Gleich, Nate Veldt, and Anthony Wirth. Correlation Clustering Generalized. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 44:1-44:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gleich_et_al:LIPIcs.ISAAC.2018.44, author = {Gleich, David F. and Veldt, Nate and Wirth, Anthony}, title = {{Correlation Clustering Generalized}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {44:1--44:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.44}, URN = {urn:nbn:de:0030-drops-99925}, doi = {10.4230/LIPIcs.ISAAC.2018.44}, annote = {Keywords: Correlation Clustering, Approximation Algorithms} }
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, and Frits C. R. Spieksma. Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 45:1-45:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ficker_et_al:LIPIcs.ISAAC.2018.45, author = {Ficker, Annette M. C. and Erlebach, Thomas and Mihal\'{a}k, Mat\'{u}s and Spieksma, Frits C. R.}, title = {{Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {45:1--45:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.45}, URN = {urn:nbn:de:0030-drops-99933}, doi = {10.4230/LIPIcs.ISAAC.2018.45}, annote = {Keywords: approximation algorithm, matching, clustering problem} }
Johannes Blömer, Sascha Brauer, and Kathrin Bujna. Coresets for Fuzzy K-Means with Applications. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 46:1-46:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{blomer_et_al:LIPIcs.ISAAC.2018.46, author = {Bl\"{o}mer, Johannes and Brauer, Sascha and Bujna, Kathrin}, title = {{Coresets for Fuzzy K-Means with Applications}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {46:1--46:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.46}, URN = {urn:nbn:de:0030-drops-99942}, doi = {10.4230/LIPIcs.ISAAC.2018.46}, annote = {Keywords: clustering, fuzzy k-means, coresets, approximation algorithms, streaming} }
Martín Farach-Colton, Meng Li, and Meng-Tsung Tsai. Streaming Algorithms for Planar Convex Hulls. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 47:1-47:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{farachcolton_et_al:LIPIcs.ISAAC.2018.47, author = {Farach-Colton, Mart{\'\i}n and Li, Meng and Tsai, Meng-Tsung}, title = {{Streaming Algorithms for Planar Convex Hulls}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {47:1--47:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.47}, URN = {urn:nbn:de:0030-drops-99951}, doi = {10.4230/LIPIcs.ISAAC.2018.47}, annote = {Keywords: Convex Hulls, Streaming Algorithms, Lower Bounds} }
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, and Franck Petit. Deterministic Treasure Hunt in the Plane with Angular Hints. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 48:1-48:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bouchard_et_al:LIPIcs.ISAAC.2018.48, author = {Bouchard, S\'{e}bastien and Dieudonn\'{e}, Yoann and Pelc, Andrzej and Petit, Franck}, title = {{Deterministic Treasure Hunt in the Plane with Angular Hints}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {48:1--48:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.48}, URN = {urn:nbn:de:0030-drops-99964}, doi = {10.4230/LIPIcs.ISAAC.2018.48}, annote = {Keywords: treasure hunt, deterministic algorithm, mobile agent, hint, plane} }
Quirijn Bouts, Thom Castermans, Arthur van Goethem, Marc van Kreveld, and Wouter Meulemans. Competitive Searching for a Line on a Line Arrangement. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 49:1-49:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bouts_et_al:LIPIcs.ISAAC.2018.49, author = {Bouts, Quirijn and Castermans, Thom and van Goethem, Arthur and van Kreveld, Marc and Meulemans, Wouter}, title = {{Competitive Searching for a Line on a Line Arrangement}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {49:1--49:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.49}, URN = {urn:nbn:de:0030-drops-99970}, doi = {10.4230/LIPIcs.ISAAC.2018.49}, annote = {Keywords: Competitive searching, line arrangement, detour factor, search strategy} }
Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, and Max Willert. Stabbing Pairwise Intersecting Disks by Five Points. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 50:1-50:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{harpeled_et_al:LIPIcs.ISAAC.2018.50, author = {Har-Peled, Sariel and Kaplan, Haim and Mulzer, Wolfgang and Roditty, Liam and Seiferth, Paul and Sharir, Micha and Willert, Max}, title = {{Stabbing Pairwise Intersecting Disks by Five Points}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {50:1--50:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.50}, URN = {urn:nbn:de:0030-drops-99989}, doi = {10.4230/LIPIcs.ISAAC.2018.50}, annote = {Keywords: Disk graph, piercing set, LP-type problem} }
Eunjin Oh. Point Location in Incremental Planar Subdivisions. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{oh:LIPIcs.ISAAC.2018.51, author = {Oh, Eunjin}, title = {{Point Location in Incremental Planar Subdivisions}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {51:1--51:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.51}, URN = {urn:nbn:de:0030-drops-99991}, doi = {10.4230/LIPIcs.ISAAC.2018.51}, annote = {Keywords: Dynamic point location, general incremental planar subdivisions} }
Vahideh Keikha, Mees van de Kerkhof, Marc van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, and Lionov Wiratma. Convex Partial Transversals of Planar Regions. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 52:1-52:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{keikha_et_al:LIPIcs.ISAAC.2018.52, author = {Keikha, Vahideh and van de Kerkhof, Mees and van Kreveld, Marc and Kostitsyna, Irina and L\"{o}ffler, Maarten and Staals, Frank and Urhausen, J\'{e}r\^{o}me and Vermeulen, Jordi L. and Wiratma, Lionov}, title = {{Convex Partial Transversals of Planar Regions}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {52:1--52:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.52}, URN = {urn:nbn:de:0030-drops-100003}, doi = {10.4230/LIPIcs.ISAAC.2018.52}, annote = {Keywords: computational geometry, algorithms, NP-hardness, convex transversals} }
Alexander Pilz and Patrick Schnider. Extending the Centerpoint Theorem to Multiple Points. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 53:1-53:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{pilz_et_al:LIPIcs.ISAAC.2018.53, author = {Pilz, Alexander and Schnider, Patrick}, title = {{Extending the Centerpoint Theorem to Multiple Points}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {53:1--53:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.53}, URN = {urn:nbn:de:0030-drops-100019}, doi = {10.4230/LIPIcs.ISAAC.2018.53}, annote = {Keywords: centerpoint, point sets, Tukey depth} }
Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti, and Shubham Ugare. Approximate Query Processing over Static Sets and Sliding Windows. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 54:1-54:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{benbasat_et_al:LIPIcs.ISAAC.2018.54, author = {Ben Basat, Ran and Jo, Seungbum and Satti, Srinivasa Rao and Ugare, Shubham}, title = {{Approximate Query Processing over Static Sets and Sliding Windows}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {54:1--54:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.54}, URN = {urn:nbn:de:0030-drops-100027}, doi = {10.4230/LIPIcs.ISAAC.2018.54}, annote = {Keywords: Streaming, Algorithms, Sliding window, Lower bounds} }
Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, and Thatchaphol Saranurak. Multi-Finger Binary Search Trees. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 55:1-55:26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chalermsook_et_al:LIPIcs.ISAAC.2018.55, author = {Chalermsook, Parinya and Goswami, Mayank and Kozma, L\'{a}szl\'{o} and Mehlhorn, Kurt and Saranurak, Thatchaphol}, title = {{Multi-Finger Binary Search Trees}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {55:1--55:26}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.55}, URN = {urn:nbn:de:0030-drops-100032}, doi = {10.4230/LIPIcs.ISAAC.2018.55}, annote = {Keywords: binary search trees, dynamic optimality, finger search, k-server} }
Ivona Bezáková and Andrew Searns. On Counting Oracles for Path Problems. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 56:1-56:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bezakova_et_al:LIPIcs.ISAAC.2018.56, author = {Bez\'{a}kov\'{a}, Ivona and Searns, Andrew}, title = {{On Counting Oracles for Path Problems}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {56:1--56:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.56}, URN = {urn:nbn:de:0030-drops-100042}, doi = {10.4230/LIPIcs.ISAAC.2018.56}, annote = {Keywords: Counting oracle, Path problems, Shortest paths, Separators} }
Hiroshi Hirai and Yuni Iwamasa. Reconstructing Phylogenetic Tree From Multipartite Quartet System. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 57:1-57:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{hirai_et_al:LIPIcs.ISAAC.2018.57, author = {Hirai, Hiroshi and Iwamasa, Yuni}, title = {{Reconstructing Phylogenetic Tree From Multipartite Quartet System}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {57:1--57:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.57}, URN = {urn:nbn:de:0030-drops-100056}, doi = {10.4230/LIPIcs.ISAAC.2018.57}, annote = {Keywords: phylogenetic tree, quartet system, reconstruction} }
Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, and Marcel Roeloffzen. Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 58:1-58:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{arseneva_et_al:LIPIcs.ISAAC.2018.58, author = {Arseneva, Elena and Chiu, Man-Kwun and Korman, Matias and Markovic, Aleksandar and Okamoto, Yoshio and Ooms, Aur\'{e}lien and van Renssen, Andr\'{e} and Roeloffzen, Marcel}, title = {{Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {58:1--58:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.58}, URN = {urn:nbn:de:0030-drops-100060}, doi = {10.4230/LIPIcs.ISAAC.2018.58}, annote = {Keywords: Rectilinear link distance, polygonal domain, diameter, radius} }
Eunjin Oh. Minimizing Distance-to-Sight in Polygonal Domains. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 59:1-59:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{oh:LIPIcs.ISAAC.2018.59, author = {Oh, Eunjin}, title = {{Minimizing Distance-to-Sight in Polygonal Domains}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {59:1--59:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.59}, URN = {urn:nbn:de:0030-drops-100073}, doi = {10.4230/LIPIcs.ISAAC.2018.59}, annote = {Keywords: Visibility in polygonal domains, shortest path in polygonal domains} }
Franz Aurenhammer, Michael Steinkogler, and Rolf Klein. Partially Walking a Polygon. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 60:1-60:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{aurenhammer_et_al:LIPIcs.ISAAC.2018.60, author = {Aurenhammer, Franz and Steinkogler, Michael and Klein, Rolf}, title = {{Partially Walking a Polygon}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {60:1--60:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.60}, URN = {urn:nbn:de:0030-drops-100089}, doi = {10.4230/LIPIcs.ISAAC.2018.60}, annote = {Keywords: Polygon, guard walk, visibility} }
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, and Alexander Wolff. Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chan_et_al:LIPIcs.ISAAC.2018.61, author = {Chan, Timothy M. and van Dijk, Thomas C. and Fleszar, Krzysztof and Spoerhase, Joachim and Wolff, Alexander}, title = {{Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {61:1--61:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.61}, URN = {urn:nbn:de:0030-drops-100094}, doi = {10.4230/LIPIcs.ISAAC.2018.61}, annote = {Keywords: Geometric optimization, NP-hard, approximation, shallow-cell complexity, line stabbing} }
Xingwu Liu, Zhida Pan, Yuyi Wang, and Roger Wattenhofer. Impatient Online Matching. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 62:1-62:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{liu_et_al:LIPIcs.ISAAC.2018.62, author = {Liu, Xingwu and Pan, Zhida and Wang, Yuyi and Wattenhofer, Roger}, title = {{Impatient Online Matching}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {62:1--62:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.62}, URN = {urn:nbn:de:0030-drops-100107}, doi = {10.4230/LIPIcs.ISAAC.2018.62}, annote = {Keywords: online algorithm, online matching, convex function, competitive analysis, lower bound} }
Siu-Wing Cheng and Lie Yan. Extensions of Self-Improving Sorters. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 63:1-63:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{cheng_et_al:LIPIcs.ISAAC.2018.63, author = {Cheng, Siu-Wing and Yan, Lie}, title = {{Extensions of Self-Improving Sorters}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {63:1--63:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.63}, URN = {urn:nbn:de:0030-drops-100111}, doi = {10.4230/LIPIcs.ISAAC.2018.63}, annote = {Keywords: sorting, self-improving algorithms, entropy} }
Kelin Luo, Thomas Erlebach, and Yinfeng Xu. Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 64:1-64:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{luo_et_al:LIPIcs.ISAAC.2018.64, author = {Luo, Kelin and Erlebach, Thomas and Xu, Yinfeng}, 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)}, pages = {64:1--64:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.64}, URN = {urn:nbn:de:0030-drops-100122}, doi = {10.4230/LIPIcs.ISAAC.2018.64}, annote = {Keywords: Car-sharing system, Competitive analysis, On-line scheduling} }
Martin Hoefer and Lisa Wilhelmi. Packing Returning Secretaries. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 65:1-65:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{hoefer_et_al:LIPIcs.ISAAC.2018.65, author = {Hoefer, Martin and Wilhelmi, Lisa}, title = {{Packing Returning Secretaries}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {65:1--65:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.65}, URN = {urn:nbn:de:0030-drops-100133}, doi = {10.4230/LIPIcs.ISAAC.2018.65}, annote = {Keywords: Secretary Problem, Coupon Collector Problem, Matroids} }
Frank Kammer and Andrej Sajenko. Simple 2^f-Color Choice Dictionaries. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 66:1-66:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kammer_et_al:LIPIcs.ISAAC.2018.66, author = {Kammer, Frank and Sajenko, Andrej}, title = {{Simple 2^f-Color Choice Dictionaries}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {66:1--66:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.66}, URN = {urn:nbn:de:0030-drops-100141}, doi = {10.4230/LIPIcs.ISAAC.2018.66}, annote = {Keywords: space efficient, succinct, word RAM} }
J. Ian Munro and Kaiyu Wu. Succinct Data Structures for Chordal Graphs. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 67:1-67:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{munro_et_al:LIPIcs.ISAAC.2018.67, author = {Munro, J. Ian and Wu, Kaiyu}, title = {{Succinct Data Structures for Chordal Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {67:1--67:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.67}, URN = {urn:nbn:de:0030-drops-100153}, doi = {10.4230/LIPIcs.ISAAC.2018.67}, annote = {Keywords: Succinct Data Structure, Chordal Graph} }
Travis Gagie, Meng He, and Gonzalo Navarro. Tree Path Majority Data Structures. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 68:1-68:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{gagie_et_al:LIPIcs.ISAAC.2018.68, author = {Gagie, Travis and He, Meng and Navarro, Gonzalo}, title = {{Tree Path Majority Data Structures}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {68:1--68:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.68}, URN = {urn:nbn:de:0030-drops-100166}, doi = {10.4230/LIPIcs.ISAAC.2018.68}, annote = {Keywords: Majorities on Trees, Succinct data structures} }
Seungbum Jo and Srinivasa Rao Satti. Encoding Two-Dimensional Range Top-k Queries Revisited. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 69:1-69:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{jo_et_al:LIPIcs.ISAAC.2018.69, author = {Jo, Seungbum and Satti, Srinivasa Rao}, title = {{Encoding Two-Dimensional Range Top-k Queries Revisited}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {69:1--69:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.69}, URN = {urn:nbn:de:0030-drops-100179}, doi = {10.4230/LIPIcs.ISAAC.2018.69}, annote = {Keywords: Encoding model, top-k query, range minimum query} }
Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, and Solon P. Pissis. Longest Unbordered Factor in Quasilinear Time. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 70:1-70:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kociumaka_et_al:LIPIcs.ISAAC.2018.70, author = {Kociumaka, Tomasz and Kundu, Ritu and Mohamed, Manal and Pissis, Solon P.}, title = {{Longest Unbordered Factor in Quasilinear Time}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {70:1--70:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.70}, URN = {urn:nbn:de:0030-drops-100184}, doi = {10.4230/LIPIcs.ISAAC.2018.70}, annote = {Keywords: longest unbordered factor, factorisation, period, border, strings} }
Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, and Georg von der Brüggen. Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 71:1-71:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2018.71, author = {Chen, Jian-Jia and Bansal, Nikhil and Chakraborty, Samarjit and von der Br\"{u}ggen, Georg}, title = {{Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {71:1--71:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.71}, URN = {urn:nbn:de:0030-drops-100198}, doi = {10.4230/LIPIcs.ISAAC.2018.71}, annote = {Keywords: multiprocessor partitioned scheduling, approximation factors} }
Galia Shabtai, Danny Raz, and Yuval Shavitt. A Relaxed FPTAS for Chance-Constrained Knapsack. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 72:1-72:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{shabtai_et_al:LIPIcs.ISAAC.2018.72, author = {Shabtai, Galia and Raz, Danny and Shavitt, Yuval}, title = {{A Relaxed FPTAS for Chance-Constrained Knapsack}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {72:1--72:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.72}, URN = {urn:nbn:de:0030-drops-100201}, doi = {10.4230/LIPIcs.ISAAC.2018.72}, annote = {Keywords: Stochastic knapsack, Chance constraint, Approximation algorithms, Combinatorial optimization} }
Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, and Abhinav Srivastav. Covering Clients with Types and Budgets. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 73:1-73:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{fotakis_et_al:LIPIcs.ISAAC.2018.73, author = {Fotakis, Dimitris and Gourv\`{e}s, Laurent and Mathieu, Claire and Srivastav, Abhinav}, title = {{Covering Clients with Types and Budgets}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {73:1--73:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.73}, URN = {urn:nbn:de:0030-drops-100213}, doi = {10.4230/LIPIcs.ISAAC.2018.73}, annote = {Keywords: Facility Location, Geometric Set Cover, Local Search} }
Feedback for Dagstuhl Publishing