default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Hirai 0001
Person information
- affiliation: University of Tokyo, Department of Mathematical Informatics, Japan
- affiliation: Kyoto University, Research Institute for Mathematical Sciences, Japan
Other persons with the same name
- Hiroshi Hirai — disambiguation page
- Hiroshi Hirai 0002 — Kyushu University, Fukuoka, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j35]Hiroshi Hirai
, Ryosuke Sato:
Polyhedral Clinching Auctions for Indivisible Goods. ACM Trans. Economics and Comput. 13(1): 4:1-4:30 (2025)- 2024
- [j34]Koyo Hayashi, Hiroshi Hirai, Keiya Sakabe:
Finding Hall Blockers by Matrix Scaling. Math. Oper. Res. 49(4): 2166-2179 (2024) - [j33]Koyo Hayashi, Hiroshi Hirai:
Two Flags in a Semimodular Lattice Generate an Antimatroid. Order 41(2): 463-470 (2024) - 2023
- [j32]Hiroshi Hirai, Motoki Ikeda:
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity. SIAM J. Discret. Math. 37(1): 351-378 (2023) - [c10]Hiroshi Hirai, Harold Nieuwboer, Michael Walter:
Interior-point methods on manifolds: theory and applications. FOCS 2023: 2021-2030 - [c9]Hiroshi Hirai, Ryosuke Sato:
Polyhedral Clinching Auctions for Indivisible Goods. WINE 2023: 366-383 - [i17]Hiroshi Hirai, Ryosuke Sato:
Polyhedral Clinching Auctions for Indivisible Goods. CoRR abs/2303.00231 (2023) - [i16]Hiroshi Hirai, Harold Nieuwboer, Michael Walter:
Interior-point methods on manifolds: theory and applications. CoRR abs/2303.04771 (2023) - [i15]Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma:
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. CoRR abs/2310.15502 (2023) - 2022
- [j31]Hiroshi Hirai, Yuni Iwamasa:
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems. Algorithmica 84(7): 1875-1896 (2022) - [j30]Hiroshi Hirai, Motoki Ikeda:
A cost-scaling algorithm for computing the degree of determinants. Comput. Complex. 31(2): 10 (2022) - [j29]Satoru Fujishige, Hiroshi Hirai:
Compression of M♮-convex functions - Flag matroids and valuated permutohedra. J. Comb. Theory A 185: 105525 (2022) - [j28]Hiroshi Hirai, Ryosuke Sato:
Polyhedral Clinching Auctions for Two-Sided Markets. Math. Oper. Res. 47(1): 259-285 (2022) - [j27]Hiroshi Hirai, Yuni Iwamasa:
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 ˟ 2 submatrices. Math. Program. 195(1): 1-37 (2022) - [j26]Hiroshi Hirai, Motoki Ikeda:
A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem. Math. Program. 195(1): 149-181 (2022) - [i14]Koyo Hayashi, Hiroshi Hirai:
Two flags in a semimodular lattice generate an antimatroid. CoRR abs/2204.03188 (2022) - [i13]Koyo Hayashi, Hiroshi Hirai:
Finding Hall blockers by matrix scaling. CoRR abs/2204.07425 (2022) - 2021
- [j25]Hiroshi Hirai, Ryuhei Mizutani:
Minimum 0-extension problems on directed metrics. Discret. Optim. 40: 100642 (2021) - [j24]Masaki Hamada, Hiroshi Hirai:
Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces. SIAM J. Appl. Algebra Geom. 5(3): 455-478 (2021) - 2020
- [j23]Hiroshi Hirai, Ryunosuke Oshiro, Ken'ichiro Tanaka:
Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration. Math. Oper. Res. 45(2): 455-464 (2020) - [j22]Hiroshi Hirai, So Nakashima:
A Compact Representation for Modular Semilattices and Its Applications. Order 37(3): 479-507 (2020) - [c8]Hiroshi Hirai, Motoki Ikeda:
Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity. ICALP 2020: 65:1-65:19 - [c7]Hiroshi Hirai, Yuni Iwamasa:
A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 ˟ 2 Submatrices. IPCO 2020: 196-208 - [c6]Hiroshi Hirai, Ryuhei Mizutani:
Minimum 0-Extension Problems on Directed Metrics. MFCS 2020: 46:1-46:13 - [i12]Hiroshi Hirai, Yuni Iwamasa:
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatrices. CoRR abs/2004.10443 (2020) - [i11]Hiroshi Hirai, Ryuhei Mizutani:
Minimum 0-Extension Problems on Directed Metrics. CoRR abs/2006.00153 (2020) - [i10]Hiroshi Hirai, Motoki Ikeda:
Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity. CoRR abs/2008.10052 (2020) - [i9]Hiroshi Hirai, Motoki Ikeda:
A cost-scaling algorithm for computing the degree of determinants. CoRR abs/2008.11388 (2020)
2010 – 2019
- 2019
- [j21]Hiroshi Hirai:
Uniform semimodular lattices and valuated matroids. J. Comb. Theory A 165: 325-359 (2019) - [j20]Hiroshi Hirai:
Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings. SIAM J. Appl. Algebra Geom. 3(3): 523-557 (2019) - [j19]Hiroshi Hirai:
A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications. ACM Trans. Algorithms 15(1): 15:1-15:24 (2019) - [j18]Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
A Tractable Class of Binary VCSPs via M-Convex Intersection. ACM Trans. Algorithms 15(3): 44:1-44:41 (2019) - [i8]Hiroshi Hirai, Motoki Ikeda:
A Cost-Scaling Algorithm for Minimum-Cost Node-Capacitated Multiflow Problem. CoRR abs/1909.01599 (2019) - 2018
- [j17]Hiroshi Hirai, Hiroyuki Namba:
Shortest (A+B)-Path Packing Via Hafnian. Algorithmica 80(8): 2478-2491 (2018) - [j16]Hiroshi Hirai, Taihei Oki:
A compact representation for minimizers of k-submodular functions. J. Comb. Optim. 36(3): 709-741 (2018) - [c5]Hiroshi Hirai, Yuni Iwamasa:
Reconstructing Phylogenetic Tree From Multipartite Quartet System. ISAAC 2018: 57:1-57:13 - [c4]Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. STACS 2018: 39:1-39:14 - [i7]Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
A tractable class of binary VCSPs via M-convex intersection. CoRR abs/1801.02199 (2018) - [i6]Hiroshi Hirai, Ryunosuke Oshiro, Ken'ichiro Tanaka:
Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration. CoRR abs/1807.05348 (2018) - 2017
- [j15]Hiroshi Hirai, Masashi Nitta:
On integer network synthesis problem with tree-metric cost. JSIAM Lett. 9: 73-76 (2017) - [i5]Hiroshi Hirai, Ryosuke Sato:
Polyhedral Clinching Auctions for Two-sided Markets. CoRR abs/1708.04881 (2017) - 2016
- [j14]Hiroshi Hirai:
Discrete convexity and polynomial solvability in minimum 0-extension problems. Math. Program. 155(1-2): 1-55 (2016) - [j13]Hiroshi Hirai, Yuni Iwamasa:
On k-Submodular Relaxation. SIAM J. Discret. Math. 30(3): 1726-1736 (2016) - [c3]Hiroshi Hirai, Taihei Oki:
A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract). ISCO 2016: 381-392 - [i4]Hiroshi Hirai, Hiroyuki Namba:
Shortest (A+B)-path packing via hafnian. CoRR abs/1603.08073 (2016) - 2015
- [j12]Hiroshi Hirai:
L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem. Discret. Optim. 18: 1-37 (2015) - [j11]Hiroshi Hirai, Akihiro Yabe:
A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications. J. Comb. Theory A 133: 261-279 (2015) - [i3]Hiroshi Hirai, Yuni Iwamasa:
On k-Submodular Relaxation. CoRR abs/1504.07830 (2015) - [i2]Hiyori Yoshikawa, Hiroshi Hirai, Kazuhisa Makino:
A representation of antimatroids by Horn rules and its application to educational systems. CoRR abs/1508.05465 (2015) - [i1]Hiroshi Hirai:
A dual descent algorithm for node-capacitated multiflow problems and its applications. CoRR abs/1508.07065 (2015) - 2014
- [j10]Hiroshi Hirai:
The Maximum Multiflow Problems with Bounded Fractionality. Math. Oper. Res. 39(1): 60-104 (2014) - [j9]Hiroshi Hirai, Gyula Pap:
Tree metrics and edge-disjoint S-paths. Math. Program. 147(1-2): 81-123 (2014) - [j8]Mikio Hasegawa, Hiroshi Hirai, Kiyohito Nagano, Hiroshi Harada, Kazuyuki Aihara:
Optimization for Centralized and Decentralized Cognitive Radio Networks. Proc. IEEE 102(3): 574-584 (2014) - 2013
- [j7]Hiroshi Hirai:
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees. Math. Program. 137(1-2): 503-530 (2013) - [c2]Hiroshi Hirai:
Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems. SODA 2013: 1770-1788 - 2012
- [j6]Hiroshi Hirai:
Bounded fractionality of the multiflow feasibility problem for demand graph K3+K3 and related maximization problems. J. Comb. Theory B 102(4): 875-899 (2012) - 2011
- [j5]Hiroshi Hirai, Shungo Koichi:
On duality and fractionality of multicommodity flows in directed networks. Discret. Optim. 8(3): 428-445 (2011) - [j4]Hiroshi Hirai:
Folder Complexes and Multiflow Combinatorial Dualities. SIAM J. Discret. Math. 25(3): 1119-1143 (2011) - 2010
- [j3]Hiroshi Hirai:
Metric packing for K3+K3. Comb. 30(3): 295-326 (2010) - [c1]Hiroshi Hirai:
The maximum multiflow problems with bounded fractionality. STOC 2010: 115-120
2000 – 2009
- 2009
- [j2]Hiroshi Hirai:
Tight spans of distances and the dual fractionality of undirected multiflow problems. J. Comb. Theory B 99(6): 843-868 (2009) - 2006
- [j1]Hiroshi Hirai:
A Geometric Study of the Split Decomposition. Discret. Comput. Geom. 36(2): 331-361 (2006)
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 2025-03-04 21:23 CET 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:
