<h2>LIPIcs, Volume 176, APPROX/RANDOM 2020</h2>
<ul>
<li>
<span class="authors">Jarosław Byrka and Raghu Meka</span>
<span class="title">LIPIcs, Volume 176, APPROX/RANDOM 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020">10.4230/LIPIcs.APPROX/RANDOM.2020</a>
</li>
<li>
<span class="authors">Jarosław Byrka and Raghu Meka</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.0">10.4230/LIPIcs.APPROX/RANDOM.2020.0</a>
</li>
<li>
<span class="authors">Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, and Noah Stephens-Davidowitz</span>
<span class="title">Extractor Lower Bounds, Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.1">10.4230/LIPIcs.APPROX/RANDOM.2020.1</a>
</li>
<li>
<span class="authors">Kwangjun Ahn</span>
<span class="title">A Simpler Strong Refutation of Random k-XOR</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.2">10.4230/LIPIcs.APPROX/RANDOM.2020.2</a>
</li>
<li>
<span class="authors">Sarah Miracle, Amanda Pascoe Streib, and Noah Streib</span>
<span class="title">Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.3">10.4230/LIPIcs.APPROX/RANDOM.2020.3</a>
</li>
<li>
<span class="authors">Zeyu Guo and Rohit Gurjar</span>
<span class="title">Improved Explicit Hitting-Sets for ROABPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.4">10.4230/LIPIcs.APPROX/RANDOM.2020.4</a>
</li>
<li>
<span class="authors">Nader H. Bshouty</span>
<span class="title">Almost Optimal Testers for Concise Representations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.5">10.4230/LIPIcs.APPROX/RANDOM.2020.5</a>
</li>
<li>
<span class="authors">Noga Alon and Sepehr Assadi</span>
<span class="title">Palette Sparsification Beyond (Δ+1) Vertex Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.6">10.4230/LIPIcs.APPROX/RANDOM.2020.6</a>
</li>
<li>
<span class="authors">Dean Doron, Amnon Ta-Shma, and Roei Tell</span>
<span class="title">On Hitting-Set Generators for Polynomials That Vanish Rarely</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.7">10.4230/LIPIcs.APPROX/RANDOM.2020.7</a>
</li>
<li>
<span class="authors">Markus Bläser and Anurag Pandey</span>
<span class="title">Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.8">10.4230/LIPIcs.APPROX/RANDOM.2020.8</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, and Mary Wootters</span>
<span class="title">Bounds for List-Decoding and List-Recovery of Random Linear Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.9">10.4230/LIPIcs.APPROX/RANDOM.2020.9</a>
</li>
<li>
<span class="authors">Ronen Shaltiel</span>
<span class="title">Is It Possible to Improve Yao’s XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.10">10.4230/LIPIcs.APPROX/RANDOM.2020.10</a>
</li>
<li>
<span class="authors">Catherine Greenhill, Bernard Mans, and Ali Pourmiri</span>
<span class="title">Balanced Allocation on Dynamic Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.11">10.4230/LIPIcs.APPROX/RANDOM.2020.11</a>
</li>
<li>
<span class="authors">Jeff M. Phillips and Wai Ming Tai</span>
<span class="title">The GaussianSketch for Almost Relative Error Kernel Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.12">10.4230/LIPIcs.APPROX/RANDOM.2020.12</a>
</li>
<li>
<span class="authors">Eric Price and Jonathan Scarlett</span>
<span class="title">A Fast Binary Splitting Approach to Non-Adaptive Group Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.13">10.4230/LIPIcs.APPROX/RANDOM.2020.13</a>
</li>
<li>
<span class="authors">Jan Dreier, Philipp Kuinke, and Peter Rossmanith</span>
<span class="title">Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.14">10.4230/LIPIcs.APPROX/RANDOM.2020.14</a>
</li>
<li>
<span class="authors">Shuichi Hirahara and Osamu Watanabe</span>
<span class="title">On Nonadaptive Security Reductions of Hitting Set Generators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.15">10.4230/LIPIcs.APPROX/RANDOM.2020.15</a>
</li>
<li>
<span class="authors">Artur Czumaj, Hendrik Fichtenberger, Pan Peng, and Christian Sohler</span>
<span class="title">Testable Properties in General Graphs and Random Order Streaming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.16">10.4230/LIPIcs.APPROX/RANDOM.2020.16</a>
</li>
<li>
<span class="authors">Calvin Beideman, Karthekeyan Chandrasekaran, and Chao Xu</span>
<span class="title">Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.17">10.4230/LIPIcs.APPROX/RANDOM.2020.17</a>
</li>
<li>
<span class="authors">Eric Blais and Abhinav Bommireddi</span>
<span class="title">On Testing and Robust Characterizations of Convexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.18">10.4230/LIPIcs.APPROX/RANDOM.2020.18</a>
</li>
<li>
<span class="authors">Reut Levi and Moti Medina</span>
<span class="title">Distributed Testing of Graph Isomorphism in the CONGEST Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.19">10.4230/LIPIcs.APPROX/RANDOM.2020.19</a>
</li>
<li>
<span class="authors">Linh Tran and Van Vu</span>
<span class="title">Reaching a Consensus on Random Networks: The Power of Few</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.20">10.4230/LIPIcs.APPROX/RANDOM.2020.20</a>
</li>
<li>
<span class="authors">Sumegha Garg, Pravesh K. Kothari, and Ran Raz</span>
<span class="title">Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich’s PRG</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.21">10.4230/LIPIcs.APPROX/RANDOM.2020.21</a>
</li>
<li>
<span class="authors">Amit Chakrabarti, Prantar Ghosh, and Justin Thaler</span>
<span class="title">Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.22">10.4230/LIPIcs.APPROX/RANDOM.2020.22</a>
</li>
<li>
<span class="authors">Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar</span>
<span class="title">Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.23">10.4230/LIPIcs.APPROX/RANDOM.2020.23</a>
</li>
<li>
<span class="authors">Clément L. Canonne and Karl Wimmer</span>
<span class="title">Testing Data Binnings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.24">10.4230/LIPIcs.APPROX/RANDOM.2020.24</a>
</li>
<li>
<span class="authors">Tali Kaufman and Ella Sharakanski</span>
<span class="title">Chernoff Bound for High-Dimensional Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.25">10.4230/LIPIcs.APPROX/RANDOM.2020.25</a>
</li>
<li>
<span class="authors">Cyrus Rashtchian, David P. Woodruff, and Hanlin Zhu</span>
<span class="title">Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.26">10.4230/LIPIcs.APPROX/RANDOM.2020.26</a>
</li>
<li>
<span class="authors">Dana Ron and Asaf Rosin</span>
<span class="title">Almost Optimal Distribution-Free Sample-Based Testing of k-Modality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.27">10.4230/LIPIcs.APPROX/RANDOM.2020.27</a>
</li>
<li>
<span class="authors">Shalev Ben-David, Mika Göös, Robin Kothari, and Thomas Watson</span>
<span class="title">When Is Amplification Necessary for Composition in Randomized Query Complexity?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.28">10.4230/LIPIcs.APPROX/RANDOM.2020.28</a>
</li>
<li>
<span class="authors">Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, and Mrinal Kumar</span>
<span class="title">On Multilinear Forms: Bias, Correlation, and Tensor Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.29">10.4230/LIPIcs.APPROX/RANDOM.2020.29</a>
</li>
<li>
<span class="authors">Ben Lund and Aditya Potukuchi</span>
<span class="title">On the List Recoverability of Randomly Punctured Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.30">10.4230/LIPIcs.APPROX/RANDOM.2020.30</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay</span>
<span class="title">On Perturbation Resilience of Non-Uniform k-Center</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.31">10.4230/LIPIcs.APPROX/RANDOM.2020.31</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, and Kirill Simonov</span>
<span class="title">Low-Rank Binary Matrix Approximation in Column-Sum Norm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.32">10.4230/LIPIcs.APPROX/RANDOM.2020.32</a>
</li>
<li>
<span class="authors">Parinya Chalermsook, Julia Chuzhoy, and Thatchaphol Saranurak</span>
<span class="title">Pinning down the Strong Wilber 1 Bound for Binary Search Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.33">10.4230/LIPIcs.APPROX/RANDOM.2020.33</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Jakub Opršal, and Sai Sandeep</span>
<span class="title">Revisiting Alphabet Reduction in Dinur’s PCP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.34">10.4230/LIPIcs.APPROX/RANDOM.2020.34</a>
</li>
<li>
<span class="authors">Tatiana Starikovskaya, Michal Svagerka, and Przemysław Uznański</span>
<span class="title">L_p Pattern Matching in a Stream</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.35">10.4230/LIPIcs.APPROX/RANDOM.2020.35</a>
</li>
<li>
<span class="authors">Karine Chubarian and Anastasios Sidiropoulos</span>
<span class="title">Computing Bi-Lipschitz Outlier Embeddings into the Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.36">10.4230/LIPIcs.APPROX/RANDOM.2020.36</a>
</li>
<li>
<span class="authors">Nicole Megow and Lukas Nölke</span>
<span class="title">Online Minimum Cost Matching with Recourse on the Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.37">10.4230/LIPIcs.APPROX/RANDOM.2020.37</a>
</li>
<li>
<span class="authors">Amey Bhangale, Diptarka Chakraborty, and Rajendra Kumar</span>
<span class="title">Hardness of Approximation of (Multi-)LCS over Small Alphabet</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.38">10.4230/LIPIcs.APPROX/RANDOM.2020.38</a>
</li>
<li>
<span class="authors">Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, and Jiayi Xian</span>
<span class="title">On Approximating Degree-Bounded Network Design Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.39">10.4230/LIPIcs.APPROX/RANDOM.2020.39</a>
</li>
<li>
<span class="authors">Varun Gupta, Ravishankar Krishnaswamy, and Sai Sandeep</span>
<span class="title">Permutation Strikes Back: The Power of Recourse in Online Metric Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.40">10.4230/LIPIcs.APPROX/RANDOM.2020.40</a>
</li>
<li>
<span class="authors">Eden Chlamtáč and Petr Kolman</span>
<span class="title">How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.41">10.4230/LIPIcs.APPROX/RANDOM.2020.41</a>
</li>
<li>
<span class="authors">Xiangyu Guo, Janardhan Kulkarni, Shi Li, and Jiayi Xian</span>
<span class="title">On the Facility Location Problem in Online and Dynamic Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.42">10.4230/LIPIcs.APPROX/RANDOM.2020.42</a>
</li>
<li>
<span class="authors">Ishan Agarwal, Oded Regev, and Yi Tang</span>
<span class="title">Nearly Optimal Embeddings of Flat Tori</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.43">10.4230/LIPIcs.APPROX/RANDOM.2020.43</a>
</li>
<li>
<span class="authors">Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, and Malin Rau</span>
<span class="title">A Tight (3/2+ε) Approximation for Skewed Strip Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.44">10.4230/LIPIcs.APPROX/RANDOM.2020.44</a>
</li>
<li>
<span class="authors">Bohan Fan, Diego Ihara, Neshat Mohammadi, Francesco Sgherzi, Anastasios Sidiropoulos, and Mina Valizadeh</span>
<span class="title">Learning Lines with Ordinal Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.45">10.4230/LIPIcs.APPROX/RANDOM.2020.45</a>
</li>
<li>
<span class="authors">Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, and Przemysław Uznański</span>
<span class="title">Improved Circular k-Mismatch Sketches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.46">10.4230/LIPIcs.APPROX/RANDOM.2020.46</a>
</li>
<li>
<span class="authors">Arindam Khan and Madhusudhan Reddy Pittu</span>
<span class="title">On Guillotine Separability of Squares and Rectangles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.47">10.4230/LIPIcs.APPROX/RANDOM.2020.47</a>
</li>
<li>
<span class="authors">Lior Ben Yamin, Jing Li, Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai</span>
<span class="title">Maximizing Throughput in Flow Shop Real-Time Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.48">10.4230/LIPIcs.APPROX/RANDOM.2020.48</a>
</li>
<li>
<span class="authors">Dor Katzelnick and Roy Schwartz</span>
<span class="title">Maximizing the Correlation: Extending Grothendieck’s Inequality to Large Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.49">10.4230/LIPIcs.APPROX/RANDOM.2020.49</a>
</li>
<li>
<span class="authors">Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, and David P. Woodruff</span>
<span class="title">Streaming Complexity of SVMs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.50">10.4230/LIPIcs.APPROX/RANDOM.2020.50</a>
</li>
<li>
<span class="authors">Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, and Prafullkumar Tale</span>
<span class="title">On the Parameterized Approximability of Contraction to Classes of Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.51">10.4230/LIPIcs.APPROX/RANDOM.2020.51</a>
</li>
<li>
<span class="authors">Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, and Adam Polak</span>
<span class="title">Online Coloring of Short Intervals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.52">10.4230/LIPIcs.APPROX/RANDOM.2020.52</a>
</li>
<li>
<span class="authors">Roy Schwartz and Yotam Sharoni</span>
<span class="title">Approximating Requirement Cut via a Configuration LP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.53">10.4230/LIPIcs.APPROX/RANDOM.2020.53</a>
</li>
<li>
<span class="authors">Sébastien Bubeck and Yuval Rabani</span>
<span class="title">Parametrized Metrical Task Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.54">10.4230/LIPIcs.APPROX/RANDOM.2020.54</a>
</li>
<li>
<span class="authors">Syamantak Das, Lavina Jain, and Nikhil Kumar</span>
<span class="title">A Constant Factor Approximation for Capacitated Min-Max Tree Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.55">10.4230/LIPIcs.APPROX/RANDOM.2020.55</a>
</li>
<li>
<span class="authors">Nima Anari and Thuy-Duong Vuong</span>
<span class="title">An Extension of Plücker Relations with Applications to Subdeterminant Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.56">10.4230/LIPIcs.APPROX/RANDOM.2020.56</a>
</li>
<li>
<span class="authors">Buddhima Gamlath and Vadim Grinberg</span>
<span class="title">Approximating Star Cover Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.57">10.4230/LIPIcs.APPROX/RANDOM.2020.57</a>
</li>
<li>
<span class="authors">Neng Huang and Aaron Potechin</span>
<span class="title">On the Approximability of Presidential Type Predicates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.58">10.4230/LIPIcs.APPROX/RANDOM.2020.58</a>
</li>
<li>
<span class="authors">Sean Hallgren, Eunou Lee, and Ojas Parekh</span>
<span class="title">An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.59">10.4230/LIPIcs.APPROX/RANDOM.2020.59</a>
</li>
<li>
<span class="authors">Alexander Wei</span>
<span class="title">Better and Simpler Learning-Augmented Online Caching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.60">10.4230/LIPIcs.APPROX/RANDOM.2020.60</a>
</li>
<li>
<span class="authors">Sylvia Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, and Lu Wang</span>
<span class="title">A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.61">10.4230/LIPIcs.APPROX/RANDOM.2020.61</a>
</li>
<li>
<span class="authors">Chien-Chung Huang, Theophile Thiery, and Justin Ward</span>
<span class="title">Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.62">10.4230/LIPIcs.APPROX/RANDOM.2020.62</a>
</li>
<li>
<span class="authors">Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, and Yuhao Zhang</span>
<span class="title">Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.63">10.4230/LIPIcs.APPROX/RANDOM.2020.63</a>
</li>
<li>
<span class="authors">Ainesh Bakshi, Nadiia Chepurko, and David P. Woodruff</span>
<span class="title">Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.64">10.4230/LIPIcs.APPROX/RANDOM.2020.64</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