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
no matches
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 90 matches
- 2023
- Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
A duality based 2-approximation algorithm for maximum agreement forest. Math. Program. 198(1): 811-853 (2023) - 2022
- Magnus Bordewich, Simone Linz, Megan Owen, Katherine St. John, Charles Semple, Kristina Wicke:
On the Maximum Agreement Subtree Conjecture for Balanced Trees. SIAM J. Discret. Math. 36(1): 336-354 (2022) - 2021
- Biing-Feng Wang, Krister M. Swenson:
A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees. IEEE ACM Trans. Comput. Biol. Bioinform. 18(2): 416-430 (2021) - 2020
- Alexey Markin:
On the extremal maximum agreement subtree problem. Discret. Appl. Math. 285: 612-620 (2020) - Pasin Manurangsi:
Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem). SODA 2020: 62-81 - 2019
- Pratik Misra, Seth Sullivant:
Bounds on the Expected Size of the Maximum Agreement Subtree for a Given Tree Shape. SIAM J. Discret. Math. 33(4): 2316-2325 (2019) - Pasin Manurangsi:
Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem). CoRR abs/1910.11850 (2019) - 2018
- Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees. J. Comput. Syst. Sci. 97: 28-44 (2018) - Dongrui Wu, Vernon J. Lawhern, Stephen M. Gordon, Brent J. Lance, Chin-Teng Lin:
Agreement Rate Initialized Maximum Likelihood Estimator for Ensemble Classifier Aggregation and Its Application in Brain-Computer Interface. CoRR abs/1805.04740 (2018) - Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. CoRR abs/1811.05916 (2018) - Alexey Markin:
On the Extremal Maximum Agreement Subtree Problem. CoRR abs/1812.06951 (2018) - 2017
- Zhijiang Li, Norbert Zeh:
Computing Maximum Agreement Forests without Cluster Partitioning is Folly. ESA 2017: 56:1-56:14 - Jonathan Eckstein, Noam Goldberg, Ai Kagawa:
Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement. ICML 2017: 1059-1067 - Mengya Cai, Y. Lin, C. L. Liu, C. L. Ji, Wen-Jun Zhang:
A maximum agreement approach to information fusion. ICC 2017: 125:1-125:4 - 2016
- Jianer Chen, Feng Shi, Jianxin Wang:
Approximating Maximum Agreement Forest on Multiple Binary Trees. Algorithmica 76(4): 867-889 (2016) - Chris Whidden, Robert G. Beiko, Norbert Zeh:
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees. Algorithmica 74(3): 1019-1054 (2016) - Feng Shi, Jianxin Wang, Yufei Yang, Qilong Feng, Weilong Li, Jianer Chen:
A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. Sci. China Inf. Sci. 59(1): 1-14 (2016) - Feng Shi, Qilong Feng, Jie You, Jianxin Wang:
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees. J. Comb. Optim. 32(1): 111-143 (2016) - Frans Schalekamp, Anke van Zuylen, Suzanne van der Ster:
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. ICALP 2016: 70:1-70:14 - Dongrui Wu, Vernon J. Lawhern, Stephen M. Gordon, Brent J. Lance, Chin-Teng Lin:
Agreement rate initialized maximum likelihood estimator for ensemble classifier aggregation and its application in brain-computer interface. SMC 2016: 724-729 - Ramesh Hariharan:
Maximum Agreement Subtree (of 2 Binary Trees). Encyclopedia of Algorithms 2016: 1218-1221 - Jesper Jansson, Wing-Kin Sung:
Maximum Agreement Supertree. Encyclopedia of Algorithms 2016: 1224-1227 - Teresa M. Przytycka:
Maximum Agreement Subtree (of 3 or More Trees). Encyclopedia of Algorithms 2016: 1221-1224 - Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees. CoRR abs/1608.02709 (2016) - 2015
- Kilho Shin:
Tree Edit Distance and Maximum Agreement Subtree. Inf. Process. Lett. 115(1): 69-73 (2015) - Daniel Irving Bernstein, Lam Si Tung Ho, Colby Long, Mike A. Steel, Katherine St. John, Seth Sullivant:
Bounds on the Expected Size of the Maximum Agreement Subtree. SIAM J. Discret. Math. 29(4): 2065-2074 (2015) - Jianer Chen, Jia-Hao Fan, Sing-Hoi Sze:
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees. Theor. Comput. Sci. 562: 496-512 (2015) - Benjamin Albrecht:
Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees. CoRR abs/1512.05656 (2015) - Benjamin Albrecht:
Computing a Relevant Set of Nonbinary Maximum Acyclic Agreement Forests. CoRR abs/1512.05703 (2015) - Frans Schalekamp, Anke van Zuylen, Suzanne van der Ster:
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. CoRR abs/1511.06000 (2015)
skipping 60 more matches
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-25 20:49 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