My main interests include, but are not limited to, Algorithm, Big Data, Optimization, Internet service and Artificial Wisdom (AW).

アルゴリズム,ビッグデータ,最適化,インターネット,人工智慧などを中心に総合研究をしています.

Publication Database (thanks)

Publications

Book

  1. 生活の知恵から科学へー最短路を考える,数理工学のすすめ (改訂3版) 1.3, 京都大学工学部情報学科数理工学コース編集,pp. 12-16,現代数学社 (2011.3)
  2. 総合生存学の方法ー情報学の視点に立って,総合生存学 グローバルリーダーのために, 川井秀一,藤田正勝,池田裕一編,pp. 111-127,京都大学学術出版会(2015.7)
  3. Liang Zhao, Finding Small Dominating Sets in Large-Scale Networks, in Big Data of Complex Network, Matthias Dehmer et al eds., Chapman and Hall/CRC (2016)

Jounal papers

  1. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki, ``Approximating the minimum k-way cut in a graph via minimum 3-way cuts,'' J. Combinatorial Optimization, vol. 5, no. 4, pp. 397--410 (2001.12). Manuscript versions: gzipped PS file (112K) or PDF file (180K).
  2. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki, ``A note on approximating the survivable network design problem in hypergraphs,'' IEICE Transactions on Information and Systems, vol. E85-D, no. 2, pp. 322--326, (2002.02) Manuscript versions: gzipped PS file (168K) or PDF file (132K).
  3. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki, ``A primal-dual approximation algorithm for the survivable network design problem in hypergraphs,'' Discrete Applied Mathematics, vol. 126, no. 2-3, pp. 275--289 (2003.03). Manuscript versions: gzipped PS file (188K) or PDF file (144K).
  4. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki, ``A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem,'' Information Processing Letters, vol. 86/2, pp. 63--70 (2003.04). Manuscript versions: gzipped PS file (68K) or PDF file (144K), published version is available at ScienceDirect.
  5. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki, ``On generalized greedy splitting algorithms for multiway partition problems,'' Discrete Applied Mathematics, vol. 143, issues 1-3, pp. 130-143 (2004.09). Manuscript versions: gzipped PS file (187K) or PDF file (480K), published version is available at ScienceDirect.
  6. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki, ``Greedy splitting algorithms for approximating multiway partition problems,'' Mathematical Programming, vol. 102, no. 1, pp. 167-183 (2005.01). Manuscript versions: gzipped PS file (134K) or PDF file (164K), published version is available at SpringerLink.
  7. Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao, ``NP-hardness Proof and an Approximation Algorithm for the Minimum Vertex Ranking Spanning Tree Problem,'' Discrete Applied Mathematics, vol. 154, issue 16, pp. 2402-2410 (2006.11). Manuscript version: PDF file (180K).
  8. Fujiwara, Hiroki; Wang, Jiexun; Zhao, Liang; Nagamochi, Hiroshi; Akutsu, Tatsuya, ``Enumerating Tree-like Chemical Graphs with Given Path Frequency,'' Journal of Chemical Information and Modeling, 2008, 48 (7), pp. 1345-1357 (2008.06). Available at http://pubs.acs.org/doi/abs/10.1021/ci700385a.
  9. Yusuke Ishida, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu, ``Improved Algorithms for Enumerating Tree-like Chemical Graphs with Given Path Frequency,'' Genome Informatics, vol. 21, pp. 53--64 (2008.12). Available at http://www.jsbi.org/pdfs/journal1/GIW08/GIW08005.pdf.
  10. Ishida, Yusuke; Kato, Yuki; Zhao, Liang; Nagamochi, Hiroshi; Akutsu, Tatsuya, ``Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut,'' Journal of Chemical Information and Modeling, 50 (5), pp. 934--946 (2010.04). See http://pubs.acs.org/doi/abs/10.1021/ci900447z.
  11. Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi, ``An A* Algorithm Framework for the Point-to-point Time-dependent Shortest Path Problem,'' Revised Selected Papers of CGGA 2010, Lecture Notes in Computer Science, vol. 7033, pp. 154--163, Springer (2011.10). See http://www.springerlink.com/content/978-3-642-24982-2/#section=983223&page=1&locus=0.
  12. Lin Shan, Sonia Aissa, Hidekazu Murata, Susumu Yoshida, Liang Zhao, ``An Adaptive Fairness and Throughput Control Approach for Resource Scheduling in Multiuser Wireless Networks,'' IEICE Trans. on Communications, vol. E96-B, no. 2, 561-568 (2013.02).
  13. Liang Zhao, Mingji Gao, ``Node Early-Fixing: A Practical Speedup Technique for A* Algorithms," GSTF Intl. J. Mathematics, Statistics and Operations Research (JMSOR), Vol. 2, No. 1, 98-102 .
  14. Liang Zhao, Hiroshi Kadowaki, Dorothea Wagner, ``A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs,'' Lecture Notes in Computer Science, vol. 8286, 157-164 (2013). See http://link.springer.com/chapter/10.1007%2F978-3-319-03889-6_18
  15. 趙 亮,新入生授業に課題解決型研究を取り入れて ―京都市広域避難場所割当マップの制作を通じた試み―,日本オペレーションズ・リサーチ学会機関誌,Vol. 61, No. 11, 768-771(2016年11月), http://www.orsj.or.jp/archive2/or61-11/or61_11_768.pdf

