Entries of Elbassioni, Khaled on the publication server

Blažević, Mislav, Canzar, Stefan, Elbassioni, Khaled and Matijević, Domagoj (2024) Anti Tai mapping for unordered labeled trees. Information Processing Letters 185, p. 106454. Fulltext not available.

Do, Van Hoan, Elbassioni, Khaled and Canzar, Stefan (2020) Sphetcher: Spherical Thresholding Improves Sketching of Single-Cell Transcriptomic Heterogeneity. iScience 23 (6), p. 101126.

Canzar, Stefan, Elbassioni, Khaled, Elmasry, Amr and Raman, Rajiv (2018) On the approximability of the maximum interval constrained coloring problem. Discrete Optimization 27, pp. 57-72. Fulltext not available.

Canzar, Stefan, Elbassioni, Khaled, Jones, Mitchell and Mestre, Julián (2016) Resolving Conflicting Predictions from Multimapping Reads. Journal of Computational Biology 23 (3), pp. 203-217. Fulltext not available.

Canzar, Stefan, Elbassioni, Khaled, Klau, Gunnar W. and Mestre, Julián (2015) On Tree-Constrained Matchings and Generalizations. Algorithmica 71 (1), pp. 98-119. Fulltext not available.

Canzar, Stefan, Elbassioni, Khaled and Mestre, Julián (2013) A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. In: Blelloch, Guy and Mellon, Carnegie, (eds.) 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, SIAM, Philadelphia, Pennsylvania, pp. 23-33. ISBN 978-0-898719-31-4, 978-1-61197-290-0. Fulltext not available.

Canzar, Stefan, Elbassioni, Khaled and Mestre, Julián (2013) A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem. ACM Journal of Experimental Algorithmics 18, 2.1-2.19. Fulltext not available.

Canzar, Stefan, El-Kebir, Mohammed, Pool, René, Elbassioni, Khaled, Malde, Alpeshkumar K., Mark, Alan E., Geerke, Daan P., Stougie, Leen and Klau, Gunnar W. (2013) Charge Group Partitioning in Biomolecular Simulation. Journal of Computational Biology 20 (3), pp. 188-198. Fulltext not available.

Canzar, Stefan, El-Kebir, Mohammed, Pool, René, Elbassioni, Khaled, Malde, Alpesh K., Mark, Alan E., Geerke, Daan P., Stougie, Leen and Klau, Gunnar W. (2012) Charge Group Partitioning in Biomolecular Simulation. In: Chor, Benny, (ed.) Research in Computational Molecular Biology: 16th Annual International Conference, RECOMB 2012, Barcelona, Spain, April 21-24, 2012. Proceedings. Lecture Notes in Computer Science, 7262. Springer, Berlin, pp. 29-43. ISBN 978-3-642-29626-0, 978-3-642-29627-7. Fulltext not available.

Althaus, Ernst, Canzar, Stefan, Elbassioni, Khaled, Karrenbauer, Andreas and Mestre, Julián (2011) Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61 (2), pp. 342-361. Fulltext not available.

Canzar, Stefan, Elbassioni, Khaled, Klau, Gunnar W. and Mestre, Julián (2011) On Tree-Constrained Matchings and Generalizations. In: Aceto, Luca and Henzinger, Monika and Sgall, Jiří, (eds.) Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011. Proceedings, Part I. Lecture Notes in Computer Science, 6755. Springer, Berlin, pp. 98-109. ISBN 978-3-642-22005-0, 978-3-642-22006-7. Fulltext not available.

Canzar, Stefan, Elbassioni, Khaled, Elmasry, Amr and Raman, Rajiv (2010) On the Approximability of the Maximum Interval Constrained Coloring Problem. In: Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo, (eds.) Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II. Lecture Notes in Computer Science, 6507. Springer, Berlin, pp. 168-179. ISBN 978-3-642-17513-8, 978-3-642-17514-5. Fulltext not available.

Althaus, Ernst, Canzar, Stefan, Elbassioni, Khaled, Karrenbauer, Andreas and Mestre, Julián (2008) Approximating the Interval Constrained Coloring Problem. In: Gudmundsson, Joachim, (ed.) Algorithm Theory – SWAT 2008. Lecture Notes in Computer Science, 5124. Springer, Berlin, pp. 210-221. ISBN 978-3-540-69900-2, 978-3-540-69903-3. Fulltext not available.