default search action
Akihiro Higashitani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Akihiro Higashitani, Kazuki Kurimoto, Naoki Matsumoto
:
Feedback game on 3-chromatic Eulerian triangulations of surfaces. Discret. Appl. Math. 347: 30-38 (2024) - 2023
- [j16]Akihiro Higashitani, Naoki Matsumoto:
Kempe equivalence of almost bipartite graphs. Australas. J Comb. 87: 203-213 (2023) - [j15]Akihiro Higashitani, Naoki Matsumoto
The ratio of the numbers of odd and even cycles in outerplanar graphs. Discret. Math. 346(4): 113285 (2023) - [j14]Akihiro Higashitani
The Distribution of Roots of Ehrhart Polynomials for the Dual of Root Polytopes of Type C. Graphs Comb. 39(4): 83 (2023) - 2022
- [j13]Masahiro Hachimori, Akihiro Higashitani, Yumi Yamada:
The Root Distributions of Ehrhart Polynomials of Free Sums of Reflexive Polytopes. Electron. J. Comb. 29(3) (2022) - [i3]Akihiro Higashitani, Naoki Matsumoto:
Kempe equivalence of almost bipartite graphs. CoRR abs/2207.13244 (2022) - 2021
- [i2]Akihiro Higashitani, Naoki Matsumoto:
The ratio of the numbers of odd and even cycles in outerplanar graphs. CoRR abs/2105.02361 (2021) - 2020
- [i1]Akihiro Higashitani, Kazuki Kurimoto, Naoki Matsumoto:
Feedback game on 3-chromatic Eulerian triangulations of surfaces. CoRR abs/2002.10679 (2020)
2010 – 2019
- 2019
- [j12]Gábor Hegedüs, Akihiro Higashitani, Alexander M. Kasprzyk
Ehrhart Polynomial Roots of Reflexive Polytopes. Electron. J. Comb. 26(1): 1 (2019) - [j11]Akihiro Higashitani, Kazuki Kurimoto:
Permutations with small maximal k-consecutive sums. Discret. Math. 342(9): 2467-2481 (2019) - [j10]Takayuki Hibi, Akihiro Higashitani, Akiyoshi Tsuchiya
Ehrhart Polynomials with Negative Coefficients. Graphs Comb. 35(1): 363-371 (2019) - 2018
- [j9]Takayuki Hibi, Akihiro Higashitani
Existence of regular unimodular triangulations of dilated empty simplices. Eur. J. Comb. 70: 374-383 (2018) - 2014
- [j8]Akihiro Higashitani:
Non-normal Very Ample Polytopes and their Holes. Electron. J. Comb. 21(1): 1 (2014) - [j7]David A. Cox, Christian Haase, Takayuki Hibi, Akihiro Higashitani:
Integer Decomposition Property of Dilated Polytopes. Electron. J. Comb. 21(4): 4 (2014) - [j6]Akihiro Higashitani:
Ehrhart Polynomials of Integral Simplices With Prime Volumes. Integers 14: A45 (2014) - 2012
- [j5]Akihiro Higashitani:
Counterexamples of the Conjecture on Roots of Ehrhart Polynomials. Discret. Comput. Geom. 47(3): 618-623 (2012) - [j4]Takayuki Hibi, Akihiro Higashitani, Nan Li:
Hermite normal forms and δ-vectors. J. Comb. Theory A 119(6): 1158-1173 (2012) - 2011
- [j3]Takayuki Hibi, Akihiro Higashitani:
Smooth Fano Polytopes Arising from Finite Partially Ordered Sets. Discret. Comput. Geom. 45(3): 449-461 (2011) - [j2]Takayuki Hibi, Akihiro Higashitani, Yuuki Nagazawa:
Ehrhart polynomials of convex polytopes with small volumes. Eur. J. Comb. 32(2): 226-232 (2011) - 2010
- [j1]Akihiro Higashitani:
Shifted symmetric delta-vectors of convex polytopes. Discret. Math. 310(21): 2925-2934 (2010)
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-06-10 20:27 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: