MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 20 documents:

  1. Every DFS tree of a 3-connected graph contains a contractible edge
    Amr Elmasry, Kurt Mehlhorn, and Jens M. Schmidt
    Journal of Graph Theory 72 (1): 112-121, 2013
  2. An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
    Amr Elmasry, Kurt Mehlhorn, and Jens M. Schmidt
    Algorithmica 62 (3): 754-766, 2012
  3. Finding Simplices containing the Origin in Two and Three Dimensions
    Khaled Elbassioni, Amr Elmasry, and Kazuhisa Makino
    International Journal of Computational Geometry & Applications 21 (5): 495-506, 2011
  4. On the Approximability of the Maximum Interval Constrained Coloring Problem
    Stefan Canzar, Khaled Elbassioni, Amr Elmasry, and Rajiv Raman
    In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, Jeju Island, Korea, 2010, 168-179
  5. Pairing heaps, scrambled pairing and square-root trees
    Amr Elmasry
    International Journal of Computer Mathematics 87 (14): 3096-3110, 2010
  6. Strictly-regular number system and data structures
    Amr Elmasry, Claus Jensen, and Jyrki Katajainen
    In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, 2010, 26-37
  7. The longest almost-increasing subsequence
    Amr Elmasry
    Information Processing Letters 110 (16): 655-658, 2010
  8. The Magic of a Number System
    Amr Elmasry, Claus Jensen, and Jyrki Katajainen
    In: Fun with Algorithms : 5th International Conference, FUN 2010, Ischia, 2010, 156-165
  9. An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
    Amr Elmasry, Kurt Mehlhorn, and Jens M. Schmidt
    Algorithmica Online First: 1-13, 2010
  10. Computing the subset partial order for dense families of sets
    Amr Elmasry
    Information Processing Letters 109 (18): 1082-1086, 2009
  11. Enumerating Trichromatic Triangles Containing the Origin in Linear Time
    Amr Elmasry and Madhusudan Manjunath
    In: Japanese Conference in Computational Geometry and Graphs 2009, Kanazawa, Japan, 2009, 101-103
  12. Pairing Heaps with O(log log n) decrease Cost
    Amr Elmasry
    In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, USA, 2009, 471-476
    [PDF: Download: paper.pdf]
  13. Indexing Schemes for Multi-dimensional Moving Objects
    Khaled Elbassioni, Amr Elmasry, and Ibrahim Kamel
    In: Encyclopedia of GIS, 2008, 523-529
  14. Inversion-Sensitive Sorting Algorithms in Practice
    Amr Elmasry and Abdelrahman Hammad
    ACM Journal of Experimental Algorithmics 13 (1): 1-18, 2008
    [PDF: Download: ACM-final.pdf]
  15. Multipartite Priority Queues
    Amr Elmasry, Claus Jensen, and Jyrki Katajainen
    ACM Transactions on Algorithms 5 (1): 1-19, 2008
    [PDF: Download: ACM-final.pdf]
  16. Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
    Amr Elmasry, Claus Jensen, and Jyrki Katajainen
    Computing 83 (4): 193-204, 2008
    [PDF: Download: fulltext.pdf] [PDF: Download: ATTUSH4Y.pdf]
  17. Violation Heaps: A Better Substitute for Fibonacci Heaps
    Amr Elmasry(Eds.)
    Amr Elmasry
    CoRR, http://arxiv.org/abs/0812.2851, CoRR abs/0812.2851, Research Report
    [PDF: Download: paper.pdf]
  18. An Efficient Indexing Scheme for Multi-dimensional Moving Objects
    Khaled M. Elbassioni, Amr Elmasry, and Ibrahim Kamel
    In: Database Theory - ICDT 2003, 9th International Conference, Siena, Italy, 2003, 425-439
    [PDF: Download: ICDT03.pdf]
  19. An Indexing Method for Answering Queries on Moving Objects
    Khaled M. Elbassioni, Amr Elmasry, and Ibrahim Kamel
    Distributed and Parallel Databases 17 (3): 215-249, 2005
  20. Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
    Amr Elmasry and Khaled M. Elbassioni
    In: 17th Canadian Conference on Computational Geometry (CCCG'05), Windsor, Canada, 2005, 248-251