| Publication | Date of Publication | Type |
|---|
| Embedding of hypercube into fractal cubic network | 2025-01-03 | Paper |
| Reliability measures in brother trees | 2024-06-24 | Paper |
| Embedding Wheel - like Networks | 2024-01-15 | Paper |
| Maximum subgraph problem for 3-regular Knödel graphs and its wirelength | 2023-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6162190 | 2023-06-15 | Paper |
| An asymptotic relation between the wirelength of an embedding and the Wiener index | 2022-11-23 | Paper |
| Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout | 2022-10-10 | Paper |
| An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength | 2022-06-28 | Paper |
| Wiener index via wirelength of an embedding | 2022-03-17 | Paper |
| Embedding complete multi-partite graphs into Cartesian product of paths and cycles | 2022-03-14 | Paper |
| Transmission in H-naphtalenic nanosheet | 2021-11-11 | Paper |
| Biochemical and phylogenetic networks. I: Hypertrees and corona products | 2021-05-10 | Paper |
| Biochemical and phylogenetic networks. II: \(X\)-trees and phylogenetic trees | 2021-05-10 | Paper |
| Embedding complete multipartite graphs into certain trees | 2020-11-12 | Paper |
| Total domination in certain nanotori | 2020-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121937 | 2020-09-22 | Paper |
| Improved bound for dilation of an embedding onto circulant networks | 2020-07-02 | Paper |
| Wirelength of embedding complete multipartite graphs into certain graphs | 2020-05-18 | Paper |
| Domination parameters in hypertrees and sibling trees | 2020-05-18 | Paper |
| EOQ model for time dependent demand and exponentially increasing holding cost under permissible delay in payment with complete backlogging | 2018-10-08 | Paper |
| Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes | 2018-07-18 | Paper |
| A note on minimum linear arrangement for BC graphs | 2018-04-10 | Paper |
| Embedding of hypercubes into generalized books. | 2018-02-09 | Paper |
| A linear time algorithm for embedding Christmas trees into certain trees | 2017-12-15 | Paper |
| Exact wirelength of circulant networks into cycle-of-ladders. | 2017-12-15 | Paper |
| Exact wirelength of embedding circulant networks into necklace and windmill graphs. | 2017-09-06 | Paper |
| A note on the locating-total domination in graphs | 2017-07-17 | Paper |
| Computing Szeged index of certain nanosheets using partition technique | 2017-04-11 | Paper |
| Domination parameters in hypertrees | 2016-03-23 | Paper |
| Maximum incomplete recursive circulants in graph embeddings | 2016-02-22 | Paper |
| Oriented diameter of grids | 2015-11-18 | Paper |
| Embedding circulant and grid based network | 2015-11-18 | Paper |
| Embeddings Between Hypercubes and Hypertrees | 2015-10-29 | Paper |
| Embedding circulant networks into butterfly and benes networks | 2015-09-15 | Paper |
| Bothway embedding of circulant network into grid | 2015-08-18 | Paper |
| Embedding of recursive circulants into certain necklace graphs | 2015-08-03 | Paper |
| A tight bound for congestion of an embedding | 2015-02-19 | Paper |
| A linear time algorithm for embedding hypercube into cylinder and torus | 2014-06-23 | Paper |
| Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs | 2013-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3166164 | 2012-10-21 | Paper |
| Embedding of hypercubes into necklace, windmill and snake graphs | 2012-07-25 | Paper |
