Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 17 matches
- 2020
- Andreas D. M. Gunawan, Jeyaram Rathin, Louxin Zhang:
Counting and enumerating galled networks. Discret. Appl. Math. 283: 644-654 (2020) - 2019
- Andreas D. M. Gunawan, Hongwei Yan, Louxin Zhang:
Compression of Phylogenetic Networks and Algorithm for the Tree Containment Problem. J. Comput. Biol. 26(3): 285-294 (2019) - 2018
- Hongwei Yan, Andreas D. M. Gunawan, Louxin Zhang:
S-Cluster++: a fast program for solving the cluster containment problem for phylogenetic networks. Bioinform. 34(17): i680-i686 (2018) - Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discret. Appl. Math. 246: 62-79 (2018) - Andreas D. M. Gunawan:
Solving the Tree Containment Problem for Reticulation-Visible Networks in Linear Time. AlCoB 2018: 24-36 - Andreas D. M. Gunawan, Bingxin Lu, Louxin Zhang:
Fast Methods for Solving the Cluster Containment Problem for Phylogenetic Networks. CoRR abs/1801.04498 (2018) - Andreas D. M. Gunawan, Hongwei Yan, Louxin Zhang:
The compressions of reticulation-visible networks are tree-child. CoRR abs/1806.07625 (2018) - 2017
- Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
A decomposition theorem and two algorithms for reticulation-visible networks. Inf. Comput. 252: 161-175 (2017) - 2016
- Andreas D. M. Gunawan, Bingxin Lu, Louxin Zhang:
A program for verification of phylogenetic network models. Bioinform. 32(17): 503-510 (2016) - Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
Locating a Tree in a Reticulation-Visible Network in Cubic Time. RECOMB 2016: 266 - Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
Locating a Phylogenetic Tree in a Reticulation-Visible Network in Quadratic Time. CoRR abs/1603.08655 (2016) - 2015
- Andreas Dwi Maryanto Gunawan, Khee Meng Koh:
The Nk-valued Roman Domination and Its Boundaries. Electron. Notes Discret. Math. 48: 95-102 (2015) - Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. IWOCA 2015: 197-208 - Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Locating a Tree in a Phylogenetic Network in Quadratic Time. RECOMB 2015: 96-107 - Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Locating a Tree in a Phylogenetic Network in Quadratic Time. CoRR abs/1502.03379 (2015) - Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
Stability Implies Computational Tractability: Locating a Tree in a Stable Network is Easy. CoRR abs/1507.02119 (2015) - Andreas D. M. Gunawan, Louxin Zhang:
Bounding the Size of a Network Defined By Visibility Property. CoRR abs/1510.00115 (2015)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-09 23:47 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint