Special Issue on Theoretical Informatics (LATIN 2020)

In this topical collection (10 articles)

1. EditorialNotes

   Guest Editorial: Special Issue on Theoretical Informatics

   Yoshiharu Kohayakawa, Flávio K. Miyazawa Pages 2482-2484

   Download PDF (122KB) View Article

2. 

   OriginalPaper

   Computing Balanced Convex Partitions of Lines

   Sergey Bereg Pages 2515-2528

3. News

   Editor’s Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium

   Page 3521

   Download PDF (150KB) View Article

4. 

   OriginalPaper

   A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem

   Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado Pages 3522-3558

5. 

   OriginalPaper

   Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes

   Gill Barequet, Mira Shalah Pages 3559-3586

6. 

   OriginalPaper

   On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number

   Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov Pages 3587-3602

7. OriginalPaper

   Exponential-Time Quantum Algorithms for Graph Coloring Problems

   Kazuya Shimizu, Ryuhei Mori Pages 3603-3621

   Download PDF (353KB) View Article

8. 

   OriginalPaper

   Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations

   Khaled Elbassioni Pages 3622-3654

9. OriginalPaper

   Monotone Circuit Lower Bounds from Robust Sunflowers

   Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman Pages 3655-3685

   Download PDF (510KB) View Article

10. OriginalPaper

    Distinct Fringe Subtrees in Random Trees

    Louisa Seelbach Benkner, Stephan Wagner Pages 3686-3728

    Download PDF (619KB) View Article