Hidefumi Hiraishi
Assistant Professor
Department of Computer Science,
Graduate School of Information Science and Technology,
University of Tokyo.
Research interests
Combinatorial Geometry, Combinatorial Optimization, Quantum Computation.
Journal Papers
2018

Hidefumi Hiraishi, Sonoko Moriyiama:
Excluded Minors of Rank 3 for Orientability and Representability.
IEICE Transactions 101A(9): 13551362 (2018)

Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin:
Parameterized Algorithms to Compute Ising Partition Function.
IEICE Transactions 101A(9): 13981403 (2018)
2016

JeanFrançois Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric multiroute flow and its application to multilinkattack network.
Discrete Optimization 22: 2036 (2016)
2015

Hidefumi Hiraishi, Sonoko Moriyama:
Minimal nonorientable matroids of rank three.
European Journal of Combonbinatorics 50: 123137 (2015)
2013

Hidefumi Hiraishi, Sonoko Moriyama:
A new infinite family of minimal nonorientable matroids of rank 3 with 3n elements.
Electronic Notes in Discrete Mathematics 44: 275280 (2013)
Refereed International Conference Proceedings
2018

Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai:
A BDD Approach to Counting Problems in Graphic Arrangements.
The 21st Japan–Korea Joint Workshop on Algorithms and Computation (WAAC 2018)

Naosuke Shindo, Hidefumi Hiraishi, Imai Hiroshi:
Parameterized Algorithm to Compute the Partition Function of Potts Model with Branch Decomposition.
The 21st Japan–Korea Joint Workshop on Algorithms and Computation (WAAC 2018)

Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai:
FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and IceType Models.
The 12th International Conference and Workshops on Algorithms and Computation (WALCOM 2018): 216227
2017

Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai:
An FPT algorithm for counting the number of Eulerian orientations exploiting carving decomposition.
The 20th Japan–Korea Joint Workshop on Algorithms and Computation (WAAC 2017)

Hyungseok Chang, Hidefumi Hiraishi, Hiroshi Imai:
Experimental Evaluation of Annealing Metaheuristics for NPHard Problems.
The 20th Japan–Korea Joint Workshop on Algorithms and Computation (WAAC 2017)
2015

Hidefumi Hiraishi, Sonoko Moriyama:
Excluded Minors for QRepresentable Matroids in Algebraic Extension,
The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015): 5859

Hidefumi Hiraishi, Sonoko Moriyama:
Orientable or Representable Matroids over Infinite Fields of Rank 3,
The 9th HungarianJapanese Symposium on Discrete Mathematics on Its Applications: 207211

Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Binkai Lin:
Parameterized Algorithms to Compute Ising Partition Function.
The 9th HungarianJapanese Symposium on Discrete Mathematics on Its Applications: 212220
2014

JeanFrançois Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures.
3rd International Symposium. on Combinatorial Optimization (ISCO 2014): 2637

Hidefumi Hiraishi, Hiroshi Imai:
BDD Operations for Quantum Graph States.
6th International Conference on Reversible Computation (RC 2014): 216229

Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata and Bingkai Lin:
BDD Representations for Quantum Graph State and Ising model.
14th Asian Quantum Information Science Conference (AQIS 2014)
2013

Hidefumi Hiraishi, Sonoko Moriyama:
Orientable excluded minors of rank 3 for realizable matroids.
The 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2013): 126127

Hidefumi Hiraishi, Sonoko Moriyama:
A new infinite family of minimal nonorientable matroids of rank 3 with 3n elements.
VII LatinAmerican Algorithms, Graphs, and Optimization Symposium (LAGOS 2013): 346351