default search action
Hassan AbouEisha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [b1]Hassan AbouEisha
, Talha Amin, Igor Chikalov, Shahid Hussain
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library 146, Springer 2019, ISBN 978-3-319-91838-9, pp. 1-268 - 2018
- [j4]Hassan AbouEisha
Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica 80(10): 2799-2817 (2018) - [c10]Hassan AbouEisha
Bisections-Weighted-by-Element-Size-and-Order Algorithm to Optimize Direct Solver Performance on 3D hp-adaptive Grids. ICCS (2) 2018: 760-772 - 2017
- [j3]Hassan AbouEisha
Element Partition Trees For H-Refined Meshes to Optimize Direct Solver Performance. Part I: Dynamic Programming. Int. J. Appl. Math. Comput. Sci. 27(2): 351 (2017) - [c9]Hassan AbouEisha
On Importance of Rows for Decision Tables. IJCRS (1) 2017: 376-383 - 2016
- [j2]Hassan AbouEisha
Decision trees with minimum average depth for sorting eight elements. Discret. Appl. Math. 204: 203-207 (2016) - [c8]Hassan AbouEisha
Hybrid Direct and Iterative Solver with Library of Multi-criteria Optimal Orderings for h Adaptive Finite Element Method Computations. ICCS 2016: 865-874 - [c7]Hassan AbouEisha
A Boundary Property for Upper Domination. IWOCA 2016: 229-240 - [i1]Hassan AbouEisha
Upper Domination: towards a dichotomy through boundary properties. CoRR abs/1609.01510 (2016) - 2015
- [j1]Anna Paszynska
Quasi-Optimal Elimination Trees for 2D Grids with Singularities. Sci. Program. 2015: 303024:1-303024:18 (2015) - [c6]Hassan AbouEisha, Mikhail Ju. Moshkov
Towards Green Multi-frontal Solver for Adaptive Finite Element Method. ICCS 2015: 984-993 - 2014
- [c5]Hassan AbouEisha
A Dichotomy for Upper Domination in Monogenic Classes. COCOA 2014: 258-267 - [c4]Hassan AbouEisha
Finding Optimal Exact Reducts. KDIR 2014: 149-153 - [c3]Hassan AbouEisha
Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids. ICCS 2014: 947-959 - 2013
- [c2]Hassan AbouEisha
An algorithm for reduct cardinality minimization. GrC 2013: 1-3 - [c1]Hassan AbouEisha
An Automatic Way of Finding Robust Elimination Trees for a Multi-frontal Sparse Solver for Radical 2D Hierarchical Meshes. PPAM (2) 2013: 531-540
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-10-07 21:25 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: