default search action
34th ISAAC 2023: Kyoto, Japan
- Satoru Iwata
, Naonori Kakimura
34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan. LIPIcs 283, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-289-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Edith Elkind:
Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk). 1:1-1:3 - Seok-Hee Hong:
Faithful Graph Drawing (Invited Talk). 2:1-2:1 - Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, Carola Wenk:
Realizability of Free Spaces of Curves. 3:1-3:20 - Duncan Adamson
k-Universality of Regular Languages. 4:1-4:21 - Jungho Ahn, Jinha Kim, O-joung Kwon:
Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. 5:1-5:19 - Henk Alkema, Mark de Berg:
Geometric TSP on Sets. 6:1-6:19 - Kazuyuki Amano:
Depth-Three Circuits for Inner Product and Majority Functions. 7:1-7:16 - Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing Unit Multiple Intervals Is Hard. 8:1-8:18 - Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Non-Clairvoyant Makespan Minimization Scheduling with Predictions. 9:1-9:15 - Gabriel Bathie
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. 10:1-10:17 - Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski:
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. 11:1-11:13 - Giulia Bernardini
Substring Complexity in Sublinear Space. 12:1-12:19 - Sebastian Berndt, Hauke Brinkop
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. 13:1-13:18 - Jannis Blauth, Meike Neuwohner
Improved Guarantees for the a Priori TSP. 14:1-14:16 - Michaela Borzechowski, Patrick Schnider
An FPT Algorithm for Splitting a Necklace Among Two Thieves. 15:1-15:14 - Cornelius Brand, Alexandra Lassota:
Fast Convolutions for Near-Convex Sequences. 16:1-16:16 - Diptarka Chakraborty, Sanjana Dey:
Matrix Completion: Approximating the Minimum Diameter. 17:1-17:19 - Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang:
Distance Queries over Dynamic Interval Graphs. 18:1-18:19 - Huairui Chu, Bingkai Lin:
FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. 19:1-19:20 - Tomer Cohen, Ariel Kulik, Hadas Shachnai:
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. 20:1-20:17 - Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
A Compact DAG for Storing and Searching Maximal Common Subsequences. 21:1-21:15 - Nicola Cotumaccio
Prefix Sorting DFAs: A Recursive Algorithm. 22:1-22:15 - Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous:
Clustering in Polygonal Domains. 23:1-23:15 - Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Finding Diverse Minimum s-t Cuts. 24:1-24:17 - Anubhav Dhar, Soumita Hait, Sudeshna Kolay:
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. 25:1-25:17 - Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Rectilinear-Upward Planarity Testing of Digraphs. 26:1-26:20 - Yann Disser, Nils Mosis:
A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. 27:1-27:17 - Nicolas El Maalouly, Raphael Steiner, Lasse Wulf:
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. 28:1-28:18 - Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Approximation Guarantees for Shortest Superstrings: Simpler and Better. 29:1-29:17 - David Eppstein, Daniel Frishberg:
Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. 30:1-30:13 - Carl Feghali, Felicia Lucke
Matching Cuts in Graphs of High Girth and H-Free Graphs. 31:1-31:16 - Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Computing Paths of Large Rank in Planar Frameworks Deterministically. 32:1-32:15 - Petr Gregor, Torsten Mütze, Namrata:
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. 33:1-33:19 - Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Computing a Subtrajectory Cluster from c-Packed Trajectories. 34:1-34:15 - Joachim Gudmundsson, Yuan Sha:
Shortest Beer Path Queries in Digraphs with Bounded Treewidth. 35:1-35:17 - Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen
Coloring and Recognizing Mixed Interval Graphs. 36:1-36:14 - Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama:
Shortest Beer Path Queries Based on Graph Decomposition. 37:1-37:20 - Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov:
Temporal Separators with Deadlines. 38:1-38:19 - Shuichi Hirahara, Dana Moshkovitz:
Regularization of Low Error PCPs and an Application to MCSP. 39:1-39:16 - Lars Jaffke, Paloma T. Lima, Roohani Sharma:
Structural Parameterizations of b-Coloring. 40:1-40:14 - Ragesh Jaiswal, Amit Kumar:
Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions. 41:1-41:16 - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. 42:1-42:18 - Ben Jourdan, Peter Macgregor
Is the Algorithmic Kadison-Singer Problem Hard? 43:1-43:18 - Frank Kammer, Johannes Meintrup:
Succinct Planar Encoding with Minor Operations. 44:1-44:18 - Mong-Jen Kao:
Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost. 45:1-45:14 - Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. 46:1-46:13 - Kei Kimura, Kazuhisa Makino:
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. 47:1-47:17 - Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
Reconfiguration of the Union of Arborescences. 48:1-48:14 - Yusuke Kobayashi, Takashi Noguchi:
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. 49:1-49:10 - Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, Mong-Jen Kao:
On Min-Max Graph Balancing with Strict Negative Correlation Constraints. 50:1-50:15 - Gang Liu, Haitao Wang:
On the Line-Separable Unit-Disk Coverage and Related Problems. 51:1-51:14 - Bodo Manthey, Jesse van Rhijn
Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. 52:1-52:16 - Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar:
On the Complexity of the Eigenvalue Deletion Problem. 53:1-53:17 - Joydeep Mukherjee, Tamojit Saha:
Connected Vertex Cover on AT-Free Graphs. 54:1-54:12 - Supartha Podder, Penghui Yao, Zekun Ye:
On the Fine-Grained Query Complexity of Symmetric Functions. 55:1-55:18 - Sampriti Roy, Yadu Vasudev:
Testing Properties of Distributions in the Streaming Model. 56:1-56:17 - Shuai Shao, Stanislav Zivný:
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. 57:1-57: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 2024-11-15 19:45 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: