default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st ISAAC 2020: Hong Kong (Virtual Conference)
- Yixin Cao
, Siu-Wing Cheng, Minming Li:
31st International Symposium on Algorithms and Computation, ISAAC 2020, Hong Kong (Virtual Conference), December 14-18, 2020. LIPIcs 181, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-173-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Sang-il Oum:
How to Decompose a Graph into a Tree-Like Structure (Invited Talk). 1:1-1:1 - Ke Yi:
Worst-Case Optimal Join Algorithms (Invited Talk). 2:1-2:1 - Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos:
(In)approximability of Maximum Minimal FVS. 3:1-3:14 - Anadi Agrawal, Pawel Gawrychowski:
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. 4:1-4:12 - Qilong Feng, Zhen Zhang, Ziyun Huang, Jinhui Xu, Jianxin Wang:
A Unified Framework of FPT Approximation Algorithms for Clustering Problems. 5:1-5:17 - Yoshifumi Sakai, Shunsuke Inenaga:
A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. 6:1-6:16 - Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. 7:1-7:15 - Guido Brückner, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Level Planarity. 8:1-8:15 - Joachim Gudmundsson, Yuan Sha, Sampson Wong:
Approximating the Packedness of Polygonal Curves. 9:1-9:15 - Haozhou Pang, Mohammad R. Salavatipour:
Approximation Algorithms for Generalized Path Scheduling. 10:1-10:16 - Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Approximations for Throughput Maximization. 11:1-11:17 - Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang:
Arithmetic Expression Construction. 12:1-12:15 - Marc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen:
Between Shapes, Using the Hausdorff Distance. 13:1-13:16 - Trung Thanh Nguyen, Jörg Rothe:
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs. 14:1-14:14 - Takao Asano, Hiroyuki Umeda:
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. 15:1-15:16 - Wolfgang Mulzer, Max Willert:
Compact Routing in Unit Disk Graphs. 16:1-16:14 - Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman:
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. 17:1-17:14 - Martin Koutecký, Johannes Zink:
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. 18:1-18:17 - Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of Stability. 19:1-19:14 - Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. 20:1-20:17 - Kangsan Kim, Yongho Shin, Hyung-Chan An:
Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem. 21:1-21:17 - Walter Kern, Daniël Paulusma:
Contracting to a Longest Path in H-Free Graphs. 22:1-22:18 - Bartlomiej Dudek, Pawel Gawrychowski:
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs. 23:1-23:18 - Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen:
Discriminating Codes in Geometric Setups. 24:1-24:16 - Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu:
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. 25:1-25:18 - Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. 26:1-26:12 - Maciej Duleba, Pawel Gawrychowski, Wojciech Janczewski:
Efficient Labeling for Reachability in Directed Acyclic Graphs. 27:1-27:14 - Stefan Funke, Felix Weitbrecht:
Efficiently Computing All Delaunay Triangles Occurring over All Contiguous Subsequences. 28:1-28:15 - Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Enumerating Range Modes. 29:1-29:16 - Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche:
Finding Temporal Paths Under Waiting Time Constraints. 30:1-30:18 - Peter Bradshaw, Tomás Masarík, Ladislav Stacho:
Flexible List Colorings in Graphs with Special Degeneracy Conditions. 31:1-31:15 - Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. 32:1-32:9 - Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden:
Gourds: A Sliding-Block Puzzle with Turning. 33:1-33:16 - Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh:
Improved FPT Algorithms for Deletion to Forest-Like Structures. 34:1-34:16 - Sung-Hwan Kim, Hwan-Gue Cho:
Indexing Isodirectional Pointer Sequences. 35:1-35:15 - Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. 36:1-36:14 - Nicolas Bousquet, Alice Joffard, Paul Ouvrard:
Linear Transformations Between Dominating Sets in the TAR-Model. 37:1-37:14 - Loukas Georgiadis, Evangelos Kosinas:
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems. 38:1-38:16 - Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. 39:1-39:15 - Yuma Tamura, Takehiro Ito, Xiao Zhou:
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. 40:1-40:13 - Nikhil Kumar:
Multicommodity Flows in Planar Graphs with Demands on Faces. 41:1-41:11 - Ke Chen, Adrian Dumitrescu:
Multiparty Selection. 42:1-42:13 - Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche:
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. 43:1-43:16 - Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad:
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. 44:1-44:17 - Kim Thang Nguyen:
Online Primal-Dual Algorithms with Configuration Linear Programs. 45:1-45:16 - Umang Bhaskar, Gunjan Kumar:
Partial Function Extension with Applications to Learning and Property Testing. 46:1-46:16 - Nai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, Chunhao Wang:
Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension. 47:1-47:17 - Philip Bille, Inge Li Gørtz:
Random Access in Persistent Strings. 48:1-48:16 - William L. Holland, Anthony Wirth, Justin Zobel:
Recency Queries with Succinct Representation. 49:1-49:14 - Erik D. Demaine, Justin Kopinsky, Jayson Lynch:
Recursed Is Not Recursive: A Jarring Result. 50:1-50:15 - Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport:
Shared vs Private Randomness in Distributed Interactive Proofs. 51:1-51:13 - Eunjin Oh:
Shortest-Path Queries in Geometric Networks. 52:1-52:15 - Angel A. Cantu, Austin Luchsinger, Robert Schweller, Tim Wylie:
Signal Passing Self-Assembly Simulates Tile Automata. 53:1-53:17 - Kei Uchizawa:
Size, Depth and Energy of Threshold Circuits Computing Parity Function. 54:1-54:13 - Anthony Labarre:
Sorting by Prefix Block-Interchanges. 55:1-55:15 - Xuangui Huang:
Space Hardness of Solving Structured Linear Systems. 56:1-56:12 - Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Sparse Hop Spanners for Unit Disk Graphs. 57:1-57:17 - Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. 58:1-58:17 - Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. 59:1-59:15 - Mark de Berg, Aleksandar Markovic, Seeun William Umboh:
The Online Broadcast Range-Assignment Problem. 60:1-60:15 - Predrag Krnetic, Darya Melnyk, Yuyi Wang, Roger Wattenhofer:
The k-Server Problem with Delays on the Uniform Metric Space. 61:1-61:13 - Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. 62:1-62:16 - Amihood Amir, Itai Boneh:
Update Query Time Trade-Off for Dynamic Suffix Arrays. 63:1-63:16 - Richard Santiago, Yuichi Yoshida:
Weakly Submodular Function Maximization Using Local Submodularity Ratio. 64:1-64:17 - Taku Onodera, Tetsuo Shibuya:
Wear Leveling Revisited. 65:1-65:17
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 2026-09-01 03:18 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
