| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A 3-approximation algorithm for the maximum leaf k-forest problem
|
Reis, M.F.
|
|
2017
|
62 |
C |
p. 201-206
|
artikel
|
| 2 |
A column generation approach for the strong network orientation problem
|
Martins, Alexandre Xavier
|
|
2017
|
62 |
C |
p. 75-80
|
artikel
|
| 3 |
Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs
|
Sambinelli, Maycon
|
|
2017
|
62 |
C |
p. 111-116
|
artikel
|
| 4 |
A linear-time algorithm for the identifying code problem on block graphs
|
Argiroffo, Gabriela R.
|
|
2017
|
62 |
C |
p. 249-254
|
artikel
|
| 5 |
An Approximation Algorithm for the p-Hub Median Problem
|
Bordini, Camile Frazão
|
|
2017
|
62 |
C |
p. 183-188
|
artikel
|
| 6 |
Approximating the cone of copositive kernels to estimate the stability number of infinite graphs
|
Kuryatnikova, Olga
|
|
2017
|
62 |
C |
p. 303-308
|
artikel
|
| 7 |
AVD-edge coloring on powers of paths
|
Omai, Mayara M.
|
|
2017
|
62 |
C |
p. 273-278
|
artikel
|
| 8 |
Biclique graph of bipartite permutation graphs
|
Groshaus, M.
|
|
2017
|
62 |
C |
p. 33-38
|
artikel
|
| 9 |
Bispindle in strongly connected digraphs with large chromatic number
|
Cohen, Nathann
|
|
2017
|
62 |
C |
p. 69-74
|
artikel
|
| 10 |
Bounds on Directed star arboricity in some digraph classes
|
du Cray, Henri Perret
|
|
2017
|
62 |
C |
p. 267-272
|
artikel
|
| 11 |
Clique cutsets beyond chordal graphs
|
Boncompagni, Valerio
|
|
2017
|
62 |
C |
p. 81-86
|
artikel
|
| 12 |
Computational determination of the largest lattice polytope diameter
|
Chadder, Nathan
|
|
2017
|
62 |
C |
p. 105-110
|
artikel
|
| 13 |
Correspondence Homomorphisms to Reflexive Graphs
|
Feder, Tomás
|
|
2017
|
62 |
C |
p. 9-14
|
artikel
|
| 14 |
Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs
|
Gitler, Isidoro
|
|
2017
|
62 |
C |
p. 129-134
|
artikel
|
| 15 |
Detecting an induced subdivision of K 4
|
Le, Ngoc Khang
|
|
2017
|
62 |
C |
p. 315-320
|
artikel
|
| 16 |
Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model
|
Dias, Bruno
|
|
2017
|
62 |
C |
p. 141-146
|
artikel
|
| 17 |
Facets of the polytope of legal sequences
|
Campêlo, Manoel
|
|
2017
|
62 |
C |
p. 15-20
|
artikel
|
| 18 |
Fleet management for autonomous vehicles using flows in time-expanded networks
|
Bsaybes, Sahar
|
|
2017
|
62 |
C |
p. 255-260
|
artikel
|
| 19 |
Gallai's conjecture for graphs with treewidth 3
|
Botler, Fábio
|
|
2017
|
62 |
C |
p. 147-152
|
artikel
|
| 20 |
Graphs admitting antimagic labeling for arbitrary sets of positive integers
|
Matamala, Martín
|
|
2017
|
62 |
C |
p. 159-164
|
artikel
|
| 21 |
Hyper-Hamiltonicity in graphs: some sufficient conditions
|
Del-Vecchio, Renata R.
|
|
2017
|
62 |
C |
p. 165-170
|
artikel
|
| 22 |
Inapproximability Ratios for Crossing Number
|
Pocai, Rafael Veiga
|
|
2017
|
62 |
C |
p. 117-122
|
artikel
|
| 23 |
Intersection Graphs of Orthodox Paths in Trees
|
Bornstein, Claudson Ferreira
|
|
2017
|
62 |
C |
p. 99-104
|
artikel
|
| 24 |
k-quasi-transitive digraphs of large diameter
|
Hernández-Cruz, César
|
|
2017
|
62 |
C |
p. 213-218
|
artikel
|
| 25 |
LAGOS 2017 – IX Latin and American Algorithms, Graphs, and Optimization Symposium
|
Bassino, Frédérique
|
|
2017
|
62 |
C |
p. 1-2
|
artikel
|
| 26 |
Locally self-avoiding Eulerian tours
|
Le, Tien-Nam
|
|
2017
|
62 |
C |
p. 27-32
|
artikel
|
| 27 |
Maximum Cuts in Edge-colored Graphs
|
Sucupira, Rubens
|
|
2017
|
62 |
C |
p. 87-92
|
artikel
|
| 28 |
Möbius Stanchion Systems
|
Isenmann, Lucas
|
|
2017
|
62 |
C |
p. 177-182
|
artikel
|
| 29 |
Minimum density of identifying codes of king grids
|
Dantas, Rennan
|
|
2017
|
62 |
C |
p. 51-56
|
artikel
|
| 30 |
Minimum Linear Arrangements
|
Andrade, Rafael
|
|
2017
|
62 |
C |
p. 63-68
|
artikel
|
| 31 |
On cliques and bicliques
|
Pizaña, M.A.
|
|
2017
|
62 |
C |
p. 189-194
|
artikel
|
| 32 |
On Efficient Domination for Some Classes of H-Free Chordal Graphs
|
Brandstädt, Andreas
|
|
2017
|
62 |
C |
p. 57-62
|
artikel
|
| 33 |
On Generalizations of the Parking Permit Problem and Network Leasing Problems
|
de Lima, M.S.
|
|
2017
|
62 |
C |
p. 225-230
|
artikel
|
| 34 |
On graphs with a single large Laplacian eigenvalue
|
Allem, L. Emilio
|
|
2017
|
62 |
C |
p. 297-302
|
artikel
|
| 35 |
On the (di)graphs with (directed) proper connection number two
|
Ducoffe, Guillaume
|
|
2017
|
62 |
C |
p. 237-242
|
artikel
|
| 36 |
On the Existence of Critical Clique-Helly Graphs
|
Alcón, Liliana
|
|
2017
|
62 |
C |
p. 231-236
|
artikel
|
| 37 |
On the local density problem for graphs of given odd-girth
|
Bedenknecht, Wiebke
|
|
2017
|
62 |
C |
p. 39-44
|
artikel
|
| 38 |
On the recognition of neighborhood inclusion posets
|
De Caria, Pablo
|
|
2017
|
62 |
C |
p. 285-290
|
artikel
|
| 39 |
On Type 2 Snarks and Dot Products
|
Cordeiro, L.
|
|
2017
|
62 |
C |
p. 207-212
|
artikel
|
| 40 |
Ramsey for complete graphs with a dropped edge or a triangle
|
Montejano, Luis Pedro
|
|
2017
|
62 |
C |
p. 21-25
|
artikel
|
| 41 |
Recovery of disrupted airline operations using k-Maximum Matching in graphs
|
Bensmail, Julien
|
|
2017
|
62 |
C |
p. 3-8
|
artikel
|
| 42 |
Reducing the Chromatic Number by Vertex or Edge Deletions
|
Picouleau, Christophe
|
|
2017
|
62 |
C |
p. 243-248
|
artikel
|
| 43 |
Ruling out FPT algorithms for Weighted Coloring on forests
|
Araújo, Júlio
|
|
2017
|
62 |
C |
p. 195-200
|
artikel
|
| 44 |
Scaffolding skeletons using spherical Voronoi diagrams
|
Fuentes Suárez, A.J.
|
|
2017
|
62 |
C |
p. 45-50
|
artikel
|
| 45 |
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand
|
Melo, Alexsander A.
|
|
2017
|
62 |
C |
p. 279-284
|
artikel
|
| 46 |
Strong intractability of generalized convex recoloring problems
|
Moura, Phablo F.S.
|
|
2017
|
62 |
C |
p. 93-98
|
artikel
|
| 47 |
Structure and Interpretation of Dual-Feasible Functions
|
Köppe, Matthias
|
|
2017
|
62 |
C |
p. 153-158
|
artikel
|
| 48 |
The Geodetic Hull Number is Hard for Chordal Graphs
|
Bessy, Stéphane
|
|
2017
|
62 |
C |
p. 291-296
|
artikel
|
| 49 |
The lexicographic product of some chordal graphs and of cographs preserves b-continuity
|
Linhares Sales, Cláudia
|
|
2017
|
62 |
C |
p. 261-266
|
artikel
|
| 50 |
The minimum chromatic violation problem: a polyhedral study
|
Braga, M.
|
|
2017
|
62 |
C |
p. 309-314
|
artikel
|
| 51 |
The Solitaire Clobber game and correducibility
|
Dantas, S.
|
|
2017
|
62 |
C |
p. 123-128
|
artikel
|
| 52 |
Transversals of Longest Paths
|
Cerioli, Márcia R.
|
|
2017
|
62 |
C |
p. 135-140
|
artikel
|
| 53 |
Tropical matchings in vertex-colored graphs
|
Cohen, J.
|
|
2017
|
62 |
C |
p. 219-224
|
artikel
|
| 54 |
Weighted upper domination number
|
Boyacı, Arman
|
|
2017
|
62 |
C |
p. 171-176
|
artikel
|
Tijdschrift beschrijving