Hiroshi Hirai

Orcid: 0000-0002-4784-5110

Affiliations:
  • University of Tokyo, Department of Mathematical Informatics, Japan
  • Kyoto University, Research Institute for Mathematical Sciences, Japan


According to our database1, Hiroshi Hirai authored at least 41 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Two Flags in a Semimodular Lattice Generate an Antimatroid.
Order, August, 2024

2023
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity.
SIAM J. Discret. Math., March, 2023

Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices.
CoRR, 2023

Polyhedral Clinching Auctions for Indivisible Goods.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Interior-point methods on manifolds: theory and applications.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem.
Math. Program., 2022

A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 ˟ 2 submatrices.
Math. Program., 2022

Polyhedral Clinching Auctions for Two-Sided Markets.
Math. Oper. Res., 2022

Compression of M<sup>♮</sup>-convex functions - Flag matroids and valuated permutohedra.
J. Comb. Theory A, 2022

Finding Hall blockers by matrix scaling.
CoRR, 2022

A cost-scaling algorithm for computing the degree of determinants.
Comput. Complex., 2022

Reconstructing Phylogenetic Trees from Multipartite Quartet Systems.
Algorithmica, 2022

2021
Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces.
SIAM J. Appl. Algebra Geom., 2021

Minimum 0-extension problems on directed metrics.
Discret. Optim., 2021

2020
A Compact Representation for Modular Semilattices and Its Applications.
Order, 2020

Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration.
Math. Oper. Res., 2020

2019
A Tractable Class of Binary VCSPs via M-Convex Intersection.
ACM Trans. Algorithms, 2019

A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications.
ACM Trans. Algorithms, 2019

Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings.
SIAM J. Appl. Algebra Geom., 2019

Uniform semimodular lattices and valuated matroids.
J. Comb. Theory A, 2019

2018
A compact representation for minimizers of k-submodular functions.
J. Comb. Optim., 2018

Shortest (A+B)-Path Packing Via Hafnian.
Algorithmica, 2018

Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Reconstructing Phylogenetic Tree From Multipartite Quartet System.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
On integer network synthesis problem with tree-metric cost.
JSIAM Lett., 2017

2016
On k-Submodular Relaxation.
SIAM J. Discret. Math., 2016

Discrete convexity and polynomial solvability in minimum 0-extension problems.
Math. Program., 2016

A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract).
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications.
J. Comb. Theory A, 2015

L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem.
Discret. Optim., 2015

A representation of antimatroids by Horn rules and its application to educational systems.
CoRR, 2015

2014
Optimization for Centralized and Decentralized Cognitive Radio Networks.
Proc. IEEE, 2014

Tree metrics and edge-disjoint S-paths.
Math. Program., 2014

The Maximum Multiflow Problems with Bounded Fractionality.
Math. Oper. Res., 2014

2013
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees.
Math. Program., 2013

2012
Bounded fractionality of the multiflow feasibility problem for demand graph K<sub>3</sub>+K<sub>3</sub> and related maximization problems.
J. Comb. Theory B, 2012

2011
Folder Complexes and Multiflow Combinatorial Dualities.
SIAM J. Discret. Math., 2011

On duality and fractionality of multicommodity flows in directed networks.
Discret. Optim., 2011

2010
Metric packing for <i>K</i><sub>3</sub>+<i>K</i><sub>3</sub>.
Comb., 2010

2009
Tight spans of distances and the dual fractionality of undirected multiflow problems.
J. Comb. Theory B, 2009

2006
A Geometric Study of the Split Decomposition.
Discret. Comput. Geom., 2006


  Loading...