10.1145/acmotherconferences
ACM Other Conferences
0000000
10.5555/0000000
Proceedings of the 34th International Symposium on Algorithms and Computation (ISAAC 2023)
ISAAC 2023
https://orcid.org/0000-0002-6467-1335
Iwata
Satoru
University of Tokyo, Tokyo,
iwata@mist.i.u-tokyo.ac.jp
Editor
https://orcid.org/0000-0002-3918-3479
Kakimura
Naonori
Keio University, Yokohama, Japan
kakimura@math.keio.ac.jp
Editor
28
11
2023
9783959772891
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
PUB7509
Germany
2023
03
12
2023
06
12
2023
ISAAC 2023: 34th International Symposium on Algorithms and Computation (ISAAC 2023)
ISAAC 2023
Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk)
10.4230/LIPIcs.ISAAC.2023.1
1
Faithful Graph Drawing (Invited Talk)
10.4230/LIPIcs.ISAAC.2023.2
2
Realizability of Free Spaces of Curves
10.4230/LIPIcs.ISAAC.2023.3
3
k-Universality of Regular Languages
10.4230/LIPIcs.ISAAC.2023.4
4
Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes
10.4230/LIPIcs.ISAAC.2023.5
5
Geometric TSP on Sets
10.4230/LIPIcs.ISAAC.2023.6
6
Depth-Three Circuits for Inner Product and Majority Functions
10.4230/LIPIcs.ISAAC.2023.7
7
Recognizing Unit Multiple Intervals Is Hard
10.4230/LIPIcs.ISAAC.2023.8
8
Non-Clairvoyant Makespan Minimization Scheduling with Predictions
10.4230/LIPIcs.ISAAC.2023.9
9
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
10.4230/LIPIcs.ISAAC.2023.10
10
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width
10.4230/LIPIcs.ISAAC.2023.11
11
Substring Complexity in Sublinear Space
10.4230/LIPIcs.ISAAC.2023.12
12
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines
10.4230/LIPIcs.ISAAC.2023.13
13
Improved Guarantees for the a Priori TSP
10.4230/LIPIcs.ISAAC.2023.14
14
An FPT Algorithm for Splitting a Necklace Among Two Thieves
10.4230/LIPIcs.ISAAC.2023.15
15
Fast Convolutions for Near-Convex Sequences
10.4230/LIPIcs.ISAAC.2023.16
16
Matrix Completion: Approximating the Minimum Diameter
10.4230/LIPIcs.ISAAC.2023.17
17
Distance Queries over Dynamic Interval Graphs
10.4230/LIPIcs.ISAAC.2023.18
18
FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
10.4230/LIPIcs.ISAAC.2023.19
19
Improved Approximation for Two-Dimensional Vector Multiple Knapsack
10.4230/LIPIcs.ISAAC.2023.20
20
A Compact DAG for Storing and Searching Maximal Common Subsequences
10.4230/LIPIcs.ISAAC.2023.21
21
Prefix Sorting DFAs: A Recursive Algorithm
10.4230/LIPIcs.ISAAC.2023.22
22
Clustering in Polygonal Domains
10.4230/LIPIcs.ISAAC.2023.23
23
Finding Diverse Minimum s-t Cuts
10.4230/LIPIcs.ISAAC.2023.24
24
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets
10.4230/LIPIcs.ISAAC.2023.25
25
Rectilinear-Upward Planarity Testing of Digraphs
10.4230/LIPIcs.ISAAC.2023.26
26
A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules
10.4230/LIPIcs.ISAAC.2023.27
27
Exact Matching: Correct Parity and FPT Parameterized by Independence Number
10.4230/LIPIcs.ISAAC.2023.28
28
Approximation Guarantees for Shortest Superstrings: Simpler and Better
10.4230/LIPIcs.ISAAC.2023.29
29
Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs
10.4230/LIPIcs.ISAAC.2023.30
30
Matching Cuts in Graphs of High Girth and H-Free Graphs
10.4230/LIPIcs.ISAAC.2023.31
31
Computing Paths of Large Rank in Planar Frameworks Deterministically
10.4230/LIPIcs.ISAAC.2023.32
32
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections
10.4230/LIPIcs.ISAAC.2023.33
33
Computing a Subtrajectory Cluster from c-Packed Trajectories
10.4230/LIPIcs.ISAAC.2023.34
34
Shortest Beer Path Queries in Digraphs with Bounded Treewidth
10.4230/LIPIcs.ISAAC.2023.35
35
Coloring and Recognizing Mixed Interval Graphs
10.4230/LIPIcs.ISAAC.2023.36
36
Shortest Beer Path Queries Based on Graph Decomposition
10.4230/LIPIcs.ISAAC.2023.37
37
Temporal Separators with Deadlines
10.4230/LIPIcs.ISAAC.2023.38
38
Regularization of Low Error PCPs and an Application to MCSP
10.4230/LIPIcs.ISAAC.2023.39
39
Structural Parameterizations of b-Coloring
10.4230/LIPIcs.ISAAC.2023.40
40
Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions
10.4230/LIPIcs.ISAAC.2023.41
41
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes
10.4230/LIPIcs.ISAAC.2023.42
42
Is the Algorithmic Kadison-Singer Problem Hard?
10.4230/LIPIcs.ISAAC.2023.43
43
Succinct Planar Encoding with Minor Operations
10.4230/LIPIcs.ISAAC.2023.44
44
Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost
10.4230/LIPIcs.ISAAC.2023.45
45
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable
10.4230/LIPIcs.ISAAC.2023.46
46
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems
10.4230/LIPIcs.ISAAC.2023.47
47
Reconfiguration of the Union of Arborescences
10.4230/LIPIcs.ISAAC.2023.48
48
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover
10.4230/LIPIcs.ISAAC.2023.49
49
On Min-Max Graph Balancing with Strict Negative Correlation Constraints
10.4230/LIPIcs.ISAAC.2023.50
50
On the Line-Separable Unit-Disk Coverage and Related Problems
10.4230/LIPIcs.ISAAC.2023.51
51
Improved Smoothed Analysis of 2-Opt for the Euclidean TSP
10.4230/LIPIcs.ISAAC.2023.52
52
On the Complexity of the Eigenvalue Deletion Problem
10.4230/LIPIcs.ISAAC.2023.53
53
Connected Vertex Cover on AT-Free Graphs
10.4230/LIPIcs.ISAAC.2023.54
54
On the Fine-Grained Query Complexity of Symmetric Functions
10.4230/LIPIcs.ISAAC.2023.55
55
Testing Properties of Distributions in the Streaming Model
10.4230/LIPIcs.ISAAC.2023.56
56
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
10.4230/LIPIcs.ISAAC.2023.57
57