1. Approximability of Clique Transversal in Perfect Graphs

   • Samuel Fiorini
   • R. Krithika
   • Venkatesh Raman

   OriginalPaper 08 May 2017 Pages: 2221 - 2239

   

2. Constructing Tree-Child Networks from Distance Matrices

   • Magnus Bordewich
   • Charles Semple
   • Nihan Tokac

   OriginalPaper 08 May 2017 Pages: 2240 - 2259

   

3. Planar Bus Graphs

   • Till Bruckdorfer
   • Stefan Felsner
   • Michael Kaufmann

   OriginalPaper 16 May 2017 Pages: 2260 - 2285

   

4. The Partial Visibility Representation Extension Problem

   • Steven Chaplick
   • Grzegorz Guśpiel
   • Giuseppe Liotta

   OriginalPaper Open access 24 May 2017 Pages: 2286 - 2323

   

5. Cliques in Hyperbolic Random Graphs

   • Thomas Bläsius
   • Tobias Friedrich
   • Anton Krohmer

   OriginalPaper 17 May 2017 Pages: 2324 - 2344

   

6. Ortho-polygon Visibility Representations of Embedded Graphs

   • Emilio Di Giacomo
   • Walter Didimo
   • Stephen K. Wismath

   OriginalPaper 22 May 2017 Pages: 2345 - 2383

   

7. Complexity Results for Generating Subgraphs

   • Vadim E. Levit
   • David Tankus

   OriginalPaper 02 June 2017 Pages: 2384 - 2399

   

8. Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms

   • Rinat Ben-Avraham
   • Matthias Henze
   • Igor Tubis

   OriginalPaper 06 June 2017 Pages: 2400 - 2421

   

9. Model-Based Segmentation and Classification of Trajectories

   • Sander P. A. Alewijnse
   • Kevin Buchin
   • Michel A. Westenberg

   OriginalPaper 02 June 2017 Pages: 2422 - 2452

   

10. Fast Compatibility Testing for Rooted Phylogenetic Trees

    • Yun Deng
    • David Fernández-Baca

    OriginalPaper 06 June 2017 Pages: 2453 - 2477

    

11. Shortest \((A+B)\)-Path Packing Via Hafnian

    • Hiroshi Hirai
    • Hiroyuki Namba

    OriginalPaper 14 June 2017 Pages: 2478 - 2491

12. Minimizing Latency of Capacitated k-Tours

    • Christopher S. Martin
    • Mohammad R. Salavatipour

    OriginalPaper 20 June 2017 Pages: 2492 - 2511