default search action
Masahiro Hachimori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j17]Masahiro Hachimori, Yumi Yamada:
Some Computational Study of the Root Distribution of Ehrhart Polynomials. IGTR 25(3): 2340005:1-2340005:15 (2023) - 2022
- [j16]Masahiro Hachimori, Akihiro Higashitani, Yumi Yamada:
The Root Distributions of Ehrhart Polynomials of Free Sums of Reflexive Polytopes. Electron. J. Comb. 29(3) (2022) - 2021
- [j15]Masahiro Hachimori
:
Sequential Partitions of Nonpure Simplicial Complexes. Graphs Comb. 37(5): 1891-1904 (2021) - [j14]Jinping Fan
Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting. IEEE Trans. Inf. Theory 67(1): 200-216 (2021)
2010 – 2019
- 2019
- [i1]Jinping Fan, Yujie Gu
Signature codes for weighted binary adder channel and multimedia fingerprinting. CoRR abs/1905.10180 (2019) - 2018
- [j13]Hikoe Enomoto, Masahiro Hachimori
Pure-strategy Nash equilibria on competitive diffusion games. Discret. Appl. Math. 244: 1-19 (2018) - 2012
- [j12]Reiko Takehara, Masahiro Hachimori
A comment on pure-strategy Nash equilibria in competitive diffusion games. Inf. Process. Lett. 112(3): 59-60 (2012) - 2011
- [j11]Masahiro Hachimori
Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness. J. Comb. Theory A 118(5): 1608-1623 (2011) - [c1]José Cáceres, Carmen Cortés
Compact Grid Representation of Graphs. EGC 2011: 166-174
2000 – 2009
- 2008
- [j10]Masahiro Hachimori
The max-flow min-cut property of two-dimensional affine convex geometries. Discret. Math. 308(9): 1674-1689 (2008) - [j9]Masahiro Hachimori
Decompositions of two-dimensional simplicial complexes. Discret. Math. 308(11): 2307-2312 (2008) - [j8]Masahiro Hachimori
A note on shellability and acyclic orientations. Discret. Math. 308(12): 2379-2381 (2008) - [j7]Masahiro Hachimori
Determining the minimum rank of matroids whose basis graph is common. Electron. Notes Discret. Math. 31: 137-142 (2008) - 2007
- [j6]Masahiro Hachimori
On the topology of the free complexes of convex geometries. Discret. Math. 307(2): 274-279 (2007) - 2006
- [j5]Sonoko Moriyama
h-Assignments of simplicial complexes and reverse search. Discret. Appl. Math. 154(3): 594-597 (2006) - 2001
- [j4]Masahiro Hachimori
Deciding constructibility of 3-balls with at most two interior vertices. Discret. Math. 232(1-3): 47-58 (2001) - [j3]Richard Ehrenborg
Non-constructible Complexes and the Bridge Index. Eur. J. Comb. 22(4): 475-491 (2001) - 2000
- [j2]Masahiro Hachimori
Constructible complexes and recursive division of posets. Theor. Comput. Sci. 235(2): 225-237 (2000)
1990 – 1999
- 1999
- [j1]Masahiro Hachimori
Nonconstructible Simplicial Balls and a Way of Testing Constructibility. Discret. Comput. Geom. 22(2): 223-230 (1999)
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 2024-08-27 22: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
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: