1. Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments

   • Gerardo Berbeglia
   • Gwenaël Joret

   OriginalPaper 13 August 2019 Pages: 681 - 720

2. Weak Coverage of a Rectangular Barrier

   • Stefan Dobrev
   • Evangelos Kranakis
   • Ladislav Stacho

   OriginalPaper 29 July 2019 Pages: 721 - 746

   

3. Local Algorithms for Sparse Spanning Graphs

   • Reut Levi
   • Dana Ron
   • Ronitt Rubinfeld

   OriginalPaper 03 August 2019 Pages: 747 - 786

   

4. Making Bidirected Graphs Strongly Connected

   • Tatsuya Matsuoka
   • Shun Sato

   OriginalPaper 31 July 2019 Pages: 787 - 807

   

5. A Unified Framework for Clustering Constrained Data Without Locality Property

   • Hu Ding
   • Jinhui Xu

   OriginalPaper 20 August 2019 Pages: 808 - 852

   

6. On the Relation of Strong Triadic Closure and Cluster Deletion

   • Niels Grüttemeier
   • Christian Komusiewicz

   OriginalPaper 16 August 2019 Pages: 853 - 880

   

7. Quadratic Vertex Kernel for Rainbow Matching

   • Sushmita Gupta
   • Sanjukta Roy
   • Meirav Zehavi

   OriginalPaper 19 August 2019 Pages: 881 - 897

   

8. On Bubble Generators in Directed Graphs

   • V. Acuña
   • R. Grossi
   • B. Sinaimeri

   OriginalPaper 31 August 2019 Pages: 898 - 914

   

9. A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon

   • Chih-Hung Liu

   OriginalPaper 05 September 2019 Pages: 915 - 937

   

10. Online Clique Clustering

    • Marek Chrobak
    • Christoph Dürr
    • Bengt J. Nilsson

    OriginalPaper Open access 23 September 2019 Pages: 938 - 965

    

11. Sorting Real Numbers in \(O\big (n\sqrt{\log n}\big )\) Time and Linear Space

    • Yijie Han

    OriginalPaper 05 September 2019 Pages: 966 - 978

    

12. Correction to: Sorting Real Numbers in \(O(n\sqrt{\log n})\) Time and Linear Space

    • Yijie Han

    Publisher Correction 03 December 2019 Pages: 979 - 979

13. Extended Learning Graphs for Triangle Finding

    • Titouan Carette
    • Mathieu Laurière
    • Frédéric Magniez

    OriginalPaper 23 September 2019 Pages: 980 - 1005

    

14. Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint

    • Chien-Chung Huang
    • Naonori Kakimura
    • Yuichi Yoshida

    OriginalPaper 16 September 2019 Pages: 1006 - 1032

    

15. Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster

    • Torben Hagerup

    OriginalPaper 23 September 2019 Pages: 1033 - 1056

    

16. Deterministic Dynamic Matching in O(1) Update Time

    • Sayan Bhattacharya
    • Deeparnab Chakrabarty
    • Monika Henzinger

    OriginalPaper Open access 28 September 2019 Pages: 1057 - 1080