| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A (1/2+1/60)—Approximation algorithm for Maximum Weight Series-Parallel Subgraph
|
Călinescu, Gruia
|
|
|
354 |
C |
p. 241-261
|
article
|
| 2 |
A
(
B
+
1
)
-approximation for network flow interdiction with unit costs
|
Boeckmann, Jan
|
|
|
354 |
C |
p. 58-71
|
article
|
| 3 |
Algorithms for maximum social welfare of online random trading
|
Chen, Xujin
|
|
|
354 |
C |
p. 229-240
|
article
|
| 4 |
An impossible combinatorial counting method in distance geometry
|
Abud, Germano
|
|
|
354 |
C |
p. 83-93
|
article
|
| 5 |
Assessing the effect of multiple cost changes using reverse set tolerances
|
Jäger, Gerold
|
|
|
354 |
C |
p. 279-300
|
article
|
| 6 |
Convergence and correctness of belief propagation for weighted min–max flow
|
Dai, Guowei
|
|
|
354 |
C |
p. 122-130
|
article
|
| 7 |
Decomposing the feasibility of Clustered Spanning Tree by Paths
|
Guttmann-Beck, Nili
|
|
|
354 |
C |
p. 160-180
|
article
|
| 8 |
Editorial Board
|
|
|
|
354 |
C |
p. ii
|
article
|
| 9 |
Embedding
K
3
,
3
and
K
5
on the double torus
|
Gagarin, Andrei
|
|
|
354 |
C |
p. 29-47
|
article
|
| 10 |
Expected polynomial-time randomized algorithm for graph coloring problem
|
Ghosal, Subhankar
|
|
|
354 |
C |
p. 108-121
|
article
|
| 11 |
Gap one bounds for the equitable chromatic number of block graphs
|
Dybizbański, Janusz
|
|
|
354 |
C |
p. 15-28
|
article
|
| 12 |
Novel bilevel formulations for waste management
|
Caramia, Massimiliano
|
|
|
354 |
C |
p. 181-198
|
article
|
| 13 |
On monophonic position sets in graphs
|
Thomas, Elias John
|
|
|
354 |
C |
p. 72-82
|
article
|
| 14 |
On oriented diameter of
(
n
,
k
)
-star graphs
|
Ajish Kumar, K.S.
|
|
|
354 |
C |
p. 214-228
|
article
|
| 15 |
On the size of minimal separators for treedepth decomposition
|
Xu, Zijian
|
|
|
354 |
C |
p. 262-270
|
article
|
| 16 |
Preface: 18th Cologne–Twente Workshop on graphs and combinatorial optimization (CTW 2020)
|
Gentile, Claudio
|
|
|
354 |
C |
p. 1-2
|
article
|
| 17 |
Proving the infeasibility of Horn formulas through read-once resolution
|
Wojciechowski, Piotr
|
|
|
354 |
C |
p. 131-145
|
article
|
| 18 |
Reformulations and complexity of the clique interdiction problem by graph mapping
|
Mattia, Sara
|
|
|
354 |
C |
p. 48-57
|
article
|
| 19 |
Remarks on restricted fractional
(
g
,
f
)
-factors in graphs
|
Zhou, Sizhong
|
|
|
354 |
C |
p. 271-278
|
article
|
| 20 |
Roman {3}-domination in graphs: Complexity and algorithms
|
Chaudhary, Juhi
|
|
|
354 |
C |
p. 301-325
|
article
|
| 21 |
Slack matrices,
k
-products, and 2-level polytopes
|
Aprile, Manuel
|
|
|
354 |
C |
p. 199-213
|
article
|
| 22 |
The multicolored graph realization problem
|
Díaz, Josep
|
|
|
354 |
C |
p. 146-159
|
article
|
| 23 |
The no-meet matroid
|
Ben-Ameur, Walid
|
|
|
354 |
C |
p. 94-107
|
article
|
| 24 |
Travelling salesman paths on Demidenko matrices
|
Çela, Eranda
|
|
|
354 |
C |
p. 3-14
|
article
|
Journal description