| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Best monotone degree conditions for binding number and cycle structure
|
Bauer, D.
|
|
2015
|
195 |
C |
p. 8-17
10 p.
|
article
|
| 2 |
Contents
|
|
|
2015
|
195 |
C |
p. v-
1 p.
|
article
|
| 3 |
Faster separation of 1-wheel inequalities by graph products
|
de Vries, Sven
|
|
2015
|
195 |
C |
p. 74-83
10 p.
|
article
|
| 4 |
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
|
Bhattacharya, Binay
|
|
2015
|
195 |
C |
p. 18-30
13 p.
|
article
|
| 5 |
On a class of graphs between threshold and total domishold graphs
|
Chiarelli, Nina
|
|
2015
|
195 |
C |
p. 43-58
16 p.
|
article
|
| 6 |
On the generality of the greedy algorithm for solving matroid base problems
|
Turner, Lara
|
|
2015
|
195 |
C |
p. 114-128
15 p.
|
article
|
| 7 |
On the nearest neighbor rule for the metric traveling salesman problem
|
Hougardy, Stefan
|
|
2015
|
195 |
C |
p. 101-103
3 p.
|
article
|
| 8 |
On the non-unit count of interval graphs
|
Apke, A.
|
|
2015
|
195 |
C |
p. 2-7
6 p.
|
article
|
| 9 |
On the termination of some biclique operators on multipartite graphs
|
Crespelle, Christophe
|
|
2015
|
195 |
C |
p. 59-73
15 p.
|
article
|
| 10 |
Performance guarantees for scheduling algorithms under perturbed machine speeds
|
Etscheid, Michael
|
|
2015
|
195 |
C |
p. 84-100
17 p.
|
article
|
| 11 |
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)
|
Hurink, Johann
|
|
2015
|
195 |
C |
p. 1-
1 p.
|
article
|
| 12 |
The Capacitated Orienteering Problem
|
Bock, Adrian
|
|
2015
|
195 |
C |
p. 31-42
12 p.
|
article
|
| 13 |
The double competition hypergraph of a digraph
|
Park, Jeongmi
|
|
2015
|
195 |
C |
p. 110-113
4 p.
|
article
|
| 14 |
Tree t -spanners in outerplanar graphs via supply demand partition
|
Narayanaswamy, N.S.
|
|
2015
|
195 |
C |
p. 104-109
6 p.
|
article
|
Journal description