@Proceedings{hong:LIPIcs.ISAAC.2016,
title = {{LIPIcs, Volume 64, ISAAC'16, Complete Volume}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016},
URN = {urn:nbn:de:0030-drops-69067},
doi = {10.4230/LIPIcs.ISAAC.2016},
annote = {Keywords: Data Structures, Nonnumerical Algorithms and Problems, Optimization, Discrete Mathematics, Mathematical Software, Algorithms Problem Solving, Control Methods, and Search, Computational Geometry and Object Modeling}
}
@InProceedings{hong:LIPIcs.ISAAC.2016.0,
author = {Hong, Seok-Hee},
title = {{Front Matter, Table of Contents, Preface, Program Committee, External Reviewers}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.0},
URN = {urn:nbn:de:0030-drops-67728},
doi = {10.4230/LIPIcs.ISAAC.2016.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Program Committee, External Reviewers}
}
@InProceedings{lin:LIPIcs.ISAAC.2016.1,
author = {Lin, Xuemin},
title = {{Towards Processing of Big Graphs: from Theory, Algorithm to System}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.1},
URN = {urn:nbn:de:0030-drops-68346},
doi = {10.4230/LIPIcs.ISAAC.2016.1},
annote = {Keywords: Graph Processing, Big Data, Cloud Computing}
}
@InProceedings{park:LIPIcs.ISAAC.2016.2,
author = {Park, Kunsoo},
title = {{Compressed and Searchable Indexes for Highly Similar Strings}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.2},
URN = {urn:nbn:de:0030-drops-68359},
doi = {10.4230/LIPIcs.ISAAC.2016.2},
annote = {Keywords: Index for similar strings, FM index, Suffix array, Alignment}
}
@InProceedings{abdullah_et_al:LIPIcs.ISAAC.2016.3,
author = {Abdullah, Amirali and Daruki, Samira and Roy, Chitradeep Dutta and Venkatasubramanian, Suresh},
title = {{Streaming Verification of Graph Properties}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {3:1--3:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.3},
URN = {urn:nbn:de:0030-drops-67730},
doi = {10.4230/LIPIcs.ISAAC.2016.3},
annote = {Keywords: streaming interactive proofs, verification, matching, travelling salesman problem, graph algorithms}
}
@InProceedings{abukhzam_et_al:LIPIcs.ISAAC.2016.4,
author = {Abu-Khzam, Faisal and Bazgan, Cristina and Casel, Katrin and Fernau, Henning},
title = {{Building Clusters with Lower-Bounded Sizes}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {4:1--4:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.4},
URN = {urn:nbn:de:0030-drops-67742},
doi = {10.4230/LIPIcs.ISAAC.2016.4},
annote = {Keywords: Clustering, Approximation Algorithms, Complexity, Matching}
}
@InProceedings{agrawal_et_al:LIPIcs.ISAAC.2016.5,
author = {Agrawal, Akanksha and Panolan, Fahad and Saurabh, Saket and Zehavi, Meirav},
title = {{Simultaneous Feedback Edge Set: A Parameterized Perspective}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {5:1--5:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.5},
URN = {urn:nbn:de:0030-drops-67767},
doi = {10.4230/LIPIcs.ISAAC.2016.5},
annote = {Keywords: parameterized complexity, feedback edge set, alpha-matroid parity}
}
@InProceedings{agrawal_et_al:LIPIcs.ISAAC.2016.6,
author = {Agrawal, Akanksha and Saurabh, Saket and Sharma, Roohani and Zehavi, Meirav},
title = {{Kernels for Deletion to Classes of Acyclic Digraphs}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {6:1--6:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.6},
URN = {urn:nbn:de:0030-drops-67777},
doi = {10.4230/LIPIcs.ISAAC.2016.6},
annote = {Keywords: out-forest, pumpkin, parameterized complexity, kernelization}
}
@InProceedings{agarwal_et_al:LIPIcs.ISAAC.2016.7,
author = {Agarwal, Pankaj K. and Pan, Jiangwei and Victor, Will},
title = {{An Efficient Algorithm for Placing Electric Vehicle Charging Stations}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {7:1--7:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.7},
URN = {urn:nbn:de:0030-drops-67782},
doi = {10.4230/LIPIcs.ISAAC.2016.7},
annote = {Keywords: Shortest path hitting set, Charging station placement, Electric vehicle}
}
@InProceedings{agarwal_et_al:LIPIcs.ISAAC.2016.8,
author = {Agarwal, Udit and Ramachandran, Vijaya},
title = {{Finding k Simple Shortest Paths and Cycles}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {8:1--8:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.8},
URN = {urn:nbn:de:0030-drops-67830},
doi = {10.4230/LIPIcs.ISAAC.2016.8},
annote = {Keywords: Graph Algorithms, Shortest Paths, k Simple Shortest Paths, Enumerat- ing Simple Cycles, Enumerating Simple Paths}
}
@InProceedings{aichholzer_et_al:LIPIcs.ISAAC.2016.9,
author = {Aichholzer, Oswin and Hackl, Thomas and Korman, Matias and Pilz, Alexander and Rote, G\"{u}nter and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Vogtenhuber, Birgit},
title = {{Packing Short Plane Spanning Trees in Complete Geometric Graphs}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {9:1--9:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.9},
URN = {urn:nbn:de:0030-drops-67823},
doi = {10.4230/LIPIcs.ISAAC.2016.9},
annote = {Keywords: Geometric Graphs, Graph Packing, Plane Graphs, Minimum Spanning Tree, Bottleneck Edge}
}
@InProceedings{akitaya_et_al:LIPIcs.ISAAC.2016.10,
author = {Akitaya, Hugo A. and T\'{o}th, Csaba D.},
title = {{Reconstruction of Weakly Simple Polygons from their Edges}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {10:1--10:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.10},
URN = {urn:nbn:de:0030-drops-67795},
doi = {10.4230/LIPIcs.ISAAC.2016.10},
annote = {Keywords: simple polygon, line segment, geometric graph}
}
@InProceedings{alt_et_al:LIPIcs.ISAAC.2016.11,
author = {Alt, Helmut and Scharf, Nadja},
title = {{Approximating Smallest Containers for Packing Three-Dimensional Convex Objects}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {11:1--11:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.11},
URN = {urn:nbn:de:0030-drops-67801},
doi = {10.4230/LIPIcs.ISAAC.2016.11},
annote = {Keywords: computational geometry, packing, approximation algorithm}
}
@InProceedings{amir_et_al:LIPIcs.ISAAC.2016.12,
author = {Amir, Amihood and Kopelowitz, Tsvi and Levy, Avivit and Pettie, Seth and Porat, Ely and Shalom, B. Riva},
title = {{Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {12:1--12:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.12},
URN = {urn:nbn:de:0030-drops-67841},
doi = {10.4230/LIPIcs.ISAAC.2016.12},
annote = {Keywords: Pattern matching, Dictionary matching, 3SUM, Triangle reporting}
}
@InProceedings{angelini_et_al:LIPIcs.ISAAC.2016.13,
author = {Angelini, Patrizio and Da Lozzo, Giordano},
title = {{Clustered Planarity with Pipes}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {13:1--13:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.13},
URN = {urn:nbn:de:0030-drops-67817},
doi = {10.4230/LIPIcs.ISAAC.2016.13},
annote = {Keywords: Clustered Planarity, FPT, SEFE, Graph Drawing}
}
@InProceedings{bae:LIPIcs.ISAAC.2016.14,
author = {Bae, Sang Won},
title = {{L\underline1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {14:1--14:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.14},
URN = {urn:nbn:de:0030-drops-67858},
doi = {10.4230/LIPIcs.ISAAC.2016.14},
annote = {Keywords: simple polygon, L\underline1 geodesic distance, farthest neighbor, farthest-neighbor Voronoi diagram, k-center}
}
@InProceedings{bandyapadhyay_et_al:LIPIcs.ISAAC.2016.15,
author = {Bandyapadhyay, Sayan and Varadarajan, Kasturi},
title = {{Approximate Clustering via Metric Partitioning}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.15},
URN = {urn:nbn:de:0030-drops-67751},
doi = {10.4230/LIPIcs.ISAAC.2016.15},
annote = {Keywords: Approximation Algorithms, Clustering, Covering, Probabilistic Parti- tions}
}
@InProceedings{berndt_et_al:LIPIcs.ISAAC.2016.16,
author = {Berndt, Sebastian and Liskiewicz, Maciej},
title = {{Hard Communication Channels for Steganography}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {16:1--16:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.16},
URN = {urn:nbn:de:0030-drops-67863},
doi = {10.4230/LIPIcs.ISAAC.2016.16},
annote = {Keywords: provable secure steganography, cryptographic assumptions, pseudoran- dom functions, one-way functions, signature schemes}
}
@InProceedings{biedl_et_al:LIPIcs.ISAAC.2016.17,
author = {Biedl, Therese and Mehrabi, Saeed},
title = {{On r-Guarding Thin Orthogonal Polygons}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {17:1--17:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.17},
URN = {urn:nbn:de:0030-drops-67913},
doi = {10.4230/LIPIcs.ISAAC.2016.17},
annote = {Keywords: Art Gallery Problem, Orthogonal Polygons, r-Guarding, Treewidth, Fixed-parameter Tractable}
}
@InProceedings{bille_et_al:LIPIcs.ISAAC.2016.18,
author = {Bille, Philip and Cording, Patrick Hagge and G{\o}rtz, Inge Li and Skjoldjensen, Frederik Rye and Vildh{\o}j, Hjalte Wedel and Vind, S{\o}ren},
title = {{Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {18:1--18:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.18},
URN = {urn:nbn:de:0030-drops-67872},
doi = {10.4230/LIPIcs.ISAAC.2016.18},
annote = {Keywords: Relative compression, dynamic compression, dynamic partial sum, sub-string concatenation, external macro compression}
}
@InProceedings{biniaz_et_al:LIPIcs.ISAAC.2016.19,
author = {Biniaz, Ahmad and Bose, Prosenjit and De Carufel, Jean-Lou and Gavoille, Cyril and Maheshwari, Anil and Smid, Michiel},
title = {{Towards Plane Spanners of Degree 3}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.19},
URN = {urn:nbn:de:0030-drops-67887},
doi = {10.4230/LIPIcs.ISAAC.2016.19},
annote = {Keywords: plane spanners, degree-3 spanners, convex position, non-uniform lattice}
}
@InProceedings{bodlaender_et_al:LIPIcs.ISAAC.2016.20,
author = {Bodlaender, Hans L. and Ono, Hirotaka and Otachi, Yota},
title = {{Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {20:1--20:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.20},
URN = {urn:nbn:de:0030-drops-67898},
doi = {10.4230/LIPIcs.ISAAC.2016.20},
annote = {Keywords: orientation, graph class, width parameter, parameterized complexity}
}
@InProceedings{bohm_et_al:LIPIcs.ISAAC.2016.21,
author = {B\"{o}hm, Martin and Chrobak, Marek and Jez, Lukasz and Li, Fei and Sgall, Jir{\'\i} and Vesel\'{y}, Pavel},
title = {{Online Packet Scheduling with Bounded Delay and Lookahead}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {21:1--21:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.21},
URN = {urn:nbn:de:0030-drops-67901},
doi = {10.4230/LIPIcs.ISAAC.2016.21},
annote = {Keywords: buffer management, online scheduling, online algorithm, lookahead}
}
@InProceedings{chakraborty_et_al:LIPIcs.ISAAC.2016.22,
author = {Chakraborty, Sankardeep and Raman, Venkatesh and Satti, Srinivasa Rao},
title = {{Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.22},
URN = {urn:nbn:de:0030-drops-67927},
doi = {10.4230/LIPIcs.ISAAC.2016.22},
annote = {Keywords: biconnectivity, st-number, chain decomposition, tree cover, space efficient algorithms, read-only memory}
}
@InProceedings{chan_et_al:LIPIcs.ISAAC.2016.23,
author = {Chan, T-H. Hubert and Tang, Zhihao Gavin and Wu, Xiaowei},
title = {{On (1, epsilon)-Restricted Max-Min Fair Allocation Problem}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {23:1--23:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.23},
URN = {urn:nbn:de:0030-drops-67939},
doi = {10.4230/LIPIcs.ISAAC.2016.23},
annote = {Keywords: Max-Min Fair Allocation, Hypergraph Matching}
}
@InProceedings{chan_et_al:LIPIcs.ISAAC.2016.24,
author = {Chan, Timothy M. and Skrepetos, Dimitrios},
title = {{All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {24:1--24:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.24},
URN = {urn:nbn:de:0030-drops-67948},
doi = {10.4230/LIPIcs.ISAAC.2016.24},
annote = {Keywords: unit-disk graphs, all-pairs shortest paths, computational geometry}
}
@InProceedings{chen_et_al:LIPIcs.ISAAC.2016.25,
author = {Chen, Di and Golin, Mordecai},
title = {{Sink Evacuation on Trees with Dynamic Confluent Flows}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {25:1--25:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.25},
URN = {urn:nbn:de:0030-drops-67951},
doi = {10.4230/LIPIcs.ISAAC.2016.25},
annote = {Keywords: Sink Evacuation, Dynamic Flow, Facility Location, Parametric Search}
}
@InProceedings{chen:LIPIcs.ISAAC.2016.26,
author = {Chen, Lijie},
title = {{Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {26:1--26:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.26},
URN = {urn:nbn:de:0030-drops-67960},
doi = {10.4230/LIPIcs.ISAAC.2016.26},
annote = {Keywords: approximate degree, postselection, hardness amplification, adaptivity}
}
@InProceedings{czyzowicz_et_al:LIPIcs.ISAAC.2016.27,
author = {Czyzowicz, Jurek and Georgiou, Konstantinos and Kranakis, Evangelos and Krizanc, Danny and Narayanan, Lata and Opatrny, Jaroslav and Shende, Sunil},
title = {{Search on a Line by Byzantine Robots}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {27:1--27:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.27},
URN = {urn:nbn:de:0030-drops-67972},
doi = {10.4230/LIPIcs.ISAAC.2016.27},
annote = {Keywords: Cow path problem, Parallel search, Mobile robots, Wireless communication, Byzantine faults}
}
@InProceedings{domanic_et_al:LIPIcs.ISAAC.2016.28,
author = {Domanic, Nevzat Onur and Lam, Chi-Kit and Plaxton, C. Gregory},
title = {{Bipartite Matching with Linear Edge Weights}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {28:1--28:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.28},
URN = {urn:nbn:de:0030-drops-67989},
doi = {10.4230/LIPIcs.ISAAC.2016.28},
annote = {Keywords: Weighted bipartite matching, Unit-demand auctions, VCG allocation and pricing}
}
@InProceedings{elzein_et_al:LIPIcs.ISAAC.2016.29,
author = {El-Zein, Hicham and Munro, J. Ian and Robertson, Matthew},
title = {{Raising Permutations to Powers in Place}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {29:1--29:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.29},
URN = {urn:nbn:de:0030-drops-67992},
doi = {10.4230/LIPIcs.ISAAC.2016.29},
annote = {Keywords: Algorithms, Combinatorics, Inplace, Permutations, Powers}
}
@InProceedings{elmasry_et_al:LIPIcs.ISAAC.2016.30,
author = {Elmasry, Amr and Kammer, Frank},
title = {{Space-Efficient Plane-Sweep Algorithms}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {30:1--30:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.30},
URN = {urn:nbn:de:0030-drops-68009},
doi = {10.4230/LIPIcs.ISAAC.2016.30},
annote = {Keywords: closest pair, line-segments intersection, Klee's measure}
}
@InProceedings{etscheid_et_al:LIPIcs.ISAAC.2016.31,
author = {Etscheid, Michael and Mnich, Matthias},
title = {{Linear Kernels and Linear-Time Algorithms for Finding Large Cuts}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {31:1--31:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.31},
URN = {urn:nbn:de:0030-drops-68016},
doi = {10.4230/LIPIcs.ISAAC.2016.31},
annote = {Keywords: Max-Cut, fixed-parameter tractability, kernelization}
}
@InProceedings{fekete_et_al:LIPIcs.ISAAC.2016.32,
author = {Fekete, S\'{a}ndor P. and Li, Qian and Mitchell, Joseph S. B. and Scheffer, Christian},
title = {{Universal Guard Problems}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {32:1--32:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.32},
URN = {urn:nbn:de:0030-drops-68022},
doi = {10.4230/LIPIcs.ISAAC.2016.32},
annote = {Keywords: Art Gallery Problem, universal guarding, polygonization, worst-case bounds, robust covering}
}
@InProceedings{feldmann_et_al:LIPIcs.ISAAC.2016.33,
author = {Feldmann, Andreas Emil and K\"{o}nemann, Jochen and Pashkovich, Kanstantsin and Sanit\`{a}, Laura},
title = {{Fast Approximation Algorithms for the Generalized Survivable Network Design Problem}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {33:1--33:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.33},
URN = {urn:nbn:de:0030-drops-68035},
doi = {10.4230/LIPIcs.ISAAC.2016.33},
annote = {Keywords: strongly polynomial runtime, generalized survivable network design, primal-dual method}
}
@InProceedings{ganguly_et_al:LIPIcs.ISAAC.2016.34,
author = {Ganguly, Arnab and Hon, Wing-Kai and Shah, Rahul and Thankachan, Sharma V.},
title = {{Space-Time Trade-Offs for the Shortest Unique Substring Problem}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {34:1--34:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.34},
URN = {urn:nbn:de:0030-drops-68041},
doi = {10.4230/LIPIcs.ISAAC.2016.34},
annote = {Keywords: Suffix Tree, Sparsification, Rabin-Karp Fingerprint, Probabilistic z-Fast Trie, Succinct Data-Structures}
}
@InProceedings{ghandeharizadeh_et_al:LIPIcs.ISAAC.2016.35,
author = {Ghandeharizadeh, Shahram and Irani, Sandy and Lam, Jenny},
title = {{The Subset Assignment Problem for Data Placement in Caches}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {35:1--35:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.35},
URN = {urn:nbn:de:0030-drops-68058},
doi = {10.4230/LIPIcs.ISAAC.2016.35},
annote = {Keywords: Memory management, caching, simplex method, linear programming, min-cost flow}
}
@InProceedings{ham:LIPIcs.ISAAC.2016.36,
author = {Ham, Lucy},
title = {{A Gap Trichotomy for Boolean Constraint Problems: Extending Schaefer's Theorem}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {36:1--36:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.36},
URN = {urn:nbn:de:0030-drops-68060},
doi = {10.4230/LIPIcs.ISAAC.2016.36},
annote = {Keywords: Constraint Satisfaction Problem, Robust satisfiability, Clone theory, Dichotomy, Trichotomy, Boolean}
}
@InProceedings{hoang_et_al:LIPIcs.ISAAC.2016.37,
author = {Hoang, Duc A. and Uehara, Ryuhei},
title = {{Sliding Tokens on a Cactus}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {37:1--37:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.37},
URN = {urn:nbn:de:0030-drops-68074},
doi = {10.4230/LIPIcs.ISAAC.2016.37},
annote = {Keywords: reconfiguration problem, token sliding, independent set, cactus}
}
@InProceedings{itsykson_et_al:LIPIcs.ISAAC.2016.38,
author = {Itsykson, Dmitry and Knop, Alexander and Sokolov, Dmitry},
title = {{Complexity of Distributions and Average-Case Hardness}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {38:1--38:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.38},
URN = {urn:nbn:de:0030-drops-68083},
doi = {10.4230/LIPIcs.ISAAC.2016.38},
annote = {Keywords: average-case complexity, hierarchy theorem, sampling distributions, diagonalization}
}
@InProceedings{jin:LIPIcs.ISAAC.2016.39,
author = {Jin, Kai},
title = {{Computing the Pattern Waiting Time: A Revisit of the Intuitive Approach}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {39:1--39:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.39},
URN = {urn:nbn:de:0030-drops-68096},
doi = {10.4230/LIPIcs.ISAAC.2016.39},
annote = {Keywords: Pattern Occurrence, Waiting Time, Penney’s Game, Markov Chain}
}
@InProceedings{kao_et_al:LIPIcs.ISAAC.2016.40,
author = {Kao, Mong-Jen and Tu, Hai-Lun and Lee, D. T.},
title = {{O(f) Bi-Approximation for Capacitated Covering with Hard Capacities}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {40:1--40:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.40},
URN = {urn:nbn:de:0030-drops-68102},
doi = {10.4230/LIPIcs.ISAAC.2016.40},
annote = {Keywords: Capacitated Covering, Hard Capacities, Bi-criteria Approximation}
}
@InProceedings{kawase_et_al:LIPIcs.ISAAC.2016.41,
author = {Kawase, Yasushi and Makino, Kazuhisa},
title = {{Surrogate Optimization for p-Norms}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {41:1--41:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.41},
URN = {urn:nbn:de:0030-drops-68118},
doi = {10.4230/LIPIcs.ISAAC.2016.41},
annote = {Keywords: surrogate optimization, matroid, extendible system, p-norm}
}
@InProceedings{kawase_et_al:LIPIcs.ISAAC.2016.42,
author = {Kawase, Yasushi and Makino, Kazuhisa and Seimi, Kento},
title = {{Optimal Composition Ordering Problems for Piecewise Linear Functions}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {42:1--42:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.42},
URN = {urn:nbn:de:0030-drops-68126},
doi = {10.4230/LIPIcs.ISAAC.2016.42},
annote = {Keywords: function composition, time-dependent scheduling}
}
@InProceedings{kawase_et_al:LIPIcs.ISAAC.2016.43,
author = {Kawase, Yasushi and Matsui, Tomomi and Miyauchi, Atsushi},
title = {{Additive Approximation Algorithms for Modularity Maximization}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {43:1--43:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.43},
URN = {urn:nbn:de:0030-drops-68136},
doi = {10.4230/LIPIcs.ISAAC.2016.43},
annote = {Keywords: networks, community detection, modularity maximization, approxima- tion algorithms}
}
@InProceedings{kawase_et_al:LIPIcs.ISAAC.2016.44,
author = {Kawase, Yasushi and Miyauchi, Atsushi},
title = {{The Densest Subgraph Problem with a Convex/Concave Size Function}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {44:1--44:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.44},
URN = {urn:nbn:de:0030-drops-68149},
doi = {10.4230/LIPIcs.ISAAC.2016.44},
annote = {Keywords: graphs, dense subgraph extraction, densest subgraph problem, approxi- mation algorithms}
}
@InProceedings{klavik_et_al:LIPIcs.ISAAC.2016.45,
author = {Klav{\'\i}k, Pavel and Otachi, Yota and \v{S}ejnoha, Jiri},
title = {{On the Classes of Interval Graphs of Limited Nesting and Count of Lengths}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {45:1--45:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.45},
URN = {urn:nbn:de:0030-drops-68155},
doi = {10.4230/LIPIcs.ISAAC.2016.45},
annote = {Keywords: interval graphs, proper and unit interval graphs, recognition, partial representation extension}
}
@InProceedings{kociumaka_et_al:LIPIcs.ISAAC.2016.46,
author = {Kociumaka, Tomasz and Pissis, Solon P. and Radoszewski, Jakub},
title = {{Pattern Matching and Consensus Problems on Weighted Sequences and Profiles}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {46:1--46:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.46},
URN = {urn:nbn:de:0030-drops-68166},
doi = {10.4230/LIPIcs.ISAAC.2016.46},
annote = {Keywords: weighted sequence, position weight matrix, profile matching}
}
@InProceedings{kontogiannis_et_al:LIPIcs.ISAAC.2016.47,
author = {Kontogiannis, Spyros and Wagner, Dorothea and Zaroliagis, Christos},
title = {{Hierarchical Time-Dependent Oracles}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {47:1--47:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.47},
URN = {urn:nbn:de:0030-drops-68170},
doi = {10.4230/LIPIcs.ISAAC.2016.47},
annote = {Keywords: Time-dependent shortest paths, FIFO property, Distance oracles}
}
@InProceedings{vankreveld_et_al:LIPIcs.ISAAC.2016.48,
author = {van Kreveld, Marc and L\"{o}ffler, Maarten and Staals, Frank and Wiratma, Lionov},
title = {{A Refined Definition for Groups of Moving Entities and its Computation}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {48:1--48:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.48},
URN = {urn:nbn:de:0030-drops-68188},
doi = {10.4230/LIPIcs.ISAAC.2016.48},
annote = {Keywords: moving entities, trajectories, grouping, computational geometry}
}
@InProceedings{kurz_et_al:LIPIcs.ISAAC.2016.49,
author = {Kurz, Denis and Mutzel, Petra},
title = {{A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {49:1--49:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.49},
URN = {urn:nbn:de:0030-drops-68199},
doi = {10.4230/LIPIcs.ISAAC.2016.49},
annote = {Keywords: directed graph, k-best, shortest path, simple path, weighted graph}
}
@InProceedings{le_et_al:LIPIcs.ISAAC.2016.50,
author = {Le, Hoang-Oanh and Le, Van Bang},
title = {{On the Complexity of Matching Cut in Graphs of Fixed Diameter}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {50:1--50:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.50},
URN = {urn:nbn:de:0030-drops-68205},
doi = {10.4230/LIPIcs.ISAAC.2016.50},
annote = {Keywords: matching cut, NP-hardness, graph algorithm, computational complexity, decomposable graph}
}
@InProceedings{li_et_al:LIPIcs.ISAAC.2016.51,
author = {Li, Qian and Sun, Xiaoming and Zhang, Jialin},
title = {{On the Optimality of Tape Merge of Two Lists with Similar Size}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {51:1--51:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.51},
URN = {urn:nbn:de:0030-drops-68219},
doi = {10.4230/LIPIcs.ISAAC.2016.51},
annote = {Keywords: comparison-based sorting, tape merge, optimal sort, adversary method}
}
@InProceedings{li_et_al:LIPIcs.ISAAC.2016.52,
author = {Li, Shimin and Wang, Haitao},
title = {{Dispersing Points on Intervals}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {52:1--52:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.52},
URN = {urn:nbn:de:0030-drops-68248},
doi = {10.4230/LIPIcs.ISAAC.2016.52},
annote = {Keywords: dispersing points, intervals, min-max, algorithms, cycles}
}
@InProceedings{liu_et_al:LIPIcs.ISAAC.2016.53,
author = {Liu, Fu-Hong and Liu, Hsiang-Hsuan and Wong, Prudence W. H.},
title = {{Optimal Nonpreemptive Scheduling in a Smart Grid Model}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {53:1--53:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.53},
URN = {urn:nbn:de:0030-drops-68252},
doi = {10.4230/LIPIcs.ISAAC.2016.53},
annote = {Keywords: Scheduling, Smart Grid, Convex function cost, Fixed parameter tractable, Online algorithms, Non-preemptive}
}
@InProceedings{liu_et_al:LIPIcs.ISAAC.2016.54,
author = {Liu, Yangwei and Ding, Hu and Huang, Ziyun and Xu, Jinhui},
title = {{Distributed and Robust Support Vector Machine}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {54:1--54:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.54},
URN = {urn:nbn:de:0030-drops-68221},
doi = {10.4230/LIPIcs.ISAAC.2016.54},
annote = {Keywords: Distributed Algorithm, Communication Complexity, Robust Algorithm, SVM}
}
@InProceedings{luo_et_al:LIPIcs.ISAAC.2016.55,
author = {Luo, Wenchang and Xu, Yao and Tong, Weitian and Lin, Guohui},
title = {{Single Machine Scheduling with Job-Dependent Machine Deterioration}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {55:1--55:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.55},
URN = {urn:nbn:de:0030-drops-68236},
doi = {10.4230/LIPIcs.ISAAC.2016.55},
annote = {Keywords: Scheduling, machine deterioration, maintenance, NP-hard, approxima- tion algorithm}
}
@InProceedings{martin_et_al:LIPIcs.ISAAC.2016.56,
author = {Martin, Christopher S. and Salavatipour, Mohammad R.},
title = {{Approximation Algorithms for Capacitated k-Travelling Repairmen Problems}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {56:1--56:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.56},
URN = {urn:nbn:de:0030-drops-68262},
doi = {10.4230/LIPIcs.ISAAC.2016.56},
annote = {Keywords: approximation, capacitated, latency, group coverage}
}
@InProceedings{moriguchi_et_al:LIPIcs.ISAAC.2016.57,
author = {Moriguchi, Satoko and Murota, Kazuo and Tamura, Akihisa and Tardella, Fabio},
title = {{Scaling and Proximity Properties of Integrally Convex Functions}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {57:1--57:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.57},
URN = {urn:nbn:de:0030-drops-68368},
doi = {10.4230/LIPIcs.ISAAC.2016.57},
annote = {Keywords: Discrete optimization, discrete convexity, proximity theorem, scaling algorithm}
}
@InProceedings{oh_et_al:LIPIcs.ISAAC.2016.58,
author = {Oh, Eunjin and Ahn, Hee-Kap},
title = {{Assigning Weights to Minimize the Covering Radius in the Plane}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {58:1--58:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.58},
URN = {urn:nbn:de:0030-drops-68275},
doi = {10.4230/LIPIcs.ISAAC.2016.58},
annote = {Keywords: Weighted center, facility location, weight assignment, combinatorial op- timization, computational geometry}
}
@InProceedings{oh_et_al:LIPIcs.ISAAC.2016.59,
author = {Oh, Eunjin and Ahn, Hee-Kap},
title = {{A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {59:1--59:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.59},
URN = {urn:nbn:de:0030-drops-68283},
doi = {10.4230/LIPIcs.ISAAC.2016.59},
annote = {Keywords: Network Augmentation, Shortcuts, Diameter, Trees}
}
@InProceedings{scheffer_et_al:LIPIcs.ISAAC.2016.60,
author = {Scheffer, Christian and Vahrenhold, Jan},
title = {{Approximate Shortest Distances Among Smooth Obstacles in 3D}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {60:1--60:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.60},
URN = {urn:nbn:de:0030-drops-68292},
doi = {10.4230/LIPIcs.ISAAC.2016.60},
annote = {Keywords: Geodesic distances; approximation algorithm; epsilon sample}
}
@InProceedings{wang_et_al:LIPIcs.ISAAC.2016.61,
author = {Wang, Te-Li and Yeh, Chih-Kuan and Chen, Ho-Lin},
title = {{An Improved Tax Scheme for Selfish Routing}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {61:1--61:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.61},
URN = {urn:nbn:de:0030-drops-68308},
doi = {10.4230/LIPIcs.ISAAC.2016.61},
annote = {Keywords: selfish routing, price of anarchy, tax}
}
@InProceedings{xiao_et_al:LIPIcs.ISAAC.2016.62,
author = {Xiao, Mingyu and Nagamochi, Hiroshi},
title = {{A Linear-Time Algorithm for Integral Multiterminal Flows in Trees}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {62:1--62:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.62},
URN = {urn:nbn:de:0030-drops-68311},
doi = {10.4230/LIPIcs.ISAAC.2016.62},
annote = {Keywords: Multiterminal flow; Maximum flow; Minimum Cut; Trees; Linear-time algorithms}
}
@InProceedings{yamaguchi:LIPIcs.ISAAC.2016.63,
author = {Yamaguchi, Yutaro},
title = {{Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {63:1--63:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.63},
URN = {urn:nbn:de:0030-drops-68325},
doi = {10.4230/LIPIcs.ISAAC.2016.63},
annote = {Keywords: Mader's S-paths, packing non-zero A-paths in group-labeled graphs, linear matroid parity, weighted problems, tractability}
}
@InProceedings{yu_et_al:LIPIcs.ISAAC.2016.64,
author = {Yu, Hung-I and Lin, Tien-Ching and Lee, Der-Tsai},
title = {{The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints}},
booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)},
pages = {64:1--64:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-026-2},
ISSN = {1868-8969},
year = {2016},
volume = {64},
editor = {Hong, Seok-Hee},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.64},
URN = {urn:nbn:de:0030-drops-68337},
doi = {10.4230/LIPIcs.ISAAC.2016.64},
annote = {Keywords: competitive facility, Euclidean plane, parametric search}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing