| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Algorithms for Radon partitions with tolerance
|
Bereg, Sergey
|
|
|
319 |
C |
p. 207-215
|
article
|
| 2 |
A linear time algorithm for the nullity of vertex-weighted block graphs
|
Singh, Ranveer
|
|
|
319 |
C |
p. 61-70
|
article
|
| 3 |
A new model and algorithms in firefighting theory
|
Klein, Rolf
|
|
|
319 |
C |
p. 296-309
|
article
|
| 4 |
A note on fractional ID- [ a , b ] -factor-critical covered graphs
|
Zhou, Sizhong
|
|
|
319 |
C |
p. 511-516
|
article
|
| 5 |
A note on the convexity number of the complementary prisms of trees
|
P.K., Neethu
|
|
|
319 |
C |
p. 480-486
|
article
|
| 6 |
A note on the metric and edge metric dimensions of 2-connected graphs
|
Knor, Martin
|
|
|
319 |
C |
p. 454-460
|
article
|
| 7 |
Approximation algorithms for some Minimum Postmen Cover Problems
|
Mao, Yuying
|
|
|
319 |
C |
p. 382-393
|
article
|
| 8 |
A primal–dual approximation algorithm for Minsat
|
Arif, Umair
|
|
|
319 |
C |
p. 372-381
|
article
|
| 9 |
Are all pairs of hypomorphic digraphs S-isomorphic?
|
Ramachandran, S.
|
|
|
319 |
C |
p. 556-563
|
article
|
| 10 |
Bumblebee visitation problem
|
Das, Sandip
|
|
|
319 |
C |
p. 27-41
|
article
|
| 11 |
Collision-free routing problem with restricted L-path
|
Ajay, Jammigumpula
|
|
|
319 |
C |
p. 71-80
|
article
|
| 12 |
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
|
S.V., Ullas Chandran
|
|
|
319 |
C |
p. 499-510
|
article
|
| 13 |
Covering and packing of triangles intersecting a straight line
|
Pandit, Supantha
|
|
|
319 |
C |
p. 92-110
|
article
|
| 14 |
Editorial Board
|
|
|
|
319 |
C |
p. ii
|
article
|
| 15 |
Generalized bijective maps between G -parking functions, spanning trees, and the Tutte polynomial
|
Frizzell, Carrie
|
|
|
319 |
C |
p. 517-532
|
article
|
| 16 |
Hardness results of global total k -domination problem in graphs
|
Panda, B.S.
|
|
|
319 |
C |
p. 223-238
|
article
|
| 17 |
Improved approximation for maximum edge colouring problem
|
Chandran, L. Sunil
|
|
|
319 |
C |
p. 42-52
|
article
|
| 18 |
Improved descriptional complexity results on generalized forbidding grammars
|
Fernau, Henning
|
|
|
319 |
C |
p. 2-18
|
article
|
| 19 |
Induced star partition of graphs
|
Shalu, M.A.
|
|
|
319 |
C |
p. 81-91
|
article
|
| 20 |
Maximum 0-1 timed matching on temporal graphs
|
Mandal, Subhrangsu
|
|
|
319 |
C |
p. 310-326
|
article
|
| 21 |
Metric properties of Sierpiński triangle graphs
|
Hinz, Andreas M.
|
|
|
319 |
C |
p. 439-453
|
article
|
| 22 |
Monitoring the edges of a graph using distances
|
Foucaud, Florent
|
|
|
319 |
C |
p. 424-438
|
article
|
| 23 |
New algorithms and bounds for halving pseudolines
|
Bereg, Sergey
|
|
|
319 |
C |
p. 194-206
|
article
|
| 24 |
New results on radio k -labelings of distance graphs
|
Korže, Danilo
|
|
|
319 |
C |
p. 472-479
|
article
|
| 25 |
On Cartesian products of signed graphs
|
Lajou, Dimitri
|
|
|
319 |
C |
p. 533-555
|
article
|
| 26 |
On chordal and perfect plane near-triangulations
|
Salam, Sameera M.
|
|
|
319 |
C |
p. 53-60
|
article
|
| 27 |
On graphs whose eternal vertex cover number and vertex cover number coincide
|
Babu, Jasine
|
|
|
319 |
C |
p. 171-182
|
article
|
| 28 |
On indicated coloring of lexicographic product of graphs
|
Francis, P.
|
|
|
319 |
C |
p. 576-582
|
article
|
| 29 |
On lengths of edge-labeled graph expressions
|
Korenblit, Mark
|
|
|
319 |
C |
p. 583-594
|
article
|
| 30 |
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
|
Junginger, Kolja
|
|
|
319 |
C |
p. 141-148
|
article
|
| 31 |
On the bitprobe complexity of two probe adaptive schemes
|
Kesh, Deepanjan
|
|
|
319 |
C |
p. 132-140
|
article
|
| 32 |
On the Δ -interval and the Δ -convexity numbers of graphs and graph products
|
Anand, Bijo S.
|
|
|
319 |
C |
p. 487-498
|
article
|
| 33 |
On vertices contained in all or in no metric basis
|
Hakanen, Anni
|
|
|
319 |
C |
p. 407-423
|
article
|
| 34 |
Oriented diameter of star graphs
|
Kumar, K.S. Ajish
|
|
|
319 |
C |
p. 362-371
|
article
|
| 35 |
Overlaying a hypergraph with a graph with bounded maximum degree
|
Havet, Frédéric
|
|
|
319 |
C |
p. 394-406
|
article
|
| 36 |
Path factors in subgraphs
|
Zhou, Sizhong
|
|
|
319 |
C |
p. 183-191
|
article
|
| 37 |
Perfect Italian domination in graphs: Complexity and algorithms
|
Pradhan, D.
|
|
|
319 |
C |
p. 271-295
|
article
|
| 38 |
Planar projections of graphs
|
Aravind, N.R.
|
|
|
319 |
C |
p. 216-222
|
article
|
| 39 |
Preface: CALDAM 2019
|
Swami, Sarvottamananda
|
|
|
319 |
C |
p. 1
|
article
|
| 40 |
Preface: CALDAM 2020
|
Changat, Manoj
|
|
|
319 |
C |
p. 192-193
|
article
|
| 41 |
Properties of m-bonacci-sum graphs
|
Mahalingam, Kalpana
|
|
|
319 |
C |
p. 149-158
|
article
|
| 42 |
Representation learning for temporal networks using temporal random walk and deep autoencoder
|
Mohan, Anuraj
|
|
|
319 |
C |
p. 595-605
|
article
|
| 43 |
Smallest C 2 ℓ + 1 -critical graphs of odd-girth 2 k + 1
|
Beaudou, Laurent
|
|
|
319 |
C |
p. 564-575
|
article
|
| 44 |
Storing four elements in the two query bitprobe model
|
Baig, Mirza Galib Anwarul Husain
|
|
|
319 |
C |
p. 121-131
|
article
|
| 45 |
Structural parameterization for minimum conflict-free colouring
|
Ashok, Pradeesha
|
|
|
319 |
C |
p. 239-253
|
article
|
| 46 |
The balanced connected subgraph problem
|
Bhore, Sujoy
|
|
|
319 |
C |
p. 111-120
|
article
|
| 47 |
The complexity of restricted star colouring
|
M.A., Shalu
|
|
|
319 |
C |
p. 327-350
|
article
|
| 48 |
The Dudeney–Stockmeyer Conjecture
|
Hinz, Andreas M.
|
|
|
319 |
C |
p. 19-26
|
article
|
| 49 |
The median of Sierpiński graphs
|
Balakrishnan, Kannan
|
|
|
319 |
C |
p. 159-170
|
article
|
| 50 |
The Wiener index of the zero-divisor graph of Z n
|
Asir, T.
|
|
|
319 |
C |
p. 461-471
|
article
|
| 51 |
Vertex-edge domination in unit disk graphs
|
Jena, Sangram K.
|
|
|
319 |
C |
p. 351-361
|
article
|
| 52 |
Vertex partitioning problems on graphs with bounded tree width
|
Aravind, N.R.
|
|
|
319 |
C |
p. 254-270
|
article
|
Journal description