| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Affine inequivalence of cubic Maiorana–McFarland type bent functions
|
Gangopadhyay, Sugata
|
|
2013
|
161 |
7-8 |
p. 1141-1146
6 p.
|
article
|
| 2 |
A linear-time algorithm for finding an edge-partition with max-min ratio at most two
|
Chu, An-Chiang
|
|
2013
|
161 |
7-8 |
p. 932-943
12 p.
|
article
|
| 3 |
An extension of A.R. Rao’s characterization of potentially K m + 1 -graphic sequences
|
Yin, Jian-Hua
|
|
2013
|
161 |
7-8 |
p. 1118-1127
10 p.
|
article
|
| 4 |
A note on approximating the b -chromatic number
|
Galčík, František
|
|
2013
|
161 |
7-8 |
p. 1137-1140
4 p.
|
article
|
| 5 |
b-coloring of tight bipartite graphs and the Erdős–Faber–Lovász conjecture
|
Lin, Wu-Hsiung
|
|
2013
|
161 |
7-8 |
p. 1060-1066
7 p.
|
article
|
| 6 |
Commute times of random walks on trees
|
Konsowa, Mokhtar
|
|
2013
|
161 |
7-8 |
p. 1014-1021
8 p.
|
article
|
| 7 |
Corner cuts are close to optimal: From solid grids to polygons and back
|
Feldmann, Andreas Emil
|
|
2013
|
161 |
7-8 |
p. 970-998
29 p.
|
article
|
| 8 |
Editorial Board
|
|
|
2013
|
161 |
7-8 |
p. v-vi
nvt p.
|
article
|
| 9 |
Finding lower bounds on the complexity of secret sharing schemes by linear programming
|
Padró, Carles
|
|
2013
|
161 |
7-8 |
p. 1072-1084
13 p.
|
article
|
| 10 |
Finding the edge ranking number through vertex partitions
|
Lin, Yo-Lin
|
|
2013
|
161 |
7-8 |
p. 1067-1071
5 p.
|
article
|
| 11 |
From kernels in directed graphs to fixed points and negative cycles in Boolean networks
|
Richard, Adrien
|
|
2013
|
161 |
7-8 |
p. 1106-1117
12 p.
|
article
|
| 12 |
Further results on hierarchical product of graphs
|
Tavakoli, M.
|
|
2013
|
161 |
7-8 |
p. 1162-1167
6 p.
|
article
|
| 13 |
Integral mixed unit interval graphs
|
Le, Van Bang
|
|
2013
|
161 |
7-8 |
p. 1028-1036
9 p.
|
article
|
| 14 |
LAD models, trees, and an analog of the fundamental theorem of arithmetic
|
Brauner, Nadia
|
|
2013
|
161 |
7-8 |
p. 909-920
12 p.
|
article
|
| 15 |
Liar’s domination in graphs: Complexity and algorithm
|
Panda, B.S.
|
|
2013
|
161 |
7-8 |
p. 1085-1092
8 p.
|
article
|
| 16 |
Normal Helly circular-arc graphs and its subclasses
|
Lin, Min Chih
|
|
2013
|
161 |
7-8 |
p. 1037-1059
23 p.
|
article
|
| 17 |
On the complexity of computing the temporal hybridization number for two phylogenies
|
Humphries, Peter J.
|
|
2013
|
161 |
7-8 |
p. 871-880
10 p.
|
article
|
| 18 |
On the complexity of recognizing S-composite and S-prime graphs
|
Hellmuth, Marc
|
|
2013
|
161 |
7-8 |
p. 1006-1013
8 p.
|
article
|
| 19 |
On the L ( 2 , 1 ) -labelings of amalgamations of graphs
|
Adams, Sarah Spence
|
|
2013
|
161 |
7-8 |
p. 881-888
8 p.
|
article
|
| 20 |
On the strong metric dimension of corona product graphs and join graphs
|
Kuziak, Dorota
|
|
2013
|
161 |
7-8 |
p. 1022-1027
6 p.
|
article
|
| 21 |
On the t -pebbling number and the 2 t -pebbling property of graphs
|
Gao, Ze-Tu
|
|
2013
|
161 |
7-8 |
p. 999-1005
7 p.
|
article
|
| 22 |
(2)-pancyclic graphs
|
Zamfirescu, Carol T.
|
|
2013
|
161 |
7-8 |
p. 1128-1136
9 p.
|
article
|
| 23 |
Planar graphs without 4- and 5-cycles are acyclically 4-choosable
|
Chen, Min
|
|
2013
|
161 |
7-8 |
p. 921-931
11 p.
|
article
|
| 24 |
Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
|
Divnić, Tomica R.
|
|
2013
|
161 |
7-8 |
p. 953-960
8 p.
|
article
|
| 25 |
Quasi-hamiltonian paths in semicomplete multipartite digraphs
|
Bang-Jensen, Jørgen
|
|
2013
|
161 |
7-8 |
p. 889-898
10 p.
|
article
|
| 26 |
Right angle crossing graphs and 1-planarity
|
Eades, Peter
|
|
2013
|
161 |
7-8 |
p. 961-969
9 p.
|
article
|
| 27 |
Strongly rigid tensegrity graphs on the line
|
Jackson, Bill
|
|
2013
|
161 |
7-8 |
p. 1147-1149
3 p.
|
article
|
| 28 |
Strong matching preclusion under the conditional fault model
|
Park, Jung-Heum
|
|
2013
|
161 |
7-8 |
p. 1093-1105
13 p.
|
article
|
| 29 |
The firefighter problem with more than one firefighter on trees
|
Bazgan, Cristina
|
|
2013
|
161 |
7-8 |
p. 899-908
10 p.
|
article
|
| 30 |
Towards optimal kernel for connected vertex cover in planar graphs
|
Kowalik, Łukasz
|
|
2013
|
161 |
7-8 |
p. 1154-1161
8 p.
|
article
|
| 31 |
Wiener index versus Szeged index in networks
|
Klavžar, Sandi
|
|
2013
|
161 |
7-8 |
p. 1150-1153
4 p.
|
article
|
| 32 |
Worst-case efficient dominating sets in digraphs
|
Dejter, Italo J.
|
|
2013
|
161 |
7-8 |
p. 944-952
9 p.
|
article
|
Journal description