ISAAC B

66 papers

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