<h2>LIPIcs, Volume 212, ISAAC 2021</h2>
<ul>
<li>
<span class="authors">Hee-Kap Ahn and Kunihiko Sadakane</span>
<span class="title">LIPIcs, Volume 212, ISAAC 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021">10.4230/LIPIcs.ISAAC.2021</a>
</li>
<li>
<span class="authors">Hee-Kap Ahn and Kunihiko Sadakane</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.0">10.4230/LIPIcs.ISAAC.2021.0</a>
</li>
<li>
<span class="authors">Tatiana Starikovskaya</span>
<span class="title">Streaming Pattern Matching (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.1">10.4230/LIPIcs.ISAAC.2021.1</a>
</li>
<li>
<span class="authors">Prosenjit Bose</span>
<span class="title">Spanning Properties of Variants of the Delaunay Graph (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.2">10.4230/LIPIcs.ISAAC.2021.2</a>
</li>
<li>
<span class="authors">Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, and Micha Sharir</span>
<span class="title">Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.3">10.4230/LIPIcs.ISAAC.2021.3</a>
</li>
<li>
<span class="authors">Michael Matheny and Jeff M. Phillips</span>
<span class="title">Approximate Maximum Halfspace Discrepancy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.4">10.4230/LIPIcs.ISAAC.2021.4</a>
</li>
<li>
<span class="authors">Matt Gibson-Lopez and Zhongxiu Yang</span>
<span class="title">The VC-Dimension of Limited Visibility Terrains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.5">10.4230/LIPIcs.ISAAC.2021.5</a>
</li>
<li>
<span class="authors">Hongyao Huang, Georgiy Klimenko, and Benjamin Raichel</span>
<span class="title">Clustering with Neighborhoods</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.6">10.4230/LIPIcs.ISAAC.2021.6</a>
</li>
<li>
<span class="authors">Ahmad Biniaz</span>
<span class="title">Approximating Longest Spanning Tree with Neighborhoods</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.7">10.4230/LIPIcs.ISAAC.2021.7</a>
</li>
<li>
<span class="authors">Siu-Wing Cheng and Man Ting Wong</span>
<span class="title">Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.8">10.4230/LIPIcs.ISAAC.2021.8</a>
</li>
<li>
<span class="authors">Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, and Christian Scheffer</span>
<span class="title">Connected Coordinated Motion Planning with Bounded Stretch</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.9">10.4230/LIPIcs.ISAAC.2021.9</a>
</li>
<li>
<span class="authors">Patrick Schnider</span>
<span class="title">Enclosing Depth and Other Depth Measures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.10">10.4230/LIPIcs.ISAAC.2021.10</a>
</li>
<li>
<span class="authors">Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, and Paweł Żyliński</span>
<span class="title">Illuminating the x-Axis by α-Floodlights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.11">10.4230/LIPIcs.ISAAC.2021.11</a>
</li>
<li>
<span class="authors">Aritra Banik, Rajiv Raman, and Saurabh Ray</span>
<span class="title">On Geometric Priority Set Cover Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.12">10.4230/LIPIcs.ISAAC.2021.12</a>
</li>
<li>
<span class="authors">Patrick Schnider</span>
<span class="title">The Complexity of Sharing a Pizza</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.13">10.4230/LIPIcs.ISAAC.2021.13</a>
</li>
<li>
<span class="authors">Sarita de Berg and Frank Staals</span>
<span class="title">Dynamic Data Structures for k-Nearest Neighbor Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.14">10.4230/LIPIcs.ISAAC.2021.14</a>
</li>
<li>
<span class="authors">Florian Barth, Stefan Funke, and Claudius Proissl</span>
<span class="title">Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.15">10.4230/LIPIcs.ISAAC.2021.15</a>
</li>
<li>
<span class="authors">Sam Barr and Therese Biedl</span>
<span class="title">Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.16">10.4230/LIPIcs.ISAAC.2021.16</a>
</li>
<li>
<span class="authors">Mathew C. Francis, Pavol Hell, and Dalu Jacob</span>
<span class="title">On the Kernel and Related Problems in Interval Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.17">10.4230/LIPIcs.ISAAC.2021.17</a>
</li>
<li>
<span class="authors">Soh Kumabe</span>
<span class="title">Interval Query Problem on Cube-Free Median Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.18">10.4230/LIPIcs.ISAAC.2021.18</a>
</li>
<li>
<span class="authors">Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, and Hsiang-Yun Wu</span>
<span class="title">Untangling Circular Drawings: Algorithms and Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.19">10.4230/LIPIcs.ISAAC.2021.19</a>
</li>
<li>
<span class="authors">Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, and Veli Mäkinen</span>
<span class="title">Algorithms and Complexity on Indexing Elastic Founder Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.20">10.4230/LIPIcs.ISAAC.2021.20</a>
</li>
<li>
<span class="authors">Christoph Brause, Petr Golovach, Barnaby Martin, Daniël Paulusma, and Siani Smith</span>
<span class="title">Partitioning H-Free Graphs of Bounded Diameter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.21">10.4230/LIPIcs.ISAAC.2021.21</a>
</li>
<li>
<span class="authors">Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, and Leonidas Theocharous</span>
<span class="title">Clique-Based Separators for Geometric Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.22">10.4230/LIPIcs.ISAAC.2021.22</a>
</li>
<li>
<span class="authors">Jacob Evald, Viktor Fredslund-Hansen, and Christian Wulff-Nilsen</span>
<span class="title">Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.23">10.4230/LIPIcs.ISAAC.2021.23</a>
</li>
<li>
<span class="authors">Markus Anders, Jendrik Brachter, and Pascal Schweitzer</span>
<span class="title">A Characterization of Individualization-Refinement Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.24">10.4230/LIPIcs.ISAAC.2021.24</a>
</li>
<li>
<span class="authors">Viktor Fredslund-Hansen, Shay Mozes, and Christian Wulff-Nilsen</span>
<span class="title">Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.25">10.4230/LIPIcs.ISAAC.2021.25</a>
</li>
<li>
<span class="authors">Anna Małafiejska, Michał Małafiejski, Krzysztof M. Ocetkiewicz, and Krzysztof Pastuszak</span>
<span class="title">Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.26">10.4230/LIPIcs.ISAAC.2021.26</a>
</li>
<li>
<span class="authors">Amotz Bar-Noy, David Peleg, Dror Rawitz, and Elad Yehezkel</span>
<span class="title">Selected Neighbor Degree Forest Realization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.27">10.4230/LIPIcs.ISAAC.2021.27</a>
</li>
<li>
<span class="authors">Sotiris Nikoletseas, Christoforos Raptopoulos, and Paul Spirakis</span>
<span class="title">MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.28">10.4230/LIPIcs.ISAAC.2021.28</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, and Louise Molitor</span>
<span class="title">The Impact of Geometry on Monochrome Regions in the Flip Schelling Process</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.29">10.4230/LIPIcs.ISAAC.2021.29</a>
</li>
<li>
<span class="authors">Franz Aurenhammer, Evanthia Papadopoulou, and Martin Suderland</span>
<span class="title">Piecewise-Linear Farthest-Site Voronoi Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.30">10.4230/LIPIcs.ISAAC.2021.30</a>
</li>
<li>
<span class="authors">Mitchell Black and William Maxwell</span>
<span class="title">Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.31">10.4230/LIPIcs.ISAAC.2021.31</a>
</li>
<li>
<span class="authors">Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, and Vaishali Surianarayanan</span>
<span class="title">Anonymity-Preserving Space Partitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.32">10.4230/LIPIcs.ISAAC.2021.32</a>
</li>
<li>
<span class="authors">Shibo Li and Dominik Scheder</span>
<span class="title">Impatient PPSZ - A Faster Algorithm for CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.33">10.4230/LIPIcs.ISAAC.2021.33</a>
</li>
<li>
<span class="authors">Michael Lampis and Valia Mitsou</span>
<span class="title">Fine-Grained Meta-Theorems for Vertex Integrity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.34">10.4230/LIPIcs.ISAAC.2021.34</a>
</li>
<li>
<span class="authors">Tomohiro Koana, Christian Komusiewicz, and Frank Sommer</span>
<span class="title">Essentially Tight Kernels For (Weakly) Closed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.35">10.4230/LIPIcs.ISAAC.2021.35</a>
</li>
<li>
<span class="authors">Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, and Nikolaos Melissinos</span>
<span class="title">Filling Crosswords Is Very Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.36">10.4230/LIPIcs.ISAAC.2021.36</a>
</li>
<li>
<span class="authors">Siddharth Gupta, Guy Sa'ar, and Meirav Zehavi</span>
<span class="title">Grid Recognition: Classical and Parameterized Computational Perspectives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.37">10.4230/LIPIcs.ISAAC.2021.37</a>
</li>
<li>
<span class="authors">Joseph Cheriyan, Robert Cummings, Jack Dippel, and Jasper Zhu</span>
<span class="title">An Improved Approximation Algorithm for the Matching Augmentation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.38">10.4230/LIPIcs.ISAAC.2021.38</a>
</li>
<li>
<span class="authors">Qian-Ping Gu and JiaJian Liang</span>
<span class="title">Multimodal Transportation with Ridesharing of Personal Vehicles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.39">10.4230/LIPIcs.ISAAC.2021.39</a>
</li>
<li>
<span class="authors">Eloi Araujo, Luiz C. Rozante, Diego P. Rubert, and Fábio V. Martinez</span>
<span class="title">Algorithms for Normalized Multiple Sequence Alignments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.40">10.4230/LIPIcs.ISAAC.2021.40</a>
</li>
<li>
<span class="authors">Marzieh Eskandari, Bhavika Khare, and Nirman Kumar</span>
<span class="title">Separated Red Blue Center Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.41">10.4230/LIPIcs.ISAAC.2021.41</a>
</li>
<li>
<span class="authors">Julián Mestre, Sergey Pupyrev, and Seeun William Umboh</span>
<span class="title">On the Extended TSP Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.42">10.4230/LIPIcs.ISAAC.2021.42</a>
</li>
<li>
<span class="authors">Claire Mathieu and Hang Zhou</span>
<span class="title">Probabilistic Analysis of Euclidean Capacitated Vehicle Routing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.43">10.4230/LIPIcs.ISAAC.2021.43</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Anil Maheshwari, and Michiel Smid</span>
<span class="title">Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.44">10.4230/LIPIcs.ISAAC.2021.44</a>
</li>
<li>
<span class="authors">Joachim Gudmundsson, Yuan Sha, and Fan Yao</span>
<span class="title">Augmenting Graphs to Minimize the Radius</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.45">10.4230/LIPIcs.ISAAC.2021.45</a>
</li>
<li>
<span class="authors">Kyungjin Cho and Eunjin Oh</span>
<span class="title">Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.46">10.4230/LIPIcs.ISAAC.2021.46</a>
</li>
<li>
<span class="authors">Shinwoo An and Eunjin Oh</span>
<span class="title">Feedback Vertex Set on Geometric Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.47">10.4230/LIPIcs.ISAAC.2021.47</a>
</li>
<li>
<span class="authors">Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, and Ge Xia</span>
<span class="title">Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.48">10.4230/LIPIcs.ISAAC.2021.48</a>
</li>
<li>
<span class="authors">Yongho Shin and Hyung-Chan An</span>
<span class="title">Making Three out of Two: Three-Way Online Correlated Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.49">10.4230/LIPIcs.ISAAC.2021.49</a>
</li>
<li>
<span class="authors">Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, and Kazuo Iwama</span>
<span class="title">Tight Competitive Analyses of Online Car-Sharing Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.50">10.4230/LIPIcs.ISAAC.2021.50</a>
</li>
<li>
<span class="authors">Antonios Antoniadis, Gunjan Kumar, and Nikhil Kumar</span>
<span class="title">Skeletons and Minimum Energy Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.51">10.4230/LIPIcs.ISAAC.2021.51</a>
</li>
<li>
<span class="authors">Susanne Albers, Waldo Gálvez, and Maximilian Janke</span>
<span class="title">Machine Covering in the Random-Order Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.52">10.4230/LIPIcs.ISAAC.2021.52</a>
</li>
<li>
<span class="authors">Noam Touitou</span>
<span class="title">Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.53">10.4230/LIPIcs.ISAAC.2021.53</a>
</li>
<li>
<span class="authors">Eric Allender, John Gouwar, Shuichi Hirahara, and Caleb Robelle</span>
<span class="title">Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.54">10.4230/LIPIcs.ISAAC.2021.54</a>
</li>
<li>
<span class="authors">Clément L. Canonne and Karl Wimmer</span>
<span class="title">Identity Testing Under Label Mismatch</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.55">10.4230/LIPIcs.ISAAC.2021.55</a>
</li>
<li>
<span class="authors">Tali Kaufman and David Mass</span>
<span class="title">Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.56">10.4230/LIPIcs.ISAAC.2021.56</a>
</li>
<li>
<span class="authors">Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, and Sunil Shende</span>
<span class="title">Group Evacuation on a Line by Agents with Different Communication Abilities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.57">10.4230/LIPIcs.ISAAC.2021.57</a>
</li>
<li>
<span class="authors">François Le Gall and Masayuki Miyamoto</span>
<span class="title">Lower Bounds for Induced Cycle Detection in Distributed Computing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.58">10.4230/LIPIcs.ISAAC.2021.58</a>
</li>
<li>
<span class="authors">Andrzej Czygrinow, Michał Hanćkowiak, and Marcin Witkowski</span>
<span class="title">Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.59">10.4230/LIPIcs.ISAAC.2021.59</a>
</li>
<li>
<span class="authors">Dhrumil Patel and Rahul Shah</span>
<span class="title">Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.60">10.4230/LIPIcs.ISAAC.2021.60</a>
</li>
<li>
<span class="authors">Rathish Das, Andrea Lincoln, Jayson Lynch, and J. Ian Munro</span>
<span class="title">Dynamic Boolean Formula Evaluation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.61">10.4230/LIPIcs.ISAAC.2021.61</a>
</li>
<li>
<span class="authors">Joyce Bacic, Saeed Mehrabi, and Michiel Smid</span>
<span class="title">Shortest Beer Path Queries in Outerplanar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.62">10.4230/LIPIcs.ISAAC.2021.62</a>
</li>
<li>
<span class="authors">Sujoy Bhore and Rahul Jain</span>
<span class="title">Space-Efficient Algorithms for Reachability in Directed Geometric Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.63">10.4230/LIPIcs.ISAAC.2021.63</a>
</li>
<li>
<span class="authors">Paolo Ferragina, Giovanni Manzini, and Giorgio Vinciguerra</span>
<span class="title">Repetition- and Linearity-Aware Rank/Select Dictionaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.64">10.4230/LIPIcs.ISAAC.2021.64</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, and Jakub Radoszewski</span>
<span class="title">Pattern Masking for Dictionary Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.65">10.4230/LIPIcs.ISAAC.2021.65</a>
</li>
<li>
<span class="authors">Luciano Gualà, Stefano Leucci, and Isabella Ziccardi</span>
<span class="title">Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.66">10.4230/LIPIcs.ISAAC.2021.66</a>
</li>
<li>
<span class="authors">Shuhao Tan</span>
<span class="title">Computing Shapley Values for Mean Width in 3-D</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.67">10.4230/LIPIcs.ISAAC.2021.67</a>
</li>
<li>
<span class="authors">Takao Asano</span>
<span class="title">Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.68">10.4230/LIPIcs.ISAAC.2021.68</a>
</li>
<li>
<span class="authors">Shaojie Tang and Jing Yuan</span>
<span class="title">Adaptive Regularized Submodular Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.69">10.4230/LIPIcs.ISAAC.2021.69</a>
</li>
<li>
<span class="authors">Donggyu Kim, Duksang Lee, and Sang-il Oum</span>
<span class="title">Γ-Graphic Delta-Matroids and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.70">10.4230/LIPIcs.ISAAC.2021.70</a>
</li>
<li>
<span class="authors">Yu Yokoi</span>
<span class="title">An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.71">10.4230/LIPIcs.ISAAC.2021.71</a>
</li>
<li>
<span class="authors">Julian Enoch, Kyle Fox, Dor Mesica, and Shay Mozes</span>
<span class="title">A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.72">10.4230/LIPIcs.ISAAC.2021.72</a>
</li>
<li>
<span class="authors">Leyla Biabani, Mark de Berg, and Morteza Monemizadeh</span>
<span class="title">Maximum-Weight Matching in Sliding Windows and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.73">10.4230/LIPIcs.ISAAC.2021.73</a>
</li>
<li>
<span class="authors">Atsuya Hasegawa and François Le Gall</span>
<span class="title">Quantum Advantage with Shallow Circuits Under Arbitrary Corruption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ISAAC.2021.74">10.4230/LIPIcs.ISAAC.2021.74</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing