nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A bound for judicious k -partitions of graphs
|
Fan, Genghua |
|
2014 |
179 |
C |
p. 86-99 14 p. |
artikel |
2 |
Adjoining to ( s , t ) -Wythoff’s game its P -positions as moves
|
Liu, Wen An |
|
2014 |
179 |
C |
p. 28-43 16 p. |
artikel |
3 |
An algorithmic toolbox for periodic partial words
|
Manea, Florin |
|
2014 |
179 |
C |
p. 174-192 19 p. |
artikel |
4 |
An improved lower bound on the independence number of a graph
|
Henning, Michael A. |
|
2014 |
179 |
C |
p. 120-128 9 p. |
artikel |
5 |
Computing the blocks of a quasi-median graph
|
Herrmann, Sven |
|
2014 |
179 |
C |
p. 129-138 10 p. |
artikel |
6 |
Contents
|
|
|
2014 |
179 |
C |
p. v-vi nvt p. |
artikel |
7 |
Degree diameter problem on honeycomb networks
|
Holub, Přemysl |
|
2014 |
179 |
C |
p. 139-151 13 p. |
artikel |
8 |
Indicated coloring of matroids
|
Lasoń, Michał |
|
2014 |
179 |
C |
p. 241-243 3 p. |
artikel |
9 |
Influence and interaction indexes for pseudo-Boolean functions: A unified least squares approach
|
Marichal, Jean-Luc |
|
2014 |
179 |
C |
p. 13-27 15 p. |
artikel |
10 |
Many-to-many matching with max–min preferences
|
Hatfield, John William |
|
2014 |
179 |
C |
p. 235-240 6 p. |
artikel |
11 |
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
|
Nguyen, Trung Thanh |
|
2014 |
179 |
C |
p. 54-68 15 p. |
artikel |
12 |
On the bend-number of planar and outerplanar graphs
|
Heldt, Daniel |
|
2014 |
179 |
C |
p. 109-119 11 p. |
artikel |
13 |
On the event distance of Poisson processes with applications to sensors
|
Kranakis, Evangelos |
|
2014 |
179 |
C |
p. 152-162 11 p. |
artikel |
14 |
On the maximum length of coil-in-the-box codes in dimension 8
|
Östergård, Patric R.J. |
|
2014 |
179 |
C |
p. 193-200 8 p. |
artikel |
15 |
Rainbow connection in oriented graphs
|
Dorbec, Paul |
|
2014 |
179 |
C |
p. 69-78 10 p. |
artikel |
16 |
Reciprocal degree distance of product graphs
|
Pattabiraman, K. |
|
2014 |
179 |
C |
p. 201-213 13 p. |
artikel |
17 |
Steiner diameter of 3, 4 and 5-connected maximal planar graphs
|
Ali, Patrick |
|
2014 |
179 |
C |
p. 222-228 7 p. |
artikel |
18 |
Strong edge-colouring of sparse planar graphs
|
Bensmail, Julien |
|
2014 |
179 |
C |
p. 229-234 6 p. |
artikel |
19 |
Surface embedding of ( n , k ) -extendable graphs
|
Lu, Hongliang |
|
2014 |
179 |
C |
p. 163-173 11 p. |
artikel |
20 |
The b -chromatic number and f -chromatic vertex number of regular graphs
|
El Sahili, Amine |
|
2014 |
179 |
C |
p. 79-85 7 p. |
artikel |
21 |
The Cyclic Towers of Antwerpen problem—A challenging Hanoi variant
|
Minsker, Steven |
|
2014 |
179 |
C |
p. 44-53 10 p. |
artikel |
22 |
The k -centrum Chinese Postman delivery problem and a related cost allocation game
|
Granot, Daniel |
|
2014 |
179 |
C |
p. 100-108 9 p. |
artikel |
23 |
Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs
|
Chiarelli, Nina |
|
2014 |
179 |
C |
p. 1-12 12 p. |
artikel |
24 |
Upper bounds on the balanced 〈 r , s 〉 -domination number of a graph
|
Roux, A. |
|
2014 |
179 |
C |
p. 214-221 8 p. |
artikel |