| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-and-price algorithm for the Minimum Sum Coloring Problem
|
Delle Donne, Diego
|
|
|
303 |
C |
p. 39-56
|
artikel
|
| 2 |
A construction of uniquely colourable graphs with equal colour class sizes
|
Mohr, Samuel
|
|
|
303 |
C |
p. 122-126
|
artikel
|
| 3 |
A faster FPTAS for counting two-rowed contingency tables
|
Alon, Tzvi
|
|
|
303 |
C |
p. 161-170
|
artikel
|
| 4 |
A geometric lower bound on the extension complexity of polytopes based on the f -vector
|
Dewez, Julien
|
|
|
303 |
C |
p. 22-38
|
artikel
|
| 5 |
Algorithmic enumeration of surrounding polygons
|
Yamanaka, Katsuhisa
|
|
|
303 |
C |
p. 305-313
|
artikel
|
| 6 |
A linear time algorithm for the robust recoverable selection problem
|
Lachmann, Thomas
|
|
|
303 |
C |
p. 94-107
|
artikel
|
| 7 |
A method for enumerating pairwise compatibility graphs with a given number of vertices
|
Azam, Naveed Ahmed
|
|
|
303 |
C |
p. 171-185
|
artikel
|
| 8 |
A note on equitable Hamiltonian cycles
|
Ophelders, Tim
|
|
|
303 |
C |
p. 127-136
|
artikel
|
| 9 |
A smaller extended formulation for the odd cycle inequalities of the stable set polytope
|
de Vries, Sven
|
|
|
303 |
C |
p. 14-21
|
artikel
|
| 10 |
Coefficients of non-negative quasi-Cartan matrices, their symmetrizers and Gram matrices
|
Makuracki, Bartosz
|
|
|
303 |
C |
p. 108-121
|
artikel
|
| 11 |
Compact cactus representations of all non-trivial min-cuts
|
Lo, On-Hei S.
|
|
|
303 |
C |
p. 296-304
|
artikel
|
| 12 |
Cross–series–parallel digraphs
|
Dornemann, Jorin
|
|
|
303 |
C |
p. 57-65
|
artikel
|
| 13 |
Editorial Board
|
|
|
|
303 |
C |
p. ii
|
artikel
|
| 14 |
Efficient enumeration of dominating sets for sparse graphs
|
Kurita, Kazuhiro
|
|
|
303 |
C |
p. 283-295
|
artikel
|
| 15 |
Efficient enumeration of maximal induced bicliques
|
Hermelin, Danny
|
|
|
303 |
C |
p. 253-261
|
artikel
|
| 16 |
Efficiently enumerating minimal triangulations
|
Carmeli, Nofar
|
|
|
303 |
C |
p. 216-236
|
artikel
|
| 17 |
Enumerating connected induced subgraphs: Improved delay and experimental comparison
|
Komusiewicz, Christian
|
|
|
303 |
C |
p. 262-282
|
artikel
|
| 18 |
Enumerating models of DNF faster: Breaking the dependency on the formula size
|
Capelli, Florent
|
|
|
303 |
C |
p. 203-215
|
artikel
|
| 19 |
Fixed cardinality stable sets
|
Samer, Phillippe
|
|
|
303 |
C |
p. 137-148
|
artikel
|
| 20 |
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem
|
Andres, Stephan Dominique
|
|
|
303 |
C |
p. 4-7
|
artikel
|
| 21 |
Hardness of k -anonymous microaggregation
|
Thaeter, Florian
|
|
|
303 |
C |
p. 149-158
|
artikel
|
| 22 |
In Memoriam Walter Kern
|
Hochstättler, Winfried
|
|
|
303 |
C |
p. 2-3
|
artikel
|
| 23 |
Locally definable vertex set properties are efficiently enumerable
|
Blind, Sarah
|
|
|
303 |
C |
p. 186-202
|
artikel
|
| 24 |
Maximal strongly connected cliques in directed graphs: Algorithms and bounds
|
Conte, Alessio
|
|
|
303 |
C |
p. 237-252
|
artikel
|
| 25 |
On cut vertices and eigenvalues of character graphs of solvable groups
|
Hafezieh, Roghayeh
|
|
|
303 |
C |
p. 86-93
|
artikel
|
| 26 |
On null 3-hypergraphs
|
Frosini, Andrea
|
|
|
303 |
C |
p. 76-85
|
artikel
|
| 27 |
On the cut number problem for the 4, and 5-cubes
|
Emamy-K, M.R.
|
|
|
303 |
C |
p. 66-75
|
artikel
|
| 28 |
Preface: 17th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019)
|
Manthey, Bodo
|
|
|
303 |
C |
p. 1
|
artikel
|
| 29 |
Preface: WEPA 2018
|
Uno, Takeaki
|
|
|
303 |
C |
p. 160
|
artikel
|
| 30 |
Short proofs on the structure of general partition, equistable and triangle graphs
|
Cerioli, Márcia R.
|
|
|
303 |
C |
p. 8-13
|
artikel
|
Tijdschrift beschrijving