Ehab S. Elmallah

Available identifiers

Publication	Date of Publication	Type
Policy expressions and the bottom-up design of computing policies	2021-01-15	Paper
The Implication Problem of Computing Policies	2020-01-14	Paper
Optimal Dispersal of Certificate Chains	2005-08-17	Paper
Fast permutation routing in a class of interconnection networks	2002-12-17	Paper
Enhancing the consecutive cuts bound for network reliability	2001-12-12	Paper
https://portal.mardi4nfdi.de/entity/Q4515754	2000-11-23	Paper
Polygon Graph Recognition	1998-02-09	Paper
https://portal.mardi4nfdi.de/entity/Q5284020	1997-03-09	Paper
Multicommodity flows in simple multistage networks	1995-09-27	Paper
Independence and domination in polygon graphs	1993-11-28	Paper
Reliable assignments of processors to tasks and factoring on matroids	1993-10-24	Paper
Series-parallel subgraphs of planar graphs	1993-01-17	Paper
Algorithms for K-terminal reliability problems with node failures	1993-01-16	Paper
On two dual classes of planar graphs	1990-01-01	Paper
The complexity of some edge deletion problems	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3832583	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3821601	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3818350	1988-01-01	Paper
Optimum Communication Spanning Trees in Series-Parallel Networks	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3026711	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3676158	1984-01-01	Paper

This page was built for person: Ehab S. Elmallah