Ausgabe 4/2018
Inhalt (17 Artikel)
Cost-efficient scheduling on machines from the cloud
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers
On residual approximation in solution extension problems
Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
Safe sets in graphs: Graph classes and structural parameters
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
Constant factor approximation for the weighted partial degree bounded edge packing problem
Pawan Aurora, Monalisa Jena, Rajiv Raman
The mixed evacuation problem
Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
Finding disjoint paths on edge-colored graphs: more tractability results
Riccardo Dondi, Florian Sikora
Broadcasting multiple messages in the 1-in port model in optimal time
Petr Gregor, Riste Škrekovski, Vida Vukašinović
Scheduling with interjob communication on parallel processors
Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers
Embeddings into almost self-centered graphs of given radius
Kexiang Xu, Haiqiong Liu, Kinkar Ch. Das, Sandi Klavžar
List 2-distance -coloring of planar graphs without 4,5-cycles
Haiyang Zhu, Yu Gu, Jingjun Sheng, Xinzhong Lü
New bounds for locally irregular chromatic index of bipartite and subcubic graphs
Borut Lužar, Jakub Przybyło, Roman Soták