Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMd. Zamilur Rahman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Sudiksha Khanduja, Aayushi Srivastava, Md. Zamilur Rahman, Asish Mukhopadhyay:
Generating Weakly Chordal Graphs from Arbitrary Graphs. Trans. Comput. Sci. 39: 71-84 (2022)- 2021
- [j5]Md. Zamilur Rahman, Asish Mukhopadhyay:
Semi-dynamic algorithms for strongly chordal graphs. Discret. Math. Algorithms Appl. 13(4): 2150049:1-2150049:42 (2021) - [j4]Asish Mukhopadhyay, Md. Zamilur Rahman:
Algorithms for Generating Strongly Chordal Graphs. Trans. Comput. Sci. 38: 54-75 (2021) - 2020
- [j3]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
A separator-based method for generating weakly chordal graphs. Discret. Math. Algorithms Appl. 12(4): 2050039:1-2050039:16 (2020) - [i6]Md. Zamilur Rahman, Asish Mukhopadhyay:
Semi-dynamic Algorithms for Strongly Chordal Graphs. CoRR abs/2002.07207 (2020) - [i5]Sudiksha Khanduja, Aayushi Srivastava, Md. Zamilur Rahman, Asish Mukhopadhyay:
Generating Weakly Chordal Graphs from Arbitrary Graphs. CoRR abs/2003.13786 (2020)
2010 – 2019
- 2019
- [j2]Kishore Kumar Varadharajan Kannan, Pijus Kumar Sarker, Amangeldy Turdaliev, Asish Mukhopadhyay, Md. Zamilur Rahman:
A Study of Three Different Approaches to Point Placement on a Line in an Inexact Model. Trans. Comput. Sci. 34: 44-63 (2019) - [i4]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
A separator-based method for generating weakly chordal graphs. CoRR abs/1906.01056 (2019) - [i3]Md. Zamilur Rahman, Asish Mukhopadhyay:
Strongly Chordal Graph Generation using Intersection Graph Characterisation. CoRR abs/1909.02545 (2019) - 2018
- [j1]Md. Zamilur Rahman, Udayamoorthy Navaneetha Krishnan, Cory Jeane, Asish Mukhopadhyay, Yash P. Aneja:
A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane. Trans. Comput. Sci. 33: 97-114 (2018) - [c3]Udayamoorthy Navaneetha Krishnan, Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
Molecular Structure Determination in the Phillips' Model: A Degree of Freedom Approach. ICCSA (2) 2018: 412-424 - [i2]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
An Algorithm for Generating Strongly Chordal Graphs. CoRR abs/1804.09019 (2018) - 2017
- [c2]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash Pal Aneja, Cory Jean:
A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane. ICCSA (2) 2017: 494-508 - [i1]Yash P. Aneja, Asish Mukhopadhyay, Md. Zamilur Rahman:
A greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem. CoRR abs/1705.09643 (2017) - 2014
- [c1]Md. Zamilur Rahman, Jacqueline E. Rice:
Templates for Positive and Negative Control Toffoli Networks. RC 2014: 125-136
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 2023-09-08 09:59 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:
