#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2013

2017

- This year (3)
- Last 5 years (13)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is NP-hard for general graphs and in many restricted graph families. In the present paper, we study the computational complexity of this problem in monogenic classes of graphs (i.e. classes… (More)

- Anna Paszynska, Maciej Paszynski, +9 authors Keshav Pingali
- Scientific Programming
- 2015

1 Jagiellonian University, 31007 Krakow, Poland 2AGH University of Science and Technology, 30059 Krakow, Poland 3Applied Mathematics & Computational Science, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia 4Earth Science & Engineering and Center for Numerical PorousMedia, King Abdullah University of Science and… (More)

An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard, but can be solved in polynomial time in some restricted graph classes, such as P4-free graphs or 2K2-free graphs. For classes defined by finitely many forbidden induced… (More)

- Hassan AbouEisha, Mohammed Al Farhan, Igor Chikalov, Mikhail Ju. Moshkov
- 2013 IEEE International Conference on Granular…
- 2013

This is devoted to the consideration of a new algorithm for reduct cardinality minimization. This algorithm transforms the initial table to a decision table of a special kind, simplify this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. Results of computer experiments with decision tables from UCI ML… (More)

- Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
- Algorithmica
- 2017

An upper dominating set in a graph is a minimal dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in finitely defined classes of graphs and conjecture that the problem admits a complexity dichotomy in this family. A helpful tool to study the complexity of an… (More)

- Hassan AbouEisha, Mohammad Azad, Mikhail Ju. Moshkov
- IJCRS
- 2017

- Hassan AbouEisha, Victor M. Calo, +4 authors Marcin Skotniczny
- Applied Mathematics and Computer Science
- 2017

- Hassan AbouEisha, Konrad Jopek, +5 authors Keshav Pingali
- ICCS
- 2016

In this paper we present a multi-criteria optimization of element partition trees and resulting orderings for multi-frontal solver algorithms executed for two dimensional h adaptive finite element method. In particular, the problem of optimal ordering of elimination of rows in the sparse matrices resulting from adaptive finite element method computations is… (More)