default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd ISAAC 2022: Seoul, South Korea
- Sang Won Bae
, Heejin Park:
33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea. LIPIcs 248, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-258-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Kunihiko Sadakane:
Succinct Representations of Graphs (Invited Talk). 1:1-1:1 - Jeff Erickson:
The Tragedy of Being Almost but Not Quite Planar (Invited Talk). 2:1-2:1 - Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter:
A Local Search Algorithm for the Min-Sum Submodular Cover Problem. 3:1-3:13 - Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki:
Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. 4:1-4:19 - Sabine Storandt:
Algorithms for Landmark Hub Labeling. 5:1-5:17 - Atsuya Hasegawa, François Le Gall:
An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes. 6:1-6:14 - Julián Mestre, Sergey Pupyrev:
Approximating the Minimum Logarithmic Arrangement Problem. 7:1-7:15 - Zachary Friggstad, Ramin Mousavi:
Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. 8:1-8:17 - Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert:
Budgeted Out-Tree Maximization with Submodular Prizes. 9:1-9:19 - Kyle Fox, Hongyao Huang, Benjamin Raichel:
Clustering with Faulty Centers. 10:1-10:14 - Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny:
Combinatorial and Algorithmic Aspects of Monadic Stability. 11:1-11:17 - Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh:
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. 12:1-12:17 - Kyle Fox, Thomas Stanley:
Computation of Cycle Bases in Surface Embedded Graphs. 13:1-13:13 - Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. 14:1-14:16 - Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga:
Computing Palindromes on a Trie in Linear Time. 15:1-15:15 - Yossi Azar, Eldad Peretz, Noam Touitou:
Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. 16:1-16:18 - Sándor P. Fekete, Peter Kramer, Christian Rieck, Christian Scheffer, Arne Schmidt:
Efficiently Reconfiguring a Connected Swarm of Labeled Robots. 17:1-17:15 - Maciej Skorski:
Entropy Matters: Understanding Performance of Sparse Random Embeddings. 18:1-18:18 - Konstantinos Georgiou, Nikos Giachoudis, Evangelos Kranakis:
Evacuation from a Disk for Robots with Asymmetric Communication. 19:1-19:16 - Tatsuya Gima, Yota Otachi:
Extended MSO Model Checking via Small Vertex Integrity. 20:1-20:15 - Rathish Das, John Iacono, Yakov Nekrich:
External-Memory Dictionaries with Worst-Case Update Cost. 21:1-21:13 - Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. 22:1-22:16 - Michael A. Bekos, Giordano Da Lozzo, Petr Hlinený, Michael Kaufmann:
Graph Product Structure for h-Framed Graphs. 23:1-23:15 - Tatiana Belova, Ivan Bliznets:
Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. 24:1-24:15 - Peyman Afshani, Rasmus Killmann, Kasper Green Larsen:
Hierarchical Categories in Colored Searching. 25:1-25:15 - Junbin Fang, Dominique Unruh, Jun Yan, Dehua Zhou:
How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment? 26:1-26:12 - Shay Mozes, Nathan Wallheimer, Oren Weimann:
Improved Compression of the Okamura-Seymour Metric. 27:1-27:19 - Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao:
Improving the Bounds of the Online Dynamic Power Management Problem. 28:1-28:16 - Kazuyuki Amano:
Integer Complexity and Mixed Binary-Ternary Representation. 29:1-29:16 - Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk:
List Locally Surjective Homomorphisms in Hereditary Graph Classes. 30:1-30:15 - Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl:
Locally Checkable Problems Parameterized by Clique-Width. 31:1-31:20 - Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch:
Lower Bounds on Retroactive Data Structures. 32:1-32:12 - Xiangyu Guo, Kelin Luo, Shi Li, Yuhao Zhang:
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. 33:1-33:18 - Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. 34:1-34:14 - Pankaj K. Agarwal, Tzvika Geft, Dan Halperin, Erin Taylor:
Multi-Robot Motion Planning for Unit Discs with Revolving Areas. 35:1-35:20 - Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. 36:1-36:16 - Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki, Hinano Takeuchi:
On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding. 37:1-37:15 - Ferdinando Cicalese, Clément Dallard, Martin Milanic:
On Constrained Intersection Representations of Graphs and Digraphs. 38:1-38:15 - Akanksha Agrawal, Soumita Hait, Amer E. Mouawad:
On Finding Short Reconfiguration Sequences Between Independent Sets. 39:1-39:14 - Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca:
On Graphs Coverable by k Shortest Paths. 40:1-40:15 - Benjamin Qi:
On Maximizing Sums of Non-Monotone Submodular and Linear Functions. 41:1-41:16 - Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
On Reverse Shortest Paths in Geometric Proximity Graphs. 42:1-42:19 - Jakob Dyrseth, Paloma T. Lima:
On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs. 43:1-43:13 - Tatsuya Akutsu, Tomoya Mori, Naotoshi Nakamura, Satoshi Kozawa, Yuhei Ueno, Thomas N. Sato:
On the Complexity of Tree Edit Distance with Variables. 44:1-44:14 - Sandip Das, Harmender Gahlawat:
On the Cop Number of String Graphs. 45:1-45:18 - Naoto Ohsaka:
On the Parameterized Intractability of Determinant Maximization. 46:1-46:16 - Yusuke Kobayashi, Tatsuya Terao:
One-Face Shortest Disjoint Paths with a Deviation Terminal. 47:1-47:15 - Eunou Lee:
Optimizing Quantum Circuit Parameters via SDP. 48:1-48:16 - Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. 49:1-49:16 - Jianqi Zhou, Peihua Li, Jiong Guo:
Parameterized Approximation Algorithms for TSP. 50:1-50:16 - Miriam Münch, Ignaz Rutter, Peter Stumpf:
Partial and Simultaneous Transitive Orientations via Modular Decompositions. 51:1-51:16 - Vladimir V. Podolskii, Nikolay V. Proskurin:
Polynomial Threshold Functions for Decision Lists. 52:1-52:12 - Paul W. Lapey, Aaron Williams:
Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time. 53:1-53:16 - Kushagra Chatterjee, Prajakta Nimbhorkar:
Popular Edges with Critical Nodes. 54:1-54:14 - Yusuke Kobayashi, Ryoga Mahara:
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. 55:1-55:13 - Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. 56:1-56:13 - Shangqi Lu, Yufei Tao:
Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights. 57:1-57:16 - Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, Frank Staals:
Segment Visibility Counting Queries in Polygons. 58:1-58:16 - Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu:
Shortest Beer Path Queries in Interval Graphs. 59:1-59:17 - Sungmin Kim, Sang-Ki Ko, Yo-Sub Han:
Simon's Congruence Pattern Matching. 60:1-60:17 - Sung-Hwan Kim, Hwan-Gue Cho:
Simple Order-Isomorphic Matching Index with Expected Compact Space. 61:1-61:17 - Frank Kammer, Johannes Meintrup:
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. 62:1-62:15 - Ta-Wei Tu:
Subquadratic Weighted Matroid Intersection Under Rank Oracles. 63:1-63:14 - Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. 64:1-64:18 - William L. Holland:
Succinct List Indexing in Optimal Time. 65:1-65:17 - Artur Ignatiev, Ivan Mihajlin, Alexander Smal:
Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games. 66:1-66:18 - Christian Rieck, Christian Scheffer:
The Dispersive Art Gallery Problem. 67:1-67:18
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 2024-09-22 23:42 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:
