default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroki Yanagisawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c18]Hiroki Yanagisawa:
Proper Scoring Rules for Survival Analysis. ICML 2023: 39165-39182- [i3]Hiroki Yanagisawa:
Proper Scoring Rules for Survival Analysis. CoRR abs/2305.00621 (2023) - 2022
- [c17]Hiroki Yanagisawa, Kohei Miyaguchi, Takayuki Katsuki:
Hierarchical Lattice Layer for Partially Monotone Neural Networks. NeurIPS 2022 - 2021
- [c16]Mohamed F. Ghalwash, Prithwish Chakraborty, Akira Koseki, Hiroki Yanagisawa, Toshiya Iwamori, Ray Tokumasu, Masaki Makino, Ryosuke Yanagiya, Atsushi Suzuki, Michiharu Kudo, Daby Sow:
A Comparative Time-to-Event Analysis Across Health Systems. AMIA 2021
2010 – 2019
- 2019
- [c15]Koki Hamada
, Shuichi Miyazaki, Hiroki Yanagisawa:
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists. ISAAC 2019: 9:1-9:14 - [i2]Koki Hamada, Shuichi Miyazaki, Hiroki Yanagisawa:
Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists. CoRR abs/1902.05678 (2019) - [i1]Yachiko Obara, Tetsuro Morimura, Hiroki Yanagisawa:
Sampler for Composition Ratio by Markov Chain Monte Carlo. CoRR abs/1906.06663 (2019) - 2018
- [j9]Hiroki Yanagisawa, Satoshi Hara:
Discounted average degree density metric and new algorithms for the densest subgraph problem. Networks 71(1): 3-15 (2018) - 2017
- [c14]Satoshi Hara, Takayuki Katsuki, Hiroki Yanagisawa, Takafumi Ono, Ryo Okamoto, Shigeki Takeuchi:
Consistent and Efficient Nonparametric Different-Feature Selection. AISTATS 2017: 130-138 - 2016
- [r1]Hiroki Yanagisawa:
Stable Marriage with One-Sided Ties. Encyclopedia of Algorithms 2016: 2068-2071 - 2015
- [c13]Satoshi Hara, Tetsuro Morimura, Toshihiro Takahashi, Hiroki Yanagisawa, Taiji Suzuki:
A Consistent Method for Graph Based Anomaly Localization. AISTATS 2015 - [c12]Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties. APPROX-RANDOM 2015: 361-380 - 2014
- [j8]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. Algorithmica 68(3): 758-775 (2014) - 2013
- [c11]Fumiko Satoh, Hiroki Yanagisawa, Hitomi Takahashi, Takayuki Kushida:
Total Energy Management System for Cloud Computing. IC2E 2013: 233-240 - [c10]Hiroki Yanagisawa, Takayuki Osogami:
Improved Integer Programming Approaches for Chance-Constrained Stochastic Programming. IJCAI 2013: 2938-2944 - [c9]Hiroki Yanagisawa, Takayuki Osogami, Rudy Raymond:
Dependable virtual machine allocation. INFOCOM 2013: 629-637 - [c8]Daisuke Takuma, Hiroki Yanagisawa:
Faster upper bounding of intersection sizes. SIGIR 2013: 703-712 - 2012
- [j7]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved approximation bounds for the Student-Project Allocation problem with preferences over projects. J. Discrete Algorithms 13: 59-66 (2012) - 2011
- [c7]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects. TAMC 2011: 440-451 - 2010
- [j6]Akio Tajima, Hiroki Yanagisawa, Seigo Takahashi:
Next Generation Optical Access Network: Standardization Outline and Key Technologies for Co-existence with Legacy Systems. IEICE Trans. Electron. 93-C(7): 1146-1151 (2010) - [j5]Hiroki Yanagisawa, Ippeita Dan, Daisuke Tsuzuki, Morimasa Kato, Masako Okamoto, Yasushi Kyutoku, Hideaki Soya:
Acute moderate exercise elicits increased dorsolateral prefrontal activation and improves cognitive performance with Stroop test. NeuroImage 50(4): 1702-1710 (2010) - [j4]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Approximation algorithms for the sex-equal stable marriage problem. ACM Trans. Algorithms 7(1): 2:1-2:17 (2010) - [c6]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. ESA (2) 2010: 135-146 - [c5]Hiroki Yanagisawa:
An Offline Map Matching via Integer Programming. ICPR 2010: 4206-4209 - [c4]Hiroki Yanagisawa:
A multi-source label-correcting algorithm for the all-pairs shortest paths problem. IPDPS 2010: 1-10
2000 – 2009
- 2007
- [j3]Hiroki Yanagisawa:
The material allocation problem in the steel industry. IBM J. Res. Dev. 51(3/4): 363-374 (2007) - [j2]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved approximation results for the stable marriage problem. ACM Trans. Algorithms 3(3): 30 (2007) - [c3]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Approximation Algorithms for the Sex-Equal Stable Marriage Problem. WADS 2007: 201-213 - 2004
- [j1]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Randomized approximation of the stable marriage problem. Theor. Comput. Sci. 325(3): 439-465 (2004) - 2003
- [c2]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Randomized Approximation of the Stable Marriage Problem. COCOON 2003: 339-350 - [c1]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved Approximation of the Stable Marriage Problem. ESA 2003: 266-277
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-25 05:55 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:
