default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancis Suraweera
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j13]Vladimir Estivill-Castro
, Apichat Heednacram, Francis Suraweera:
Fpt-Algorithms for Minimum-Bends Tours. Int. J. Comput. Geom. Appl. 21(2): 189-213 (2011)- 2010
- [j12]Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera:
NP-completeness and FPT Results for Rectilinear Covering Problems. J. Univers. Comput. Sci. 16(5): 622-652 (2010) - [c6]Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera:
The Rectilinear k-Bends TSP. COCOON 2010: 264-277
2000 – 2009
- 2009
- [j11]Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera:
Reduction rules deliver efficient FPT-algorithms for covering points with lines. ACM J. Exp. Algorithmics 14 (2009) - 2003
- [c5]Vladimir Estivill-Castro, Darren Lattin, Francis Suraweera, Vasanthe Vithanage:
Tracking bees - a 3D, outdoor small object environment. ICIP (3) 2003: 1021-1024 - 2002
- [j10]Francis Suraweera:
Enhancing the quality of learning and understanding of first-year mathematics for computer science related majors. ACM SIGCSE Bull. 34(4): 117-120 (2002) - 2001
- [j9]Francis Suraweera:
Getting the most from an algorithms design course: a personal experience. ACM SIGCSE Bull. 33(4): 71-74 (2001) - 2000
- [j8]Sven Venema, Hong Shen, Francis Suraweera:
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths. Parallel Process. Lett. 10(1): 51-58 (2000)
1990 – 1999
- 1998
- [c4]Sven Venema, Hong Shen, Francis Suraweera:
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths. IPPS/SPDP Workshops 1998: 464-471 - 1996
- [j7]Francis Suraweera, Prabir Bhattacharya:
A Parallel Algorithm to Compute the Supremum of Max-Min Powers. Comput. Artif. Intell. 15(6): 579-587 (1996) - [j6]Sven Venema, Hong Shen, Francis Suraweera:
NC Algorithms for the Single Most Vital Edge Problem with Respect to Shortest Path. Inf. Process. Lett. 60(5): 243-248 (1996) - 1994
- [c3]Pushkar Piggott, Francis Suraweera:
Encoding Graphs for Genetic Algorithms: An Investigation Using the Minimum Spanning Tree Problem. Evo Workshops 1994: 305-314 - 1993
- [j5]Francis Suraweera, Prabir Bhattacharya:
An O(log m) Parallel Algorithm for the Minimum Spanning Tree Problem. Inf. Process. Lett. 45(3): 159-163 (1993) - [c2]Huade Li, Francis Suraweera:
Far Field Path Planning for Rotorcraft NOE Missions in a Mountainous Region. ICCI 1993: 65-70 - 1992
- [j4]Francis Suraweera, Prabir Bhattacharya:
A parallel cost-optimal algorithm to compute the supremum of max-min powers. Parallel Comput. 18(5): 551-556 (1992) - [c1]Francis Suraweera, Prabir Bhattacharya:
A Parallel Algorithm for the Minimum Spanning Tree on an SIMD Machine. ACM Conference on Computer Science 1992: 473-476 - 1991
- [j3]Prabir Bhattacharya, Francis Suraweera:
An algorithm to compute the supremum of max-min powers and a property of fuzzy graphs. Pattern Recognit. Lett. 12(7): 413-420 (1991) - 1990
- [j2]Louis Sanzogn, Francis Suraweera, Geoffrey I. Webb:
Improving the efficiency of rule-based expert systems by rule activation. J. Exp. Theor. Artif. Intell. 2(4): 369-380 (1990)
1980 – 1989
- 1988
- [j1]Francis Suraweera, J. M. Al-Anzy:
Analysis of a Modified Address Calculation Sorting Algorithm. Comput. J. 31(6): 561-563 (1988)
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 22:57 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:
