default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail J. Atallah
- > Home > Persons > Mikhail J. Atallah
Publications
- 2003
[j67]Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu:
Efficient Parallel Algorithms for Planar st-Graphs. Algorithmica 35(3): 194-215 (2003)- 2001
- [j62]Mikhail J. Atallah, Danny Z. Chen:
On Connecting Red and Blue Rectilinear Polygonal Obstacles with Nonintersecting Monotone Rectilinear Paths. Int. J. Comput. Geom. Appl. 11(4): 373-400 (2001) - 2000
- [j59]Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems. Algorithmica 26(2): 263-289 (2000) - [p2]Mikhail J. Atallah, Danny Z. Chen:
Deterministic Parallel Computational Geometry. Handbook of Computational Geometry 2000: 155-200 - 1999
- [j56]Mikhail J. Atallah, Danny Z. Chen, Kevin S. Klenk:
Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems. Parallel Process. Lett. 9(4): 511-520 (1999) - 1998
- [c35]Mikhail J. Atallah, Danny Z. Chen:
Parallel Geometric Algorithms in Coarse-Grain Network Models. COCOON 1998: 55-64 - 1997
- [c34]Mikhail J. Atallah, Danny Z. Chen, Kevin S. Klenk:
Parallel algorithms for longest increasing chains in the plane and related problems. CCCG 1997 - 1996
- [c30]Mikhail J. Atallah, Danny Z. Chen:
Applications of a Numbering Scheme for Polygonal Obstacles in the Plane. ISAAC 1996: 1-24 - 1995
- [j54]Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. Algorithmica 14(5): 429-441 (1995) - [j52]Mikhail J. Atallah, Danny Z. Chen:
Computing the all-pairs longest chains in the plane. Int. J. Comput. Geom. Appl. 5(3): 257-271 (1995) - [j51]Mikhail J. Atallah, Danny Z. Chen:
Optimal Parallel Hypercube Algorithms for Polygon Problems. IEEE Trans. Computers 44(7): 914-922 (1995) - [c28]Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
Parallel algorithms for maximum matching in interval graphs. IPPS 1995: 84-92 - 1993
- [j46]Mikhail J. Atallah, Danny Z. Chen:
On Parallel Rectilinear Obstacle- Avoiding Paths. Comput. Geom. 3: 307-313 (1993) - [c24]Mikhail J. Atallah, Danny Z. Chen:
On Parallel Rectilinear Obstacle-avoiding Paths. CCCG 1993: 210-215 - [c23]Mikhail J. Atallah, Danny Z. Chen, D. T. Lee:
An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. ESA 1993: 13-24 - [c22]Mikhail J. Atallah, Danny Z. Chen:
Optimal Parallel Hypercube Algorithms for Polygon Problems. SPDP 1993: 208-215 - [c21]Mikhail J. Atallah, Danny Z. Chen:
Computing the All-Pairs Longest Chain in the Plane. WADS 1993: 1-13 - 1991
- [j33]Mikhail J. Atallah, Danny Z. Chen:
Parallel Rectilinear Shortest Paths with Rectangular Obstacles. Comput. Geom. 1: 79-113 (1991) - [j31]Mikhail J. Atallah, Danny Z. Chen, Hubert Wagener:
An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point. J. ACM 38(3): 516-533 (1991) - 1990
- [c15]Mikhail J. Atallah, Danny Z. Chen:
Parallel Rectilinear Shortest Paths with Rectangular Obstacles. SPAA 1990: 270-279 - 1989
- [j26]Mikhail J. Atallah, Danny Z. Chen:
An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem. Inf. Process. Lett. 32(4): 159-165 (1989) - [c11]Mikhail J. Atallah, Danny Z. Chen:
Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point. SCG 1989: 114-123
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-23 00:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