Peer-reviewed conference papers

  1. L. Zhao, H. Nagamochi and T.Ibaraki. "Approximating the minimum $k$-way cut in a graph via minimum 3-way cuts", in Proc. ISAAC 1999 (Chennai, India), pp. 373--382, LNCS 1741.
  2. L. Zhao, H. Nagamochi and T. Ibaraki. "A primal-dual approximation algorithm for the survivable network design problem in hypergraph", in Proc. STACS 2001 (Dresden, Germany), pp. 478--489, LNCS 2010.
  3. L. Zhao, H. Nagamochi and T. Ibaraki. "A unified framework for approximating multiway partition problems (extended abstract)", in Proc. ISAAC 2001 (Christchurch, New Zealand), pp. 682--694, LNCS 2223.
  4. K. Katou, L. Zhao, S. Sakazawa and H. Yamamoto. ``An Adaptive Content-Aware Scaling for Receiver-driven Layered Video Multicast", in Proc. ITC-CSCC 2003 (2003.7.7--9, Phoenix Park Hotel, Korea), pp. 904--905. Final versions: gzipped PS file (44K) or PDF file (104K) (2003.07).
  5. Liang Zhao and Hideo Yamamoto. ``JWebPresenter: A Universal Web Presenting Tool,'' Linux Conference (Japan) 2004, CP-13 (2004-06). Available at http://lc.linux.or.jp/paper/lc2004/CP-13.pdf.
  6. 井上裕司,趙亮,山本英雄,パケットフィルタにおけるルールの最適配置について, Linux Conference (Japan) 2004, CP-01 (2004-06). Available at http://lc.linux.or.jp/paper/lc2004/CP-01.pdf.
  7. L. Zhao and H. Yamamoto. "A Simple Rendering System for Web Presentation", in Proc. ICACT 2004 (2004.2.9-11, Phoenix Park Hotel, Korea), pp. 627--631. Final version: gzipped PS file (332K) or PDF file (200K) (2004.02).
  8. L. Zhao, Y. Inoue and H. Yamamoto. "Delay Reduction for Liner-Search Based Packet Filters", in Proc. ITC-CSCC 2004 (2004/07). Final version: PDF file (64K) (2004-04).
  9. P. Liu, T. Aikawa, S. Miyaji, L. Zhao and H. Yamamoto. "Complexity Reduction in Block Mode Determination for H.264", in Proc. ITC-CSCC 2004 (2004/07). Final version: PDF file (316K) (2004-04).
  10. T. Yokoha, T. Matsumoto, S. Sakazawa, L. Zhao and H. Yamamoto. "On the Subjective Effect of StriMark When Applied to Videos", in Proc. ITC-CSCC 2004 (2004/07). Final version: PDF file (464K) (2004-04).
  11. L. Zhao and H. Yamamoto. "On the Bitmap-Image Based Presenting", IEEE MSE2004, 2004/12, pp. 98--105. Final version: gzipped PS file (73KB) or PDF file (102KB) (2004-12).
  12. L. Zhao and H. Yamamoto. "Multisource Receiver-driven Layered Multicast", IEEE TENCON 2005 (Melbourne, Australia 21-24 Nov. 2005), pp. 1325--1328. Manuscript versions: gzipped PS file (68K) or PDF file (80K). Presentations: PDF file (404K).
  13. Y. Nemoto, S. Sakazawa, L. Zhao and H. Yamamoto. "A Study on Video Scrambling Considering Inter-frame Prediction", IWAIT 2006 (Okinawa, Jan. 9-10, 2006). Final version: PDF file (1907K)
  14. K. Kamata, M. Saito, L. Zhao and H. Yamamoto. "Mobile Accessible Japanese Sign Language Dictionaries over the Internet", Isaac 2006 (Dusseldorf, Germany, July 29th - August 5th 2006). Abstract: PDF file (33K)
  15. Wang Jiexun, Zhao Liang, Hiroshi Nagamochi, Akutsu Tatsuya, ``An Efficient Algorithm for Generation Colored Outerplanar Graphs'', Proc. 4th intl. conf. on Theory and Applications of Models of Computation (TAMC 2007, Shanghai, China, May 22-25, 2007), 573-583.
  16. L. Zhao, A. Shimae and H. Nagamochi. "Linear-tree Rule Structure for Firewall Optimization," CIIT 2007 (Banff, Alberta, Canada, July 2-4, 2007), pp. 67--72. Final paper: gzipped PS file (60K) or PDF file (84K).
  17. Hiroki Fujiwara, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu and Jiexun Wang, ``Enumerating Tree-like Chemical Structures from Feature Vector,'' Proc. Korea-Japan Joint Workshop on Algorithms and Computation, Chonnam National University, Korea (August 9-10, 2007).
  18. L. Zhao, T. Ohshima, H. Nagamochi. ``A* algorithm for the time-dependent shortest path problem,'' WAAC 2008, pp. 36--43. Final paper: PDF (2.9M).
  19. Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi. ``Security-aware beacon based network monitoring,'' 11th IEEE International Conference on Communication Systems 2008 (Guangzhou, China), pp. 527-531. Manuscript: iccs2008.pdf (116KB).
  20. Jiexun Wang, Liang Zhao, Hiroshi Nagamochi. ``Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem,'' Korean-Japan Joint Workshop WAAC 2009 (Seoul, Korea), pp. 101--108 (2009).
  21. Jiexun Wang, Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi, ``Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem (Abstract),'' Internatinal Conf. on Computational Intelligence and Software Engineering (CiSE) 2009 (Wuhan, China), pp. 1--4 (2009).
  22. Liang Zhao, Pipaporn Eumthurapojn, Hiroshi Nagamochi, ``A Practical Speed-up Technique for A* Algorithms (Abstract),'' Proc. of the 4th Asian Association for Algorithms and Computation (AAAC 2011, Taiwan, 2011).
  23. Liang Zhao, Mingji Gao, ``Node Early-Fixing: A Practical Speedup Technique for A* Algorithms,'' Proc. of 2nd Annual International Conference on Operations Research and Statistics (ORS 2012), Bali, Indonesia, pp. 138--141, 2012.
  24. Qiaoyun Chen, Liang Zhao, ``Approximation algorithms for the L-distance vertex cover problem,'' Proc. Third International Conference on Theoretical and Mathematical Foundations of Computer Science (ICTMF 2012), Bali, Indonesia, pp. 100-104, 2012.
  25. Liang Zhao, Hiroshi Kadowaki, ``An Improved Linear-Time Algorithm for Finding Small L-VertexCovers,'' Proc. 16th Korea-Japan Joint Workshop on Algorithms and Computation, Suwon, Korea (July 12-13, 2013), pp. 38-42, 2013.
  26. Liang Zhao, Jia Li and Dorothea Wagner, ``$\gamma_k(G) \le \lfloor \frac{n}{2k+1} \rfloor$ for maximal outerplanar graphs satisfying $n \bmod (2k+1) \le 4$,'' Proc. The 17th Korea-Japan Joint Workshop on Algorithms and Computation, Okinawa, Japan (July 13-15, 2014).
  27. Liang Zhao, ``Majority Dominating and Democratic Number: A Proposal to Define the Democracy of a Social Network,'' Proc. 5th Operations Research and Statistics (ORS 2016), Singapore (Jan. 18-19, 2016), pp. 66-67, 2016.
  28. Liang Zhao, ``A Note on Distance Domination in Maximal Outerplanar Graphs (Extended Abstract),'' The 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3 2016), Tokyo University of Science, Tokyo, 2016-09.

