![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Sudheer Vakati
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j7]David Fernández-Baca, Sudheer Vakati:
On compatibility and incompatibility of collections of unrooted phylogenetic trees. Discret. Appl. Math. 245: 42-58 (2018) - 2015
- [j6]Sudheer Vakati, David Fernández-Baca:
Compatibility, Incompatibility, Tree-Width, and Forbidden Phylogenetic Minors. Electron. Notes Discret. Math. 50: 337-342 (2015) - [j5]David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati:
Fixed-Parameter Algorithms for Finding Agreement Supertrees. SIAM J. Comput. 44(2): 384-410 (2015) - 2014
- [j4]Sudheer Vakati, David Fernández-Baca:
Characterizing compatibility and agreement of unrooted trees via cuts in graphs. Algorithms Mol. Biol. 9: 13 (2014) - 2013
- [j3]Brad Shutters, Sudheer Vakati, David Fernández-Baca:
Incompatible quartets, triplets, and characters. Algorithms Mol. Biol. 8: 11 (2013) - [c4]Sudheer Vakati, David Fernández-Baca:
Characterizing Compatibility and Agreement of Unrooted Trees via Cuts in Graphs. WABI 2013: 185-199 - [i4]Sudheer Vakati, David Fernández-Baca:
Characterizing Compatibility and Agreement of Unrooted Trees via Cuts in Graphs. CoRR abs/1307.7828 (2013) - 2012
- [j2]Wen-Chieh Chang, Sudheer Vakati, Roland Krause
, Oliver Eulenstein:
Exploring biological interaction networks with tailored weighted quasi-bicliques. BMC Bioinform. 13(S-10): S16 (2012) - [c3]David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati:
Fixed-Parameter Algorithms for Finding Agreement Supertrees. CPM 2012: 373-384 - [c2]Brad Shutters, Sudheer Vakati, David Fernández-Baca:
Improved Lower Bounds on the Compatibility of Quartets, Triplets, and Multi-state Characters. WABI 2012: 190-200 - [i3]Brad Shutters, Sudheer Vakati, David Fernández-Baca:
Improved Lower Bounds on the Compatibility of Multi-State Characters. CoRR abs/1205.5779 (2012) - [i2]Sudheer Vakati, David Fernández-Baca:
On Two Graph-Theoretic Characterizations of Tree Compatibility. CoRR abs/1210.3762 (2012) - 2011
- [j1]Sudheer Vakati, David Fernández-Baca:
Graph triangulations and the compatibility of unrooted phylogenetic trees. Appl. Math. Lett. 24(5): 719-723 (2011) - [c1]Wen-Chieh Chang, Sudheer Vakati, Roland Krause
, Oliver Eulenstein:
Mining Biological Interaction Networks Using Weighted Quasi-Bicliques. ISBRA 2011: 428-439 - 2010
- [i1]Sudheer Vakati, David Fernández-Baca:
Graph Triangulations and the Compatibility of Unrooted Phylogenetic Trees. CoRR abs/1004.4196 (2010)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint