default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th ISAAC 2018: Jiaoxi, Yilan, Taiwan
- Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao:
29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan. LIPIcs 123, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-094-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii
- Shang-Hua Teng:
Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk). 1:1-1:1 - Clifford Stein:
Approximate Matchings in Massive Graphs via Local Structure (Invited Talk). 2:1-2:1 - Andreas Björklund:
Exploiting Sparsity for Bipartite Hamiltonicity. 3:1-3:11 - Ahad N. Zehmakan:
Opinion Forming in Erdös-Rényi Random Graph and Expanders. 4:1-4:13 - Tereza Klimosová, Josef Malík, Tomás Masarík
, Jana Novotná, Daniël Paulusma, Veronika Slívová:
Colouring (P_r+P_s)-Free Graphs. 5:1-5:13 - Guillaume Ducoffe, Alexandru Popa:
The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes. 6:1-6:13 - Davide Bilò, Kleitos Papadopoulos:
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. 7:1-7:12 - Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Dominating Sets for Sparse Graphs. 8:1-8:13 - Md Lutfar Rahman, Thomas Watson:
Complexity of Unordered CNF Games. 9:1-9:12 - Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal:
Half-Duplex Communication Complexity. 10:1-10:12 - Takashi Ishizuka, Naoyuki Kamiyama:
On the Complexity of Stable Fractional Hypergraph Matching. 11:1-11:12 - Matthew P. Johnson:
Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete. 12:1-12:13 - Johanna E. Preißer, Jens M. Schmidt:
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs. 13:1-13:12 - Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. 14:1-14:13 - Delia Garijo, Alberto Márquez, Natalia Rodríguez, Rodrigo I. Silveira:
Computing Optimal Shortcuts for Networks. 15:1-15:12 - Georgia Avarikioti, Yuyi Wang, Roger Wattenhofer:
Algorithmic Channel Design. 16:1-16:12 - Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. 17:1-17:12 - Pavel Dvorák, Dusan Knop, Tomás Toufar:
Target Set Selection in Dense Graph Classes. 18:1-18:13 - Andreas Björklund, Thore Husfeldt:
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. 19:1-19:13 - Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos:
Data-Compression for Parametrized Counting Problems on Sparse Graphs. 20:1-20:13 - Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee:
Planar Maximum Matching: Towards a Parallel Algorithm. 21:1-21:13 - Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs. 22:1-22:12 - Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki:
Proving the Turing Universality of Oritatami Co-Transcriptional Folding. 23:1-23:13 - Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Cluster Editing in Multi-Layer and Temporal Graphs. 24:1-24:13 - Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. 25:1-25:12 - Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers Under Translation. 26:1-26:13 - Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura:
New and Improved Algorithms for Unordered Tree Inclusion. 27:1-27:12 - Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. 28:1-28:13 - Yen-Ting Chen, Meng-Tsung Tsai, Shi-Chun Tsai:
A Dichotomy Result for Cyclic-Order Traversing Games. 29:1-29:13 - Guillaume Ducoffe, Alexandru Popa:
The b-Matching Problem in Distance-Hereditary Graphs and Beyond. 30:1-30:13 - Qilong Feng, Guanlan Tan, Senmin Zhu, Bin Fu, Jianxin Wang:
New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition. 31:1-31:12 - Michael Matheny, Jeff M. Phillips:
Computing Approximate Statistical Discrepancy. 32:1-32:13 - Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell:
Diversity Maximization in Doubling Metrics. 33:1-33:12 - Nader H. Bshouty, Waseem Makhoul:
On Polynomial Time Constructions of Minimum Height Decision Tree. 34:1-34:12 - Divesh Aggarwal, Priyanka Mukhopadhyay:
Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. 35:1-35:13 - Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. 36:1-36:13 - Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
Algorithms for Coloring Reconfiguration Under Recolorability Constraints. 37:1-37:13 - On-Hei Solomon Lo, Jens M. Schmidt:
A Cut Tree Representation for Pendant Pairs. 38:1-38:9 - Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline Drawings with Topological Constraints. 39:1-39:13 - Davide Bilò:
Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees. 40:1-40:13 - Giordano Da Lozzo, Ignaz Rutter:
Approximation Algorithms for Facial Cycles in Planar Embeddings. 41:1-41:13 - Adam Kunysz:
An Algorithm for the Maximum Weight Strongly Stable Matching Problem. 42:1-42:13 - Eunpyeong Hong, Mong-Jen Kao:
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints. 43:1-43:11 - David F. Gleich, Nate Veldt, Anthony Wirth:
Correlation Clustering Generalized. 44:1-44:13 - Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma:
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. 45:1-45:12 - Johannes Blömer, Sascha Brauer, Kathrin Bujna:
Coresets for Fuzzy K-Means with Applications. 46:1-46:12 - Martin Farach-Colton, Meng Li, Meng-Tsung Tsai:
Streaming Algorithms for Planar Convex Hulls. 47:1-47:13 - Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. 48:1-48:13 - Quirijn W. Bouts, Thom Castermans, Arthur van Goethem, Marc J. van Kreveld, Wouter Meulemans:
Competitive Searching for a Line on a Line Arrangement. 49:1-49:12 - Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing Pairwise Intersecting Disks by Five Points. 50:1-50:12 - Eunjin Oh:
Point Location in Incremental Planar Subdivisions. 51:1-51:12 - Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma:
Convex Partial Transversals of Planar Regions. 52:1-52:12 - Alexander Pilz, Patrick Schnider:
Extending the Centerpoint Theorem to Multiple Points. 53:1-53:13 - Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare:
Approximate Query Processing over Static Sets and Sliding Windows. 54:1-54:12 - Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-Finger Binary Search Trees. 55:1-55:26 - Ivona Bezáková, Andrew Searns:
On Counting Oracles for Path Problems. 56:1-56:12 - Hiroshi Hirai, Yuni Iwamasa:
Reconstructing Phylogenetic Tree From Multipartite Quartet System. 57:1-57:13 - Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen:
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. 58:1-58:13 - Eunjin Oh:
Minimizing Distance-to-Sight in Polygonal Domains. 59:1-59:12 - Franz Aurenhammer, Michael Steinkogler, Rolf Klein:
Partially Walking a Polygon. 60:1-60:9 - Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff:
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. 61:1-61:13 - Xingwu Liu, Zhida Pan, Yuyi Wang, Roger Wattenhofer:
Impatient Online Matching. 62:1-62:12 - Siu-Wing Cheng, Lie Yan:
Extensions of Self-Improving Sorters. 63:1-63:12 - Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. 64:1-64:13 - Martin Hoefer, Lisa Wilhelmi:
Packing Returning Secretaries. 65:1-65:12 - Frank Kammer, Andrej Sajenko:
Simple 2^f-Color Choice Dictionaries. 66:1-66:12 - J. Ian Munro, Kaiyu Wu:
Succinct Data Structures for Chordal Graphs. 67:1-67:12 - Travis Gagie, Meng He, Gonzalo Navarro:
Tree Path Majority Data Structures. 68:1-68:12 - Seungbum Jo, Srinivasa Rao Satti:
Encoding Two-Dimensional Range Top-k Queries Revisited. 69:1-69:13 - Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis:
Longest Unbordered Factor in Quasilinear Time. 70:1-70:13 - Jian-Jia Chen, Nikhil Bansal, Samarjit Chakraborty, Georg von der Brüggen:
Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems. 71:1-71:14 - Galia Shabtai, Danny Raz, Yuval Shavitt:
A Relaxed FPTAS for Chance-Constrained Knapsack. 72:1-72:12 - Dimitris Fotakis, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav:
Covering Clients with Types and Budgets. 73:1-73: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-01-08 22:49 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:
