ISAAC B

66 papers

YearTitle / Authors
2015A New Approximate Min-Max Theorem with Applications in Cryptography.
Maciej Skórski
2015Adaptive Point Location in Planar Convex Subdivisions.
Siu-Wing Cheng, Man-Kit Lau
2015Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples.
Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk
2015Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings
Khaled M. Elbassioni, Kazuhisa Makino
2015All-Around Near-Optimal Solutions for the Online Bin Packing Problem.
Shahin Kamali, Alejandro López-Ortiz
2015An In-place Framework for Exact and Approximate Shortest Unique Substring Queries.
Wing-Kai Hon, Sharma V. Thankachan, Bojian Xu
2015An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.
Diptarka Chakraborty, Raghunath Tewari
2015An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings.
Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein
2015An Optimal Algorithm for Tiling the Plane with a Translated Polyomino.
Andrew Winslow
2015Approximation Algorithms in the Successive Hitting Set Model.
Sabine Storandt
2015Choice Is Hard.
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
2015Colored Non-crossing Euclidean Steiner Forest.
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
2015Competitive Local Routing with Constraints.
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2015Computing the Gromov-Hausdorff Distance for Metric Trees.
Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang
2015Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs.
Qian-Ping Gu, Gengchun Xu
2015Cops and Robbers on String Graphs.
Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
2015Effectiveness of Structural Restrictions for Hybrid CSPs.
Vladimir Kolmogorov, Michal Rolínek, Rustem Takhanov
2015Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs.
Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay
2015Fully Dynamic Betweenness Centrality.
Matteo Pontecorvi, Vijaya Ramachandran
2015Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games.
Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf
2015General Caching Is Hard: Even with Small Pages.
Lukás Folwarczný, Jirí Sgall
2015Generating Random Hyperbolic Graphs in Subquadratic Time.
Moritz von Looz, Henning Meyerhenke, Roman Prutkin
2015Geometric Matching Algorithms for Two Realistic Terrains.
Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn
2015Give Me Another One!
Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
2015Heuristic Time Hierarchies via Hierarchies for Sampling Distributions.
Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
2015How to Select the Top k Elements from Evolving Data?
Qin Huang, Xingwu Liu, Xiaoming Sun, Jialin Zhang
2015Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds.
Karl Bringmann, Marvin Künnemann
2015Inferring Strings from Full Abelian Periods.
Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures.
Elena Khramtcova, Evanthia Papadopoulou
2015Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.
Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
2015Min-Power Covering Problems.
Eric Angel, Evripidis Bampis, Vincent Chau, Alexander V. Kononov
2015Minimizing the Diameter of a Spanning Tree for Imprecise Points.
Chih-Hung Liu, Sandro Montanari
2015Minimizing the Maximum Moving Cost of Interval Coverage.
Haitao Wang, Xiao Zhang
2015Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms.
David Cattanéo, Simon Perdrix
2015Model-Based Classification of Trajectories.
Maike Buchin, Stef Sijben
2015Multidimensional Range Selection.
Timothy M. Chan, Gelin Zhou
2015Navigating Weighted Regions with Scattered Skinny Tetrahedra.
Siu-Wing Cheng, Man-Kwun Chiu, Jiongxin Jin, Antoine Vigneron
2015Obtaining a Triangular Matrix by Independent Row-Column Permutations.
Guillaume Fertin, Irena Rusu, Stéphane Vialette
2015On Hardness of the Joint Crossing Number.
Petr Hlinený, Gelasio Salazar
2015On a Generalization of Nemhauser and Trotter's Local Optimization Theorem.
Mingyu Xiao
2015On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems.
Sumedh Tirodkar, Sundar Vishwanathan
2015On the Complexity of Computing Prime Tables.
Martin Farach-Colton, Meng-Tsung Tsai
2015On the Minimum Cost Range Assignment Problem.
Paz Carmi, Lilach Chaitman-Yerushalmi
2015On the Succinct Representation of Unlabeled Permutations.
Hicham El-Zein, J. Ian Munro, Siwei Yang
2015Optimal Search Trees with 2-Way Comparisons.
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2015Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2015Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
2015Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract).
Joshua A. Grochow, Youming Qiao
2015Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing.
Stefan Funke, Sabine Storandt
2015Quantum Algorithm for Triangle Finding in Sparse Graphs.
François Le Gall, Shogo Nakajima
2015Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract).
Jun Yan, Jian Weng, Dongdai Lin, Yujuan Quan
2015Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty.
Andrew Mastin, Patrick Jaillet, Sang Chin
2015Run Generation Revisited: What Goes Up May or May Not Come Down.
Michael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh, Hoa T. Vu
2015Serving Online Requests with Mobile Servers.
Abdolhamid Ghodselahi, Fabian Kuhn
2015Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability.
Sándor P. Fekete, Robert T. Schweller, Andrew Winslow
2015Sliding Token on Bipartite Permutation Graphs.
Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara
2015Streaming Verification in Data Analysis.
Samira Daruki, Justin Thaler, Suresh Venkatasubramanian
2015The 2-Center Problem in a Simple Polygon.
Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
2015The Benefit of Recombination in Noisy Evolutionary Search.
Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015The Secretary Problem with a Choice Function.
Yasushi Kawase
2015The VC-Dimension of Visibility on the Boundary of a Simple Polygon.
Matt Gibson, Erik Krohn, Qing Wang
2015Toehold DNA Languages are Regular.
Sebastian Brandt, Nicolas Mattia, Jochen Seidel, Roger Wattenhofer
2015Trading off Worst and Expected Cost in Decision Tree Problems.
Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese
2015Unbounded Discrepancy of Deterministic Random Walks on Grids.
Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
2015Unfolding Orthogonal Polyhedra with Linear Refinement.
Yi-Jun Chang, Hsu-Chun Yen
2015When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.
Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb