default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYazid M. Sharaiha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j14]John E. Beasley
, Mohan Krishnamoorthy, Yazid M. Sharaiha, David Abramson:
Displacement problem and dynamically scheduling aircraft landings. J. Oper. Res. Soc. 55(1): 54-64 (2004)- 2001
- [j13]Mohan Krishnamoorthy, Andreas T. Ernst, Yazid M. Sharaiha:
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree. J. Heuristics 7(6): 587-611 (2001) - 2000
- [b1]Stéphane Marchand-Maillet, Yazid M. Sharaiha:
Binary digital image processing - a discrete approach. Academic Press 2000, ISBN 978-0-12-470505-0, pp. I-XXI, 1-251 - [j12]T.-J. Chang, Nigel Meade, John E. Beasley, Yazid M. Sharaiha:
Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27(13): 1271-1302 (2000) - [j11]John E. Beasley, Mohan Krishnamoorthy, Yazid M. Sharaiha, David Abramson:
Scheduling Aircraft Landings - The Static Case. Transp. Sci. 34(2): 180-197 (2000)
1990 – 1999
- 1999
- [j10]Yazid M. Sharaiha, John E. Beasley:
Foreword. Ann. Oper. Res. 86: 0 (1999) - [j9]Stéphane Marchand-Maillet, Yazid M. Sharaiha:
Euclidean Ordering via Chamfer Distance Calculations. Comput. Vis. Image Underst. 73(3): 404-413 (1999) - 1997
- [j8]Nicos Christofides, H. O. Badra, Yazid M. Sharaiha:
Data structures for topological and geometric operations on networks. Ann. Oper. Res. 71: 259-289 (1997) - [j7]Stéphane Marchand-Maillet, Yazid M. Sharaiha:
Discrete Convexity, Straightness, and the 16-Neighborhood. Comput. Vis. Image Underst. 66(3): 316-329 (1997) - [j6]Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman:
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem. Networks 29(3): 161-171 (1997) - [j5]Stéphane Marchand-Maillet, Yazid M. Sharaiha:
Skeleton location and evaluation based on local digital width in ribbon-like images. Pattern Recognit. 30(11): 1855-1865 (1997) - [c2]Stéphane Marchand-Maillet, Yazid M. Sharaiha:
Topological Errors and Optimal Chamfer Distance Coefficients. DGCI 1997: 199-210 - 1996
- [c1]Stéphane Marchand-Maillet, Yazid M. Sharaiha:
A minimum spanning tree approach to line image analysis. ICPR 1996: 225-230 - 1995
- [j4]Yazid M. Sharaiha, Philippe Garat:
Digital straightness and the skeleton property. Pattern Recognit. Lett. 16(4): 417-423 (1995) - 1994
- [j3]Yazid M. Sharaiha, Nicos Christofides:
A graph-theoretic approach to distance transformations. Pattern Recognit. Lett. 15(10): 1035-1041 (1994) - 1993
- [j2]Yazid M. Sharaiha, Nicos Christofides:
An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs. CVGIP Graph. Model. Image Process. 55(5): 397-407 (1993) - [j1]Yazid M. Sharaiha, Philippe Garat:
A compact chord property for digital arcs. Pattern Recognit. 26(5): 799-803 (1993)
Coauthor Index
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-04-24 23:07 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:
