| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A complexity theory for hard enumeration problems
|
Creignou, Nadia
|
|
2019
|
268 |
C |
p. 191-209
|
article
|
| 2 |
A fast discovery algorithm for large common connected induced subgraphs
|
Conte, Alessio
|
|
2019
|
268 |
C |
p. 210-222
|
article
|
| 3 |
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
|
Pai, Kung-Jui
|
|
2019
|
268 |
C |
p. 223-236
|
article
|
| 4 |
A rounding theorem for unique binary tomographic reconstruction
|
Dulio, Paolo
|
|
2019
|
268 |
C |
p. 54-69
|
article
|
| 5 |
Bounds for the energy of weighted graphs
|
Ganie, Hilal A.
|
|
2019
|
268 |
C |
p. 91-101
|
article
|
| 6 |
Characterizing 5-map graphs by 2-fan-crossing graphs
|
Brandenburg, Franz J.
|
|
2019
|
268 |
C |
p. 10-20
|
article
|
| 7 |
Decomposability of graphs into subgraphs fulfilling the 1–2–3 Conjecture
|
Bensmail, Julien
|
|
2019
|
268 |
C |
p. 1-9
|
article
|
| 8 |
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
|
Huang, Ziwen
|
|
2019
|
268 |
C |
p. 112-118
|
article
|
| 9 |
Editorial Board
|
|
|
2019
|
268 |
C |
p. ii
|
article
|
| 10 |
Exhaustive generation for permutations avoiding (colored) regular sets of patterns
|
Do, Phan Thuan
|
|
2019
|
268 |
C |
p. 44-53
|
article
|
| 11 |
Gallai–Ramsey numbers for books
|
Zou, Jinyu
|
|
2019
|
268 |
C |
p. 164-177
|
article
|
| 12 |
Incremental delay enumeration: Space and time
|
Capelli, Florent
|
|
2019
|
268 |
C |
p. 179-190
|
article
|
| 13 |
Maximum eccentric connectivity index for graphs with given diameter
|
Hauweele, Pierre
|
|
2019
|
268 |
C |
p. 102-111
|
article
|
| 14 |
No graph with nullity η ( G ) = | V ( G ) | − 2 m ( G ) + 2 c ( G ) − 1
|
Li, Xin
|
|
2019
|
268 |
C |
p. 130-136
|
article
|
| 15 |
On α -labellings of lobsters and trees with a perfect matching
|
Luiz, Atílio G.
|
|
2019
|
268 |
C |
p. 137-151
|
article
|
| 16 |
Rethinking structural balance in signed social networks
|
Estrada, Ernesto
|
|
2019
|
268 |
C |
p. 70-90
|
article
|
| 17 |
Some completion problems for graphs without chordless cycles of prescribed lengths
|
Busch, Arthur
|
|
2019
|
268 |
C |
p. 21-34
|
article
|
| 18 |
Sub-trees of a random tree
|
Kamiński, Bogumił
|
|
2019
|
268 |
C |
p. 119-129
|
article
|
| 19 |
The Steiner k -Wiener index of graphs with given minimum degree
|
Dankelmann, Peter
|
|
2019
|
268 |
C |
p. 35-43
|
article
|
| 20 |
Tightly coupled multi-group threshold secret sharing based on Chinese Remainder Theorem
|
Meng, Keju
|
|
2019
|
268 |
C |
p. 152-163
|
article
|
| 21 |
WEPA 2016 preface
|
Mary, Arnaud
|
|
2019
|
268 |
C |
p. 178
|
article
|
Journal description