default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMicheal Arockiaraj
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j28]Micheal Arockiaraj, Arul Jeya Shalini, J. Nancy Delaila:
Embedding algorithm of spined cube into grid structure and its wirelength computation. Theor. Comput. Sci. 905: 69-86 (2022)- 2021
- [j27]Zhen Yang
, Micheal Arockiaraj, Savari Prabhu, M. Arulperumjothi, Jia-Bao Liu:
Second Zagreb and Sigma Indices of Semi and Total Transformations of Graphs. Complex. 2021: 6828424:1-6828424:15 (2021) - [j26]Micheal Arockiaraj, Jia-Bao Liu, J. Nancy Delaila, Arul Jeya Shalini:
On the optimal layout of balanced complete multipartite graphs into grids and tree related structures. Discret. Appl. Math. 288: 50-65 (2021) - [j25]Micheal Arockiaraj, J. Nancy Delaila, Jessie Abraham:
Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees. Fundam. Informaticae 178(3): 187-202 (2021) - [j24]Jessie Abraham, Micheal Arockiaraj:
Minimum layout of hypercubes and folded hypercubes into the prism over caterpillars. Int. J. Comput. Aided Eng. Technol. 14(4): 520-529 (2021) - [j23]Jessie Abraham, Micheal Arockiaraj:
Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path. Parallel Process. Lett. 31(1): 2150004:1-2150004:13 (2021) - 2020
- [j22]Arul Jeya Shalini, Jessie Abraham, Micheal Arockiaraj:
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout. Discret. Appl. Math. 286: 10-18 (2020)
2010 – 2019
- 2019
- [j21]Micheal Arockiaraj, Jia-Bao Liu, Arul Jeya Shalini:
Vertex decomposition method for wirelength problem and its applications to enhanced hypercube networks. IET Comput. Digit. Tech. 13(2): 87-92 (2019) - [j20]Micheal Arockiaraj, Jessie Abraham, Arul Jeya Shalini:
Node set optimization problem for complete Josephus cubes. J. Comb. Optim. 38(4): 1180-1195 (2019) - [j19]Jia-Bao Liu, Micheal Arockiaraj, Antony Nelson:
Tight Bounds on 1-Harmonious Coloring of Certain Graphs. Symmetry 11(7): 917 (2019) - [j18]Mohan Chris Monica, Samivel Santhakumar, Micheal Arockiaraj, Jia-Bao Liu:
Partition dimension of certain classes of series parallel graphs. Theor. Comput. Sci. 778: 47-60 (2019) - 2017
- [j17]Micheal Arockiaraj, L. Packiaraj, R. Sundara Rajan:
Exact Wirelength of Circulant Networks into Cycle-of-ladders. Ars Comb. 132: 269-283 (2017) - [j16]R. Sundara Rajan, Indra Rajasingh, Micheal Arockiaraj, T. M. Rajalaxmi, B. Mahavir:
Embedding of Hypercubes into Generalized Books. Ars Comb. 135: 133-151 (2017) - [j15]Jessie Abraham, Micheal Arockiaraj:
Layout of embedding locally twisted cube into the extended theta mesh topology. Electron. Notes Discret. Math. 63: 371-379 (2017) - [j14]Micheal Arockiaraj, Jessie Abraham, Jasintha Quadras, Arul Jeya Shalini:
Linear layout of locally twisted cubes. Int. J. Comput. Math. 94(1): 56-65 (2017) - [c2]Jessie Abraham, Micheal Arockiaraj:
Optimal Embedding of Locally Twisted Cubes into Grids. CALDAM 2017: 1-11 - 2016
- [j13]Jessie Abraham, Micheal Arockiaraj:
Wirelength of Enhanced Hypercubes into r-Rooted Complete Binary Trees. Electron. Notes Discret. Math. 53: 373-382 (2016) - [c1]Jessie Abraham, Micheal Arockiaraj:
Minimum Layout of Circulant Graphs into Certain Height Balanced Trees. ICTCSDM 2016: 90-97 - 2015
- [j12]Micheal Arockiaraj, Jasintha Quadras, Indra Rajasingh, Arul Jeya Shalini:
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees. Discret. Optim. 17: 1-13 (2015) - [j11]Indra Rajasingh, Micheal Arockiaraj, Jasintha Quadras, Arul Jeya Shalini:
Linear Layout of Directed Grid Graph. Math. Comput. Sci. 9(2): 221-227 (2015) - [j10]Micheal Arockiaraj, Arul Jeya Shalini:
Conjectures on wirelength of hypercube into cylinder and torus. Theor. Comput. Sci. 595: 168-171 (2015) - 2014
- [j9]Micheal Arockiaraj, Jasintha Quadras, Indra Rajasingh, Arul Jeya Shalini:
Embedding of hypercubes into sibling trees. Discret. Appl. Math. 169: 9-14 (2014) - 2013
- [j8]Indra Rajasingh, Paul D. Manuel, Micheal Arockiaraj, Bharati Rajan:
Embeddings of circulant networks. J. Comb. Optim. 26(1): 135-151 (2013) - [j7]Indra Rajasingh, Micheal Arockiaraj:
Layout of Embedding Circulant Networks into Linear Hexagons and Phenylenes. J. Interconnect. Networks 14(3) (2013) - 2012
- [j6]Indra Rajasingh, Paul D. Manuel, Bharati Rajan, Micheal Arockiaraj:
Wirelength of hypercubes into certain trees. Discret. Appl. Math. 160(18): 2778-2786 (2012) - [j5]Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel:
Minimum wirelength of hypercubes into n-dimensional grid networks. Inf. Process. Lett. 112(14-15): 583-586 (2012) - 2011
- [j4]Paul D. Manuel, Micheal Arockiaraj, Indra Rajasingh, Bharati Rajan:
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discret. Appl. Math. 159(17): 2109-2116 (2011) - [j3]Micheal Arockiaraj, Paul D. Manuel, Indra Rajasingh, Bharati Rajan:
Wirelength of 1-fault hamiltonian graphs into wheels and fans. Inf. Process. Lett. 111(18): 921-925 (2011) - [j2]Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel:
Circular wirelength of Generalized Petersen Graphs. J. Interconnect. Networks 12(4): 319-336 (2011) - [j1]Indra Rajasingh, Micheal Arockiaraj:
Linear Wirelength of Folded Hypercubes. Math. Comput. Sci. 5(1): 101-111 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
