Skip to main content

Journal of Combinatorial Optimization

Ausgabe 2/2020

Inhalt (12 Artikel)

Crossing minimization in perturbed drawings

Radoslav Fulek, Csaba D. Tóth

Approximation algorithms for the selling with preference

Pan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting, Yong Zhang

Searching and inferring colorful topological motifs in vertex-colored graphs

Diego P. Rubert, Eloi Araujo, Marco A. Stefanes, Jens Stoye, Fábio V. Martinez

More on limited packings in graphs

Xuqing Bai, Hong Chang, Xueliang Li

The band collocation problem

Hakan Kutucu, Arif Gursoy, Mehmet Kurt, Urfat Nuriyev

Power domination on triangular grids with triangular and hexagonal shape

Prosenjit Bose, Valentin Gledel, Claire Pennarun, Sander Verdonschot

On the Roman domination subdivision number of a graph

J. Amjadi, R. Khoeilar, M. Chellali, Z. Shao

On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering

Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi, Anastasios Sidiropoulos

Multiprocessor open shop problem: literature review and future directions

Zeynep Adak, Mahmure Övül Arıoğlu Akan, Serol Bulkan