default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBader F. AlBdaiwi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Zaid A. Hussain, Fawaz Alazemi, Bader F. AlBdaiwi:
Completely independent spanning trees in Eisenstein-Jacobi networks. J. Supercomput. 80(11): 15105-15121 (2024)- 2022
- [j19]Zaid A. Hussain
, Hosam M. F. AboElFotoh, Bader F. AlBdaiwi:
Independent spanning trees in Eisenstein-Jacobi networks. J. Supercomput. 78(10): 12114-12135 (2022) - 2021
- [i7]Zaid A. Hussain, Hosam M. F. AboElFotoh, Bader F. AlBdaiwi:
Independent Spanning Trees in Eisenstein-Jacobi Networks. CoRR abs/2101.09797 (2021)
2010 – 2019
- 2017
- [j18]Zaid A. Hussain, Bader F. AlBdaiwi, Anton Cerný:
Node-independent spanning trees in Gaussian networks. J. Parallel Distributed Comput. 109: 324-332 (2017) - [j17]Bader F. AlBdaiwi, Hosam M. F. AboElFotoh:
A GPU-based genetic algorithm for the p-median problem. J. Supercomput. 73(10): 4221-4244 (2017) - [i6]Zaid A. Hussain, Bader F. AlBdaiwi, Anton Cerný:
Node-Independent Spanning Trees in Gaussian Networks. CoRR abs/1701.02991 (2017) - 2016
- [j16]Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred:
Edge-disjoint node-independent spanning trees in dense Gaussian networks. J. Supercomput. 72(12): 4718-4736 (2016) - [i5]Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred:
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks. CoRR abs/1601.06915 (2016) - [i4]Qadha'a AlEnezi, Hosam M. F. AboElFotoh, Bader F. AlBdaiwi, Mohammad Ali AlMulla:
Heuristics for the Variable Sized Bin Packing Problem Using a Hybrid P-System and CUDA Architecture. CoRR abs/1602.08735 (2016) - [i3]Bader F. AlBdaiwi:
On the Number of Cycles in a Graph. CoRR abs/1603.01807 (2016) - [i2]Bader F. AlBdaiwi, Hosam M. F. AboElFotoh:
A GPU-Based Genetic Algorithm for the P-Median Problem. CoRR abs/1610.10061 (2016) - 2015
- [c3]Bader F. AlBdaiwi, Bernhard Thalheim:
Revisiting the Definition of the Relational Tuple Calculus. ADBIS (Short Papers and Workshops) 2015: 3-11 - 2014
- [c2]Bader F. AlBdaiwi, René Noack, Bernhard Thalheim:
Pattern-Based Conceptual Data Modelling. EJC 2014: 1-20 - 2012
- [j15]Mehmet Hakan Karaata, Ozgur Sinanoglu, 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) - [j14]Peter Horák, Bader F. AlBdaiwi:
Non-periodic Tilings of ℝ n by Crosses. Discret. Comput. Geom. 47(1): 1-16 (2012) - [j13]Peter Horák, Bader F. AlBdaiwi:
Diameter Perfect Lee Codes. IEEE Trans. Inf. Theory 58(8): 5490-5499 (2012) - 2011
- [j12]Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin:
Data aggregation for p-median problems. J. Comb. Optim. 21(3): 348-363 (2011) - [i1]Peter Horák, Bader F. AlBdaiwi:
Diameter Perfect Lee Codes. CoRR abs/1109.3475 (2011) - 2010
- [j11]Ozgur Sinanoglu, Mehmet Hakan Karaata, Bader F. AlBdaiwi:
An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks. IEEE Trans. Computers 59(7): 995-999 (2010)
2000 – 2009
- 2009
- [j10]Ludovít Niepel, Anton Cerný, Bader F. AlBdaiwi:
Efficient domination in directed tori and the Vizing's conjecture for directed graphs. Ars Comb. 91 (2009) - [j9]Bader F. AlBdaiwi, Boris Goldengorin, Gerard Sierksma:
Equivalent instances of the simple plant location problem. Comput. Math. Appl. 57(5): 812-820 (2009) - [j8]Bader F. AlBdaiwi, Peter Horák, Lorenzo Milazzo:
Enumerating and decoding perfect linear Lee codes. Des. Codes Cryptogr. 52(2): 155-162 (2009) - 2007
- [j7]Madhusudhanan Anantha, Bella Bose, Bader F. AlBdaiwi:
Mixed-Radix Gray Codes in Lee Metric. IEEE Trans. Computers 56(10): 1297-1307 (2007) - [c1]Madhusudhanan Anantha, Bella Bose, Bader F. AlBdaiwi:
Mixed Radix Gray Codes and Edge Disjoint Hamiltonian Cycles in Toroidal Networks. ISIT 2007: 1991-1995 - 2006
- [j6]Peter Horák, Bader F. AlBdaiwi:
Fast decoding of quasi-perfect Lee distance codes. Des. Codes Cryptogr. 40(3): 357-367 (2006) - 2005
- [j5]Bader F. AlBdaiwi, Bella Bose:
Quasi-perfect resource placements for two-dimensional toroidal networks. J. Parallel Distributed Comput. 65(7): 815-831 (2005) - 2004
- [j4]Myung M. Bae, Bader F. AlBdaiwi, Bella Bose:
Edge-disjoint Hamiltonian cycles in two-dimensional torus. Int. J. Math. Math. Sci. 2004(25): 1299-1308 (2004) - [j3]Bader F. AlBdaiwi, Marilynn L. Livingston:
Perfect Distance-d Placements in 2D Toroidal Networks. J. Supercomput. 29(1): 45-57 (2004) - 2003
- [j2]Bader F. AlBdaiwi, Bella Bose:
On resource placements in 3D tori. J. Parallel Distributed Comput. 63(9): 838-845 (2003) - [j1]Bader F. AlBdaiwi, Bella Bose:
Quasi-perfect Lee distance codes. IEEE Trans. Inf. Theory 49(6): 1535-1539 (2003)
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-07-09 22:02 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:
