default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHidefumi Hiraishi
Person information
- affiliation: University of Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Bo Yang
, Rudy Raymond, Hiroshi Imai, Hyungseok Chang, Hidefumi Hiraishi:
Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices. IEEE J. Emerg. Sel. Topics Circuits Syst. 12(3): 638-647 (2022)- 2021
- [j8]Hiroshi Imai, Keiko Imai, Hidefumi Hiraishi:
Extended formulations of lower-truncated transversal polymatroids. Optim. Methods Softw. 36(2-3): 326-331 (2021)
2010 – 2019
- 2019
- [j7]Hidefumi Hiraishi, Sonoko Moriyama:
Excluded Minors for ℚ-Representability in Algebraic Extension. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1017-1021 (2019) - [j6]Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai:
Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1022-1027 (2019) - [c4]Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai:
FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations. LAGOS 2019: 655-666 - 2018
- [j5]Hidefumi Hiraishi, Sonoko Moriyama:
Excluded Minors of Rank 3 for Orientability and Representability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1355-1362 (2018) - [j4]Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin:
Parameterized Algorithms to Compute Ising Partition Function. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1398-1403 (2018) - [c3]Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai:
FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models. WALCOM 2018: 216-227 - 2016
- [j3]Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric multiroute flow and its application to multilink-attack network. Discret. Optim. 22: 20-36 (2016) - 2015
- [j2]Hidefumi Hiraishi, Sonoko Moriyama:
Minimal non-orientable matroids of rank three. Eur. J. Comb. 50: 123-137 (2015) - 2014
- [c2]Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures. ISCO 2014: 26-37 - [c1]Hidefumi Hiraishi, Hiroshi Imai:
BDD Operations for Quantum Graph States. RC 2014: 216-229 - 2013
- [j1]Hidefumi Hiraishi, Sonoko Moriyama:
A new infinite family of minimal non-orientable matroids of rank 3 with 3n elements. Electron. Notes Discret. Math. 44: 275-280 (2013)
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-04-24 22:51 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:
