川原 純

Last Update: 2019/06/27 16:39:27

Print

Name(Kanji/Kana/Abecedarium Latinum)
川原 純/カワハラ ジュン/Kawahara, Jun
Primary Affiliation(Org1/Job title)
Graduate Schools Informatics/Associate Professor
Faculty
Org1 Job title
工学部
Academic Organizations You are Affiliated to in Japan
Organization name(Japanese) Organization name(English)
電子情報通信学会 The Institute of Electronics, Information and Communication Engineers
日本計算機統計学会 Japanese Society of Computational Statistics
日本オペレーションズ・リサーチ学会 The Operations Research Society of Japan
Academic Degree
Field(Japanese) Field(English) University(Japanese) University(English) Method
修士（情報学） 京都大学 Kyoto University
博士（情報学） 京都大学 Kyoto University
Personal Website(s) (URL(s))
URL
http://www.lab2.kuis.kyoto-u.ac.jp/jkawahara/
ORCID ID
https://orcid.org/0000-0001-7208-044X
researchmap URL
https://researchmap.jp/junkawahara
Research Topics
(Japanese)
ゼロサプレス型二分決定グラフを用いた解空間の圧縮保持によりグラフ最適化問題を解くアルゴリズムの設計と評価
(English)
Design and evaluation of algorithms that solve graph optimization programs using zero-suppressed binary decision diagrams
Overview of the research
(Japanese)
ゼロサプレス型二分決定グラフは集合族を圧縮して効率良く保持するデータ構造である。与えられたグラフに対して、グラフ上のパスや全域木などの様々な部分グラフ構造を列挙して、ゼロサプレス型二分決定グラフを用いて圧縮された状態で保持を行うアルゴリズムの設計と評価を行う。一票の格差の小さな選挙区割の求解や、災害からの避難時間を短くする避難所割当などの社会システム設計に現れるグラフ最適化問題への応用に関する研究も行う。
(English)
A zero-suppressed binary decision diagram is a data structure that compactly and efficiently represents a family of sets. I have been researching design and evaluation of algorithms that enumerate subgraph structures of a given graph such as paths and spanning forests, and that store them into zero-suppressed binary decision diagrams. I have also been researching graph optimization problems such as political redistricting and evacuation planning as applications of my algorithms.
Fields of research (key words)
Key words(Japanese) Key words(English)
アルゴリズム理論 Algorithm theory
離散構造 Discrete Structure
組合せ最適化 Combinatorial optimization
社会システム工学 Social systems engineering
Published Papers
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
Yuko Sakurai, Jun Kawahara, Satoshi Oyama Yuko Sakurai, Jun Kawahara, Satoshi Oyama Yuko Sakurai, Jun Kawahara, Satoshi Oyama Aggregating Crowd Opinions Using Shapley Value Regression Aggregating Crowd Opinions Using Shapley Value Regression Aggregating Crowd Opinions Using Shapley Value Regression In Proceedings of the 12th Multi-disciplinary International Conference on Artificial Intelligence (MIWAI 2018) In Proceedings of the 12th Multi-disciplinary International Conference on Artificial Intelligence (MIWAI 2018) In Proceedings of the 12th Multi-disciplinary International Conference on Artificial Intelligence (MIWAI 2018) 2018/11 Refereed English Research paper(international conference proceedings) Disclose to all
Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shoji Kasahara Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shoji Kasahara Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shoji Kasahara Enumerating All Spanning Shortest Path Forests Using Zero-suppressed Binary Decision Diagrams Enumerating All Spanning Shortest Path Forests Using Zero-suppressed Binary Decision Diagrams Enumerating All Spanning Shortest Path Forests Using Zero-suppressed Binary Decision Diagrams IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E101-A, 9, 1363-1374 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E101-A, 9, 1363-1374 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E101-A, 9, 1363-1374 2018/09 Refereed English Research paper(scientific journal) Disclose to all
Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane DenseZDD: a compact and fast index for families of sets DenseZDD: a compact and fast index for families of sets DenseZDD: a compact and fast index for families of sets Algorithms, 11, 8 Algorithms, 11, 8 Algorithms, 11, 8 2018/08 Refereed English Research paper(scientific journal) Disclose to all
Yu Nakahata, Jun Kawahara, Shoji Kasahara Yu Nakahata, Jun Kawahara, Shoji Kasahara Yu Nakahata, Jun Kawahara, Shoji Kasahara Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams In Proceedings of the 17th International Symposium on Experimental Algorithms (SEA 2018), 103, 21:1-21:13 In Proceedings of the 17th International Symposium on Experimental Algorithms (SEA 2018), 103, 21:1-21:13 In Proceedings of the 17th International Symposium on Experimental Algorithms (SEA 2018), 103, 21:1-21:13 2018/06 Refereed English Research paper(international conference proceedings) Disclose to all
Shoji Kasahara, Jun Kawahara Shoji Kasahara, Jun Kawahara Shoji Kasahara, Jun Kawahara Effect of Bitcoin Fee on Transaction-Confirmation Process Effect of Bitcoin Fee on Transaction-Confirmation Process Effect of Bitcoin Fee on Transaction-Confirmation Process Journal of Industrial and Management Optimization, 13 Journal of Industrial and Management Optimization, 13 Journal of Industrial and Management Optimization, 13 2018/04 Refereed English Research paper(scientific journal) Disclose to all
Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara Automatic Evacuation Guiding Scheme Based on Implicit Interactions Between Evacuees and Their Mobile Nodes Automatic Evacuation Guiding Scheme Based on Implicit Interactions Between Evacuees and Their Mobile Nodes Automatic Evacuation Guiding Scheme Based on Implicit Interactions Between Evacuees and Their Mobile Nodes GeoInformatica, 22, 1, 127-141 GeoInformatica, 22, 1, 127-141 GeoInformatica, 22, 1, 127-141 2018/01 Refereed English Research paper(scientific journal) Disclose to all
Jun Kawahara, Takeru Inoue, Hiroaki Iwashita, Shin-ichi Minato Jun Kawahara, Takeru Inoue, Hiroaki Iwashita, Shin-ichi Minato Jun Kawahara, Takeru Inoue, Hiroaki Iwashita, Shin-ichi Minato Frontier-based Search for Enumerating All Constrained Subgraphs with Compressed Representation Frontier-based Search for Enumerating All Constrained Subgraphs with Compressed Representation Frontier-based Search for Enumerating All Constrained Subgraphs with Compressed Representation IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E100-A, 9, 1773-1784 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E100-A, 9, 1773-1784 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E100-A, 9, 1773-1784 2017/09 Refereed English Research paper(scientific journal) Disclose to all
Ryohei Eguchi, Naoaki Ono, Hisayuki Horai, Md.Altuf-Ul Amin, Aki Morita Hirai, Jun Kawahara, Shoji Kasahara, Tomoaki Endo, Shigehiko Kanaya Ryohei Eguchi, Naoaki Ono, Hisayuki Horai, Md.Altuf-Ul Amin, Aki Morita Hirai, Jun Kawahara, Shoji Kasahara, Tomoaki Endo, Shigehiko Kanaya Ryohei Eguchi, Naoaki Ono, Hisayuki Horai, Md.Altuf-Ul Amin, Aki Morita Hirai, Jun Kawahara, Shoji Kasahara, Tomoaki Endo, Shigehiko Kanaya Classification of Alkaloid Compounds Based on Subring Skeleton (SRS) Profiling: On Finding Relationship of Compounds with Metabolic Pathways Classification of Alkaloid Compounds Based on Subring Skeleton (SRS) Profiling: On Finding Relationship of Compounds with Metabolic Pathways Classification of Alkaloid Compounds Based on Subring Skeleton (SRS) Profiling: On Finding Relationship of Compounds with Metabolic Pathways Journal of Computer Aided Chemistry, 18, 58-75 Journal of Computer Aided Chemistry, 18, 58-75 Journal of Computer Aided Chemistry, 18, 58-75 2017/08 Refereed English Research paper(scientific journal) Disclose to all
Joe Suzuki, Jun Kawahara Joe Suzuki, Jun Kawahara Joe Suzuki, Jun Kawahara Branch and Bound for Regular Bayesian Network Structure Learning Branch and Bound for Regular Bayesian Network Structure Learning Branch and Bound for Regular Bayesian Network Structure Learning In Proceedings of the 33rd conference on Uncertainty in Artificial Intelligence (UAI 2017) In Proceedings of the 33rd conference on Uncertainty in Artificial Intelligence (UAI 2017) In Proceedings of the 33rd conference on Uncertainty in Artificial Intelligence (UAI 2017) 2017/08 Refereed English Research paper(international conference proceedings) Disclose to all
戸田 貴久, 斎藤 寿樹, 岩下 洋哲, 川原 純, 湊 真一 戸田 貴久, 斎藤 寿樹, 岩下 洋哲, 川原 純, 湊 真一 ZDDと列挙問題 - 最新の技法とプログラミングツール ZDDと列挙問題 - 最新の技法とプログラミングツール コンピュータソフトウェア, 34, 3, 97-120 コンピュータソフトウェア, 34, 3, 97-120 , 34, 3, 97-120 2017/07 Refereed Japanese Research paper(scientific journal) Disclose to all
Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka The Time Complexity of the Token Swapping Problem and Its Parallel Variants The Time Complexity of the Token Swapping Problem and Its Parallel Variants The Time Complexity of the Token Swapping Problem and Its Parallel Variants In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), 10167, 448-459 In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), 10167, 448-459 In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), 10167, 448-459 2017/03 Refereed English Research paper(international conference proceedings) Disclose to all
Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato Generating All Patterns of Graph Partitions within a Disparity Bound Generating All Patterns of Graph Partitions within a Disparity Bound Generating All Patterns of Graph Partitions within a Disparity Bound In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), 10167, 119-131 In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), 10167, 119-131 In Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017), 10167, 119-131 2017/03 Refereed English Research paper(international conference proceedings) Disclose to all
Junki Itoi, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara Junki Itoi, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara Junki Itoi, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara An Offline Mobile Application for Automatic Evacuation Guiding in Outdoor Environments An Offline Mobile Application for Automatic Evacuation Guiding in Outdoor Environments An Offline Mobile Application for Automatic Evacuation Guiding in Outdoor Environments Scientific Phone Apps and Mobile Devices, 3, 1, 1-10 Scientific Phone Apps and Mobile Devices, 3, 1, 1-10 Scientific Phone Apps and Mobile Devices, 3, 1, 1-10 2017/01 Refereed English Research paper(scientific journal) Disclose to all
Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki Better Bounds for Online k-Frame Throughput Maximization in Network Switches Better Bounds for Online k-Frame Throughput Maximization in Network Switches Better Bounds for Online k-Frame Throughput Maximization in Network Switches Theoretical Computer Science, 657, part B, 173-190 Theoretical Computer Science, 657, part B, 173-190 Theoretical Computer Science, 657, part B, 173-190 2017/01 Refereed English Research paper(scientific journal) Disclose to all
Apichanukul Worachate, Jun Kawahara, Shoji Kasahara Apichanukul Worachate, Jun Kawahara, Shoji Kasahara Apichanukul Worachate, Jun Kawahara, Shoji Kasahara Accuracy Improvement for Backup Tasks in Hadoop Speculative Algorithm Accuracy Improvement for Backup Tasks in Hadoop Speculative Algorithm Accuracy Improvement for Backup Tasks in Hadoop Speculative Algorithm In Proceedings of the 6th IEEE International Symposium on Cloud and Services Computing, 500-507 In Proceedings of the 6th IEEE International Symposium on Cloud and Services Computing, 500-507 In Proceedings of the 6th IEEE International Symposium on Cloud and Services Computing, 500-507 2016/12 Refereed English Research paper(international conference proceedings) Disclose to all
Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs Solving the longest oneway-ticket problem and enumerating letter graphs by augmenting the two representative approaches with ZDDs In Proceedings of the Computational Intelligence in Information Systems: Proceedings of the Computational Intelligence in Information Systems Conference (CIIS 2016), 532, 294-305 In Proceedings of the Computational Intelligence in Information Systems: Proceedings of the Computational Intelligence in Information Systems Conference (CIIS 2016), 532, 294-305 In Proceedings of the Computational Intelligence in Information Systems: Proceedings of the Computational Intelligence in Information Systems Conference (CIIS 2016), 532, 294-305 2016/11 Refereed English Research paper(international conference proceedings) Disclose to all
Takeru Inoue, Hiroaki Iwashita, Jun Kawahara, Shin-ichi Minato Takeru Inoue, Hiroaki Iwashita, Jun Kawahara, Shin-ichi Minato Takeru Inoue, Hiroaki Iwashita, Jun Kawahara, Shin-ichi Minato Graphillion: software library designed for very large sets of labeled graphs Graphillion: software library designed for very large sets of labeled graphs Graphillion: software library designed for very large sets of labeled graphs International Journal on Software Tools for Technology Transfer, 18, 1, 57-66 International Journal on Software Tools for Technology Transfer, 18, 1, 57-66 International Journal on Software Tools for Technology Transfer, 18, 1, 57-66 2016/02 Refereed English Research paper(scientific journal) Disclose to all
Jun Kawahara, Koji M. Kobayashi Jun Kawahara, Koji M. Kobayashi Jun Kawahara, Koji M. Kobayashi Optimal buffer management for 2-frame throughput maximization Optimal buffer management for 2-frame throughput maximization Optimal buffer management for 2-frame throughput maximization Computer Networks, 91, 804-820 Computer Networks, 91, 804-820 Computer Networks, 91, 804-820 2015/11 Refereed English Research paper(scientific journal) Disclose to all
Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda Tight analysis of priority queuing for egress traffic Tight analysis of priority queuing for egress traffic Tight analysis of priority queuing for egress traffic Computer Networks, 91, 614-624 Computer Networks, 91, 614-624 Computer Networks, 91, 614-624 2015/11 Refereed English Research paper(scientific journal) Disclose to all
Jun Kawahara, Koji M. Kobayashi Jun Kawahara, Koji M. Kobayashi Jun Kawahara, Koji M. Kobayashi An improved lower bound for one-dimensional online unit clustering An improved lower bound for one-dimensional online unit clustering An improved lower bound for one-dimensional online unit clustering Theoretical Computer Science, 600, 171-173 Theoretical Computer Science, 600, 171-173 Theoretical Computer Science, 600, 171-173 2015/10 Refereed English Research paper(scientific journal) Disclose to all
Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara Automatic evacuation guiding scheme using trajectories of mobile nodes Automatic evacuation guiding scheme using trajectories of mobile nodes Automatic evacuation guiding scheme using trajectories of mobile nodes In Proceedings of the 12th International Conference on Mobile Web and Intelligent Information Systems (MobiWis2015), 9228, 3-14 In Proceedings of the 12th International Conference on Mobile Web and Intelligent Information Systems (MobiWis2015), 9228, 3-14 In Proceedings of the 12th International Conference on Mobile Web and Intelligent Information Systems (MobiWis2015), 9228, 3-14 2015/08 Refereed English Research paper(international conference proceedings) Disclose to all
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno Swapping labeled tokens on graphs Swapping labeled tokens on graphs Swapping labeled tokens on graphs Theoretical Computer Science, 586, 81-94 Theoretical Computer Science, 586, 81-94 Theoretical Computer Science, 586, 81-94 2015/06 Refereed English Research paper(scientific journal) Disclose to all
Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda Tight analysis of priority queuing for egress traffic Tight analysis of priority queuing for egress traffic Tight analysis of priority queuing for egress traffic In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014), 8881, 459-473 In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014), 8881, 459-473 In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014), 8881, 459-473 2014/12 Refereed English Research paper(international conference proceedings) Disclose to all
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno Swapping labeled tokens on graphs Swapping labeled tokens on graphs Swapping labeled tokens on graphs In Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), 8496, 364-375 In Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), 8496, 364-375 In Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), 8496, 364-375 2014/07 Refereed English Research paper(international conference proceedings) Disclose to all
Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane DenseZDD: a compact and fast index for families of sets DenseZDD: a compact and fast index for families of sets DenseZDD: a compact and fast index for families of sets In Proceedings of the 13th International Symposium on Experimental Algorithms (SEA 2014), 8504, 187-198 In Proceedings of the 13th International Symposium on Experimental Algorithms (SEA 2014), 8504, 187-198 In Proceedings of the 13th International Symposium on Experimental Algorithms (SEA 2014), 8504, 187-198 2014/07 Refereed English Research paper(international conference proceedings) Disclose to all
Takeru Inoue, Keiji Takano, Takayuki Watanabe, Jun Kawahara, Ryo Yoshinaka, Akihiro Kishimoto, Koji Tsuda, Shin-ichi Minato, Yasuhiro Hayashi Takeru Inoue, Keiji Takano, Takayuki Watanabe, Jun Kawahara, Ryo Yoshinaka, Akihiro Kishimoto, Koji Tsuda, Shin-ichi Minato, Yasuhiro Hayashi Takeru Inoue, Keiji Takano, Takayuki Watanabe, Jun Kawahara, Ryo Yoshinaka, Akihiro Kishimoto, Koji Tsuda, Shin-ichi Minato, Yasuhiro Hayashi Distribution loss minimization with guaranteed error bound Distribution loss minimization with guaranteed error bound Distribution loss minimization with guaranteed error bound IEEE Transactions on Smart Grid, 5, 1, 102-111 IEEE Transactions on Smart Grid, 5, 1, 102-111 IEEE Transactions on Smart Grid, 5, 1, 102-111 2014/01 Refereed English Research paper(scientific journal) Disclose to all
Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki Better bounds for online k-frame throughput maximization in network switches Better bounds for online k-frame throughput maximization in network switches Better bounds for online k-frame throughput maximization in network switches In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013), 8283, 218-228 In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013), 8283, 218-228 In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013), 8283, 218-228 2013/12 Refereed English Research paper(international conference proceedings) Disclose to all
Atsushi Takizawa, Yasufumi Takechi, Akio Ohta, Naoki Katoh, Takeru Inoue, Takashi Horiyama, Jun Kawahara, Shin-ichi Minato Atsushi Takizawa, Yasufumi Takechi, Akio Ohta, Naoki Katoh, Takeru Inoue, Takashi Horiyama, Jun Kawahara, Shin-ichi Minato Atsushi Takizawa, Yasufumi Takechi, Akio Ohta, Naoki Katoh, Takeru Inoue, Takashi Horiyama, Jun Kawahara, Shin-ichi Minato Enumeration of region partitioning for evacuation planning based on ZDD Enumeration of region partitioning for evacuation planning based on ZDD Enumeration of region partitioning for evacuation planning based on ZDD In Proceedings of the International Symposium on Operations Research and its Applications (ISORA 2013), 64-71 In Proceedings of the International Symposium on Operations Research and its Applications (ISORA 2013), 64-71 In Proceedings of the International Symposium on Operations Research and its Applications (ISORA 2013), 64-71 2013/08 Refereed English Research paper(international conference proceedings) Disclose to all
Jun Kawahara, Koji M. Kobayashi Jun Kawahara, Koji M. Kobayashi Jun Kawahara, Koji M. Kobayashi Optimal buffer management for 2-frame throughput maximization Optimal buffer management for 2-frame throughput maximization Optimal buffer management for 2-frame throughput maximization In Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2013), 8179, 274-285. In Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2013), 8179, 274-285. In Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2013), 8179, 274-285. 2013/07 Refereed English Research paper(international conference proceedings) Disclose to all
Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato Shared-memory parallel frontier-based search Shared-memory parallel frontier-based search Shared-memory parallel frontier-based search In Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM 2013), 7748, 170-181 In Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM 2013), 7748, 170-181 In Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM 2013), 7748, 170-181 2013/02 Refereed English Research paper(international conference proceedings) Disclose to all
Ryo Yoshinaka, Jun Kawahara, Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato Ryo Yoshinaka, Jun Kawahara, Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato Ryo Yoshinaka, Jun Kawahara, Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato Counterexamples to the long-standing conjecture on the complexity of BDD binary operations Counterexamples to the long-standing conjecture on the complexity of BDD binary operations Counterexamples to the long-standing conjecture on the complexity of BDD binary operations Information Processing Letters, 112, 16, 636-640 Information Processing Letters, 112, 16, 636-640 Information Processing Letters, 112, 16, 636-640 2012/08 Refereed English Research paper(scientific journal) Disclose to all
Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara, Koji Tsuruma, Hiroaki Iwashita, Shin-ichi Minato Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara, Koji Tsuruma, Hiroaki Iwashita, Shin-ichi Minato Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara, Koji Tsuruma, Hiroaki Iwashita, Shin-ichi Minato Finding all solutions and instances of numberlink and slitherlink by ZDDs Finding all solutions and instances of numberlink and slitherlink by ZDDs Finding all solutions and instances of numberlink and slitherlink by ZDDs Algorithms, 5, 2, 176-213 Algorithms, 5, 2, 176-213 Algorithms, 5, 2, 176-213 2012/04 Refereed English Research paper(scientific journal) Disclose to all
Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara An online algorithm optimally self-tuning to congestion for power management problems An online algorithm optimally self-tuning to congestion for power management problems An online algorithm optimally self-tuning to congestion for power management problems In Proceedings of the 9th Workshop on Approximation and Online Algorithms (WAOA 2011), 7164, 35-48 In Proceedings of the 9th Workshop on Approximation and Online Algorithms (WAOA 2011), 7164, 35-48 In Proceedings of the 9th Workshop on Approximation and Online Algorithms (WAOA 2011), 7164, 35-48 2011/09 Refereed English Research paper(international conference proceedings) Disclose to all
Wolfgang Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec Wolfgang Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec Wolfgang Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec A randomized algorithm for two servers in cross polytope spaces A randomized algorithm for two servers in cross polytope spaces A randomized algorithm for two servers in cross polytope spaces Theoretical Computer Science, 412, 7, 563-572 Theoretical Computer Science, 412, 7, 563-572 Theoretical Computer Science, 412, 7, 563-572 2011/02 Refereed English Research paper(scientific journal) Disclose to all
Wolfgang Bein, Kazuo Iwama, Jun Kawahara Wolfgang Bein, Kazuo Iwama, Jun Kawahara Wolfgang Bein, Kazuo Iwama, Jun Kawahara Randomized competitive analysis for two-server problems Randomized competitive analysis for two-server problems Randomized competitive analysis for two-server problems In Proceedings of the 16th annual European symposium on Algorithms (ESA 2008), 5193, 161-172 In Proceedings of the 16th annual European symposium on Algorithms (ESA 2008), 5193, 161-172 In Proceedings of the 16th annual European symposium on Algorithms (ESA 2008), 5193, 161-172 2008/09 Refereed English Research paper(international conference proceedings) Disclose to all
Wolfgang Bein, Kazuo Iwama, Jun Kawahara Wolfgang Bein, Kazuo Iwama, Jun Kawahara Wolfgang Bein, Kazuo Iwama, Jun Kawahara Randomized competitive analysis for two server problems Randomized competitive analysis for two server problems Randomized competitive analysis for two server problems Algorithms, 1, 1, 30-42 Algorithms, 1, 1, 30-42 Algorithms, 1, 1, 30-42 2008/09 Refereed English Research paper(scientific journal) Disclose to all
Wolfgang Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec Wolfgang Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec Wolfgang Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec A randomized algorithm for two servers in cross polytope spaces A randomized algorithm for two servers in cross polytope spaces A randomized algorithm for two servers in cross polytope spaces In Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA 2007), 4927, 246-259 In Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA 2007), 4927, 246-259 In Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA 2007), 4927, 246-259 2007/10 Refereed English Research paper(international conference proceedings) Disclose to all
Takashi Horiyama, Kazuo Iwama, Jun Kawahara Takashi Horiyama, Kazuo Iwama, Jun Kawahara Takashi Horiyama, Kazuo Iwama, Jun Kawahara Finite-state online algorithms and their automated competitive analysis Finite-state online algorithms and their automated competitive analysis Finite-state online algorithms and their automated competitive analysis In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 4288, 71-80 In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 4288, 71-80 In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 4288, 71-80 2006/12 Refereed English Research paper(international conference proceedings) Disclose to all
Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant Journal of Graph Algorithms and Applications Journal of Graph Algorithms and Applications Journal of Graph Algorithms and Applications Refereed English Research paper(scientific journal) Disclose to all

  • <<
  • >>
Title language:
Awards
Title(Japanese) Title(English) Organization name(Japanese) Organization name(English) Date
論文賞 日本計算機統計学会 Japanese Society of Computational Statistics 2019/06/01
Teaching subject(s)
Name(Japanese) Name(English) Term Department Period
オペレーティングシステム Operating Systems 前期 工学部 2019/04-2020/03
計算機科学のための数学演習 Mathematics in Practice for Computer Science 前期 工学部 2019/04-2020/03
Faculty management (title, position)
Title Period
情報セキュリティ委員会技術責任者 2019/04/01-2020/03/31
情報セキュリティ作業委員会委員 2019/04/01-2020/03/31
計算機小委員会委員 2019/04/01-2020/03/31

Back to Previous Page

Return to Page Top