28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Proceedings{okamoto_et_al:LIPIcs.ISAAC.2017, title = {{LIPIcs, Volume 92, ISAAC'17, Complete Volume}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017}, URN = {urn:nbn:de:0030-drops-82924}, doi = {10.4230/LIPIcs.ISAAC.2017}, annote = {Keywords: Data Structures, Theory of Computation, Mathematics of Computing, Computing Methodologies} }
28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{okamoto_et_al:LIPIcs.ISAAC.2017.0, author = {Okamoto, Yoshio and Tokuyama, Takeshi}, title = {{Front Matter, Table of Contents, Preface, External Reviewers}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.0}, URN = {urn:nbn:de:0030-drops-82084}, doi = {10.4230/LIPIcs.ISAAC.2017.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, External Reviewers} }
Satoru Iwata. Weighted Linear Matroid Parity. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 1:1-1:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{iwata:LIPIcs.ISAAC.2017.1, author = {Iwata, Satoru}, title = {{Weighted Linear Matroid Parity}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {1:1--1:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.1}, URN = {urn:nbn:de:0030-drops-82738}, doi = {10.4230/LIPIcs.ISAAC.2017.1}, annote = {Keywords: Matroid, matching, Pfaffian, polynomial-time algorithm} }
Suresh Venkatasubramanian. Computational Philosophy: On Fairness in Automated Decision Making. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{venkatasubramanian:LIPIcs.ISAAC.2017.2, author = {Venkatasubramanian, Suresh}, title = {{Computational Philosophy: On Fairness in Automated Decision Making}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.2}, URN = {urn:nbn:de:0030-drops-82747}, doi = {10.4230/LIPIcs.ISAAC.2017.2}, annote = {Keywords: fairness, transparency, accountability, impossibility results} }
Hee-Kap Ahn, Sang Won Bae, Jongmin Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, and Antoine Vigneron. Faster Algorithms for Growing Prioritized Disks and Rectangles. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 3:1-3:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ahn_et_al:LIPIcs.ISAAC.2017.3, author = {Ahn, Hee-Kap and Bae, Sang Won and Choi, Jongmin and Korman, Matias and Mulzer, Wolfgang and Oh, Eunjin and Park, Ji-won and van Renssen, Andr\'{e} and Vigneron, Antoine}, title = {{Faster Algorithms for Growing Prioritized Disks and Rectangles}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {3:1--3:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.3}, URN = {urn:nbn:de:0030-drops-82199}, doi = {10.4230/LIPIcs.ISAAC.2017.3}, annote = {Keywords: map labeling, growing disks, elimination order} }
Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, and Fabian Stehn. Placing your Coins on a Shelf. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{alt_et_al:LIPIcs.ISAAC.2017.4, author = {Alt, Helmut and Buchin, Kevin and Chaplick, Steven and Cheong, Otfried and Kindermann, Philipp and Knauer, Christian and Stehn, Fabian}, title = {{Placing your Coins on a Shelf}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {4:1--4:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.4}, URN = {urn:nbn:de:0030-drops-82145}, doi = {10.4230/LIPIcs.ISAAC.2017.4}, annote = {Keywords: packing problems, approximation algorithms, NP-hardness} }
Kazuyuki Amano and Yoshinobu Haruyama. On the Number of p4-Tilings by an n-Omino. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 5:1-5:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{amano_et_al:LIPIcs.ISAAC.2017.5, author = {Amano, Kazuyuki and Haruyama, Yoshinobu}, title = {{On the Number of p4-Tilings by an n-Omino}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {5:1--5:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.5}, URN = {urn:nbn:de:0030-drops-82498}, doi = {10.4230/LIPIcs.ISAAC.2017.5}, annote = {Keywords: polyomino, plane tiling, isohedral tiling, word factorization} }
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, and Joseph S. B. Mitchell. Network Optimization on Partitioned Pairs of Points. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 6:1-6:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{arkin_et_al:LIPIcs.ISAAC.2017.6, author = {Arkin, Esther M. and Banik, Aritra and Carmi, Paz and Citovsky, Gui and Jia, Su and Katz, Matthew J. and Mayer, Tyler and Mitchell, Joseph S. B.}, title = {{Network Optimization on Partitioned Pairs of Points}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {6:1--6:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.6}, URN = {urn:nbn:de:0030-drops-82700}, doi = {10.4230/LIPIcs.ISAAC.2017.6}, annote = {Keywords: Network Optimization, TSP tour, Matching, Spanning Tree, Pairs, Partition, Algorithms, Complexity} }
Franz Aurenhammer, Bert Jüttler, and Günter Paulini. Voronoi Diagrams for Parallel Halflines and Line Segments in Space. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 7:1-7:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{aurenhammer_et_al:LIPIcs.ISAAC.2017.7, author = {Aurenhammer, Franz and J\"{u}ttler, Bert and Paulini, G\"{u}nter}, title = {{Voronoi Diagrams for Parallel Halflines and Line Segments in Space}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {7:1--7:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.7}, URN = {urn:nbn:de:0030-drops-82157}, doi = {10.4230/LIPIcs.ISAAC.2017.7}, annote = {Keywords: Voronoi diagram, line segments, space-sweep algorithm} }
Maxim Babenko and Stepan Artamonov. Faster Algorithms for Half-Integral T-Path Packing. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 8:1-8:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{babenko_et_al:LIPIcs.ISAAC.2017.8, author = {Babenko, Maxim and Artamonov, Stepan}, title = {{Faster Algorithms for Half-Integral T-Path Packing}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {8:1--8:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.8}, URN = {urn:nbn:de:0030-drops-82750}, doi = {10.4230/LIPIcs.ISAAC.2017.8}, annote = {Keywords: graph algorithms, multiflows, path packings, matchings} }
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, and Christos Levcopoulos. Shortcuts for the Circle. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 9:1-9:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bae_et_al:LIPIcs.ISAAC.2017.9, author = {Bae, Sang Won and de Berg, Mark and Cheong, Otfried and Gudmundsson, Joachim and Levcopoulos, Christos}, title = {{Shortcuts for the Circle}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {9:1--9:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.9}, URN = {urn:nbn:de:0030-drops-82133}, doi = {10.4230/LIPIcs.ISAAC.2017.9}, annote = {Keywords: Computational geometry, graph augmentation problem, circle, shortcut, diameter} }
Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert. Routing in Polygonal Domains. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{banyassady_et_al:LIPIcs.ISAAC.2017.10, author = {Banyassady, Bahareh and Chiu, Man-Kwun and Korman, Matias and Mulzer, Wolfgang and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Seiferth, Paul and Stein, Yannik and Vogtenhuber, Birgit and Willert, Max}, title = {{Routing in Polygonal Domains}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.10}, URN = {urn:nbn:de:0030-drops-82379}, doi = {10.4230/LIPIcs.ISAAC.2017.10}, annote = {Keywords: polygonal domains, routing scheme, small stretch,Yao graph} }
Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, and Arne Schmidt. Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{becker_et_al:LIPIcs.ISAAC.2017.11, author = {Becker, Aaron T. and Fekete, S\'{a}ndor P. and Keldenich, Phillip and Krupke, Dominik and Rieck, Christian and Scheffer, Christian and Schmidt, Arne}, title = {{Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.11}, URN = {urn:nbn:de:0030-drops-82214}, doi = {10.4230/LIPIcs.ISAAC.2017.11}, annote = {Keywords: Programmable matter, micro-factories, tile assembly, tilt, approximation, hardness} }
Edvin Berglin and Gerth Stølting Brodal. A Simple Greedy Algorithm for Dynamic Graph Orientation. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 12:1-12:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{berglin_et_al:LIPIcs.ISAAC.2017.12, author = {Berglin, Edvin and St{\o}lting Brodal, Gerth}, title = {{A Simple Greedy Algorithm for Dynamic Graph Orientation}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {12:1--12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.12}, URN = {urn:nbn:de:0030-drops-82637}, doi = {10.4230/LIPIcs.ISAAC.2017.12}, annote = {Keywords: Dynamic graph algorithms, graph arboricity, edge orientations} }
Therese Biedl, Markus Chimani, Martin Derka, and Petra Mutzel. Crossing Number for Graphs with Bounded~Pathwidth. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{biedl_et_al:LIPIcs.ISAAC.2017.13, author = {Biedl, Therese and Chimani, Markus and Derka, Martin and Mutzel, Petra}, title = {{Crossing Number for Graphs with Bounded\textasciitildePathwidth}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.13}, URN = {urn:nbn:de:0030-drops-82570}, doi = {10.4230/LIPIcs.ISAAC.2017.13}, annote = {Keywords: Crossing Number, Graphs with Bounded Pathwidth} }
Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, and Guido Proietti. An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 14:1-14:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bilo_et_al:LIPIcs.ISAAC.2017.14, author = {Bil\`{o}, Davide and Colella, Feliciano and Gual\`{a}, Luciano and Leucci, Stefano and Proietti, Guido}, 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)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.14}, URN = {urn:nbn:de:0030-drops-82663}, doi = {10.4230/LIPIcs.ISAAC.2017.14}, annote = {Keywords: Transient edge failure, Swap algorithm, Tree spanner} }
Etienne Birmelé, Fabien de Montgolfier, Léo Planche, and Laurent Viennot. Decomposing a Graph into Shortest Paths with Bounded Eccentricity. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 15:1-15:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{birmele_et_al:LIPIcs.ISAAC.2017.15, author = {Birmel\'{e}, Etienne and de Montgolfier, Fabien and Planche, L\'{e}o and Viennot, Laurent}, title = {{Decomposing a Graph into Shortest Paths with Bounded Eccentricity}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.15}, URN = {urn:nbn:de:0030-drops-82621}, doi = {10.4230/LIPIcs.ISAAC.2017.15}, annote = {Keywords: Graph Decomposition, Graph Clustering, Distance Labeling, BFS, MESP} }
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, and Daniël Paulusma. Independent Feedback Vertex Set for P_5-free Graphs. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 16:1-16:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bonamy_et_al:LIPIcs.ISAAC.2017.16, author = {Bonamy, Marthe and Dabrowski, Konrad K. and Feghali, Carl and Johnson, Matthew and Paulusma, Dani\"{e}l}, title = {{Independent Feedback Vertex Set for P\underline5-free Graphs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {16:1--16:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.16}, URN = {urn:nbn:de:0030-drops-82308}, doi = {10.4230/LIPIcs.ISAAC.2017.16}, annote = {Keywords: feedback vertex set, odd cycle transversal, independent set, H-free graph} }
Vincenzo Bonifaci. On the Convergence Time of a Natural Dynamics for Linear Programming. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 17:1-17:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bonifaci:LIPIcs.ISAAC.2017.17, author = {Bonifaci, Vincenzo}, title = {{On the Convergence Time of a Natural Dynamics for Linear Programming}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {17:1--17:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.17}, URN = {urn:nbn:de:0030-drops-82274}, doi = {10.4230/LIPIcs.ISAAC.2017.17}, annote = {Keywords: linear programming, natural algorithm, Physarum polycephalum, relative entropy, Mirror Descent} }
Prosenjit Bose, Matias Korman, André van Renssen, and Sander Verdonschot. Routing on the Visibility Graph. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 18:1-18:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{bose_et_al:LIPIcs.ISAAC.2017.18, author = {Bose, Prosenjit and Korman, Matias and van Renssen, Andr\'{e} and Verdonschot, Sander}, title = {{Routing on the Visibility Graph}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {18:1--18:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.18}, URN = {urn:nbn:de:0030-drops-82224}, doi = {10.4230/LIPIcs.ISAAC.2017.18}, annote = {Keywords: Routing, constraints, visibility graph, Theta-graph} }
Gruia Calinescu, Florian Jaehn, Minming Li, and Kai Wang. An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 19:1-19:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{calinescu_et_al:LIPIcs.ISAAC.2017.19, author = {Calinescu, Gruia and Jaehn, Florian and Li, Minming and Wang, Kai}, 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)}, pages = {19:1--19:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.19}, URN = {urn:nbn:de:0030-drops-82335}, doi = {10.4230/LIPIcs.ISAAC.2017.19}, annote = {Keywords: FPTAS, Scheduling, Approximation Algorithm} }
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, and Peter Rossmanith. An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 20:1-20:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2017.20, author = {Chen, Li-Hsuan and Hsieh, Sun-Yuan and Hung, Ling-Ju and Rossmanith, Peter}, title = {{An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {20:1--20:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.20}, URN = {urn:nbn:de:0030-drops-82458}, doi = {10.4230/LIPIcs.ISAAC.2017.20}, annote = {Keywords: 2-plex, 2-plex bipartition, bounded-degree-1 set bipartition, defective (2,1)-coloring} }
Lin Chen, Lei Xu, Zhimin Gao, Nolan Shah, Yang Lu, and Weidong Shi. Smart Contract Execution - the (+-)-Biased Ballot Problem. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 21:1-21:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2017.21, author = {Chen, Lin and Xu, Lei and Gao, Zhimin and Shah, Nolan and Lu, Yang and Shi, Weidong}, title = {{Smart Contract Execution - the (+-)-Biased Ballot Problem}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {21:1--21:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.21}, URN = {urn:nbn:de:0030-drops-82388}, doi = {10.4230/LIPIcs.ISAAC.2017.21}, annote = {Keywords: Blockchain, Probability, Random Walk, Smart Contract} }
Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a Combinatorial Game in Graphs Through Linear Programming. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 22:1-22:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{cohen_et_al:LIPIcs.ISAAC.2017.22, author = {Cohen, Nathann and Mc Inerney, Fionn and Nisse, Nicolas and P\'{e}rennes, St\'{e}phane}, title = {{Study of a Combinatorial Game in Graphs Through Linear Programming}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {22:1--22:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.22}, URN = {urn:nbn:de:0030-drops-82254}, doi = {10.4230/LIPIcs.ISAAC.2017.22}, annote = {Keywords: Turn-by-turn games in graphs, Graph algorithms, Linear Programming} }
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, and Kunihiro Wasa. On Maximal Cliques with Connectivity Constraints in Directed Graphs. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 23:1-23:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{conte_et_al:LIPIcs.ISAAC.2017.23, author = {Conte, Alessio and Kant\'{e}, Mamadou Moustapha and Uno, Takeaki and Wasa, Kunihiro}, title = {{On Maximal Cliques with Connectivity Constraints in Directed Graphs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {23:1--23:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.23}, URN = {urn:nbn:de:0030-drops-82284}, doi = {10.4230/LIPIcs.ISAAC.2017.23}, annote = {Keywords: Enumeration algorithms, Bounded delay, Directed graphs, Community structure, Network analytics} }
Giordano Da Lozzo, William E. Devanny, David Eppstein, and Timothy Johnson. Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 24:1-24:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{dalozzo_et_al:LIPIcs.ISAAC.2017.24, author = {Da Lozzo, Giordano and Devanny, William E. and Eppstein, David and Johnson, Timothy}, title = {{Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.24}, URN = {urn:nbn:de:0030-drops-82675}, doi = {10.4230/LIPIcs.ISAAC.2017.24}, annote = {Keywords: Square-Contact Representations, Partial 2-Trees, Simply-Nested Graphs} }
Mark de Berg, Ade Gunawan, and Marcel Roeloffzen. Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 25:1-25:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2017.25, author = {de Berg, Mark and Gunawan, Ade and Roeloffzen, Marcel}, title = {{Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {25:1--25:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.25}, URN = {urn:nbn:de:0030-drops-82102}, doi = {10.4230/LIPIcs.ISAAC.2017.25}, annote = {Keywords: Density-based clustering, hierarchical clustering} }
Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, and Gerhard Woeginger. Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 26:1-26:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2017.26, author = {de Berg, Mark and Leijsen, Tim and Markovic, Aleksandar and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Woeginger, Gerhard}, title = {{Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.26}, URN = {urn:nbn:de:0030-drops-82683}, doi = {10.4230/LIPIcs.ISAAC.2017.26}, annote = {Keywords: Conflict-free colorings, Dynamic data structures, Kinetic data structures} }
Mark de Berg and Aleksandar Markovic. Dynamic Conflict-Free Colorings in the Plane. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 27:1-27:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2017.27, author = {de Berg, Mark and Markovic, Aleksandar}, title = {{Dynamic Conflict-Free Colorings in the Plane}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {27:1--27:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.27}, URN = {urn:nbn:de:0030-drops-82504}, doi = {10.4230/LIPIcs.ISAAC.2017.27}, annote = {Keywords: Conflict-free colorings, Dynamic data structures} }
Tamal K. Dey, Alfred Rossi, and Anastasios Sidiropoulos. Temporal Hierarchical Clustering. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 28:1-28:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{dey_et_al:LIPIcs.ISAAC.2017.28, author = {Dey, Tamal K. and Rossi, Alfred and Sidiropoulos, Anastasios}, title = {{Temporal Hierarchical Clustering}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {28:1--28:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.28}, URN = {urn:nbn:de:0030-drops-82519}, doi = {10.4230/LIPIcs.ISAAC.2017.28}, annote = {Keywords: clustering, hierarchical clustering, multi-objective optimization, dynamic metric spaces, moving point sets, approximation algorithms} }
Ning Ding. Agnostically Learning Boolean Functions with Finite Polynomial Representation. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 29:1-29:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ding:LIPIcs.ISAAC.2017.29, author = {Ding, Ning}, title = {{Agnostically Learning Boolean Functions with Finite Polynomial Representation}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {29:1--29:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.29}, URN = {urn:nbn:de:0030-drops-82726}, doi = {10.4230/LIPIcs.ISAAC.2017.29}, annote = {Keywords: Agnostic Learning, Boolean Functions, Low-Degree Polynomials} }
Hicham El-Zein, J. Ian Munro, and Yakov Nekrich. Succinct Color Searching in One Dimension. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 30:1-30:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{elzein_et_al:LIPIcs.ISAAC.2017.30, author = {El-Zein, Hicham and Munro, J. Ian and Nekrich, Yakov}, title = {{Succinct Color Searching in One Dimension}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {30:1--30:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.30}, URN = {urn:nbn:de:0030-drops-82096}, doi = {10.4230/LIPIcs.ISAAC.2017.30}, annote = {Keywords: Succinct Data Structures, Range Searching, Computational Geometry} }
Sándor P. Fekete and Phillip Keldenich. Conflict-Free Coloring of Intersection Graphs. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 31:1-31:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{fekete_et_al:LIPIcs.ISAAC.2017.31, author = {Fekete, S\'{a}ndor P. and Keldenich, Phillip}, title = {{Conflict-Free Coloring of Intersection Graphs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {31:1--31:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.31}, URN = {urn:nbn:de:0030-drops-82162}, doi = {10.4230/LIPIcs.ISAAC.2017.31}, annote = {Keywords: conflict-free coloring, intersection graphs, unit disk graphs, complexity, worst-case bounds} }
Casper Benjamin Freksen and Kasper Green Larsen. On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 32:1-32:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{freksen_et_al:LIPIcs.ISAAC.2017.32, author = {Freksen, Casper Benjamin and Larsen, Kasper Green}, title = {{On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {32:1--32:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.32}, URN = {urn:nbn:de:0030-drops-82540}, doi = {10.4230/LIPIcs.ISAAC.2017.32}, annote = {Keywords: dimensionality reduction, Johnson-Lindenstrauss, Toeplitz matrices} }
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 33:1-33:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{fujishige_et_al:LIPIcs.ISAAC.2017.33, author = {Fujishige, Yuta and Nakashima, Yuto and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki}, title = {{Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {33:1--33:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.33}, URN = {urn:nbn:de:0030-drops-82610}, doi = {10.4230/LIPIcs.ISAAC.2017.33}, annote = {Keywords: maximal repetitions,run length encoding} }
Radoslav Fulek. Embedding Graphs into Embedded Graphs. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 34:1-34:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{fulek:LIPIcs.ISAAC.2017.34, author = {Fulek, Radoslav}, title = {{Embedding Graphs into Embedded Graphs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {34:1--34:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.34}, URN = {urn:nbn:de:0030-drops-82234}, doi = {10.4230/LIPIcs.ISAAC.2017.34}, annote = {Keywords: Graph embedding, C-planarity, Weakly simple polygons} }
Arnab Ganguly, Rahul Shah, and Sharma V. Thankachan. Structural Pattern Matching - Succinctly. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 35:1-35:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ganguly_et_al:LIPIcs.ISAAC.2017.35, author = {Ganguly, Arnab and Shah, Rahul and Thankachan, Sharma V.}, title = {{Structural Pattern Matching - Succinctly}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {35:1--35:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.35}, URN = {urn:nbn:de:0030-drops-82566}, doi = {10.4230/LIPIcs.ISAAC.2017.35}, annote = {Keywords: Parameterized Pattern Matching, Suffix tree, Burrows-Wheeler Transform, Wavelet Tree, Fully-functional succinct tree} }
Robert Ganian, Sebastian Ordyniak, and Ramanujan Sridharan. On Structural Parameterizations of the Edge Disjoint Paths Problem. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 36:1-36:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ganian_et_al:LIPIcs.ISAAC.2017.36, author = {Ganian, Robert and Ordyniak, Sebastian and Sridharan, Ramanujan}, title = {{On Structural Parameterizations of the Edge Disjoint Paths Problem}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {36:1--36:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.36}, URN = {urn:nbn:de:0030-drops-82555}, doi = {10.4230/LIPIcs.ISAAC.2017.36}, annote = {Keywords: edge disjoint path problem, feedback vertex set, treewidth, fracture number, parameterized complexity} }
Serge Gaspers, Joachim Gudmundsson, Julián Mestre, and Stefan Rümmele. Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 37:1-37:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gaspers_et_al:LIPIcs.ISAAC.2017.37, author = {Gaspers, Serge and Gudmundsson, Joachim and Mestre, Juli\'{a}n and R\"{u}mmele, Stefan}, title = {{Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {37:1--37:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.37}, URN = {urn:nbn:de:0030-drops-82591}, doi = {10.4230/LIPIcs.ISAAC.2017.37}, annote = {Keywords: Barrier coverage, Sensor movement, Approximation, Parameterized complexity} }
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna. Sorting with Recurrent Comparison Errors. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 38:1-38:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{geissmann_et_al:LIPIcs.ISAAC.2017.38, author = {Geissmann, Barbara and Leucci, Stefano and Liu, Chih-Hung and Penna, Paolo}, title = {{Sorting with Recurrent Comparison Errors}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {38:1--38:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.38}, URN = {urn:nbn:de:0030-drops-82652}, doi = {10.4230/LIPIcs.ISAAC.2017.38}, annote = {Keywords: sorting, recurrent comparison error, maximum and total dislocation} }
Omer Gold and Micha Sharir. Dominance Product and High-Dimensional Closest Pair under L_infty. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 39:1-39:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gold_et_al:LIPIcs.ISAAC.2017.39, author = {Gold, Omer and Sharir, Micha}, title = {{Dominance Product and High-Dimensional Closest Pair under L\underlineinfty}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {39:1--39:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.39}, URN = {urn:nbn:de:0030-drops-82268}, doi = {10.4230/LIPIcs.ISAAC.2017.39}, annote = {Keywords: Closest Pair, Dominance Product, L\underlineinfty Proximity, Rectangular Matrix Multiplication} }
Isaac Goldstein, Moshe Lewenstein, and Ely Porat. Orthogonal Vectors Indexing. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 40:1-40:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{goldstein_et_al:LIPIcs.ISAAC.2017.40, author = {Goldstein, Isaac and Lewenstein, Moshe and Porat, Ely}, title = {{Orthogonal Vectors Indexing}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {40:1--40:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.40}, URN = {urn:nbn:de:0030-drops-82395}, doi = {10.4230/LIPIcs.ISAAC.2017.40}, annote = {Keywords: SETH, orthogonal vectors, space complexity} }
Mordecai J. Golin, Hadi Khodabande, and Bo Qin. Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 41:1-41:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{golin_et_al:LIPIcs.ISAAC.2017.41, author = {Golin, Mordecai J. and Khodabande, Hadi and Qin, Bo}, 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)}, pages = {41:1--41:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.41}, URN = {urn:nbn:de:0030-drops-82435}, doi = {10.4230/LIPIcs.ISAAC.2017.41}, annote = {Keywords: Optimization, Approximation, Dynamic Flow, Confluent Flow} }
Joachim Gudmundsson and Rasmus Pagh. Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 42:1-42:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gudmundsson_et_al:LIPIcs.ISAAC.2017.42, author = {Gudmundsson, Joachim and Pagh, Rasmus}, title = {{Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {42:1--42:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.42}, URN = {urn:nbn:de:0030-drops-82316}, doi = {10.4230/LIPIcs.ISAAC.2017.42}, annote = {Keywords: Locality-sensitive hashing, probability distribution, polygon, min-wise hashing, consistent sampling} }
Michel Habib and Lalla Mouatadid. Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 43:1-43:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{habib_et_al:LIPIcs.ISAAC.2017.43, author = {Habib, Michel and Mouatadid, Lalla}, title = {{Maximum Induced Matching Algorithms via Vertex Ordering Characterizations}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {43:1--43:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.43}, URN = {urn:nbn:de:0030-drops-82178}, doi = {10.4230/LIPIcs.ISAAC.2017.43}, annote = {Keywords: Maximum induced matching, Independent set, Vertex ordering charac- terization, Graph classes, Fast algorithms, Cocomparability graphs} }
Torben Hagerup and Frank Kammer. On-the-Fly Array Initialization in Less Space. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 44:1-44:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{hagerup_et_al:LIPIcs.ISAAC.2017.44, author = {Hagerup, Torben and Kammer, Frank}, title = {{On-the-Fly Array Initialization in Less Space}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {44:1--44:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.44}, URN = {urn:nbn:de:0030-drops-82527}, doi = {10.4230/LIPIcs.ISAAC.2017.44}, annote = {Keywords: data structures, space efficiency, constant-time initialization, on-the-fly initialization, arrays} }
Tesshu Hanaka, Naomi Nishimura, and Hirotaka Ono. On Directed Covering and Domination Problems. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 45:1-45:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{hanaka_et_al:LIPIcs.ISAAC.2017.45, author = {Hanaka, Tesshu and Nishimura, Naomi and Ono, Hirotaka}, title = {{On Directed Covering and Domination Problems}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {45:1--45:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.45}, URN = {urn:nbn:de:0030-drops-82460}, doi = {10.4230/LIPIcs.ISAAC.2017.45}, annote = {Keywords: directed graph, vertex cover, dominating set, edge dominating set, fixed-parameter algorithms} }
Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. Settlement Fund Circulation Problem. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 46:1-46:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{hayakawa_et_al:LIPIcs.ISAAC.2017.46, author = {Hayakawa, Hitoshi and Ishii, Toshimasa and Ono, Hirotaka and Uno, Yushi}, title = {{Settlement Fund Circulation Problem}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.46}, URN = {urn:nbn:de:0030-drops-82351}, doi = {10.4230/LIPIcs.ISAAC.2017.46}, annote = {Keywords: Fund settlement, Algorithm, Digraph, Scheduling} }
Ziyun Huang and Jinhui Xu. An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 47:1-47:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{huang_et_al:LIPIcs.ISAAC.2017.47, author = {Huang, Ziyun and Xu, Jinhui}, title = {{An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {47:1--47:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.47}, URN = {urn:nbn:de:0030-drops-82483}, doi = {10.4230/LIPIcs.ISAAC.2017.47}, annote = {Keywords: Sum Query, Distance-based Function, Local Domination, High Dimen- sions, Data Structure} }
Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi. Complexity of the Multi-Service Center Problem. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 48:1-48:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ito_et_al:LIPIcs.ISAAC.2017.48, author = {Ito, Takehiro and Kakimura, Naonori and Kobayashi, Yusuke}, title = {{Complexity of the Multi-Service Center Problem}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {48:1--48:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.48}, URN = {urn:nbn:de:0030-drops-82536}, doi = {10.4230/LIPIcs.ISAAC.2017.48}, annote = {Keywords: facility location, graph algorithm, multi-service location} }
Hamidreza Jahanjou, Erez Kantor, and Rajmohan Rajaraman. Improved Algorithms for Scheduling Unsplittable Flows on Paths. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 49:1-49:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jahanjou_et_al:LIPIcs.ISAAC.2017.49, author = {Jahanjou, Hamidreza and Kantor, Erez and Rajaraman, Rajmohan}, title = {{Improved Algorithms for Scheduling Unsplittable Flows on Paths}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {49:1--49:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.49}, URN = {urn:nbn:de:0030-drops-82292}, doi = {10.4230/LIPIcs.ISAAC.2017.49}, annote = {Keywords: Approximation algorithms, Online algorithms, Unsplittable flows, Interval coloring, Flow scheduling} }
Ioannis Katsikarelis, Michael Lampis, and Vangelis Th. Paschos. Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 50:1-50:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{katsikarelis_et_al:LIPIcs.ISAAC.2017.50, author = {Katsikarelis, Ioannis and Lampis, Michael and Paschos, Vangelis Th.}, title = {{Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {50:1--50:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.50}, URN = {urn:nbn:de:0030-drops-82441}, doi = {10.4230/LIPIcs.ISAAC.2017.50}, annote = {Keywords: FPT algorithms, Approximation, Treewidth, Clique-width, Domination} }
Yasushi Kawase, Kei Kimura, Kazuhisa Makino, and Hanna Sumita. Optimal Matroid Partitioning Problems. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 51:1-51:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kawase_et_al:LIPIcs.ISAAC.2017.51, author = {Kawase, Yasushi and Kimura, Kei and Makino, Kazuhisa and Sumita, Hanna}, title = {{Optimal Matroid Partitioning Problems}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {51:1--51:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.51}, URN = {urn:nbn:de:0030-drops-82712}, doi = {10.4230/LIPIcs.ISAAC.2017.51}, annote = {Keywords: Matroids, Partitioning problem, PTAS, NP-hardness} }
Koji M. Kobayashi. Improved Bounds for Online Dominating Sets of Trees. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 52:1-52:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kobayashi:LIPIcs.ISAAC.2017.52, author = {Kobayashi, Koji M.}, title = {{Improved Bounds for Online Dominating Sets of Trees}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {52:1--52:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.52}, URN = {urn:nbn:de:0030-drops-82364}, doi = {10.4230/LIPIcs.ISAAC.2017.52}, annote = {Keywords: online algorithm, dominating set, competitive analysis, tree graph, randomized algorithm} }
Athanasios L. Konstantinidis and Charis Papadopoulos. Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 53:1-53:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{konstantinidis_et_al:LIPIcs.ISAAC.2017.53, author = {Konstantinidis, Athanasios L. and Papadopoulos, Charis}, title = {{Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {53:1--53:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.53}, URN = {urn:nbn:de:0030-drops-82113}, doi = {10.4230/LIPIcs.ISAAC.2017.53}, annote = {Keywords: strong triadic closure, polynomial-time algorithm, NP-completeness, split graphs, proper interval graphs} }
Irina Kostitsyna, Bettina Speckmann, and Kevin Verbeek. Non-Crossing Geometric Steiner Arborescences. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 54:1-54:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kostitsyna_et_al:LIPIcs.ISAAC.2017.54, author = {Kostitsyna, Irina and Speckmann, Bettina and Verbeek, Kevin}, title = {{Non-Crossing Geometric Steiner Arborescences}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {54:1--54:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.54}, URN = {urn:nbn:de:0030-drops-82342}, doi = {10.4230/LIPIcs.ISAAC.2017.54}, annote = {Keywords: Steiner arborescences, non-crossing drawing, rectilinear, angle-restricted} }
Jessica McClintock, Julián Mestre, and Anthony Wirth. Precedence-Constrained Min Sum Set Cover. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 55:1-55:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{mcclintock_et_al:LIPIcs.ISAAC.2017.55, author = {McClintock, Jessica and Mestre, Juli\'{a}n and Wirth, Anthony}, title = {{Precedence-Constrained Min Sum Set Cover}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {55:1--55:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.55}, URN = {urn:nbn:de:0030-drops-82648}, doi = {10.4230/LIPIcs.ISAAC.2017.55}, annote = {Keywords: planted dense subgraph, min sum set cover, precedence constrained} }
Shuichi Miyazaki and Kazuya Okamoto. Jointly Stable Matchings. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 56:1-56:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{miyazaki_et_al:LIPIcs.ISAAC.2017.56, author = {Miyazaki, Shuichi and Okamoto, Kazuya}, title = {{Jointly Stable Matchings}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {56:1--56:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.56}, URN = {urn:nbn:de:0030-drops-82244}, doi = {10.4230/LIPIcs.ISAAC.2017.56}, annote = {Keywords: stable marriage problem, stable matching, NP-completeness, linear time algorithm} }
J. Ian Munro, Gonzalo Navarro, and Yakov Nekrich. Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 57:1-57:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{munro_et_al:LIPIcs.ISAAC.2017.57, author = {Munro, J. Ian and Navarro, Gonzalo and Nekrich, Yakov}, title = {{Fast Compressed Self-Indexes with Deterministic Linear-Time Construction}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {57:1--57:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.57}, URN = {urn:nbn:de:0030-drops-82328}, doi = {10.4230/LIPIcs.ISAAC.2017.57}, annote = {Keywords: Succinct data structures, Self-indexes, Suffix arrays, Deterministic construction} }
Atsuki Nagao, Kazuhisa Seto, and Junichi Teruyama. Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 58:1-58:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{nagao_et_al:LIPIcs.ISAAC.2017.58, author = {Nagao, Atsuki and Seto, Kazuhisa and Teruyama, Junichi}, title = {{Satisfiability Algorithm for Syntactic Read-\$k\$-times Branching Programs}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {58:1--58:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.58}, URN = {urn:nbn:de:0030-drops-82423}, doi = {10.4230/LIPIcs.ISAAC.2017.58}, annote = {Keywords: branching program, read-k-times, satisfiability, moderately exponential time, polynomial space} }
Kengo Nakamura. Fully Dynamic Connectivity Oracles under General Vertex Updates. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 59:1-59:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{nakamura:LIPIcs.ISAAC.2017.59, author = {Nakamura, Kengo}, title = {{Fully Dynamic Connectivity Oracles under General Vertex Updates}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {59:1--59:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.59}, URN = {urn:nbn:de:0030-drops-82607}, doi = {10.4230/LIPIcs.ISAAC.2017.59}, annote = {Keywords: Dynamic Graph, Connectivity, Depth-First Search} }
Eunjin Oh and Hee-Kap Ahn. Finding Pairwise Intersections of Rectangles in a Query Rectangle. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 60:1-60:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{oh_et_al:LIPIcs.ISAAC.2017.60, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{Finding Pairwise Intersections of Rectangles in a Query Rectangle}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {60:1--60:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.60}, URN = {urn:nbn:de:0030-drops-82417}, doi = {10.4230/LIPIcs.ISAAC.2017.60}, annote = {Keywords: Geometric data structures, axis-parallel rectangles, intersection} }
Eunjin Oh and Hee-Kap Ahn. A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 61:1-61:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{oh_et_al:LIPIcs.ISAAC.2017.61, author = {Oh, Eunjin and Ahn, Hee-Kap}, 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)}, pages = {61:1--61:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.61}, URN = {urn:nbn:de:0030-drops-82401}, doi = {10.4230/LIPIcs.ISAAC.2017.61}, annote = {Keywords: Time-space trade-off, simple polygon, shortest path, shortest path tree} }
Hiroki Osawa, Akira Suzuki, Takehiro Ito, and Xiao Zhou. Complexity of Coloring Reconfiguration under Recolorability Constraints. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 62:1-62:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{osawa_et_al:LIPIcs.ISAAC.2017.62, author = {Osawa, Hiroki and Suzuki, Akira and Ito, Takehiro and Zhou, Xiao}, title = {{Complexity of Coloring Reconfiguration under Recolorability Constraints}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {62:1--62:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.62}, URN = {urn:nbn:de:0030-drops-82588}, doi = {10.4230/LIPIcs.ISAAC.2017.62}, annote = {Keywords: combinatorial reconfiguration, graph coloring, PSPACE-complete} }
Piotr Sankowski and Piotr Wygocki. Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 63:1-63:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{sankowski_et_al:LIPIcs.ISAAC.2017.63, author = {Sankowski, Piotr and Wygocki, Piotr}, title = {{Approximate Nearest Neighbors Search Without False Negatives For l\underline2 For c\ranglesqrt\{loglog\{n\}\}}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {63:1--63:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.63}, URN = {urn:nbn:de:0030-drops-82189}, doi = {10.4230/LIPIcs.ISAAC.2017.63}, annote = {Keywords: locality sensitive hashing, approximate near neighbor search, high- dimensional, similarity search} }
Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, and D. T. Lee. Tight Approximation for Partial Vertex Cover with Hard Capacities. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 64:1-64:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{shiau_et_al:LIPIcs.ISAAC.2017.64, author = {Shiau, Jia-Yau and Kao, Mong-Jen and Lin, Ching-Chi and Lee, D. T.}, title = {{Tight Approximation for Partial Vertex Cover with Hard Capacities}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {64:1--64:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.64}, URN = {urn:nbn:de:0030-drops-82694}, doi = {10.4230/LIPIcs.ISAAC.2017.64}, annote = {Keywords: Approximation Algorithm, Capacitated Vertex Cover, Hard Capacities} }
Rustem Takhanov. Hybrid VCSPs with Crisp and Valued Conservative Templates. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 65:1-65:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{takhanov:LIPIcs.ISAAC.2017.65, author = {Takhanov, Rustem}, title = {{Hybrid VCSPs with Crisp and Valued Conservative Templates}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {65:1--65:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.65}, URN = {urn:nbn:de:0030-drops-82474}, doi = {10.4230/LIPIcs.ISAAC.2017.65}, annote = {Keywords: constraint satisfaction problem, polymorphisms, algebraic approach, lifted language, hybrid CSPs, closed under inverse homomorphisms} }
Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, and Peng Zhang. A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 66:1-66:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{xu_et_al:LIPIcs.ISAAC.2017.66, author = {Xu, Yao and Chen, Yong and Lin, Guohui and Liu, Tian and Luo, Taibo and Zhang, Peng}, title = {{A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {66:1--66:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.66}, URN = {urn:nbn:de:0030-drops-82120}, doi = {10.4230/LIPIcs.ISAAC.2017.66}, annote = {Keywords: Approximation algorithm, duo-preservation string mapping, string partition, independent set} }
Yu Yokoi. Envy-free Matchings with Lower Quotas. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 67:1-67:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{yokoi:LIPIcs.ISAAC.2017.67, author = {Yokoi, Yu}, title = {{Envy-free Matchings with Lower Quotas}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {67:1--67:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.67}, URN = {urn:nbn:de:0030-drops-82205}, doi = {10.4230/LIPIcs.ISAAC.2017.67}, annote = {Keywords: stable matchings, envy-free matchings, lower quotas, polynomial time algorithm, paramodular functions} }