| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A canonical Ramsey theorem with list constraints in random graphs
|
Alvarado, José D.
|
|
|
223 |
C |
p. 13-19
|
artikel
|
| 2 |
A de Bruijn and Erdös property in quasi-metric spaces with four points
|
Araujo-Pardo, G.
|
|
|
223 |
C |
p. 308-315
|
artikel
|
| 3 |
Adjacent vertex distinguishing total coloring of corona products (Brief Announcement)
|
Furmańczyk, Hanna
|
|
|
223 |
C |
p. 382-384
|
artikel
|
| 4 |
A general approximation for multistage subgraph problems
|
Chimani, Markus
|
|
|
223 |
C |
p. 334-342
|
artikel
|
| 5 |
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement)
|
Bertero, Federico
|
|
|
223 |
C |
p. 391-393
|
artikel
|
| 6 |
Biclique coloring game (Brief Announcement)
|
Huaynoca, Paola T.P.
|
|
|
223 |
C |
p. 373-375
|
artikel
|
| 7 |
Biclique transversal and biclique independen set
|
Groshaus, Marina
|
|
|
223 |
C |
p. 140-147
|
artikel
|
| 8 |
Canonical colourings in random graphs
|
Kamčev, Nina
|
|
|
223 |
C |
p. 5-12
|
artikel
|
| 9 |
Characterization of balanced graphs within claw-free graphs
|
Busolini, Lucía
|
|
|
223 |
C |
p. 258-266
|
artikel
|
| 10 |
Characterization of graphs with perfect closed neighbourhood matrices
|
Escalante, M.
|
|
|
223 |
C |
p. 62-69
|
artikel
|
| 11 |
Common edge independence number of a tree (Brief Announcement)
|
Dettlaff, Magda
|
|
|
223 |
C |
p. 385-387
|
artikel
|
| 12 |
Complexity and winning strategies of graph convexity games (Brief Announcement)
|
Araújo, Samuel N.
|
|
|
223 |
C |
p. 394-396
|
artikel
|
| 13 |
Computacional complexity of Hajós constructions of symmetric odd cycles
|
Cervantes-Ojeda, Jorge
|
|
|
223 |
C |
p. 112-120
|
artikel
|
| 14 |
Contents
|
|
|
|
223 |
C |
p. iii-vi
|
artikel
|
| 15 |
Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement)
|
Gahlawat, Harmender
|
|
|
223 |
C |
p. 379-381
|
artikel
|
| 16 |
Counting lines in semi-complete digraphs *
|
Araujo-Pardo, Gabriela
|
|
|
223 |
C |
p. 352-359
|
artikel
|
| 17 |
Crossing numbers of complete bipartite graphs
|
Balogh, József
|
|
|
223 |
C |
p. 78-87
|
artikel
|
| 18 |
Descriptive complexity of controllable graphs
|
Abiad, Aida
|
|
|
223 |
C |
p. 20-27
|
artikel
|
| 19 |
Edge and non-edge differentiated biclique graphs
|
Cruz, Edmilson P.
|
|
|
223 |
C |
p. 53-61
|
artikel
|
| 20 |
Fair subgraph selection for contagion containment (Brief Announcement)
|
Arkin, Esther M.
|
|
|
223 |
C |
p. 370-372
|
artikel
|
| 21 |
Five edge-independent spanning trees
|
Ali, Alonso
|
|
|
223 |
C |
p. 223-230
|
artikel
|
| 22 |
Freeze-Tag is NP-hard in 3D with L1 distance
|
Pedrosa, Lehilton Lelis Chaves
|
|
|
223 |
C |
p. 360-366
|
artikel
|
| 23 |
Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d vertices
|
Hyde, Joseph
|
|
|
223 |
C |
p. 217-222
|
artikel
|
| 24 |
Graphs with constant balancing number
|
Caro, Yair
|
|
|
223 |
C |
p. 325-333
|
artikel
|
| 25 |
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
|
Duvignau, Romaric
|
|
|
223 |
C |
p. 43-52
|
artikel
|
| 26 |
Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel
|
Simões, Matheus
|
|
|
223 |
C |
p. 35-42
|
artikel
|
| 27 |
Identifying codes in bipartite graphs of given maximum degree
|
Chakraborty, Dipayan
|
|
|
223 |
C |
p. 157-165
|
artikel
|
| 28 |
Kochol superposition of Goldberg with Semi-blowup snarks is Type 1
|
Palma, Miguel A.D.R.
|
|
|
223 |
C |
p. 250-257
|
artikel
|
| 29 |
Least corank for the nonexistence of uniformly most reliable graphs
|
Romero, Pablo
|
|
|
223 |
C |
p. 88-95
|
artikel
|
| 30 |
Lower bounds and exact values of the 2-color off-diagonal generalized weak Schur numbers WS(2;k1,k2) (Brief Announcement)
|
Ahmed, T.
|
|
|
223 |
C |
p. 403-405
|
artikel
|
| 31 |
Managing Time Expanded Networks through Project and Lift: the Lift Issue
|
González, José Luis Figueroa
|
|
|
223 |
C |
p. 241-249
|
artikel
|
| 32 |
Min-max coverage problems on tree-like metrics
|
Aaron, Eric
|
|
|
223 |
C |
p. 148-156
|
artikel
|
| 33 |
Mixed integer programming and quadratic programming formulations for the interval count problem
|
Medeiros, Lívia
|
|
|
223 |
C |
p. 283-291
|
artikel
|
| 34 |
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm
|
Cicerone, Serafino
|
|
|
223 |
C |
p. 104-111
|
artikel
|
| 35 |
Obstructions for χ-diperfectness
|
Silva, Caroline Aparecida de Paula
|
|
|
223 |
C |
p. 201-208
|
artikel
|
| 36 |
On general packing functions in graphs (Brief Announcement)
|
Hinrichsen, Erica
|
|
|
223 |
C |
p. 367-369
|
artikel
|
| 37 |
Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections
|
Li, Yaqiao
|
|
|
223 |
C |
p. 70-77
|
artikel
|
| 38 |
On nonrepetitive colorings of cycles
|
Botler, Fábio
|
|
|
223 |
C |
p. 302-307
|
artikel
|
| 39 |
On prescribing total orders for bipartite sets of distances in the Euclidean Plane
|
Maldonado, Gerardo L.
|
|
|
223 |
C |
p. 28-34
|
artikel
|
| 40 |
On the absolute and relative oriented clique problems’ time complexity
|
Coelho, E.M.M.
|
|
|
223 |
C |
p. 275-282
|
artikel
|
| 41 |
On the detection of local and global amoebas: theoretical insights and practical algorithms (Brief Announcement)
|
Laffitte, Marcos E. González
|
|
|
223 |
C |
p. 376-378
|
artikel
|
| 42 |
On the hull and interval numbers of oriented graphs (Brief Announcement)
|
Araújo, J.
|
|
|
223 |
C |
p. 397-399
|
artikel
|
| 43 |
P3-Carathéodory number on graphs with diameter two (Brief Announcement)
|
Coelho, Erika M.M.
|
|
|
223 |
C |
p. 388-390
|
artikel
|
| 44 |
Polarity on H-split graphs
|
Contreras-Mendoza, F. Esteban
|
|
|
223 |
C |
p. 184-192
|
artikel
|
| 45 |
Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement)
|
Pedrosa, Lehilton L.C.
|
|
|
223 |
C |
p. 400-402
|
artikel
|
| 46 |
Preface
|
,
|
|
|
223 |
C |
p. 1-4
|
artikel
|
| 47 |
Preprocessing complexity for some graph problems parameterized by structural parameters
|
Lafond, Manuel
|
|
|
223 |
C |
p. 130-139
|
artikel
|
| 48 |
Recovering cyclic tilings through β-skeletons
|
Gómez, Héctor Saib Maravillo
|
|
|
223 |
C |
p. 343-351
|
artikel
|
| 49 |
Reductions for the 3-Decomposition Conjecture
|
Bachtler, Oliver
|
|
|
223 |
C |
p. 96-103
|
artikel
|
| 50 |
Resilience for loose Hamilton cycles
|
Alvarado, José D.
|
|
|
223 |
C |
p. 193-200
|
artikel
|
| 51 |
Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem
|
Arndt, Stephen
|
|
|
223 |
C |
p. 121-129
|
artikel
|
| 52 |
Semi-proper orientations of dense graphs
|
Araujo, J.
|
|
|
223 |
C |
p. 231-240
|
artikel
|
| 53 |
Sidon sets and Sidon-partitions in cyclic groups through almost different sets
|
Delgado, Luis-Miguel
|
|
|
223 |
C |
p. 267-274
|
artikel
|
| 54 |
Simple certifying algorithms for variants of the (2, 1)-colouring problem
|
Contreras-Mendoza, Fernando Esteban
|
|
|
223 |
C |
p. 292-301
|
artikel
|
| 55 |
Spherical fullerene graphs that do not satisfy Andova and Škrekovski's conjecture
|
Silva, Thiago M.D.
|
|
|
223 |
C |
p. 316-324
|
artikel
|
| 56 |
The Conversion Set Problem on Graphs
|
Costa, Isac
|
|
|
223 |
C |
p. 175-183
|
artikel
|
| 57 |
The Problem of Discovery in Version Control Systems
|
Bulteau, Laurent
|
|
|
223 |
C |
p. 209-216
|
artikel
|
| 58 |
Unavoidable patterns in 2-colorings of the complete bipartite graph
|
Hansberg, Adriana
|
|
|
223 |
C |
p. 166-174
|
artikel
|
| 59 |
Voltage graphs as a technique to obtaining semi-cubic cages (Brief Announcement)
|
Aguilar, Flor
|
|
|
223 |
C |
p. 406-408
|
artikel
|
Tijdschrift beschrijving