Conference (no peer-review)

  1. 趙亮,永持仁,茨木俊秀,最小3-カットを使った最小k-カットの近似,JAMS年次大会 (1999).
  2. L. Zhao, H. Nagamochi and T. Ibaraki. "Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts". Technical Report of IEICE. COMP99 (13), pp. 25--32 (1999-6).
  3. L. Zhao, H. Nagamochi and T. Ibaraki. "Greedy splitting: a unified approach for approximating some partition problems". Mathematical optimization theory and its algorithms (Japanese) (Kyoto, 2001). Surikaisekikenkyusho Kokyuroku No. 1241 (2001), pp. 139--147.
  4. L. Zhao, H. Nagamochi and T. Ibaraki. "A primal-dual approximation algorithm for the survivable network design problem in hypergraphs". New developments of the theory of computation and algorithms (Japanese) (Kyoto, 2001). Surikaisekikenkyusho Kokyuroku No. 1205 (2001), pp. 7--12.
  5. 続義道, 明石賢昭, 宮地悟史, 趙亮, 山本英雄, 介護支援用遠隔制御IPテレビ電話の試み, 映像情報メディア学会技術報告 26 (69), pp. 17--20 (2002-10).
  6. 加藤和明,趙亮,酒澤茂之,山本英雄, 動きに着目した階層型マルチキャストの受信制御,2003年映像情報メディア学会年次大会.
  7. 根本良男,飯野友記,酒澤茂之,趙亮,山本英雄, マルチキャスト環境における帯域測定について, 映像情報メディア学会技術報告 映情学技報 vol. 28, no. 46, pp. 35--36 (2004-08).
  8. 安良岡由規,趙亮,山本英雄, 映像配信用P2Pネットワークの検討,映像情報メディア学会技術報告 映情学技報 vol. 28, no. 46, pp. 37--38 (2004-08).
  9. 加藤和明,飯野友記,酒澤茂之,趙亮,山本英雄, 階層型ビデオマルチキャストにおける帯域測定のためのプローブパケットの利用, IEICE 信学技報 IE2004-84, pp. 27--31 (2004-11).
  10. 劉鵬,相川智慎,宮地悟史,趙亮,山本英雄, H.264におけるマクロブロックモード選択に関する研究, 情報理論とその応用シンポジウム予稿集 (SITA2004), pp. 799--802 (2004-12).
  11. 齋藤真樹,趙亮,塩野目剛亮,鎌田一雄,山本英雄, 携帯電話を用いた手話辞書検索サービスの基礎検討, ITE 技術報告 vol. 29, no. 42, pp. 9--12, AIT2005-92 (2005-07).
  12. 足立孝正,趙亮,酒澤茂之,山本英雄, 電子透かし技術MPmarkの非圧縮ドメインにおける透かし検出, ITE 技術報告 vol. 29, no. 42, pp. 29--32, AIT2005-97 (2005-07).
  13. L. Zhao and H. Yamamoto, "A Study on Reception Control for RLM with Multiple Sources". ITE annual conference 2005 (2005-08).
  14. 窪田伸一,趙亮,山本英雄,宮地悟史, 携帯電話を用いた遠隔監視システムのカメラ制御について, 2005年映像情報メディア学会年次大会 (2005-08).
  15. 井上裕司,加藤和明,趙亮,山本英雄, 複数カメラ監視システムにおける人物追跡とカメラスイッチングの検討, 2005年映像情報メディア学会冬季大会(2005-12).
  16. 根本良男,酒澤茂之,趙亮,山本英雄, フレーム間予測を考慮したビデオスクランブル技術の検討, 2005年映像情報メディア学会冬季大会(2005-12).
  17. 安良岡由規,酒澤茂之,趙亮,山本英雄, MPEG-2符号化領域における電子透かしの高度化について, 2005年映像情報メディア学会冬季大会(2005-12).
  18. 松本祐輝,矢野豊,趙亮,鎌田一雄,山本英雄, 携帯電話を用いた手話広報情報配信サービスの構成に関する一検討, ヒューマンインタフェース学会研究報告集,vol. 8, no. 2, pp. 103--110 (2006).
  19. 安良岡由規,酒澤茂之,趙亮,山本英雄, MPEG-2符号化領域における電子透かしの高度化について, 映像情報メディア学会技術報告 30(17), pp. 69--72 (2006).
  20. 矢野豊,松本祐輝,趙亮,鎌田一雄,山本英雄, 広報情報のユニバーサル化に関する基礎検討,信学技報,HCS2005-57, pp. 13--16 (2006-01).
  21. Hiroki Fujiwara, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu. ``Enumerating Tree-like Chemical Structures from Feature Vector,'' 7th IPSJ SIG BIO 2006 (135), pp. 111--118 (2006).
  22. 三輪直樹,趙亮,永持仁, P2Pシステムのための深さ最小木の構築について, 信学技報, vol. 107, no. 229(CQ), 230(OIS), 231(IE), CQ2007-54, OIS2007-44, IE2007-51, pp. 101--106 (2007-09).
  23. Liang Zhao, Tatsuya Ohshima, Hiroshi Nagamochi. ``A* algorithm for the time-dependent shortest path problem,'' 119th IPSJ SIGAL (Tokyo, Japan, May 27, 2008).
  24. 金在成,佐々木方太,趙亮,永持仁, ``An Efficient Algorithm for Large-scale Beacon Placement Problem,'' 電子情報通信学会総合大会講演論文集 2009, pp. S-29--S-30 (2009).
  25. 汪杰シュン,金在成,佐々木方太,趙亮,永持仁, ビーコン配置問題と対偶問題に対する効率的近似アルゴリズム, 情報処理学会アルゴリズム研究会報告,vol. 2009-AL-125, pp. 1--6 (2009-07).
  26. Liang Zhao, Jaeseong Gim, Hiroshi Nagamochi. ``On An Edge-Dominating Problem in Networks,'' IPSJ NetecoSymp2010 (Tsukuba, Japan, Dec. 17--18, 2009).
  27. Liang Zhao, Pipaporn Eumthurapojn, Hiroshi Nagamochi. ``Accelerating A* algorithms by sweeping out small-degree nodes,'' 情報処理学会アルゴリズム研究会報告,vol. 2011-AL-134(5), pp. 1--4 (2011-02).
  28. Mingji Gao, Liang Zhao. ``Some practical speed-up techniques for A* algorithms,'' 情報処理学会アルゴリズム研究会報告,vol. 2011-AL-137(7), pp. 1--2 (2011-11).
  29. Qiaoyun Chen, Liang Zhao. ``Approximation algorithms for the L-distance vertex cover problem,'' 情報処理学会研究報告,アルゴリズム研究会 2012-AL-141 (5), 1-3 (2012-09).
  30. Hiroshi Kadowaki, Liang Zhao, ``An empirical study for independent distance dominating sets in large-scale graphs,'' 電子情報通信学会コンピュテーション研究会(COMP)(沖縄、2013年12月20-21)
  31. Liang Zhao, Jia Li, Dorothea Wagner, ``A note on distance dominating in maximal outerplanar graphs,'' 情報処理学会報告,アルゴリズム研究会報告 2014-AL-147 (14), 1-3 (2014-02).
  32. 趙亮,``民主度指数を用いた代表選と一票格差への考察,''情報処理学会第13回ネットワーク生態学シンポジウムポスター発表,概要 (2016-08).
  33. Liang Zhao, ``Optimal Assignment of Evacuation Centers,'' in Scientific Exchange in Hydrology between Kyoto University and NIGLAS, CAS (2016-11-18).

招待講演

  1. 关于人工智能和人类生存的一些思考(首届中国留日学人综合学术创新论坛概要), 2016年7月31日
  2. 人工智能的挑战,京都大学学友会2015年度第四届学术报告邀请会,京都大学东一条馆思修馆礼堂,2015年7月25日

Project

Manuscript (unpublished)

Social works

Dissertation

Here comes my dissertation "Approximation Algorithms for Partition and Design Problems in Networks" gzipped PS file (652K) or PDF file (1.6M) (2002.3 Kyoto).

Errata (2004-02-26):