@Proceedings{lu_et_al:LIPIcs.ISAAC.2019,
title = {{LIPIcs, Volume 149, ISAAC'19, Complete Volume}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019},
URN = {urn:nbn:de:0030-drops-116417},
doi = {10.4230/LIPIcs.ISAAC.2019},
annote = {Keywords: Theory of computation; Models of computation; Computational complexity and cryptography; Randomness, geometry and discrete structures; Theory and algorithms for application domains; Design and analysis of algorithms}
}
@InProceedings{lu_et_al:LIPIcs.ISAAC.2019.0,
author = {Lu, Pinyan and Zhang, Guochuan},
title = {{Front Matter, Table of Contents, Preface, Symposium Organization}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.0},
URN = {urn:nbn:de:0030-drops-114967},
doi = {10.4230/LIPIcs.ISAAC.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Symposium Organization}
}
@InProceedings{cao_et_al:LIPIcs.ISAAC.2019.1,
author = {Cao, Yixin and Wang, Zhifeng and Rong, Guozhen and Wang, Jianxin},
title = {{Graph Searches and Their End Vertices}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {1:1--1:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.1},
URN = {urn:nbn:de:0030-drops-114973},
doi = {10.4230/LIPIcs.ISAAC.2019.1},
annote = {Keywords: maximum cardinality search, (lexicographic) breadth-first search, (lexicographic) depth-first search, chordal graph, weighted clique graph, end vertex}
}
@InProceedings{bshouty:LIPIcs.ISAAC.2019.2,
author = {Bshouty, Nader H.},
title = {{Lower Bound for Non-Adaptive Estimation of the Number of Defective Items}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {2:1--2:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.2},
URN = {urn:nbn:de:0030-drops-114983},
doi = {10.4230/LIPIcs.ISAAC.2019.2},
annote = {Keywords: Group Testing, Estimation, Defective Items}
}
@InProceedings{haraguchi_et_al:LIPIcs.ISAAC.2019.3,
author = {Haraguchi, Kazuya and Nagamochi, Hiroshi},
title = {{A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.3},
URN = {urn:nbn:de:0030-drops-114990},
doi = {10.4230/LIPIcs.ISAAC.2019.3},
annote = {Keywords: Graph with itemsets, Enumeration, Polynomial-delay algorithms, Connectors}
}
@InProceedings{bille_et_al:LIPIcs.ISAAC.2019.4,
author = {Bille, Philip and Gawrychowski, Pawe{\l} and G{\o}rtz, Inge Li and Landau, Gad M. and Weimann, Oren},
title = {{Top Tree Compression of Tries}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {4:1--4:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.4},
URN = {urn:nbn:de:0030-drops-115000},
doi = {10.4230/LIPIcs.ISAAC.2019.4},
annote = {Keywords: pattern matching, tree compression, top trees, pointer machine}
}
@InProceedings{zehmakan:LIPIcs.ISAAC.2019.5,
author = {Zehmakan, Ahad N.},
title = {{Two Phase Transitions in Two-Way Bootstrap Percolation}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {5:1--5:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.5},
URN = {urn:nbn:de:0030-drops-115017},
doi = {10.4230/LIPIcs.ISAAC.2019.5},
annote = {Keywords: bootstrap percolation, cellular automata, phase transition, d-dimensional torus, r-threshold model, biased majority}
}
@InProceedings{ganardi_et_al:LIPIcs.ISAAC.2019.6,
author = {Ganardi, Moses and Hucke, Danny and Lohrey, Markus and Starikovskaya, Tatiana},
title = {{Sliding Window Property Testing for Regular Languages}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.6},
URN = {urn:nbn:de:0030-drops-115023},
doi = {10.4230/LIPIcs.ISAAC.2019.6},
annote = {Keywords: Streaming algorithms, approximation algorithms, regular languages}
}
@InProceedings{goldstein_et_al:LIPIcs.ISAAC.2019.7,
author = {Goldstein, Isaac and Lewenstein, Moshe and Porat, Ely},
title = {{On the Hardness of Set Disjointness and Set Intersection with Bounded Universe}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {7:1--7:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.7},
URN = {urn:nbn:de:0030-drops-115036},
doi = {10.4230/LIPIcs.ISAAC.2019.7},
annote = {Keywords: set disjointness, set intersection, 3SUM, space-time tradeoff, conditional lower bounds}
}
@InProceedings{flocchini_et_al:LIPIcs.ISAAC.2019.8,
author = {Flocchini, Paola and Killick, Ryan and Kranakis, Evangelos and Santoro, Nicola and Yamashita, Masafumi},
title = {{Gathering and Election by Mobile Robots in a Continuous Cycle}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.8},
URN = {urn:nbn:de:0030-drops-115044},
doi = {10.4230/LIPIcs.ISAAC.2019.8},
annote = {Keywords: Cycle, Election, Gathering, Las Vegas, Monte Carlo, Randomized Algorithm}
}
@InProceedings{hamada_et_al:LIPIcs.ISAAC.2019.9,
author = {Hamada, Koki and Miyazaki, Shuichi and Yanagisawa, Hiroki},
title = {{Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.9},
URN = {urn:nbn:de:0030-drops-115059},
doi = {10.4230/LIPIcs.ISAAC.2019.9},
annote = {Keywords: Stable marriage problem, strategy-proofness, approximation algorithm, ties, incomplete lists}
}
@InProceedings{naori_et_al:LIPIcs.ISAAC.2019.10,
author = {Naori, David and Raz, Danny},
title = {{Online Multidimensional Packing Problems in the Random-Order Model}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.10},
URN = {urn:nbn:de:0030-drops-115067},
doi = {10.4230/LIPIcs.ISAAC.2019.10},
annote = {Keywords: Random Order, Generalized Assignment Problem, Knapsack Problem, Multidimensional Packing, Secretary Problem}
}
@InProceedings{inkulu_et_al:LIPIcs.ISAAC.2019.11,
author = {Inkulu, R. and Kapoor, Sanjiv},
title = {{Approximate Euclidean Shortest Paths in Polygonal Domains}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.11},
URN = {urn:nbn:de:0030-drops-115075},
doi = {10.4230/LIPIcs.ISAAC.2019.11},
annote = {Keywords: Computational Geometry, Geometric Shortest Paths, Approximation Algorithms}
}
@InProceedings{jain_et_al:LIPIcs.ISAAC.2019.12,
author = {Jain, Rahul and Tewari, Raghunath},
title = {{Reachability in High Treewidth Graphs}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.12},
URN = {urn:nbn:de:0030-drops-115087},
doi = {10.4230/LIPIcs.ISAAC.2019.12},
annote = {Keywords: graph reachability, simultaneous time-space upper bound, tree decomposition}
}
@InProceedings{brokkelkamp_et_al:LIPIcs.ISAAC.2019.13,
author = {Brokkelkamp, Ruben and Polak, Sven and Sch\"{a}fer, Guido and Velaj, Yllka},
title = {{Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.13},
URN = {urn:nbn:de:0030-drops-115091},
doi = {10.4230/LIPIcs.ISAAC.2019.13},
annote = {Keywords: Network pricing, Stackelberg network pricing, betweenness centrality, revenue maximization}
}
@InProceedings{bienkowski_et_al:LIPIcs.ISAAC.2019.14,
author = {Bienkowski, Marcin and Je\.{z}, {\L}ukasz and Schmidt, Pawe{\l}},
title = {{Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.14},
URN = {urn:nbn:de:0030-drops-115104},
doi = {10.4230/LIPIcs.ISAAC.2019.14},
annote = {Keywords: k-server, generalized k-server, competitive analysis}
}
@InProceedings{hoi_et_al:LIPIcs.ISAAC.2019.15,
author = {Hoi, Gordon and Stephan, Frank},
title = {{Measure and Conquer for Max Hamming Distance XSAT}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.15},
URN = {urn:nbn:de:0030-drops-115119},
doi = {10.4230/LIPIcs.ISAAC.2019.15},
annote = {Keywords: XSAT, Measure and Conquer, DPLL, Exponential Time Algorithms}
}
@InProceedings{crespelle_et_al:LIPIcs.ISAAC.2019.16,
author = {Crespelle, Christophe and Feghali, Carl and Golovach, Petr A.},
title = {{Cyclability in Graph Classes}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {16:1--16:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.16},
URN = {urn:nbn:de:0030-drops-115128},
doi = {10.4230/LIPIcs.ISAAC.2019.16},
annote = {Keywords: Cyclability, interval graphs, bipartite permutation graphs, cographs}
}
@InProceedings{kulikov_et_al:LIPIcs.ISAAC.2019.17,
author = {Kulikov, Alexander S. and Mikhailin, Ivan and Mokhov, Andrey and Podolskii, Vladimir},
title = {{Complexity of Linear Operators}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {17:1--17:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.17},
URN = {urn:nbn:de:0030-drops-115137},
doi = {10.4230/LIPIcs.ISAAC.2019.17},
annote = {Keywords: algorithms, linear operators, commutativity, range queries, circuit complexity, lower bounds, upper bounds}
}
@InProceedings{albers_et_al:LIPIcs.ISAAC.2019.18,
author = {Albers, Susanne and Ladewig, Leon},
title = {{New Results for the k-Secretary Problem}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {18:1--18:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.18},
URN = {urn:nbn:de:0030-drops-115142},
doi = {10.4230/LIPIcs.ISAAC.2019.18},
annote = {Keywords: Online algorithms, secretary problem, random order model}
}
@InProceedings{bhattacharya_et_al:LIPIcs.ISAAC.2019.19,
author = {Bhattacharya, Anup and Bishnu, Arijit and Ghosh, Arijit and Mishra, Gopinath},
title = {{Triangle Estimation Using Tripartite Independent Set Queries}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {19:1--19:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.19},
URN = {urn:nbn:de:0030-drops-115156},
doi = {10.4230/LIPIcs.ISAAC.2019.19},
annote = {Keywords: Triangle estimation, query complexity, sublinear algorithm}
}
@InProceedings{becchetti_et_al:LIPIcs.ISAAC.2019.20,
author = {Becchetti, Luca and Cruciani, Emilio and Pasquale, Francesco and Rizzo, Sara},
title = {{Step-By-Step Community Detection in Volume-Regular Graphs}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {20:1--20:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.20},
URN = {urn:nbn:de:0030-drops-115163},
doi = {10.4230/LIPIcs.ISAAC.2019.20},
annote = {Keywords: Community detection, Distributed algorithms, Dynamics, Markov chains, Spectral analysis}
}
@InProceedings{galby_et_al:LIPIcs.ISAAC.2019.21,
author = {Galby, Esther and Lima, Paloma T. and Ries, Bernard},
title = {{Blocking Dominating Sets for H-Free Graphs via Edge Contractions}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {21:1--21:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.21},
URN = {urn:nbn:de:0030-drops-115171},
doi = {10.4230/LIPIcs.ISAAC.2019.21},
annote = {Keywords: domination number, blocker problem, H-free graphs}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.ISAAC.2019.22,
author = {Charalampopoulos, Panagiotis and Kociumaka, Tomasz and Mohamed, Manal and Radoszewski, Jakub and Rytter, Wojciech and Wale\'{n}, Tomasz},
title = {{Internal Dictionary Matching}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {22:1--22:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.22},
URN = {urn:nbn:de:0030-drops-115182},
doi = {10.4230/LIPIcs.ISAAC.2019.22},
annote = {Keywords: string algorithms, dictionary matching, internal pattern matching}
}
@InProceedings{fox_et_al:LIPIcs.ISAAC.2019.23,
author = {Fox, Kyle and Li, Xinyi},
title = {{Approximating the Geometric Edit Distance}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {23:1--23:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.23},
URN = {urn:nbn:de:0030-drops-115195},
doi = {10.4230/LIPIcs.ISAAC.2019.23},
annote = {Keywords: Geometric edit distance, Approximation, Randomized algorithms}
}
@InProceedings{chen_et_al:LIPIcs.ISAAC.2019.24,
author = {Chen, Wei and Peng, Binghui},
title = {{On Adaptivity Gaps of Influence Maximization Under the Independent Cascade Model with Full-Adoption Feedback}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {24:1--24:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.24},
URN = {urn:nbn:de:0030-drops-115208},
doi = {10.4230/LIPIcs.ISAAC.2019.24},
annote = {Keywords: Adaptive influence maximization, adaptivity gap, full-adoption feedback}
}
@InProceedings{bae:LIPIcs.ISAAC.2019.25,
author = {Bae, Sang Won},
title = {{Minimum-Width Double-Strip and Parallelogram Annulus}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.25},
URN = {urn:nbn:de:0030-drops-115211},
doi = {10.4230/LIPIcs.ISAAC.2019.25},
annote = {Keywords: geometric covering, parallelogram annulus, two-line center, double-strip}
}
@InProceedings{huang_et_al:LIPIcs.ISAAC.2019.26,
author = {Huang, Ziyun and Feng, Qilong and Wang, Jianxin and Xu, Jinhui},
title = {{Small Candidate Set for Translational Pattern Search}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {26:1--26:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.26},
URN = {urn:nbn:de:0030-drops-115222},
doi = {10.4230/LIPIcs.ISAAC.2019.26},
annote = {Keywords: Bipartite matching, Alignment, Discretization, Approximate algorithm}
}
@InProceedings{bhattacharya_et_al:LIPIcs.ISAAC.2019.27,
author = {Bhattacharya, Binay and Das, Sandip and Dev, Subhadeep Ranjan},
title = {{The Weighted k-Center Problem in Trees for Fixed k}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {27:1--27:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.27},
URN = {urn:nbn:de:0030-drops-115238},
doi = {10.4230/LIPIcs.ISAAC.2019.27},
annote = {Keywords: facility location, prune and search, parametric search, k-center problem, conditional k-center problem, trees}
}
@InProceedings{han_et_al:LIPIcs.ISAAC.2019.28,
author = {Han, Xin and Kawase, Yasushi and Makino, Kazuhisa and Yokomaku, Haruki},
title = {{Online Knapsack Problems with a Resource Buffer}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {28:1--28:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.28},
URN = {urn:nbn:de:0030-drops-115241},
doi = {10.4230/LIPIcs.ISAAC.2019.28},
annote = {Keywords: Online knapsack problem, Resource augmentation, Competitive analysis}
}
@InProceedings{kahle_et_al:LIPIcs.ISAAC.2019.29,
author = {Kahle, Matthew and Tian, Minghao and Wang, Yusu},
title = {{Local Cliques in ER-Perturbed Random Geometric Graphs}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {29:1--29:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.29},
URN = {urn:nbn:de:0030-drops-115253},
doi = {10.4230/LIPIcs.ISAAC.2019.29},
annote = {Keywords: random graphs, random geometric graphs, edge clique number, the probabilistic method, metric recovery}
}
@InProceedings{ashvinkumar_et_al:LIPIcs.ISAAC.2019.30,
author = {Ashvinkumar, Vikrant and Gudmundsson, Joachim and Levcopoulos, Christos and Nilsson, Bengt J. and van Renssen, Andr\'{e}},
title = {{Local Routing in Sparse and Lightweight Geometric Graphs}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {30:1--30:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.30},
URN = {urn:nbn:de:0030-drops-115269},
doi = {10.4230/LIPIcs.ISAAC.2019.30},
annote = {Keywords: Computational geometry, Spanners, Routing}
}
@InProceedings{scheder_et_al:LIPIcs.ISAAC.2019.31,
author = {Scheder, Dominik and Tang, Shuyang and Zhang, Jiaheng},
title = {{Searching for Cryptogenography Upper Bounds via Sum of Square Programming}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {31:1--31:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.31},
URN = {urn:nbn:de:0030-drops-115276},
doi = {10.4230/LIPIcs.ISAAC.2019.31},
annote = {Keywords: Communication Complexity, Secret Leaking, Sum of Squares Programming}
}
@InProceedings{kobayashi_et_al:LIPIcs.ISAAC.2019.32,
author = {Kobayashi, Yasuaki and Suetsugu, Koki and Tsuiki, Hideki and Uehara, Ryuhei},
title = {{On the Complexity of Lattice Puzzles}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {32:1--32:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.32},
URN = {urn:nbn:de:0030-drops-115287},
doi = {10.4230/LIPIcs.ISAAC.2019.32},
annote = {Keywords: Lattice puzzle, NP-completeness, GI-completeness, FPT algorithm}
}
@InProceedings{destefani:LIPIcs.ISAAC.2019.33,
author = {De Stefani, Lorenzo},
title = {{The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {33:1--33:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.33},
URN = {urn:nbn:de:0030-drops-115299},
doi = {10.4230/LIPIcs.ISAAC.2019.33},
annote = {Keywords: I/O complexity, Hybrid Algorithm, Matrix Multiplication, Recomputation}
}
@InProceedings{mazzetto_et_al:LIPIcs.ISAAC.2019.34,
author = {Mazzetto, Alessio and Pietracaprina, Andrea and Pucci, Geppino},
title = {{Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {34:1--34:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.34},
URN = {urn:nbn:de:0030-drops-115302},
doi = {10.4230/LIPIcs.ISAAC.2019.34},
annote = {Keywords: Clustering, k-median, k-means, MapReduce, Coreset}
}
@InProceedings{fagerberg_et_al:LIPIcs.ISAAC.2019.35,
author = {Fagerberg, Rolf and Hammer, David and Meyer, Ulrich},
title = {{On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {35:1--35:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.35},
URN = {urn:nbn:de:0030-drops-115313},
doi = {10.4230/LIPIcs.ISAAC.2019.35},
annote = {Keywords: B-trees, Data structures, Lower bounds, Complexity}
}
@InProceedings{kisfaludibak_et_al:LIPIcs.ISAAC.2019.36,
author = {Kisfaludi-Bak, S\'{a}ndor and Marx, D\'{a}niel and van der Zanden, Tom C.},
title = {{How Does Object Fatness Impact the Complexity of Packing in d Dimensions?}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {36:1--36:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.36},
URN = {urn:nbn:de:0030-drops-115327},
doi = {10.4230/LIPIcs.ISAAC.2019.36},
annote = {Keywords: Geometric intersection graph, Independent Set, Object fatness}
}
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2019.37,
author = {de Berg, Mark and Kisfaludi-Bak, S\'{a}ndor and Mehr, Mehran},
title = {{On One-Round Discrete Voronoi Games}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {37:1--37:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.37},
URN = {urn:nbn:de:0030-drops-115339},
doi = {10.4230/LIPIcs.ISAAC.2019.37},
annote = {Keywords: competitive facility location, plurality point}
}
@InProceedings{arvind_et_al:LIPIcs.ISAAC.2019.38,
author = {Arvind, V. and Chatterjee, Abhranil and Datta, Rajit and Mukhopadhyay, Partha},
title = {{On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {38:1--38:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.38},
URN = {urn:nbn:de:0030-drops-115340},
doi = {10.4230/LIPIcs.ISAAC.2019.38},
annote = {Keywords: Determinant, Permanent, Parameterized Complexity, Branching Programs}
}
@InProceedings{nguyenkim:LIPIcs.ISAAC.2019.39,
author = {Nguy\~{ê}n Kim, Thắng},
title = {{A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {39:1--39:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.39},
URN = {urn:nbn:de:0030-drops-115351},
doi = {10.4230/LIPIcs.ISAAC.2019.39},
annote = {Keywords: Approximation Algorithms, Congestion Minimization}
}
@InProceedings{fujishige_et_al:LIPIcs.ISAAC.2019.40,
author = {Fujishige, Yuta and Nakashima, Yuto and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki},
title = {{An Improved Data Structure for Left-Right Maximal Generic Words Problem}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {40:1--40:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.40},
URN = {urn:nbn:de:0030-drops-115366},
doi = {10.4230/LIPIcs.ISAAC.2019.40},
annote = {Keywords: generic words, suffix trees, string processing algorithms}
}
@InProceedings{agrawal_et_al:LIPIcs.ISAAC.2019.41,
author = {Agrawal, Akanksha and Kolay, Sudeshna and Madathil, Jayakrishnan and Saurabh, Saket},
title = {{Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {41:1--41:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.41},
URN = {urn:nbn:de:0030-drops-115372},
doi = {10.4230/LIPIcs.ISAAC.2019.41},
annote = {Keywords: list matrix partitions, parameterized classification, Almost 2-SAT, important separators, iterative compression}
}
@InProceedings{barnoy_et_al:LIPIcs.ISAAC.2019.42,
author = {Bar-Noy, Amotz and B\"{o}hnlein, Toni and Lotker, Zvi and Peleg, David and Rawitz, Dror},
title = {{The Generalized Microscopic Image Reconstruction Problem}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {42:1--42:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.42},
URN = {urn:nbn:de:0030-drops-115382},
doi = {10.4230/LIPIcs.ISAAC.2019.42},
annote = {Keywords: Discrete mathematics, Combinatorics, Reconstruction algorithm, Image reconstruction, Graph spectra, Grid graphs}
}
@InProceedings{papp_et_al:LIPIcs.ISAAC.2019.43,
author = {Papp, P\'{a}l Andr\'{a}s and Wattenhofer, Roger},
title = {{Stabilization Time in Minority Processes}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {43:1--43:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.43},
URN = {urn:nbn:de:0030-drops-115393},
doi = {10.4230/LIPIcs.ISAAC.2019.43},
annote = {Keywords: Minority process, Benevolent model}
}
@InProceedings{bredereck_et_al:LIPIcs.ISAAC.2019.44,
author = {Bredereck, Robert and Heeger, Klaus and Knop, Du\v{s}an and Niedermeier, Rolf},
title = {{Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {44:1--44:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.44},
URN = {urn:nbn:de:0030-drops-115406},
doi = {10.4230/LIPIcs.ISAAC.2019.44},
annote = {Keywords: Stable matching, acceptability graph, fixed-parameter tractability, W\lbrack1\rbrack-hardness, treewidth, treedepth, tree-cut width, feedback set numbers}
}
@InProceedings{he_et_al:LIPIcs.ISAAC.2019.45,
author = {He, Meng and Kazi, Serikzhan},
title = {{Path and Ancestor Queries over Trees with Multidimensional Weight Vectors}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {45:1--45:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.45},
URN = {urn:nbn:de:0030-drops-115415},
doi = {10.4230/LIPIcs.ISAAC.2019.45},
annote = {Keywords: path queries, range queries, algorithms, data structures, theory}
}
@InProceedings{chen_et_al:LIPIcs.ISAAC.2019.46,
author = {Chen, Yong and Goebel, Randy and Su, Bing and Tong, Weitian and Xu, Yao and Zhang, An},
title = {{A 21/16-Approximation for the Minimum 3-Path Partition Problem}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {46:1--46:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.46},
URN = {urn:nbn:de:0030-drops-115422},
doi = {10.4230/LIPIcs.ISAAC.2019.46},
annote = {Keywords: 3-path partition, exact set cover, approximation algorithm, local search, amortized analysis}
}
@InProceedings{barnoy_et_al:LIPIcs.ISAAC.2019.47,
author = {Bar-Noy, Amotz and Choudhary, Keerti and Peleg, David and Rawitz, Dror},
title = {{Efficiently Realizing Interval Sequences}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {47:1--47:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.47},
URN = {urn:nbn:de:0030-drops-115430},
doi = {10.4230/LIPIcs.ISAAC.2019.47},
annote = {Keywords: Graph realization, graphic sequence, interval sequence}
}
@InProceedings{cormode_et_al:LIPIcs.ISAAC.2019.48,
author = {Cormode, Graham and Hickey, Chris},
title = {{Efficient Interactive Proofs for Linear Algebra}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {48:1--48:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.48},
URN = {urn:nbn:de:0030-drops-115449},
doi = {10.4230/LIPIcs.ISAAC.2019.48},
annote = {Keywords: Streaming Interactive Proofs, Linear Algebra}
}
@InProceedings{bonnet_et_al:LIPIcs.ISAAC.2019.49,
author = {Bonnet, \'{E}douard and Bousquet, Nicolas and Thomass\'{e}, St\'{e}phan and Watrigant, R\'{e}mi},
title = {{When Maximum Stable Set Can Be Solved in FPT Time}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {49:1--49:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.49},
URN = {urn:nbn:de:0030-drops-115458},
doi = {10.4230/LIPIcs.ISAAC.2019.49},
annote = {Keywords: Parameterized Algorithms, Independent Set, H-Free Graphs}
}
@InProceedings{alvesakitaya_et_al:LIPIcs.ISAAC.2019.50,
author = {Alves Akitaya, Hugo and Buchin, Maike and Ryvkin, Leonie and Urhausen, J\'{e}r\^{o}me},
title = {{The k-Fr\'{e}chet Distance: How to Walk Your Dog While Teleporting}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {50:1--50:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.50},
URN = {urn:nbn:de:0030-drops-115462},
doi = {10.4230/LIPIcs.ISAAC.2019.50},
annote = {Keywords: Measures, Fr\'{e}chet distance, Hardness, FPT}
}
@InProceedings{mamano_et_al:LIPIcs.ISAAC.2019.51,
author = {Mamano, Nil and Efrat, Alon and Eppstein, David and Frishberg, Daniel and Goodrich, Michael T. and Kobourov, Stephen and Matias, Pedro and Polishchuk, Valentin},
title = {{New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {51:1--51:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.51},
URN = {urn:nbn:de:0030-drops-115477},
doi = {10.4230/LIPIcs.ISAAC.2019.51},
annote = {Keywords: Nearest-neighbors, Nearest-neighbor chain, motorcycle graph, straight skeleton, multi-fragment algorithm, Euclidean TSP, Steiner TSP}
}
@InProceedings{frei_et_al:LIPIcs.ISAAC.2019.52,
author = {Frei, Fabian and Wada, Koichi},
title = {{Efficient Circuit Simulation in MapReduce}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {52:1--52:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.52},
URN = {urn:nbn:de:0030-drops-115487},
doi = {10.4230/LIPIcs.ISAAC.2019.52},
annote = {Keywords: MapReduce, Circuit Complexity, Parallel Algorithms, Nick’s Class NC}
}
@InProceedings{ghodselahi_et_al:LIPIcs.ISAAC.2019.53,
author = {Ghodselahi, Abdolhamid and Kuhn, Fabian and Turau, Volker},
title = {{Concurrent Distributed Serving with Mobile Servers}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {53:1--53:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.53},
URN = {urn:nbn:de:0030-drops-115497},
doi = {10.4230/LIPIcs.ISAAC.2019.53},
annote = {Keywords: Distributed online resource allocation, Distributed directory, Asynchronous communication, Amortized analysis, Tree embeddings}
}
@InProceedings{eppstein_et_al:LIPIcs.ISAAC.2019.54,
author = {Eppstein, David and Goodrich, Michael T. and Liu, James A. and Matias, Pedro},
title = {{Tracking Paths in Planar Graphs}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {54:1--54:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.54},
URN = {urn:nbn:de:0030-drops-115500},
doi = {10.4230/LIPIcs.ISAAC.2019.54},
annote = {Keywords: Approximation Algorithm, Courcelle’s Theorem, Clique-Width, Planar, 3-SAT, Graph Algorithms, NP-Hardness}
}
@InProceedings{akitaya_et_al:LIPIcs.ISAAC.2019.55,
author = {Akitaya, Hugo A. and Buchin, Maike and Kilgus, Bernhard and Sijben, Stef and Wenk, Carola},
title = {{Distance Measures for Embedded Graphs}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {55:1--55:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.55},
URN = {urn:nbn:de:0030-drops-115517},
doi = {10.4230/LIPIcs.ISAAC.2019.55},
annote = {Keywords: Fr\'{e}chet distance, graph comparison, embedded graphs}
}
@InProceedings{dasler_et_al:LIPIcs.ISAAC.2019.56,
author = {Dasler, Philip and Mount, David M.},
title = {{Online Algorithms for Warehouse Management}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {56:1--56:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.56},
URN = {urn:nbn:de:0030-drops-115526},
doi = {10.4230/LIPIcs.ISAAC.2019.56},
annote = {Keywords: Warehouse management, online algorithms, competitive analysis, robotics}
}
@InProceedings{elzein_et_al:LIPIcs.ISAAC.2019.57,
author = {El-Zein, Hicham and He, Meng and Munro, J. Ian and Nekrich, Yakov and Sandlund, Bryce},
title = {{On Approximate Range Mode and Range Selection}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {57:1--57:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.57},
URN = {urn:nbn:de:0030-drops-115531},
doi = {10.4230/LIPIcs.ISAAC.2019.57},
annote = {Keywords: data structures, approximate range query, range mode, range median}
}
@InProceedings{iacono_et_al:LIPIcs.ISAAC.2019.58,
author = {Iacono, John and Karsin, Ben and Koumoutsos, Grigorios},
title = {{External Memory Planar Point Location with Fast Updates}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {58:1--58:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.58},
URN = {urn:nbn:de:0030-drops-115548},
doi = {10.4230/LIPIcs.ISAAC.2019.58},
annote = {Keywords: point location, data structures, dynamic algorithms, computational geometry}
}
@InProceedings{gaspers_et_al:LIPIcs.ISAAC.2019.59,
author = {Gaspers, Serge and Lau, Joshua},
title = {{Minimizing and Computing the Inverse Geodesic Length on Trees}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {59:1--59:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.59},
URN = {urn:nbn:de:0030-drops-115555},
doi = {10.4230/LIPIcs.ISAAC.2019.59},
annote = {Keywords: Trees, Treewidth, Fixed-Parameter Tractability, Inverse Geodesic Length, Vertex deletion, Polynomial multiplication, Distance distribution}
}
@InProceedings{epa_et_al:LIPIcs.ISAAC.2019.60,
author = {Epa, Narthana S. and Gan, Junhao and Wirth, Anthony},
title = {{Result-Sensitive Binary Search with Noisy Information}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {60:1--60:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.60},
URN = {urn:nbn:de:0030-drops-115568},
doi = {10.4230/LIPIcs.ISAAC.2019.60},
annote = {Keywords: Fault-tolerant search, random walks, noisy comparisons, predecessor queries}
}
@InProceedings{feng_et_al:LIPIcs.ISAAC.2019.61,
author = {Feng, Qilong and Zhang, Zhen and Huang, Ziyun and Xu, Jinhui and Wang, Jianxin},
title = {{Improved Algorithms for Clustering with Outliers}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {61:1--61:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.61},
URN = {urn:nbn:de:0030-drops-115573},
doi = {10.4230/LIPIcs.ISAAC.2019.61},
annote = {Keywords: Clustering with Outliers, Approximation, Random Sampling}
}
@InProceedings{barequet_et_al:LIPIcs.ISAAC.2019.62,
author = {Barequet, Gill and Papadopoulou, Evanthia and Suderland, Martin},
title = {{Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {62:1--62:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.62},
URN = {urn:nbn:de:0030-drops-115582},
doi = {10.4230/LIPIcs.ISAAC.2019.62},
annote = {Keywords: Voronoi diagram, lines, line segments, higher-order, order-k, unbounded, hypersphere arrangement, great hyperspheres}
}
@InProceedings{defrain_et_al:LIPIcs.ISAAC.2019.63,
author = {Defrain, Oscar and Nourine, Lhouari},
title = {{Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P\underline7 - Free and P\underline8 - Free Chordal Graphs}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {63:1--63:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.63},
URN = {urn:nbn:de:0030-drops-115591},
doi = {10.4230/LIPIcs.ISAAC.2019.63},
annote = {Keywords: Minimal dominating sets, enumeration algorithms, linear delay enumeration, chordal graphs, forbidden induced paths}
}
@InProceedings{geissmann_et_al:LIPIcs.ISAAC.2019.64,
author = {Geissmann, Barbara and Leucci, Stefano and Liu, Chih-Hung and Penna, Paolo and Proietti, Guido},
title = {{Dual-Mode Greedy Algorithms Can Save Energy}},
booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)},
pages = {64:1--64:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-130-6},
ISSN = {1868-8969},
year = {2019},
volume = {149},
editor = {Lu, Pinyan and Zhang, Guochuan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.64},
URN = {urn:nbn:de:0030-drops-115604},
doi = {10.4230/LIPIcs.ISAAC.2019.64},
annote = {Keywords: matroids, p-extendible systems, greedy algorithm, approximation algorithms, high-low energy}
}
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