Paul D. Manuel

Bostjan Bresar

Appl. Math. Comput., December, 2023

The geodesic transversal problem on some networks.

[BibT_eX]

[DOI]

Bostjan Bresar

Comput. Appl. Math., February, 2023

An empirical investigation into organisation cyber security readiness from the IT employee and manager perspectives.

[BibT_eX]

[DOI]

Zainab AlMeraj

Ali K. Alenezi

Electron. Gov. an Int. J., 2023

General Position Problem of Butterfly Networks.

[BibT_eX]

[DOI]

R. Prabha

S. Renukaa Devi

CoRR, 2023

2022

The geodesic cover problem for butterfly networks.

[BibT_eX]

[DOI]

CoRR, 2022

The geodesic-transversal problem.

[BibT_eX]

[DOI]

Bostjan Bresar

Appl. Math. Comput., 2022

2021

Optimal layout of recursive circulant graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2021

On the isometric path partition problem.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

2020

Strong geodetic problems in networks.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

2019

An efficient Hosoya index algorithm and its application.

[BibT_eX]

[DOI]

Int. J. Comput. Aided Eng. Technol., 2019

Macro and Micro Level Classification of Social Media Private Data.

[BibT_eX]

[DOI]

Proceedings of the New Knowledge in Information Systems and Technologies, 2019

2018

The Graph Theory General Position Problem on Some Interconnection Networks.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

General Transmission Lemma and Wiener complexity of triangular grids.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

A note on the locating-total domination in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

2016

Transmission in Butterfly Networks.

[BibT_eX]

[DOI]

Comput. J., 2016

Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs.

[BibT_eX]

[DOI]

Mohammad J. Nadjafi-Arani

Cyriac Grigorious

Sudeep Stephen

Comput. J., 2016

Total-Kernel in Oriented Circular Ladder and Mobius Ladder.

[BibT_eX]

Ars Comb., 2016

2015

A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2015

Berge-Fulkerson Conjecture on Certain Snarks.

[BibT_eX]

[DOI]

A. S. Shanthi

Math. Comput. Sci., 2015

On the Strong Metric Dimension of Tetrahedral Diamond Lattice.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2015

Embeddings Between Hypercubes and Hypertrees.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Maximum incomplete recursive circulants in graph embeddings.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2015

A Lower Bound for Dilation of an Embedding.

[BibT_eX]

[DOI]

Comput. J., 2015

Challenges, strategies and metrics for supply-driven enterprises.

[BibT_eX]

[DOI]

Helal Al-Hamadi

Ann. Oper. Res., 2015

A trust model of cloud computing based on Quality of Service.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2015

A Tight Bound for Congestion of an Embedding.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Metric dimension of directed graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2014

On the metric dimension of circulant and Harary graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2014

Embedding Circulant Networks into Butterfly and Benes Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

Embeddings of circulant networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Improved Bounds on the Crossing Number of Butterfly Network.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

2012

Replication based fault tolerant job scheduling strategy for economy driven grid.

[BibT_eX]

[DOI]

Babar Nazir

J. Supercomput., 2012

Embedding Variants of Hypercubes with Dilation 2.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2012

Minimum wirelength of hypercubes into n-dimensional grid networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Wirelength of hypercubes into certain trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Enhanced GridSim architecture with load balancing.

[BibT_eX]

[DOI]

Attiqa Rehman

J. Supercomput., 2011

A hybrid fault tolerance technique in grid computing system.

[BibT_eX]

[DOI]

J. Supercomput., 2011

Circular wirelength of Generalized Petersen Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2011

Wirelength of 1-fault hamiltonian graphs into wheels and fans.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Minimum average congestion of enhanced and augmented hypercubes into complete binary trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Empirical performance evaluation of schedulers for cluster of workstations.

[BibT_eX]

[DOI]

Syed Munir Hussain Shah

Clust. Comput., 2011

Landmarks in Binary Tree Derived Architectures.

[BibT_eX]

Ars Comb., 2011

Minimum Metric Dimension of Silicate Networks.

[BibT_eX]

Ars Comb., 2011

Locating and Liar Domination of Circulant Networks.

[BibT_eX]

Ars Comb., 2011

2009

Adaptive checkpointing strategy to tolerate faults in economy based grid.

[BibT_eX]

[DOI]

Babar Nazir

J. Supercomput., 2009

Exact wirelength of hypercubes on a grid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Kernel in Oriented Circulant Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

On minimum metric dimension of honeycomb networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

An efficient representation of Benes networks and its applications.

[BibT_eX]

[DOI]

Mostafa I. Abd-El-Barr

Bharati Rajan

J. Discrete Algorithms, 2008

A perishable inventory system with service facilities and retrial customers.

[BibT_eX]

[DOI]

B. Sivakumar

Gunaseelan Arivarignan

Comput. Ind. Eng., 2008

2007

Perishable Inventory System with Postponed Demands and Negative Customers.

[BibT_eX]

[DOI]

B. Sivakumar

Gunaseelan Arivarignan

Adv. Decis. Sci., 2007

Adaptive pre-task assignment scheduling strategy for heterogeneous distributed raytracing system.

[BibT_eX]

[DOI]

Comput. Electr. Eng., 2007

Knowledge Discovery Using Neural Network.

[BibT_eX]

Mostafa I. Abd-El-Barr

S. Thamarai Selvi

Proceedings of the 2007 International Conference on Information & Knowledge Engineering, 2007

2006

On Induced Matching Partitions of Certain Interconnection Networks.

[BibT_eX]

Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

VLSI Layout of Benes Networks.

[BibT_eX]

Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2005

Parallel algorithms for generalized clique transversal problems.

[BibT_eX]

[DOI]

Elias Dahlhaus

Australas. J Comb., 2005

2004

Embedding of cycles and wheels into arbitrary trees.

[BibT_eX]

[DOI]

Networks, 2004

A Model of EGovernance Based on Knowledge Management.

[BibT_eX]

Salahadin Mohammed

Albert William

Proceedings of the International Conference on Internet Computing, 2004

2003

A data-centric design for n-tier architecture.

[BibT_eX]

[DOI]

Jarallah AlGhamdi

Inf. Sci., 2003

Embedding of Generalized Wheels into Arbitrary Trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

User Interface Design of E-Commerce for SMEs.

[BibT_eX]

Proceedings of the International Conference on Internet Computing, 2003

1998

Maximum <i>h</i>-Colourable Subgraph Problem in Balanced Graphs.

[BibT_eX]

[DOI]

Elias Dahlhaus

Inf. Process. Lett., 1998

A characterization of strongly chordal graphs.

[BibT_eX]

[DOI]

Elias Dahlhaus

Discret. Math., 1998

Disjoint and unfolding domination in graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1998

1997

Transversal Partitioning in Balanced Hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs.

[BibT_eX]

Nord. J. Comput., 1996

1995

Generalized Domination in Chordal Graphs.

[BibT_eX]

Jan Kratochvíl