default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th ISAAC 2016: Sydney, Australia
- Seok-Hee Hong:
27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia. LIPIcs 64, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-026-2 - Front Matter, Table of Contents, Preface, Program Committee, External Reviewers. 0:i-0:xiv
- Xuemin Lin:
Towards Processing of Big Graphs: from Theory, Algorithm to System (Invited Talk). 1:1-1:1 - Kunsoo Park:
Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk). 2:1-2:1 - Amirali Abdullah, Samira Daruki, Chitradeep Dutta Roy, Suresh Venkatasubramanian
:
Streaming Verification of Graph Properties. 3:1-3:14 - Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau:
Building Clusters with Lower-Bounded Sizes. 4:1-4:13 - Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. 5:1-5:13 - Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Kernels for Deletion to Classes of Acyclic Digraphs. 6:1-6:12 - Pankaj K. Agarwal, Jiangwei Pan, Will Victor:
An Efficient Algorithm for Placing Electric Vehicle Charging Stations. 7:1-7:12 - Udit Agarwal, Vijaya Ramachandran:
Finding k Simple Shortest Paths and Cycles. 8:1-8:12 - Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber:
Packing Short Plane Spanning Trees in Complete Geometric Graphs. 9:1-9:12 - Hugo A. Akitaya, Csaba D. Tóth:
Reconstruction of Weakly Simple Polygons from their Edges. 10:1-10:13 - Helmut Alt, Nadja Scharf:
Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. 11:1-11:14 - Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. 12:1-12:12 - Patrizio Angelini, Giordano Da Lozzo:
Clustered Planarity with Pipes. 13:1-13:13 - Sang Won Bae:
L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems. 14:1-14:12 - Sayan Bandyapadhyay, Kasturi R. Varadarajan:
Approximate Clustering via Metric Partitioning. 15:1-15:13 - Sebastian Berndt, Maciej Liskiewicz:
Hard Communication Channels for Steganography. 16:1-16:13 - Therese Biedl, Saeed Mehrabi:
On r-Guarding Thin Orthogonal Polygons. 17:1-17:13 - Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind:
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. 18:1-18:13 - Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. 19:1-19:14 - Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. 20:1-20:12 - Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý:
Online Packet Scheduling with Bounded Delay and Lookahead. 21:1-21:13 - Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. 22:1-22:13 - T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu:
On (1, epsilon)-Restricted Max-Min Fair Allocation Problem. 23:1-23:13 - Timothy M. Chan, Dimitrios Skrepetos:
All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time. 24:1-24:13 - Di Chen, Mordecai J. Golin:
Sink Evacuation on Trees with Dynamic Confluent Flows. 25:1-25:13 - Lijie Chen:
Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation. 26:1-26:12 - Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Search on a Line by Byzantine Robots. 27:1-27:12 - Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton:
Bipartite Matching with Linear Edge Weights. 28:1-28:13 - Hicham El-Zein, J. Ian Munro, Matthew Robertson:
Raising Permutations to Powers in Place. 29:1-29:12 - Amr Elmasry, Frank Kammer:
Space-Efficient Plane-Sweep Algorithms. 30:1-30:13 - Michael Etscheid, Matthias Mnich:
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. 31:1-31:13 - Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer:
Universal Guard Problems. 32:1-32:13 - Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità:
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. 33:1-33:12 - Arnab Ganguly, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan:
Space-Time Trade-Offs for the Shortest Unique Substring Problem. 34:1-34:13 - Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam:
The Subset Assignment Problem for Data Placement in Caches. 35:1-35:12 - Lucy Ham:
A Gap Trichotomy for Boolean Constraint Problems: Extending Schaefer's Theorem. 36:1-36:12 - Duc A. Hoang, Ryuhei Uehara:
Sliding Tokens on a Cactus. 37:1-37:26 - Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Complexity of Distributions and Average-Case Hardness. 38:1-38:12 - Kai Jin:
Computing the Pattern Waiting Time: A Revisit of the Intuitive Approach. 39:1-39:12 - Mong-Jen Kao, Hai-Lun Tu, D. T. Lee:
O(f) Bi-Approximation for Capacitated Covering with Hard Capacities. 40:1-40:12 - Yasushi Kawase, Kazuhisa Makino:
Surrogate Optimization for p-Norms. 41:1-41:13 - Yasushi Kawase, Kazuhisa Makino, Kento Seimi:
Optimal Composition Ordering Problems for Piecewise Linear Functions. 42:1-42:13 - Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive Approximation Algorithms for Modularity Maximization. 43:1-43:13 - Yasushi Kawase, Atsushi Miyauchi:
The Densest Subgraph Problem with a Convex/Concave Size Function. 44:1-44:12 - Pavel Klavík, Yota Otachi, Jirí Sejnoha:
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. 45:1-45:13 - Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. 46:1-46:12 - Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis:
Hierarchical Time-Dependent Oracles. 47:1-47:13 - Marc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma:
A Refined Definition for Groups of Moving Entities and its Computation. 48:1-48:12 - Denis Kurz, Petra Mutzel:
A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph. 49:1-49:13 - Hoàng-Oanh Le, Van Bang Le:
On the Complexity of Matching Cut in Graphs of Fixed Diameter. 50:1-50:12 - Qian Li, Xiaoming Sun, Jialin Zhang:
On the Optimality of Tape Merge of Two Lists with Similar Size. 51:1-51:17 - Shimin Li, Haitao Wang:
Dispersing Points on Intervals. 52:1-52:12 - Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong:
Optimal Nonpreemptive Scheduling in a Smart Grid Model. 53:1-53:13 - Yangwei Liu, Hu Ding, Ziyun Huang, Jinhui Xu:
Distributed and Robust Support Vector Machine. 54:1-54:13 - Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin:
Single Machine Scheduling with Job-Dependent Machine Deterioration. 55:1-55:13 - Christopher S. Martin, Mohammad R. Salavatipour:
Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. 56:1-56:12 - Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Scaling and Proximity Properties of Integrally Convex Functions. 57:1-57:13 - Eunjin Oh, Hee-Kap Ahn:
Assigning Weights to Minimize the Covering Radius in the Plane. 58:1-58:12 - Eunjin Oh, Hee-Kap Ahn:
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. 59:1-59:12 - Christian Scheffer, Jan Vahrenhold:
Approximate Shortest Distances Among Smooth Obstacles in 3D. 60:1-60:13 - Te-Li Wang, Chih-Kuan Yeh, Ho-Lin Chen:
An Improved Tax Scheme for Selfish Routing. 61:1-61:12 - Mingyu Xiao, Hiroshi Nagamochi:
A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. 62:1-62:12 - Yutaro Yamaguchi:
Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity. 63:1-63:13 - Hung-I Yu, Tien-Ching Lin, Der-Tsai Lee:
The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints. 64:1-64:12
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 2025-11-16 00:25 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:
