| 2009 |
| 13 | EE | Xinpeng Zhang,
Yasuhito Asano,
Masatoshi Yoshikawa:
Visualized Elucidations of Ranking by Exploiting Object Relations.
ICDE 2009: 1576-1579 |
| 2008 |
| 12 | EE | Yasuhito Asano,
Yuya Miyawaki,
Takao Nishizeki:
Efficient Compression of Web Graphs.
COCOON 2008: 1-11 |
| 11 | EE | Yasuhito Asano,
Yu Tezuka,
Takao Nishizeki:
Improvements of HITS Algorithms for Spam Links.
IEICE Transactions 91-D(2): 200-208 (2008) |
| 2007 |
| 10 | EE | Yasuhito Asano,
Yu Tezuka,
Takao Nishizeki:
Improvements of HITS Algorithms for Spam Links.
APWeb/WAIM 2007: 479-490 |
| 2006 |
| 9 | EE | Yasuhito Asano,
Takao Nishizeki,
Masashi Toyoda,
Masaru Kitsuregawa:
Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework.
IEICE Transactions 89-D(10): 2606-2615 (2006) |
| 2005 |
| 8 | EE | Yasuhito Asano,
Takao Nishizeki,
Masashi Toyoda:
Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework.
WISE 2005: 1-14 |
| 2003 |
| 7 | EE | Yasuhito Asano,
Hiroshi Imai,
Masashi Toyoda,
Masaru Kitsuregawa:
Finding Neighbor Communities in the Web Using Inter-site Graph.
DEXA 2003: 558-568 |
| 6 | EE | Yasuhito Asano,
Takao Nishizeki:
Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework.
Graph Drawing 2003: 498-499 |
| 5 | EE | Yasuhito Asano,
Tsuyoshi Ito,
Hiroshi Imai,
Masashi Toyoda,
Masaru Kitsuregawa:
Compact Encoding of the Web Graph Exploiting Various Power Laws: Statistical Reason Behind Link Database.
WAIM 2003: 37-46 |
| 2002 |
| 4 | | Yasuhito Asano,
Hiroshi Imai,
Masashi Toyoda,
Masaru Kitsuregawa:
Focusing on Sites in the Web.
ISDB 2002: 154-159 |
| 3 | EE | Yasuhito Asano,
Hiroshi Imai,
Masashi Toyoda,
Masaru Kitsuregawa:
Web-Linkage Viewer: Finding Graph Structures in the Web.
WAIM 2002: 441-442 |
| 2 | EE | Yasuhito Asano,
Hiroshi Imai,
Masashi Toyoda,
Masaru Kitsuregawa:
Applying the Site Information to the Information Retrieval from the Web.
WISE 2002: 83-92 |
| 2000 |
| 1 | | Yasuhito Asano:
Experimental Evaluation of Approximation Algorithms for the Minimum Cost Multiple-source Unsplittable Flow Problem.
ICALP Satellite Workshops 2000: 111-122 |