Preface to the special issue on computing and combinatorics Yixin CaoJianer Chen EditorialNotes 14 February 2019 Pages: 423 - 423
An improved lower bound on the growth constant of polyiamonds Gill BarequetMira ShalahYufei Zheng OriginalPaper 16 August 2018 Pages: 424 - 438
Local search approximation algorithms for the k-means problem with penalties Dongmei ZhangChunlin HaoZhenning Zhang OriginalPaper 19 March 2018 Pages: 439 - 453
Reconfiguration of maximum-weight b-matchings in a graph Takehiro ItoNaonori KakimuraYoshio Okamoto OriginalPaper 27 April 2018 Pages: 454 - 464
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS Sankardeep ChakrabortySrinivasa Rao Satti OriginalPaper 01 March 2018 Pages: 465 - 481
Unfolding some classes of orthogonal polyhedra of arbitrary genus Kuan-Yi HoYi-Jun ChangHsu-Chun Yen OriginalPaper 10 May 2018 Pages: 482 - 500
Efficient enumeration of non-equivalent squares in partial words with few holes Panagiotis CharalampopoulosMaxime CrochemoreTomasz Waleń OriginalPaper Open access 21 May 2018 Pages: 501 - 522
Dynamic rank-maximal and popular matchings Prajakta NimbhorkarV. Arvind Rameshwar OriginalPaper 21 September 2018 Pages: 523 - 545
Deadlock resolution in wait-for graphs by vertex/arc deletion Alan Diêgo Aurélio CarneiroFábio ProttiUéverton S. Souza OriginalPaper 21 March 2018 Pages: 546 - 562
Better approximability results for min–max tree/cycle/path cover problems Wei YuZhaohui Liu OriginalPaper 01 March 2018 Pages: 563 - 578
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended Elena ArsenevaEvanthia Papadopoulou OriginalPaper 20 September 2018 Pages: 579 - 600
Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications Wenkai DaiYongjie Yang OriginalPaper 11 June 2018 Pages: 601 - 619
Pure Nash equilibria in restricted budget games Maximilian DreesMatthias FeldottoAlexander Skopalik OriginalPaper 17 March 2018 Pages: 620 - 638
Agent incentives of a proportional sharing mechanism in resource sharing Zhou ChenYukun ChengXiang Yan OriginalPaper 07 June 2018 Pages: 639 - 667
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops Jianming DongRuyan JinGuohui Lin OriginalPaper 05 June 2018 Pages: 668 - 684
On the weighted safe set problem on paths and cycles Shinya FujitaTommy JensenTadashi Sakuma OriginalPaper 06 June 2018 Pages: 685 - 701
Independent bondage number of a graph Bruce PriddyHaiying WangBing Wei OriginalPaper 20 June 2018 Pages: 702 - 712
An improved algorithm for two stage time minimization assignment problem Ekta JainKalpana DahiyaVanita Verma OriginalPaper 22 June 2018 Pages: 713 - 736
Strategy-proof mechanisms for obnoxious facility game with bounded service range Yukun ChengQiaoming HanGuochuan Zhang OriginalPaper 04 September 2018 Pages: 737 - 755