Bader Albdaiwi

Bader Albdaiwi
Professor of Computer Science
Kuwait University
College of Science
Computer Science Department,
P.O. Box 5969
Safat -13060
Education:
Oregon State University, USA
1997
Ph.D. in Computer Science
University of Colorado, USA
1995
M.S. in Computer Science
Kuwait University, Kuwait
1992
B.S. in Computer Science
Interests and Research:
  • Interconnection networks
  • Parallel Computing.
Publications

[1] Zaid Hussain, Bader F. AlBdaiwi, and Anton Cerny ́. Node-independent spanning trees in gaussian networks. J. Parallel Distributed Comput., 109:324–332, 2017.

[2] Bader F. AlBdaiwi and Hosam M. F. AboElFotoh. A gpu-based genetic algorithm for the p-median problem. The Journal of Supercomputing, 73(10):4221–4244, 2017.

[3] Zaid Hussain, Bader F. AlBdaiwi, and Anton Cerny ́. Node-independent spanning trees in gaussian networks. CoRR, abs/1701.02991, 2017.

[4] Bader F. AlBdaiwi, Zaid Hussain, Anton Cerny ́, and Robert Aldred. Edge- disjoint node-independent spanning trees in dense gaussian networks. The Journal of Supercomputing, 72(12):4718–4736, 2016.

[5] Bader F. AlBdaiwi, Zaid Hussain, Anton Cerny ́, and Robert Aldred. Edge-disjoint node-independent spanning trees in dense gaussian networks. CoRR, abs/1601.06915, 2016.

[6] Qadha’a AlEnezi, Hosam M. F. AboElFotoh, Bader F. AlBdaiwi, and Mo- hammad Ali AlMulla. Heuristics for the variable sized bin packing problem using a hybrid p-system and CUDA architecture. CoRR, abs/1602.08735, 2016.

[7] Bader F. AlBdaiwi. On the number of cycles in a graph. CoRR, abs/1603.01807, 2016.

[8] Bader F. AlBdaiwi and Hosam M. F. AboElFotoh. A gpu-based genetic algorithm for the p-median problem. CoRR, abs/1610.10061, 2016.

[9] Bader F. AlBdaiwi and Bernhard Thalheim. Revisiting the definition of the relational tuple calculus. In  New Trends in Databases and Information Systems – ADBIS 2015 Short Papers and Workshops, BigDap, DCSA, GID, MEBIS,OAIS, SW4CH, WISARD, Poitiers, France, September 8-11, 2015. Pro- ceedings, volume 539 of Communications in Computer and Information Science, pages 3–11. Springer, 2015.

[10] Bader F. AlBdaiwi, Ren ́e Noack, and Bernhard Thalheim. Pattern-based conceptual data modelling. In  Information Modelling and Knowledge Bases XXVI, 24th International Conference on Information Modelling and Knowledge Bases (EJC 2014), Kiel, Germany, June 3-6, 2014, volume 272 of Frontiers in Artificial Intelligence and Applications, pages 1–20. IOS Press, 2014.

[11] Mehmet Hakan Karaata, Ozgur Sinanoglu, and Bader F. AlBdaiwi. An optimal inherently stabilizing 2-neighborhood crash resilient protocol for secure and reliable routing in hypercube networks. Comput. J., 55(5):578– 589, 2012.

[12] Peter Hor ́ak and Bader F. AlBdaiwi. Non-periodic tilings of 􏰀 n by crosses. Discret. Comput. Geom., 47(1):1–16, 2012.

[13] Peter Hor ́ak and Bader F. AlBdaiwi. Diameter perfect lee codes. IEEE Trans. Inf. Theory, 58(8):5490–5499, 2012.

[14] Bader F. AlBdaiwi, Diptesh Ghosh, and Boris Goldengorin. Data aggrega- tion for p-median problems. J. Comb. Optim., 21(3):348–363, 2011.

[15] Peter Hor ́ak and Bader F. AlBdaiwi. Diameter perfect lee codes. CoRR, abs/1109.3475, 2011.

[16] Ozgur Sinanoglu, Mehmet Hakan Karaata, and Bader F. AlBdaiwi. An inherently stabilizing algorithm for node-to-node routing over all short- est node-disjoint paths in hypercube networks. IEEE Trans. Computers, 59(7):995–999, 2010.

[17] Ludov ́ıt Niepel, Anton Cerny ́, and Bader F. AlBdaiwi. Efficient domination in directed tori and the vizing’s conjecture for directed graphs. Ars Comb., 91, 2009.

[18] Bader F. AlBdaiwi, Boris Goldengorin, and Gerard Sierksma. Equiva- lent instances of the simple plant location problem. Comput. Math. Appl., 57(5):812–820, 2009.

[19] Bader F. AlBdaiwi, Peter Hor ́ak, and Lorenzo Milazzo. Enumerating and decoding perfect linear lee codes. Des. Codes Cryptogr., 52(2):155–162, 2009.

[20] Madhusudhanan Anantha, Bella Bose, and Bader F. AlBdaiwi. Mixed- radix gray codes in lee metric. IEEE Trans. Computers, 56(10):1297–1307, 2007.

[21] Madhusudhanan Anantha, Bella Bose, and Bader F. AlBdaiwi. Mixed radix gray codes and edge disjoint hamiltonian cycles in toroidal networks. In IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, June 24-29, 2007, pages 1991–1995. IEEE, 2007.

[22] Peter Hor ́ak and Bader F. AlBdaiwi. Fast decoding of quasi-perfect lee distance codes. Des. Codes Cryptogr., 40(3):357–367, 2006.

[23] Bader F. AlBdaiwi and Bella Bose. Quasi-perfect resource placements for two-dimensional toroidal networks. J. Parallel Distributed Comput., 65(7):815–831, 2005.

[24] Myung M. Bae, Bader F. AlBdaiwi, and Bella Bose. Edge-disjoint hamilto- nian cycles in two-dimensional torus. Int. J. Math. Mathematical Sciences, 2004(25):1299–1308, 2004.

[25] Bader F. AlBdaiwi and Marilynn L. Livingston. Perfect distance-d place- ments in 2d toroidal networks. The Journal of Supercomputing, 29(1):45– 57, 2004.

[26] Bader F. AlBdaiwi and Bella Bose. On resource placements in 3d tori. J. Parallel Distributed Comput., 63(9):838–845, 2003.

[27] Bader F. AlBdaiwi and Bella Bose. Quasi-perfect lee distance codes. IEEE Trans. Inf. Theory, 49(6):1535–1539, 2003.