![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Momoko Hayamizu
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c1]Tsuyoshi Urata, Manato Yokoyama, Momoko Hayamizu:
Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation. WABI 2024: 9:1-9:17 - [i7]Tsuyoshi Urata, Manato Yokoyama, Momoko Hayamizu:
Orientability of undirected phylogenetic networks to a desired class: Practical algorithms and application to tree-child orientation. CoRR abs/2407.09776 (2024) - 2023
- [j5]Momoko Hayamizu
, Kazuhisa Makino:
Ranking Top-$k$ Trees in Tree-Based Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 2349-2355 (2023) - [i6]Shunsuke Maeda, Yusuke Kaneko, Hideaki Muramatsu, Yukihiro Murakami, Momoko Hayamizu:
Orienting undirected phylogenetic networks to tree-child network. CoRR abs/2305.10162 (2023) - [i5]Takatora Suzuki, Han Guo, Momoko Hayamizu:
Rooted Almost-binary Phylogenetic Networks for which the Maximum Covering Subtree Problem is Solvable in Linear Time. CoRR abs/2305.15132 (2023) - 2021
- [j4]Momoko Hayamizu
:
A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks. SIAM J. Discret. Math. 35(4): 2490-2516 (2021) - 2020
- [j3]Momoko Hayamizu, Katharina T. Huber, Vincent Moulton
, Yukihiro Murakami:
Recognizing and realizing cactus metrics. Inf. Process. Lett. 157: 105916 (2020)
2010 – 2019
- 2019
- [i4]Momoko Hayamizu, Kazuhisa Makino:
Ranking top-k trees in tree-based phylogenetic networks. CoRR abs/1904.12432 (2019) - [i3]Momoko Hayamizu, Katharina T. Huber, Vincent Moulton, Yukihiro Murakami:
Recognizing and realizing cactus metrics. CoRR abs/1908.01524 (2019) - 2018
- [i2]Momoko Hayamizu:
A structural characterization of tree-based phylogenetic networks. CoRR abs/1811.05849 (2018) - 2017
- [j2]Momoko Hayamizu
, Kenji Fukumizu
:
On minimum spanning tree-like metric spaces. Discret. Appl. Math. 226: 51-57 (2017) - [j1]Momoko Hayamizu, Hiroshi Endo, Kenji Fukumizu
:
A Characterization of Minimum Spanning Tree-Like Metric Spaces. IEEE ACM Trans. Comput. Biol. Bioinform. 14(2): 468-471 (2017) - 2015
- [i1]Momoko Hayamizu, Hiroshi Endo, Kenji Fukumizu:
A characterization of minimum spanning tree-like metric spaces. CoRR abs/1510.09155 (2015)
Coauthor Index
![](https://dblp.dagstuhl.de/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-08-27 21:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint