default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroaki Iwashita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Yuma Ichikawa, Hiroaki Iwashita:
Continuous Tensor Relaxation for Finding Diverse Solutions in Combinatorial Optimization Problems. CoRR abs/2402.02190 (2024)- 2023
- [c9]Hirofumi Suzuki
, Hiroaki Iwashita, Takuya Takagi, Yuta Fujishige, Satoshi Hara:
Rule Mining for Correcting Classification Models. ICDM 2023: 1331-1336 - [i2]Hirofumi Suzuki, Hiroaki Iwashita, Takuya Takagi, Yuta Fujishige, Satoshi Hara:
Rule Mining for Correcting Classification Models. CoRR abs/2310.06446 (2023) - 2022
- [c8]Hirofumi Suzuki, Hiroaki Iwashita, Takuya Takagi, Keisuke Goto, Yuta Fujishige, Satoshi Hara:
Explainable and Local Correction of Classification Models Using Decision Trees. AAAI 2022: 8404-8413 - 2020
- [i1]Hiroaki Iwashita, Takuya Takagi, Hirofumi Suzuki, Keisuke Goto, Kotaro Ohori, Hiroki Arimura:
Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification. CoRR abs/2004.08015 (2020)
2010 – 2019
- 2017
- [j3]Jun Kawahara, Takeru Inoue, Hiroaki Iwashita, Shin-ichi Minato:
Frontier-Based Search for Enumerating All Constrained Subgraphs with Compressed Representation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1773-1784 (2017) - 2016
- [j2]Takeru Inoue, Hiroaki Iwashita, Jun Kawahara, Shin-ichi Minato:
Graphillion: software library for very large sets of labeled graphs. Int. J. Softw. Tools Technol. Transf. 18(1): 57-66 (2016) - [c7]Hiroaki Iwashita, Kotaro Ohori, Hirokazu Anai, Atsushi Iwasaki:
Simplifying Urban Network Security Games with Cut-Based Graph Contraction. AAMAS 2016: 205-213 - [c6]Akinobu Goto, Shingo Takahashi, Kotaro Ohori, Shohei Yamane, Hiroaki Iwashita, Hirokazu Anai:
Agent-based simulation analysis for security planning based on structures of urban road networks. WSC 2016: 3720-3721 - 2012
- [j1]Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara, Koji Tsuruma, Hiroaki Iwashita, Shin-ichi Minato:
Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs. Algorithms 5(2): 176-213 (2012)
2000 – 2009
- 2000
- [c5]Subir K. Roy, Hiroaki Iwashita, Tsuneo Nakata:
Formal verification based on assume and guarantee approach - a case study (short paper). ASP-DAC 2000: 77-80 - [c4]Subir K. Roy, Hiroaki Iwashita, Tsuneo Nakata:
Dataflow Analysis for Resource Contention and Register Leakage Properties. VLSI Design 2000: 418-423
1990 – 1999
- 1997
- [c3]Hiroaki Iwashita, Tsuneo Nakata:
Forward model checking techniques oriented to buggy designs. ICCAD 1997: 400-404 - 1996
- [c2]Hiroaki Iwashita, Tsuneo Nakata, Fumiyasu Hirose:
CTL model checking based on forward state traversal. ICCAD 1996: 82-87 - 1994
- [c1]Hiroaki Iwashita, Satoshi Kowatari, Tsuneo Nakata, Fumiyasu Hirose:
Automatic test program generation for pipelined processors. ICCAD 1994: 580-583
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-05-08 21:52 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:
