no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A computational study of f -reversible processes on graphs
|
Lima, Carlos V.G.C. |
|
2018 |
245 |
C |
p. 77-93 |
article |
2 |
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number
|
Fellows, Michael |
|
2018 |
245 |
C |
p. 94-100 |
article |
3 |
A min – max relation in flowgraphs and some applications
|
Ferreira, Carlos Eduardo |
|
2018 |
245 |
C |
p. 65-76 |
article |
4 |
An algebraic algorithm for solving parametric integer programs
|
Fu, Norie |
|
2018 |
245 |
C |
p. 253-264 |
article |
5 |
A proof for a conjecture of Gorgol
|
Campos, V. |
|
2018 |
245 |
C |
p. 202-207 |
article |
6 |
Decomposing highly connected graphs into paths of length five
|
Botler, F. |
|
2018 |
245 |
C |
p. 128-138 |
article |
7 |
Editorial Board
|
|
|
2018 |
245 |
C |
p. ii |
article |
8 |
Eigenvalue location in cographs
|
Jacobs, David P. |
|
2018 |
245 |
C |
p. 220-235 |
article |
9 |
Fly-automata for checking MSO 2 graph properties
|
Courcelle, Bruno |
|
2018 |
245 |
C |
p. 236-252 |
article |
10 |
General cut-generating procedures for the stable set polytope
|
Corrêa, Ricardo C. |
|
2018 |
245 |
C |
p. 28-41 |
article |
11 |
k -tuple colorings of the Cartesian product of graphs
|
Bonomo, Flavia |
|
2018 |
245 |
C |
p. 177-182 |
article |
12 |
Limits of k -dimensional poset sequences
|
Corrêa, Ricardo Cordeiro |
|
2018 |
245 |
C |
p. 208-219 |
article |
13 |
Minimum size tree-decompositions
|
Li, Bi |
|
2018 |
245 |
C |
p. 109-127 |
article |
14 |
Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
|
Huang, Jing |
|
2018 |
245 |
C |
p. 190-193 |
article |
15 |
On compatibility and incompatibility of collections of unrooted phylogenetic trees
|
Fernández-Baca, David |
|
2018 |
245 |
C |
p. 42-58 |
article |
16 |
On the chromatic index of join graphs and triangle-free graphs with large maximum degree
|
Zorzi, A. |
|
2018 |
245 |
C |
p. 183-189 |
article |
17 |
On the contour of bipartite graphs
|
Artigas, D. |
|
2018 |
245 |
C |
p. 148-154 |
article |
18 |
Polyhedra associated with identifying codes in graphs
|
Argiroffo, Gabriela R. |
|
2018 |
245 |
C |
p. 16-27 |
article |
19 |
Preface: LAGOS’15 — Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil — 2015
|
Campêlo, Manoel |
|
2018 |
245 |
C |
p. 1-3 |
article |
20 |
Recent results on containment graphs of paths in a tree
|
Alcón, Liliana |
|
2018 |
245 |
C |
p. 139-147 |
article |
21 |
Recognition and characterization of unit interval graphs with integer endpoints
|
Durán, G. |
|
2018 |
245 |
C |
p. 168-176 |
article |
22 |
Relationship between superstring and compression measures: New insights on the greedy conjecture
|
Cazaux, Bastien |
|
2018 |
245 |
C |
p. 59-64 |
article |
23 |
Steinberg-like theorems for backbone colouring
|
Araujo, J. |
|
2018 |
245 |
C |
p. 155-167 |
article |
24 |
The caterpillar-packing polytope
|
Marenco, Javier |
|
2018 |
245 |
C |
p. 4-15 |
article |
25 |
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
|
de Macedo Filho, H.B. |
|
2018 |
245 |
C |
p. 101-108 |
article |
26 |
Weighted antimagic labeling
|
Matamala, Martín |
|
2018 |
245 |
C |
p. 194-201 |
article |