| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An O ∗ ( 2 . 61 9 k ) algorithm for 4-Path Vertex Cover
|
Tsur, Dekel
|
|
|
291 |
C |
p. 1-14
|
artikel
|
| 2 |
Antimagic orientations of graphs with given independence number
|
Song, Zi-Xia
|
|
|
291 |
C |
p. 163-170
|
artikel
|
| 3 |
Base graph–connection graph: Dissection and construction
|
Potočnik, Primož
|
|
|
291 |
C |
p. 116-128
|
artikel
|
| 4 |
Chvátal–Gomory cuts for the Steiner tree problem
|
Gaul, Daniela
|
|
|
291 |
C |
p. 188-200
|
artikel
|
| 5 |
Complete subgraphs in connected graphs and its application to spectral moment
|
Fang, Longfei
|
|
|
291 |
C |
p. 36-42
|
artikel
|
| 6 |
Editorial Board
|
|
|
|
291 |
C |
p. ii
|
artikel
|
| 7 |
Eternal dominating sets on digraphs and orientations of graphs
|
Bagan, Guillaume
|
|
|
291 |
C |
p. 99-115
|
artikel
|
| 8 |
Facial unique-maximum edge and total coloring of plane graphs
|
Fabrici, Igor
|
|
|
291 |
C |
p. 171-179
|
artikel
|
| 9 |
Fair multi-cake cutting
|
Segal-Halevi, Erel
|
|
|
291 |
C |
p. 15-35
|
artikel
|
| 10 |
Injective coloring of some subclasses of bipartite graphs and chordal graphs
|
Panda, B.S.
|
|
|
291 |
C |
p. 68-87
|
artikel
|
| 11 |
L ( p , q ) -labelings of subdivisions of graphs
|
Chang, Fei-Huang
|
|
|
291 |
C |
p. 264-270
|
artikel
|
| 12 |
Metric dimension and metric independence number of incidence graphs of symmetric designs
|
Tang, Lang
|
|
|
291 |
C |
p. 43-50
|
artikel
|
| 13 |
Mixing time of the switch Markov chain and stable degree sequences
|
Gao, Pu
|
|
|
291 |
C |
p. 143-162
|
artikel
|
| 14 |
Monopolar graphs: Complexity of computing classical graph parameters
|
Barbato, Michele
|
|
|
291 |
C |
p. 277-285
|
artikel
|
| 15 |
On broadcasting time in the model of travelling agents
|
Huq, Reaz
|
|
|
291 |
C |
p. 246-263
|
artikel
|
| 16 |
On the anti-Ramsey number of forests
|
Fang, Chunqiu
|
|
|
291 |
C |
p. 129-142
|
artikel
|
| 17 |
On the balanceability of some graph classes
|
Dailly, Antoine
|
|
|
291 |
C |
p. 51-63
|
artikel
|
| 18 |
On the Colijn–Plazzotta numbering scheme for unlabeled binary rooted trees
|
Rosenberg, Noah A.
|
|
|
291 |
C |
p. 88-98
|
artikel
|
| 19 |
On the convexity of independent set games
|
Xiao, Han
|
|
|
291 |
C |
p. 271-276
|
artikel
|
| 20 |
Parameterized and exact algorithms for class domination coloring
|
Krithika, R.
|
|
|
291 |
C |
p. 286-299
|
artikel
|
| 21 |
Strongly separable matrices for nonadaptive combinatorial group testing
|
Fan, Jinping
|
|
|
291 |
C |
p. 180-187
|
artikel
|
| 22 |
The minor minimal intrinsically chiral graphs
|
Choi, Howon
|
|
|
291 |
C |
p. 237-245
|
artikel
|
| 23 |
The terminal-pairability problem in complete bipartite graphs
|
Lv, Zequn
|
|
|
291 |
C |
p. 64-67
|
artikel
|
| 24 |
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
|
Ducoffe, Guillaume
|
|
|
291 |
C |
p. 201-222
|
artikel
|
| 25 |
Unit form recognition by mutations: Application of mutations in the search of positive roots
|
Alves, Jesmmer
|
|
|
291 |
C |
p. 223-236
|
artikel
|
Tijdschrift beschrijving