default search action
30th ISAAC 2019: Shanghai, China
- Pinyan Lu, Guochuan Zhang:
30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China. LIPIcs 149, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-130-6 - Front Matter, Table of Contents, Preface, Symposium Organization. 0:1-0:16
- Yixin Cao
, Zhifeng Wang, Guozhen Rong, Jianxin Wang:
Graph Searches and Their End Vertices. 1:1-1:18 - Nader H. Bshouty:
Lower Bound for Non-Adaptive Estimation of the Number of Defective Items. 2:1-2:9 - Kazuya Haraguchi
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. 3:1-3:15 - Philip Bille
Top Tree Compression of Tries. 4:1-4:18 - Ahad N. Zehmakan:
Two Phase Transitions in Two-Way Bootstrap Percolation. 5:1-5:21 - Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya:
Sliding Window Property Testing for Regular Languages. 6:1-6:13 - Isaac Goldstein, Moshe Lewenstein, Ely Porat:
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. 7:1-7:22 - Paola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, Masafumi Yamashita:
Gathering and Election by Mobile Robots in a Continuous Cycle. 8:1-8:19 - Koki Hamada
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists. 9:1-9:14 - David Naori, Danny Raz:
Online Multidimensional Packing Problems in the Random-Order Model. 10:1-10:15 - R. Inkulu, Sanjiv Kapoor:
Approximate Euclidean Shortest Paths in Polygonal Domains. 11:1-11:17 - Rahul Jain
Reachability in High Treewidth Graphs. 12:1-12:14 - Ruben Brokkelkamp
Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. 13:1-13:15 - Marcin Bienkowski
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics. 14:1-14:14 - Gordon Hoi, Frank Stephan
Measure and Conquer for Max Hamming Distance XSAT. 15:1-15:19 - Christophe Crespelle, Carl Feghali, Petr A. Golovach:
Cyclability in Graph Classes. 16:1-16:13 - Alexander S. Kulikov
Complexity of Linear Operators. 17:1-17:12 - Susanne Albers, Leon Ladewig:
New Results for the k-Secretary Problem. 18:1-18:19 - Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Triangle Estimation Using Tripartite Independent Set Queries. 19:1-19:17 - Luca Becchetti
Step-By-Step Community Detection in Volume-Regular Graphs. 20:1-20:23 - Esther Galby
Blocking Dominating Sets for H-Free Graphs via Edge Contractions. 21:1-21:14 - Panagiotis Charalampopoulos
Internal Dictionary Matching. 22:1-22:17 - Kyle Fox, Xinyi Li:
Approximating the Geometric Edit Distance. 23:1-23:16 - Wei Chen
On Adaptivity Gaps of Influence Maximization Under the Independent Cascade Model with Full-Adoption Feedback. 24:1-24:19 - Sang Won Bae
Minimum-Width Double-Strip and Parallelogram Annulus. 25:1-25:14 - Ziyun Huang
Small Candidate Set for Translational Pattern Search. 26:1-26:17 - Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev:
The Weighted k-Center Problem in Trees for Fixed k. 27:1-27:11 - Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku:
Online Knapsack Problems with a Resource Buffer. 28:1-28:14 - Matthew Kahle, Minghao Tian, Yusu Wang:
Local Cliques in ER-Perturbed Random Geometric Graphs. 29:1-29:22 - Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos
Local Routing in Sparse and Lightweight Geometric Graphs. 30:1-30:13 - Dominik Scheder
Searching for Cryptogenography Upper Bounds via Sum of Square Programming. 31:1-31:12 - Yasuaki Kobayashi
On the Complexity of Lattice Puzzles. 32:1-32:12 - Lorenzo De Stefani:
The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication. 33:1-33:16 - Alessio Mazzetto, Andrea Pietracaprina, Geppino Pucci
Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces. 34:1-34:16 - Rolf Fagerberg, David Hammer
On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? 35:1-35:16 - Sándor Kisfaludi-Bak
How Does Object Fatness Impact the Complexity of Packing in d Dimensions? 36:1-36:18 - Mark de Berg
On One-Round Discrete Voronoi Games. 37:1-37:17 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. 38:1-38:13 - Kim Thang Nguyen
A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing. 39:1-39:12 - Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
An Improved Data Structure for Left-Right Maximal Generic Words Problem. 40:1-40:12 - Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. 41:1-41:14 - Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The Generalized Microscopic Image Reconstruction Problem. 42:1-42:15 - Pál András Papp, Roger Wattenhofer:
Stabilization Time in Minority Processes. 43:1-43:19 - Robert Bredereck
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. 44:1-44:14 - Meng He
Path and Ancestor Queries over Trees with Multidimensional Weight Vectors. 45:1-45:17 - Yong Chen, Randy Goebel, Bing Su, Weitian Tong
A 21/16-Approximation for the Minimum 3-Path Partition Problem. 46:1-46:20 - Amotz Bar-Noy, Keerti Choudhary
Efficiently Realizing Interval Sequences. 47:1-47:15 - Graham Cormode
Efficient Interactive Proofs for Linear Algebra. 48:1-48:19 - Édouard Bonnet
When Maximum Stable Set Can Be Solved in FPT Time. 49:1-49:22 - Hugo Alves Akitaya, Maike Buchin, Leonie Ryvkin, Jérôme Urhausen:
The k-Fréchet Distance: How to Walk Your Dog While Teleporting. 50:1-50:15 - Nil Mamano
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. 51:1-51:21 - Fabian Frei, Koichi Wada:
Efficient Circuit Simulation in MapReduce. 52:1-52:21 - Abdolhamid Ghodselahi, Fabian Kuhn, Volker Turau:
Concurrent Distributed Serving with Mobile Servers. 53:1-53:18 - David Eppstein, Michael T. Goodrich
Tracking Paths in Planar Graphs. 54:1-54:17 - Hugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, Carola Wenk
Distance Measures for Embedded Graphs. 55:1-55:15 - Philip Dasler
Online Algorithms for Warehouse Management. 56:1-56:21 - Hicham El-Zein, Meng He
On Approximate Range Mode and Range Selection. 57:1-57:14 - John Iacono, Ben Karsin, Grigorios Koumoutsos:
External Memory Planar Point Location with Fast Updates. 58:1-58:18 - Serge Gaspers
Minimizing and Computing the Inverse Geodesic Length on Trees. 59:1-59:19 - Narthana S. Epa, Junhao Gan
Result-Sensitive Binary Search with Noisy Information. 60:1-60:15 - Qilong Feng, Zhen Zhang, Ziyun Huang
Improved Algorithms for Clustering with Outliers. 61:1-61:12 - Gill Barequet, Evanthia Papadopoulou
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. 62:1-62:15 - Oscar Defrain, Lhouari Nourine:
Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P7-Free and P8-Free Chordal Graphs. 63:1-63:16 - Barbara Geissmann
Dual-Mode Greedy Algorithms Can Save Energy. 64:1-64:18
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: