Ausgabe 2/2019
Inhalt (19 Artikel)
An improved lower bound on the growth constant of polyiamonds
Gill Barequet, Mira Shalah, Yufei Zheng
Local search approximation algorithms for the k-means problem with penalties
Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu, Zhenning Zhang
Reconfiguration of maximum-weight b-matchings in a graph
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
Sankardeep Chakraborty, Srinivasa Rao Satti
Unfolding some classes of orthogonal polyhedra of arbitrary genus
Kuan-Yi Ho, Yi-Jun Chang, Hsu-Chun Yen
Efficient enumeration of non-equivalent squares in partial words with few holes
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
Deadlock resolution in wait-for graphs by vertex/arc deletion
Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
Elena Arseneva, Evanthia Papadopoulou
Pure Nash equilibria in restricted budget games
Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik
Agent incentives of a proportional sharing mechanism in resource sharing
Zhou Chen, Yukun Cheng, Qi Qi, Xiang Yan
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
Jianming Dong, Ruyan Jin, Jueliang Hu, Guohui Lin
On the weighted safe set problem on paths and cycles
Shinya Fujita, Tommy Jensen, Boram Park, Tadashi Sakuma
An improved algorithm for two stage time minimization assignment problem
Ekta Jain, Kalpana Dahiya, Anuj Sharma, Vanita Verma
Strategy-proof mechanisms for obnoxious facility game with bounded service range
Yukun Cheng, Qiaoming Han, Wei Yu, Guochuan Zhang