| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
|
Chang, Yulin
|
|
2019
|
38 |
1 |
p. 185-196
|
article
|
| 2 |
An improved approximation algorithm for the minimum 3-path partition problem
|
Chen, Yong
|
|
2019
|
38 |
1 |
p. 150-164
|
article
|
| 3 |
Connected power domination in graphs
|
Brimkov, Boris
|
|
2019
|
38 |
1 |
p. 292-315
|
article
|
| 4 |
Determining the interset distance
|
Barketau, Maksim
|
|
2019
|
38 |
1 |
p. 316-332
|
article
|
| 5 |
Efficient closed domination in digraph products
|
Peterin, Iztok
|
|
2019
|
38 |
1 |
p. 130-149
|
article
|
| 6 |
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
|
D’Emidio, Mattia
|
|
2019
|
38 |
1 |
p. 165-184
|
article
|
| 7 |
Hitting a path: a generalization of weighted connectivity via game theory
|
Szeszlér, Dávid
|
|
2018
|
38 |
1 |
p. 72-85
|
article
|
| 8 |
Maximizing profit of multiple adoptions in social networks with a martingale approach
|
Liu, Bin
|
|
2018
|
38 |
1 |
p. 1-20
|
article
|
| 9 |
Minmax scheduling problems with common due-date and completion time penalty
|
Mor, Baruch
|
|
2018
|
38 |
1 |
p. 50-71
|
article
|
| 10 |
Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update
|
Zhu, Jianming
|
|
2019
|
38 |
1 |
p. 208-223
|
article
|
| 11 |
Non-adaptive group testing on graphs with connectivity
|
Luo, Song
|
|
2019
|
38 |
1 |
p. 278-291
|
article
|
| 12 |
Online interval scheduling on two related machines: the power of lookahead
|
Pinson, Nicolas
|
|
2019
|
38 |
1 |
p. 224-253
|
article
|
| 13 |
On the randomized online strategies for the k-Canadian traveler problem
|
Shiri, Davood
|
|
2019
|
38 |
1 |
p. 254-267
|
article
|
| 14 |
Optimal channel assignment with list-edge coloring
|
Wang, Huijuan
|
|
2019
|
38 |
1 |
p. 197-207
|
article
|
| 15 |
Robust multiobjective portfolio optimization: a set order relations approach
|
Chen, Chen
|
|
2018
|
38 |
1 |
p. 21-49
|
article
|
| 16 |
Skew-rank of an oriented graph and independence number of its underlying graph
|
Li, Xueliang
|
|
2019
|
38 |
1 |
p. 268-277
|
article
|
| 17 |
The Best-or-Worst and the Postdoc problems with random number of candidates
|
Bayón, L.
|
|
2018
|
38 |
1 |
p. 86-110
|
article
|
| 18 |
Two-stage stochastic days-off scheduling of multi-skilled analysts with training options
|
Altner, Douglas S.
|
|
2018
|
38 |
1 |
p. 111-129
|
article
|
Journal description