default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul D. Manuel
Person information
- affiliation: Kuwait University
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j57]Paul D. Manuel
, Bostjan Bresar, Sandi Klavzar:
Geodesic packing in graphs. Appl. Math. Comput. 459: 128277 (2023)- [j56]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
The geodesic transversal problem on some networks. Comput. Appl. Math. 42(1) (2023) - [j55]Zainab AlMeraj, Ali K. Alenezi, Paul D. Manuel:
An empirical investigation into organisation cyber security readiness from the IT employee and manager perspectives. Electron. Gov. an Int. J. 19(5): 539-559 (2023) - [i3]R. Prabha, S. Renukaa Devi, Paul D. Manuel:
General Position Problem of Butterfly Networks. CoRR abs/2302.06154 (2023) - 2022
- [j54]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
The geodesic-transversal problem. Appl. Math. Comput. 413: 126621 (2022) - [i2]Paul D. Manuel, Sandi Klavzar, R. Prabha, Andrew Arokiaraj:
The geodesic cover problem for butterfly networks. CoRR abs/2210.12675 (2022) - [i1]Paul D. Manuel, Bostjan Bresar, Sandi Klavzar:
Geodesic packing in graphs. CoRR abs/2210.15325 (2022) - 2021
- [j53]Paul D. Manuel:
On the isometric path partition problem. Discuss. Math. Graph Theory 41(4): 1077-1089 (2021) - [j52]R. Stalin Mary, N. Parthiban, Indra Rajasingh, Paul D. Manuel:
Optimal layout of recursive circulant graphs. Int. J. Comput. Math. Comput. Syst. Theory 6(3): 209-219 (2021) - 2020
- [j51]Andrew Arokiaraj, Sandi Klavzar, Paul D. Manuel, Elizabeth Thomas, Antony Xavier:
Strong geodetic problems in networks. Discuss. Math. Graph Theory 40(1): 307-321 (2020)
2010 – 2019
- 2019
- [j50]Paul D. Manuel:
An efficient Hosoya index algorithm and its application. Int. J. Comput. Aided Eng. Technol. 11(2): 196-205 (2019) - [c10]Paul D. Manuel:
Macro and Micro Level Classification of Social Media Private Data. WorldCIST (2) 2019: 853-866 - 2018
- [j49]Sandi Klavzar, D. Azubha Jemilet, Indra Rajasingh, Paul D. Manuel, N. Parthiban:
General Transmission Lemma and Wiener complexity of triangular grids. Appl. Math. Comput. 338: 115-122 (2018) - [j48]Paul D. Manuel, Sandi Klavzar:
The Graph Theory General Position Problem on Some Interconnection Networks. Fundam. Informaticae 163(4): 339-350 (2018) - 2017
- [j47]R. Sundara Rajan, R. Jayagopal, Paul D. Manuel, Mirka Miller, Indra Rajasingh:
A note on the locating-total domination in graphs. Discuss. Math. Graph Theory 37(3): 745-754 (2017) - 2016
- [j46]Indra Rajasingh, Bharati Rajan, Joice Punitha, Paul D. Manuel:
Total-Kernel in Oriented Circular Ladder and Mobius Ladder. Ars Comb. 126: 337-349 (2016) - [j45]Indra Rajasingh, Paul D. Manuel, N. Parthiban, D. Azubha Jemilet, R. Sundara Rajan:
Transmission in Butterfly Networks. Comput. J. 59(8): 1174-1179 (2016) - [j44]Sandi Klavzar, Paul D. Manuel, Mohammad J. Nadjafi-Arani, R. Sundara Rajan, Cyriac Grigorious, Sudeep Stephen:
Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs. Comput. J. 59(12): 1900-1910 (2016) - 2015
- [j43]Paul D. Manuel:
A trust model of cloud computing based on Quality of Service. Ann. Oper. Res. 233(1): 281-292 (2015) - [j42]Paul D. Manuel, Helal Al-Hamadi, Kalim Qureshi:
Challenges, strategies and metrics for supply-driven enterprises. Ann. Oper. Res. 233(1): 293-303 (2015) - [j41]R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh, N. Parthiban, Mirka Miller:
A Lower Bound for Dilation of an Embedding. Comput. J. 58(12): 3271-3278 (2015) - [j40]R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, Mirka Miller, T. M. Rajalaxmi:
Maximum incomplete recursive circulants in graph embeddings. Discret. Math. Algorithms Appl. 7(4): 1550053:1-1550053:22 (2015) - [j39]R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh:
Embeddings Between Hypercubes and Hypertrees. J. Graph Algorithms Appl. 19(1): 361-373 (2015) - [j38]Paul D. Manuel, Bharati Rajan, Cyriac Grigorious, Sudeep Stephen:
On the Strong Metric Dimension of Tetrahedral Diamond Lattice. Math. Comput. Sci. 9(2): 201-208 (2015) - [j37]Paul D. Manuel, A. S. Shanthi:
Berge-Fulkerson Conjecture on Certain Snarks. Math. Comput. Sci. 9(2): 209-220 (2015) - [j36]Indra Rajasingh, R. Sundara Rajan, Paul D. Manuel:
A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees. Parallel Process. Lett. 25(4): 1550008:1-1550008:17 (2015) - [c9]Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi:
A Tight Bound for Congestion of an Embedding. CALDAM 2015: 229-237 - 2014
- [j35]Cyriac Grigorious, Paul D. Manuel, Mirka Miller, Bharati Rajan, Sudeep Stephen:
On the metric dimension of circulant and Harary graphs. Appl. Math. Comput. 248: 47-54 (2014) - [j34]Bharati Rajan, Indra Rajasingh, Jude Annie Cynthia, Paul D. Manuel:
Metric dimension of directed graphs. Int. J. Comput. Math. 91(7): 1397-1406 (2014) - [c8]R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, T. M. Rajalaxmi, N. Parthiban:
Embedding Circulant Networks into Butterfly and Benes Networks. IWOCA 2014: 298-306 - 2013
- [j33]Paul D. Manuel, Bharati Rajan, Indra Rajasingh, P. Vasanthi Beulah:
Improved Bounds on the Crossing Number of Butterfly Network. Discret. Math. Theor. Comput. Sci. 15(2): 87-94 (2013) - [j32]Indra Rajasingh, Paul D. Manuel, Micheal Arockiaraj, Bharati Rajan:
Embeddings of circulant networks. J. Comb. Optim. 26(1): 135-151 (2013) - 2012
- [j31]Indra Rajasingh, Paul D. Manuel, Bharati Rajan, Micheal Arockiaraj:
Wirelength of hypercubes into certain trees. Discret. Appl. Math. 160(18): 2778-2786 (2012) - [j30]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) - [j29]Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan:
Embedding Variants of Hypercubes with Dilation 2. J. Interconnect. Networks 13(1-2) (2012) - [j28]Babar Nazir, Kalim Qureshi, Paul D. Manuel:
Replication based fault tolerant job scheduling strategy for economy driven grid. J. Supercomput. 62(2): 855-873 (2012) - 2011
- [j27]Paul D. Manuel, Indra Rajasingh:
Minimum Metric Dimension of Silicate Networks. Ars Comb. 98: 501-510 (2011) - [j26]Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.:
Landmarks in Binary Tree Derived Architectures. Ars Comb. 99: 473-486 (2011) - [j25]Paul D. Manuel:
Locating and Liar Domination of Circulant Networks. Ars Comb. 101: 309-320 (2011) - [j24]Kalim Qureshi, Syed Munir Hussain Shah, Paul D. Manuel:
Empirical performance evaluation of schedulers for cluster of workstations. Clust. Comput. 14(2): 101-113 (2011) - [j23]Paul D. Manuel:
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees. Discret. Appl. Math. 159(5): 360-366 (2011) - [j22]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) - [j21]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) - [j20]Indra Rajasingh, Micheal Arockiaraj, Bharati Rajan, Paul D. Manuel:
Circular wirelength of Generalized Petersen Graphs. J. Interconnect. Networks 12(4): 319-336 (2011) - [j19]Kalim Qureshi, Fiaz Gul Khan, Paul D. Manuel, Babar Nazir:
A hybrid fault tolerance technique in grid computing system. J. Supercomput. 56(1): 106-128 (2011) - [j18]Kalim Qureshi, Attiqa Rehman, Paul D. Manuel:
Enhanced GridSim architecture with load balancing. J. Supercomput. 57(3): 265-275 (2011)
2000 – 2009
- 2009
- [j17]Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Helda Mercy:
Exact wirelength of hypercubes on a grid. Discret. Appl. Math. 157(7): 1486-1495 (2009) - [j16]Babar Nazir, Kalim Qureshi, Paul D. Manuel:
Adaptive checkpointing strategy to tolerate faults in economy based grid. J. Supercomput. 50(1): 1-18 (2009) - [c7]Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Joice Punitha:
Kernel in Oriented Circulant Graphs. IWOCA 2009: 396-407 - 2008
- [j15]Paul D. Manuel, B. Sivakumar, Gunaseelan Arivarignan:
A perishable inventory system with service facilities and retrial customers. Comput. Ind. Eng. 54(3): 484-501 (2008) - [j14]Paul D. Manuel, Mostafa I. Abd-El-Barr, Indra Rajasingh, Bharati Rajan:
An efficient representation of Benes networks and its applications. J. Discrete Algorithms 6(1): 11-19 (2008) - [j13]Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Chris Monica M.:
On minimum metric dimension of honeycomb networks. J. Discrete Algorithms 6(1): 20-27 (2008) - 2007
- [j12]Kalim Qureshi, Paul D. Manuel:
Adaptive pre-task assignment scheduling strategy for heterogeneous distributed raytracing system. Comput. Electr. Eng. 33(1): 70-78 (2007) - [j11]Paul D. Manuel, B. Sivakumar, Gunaseelan Arivarignan:
Perishable Inventory System with Postponed Demands and Negative Customers. Adv. Decis. Sci. 2007: 94850:1-94850:12 (2007) - [c6]Paul D. Manuel, Mostafa I. Abd-El-Barr, S. Thamarai Selvi:
Knowledge Discovery Using Neural Network. IKE 2007: 432-438 - 2006
- [c5]Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Albert Muthumalai:
On Induced Matching Partitions of Certain Interconnection Networks. FCS 2006: 57-63 - [c4]Paul D. Manuel, Kalim Qureshi, Albert William, Albert Muthumalai:
VLSI Layout of Benes Networks. FCS 2006: 64-70 - 2005
- [j10]Elias Dahlhaus, Paul D. Manuel, Mirka Miller:
Parallel algorithms for generalized clique transversal problems. Australas. J Comb. 33: 3-14 (2005) - 2004
- [j9]Indra Rajasingh, Albert William, Jasintha Quadras, Paul D. Manuel:
Embedding of cycles and wheels into arbitrary trees. Networks 44(3): 173-178 (2004) - [c3]Paul D. Manuel, Salahadin Mohammed, Albert William:
A Model of EGovernance Based on Knowledge Management. International Conference on Internet Computing 2004: 624-630 - 2003
- [j8]Albert William, Indra Rajasingh, Jasintha Quadras, Paul D. Manuel:
Embedding of Generalized Wheels into Arbitrary Trees. Electron. Notes Discret. Math. 15: 228-231 (2003) - [j7]Paul D. Manuel, Jarallah AlGhamdi:
A data-centric design for n-tier architecture. Inf. Sci. 150(3-4): 195-206 (2003) - [c2]Paul D. Manuel, Omer F. Demirel, Hayrettin Zengin, Albert William:
User Interface Design of E-Commerce for SMEs. International Conference on Internet Computing 2003: 543-546 - [c1]Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel:
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. WG 2003: 334-345
1990 – 1999
- 1998
- [j6]Jan Kratochvíl, Paul D. Manuel, Mirka Miller, Andrzej Proskurowski:
Disjoint and unfolding domination in graphs. Australas. J Comb. 18: 277-292 (1998) - [j5]Elias Dahlhaus, Paul D. Manuel, Mirka Miller:
A characterization of strongly chordal graphs. Discret. Math. 187(1-3): 269-271 (1998) - [j4]Elias Dahlhaus, Paul D. Manuel, Mirka Miller:
Maximum h-Colourable Subgraph Problem in Balanced Graphs. Inf. Process. Lett. 65(6): 301-303 (1998) - 1997
- [j3]Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller:
Transversal Partitioning in Balanced Hypergraphs. Discret. Appl. Math. 79(1-3): 75-89 (1997) - 1996
- [j2]Peter Eades, J. Mark Keil, Paul D. Manuel, Mirka Miller:
Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Nord. J. Comput. 3(3): 220-237 (1996) - 1995
- [j1]Jan Kratochvíl, Paul D. Manuel, Mirka Miller:
Generalized Domination in Chordal Graphs. Nord. J. Comput. 2(1): 41-50 (1995)
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 2025-01-20 22:56 CET 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:
