Hidefumi Hiraishi

Affiliations:
  • University of Tokyo, Japan


According to our database1, Hidefumi Hiraishi authored at least 13 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices.
IEEE J. Emerg. Sel. Topics Circuits Syst., 2022

2021
Extended formulations of lower-truncated transversal polymatroids.
Optim. Methods Softw., 2021

2019
Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Excluded Minors for ℚ-Representability in Algebraic Extension.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
Excluded Minors of Rank 3 for Orientability and Representability.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Parameterized Algorithms to Compute Ising Partition Function.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

2016
Parametric multiroute flow and its application to multilink-attack network.
Discret. Optim., 2016

2015
Minimal non-orientable matroids of rank three.
Eur. J. Comb., 2015

2014
BDD Operations for Quantum Graph States.
Proceedings of the Reversible Computation - 6th International Conference, 2014

Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
A new infinite family of minimal non-orientable matroids of rank 3 with 3n elements.
Electron. Notes Discret. Math., 2013


  Loading...