<h2>LIPIcs, Volume 204, ESA 2021</h2>
<ul>
<li>
<span class="authors">Petra Mutzel, Rasmus Pagh, and Grzegorz Herman</span>
<span class="title">LIPIcs, Volume 204, ESA 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021">10.4230/LIPIcs.ESA.2021</a>
</li>
<li>
<span class="authors">Petra Mutzel, Rasmus Pagh, and Grzegorz Herman</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.0">10.4230/LIPIcs.ESA.2021.0</a>
</li>
<li>
<span class="authors">Lukas Glomb, Benno Hoch, Frauke Liers, and Florian Rösel</span>
<span class="title">Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.1">10.4230/LIPIcs.ESA.2021.1</a>
</li>
<li>
<span class="authors">Aaron Roth</span>
<span class="title">A User Friendly Power Tool for Deriving Online Learning Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.2">10.4230/LIPIcs.ESA.2021.2</a>
</li>
<li>
<span class="authors">Saman Ahmadi, Guido Tack, Daniel Harabor, and Philip Kilby</span>
<span class="title">Bi-Objective Search with Bi-Directional A*</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.3">10.4230/LIPIcs.ESA.2021.3</a>
</li>
<li>
<span class="authors">Maor Akav and Liam Roditty</span>
<span class="title">A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.4">10.4230/LIPIcs.ESA.2021.4</a>
</li>
<li>
<span class="authors">Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savić, Hendrik Schrezenmaier, Carlos Seara, and Martin Suderland</span>
<span class="title">The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.5">10.4230/LIPIcs.ESA.2021.5</a>
</li>
<li>
<span class="authors">Markus Anders and Pascal Schweitzer</span>
<span class="title">Parallel Computation of Combinatorial Symmetries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.6">10.4230/LIPIcs.ESA.2021.6</a>
</li>
<li>
<span class="authors">Sepehr Assadi, Deeparnab Chakrabarty, and Sanjeev Khanna</span>
<span class="title">Graph Connectivity and Single Element Recovery via Linear and OR Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.7">10.4230/LIPIcs.ESA.2021.7</a>
</li>
<li>
<span class="authors">Sepehr Assadi and Shay Solomon</span>
<span class="title">Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.8">10.4230/LIPIcs.ESA.2021.8</a>
</li>
<li>
<span class="authors">Nikhil Ayyadevara and Ashish Chiplunkar</span>
<span class="title">The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.9">10.4230/LIPIcs.ESA.2021.9</a>
</li>
<li>
<span class="authors">Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, and Jens Schlöter</span>
<span class="title">Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.10">10.4230/LIPIcs.ESA.2021.10</a>
</li>
<li>
<span class="authors">Jørgen Bang-Jensen, Kristine Vitting Klinkby, and Saket Saurabh</span>
<span class="title">k-Distinct Branchings Admits a Polynomial Kernel</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.11">10.4230/LIPIcs.ESA.2021.11</a>
</li>
<li>
<span class="authors">Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, and Clifford Stein</span>
<span class="title">Incremental Edge Orientation in Forests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.12">10.4230/LIPIcs.ESA.2021.12</a>
</li>
<li>
<span class="authors">Mark de Berg, Morteza Monemizadeh, and Yu Zhong</span>
<span class="title">k-Center Clustering with Outliers in the Sliding-Window Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.13">10.4230/LIPIcs.ESA.2021.13</a>
</li>
<li>
<span class="authors">Aaron Bernstein, Aditi Dudeja, and Seth Pettie</span>
<span class="title">Incremental SCC Maintenance in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.14">10.4230/LIPIcs.ESA.2021.14</a>
</li>
<li>
<span class="authors">Nico Bertram, Jonas Ellert, and Johannes Fischer</span>
<span class="title">Lyndon Words Accelerate Suffix Sorting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.15">10.4230/LIPIcs.ESA.2021.15</a>
</li>
<li>
<span class="authors">Sujoy Bhore and Csaba D. Tóth</span>
<span class="title">Online Euclidean Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.16">10.4230/LIPIcs.ESA.2021.16</a>
</li>
<li>
<span class="authors">Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, and Graeme Stroud</span>
<span class="title">Distant Representatives for Rectangles in the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.17">10.4230/LIPIcs.ESA.2021.17</a>
</li>
<li>
<span class="authors">Davide Bilò, Sarel Cohen, Tobias Friedrich, and Martin Schirneck</span>
<span class="title">Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.18">10.4230/LIPIcs.ESA.2021.18</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Simon D. Fink, and Ignaz Rutter</span>
<span class="title">Synchronized Planarity with Applications to Constrained Planarity Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.19">10.4230/LIPIcs.ESA.2021.19</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, and Maximilian Katzmann</span>
<span class="title">Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.20">10.4230/LIPIcs.ESA.2021.20</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, and Christopher Weyand</span>
<span class="title">Efficiently Computing Maximum Flows in Scale-Free Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.21">10.4230/LIPIcs.ESA.2021.21</a>
</li>
<li>
<span class="authors">Alexander Braun, Matthias Buttkus, and Thomas Kesselheim</span>
<span class="title">Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.22">10.4230/LIPIcs.ESA.2021.22</a>
</li>
<li>
<span class="authors">David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie</span>
<span class="title">Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.23">10.4230/LIPIcs.ESA.2021.23</a>
</li>
<li>
<span class="authors">Jean Cardinal, Justin Dallant, and John Iacono</span>
<span class="title">An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.24">10.4230/LIPIcs.ESA.2021.24</a>
</li>
<li>
<span class="authors">Jean Cardinal, John Iacono, and Grigorios Koumoutsos</span>
<span class="title">Worst-Case Efficient Dynamic Geometric Independent Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.25">10.4230/LIPIcs.ESA.2021.25</a>
</li>
<li>
<span class="authors">Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, and Ziena Zeif</span>
<span class="title">Balanced Crown Decomposition for Connectivity Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.26">10.4230/LIPIcs.ESA.2021.26</a>
</li>
<li>
<span class="authors">Timothy M. Chan</span>
<span class="title">All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.27">10.4230/LIPIcs.ESA.2021.27</a>
</li>
<li>
<span class="authors">Timothy M. Chan and Zhengcheng Huang</span>
<span class="title">Dynamic Colored Orthogonal Range Searching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.28">10.4230/LIPIcs.ESA.2021.28</a>
</li>
<li>
<span class="authors">Karthekeyan Chandrasekaran and Weihang Wang</span>
<span class="title">𝓁_p-Norm Multiway Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.29">10.4230/LIPIcs.ESA.2021.29</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, and Jakub Radoszewski</span>
<span class="title">Faster Algorithms for Longest Common Substring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.30">10.4230/LIPIcs.ESA.2021.30</a>
</li>
<li>
<span class="authors">Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, and Qian Yu</span>
<span class="title">Feature Cross Search via Submodular Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.31">10.4230/LIPIcs.ESA.2021.31</a>
</li>
<li>
<span class="authors">Éric Colin de Verdière and Thomas Magnard</span>
<span class="title">An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.32">10.4230/LIPIcs.ESA.2021.32</a>
</li>
<li>
<span class="authors">Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk, Moritz Venzin, and Robert Weismantel</span>
<span class="title">Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.33">10.4230/LIPIcs.ESA.2021.33</a>
</li>
<li>
<span class="authors">Radu Curticapean, Holger Dell, and Thore Husfeldt</span>
<span class="title">Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.34">10.4230/LIPIcs.ESA.2021.34</a>
</li>
<li>
<span class="authors">Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, and Grigory Reznikov</span>
<span class="title">Minimum Common String Partition: Exact Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.35">10.4230/LIPIcs.ESA.2021.35</a>
</li>
<li>
<span class="authors">Daniel Dadush, Zhuan Khye Koh, Bento Natura, and László A. Végh</span>
<span class="title">An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.36">10.4230/LIPIcs.ESA.2021.36</a>
</li>
<li>
<span class="authors">Michał Dębski, Marta Piecyk, and Paweł Rzążewski</span>
<span class="title">Faster 3-Coloring of Small-Diameter Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.37">10.4230/LIPIcs.ESA.2021.37</a>
</li>
<li>
<span class="authors">Hu Ding</span>
<span class="title">Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.38">10.4230/LIPIcs.ESA.2021.38</a>
</li>
<li>
<span class="authors">Pavel Dvořák, Michal Koucký, Karel Král, and Veronika Slívová</span>
<span class="title">Data Structures Lower Bounds and Popular Conjectures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.39">10.4230/LIPIcs.ESA.2021.39</a>
</li>
<li>
<span class="authors">Zdeněk Dvořák and Abhiruk Lahiri</span>
<span class="title">Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.40">10.4230/LIPIcs.ESA.2021.40</a>
</li>
<li>
<span class="authors">Yaron Fairstein, Ariel Kulik, and Hadas Shachnai</span>
<span class="title">Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.41">10.4230/LIPIcs.ESA.2021.41</a>
</li>
<li>
<span class="authors">Hendrik Fichtenberger, Monika Henzinger, and Lara Ost</span>
<span class="title">Differentially Private Algorithms for Graphs Under Continual Observation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.42">10.4230/LIPIcs.ESA.2021.42</a>
</li>
<li>
<span class="authors">Simon D. Fink, Matthias Pfretzschner, and Ignaz Rutter</span>
<span class="title">Experimental Comparison of PC-Trees and PQ-Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.43">10.4230/LIPIcs.ESA.2021.43</a>
</li>
<li>
<span class="authors">Alejandro Flores-Velazco and David M. Mount</span>
<span class="title">Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.44">10.4230/LIPIcs.ESA.2021.44</a>
</li>
<li>
<span class="authors">Moses Ganardi</span>
<span class="title">Compression by Contracting Straight-Line Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.45">10.4230/LIPIcs.ESA.2021.45</a>
</li>
<li>
<span class="authors">Younan Gao and Meng He</span>
<span class="title">Space Efficient Two-Dimensional Orthogonal Colored Range Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.46">10.4230/LIPIcs.ESA.2021.46</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Giuseppe F. Italiano, and Evangelos Kosinas</span>
<span class="title">Computing the 4-Edge-Connected Components of a Graph in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.47">10.4230/LIPIcs.ESA.2021.47</a>
</li>
<li>
<span class="authors">Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, and Daniel Seemaier</span>
<span class="title">Deep Multilevel Graph Partitioning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.48">10.4230/LIPIcs.ESA.2021.48</a>
</li>
<li>
<span class="authors">Fabrizio Grandoni, Tobias Mömke, and Andreas Wiese</span>
<span class="title">Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.49">10.4230/LIPIcs.ESA.2021.49</a>
</li>
<li>
<span class="authors">Yassine Hamoudi</span>
<span class="title">Quantum Sub-Gaussian Mean Estimator</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.50">10.4230/LIPIcs.ESA.2021.50</a>
</li>
<li>
<span class="authors">Sariel Har-Peled and Timothy Zhou</span>
<span class="title">Improved Approximation Algorithms for Tverberg Partitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.51">10.4230/LIPIcs.ESA.2021.51</a>
</li>
<li>
<span class="authors">Zhiyang He, Jason Li, and Magnus Wahlström</span>
<span class="title">Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.52">10.4230/LIPIcs.ESA.2021.52</a>
</li>
<li>
<span class="authors">Klaus Jansen and Malin Rau</span>
<span class="title">Closing the Gap for Single Resource Constraint Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.53">10.4230/LIPIcs.ESA.2021.53</a>
</li>
<li>
<span class="authors">Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, and Chee Yap</span>
<span class="title">Certified Approximation Algorithms for the Fermat Point and n-Ellipses</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.54">10.4230/LIPIcs.ESA.2021.54</a>
</li>
<li>
<span class="authors">Leon Kellerhals, Malte Renken, and Philipp Zschoche</span>
<span class="title">Parameterized Algorithms for Diverse Multistage Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.55">10.4230/LIPIcs.ESA.2021.55</a>
</li>
<li>
<span class="authors">Dominik Kempa and Ben Langmead</span>
<span class="title">Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.56">10.4230/LIPIcs.ESA.2021.56</a>
</li>
<li>
<span class="authors">Boris Klemz</span>
<span class="title">Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.57">10.4230/LIPIcs.ESA.2021.57</a>
</li>
<li>
<span class="authors">Benoît Larose, Petar Marković, Barnaby Martin, Daniël Paulusma, Siani Smith, and Stanislav Živný</span>
<span class="title">QCSP on Reflexive Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.58">10.4230/LIPIcs.ESA.2021.58</a>
</li>
<li>
<span class="authors">Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu</span>
<span class="title">Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.59">10.4230/LIPIcs.ESA.2021.59</a>
</li>
<li>
<span class="authors">David J. Lee, Samuel McCauley, Shikha Singh, and Max Stein</span>
<span class="title">Telescoping Filter: A Practical Adaptive Filter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.60">10.4230/LIPIcs.ESA.2021.60</a>
</li>
<li>
<span class="authors">Jasper C.H. Lee, Jerry Li, Christopher Musco, Jeff M. Phillips, and Wai Ming Tai</span>
<span class="title">Finding an Approximate Mode of a Kernel Density Estimate</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.61">10.4230/LIPIcs.ESA.2021.61</a>
</li>
<li>
<span class="authors">Marilena Leichter, Benjamin Moseley, and Kirk Pruhs</span>
<span class="title">An Efficient Reduction of a Gammoid to a Partition Matroid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.62">10.4230/LIPIcs.ESA.2021.62</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Subhash Suri, and Jie Xue</span>
<span class="title">Efficient Algorithms for Least Square Piecewise Polynomial Regression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.63">10.4230/LIPIcs.ESA.2021.63</a>
</li>
<li>
<span class="authors">Grigorios Loukides and Solon P. Pissis</span>
<span class="title">Bidirectional String Anchors: A New String Sampling Mechanism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.64">10.4230/LIPIcs.ESA.2021.64</a>
</li>
<li>
<span class="authors">Anna Lubiw and Anurag Murty Naredla</span>
<span class="title">The Visibility Center of a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.65">10.4230/LIPIcs.ESA.2021.65</a>
</li>
<li>
<span class="authors">Ryoga Mahara</span>
<span class="title">Extension of Additive Valuations to General Valuations on the Existence of EFX</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.66">10.4230/LIPIcs.ESA.2021.66</a>
</li>
<li>
<span class="authors">Tomás Martínez-Muñoz and Andreas Wiese</span>
<span class="title">FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.67">10.4230/LIPIcs.ESA.2021.67</a>
</li>
<li>
<span class="authors">Claire Mathieu and Hang Zhou</span>
<span class="title">A Simple Algorithm for Graph Reconstruction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.68">10.4230/LIPIcs.ESA.2021.68</a>
</li>
<li>
<span class="authors">William Maxwell and Amir Nayyeri</span>
<span class="title">Generalized Max-Flows and Min-Cuts in Simplicial Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.69">10.4230/LIPIcs.ESA.2021.69</a>
</li>
<li>
<span class="authors">J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, and Sebastian Wild</span>
<span class="title">Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.70">10.4230/LIPIcs.ESA.2021.70</a>
</li>
<li>
<span class="authors">Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, and Marek Sokołowski</span>
<span class="title">Determining 4-Edge-Connected Components in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.71">10.4230/LIPIcs.ESA.2021.71</a>
</li>
<li>
<span class="authors">Daniel Neuen</span>
<span class="title">Isomorphism Testing Parameterized by Genus and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.72">10.4230/LIPIcs.ESA.2021.72</a>
</li>
<li>
<span class="authors">Katarzyna Paluch and Mateusz Wasylkiewicz</span>
<span class="title">Restricted t-Matchings via Half-Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.73">10.4230/LIPIcs.ESA.2021.73</a>
</li>
<li>
<span class="authors">Ojas Parekh and Kevin Thompson</span>
<span class="title">Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.74">10.4230/LIPIcs.ESA.2021.74</a>
</li>
<li>
<span class="authors">Eden Pelleg and Stanislav Živný</span>
<span class="title">Additive Sparsification of CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.75">10.4230/LIPIcs.ESA.2021.75</a>
</li>
<li>
<span class="authors">Krzysztof Potępa</span>
<span class="title">Faster Deterministic Modular Subset Sum</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.76">10.4230/LIPIcs.ESA.2021.76</a>
</li>
<li>
<span class="authors">Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, and Wiktor Zuba</span>
<span class="title">Hardness of Detecting Abelian and Additive Square Factors in Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.77">10.4230/LIPIcs.ESA.2021.77</a>
</li>
<li>
<span class="authors">M. S. Ramanujan</span>
<span class="title">On Approximate Compressions for Connected Minor-Hitting Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.78">10.4230/LIPIcs.ESA.2021.78</a>
</li>
<li>
<span class="authors">Guillaume Sagnol and Daniel Schmidt genannt Waldschmidt</span>
<span class="title">Restricted Adaptivity in Stochastic Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.79">10.4230/LIPIcs.ESA.2021.79</a>
</li>
<li>
<span class="authors">Yishu Wang, Arnaud Mary, Marie-France Sagot, and Blerina Sinaimeri</span>
<span class="title">A General Framework for Enumerating Equivalence Classes of Solutions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.80">10.4230/LIPIcs.ESA.2021.80</a>
</li>
<li>
<span class="authors">Marvin Williams, Peter Sanders, and Roman Dementiev</span>
<span class="title">Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.81">10.4230/LIPIcs.ESA.2021.81</a>
</li>
<li>
<span class="authors">Florian Wörz and Jan-Hendrik Lorenz</span>
<span class="title">Evidence for Long-Tails in SLS Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ESA.2021.82">10.4230/LIPIcs.ESA.2021.82</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