1. Preface to the special issue on computing and combinatorics

   • Yixin Cao
   • Jianer Chen

   EditorialNotes 14 February 2019 Pages: 423 - 423

2. An improved lower bound on the growth constant of polyiamonds

   • Gill Barequet
   • Mira Shalah
   • Yufei Zheng

   OriginalPaper 16 August 2018 Pages: 424 - 438

   

3. Local search approximation algorithms for the k-means problem with penalties

   • Dongmei Zhang
   • Chunlin Hao
   • Zhenning Zhang

   OriginalPaper 19 March 2018 Pages: 439 - 453

   

4. Reconfiguration of maximum-weight b-matchings in a graph

   • Takehiro Ito
   • Naonori Kakimura
   • Yoshio Okamoto

   OriginalPaper 27 April 2018 Pages: 454 - 464

   

5. Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS

   • Sankardeep Chakraborty
   • Srinivasa Rao Satti

   OriginalPaper 01 March 2018 Pages: 465 - 481

   

6. Unfolding some classes of orthogonal polyhedra of arbitrary genus

   • Kuan-Yi Ho
   • Yi-Jun Chang
   • Hsu-Chun Yen

   OriginalPaper 10 May 2018 Pages: 482 - 500

   

7. Efficient enumeration of non-equivalent squares in partial words with few holes

   • Panagiotis Charalampopoulos
   • Maxime Crochemore
   • Tomasz Waleń

   OriginalPaper Open access 21 May 2018 Pages: 501 - 522

   

8. Dynamic rank-maximal and popular matchings

   • Prajakta Nimbhorkar
   • V. Arvind Rameshwar

   OriginalPaper 21 September 2018 Pages: 523 - 545

   

9. Deadlock resolution in wait-for graphs by vertex/arc deletion

   • Alan Diêgo Aurélio Carneiro
   • Fábio Protti
   • Uéverton S. Souza

   OriginalPaper 21 March 2018 Pages: 546 - 562

   

10. Better approximability results for min–max tree/cycle/path cover problems

    • Wei Yu
    • Zhaohui Liu

    OriginalPaper 01 March 2018 Pages: 563 - 578

    

11. Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended

    • Elena Arseneva
    • Evanthia Papadopoulou

    OriginalPaper 20 September 2018 Pages: 579 - 600

    

12. Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications

    • Wenkai Dai
    • Yongjie Yang

    OriginalPaper 11 June 2018 Pages: 601 - 619

13. Pure Nash equilibria in restricted budget games

    • Maximilian Drees
    • Matthias Feldotto
    • Alexander Skopalik

    OriginalPaper 17 March 2018 Pages: 620 - 638

    

14. Agent incentives of a proportional sharing mechanism in resource sharing

    • Zhou Chen
    • Yukun Cheng
    • Xiang Yan

    OriginalPaper 07 June 2018 Pages: 639 - 667

    

15. A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops

    • Jianming Dong
    • Ruyan Jin
    • Guohui Lin

    OriginalPaper 05 June 2018 Pages: 668 - 684

    

16. On the weighted safe set problem on paths and cycles

    • Shinya Fujita
    • Tommy Jensen
    • Tadashi Sakuma

    OriginalPaper 06 June 2018 Pages: 685 - 701

    

17. Independent bondage number of a graph

    • Bruce Priddy
    • Haiying Wang
    • Bing Wei

    OriginalPaper 20 June 2018 Pages: 702 - 712

    

18. An improved algorithm for two stage time minimization assignment problem

    • Ekta Jain
    • Kalpana Dahiya
    • Vanita Verma

    OriginalPaper 22 June 2018 Pages: 713 - 736

    

19. Strategy-proof mechanisms for obnoxious facility game with bounded service range

    • Yukun Cheng
    • Qiaoming Han
    • Guochuan Zhang

    OriginalPaper 04 September 2018 Pages: 737 - 755