| Publication | Date of Publication | Type |
|---|
On coloring parameters of triangle-free planar \((n, m)\)-graphs
Graphs and Combinatorics | 2024-11-20 | Paper |
A linear algorithm for radio \(k\)-coloring of powers of paths having small diameters
Journal of Computer and System Sciences | 2024-10-29 | Paper |
On locating and neighbor-locating colorings of sparse graphs
Discrete Applied Mathematics | 2024-09-26 | Paper |
On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters
Discrete Applied Mathematics | 2024-09-26 | Paper |
Oriented total-coloring of oriented graphs
Discrete Mathematics | 2024-08-19 | Paper |
A linear algorithm for radio \(k\)-coloring powers of paths having small diameter
Lecture Notes in Computer Science | 2023-12-22 | Paper |
| A theoretical expansion of the Sprout game | 2023-11-04 | Paper |
New bounds and constructions for neighbor-locating colorings of graphs
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
| On coloring parameters of triangle-free planar $(n,m)$-graphs | 2023-06-13 | Paper |
On radio \(k\)-labeling of the power of the infinite path
Information Processing Letters | 2023-06-05 | Paper |
On the pushable chromatic number of various types of grids
Discrete Applied Mathematics | 2023-02-24 | Paper |
On clique numbers of colored mixed graphs
Discrete Applied Mathematics | 2022-11-11 | Paper |
| On relative clique number of triangle-free planar colored mixed graphs | 2022-08-30 | Paper |
| The oriented relative clique number of triangle-free planar graphs is 10 | 2022-08-22 | Paper |
On the signed chromatic number of some classes of graphs
Discrete Mathematics | 2021-11-23 | Paper |
| On radio $k$-chromatic number of powers of paths having small diameter | 2021-06-14 | Paper |
Efficient algorithm for computing the triangle maximizing the length of its smallest side inside a convex polygon
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Pushable chromatic number of graphs with degree constraints
Discrete Mathematics | 2021-01-21 | Paper |
| Classification of edge-critical underlying absolute planar cliques for signed graphs | 2020-07-29 | Paper |
| The relative oriented clique number of triangle-free planar graphs is 10 | 2020-07-21 | Paper |
| The relative signed clique number of planar graphs is 8 | 2019-10-10 | Paper |
Two-center of the convex hull of a point set: dynamic model, and restricted streaming model
Fundamenta Informaticae | 2019-06-14 | Paper |
Erratum to: ``On oriented cliques with respect to push operation
Discrete Applied Mathematics | 2019-03-22 | Paper |
| On relative clique number of colored mixed graphs | 2018-10-12 | Paper |
| On oriented \(L(p,1)\)-labeling | 2018-06-05 | Paper |
On oriented cliques with respect to push operation
Discrete Applied Mathematics | 2017-10-17 | Paper |
Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
Discrete Applied Mathematics | 2017-06-19 | Paper |
Retailers optimal pricing and economic order quantity in stock and price sensitive demand environment
International Journal of Operational Research | 2017-05-31 | Paper |
On chromatic number of colored mixed graphs
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
A lower bound technique for radio \(k\)-coloring
Discrete Mathematics | 2017-02-27 | Paper |
| On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice | 2016-10-17 | Paper |
| Chromatic number of signed graphs with bounded maximum degree | 2016-03-31 | Paper |
On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
(available as arXiv preprint) | N/A | Paper |
