default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd ISAAC 2021: Fukuoka, Japan
- Hee-Kap Ahn
, Kunihiko Sadakane:
32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan. LIPIcs 212, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-214-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Tatiana Starikovskaya:
Streaming Pattern Matching (Invited Talk). 1:1-1:1 - Prosenjit Bose:
Spanning Properties of Variants of the Delaunay Graph (Invited Talk). 2:1-2:1 - Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. 3:1-3:15 - Michael Matheny, Jeff M. Phillips:
Approximate Maximum Halfspace Discrepancy. 4:1-4:15 - Matt Gibson-Lopez, Zhongxiu Yang:
The VC-Dimension of Limited Visibility Terrains. 5:1-5:17 - Hongyao Huang, Georgiy Klimenko, Benjamin Raichel:
Clustering with Neighborhoods. 6:1-6:17 - Ahmad Biniaz:
Approximating Longest Spanning Tree with Neighborhoods. 7:1-7:11 - Siu-Wing Cheng, Man Ting Wong:
Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions. 8:1-8:13 - Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer:
Connected Coordinated Motion Planning with Bounded Stretch. 9:1-9:16 - Patrick Schnider:
Enclosing Depth and Other Depth Measures. 10:1-10:15 - Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Illuminating the x-Axis by α-Floodlights. 11:1-11:12 - Aritra Banik, Rajiv Raman, Saurabh Ray:
On Geometric Priority Set Cover Problems. 12:1-12:14 - Patrick Schnider:
The Complexity of Sharing a Pizza. 13:1-13:15 - Sarita de Berg, Frank Staals:
Dynamic Data Structures for k-Nearest Neighbor Queries. 14:1-14:14 - Florian Barth, Stefan Funke, Claudius Proissl:
Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets. 15:1-15:14 - Sam Barr, Therese Biedl:
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. 16:1-16:15 - Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. 17:1-17:17 - Soh Kumabe:
Interval Query Problem on Cube-Free Median Graphs. 18:1-18:14 - Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling Circular Drawings: Algorithms and Complexity. 19:1-19:17 - Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen:
Algorithms and Complexity on Indexing Elastic Founder Graphs. 20:1-20:18 - Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Partitioning H-Free Graphs of Bounded Diameter. 21:1-21:14 - Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. 22:1-22:15 - Jacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen:
Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs. 23:1-23:14 - Markus Anders, Jendrik Brachter, Pascal Schweitzer:
A Characterization of Individualization-Refinement Trees. 24:1-24:14 - Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen:
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. 25:1-25:12 - Anna Malafiejska, Michal Malafiejski, Krzysztof M. Ocetkiewicz, Krzysztof Pastuszak:
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees. 26:1-26:12 - Amotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel:
Selected Neighbor Degree Forest Realization. 27:1-27:15 - Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. 28:1-28:16 - Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor:
The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. 29:1-29:17 - Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland:
Piecewise-Linear Farthest-Site Voronoi Diagrams. 30:1-30:11 - Mitchell Black, William Maxwell:
Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm. 31:1-31:27 - Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan:
Anonymity-Preserving Space Partitions. 32:1-32:16 - Shibo Li, Dominik Scheder:
Impatient PPSZ - A Faster Algorithm for CSP. 33:1-33:20 - Michael Lampis, Valia Mitsou:
Fine-Grained Meta-Theorems for Vertex Integrity. 34:1-34:15 - Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Essentially Tight Kernels For (Weakly) Closed Graphs. 35:1-35:15 - Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling Crosswords Is Very Hard. 36:1-36:16 - Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Grid Recognition: Classical and Parameterized Computational Perspectives. 37:1-37:15 - Joseph Cheriyan, Robert Cummings, Jack Dippel, Jasper Zhu:
An Improved Approximation Algorithm for the Matching Augmentation Problem. 38:1-38:17 - Qian-Ping Gu, Jiajian Leo Liang:
Multimodal Transportation with Ridesharing of Personal Vehicles. 39:1-39:16 - Eloi Araujo, Luiz C. S. Rozante, Diego P. Rubert, Fábio Viduani Martinez:
Algorithms for Normalized Multiple Sequence Alignments. 40:1-40:16 - Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar:
Separated Red Blue Center Clustering. 41:1-41:13 - Julián Mestre, Sergey Pupyrev, Seeun William Umboh:
On the Extended TSP Problem. 42:1-42:14 - Claire Mathieu, Hang Zhou:
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing. 43:1-43:16 - Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. 44:1-44:14 - Joachim Gudmundsson, Yuan Sha, Fan Yao:
Augmenting Graphs to Minimize the Radius. 45:1-45:20 - Kyungjin Cho, Eunjin Oh:
Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces. 46:1-46:13 - Shinwoo An, Eunjin Oh:
Feedback Vertex Set on Geometric Intersection Graphs. 47:1-47:12 - Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. 48:1-48:17 - Yongho Shin, Hyung-Chan An:
Making Three out of Two: Three-Way Online Correlated Selection. 49:1-49:17 - Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama:
Tight Competitive Analyses of Online Car-Sharing Problems. 50:1-50:14 - Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar:
Skeletons and Minimum Energy Scheduling. 51:1-51:16 - Susanne Albers, Waldo Gálvez, Maximilian Janke:
Machine Covering in the Random-Order Model. 52:1-52:16 - Noam Touitou:
Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay. 53:1-53:16 - Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle:
Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity. 54:1-54:17 - Clément L. Canonne, Karl Wimmer:
Identity Testing Under Label Mismatch. 55:1-55:17 - Tali Kaufman, David Mass:
Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion. 56:1-56:17 - Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Group Evacuation on a Line by Agents with Different Communication Abilities. 57:1-57:24 - François Le Gall, Masayuki Miyamoto:
Lower Bounds for Induced Cycle Detection in Distributed Computing. 58:1-58:19 - Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski:
Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion. 59:1-59:13 - Dhrumil Patel, Rahul Shah:
Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space. 60:1-60:14 - Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro:
Dynamic Boolean Formula Evaluation. 61:1-61:19 - Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. 62:1-62:16 - Sujoy Bhore, Rahul Jain:
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs. 63:1-63:17 - Paolo Ferragina, Giovanni Manzini, Giorgio Vinciguerra:
Repetition- and Linearity-Aware Rank/Select Dictionaries. 64:1-64:16 - Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski:
Pattern Masking for Dictionary Matching. 65:1-65:19 - Luciano Gualà, Stefano Leucci, Isabella Ziccardi:
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. 66:1-66:17 - Shuhao Tan:
Computing Shapley Values for Mean Width in 3-D. 67:1-67:17 - Takao Asano:
Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. 68:1-68:17 - Shaojie Tang, Jing Yuan:
Adaptive Regularized Submodular Maximization. 69:1-69:13 - Donggyu Kim, Duksang Lee, Sang-il Oum:
Γ-Graphic Delta-Matroids and Their Applications. 70:1-70:13 - Yu Yokoi:
An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints. 71:1-71:16 - Julian Enoch, Kyle Fox, Dor Mesica, Shay Mozes:
A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities. 72:1-72:16 - Leyla Biabani, Mark de Berg, Morteza Monemizadeh:
Maximum-Weight Matching in Sliding Windows and Beyond. 73:1-73:16 - Atsuya Hasegawa, François Le Gall:
Quantum Advantage with Shallow Circuits Under Arbitrary Corruption. 74:1-74:16
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-08-15 01:40 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
