Bader F. AlBdaiwi

Orcid: 0000-0002-1851-8831

According to our database1, Bader F. AlBdaiwi authored at least 24 papers between 2003 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Independent spanning trees in Eisenstein-Jacobi networks.
J. Supercomput., 2022

2017
A GPU-based genetic algorithm for the p-median problem.
J. Supercomput., 2017

Node-independent spanning trees in Gaussian networks.
J. Parallel Distributed Comput., 2017

2016
Edge-disjoint node-independent spanning trees in dense Gaussian networks.
J. Supercomput., 2016

Heuristics for the Variable Sized Bin Packing Problem Using a Hybrid P-System and CUDA Architecture.
CoRR, 2016

On the Number of Cycles in a Graph.
CoRR, 2016

2015
Revisiting the Definition of the Relational Tuple Calculus.
Proceedings of the New Trends in Databases and Information Systems, 2015

2014
Pattern-Based Conceptual Data Modelling.
Proceedings of the Information Modelling and Knowledge Bases XXVI, 2014

2012
Diameter Perfect Lee Codes.
IEEE Trans. Inf. Theory, 2012

Non-periodic Tilings of ℝ n by Crosses.
Discret. Comput. Geom., 2012

An Optimal Inherently Stabilizing 2-Neighborhood Crash Resilient Protocol for Secure and Reliable Routing in Hypercube Networks.
Comput. J., 2012

2011
Data aggregation for <i>p</i>-median problems.
J. Comb. Optim., 2011

2010
An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks.
IEEE Trans. Computers, 2010

2009
Enumerating and decoding perfect linear Lee codes.
Des. Codes Cryptogr., 2009

Equivalent instances of the simple plant location problem.
Comput. Math. Appl., 2009

Efficient domination in directed tori and the Vizing's conjecture for directed graphs.
Ars Comb., 2009

2007
Mixed-Radix Gray Codes in Lee Metric.
IEEE Trans. Computers, 2007

Mixed Radix Gray Codes and Edge Disjoint Hamiltonian Cycles in Toroidal Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Fast decoding of quasi-perfect Lee distance codes.
Des. Codes Cryptogr., 2006

2005
Quasi-perfect resource placements for two-dimensional toroidal networks.
J. Parallel Distributed Comput., 2005

2004
Perfect Distance-d Placements in 2D Toroidal Networks.
J. Supercomput., 2004

Edge-disjoint Hamiltonian cycles in two-dimensional torus.
Int. J. Math. Math. Sci., 2004

2003
Quasi-perfect Lee distance codes.
IEEE Trans. Inf. Theory, 2003

On resource placements in 3D tori.
J. Parallel Distributed Comput., 2003


  Loading...