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