Imran Rauf - Google Scholar

Get my own profile

Cited by

	All	Since 2019
Citations	130	34
h-index	6	4
i10-index	5	1

0

16

8

200720082009201020112012201320142015201620172018201920202021202220231 5 3 1 7 10 10 11 9 8 16 11 12 8 4 5 5

Co-authors

Matthias HagenFriedrich-Schiller-Universität JenaVerified email at uni-jena.de
Sebastian BöckerProfessor für Bioinformatik, FSU JenaVerified email at uni-jena.de
Stefan FunkeUniversität Stuttgart, GermanyVerified email at fmi.uni-stuttgart.de
Saurabh RayNYU Abu DhabiVerified email at nyu.edu
Khaled ElbassioniMasdar Institute, Khalifa University of Science and Technology

Imran Rauf

Imran Rauf

IBA, Karachi

Verified email at iba.edu.pk - Homepage

Algorithms enumeration problems network flows


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Finding maximum colorful subtrees in practice I Rauf, F Rasche, F Nicolas, S Böcker Journal of Computational Biology 20 (4), 311-321, 2013	44	2013
Information brokerage via location-free double rulings S Funke, I Rauf International Conference on Ad-Hoc Networks and Wireless, 87-100, 2007	17	2007
On the readability of monotone boolean formulae K Elbassioni, K Makino, I Rauf Journal of combinatorial optimization 22 (3), 293-304, 2011	14	2011
Output-sensitive algorithms for enumerating minimal transversals for some geometric hypergraphs K Elbassioni, K Makino, I Rauf European Symposium on Algorithms, 143-154, 2009	12	2009
Some fixed-parameter tractable classes of hypergraph duality and related problems K Elbassioni, M Hagen, I Rauf Parameterized and Exact Computation: Third International Workshop, IWPEC …, 2008	12	2008
A lower bound for the HBC transversal hypergraph generation K Elbassioni, M Hagen, I Rauf Fundamenta Informaticae 130 (4), 409-414, 2014	8	2014
Earliest arrival flows with multiple sources I Rauf Master's thesis, Universität des Saarlandes, 2005	6	2005
Polynomially solvable cases of hypergraph transversal and related problems I Rauf	5	2011
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs K Elbassioni, I Rauf, S Ray Theoretical Computer Science 767, 26-33, 2019	4	2019
Polynomial-time dualization of r-exact hypergraphs with applications in geometry K Elbassioni, I Rauf Discrete mathematics 310 (17-18), 2356-2363, 2010	4	2010
Enumerating Minimal Transversals of Geometric Hypergraphs. KM Elbassioni, I Rauf, S Ray CCCG, 2011	3	2011
Proceedings of Algorithms-ESA 2009, 17th Annual European Symposium M Caroli, M Teillaud Springer, Copenhagen, Denmark, 2009	1	2009
of Proceedings: Computing and Combinatorics, 15th Annual International Conference (COCOON 2009) K Elbassioni, K Makino, I Rauf Springer, 2009		2009
of Proceedings: Parameterized and Exact Computation: Third International Workshop, IWPEC 2008 K Elbassioni, M Hagen, I Rauf Springer, 2008		2008
Some fixed-parameter tractable classes of Dual and related problems K Elbassioni, M Hagen, I Rauf

The system can't perform the operation now. Try again later.

Articles 1–15