Basic Information

Faculty

• 工学部

Academic Degree

• (Kyoto University)
• (Kyoto University)

Language of Instruction

• Japanese
• English

ID,URL

• ORCID ID

  0000-0001-7208-044X

• J-Global ID

  201801020635926987

• External link

  https://www.algo.cce.i.kyoto-u.ac.jp/jkawahara/

Website(s) (URL(s))

• https://www.algo.cce.i.kyoto-u.ac.jp/jkawahara/

researchmap URL

• https://researchmap.jp/junkawahara

Research

Research Topics, Overview of the research

• Research Topics

  Design and evaluation of algorithms that solve graph optimization programs using zero-suppressed binary decision diagrams

• Overview of the research

  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.

Research Areas

• Informatics, Information theory
• Social infrastructure (civil Engineering, architecture, disaster prevention), Social systems engineering

Papers

• Decrease and reset for power-down

  James Andro-Vasko; Wolfgang Bein; Hiro Ito; Shoji Kasahara; Jun Kawahara

  Energy Systems, 03 Sep. 2021

  
• The Essential Role of Empirical Validation in Legislative Redistricting Simulation

  Benjamin Fifield; Kosuke Imai; Jun Kawahara; Christopher T. Kenny

  Statistics and Public Policy, 08 Sep. 2020, Peer-reviewed

  
• Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams.

  Yu Nakahata; Masaaki Nishino; Jun Kawahara; Shin-ichi Minato

  In Proceedings of the 18th Symposium on Experimental Algorithms (SEA 2020), Jun. 2020, Peer-reviewed

  
• Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration.

  Yu Nakahata; Jun Kawahara; Takashi Horiyama; Shin-ichi Minato

  In Proceedings of the 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020), 2020, Peer-reviewed

  
• Efficient construction of binary decision diagrams for network reliability with imperfect vertices

  Jun Kawahara; Koki Sonoda; Takeru Inoue; Shoji Kasahara

  Reliability Engineering & System Safety, Aug. 2019, Peer-reviewed

  
• Colorful Frontier-based Search: Implicit Enumeration of Chordal and Interval Subgraphs

  Jun Kawahara; Toshiki Saitoh; Hirofumi Suzuki; Ryo Yoshinaka

  Special Event on Analysis of Experimental Algorithms (SEA^2 2019), Jun. 2019, Peer-reviewed

  
• Evaluation of hotspot cluster detection using spatial scan statistic based on exact counting

  Fumio Ishioka; Jun Kawahara; Masahiro Mizuta; Shin-ichi Minato; Koji Kurihara

  Japanese Journal of Statistics and Data Science, Jun. 2019, Peer-reviewed

  
• Effect of Bitcoin fee on transaction-confirmation process

  Shoji Kasahara; Jun Kawahara

  Journal of Industrial & Management Optimization, 2019, Peer-reviewed

  
• The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant

  Jun Kawahara; Toshiki Saitoh; Ryo Yoshinaka

  Journal of Graph Algorithms and Applications, Jan. 2019, Peer-reviewed

  
• A Fast Algorithm for Combinatorial Hotspot Mining Based on Spatial Scan Statistic.

  Shin-ichi Minato; Jun Kawahara; Fumio Ishioka; Masahiro Mizuta; Koji Kurihara

  In Proceedings of the 2019 SIAM International Conference on Data Mining (SDM 2019), 2019, Peer-reviewed

  
• Aggregating Crowd Opinions Using Shapley Value Regression

  Yuko Sakurai; Jun Kawahara; Satoshi Oyama

  In Proceedings of the 12th Multi-disciplinary International Conference on Artificial Intelligence (MIWAI 2018), Nov. 2018, Peer-reviewed

  
• Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints

  Yu NAKAHATA; Jun KAWAHARA; Takashi HORIYAMA; Shoji KASAHARA

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 01 Sep. 2018, Peer-reviewed

  
• DenseZDD: a compact and fast index for families of sets

  Shuhei Denzumi; Jun Kawahara; Koji Tsuda; Hiroki Arimura; Shin-ichi Minato; Kunihiko Sadakane

  Algorithms, Aug. 2018, Peer-reviewed

  
• Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams

  Yu Nakahata; Jun Kawahara; Shoji Kasahara

  In Proceedings of the 17th International Symposium on Experimental Algorithms (SEA 2018), Jun. 2018, Peer-reviewed

  
• Automatic evacuation guiding scheme based on implicit interactions between evacuees and their mobile nodes

  Nobuhisa Komatsu; Masahiro Sasabe; Jun Kawahara; Shoji Kasahara

  GeoInformatica, 01 Jan. 2018, Peer-reviewed

  
• Frontier-Based Search for Enumerating All Constrained Subgraphs with Compressed Representation

  Jun Kawahara; Takeru Inoue; Hiroaki Iwashita; Shin-ichi Minato

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Sep. 2017, Peer-reviewed

  
• Frontier-based search for enumerating all constrained subgraphs with compressed representation

  Jun Kawahara; Takeru Inoue; Hiroaki Iwashita; Shin Ichi Minato

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Sep. 2017, Peer-reviewed

  
• Branch and Bound for Regular Bayesian Network Structure Learning

  Joe Suzuki; Jun Kawahara

  In Proceedings of the 33rd conference on Uncertainty in Artificial Intelligence (UAI 2017), Aug. 2017, Peer-reviewed

  
• Classification of Alkaloid Compounds Based on Subring Skeleton (SRS) Profiling: On Finding Relationship of Compounds with Metabolic Pathways

  Ryohei Eguchi; Naoaki Ono; Hisayuki Horai; Md.Altuf-Ul Amin; Aki Morita Hirai; Jun Kawahara; Shoji Kasahara; Tomoaki Endo; Shigehiko Kanaya

  Journal of Computer Aided Chemistry, Aug. 2017, Peer-reviewed

  
• Solving the Longest Oneway-Ticket Problem and Enumerating Letter Graphs by Augmenting the Two Representative Approaches with ZDDs

  Jun Kawahara; Toshiki Saitoh; Hirofumi Suzuki; Ryo Yoshinaka

  COMPUTATIONAL INTELLIGENCE IN INFORMATION SYSTEMS, CIIS 2016, 2017, Peer-reviewed

  
• Generating All Patterns of Graph Partitions Within a Disparity Bound

  Jun Kawahara; Takashi Horiyama; Keisuke Hotta; Shin-ichi Minato

  WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 2017, Peer-reviewed

  
• The Time Complexity of the Token Swapping Problem and Its Parallel Variants

  Jun Kawahara; Toshiki Saitoh; Ryo Yoshinaka

  WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 2017, Peer-reviewed

  
• ZDDs and Enumeration Problems: State-of-The-Art Techniques and Programming Tool

  TODA Takahisa; SAITOH Toshiki; IWASHITA Hiroaki; KAWAHARA Jun; MINATO Shin-ichi

  Computer Software, 2017, Peer-reviewed, Invited

  
• Better bounds for online k-frame throughput maximization in network switches

  Jun Kawahara; Koji M. Kobayashi; Shuichi Miyazaki

  THEORETICAL COMPUTER SCIENCE, Jan. 2017, Peer-reviewed

  
• An Offline Mobile Application for Automatic Evacuation Guiding in Outdoor Environments

  Junki Itoi; Masahiro Sasabe; Jun Kawahara; Shoji Kasahara

  Scientific Phone Apps and Mobile Devices, Jan. 2017, Peer-reviewed

  
• Graphillion: software library for very large sets of labeled graphs

  Takeru Inoue; Hiroaki Iwashita; Jun Kawahara; Shin-ichi Minato

  INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, Feb. 2016, Peer-reviewed

  
• Accuracy Improvement for Backup Tasks in Hadoop Speculative Algorithm

  Worachate Apichanukul; Jun Kawahara; Shoji Kasahara

  2016 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (CIT), 2016, Peer-reviewed

  
• Tight analysis of priority queuing for egress traffic

  Jun Kawahara; Koji M. Kobayashi; Tomotaka Maeda

  COMPUTER NETWORKS, Nov. 2015, Peer-reviewed

  
• Optimal buffer management for 2-frame throughput maximization

  Jun Kawahara; Koji M. Kobayashi

  COMPUTER NETWORKS, Nov. 2015, Peer-reviewed

  
• An improved lower bound for one-dimensional online unit clustering

  Jun Kawahara; Koji M. Kobayashi

  THEORETICAL COMPUTER SCIENCE, Oct. 2015, Peer-reviewed

  
• Swapping labeled tokens on graphs

  Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki; Kei Uchizawa; Takeaki Uno

  THEORETICAL COMPUTER SCIENCE, Jun. 2015, Peer-reviewed

  
• Automatic Evacuation Guiding Scheme Using Trajectories of Mobile Nodes

  Nobuhisa Komatsu; Masahiro Sasabe; Jun Kawahara; Shoji Kasahara

  MOBILE WEB AND INTELLIGENT INFORMATION SYSTEMS, 2015, Peer-reviewed

  
• 「フカシギの数え方」から広がるアルゴリズムの理工学―二分決定グラフによる離散構造処理と広がる応用分野―3.順列の圧縮列挙索引化とソーティング

  KAWAHARA JUN; MINATO SHIN'ICHI

  電子情報通信学会誌, 01 Dec. 2014

  
• グラフ上のラベル付きトークン整列問題

  山中 克久; エリック; ドメイン(MIT; 伊藤 健洋; 川原純; 清見 礼; 岡本 吉央; 斎藤 寿樹; 鈴木 顕; 内澤 啓; 宇野 毅明(N

  電子情報通信学会コンピュテーション研究会資料, Apr. 2014

  
• DenseZDD: A Compact and Fast Index for Families of Sets

  Shuhei Denzumi; Jun Kawahara; Koji Tsuda; Hiroki Arimura; Shin-ichi Minato; Kunihiko Sadakane

  EXPERIMENTAL ALGORITHMS, SEA 2014, 2014, Peer-reviewed

  
• Swapping Labeled Tokens on Graphs

  Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki; Kei Uchizawa; Takeaki Uno

  FUN WITH ALGORITHMS, 2014, Peer-reviewed

  
• Tight Analysis of Priority Queuing for Egress Traffic

  Jun Kawahara; Koji M. Kobayashi; Tomotaka Maeda

  COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 2014, Peer-reviewed

  
• Distribution Loss Minimization With Guaranteed Error Bound

  Takeru Inoue; Keiji Takano; Takayuki Watanabe; Jun Kawahara; Ryo Yoshinaka; Akihiro Kishimoto; Koji Tsuda; Shin-ichi Minato; Yasuhiro Hayashi

  IEEE TRANSACTIONS ON SMART GRID, Jan. 2014, Peer-reviewed

  
• Enumeration of region partitioning for evacuation planning based on ZDD

  Atsushi Takizawa; Yasufumi Takechi; Akio Ohta; Naoki Katoh; Takeru Inoue; Takashi Horiyama; Jun Kawahara; Shin-ichi Minato

  In Proceedings of the International Symposium on Operations Research and its Applications (ISORA 2013), Aug. 2013, Peer-reviewed

  
• Succinct Indices Based on Zero-Suppressed Binary Decision Diagrams

  Shuhei Denzumi; Jun Kawahara; Koji Tsuda; Hiroki Arimura; Kunihiko Sadakane; Shin-ichi Minato

  電子情報通信学会コンピュテーション研究会, 信学技報, Mar. 2013

  
• 最小完全ハッシュ関数を用いたグリッドグラフ上の効率的なパス数え上げ

  岩下 洋哲; 中澤 吉男; 川原 純; 宇野 毅明; 湊 真一

  第143回情報処理学会アルゴリズム研究会報告, Mar. 2013

  
• Shared-memory parallel frontier-based search

  Shogo Takeuchi; Jun Kawahara; Akihiro Kishimoto; Shin-Ichi Minato

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, Peer-reviewed

  
• Optimal buffer management for 2-frame throughput maximization

  Jun Kawahara; Koji M. Kobayashi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, Peer-reviewed

  
• Better Bounds for Online k-Frame Throughput Maximization in Network Switches

  Jun Kawahara; Koji M. Kobayashi; Shuichi Miyazaki

  ALGORITHMS AND COMPUTATION, 2013, Peer-reviewed

  
• Enumeration of region partitioning for evacuation planning based on ZDD

  Atsushi Takizawa; Yasufumi Takechi; Akio Ohta; Naoki Katoh; Takeru Inoue; Takashi Horiyama; Jun Kawahara; Shin-Ichi Minato

  IET Conference Publications, 2013, Peer-reviewed

  
• An Efficient ZDD Construction Method Using Recuresive Specifications

  IWASHITA Hiroaki; KAWAHARA Jun; MINATO Shin-ichi

  IEICE technical report. Dependable computing, 19 Nov. 2012

  
• グラフ列挙索引化技法の種々の問題への適用(<特集>BDD/ZDDを用いた新しい列挙索引化技法(フロンティア法)とその応用)

  川原 純; 湊 真一

  オペレーションズ・リサーチ : 経営の科学, Nov. 2012, Peer-reviewed, Invited

  
• Counterexamples to the long-standing conjecture on the complexity of BDD binary operations

  Ryo Yoshinaka; Jun Kawahara; Shuhei Denzumi; Hiroki Arimura; Shin-ichi Minato

  INFORMATION PROCESSING LETTERS, Aug. 2012, Peer-reviewed

  
• An online algorithm optimally self-tuning to congestion for power management problems

  Wolfgang Bein; Naoki Hatta; Nelson Hernandez-Cons; Hiro Ito; Shoji Kasahara; Jun Kawahara

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, Peer-reviewed

  
• Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs.

  Ryo Yoshinaka; Toshiki Saitoh; Jun Kawahara; Koji Tsuruma; Hiroaki Iwashita; Shin-ichi Minato

  Algorithms, 2012, Peer-reviewed

  
• 種々のリンクパズルへの応用

  吉仲 亮; 岩下 洋哲; 川原 純; 斎藤 寿樹; 鶴間 浩二; 湊 真一

  オペレーションズ・リサーチ, 2012

  
• ZDDを用いた新たな列挙手法

  川原 純; 斎藤 寿樹; 湊 真一

  電子情報通信学会学会誌, 2012

  
• ZDD によるパスの列挙 (計算機科学とアルゴリズムの数理的基礎とその応用)

  川原 純; 斎藤 寿樹; 鈴木 拡; 湊 真一; 吉仲 亮

  数理解析研究所講究録, Jun. 2011

  
• Path Enumeration Algorithms Using ZDD and Their Performance Evaluations

  Toshiki Saitoh; Jun Kawahara; Ryo Yoshinaka; Hiromu Suzuki; Shin-ichi Minato

  IPSJ SIG Notes, 28 Feb. 2011

  
• A randomized algorithm for two servers in cross polytope spaces

  Wolfgang Bein; Kazuo Iwama; Jun Kawahara; Lawrence L. Larmore; James A. Oravec

  THEORETICAL COMPUTER SCIENCE, Feb. 2011, Peer-reviewed

  
• Randomized competitive analysis for two server problems

  Wolfgang Bein; Kazuo Iwama; Jun Kawahara

  Algorithms, Sep. 2008, Peer-reviewed

  
• A randomized algorithm for two servers in cross polytope spaces

  Wolfgang Bein; Kazuo Iwama; Jun Kawahara; Lawrence L. Larmore; James A. Oravec

  APPROXIMATION AND ONLINE ALGORITHMS, 2008, Peer-reviewed

  
• Randomized Competitive Analysis for Two-Server Problems

  Wolfgang Bein; Kazuo Iwama; Jun Kawahara

  ALGORITHMS - ESA 2008, 2008, Peer-reviewed

  
• Enumeration of Tsume-Shogi diagrams by the reverse method

  Takashi Horiyama; Hiro Ito; Kazuo Iwama; Jun Kawahara

  INTERNATIONAL CONFERENCE ON INFORMATICS EDUCATION AND RESEARCH FOR KNOWLEDGE-CIRCULATING SOCIETY, PROCEEDINGS, 2008, Peer-reviewed

  
• Finite-state online algorithms and their automated competitive analysis

  Takashi Horiyama; Kazuo Iwama; Jun Kawahara

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, Peer-reviewed

  

Misc.

• 大規模文字列集合データを表現するSequence BDDの高速な構築手法とその評価

  杉野 創; 川原 純; 湊 真一

  2021年度 人工知能学会全国大会 (第35回), 09 Jun. 2021

  
• Information theoretic lower bound of Hasse diagrams with degree constraint

  森順平; 川原純; 湊真一

  電子情報通信学会技術研究報告, 2020

  
• 選挙区割問題に対するZDDを用いた近似的列挙手法の提案と評価

  山崎宏紀; 川原純; 湊真一

  情報科学技術フォーラム講演論文集, 2020

  
• A Fast ZDD-Based Method for Enumerating All Solutions of Cost-Bounded Combinatorial Problems

  湊真一; 番原睦則; 堀山貴史; 川原純; 瀧川一学; 瀧川一学; 山口勇太郎

  電子情報通信学会技術研究報告(Web), 2020

  
• ZDDを用いたグラフ細分構造の列挙

  中畑裕; 川原純; 堀山貴史; 湊真一

  電子情報通信学会コンピュテーション研究会, 信学技報, May 2019

  
• Network reliability evaluation with arbitrary dependencies on link failures

  Jun Kawahara; Takeru Inoue; Shoji Kasahara

  電子情報通信学会 技術研究報告, Mar. 2019

  
• Decomposing a Graph into Unigraphs.

  Takashi Horiyama; Jun Kawahara; Shin-ichi Minato; Yu Nakahata

  CoRR, 2019

  
• On network reliability with link failure dependencies using BDDs

  吉田 拓弥; 川原 純; 井上 武; 笠原 正治

  電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 16 Nov. 2017

  
• On network reliability with link failure dependencies using BDDs

  吉田 拓弥; 川原 純; 井上 武; 笠原 正治

  電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 16 Nov. 2017

  
• リンクの故障に依存関係がある場合のネットワーク信頼性評価

  吉田拓弥; 川原純; 井上武; 笠原正治

  情報処理学会 アルゴリズム研究会, Nov. 2017

  
• Evaluation of influence of a mobility model based on person trip data on DTN routing

  石倉 明生; 川原 純; 笹部 昌弘; 笠原 正治

  電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 07 Mar. 2016

  
• On Information Sharing Scheme for Automatic Evacuation Guiding System Based on Cooperation between Evacuees and Their Mobile Nodes

  小松 展久; 笹部 昌弘; 川原 純; 笠原 正治

  電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 07 Mar. 2016

  
• Design, implementation, and evaluation of an offline evacuation guiding application considering positioning errors of mobile nodes

  糸井 純暉; 笹部 昌弘; 川原 純; 笠原 正治

  電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 07 Mar. 2016

  
• Evaluating connectivity on physical networks with switch failures

  Koki Sonoda; Jun Kawahara; Takeru Inoue; Shoji Kasahara; Osamu Akashi; Ryoichi Kawahara; Hiroshi Saito

  IEICE Technical Report, Mar. 2016

  
• 1-A-4 m連結成分分割の高速列挙法と区割の比較(情報・離散最適化)

  川原 純; 堀田 敬介; 堀山 貴史; 湊 真一

  日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集, 10 Sep. 2015

  
• B-15-8 Design of an evacuation guiding application based on cooperation between an evacuee and a mobile node

  Itoi Junki; Sasabe Masahiro; Kawahara Jun; Kasahara Shoji

  Proceedings of the Society Conference of IEICE, 25 Aug. 2015

  
• Path Enumeration Algorithm Using Zero-Suppressed Binary Decision Diagram for Path Selection in Overlay Networks

  園田 晃己; 川原 純; 笹部 昌弘

  電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 06 Jul. 2015

  
• BS-8-2 On detection of outlier trajectories in evacuation guiding system using trajectories of mobile terminals

  Otsuki Kohei; Kawahara Jun; Sasabe Masahiro; Kasahara Shoji

  Proceedings of the IEICE General Conference, 24 Feb. 2015

  
• Frontier-based Search for Enumerating All Constrained Subgraphs with Compressed Representation

  Jun Kawahara; Takeru Inoue; Hiroaki Iwashita; Shin-ichi Minato

  TCS Technical Reports, Division of Computer Science, Hokkaido University, Sep. 2014

  
• Improved bounds for online k-frame throughput maximization in network switches

  KOBAYASHI Koji M.; KAWAHARA Jun; MIYAZAKI Shuichi

  IEICE technical report. Theoretical foundations of Computing, 24 Apr. 2014

  
• ZDDを用いた都市の避難所割り当ての列挙

  瀧澤重志; 武知祥史; 大田章雄; 中野浩太郎; 加藤直樹; 井上武; 堀山貴史; 川原純; 湊真一

  日本オペレーションズ・リサーチ学会 秋季研究発表会, Sep. 2013

  
• Graphillion: Software Library Designed for Very Large Sets of Graphs in Python

  Takeru Inoue; Hiroaki Iwashita; Jun Kawahara; Shin-ichi Minato

  TCS Technical Reports, Division of Computer Science, Hokkaido University, Jun. 2013

  
• Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams

  DENZUMI Shuhei; KAWAHARA Jun; TSUDA Koji; ARIMURA Hiroki; MINATO Shin-ichi; SADAKANE Kunihiko

  IEICE technical report. Theoretical foundations of Computing, 11 Mar. 2013

  
• フロンティア法による電力網構成制御

  井上武; 高野圭司; 渡辺喬之; 川原純; 吉仲亮; 岸本章宏; 津田宏治; 湊真一; 林泰弘

  オペレーションズ・リサーチ, Nov. 2012, Invited

  
• Data Structures Using Decision Diagrams(My Bookmark)

  KAWAHARA Jun; Jun Kawahara

  人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence, 01 Sep. 2012

  
• Loss Minimization of Power Distribution Networks with Guaranteed Error Bound

  Takeru Inoue; Keiji Takano; Takayuki Watanabe; Jun Kawahara; Ryo Yoshinaka; Akihiro Kishimoto; Koji Tsuda; Shin-ichi Minato; Yasuhiro Hayashi

  TCS Technical Reports, Division of Computer Science, Hokkaido University, Aug. 2012

  
• [Invited Talk] Analyzing power distribution networks by frontier-based method

  井上武; 高野圭司; 渡辺喬之; 川原純; 吉仲亮; 岸本章宏; 津田宏治; 湊真一; 林泰弘

  電子情報通信学会 技術研究報告, Jul. 2012, Invited

  
• Generalization of ZDD Construction Algorithms for Enumerating and Indexing the Solutions of Combinatorial Problems

  KAWAHARA Jun; MINATO Shin-ichi

  IEICE technical report. Theoretical foundations of Computing, 14 Jun. 2012

  
• DK-2-2 Applying the Frontier-Based Search Method to Various Link Puzzle Problems

  Yoshinaka Ryo; Iwashita Hiroaki; Kawahara Jun; Saitoh Toshiki; Tsuruma Koji; Minato Shin-ichi

  Proceedings of the IEICE General Conference, 06 Mar. 2012

  
• DK-2-3 An application of the frontier-based method to configure power networks

  INOUE Takeru; TAKANO Keiji; WATANABE Takayuki; KAWAHARA Jun; YOSHINAKA Ryo; KISHIMOTO Akihiro; TSUDA Koji; MINATO Shin-ichi; HAYASHI Yasuhiro

  Proceedings of the IEICE General Conference, 06 Mar. 2012

  
• ZDDを用いた系統運用制約を満たす配電網構成の網羅的探索手法

  井上武; 高野圭司; 渡辺喬之; 川原純; 吉仲亮; 岸本章宏; 津田宏治; 湊真一; 林泰弘

  電気学会 全国大会, Mar. 2012

  
• フロンティア法の電力網構成制御への応用

  井上武; 高野圭司; 渡辺喬之; 川原純; 吉仲亮; 岸本章宏; 津田宏治; 湊真一; 林泰弘

  電子情報通信学会 総合大会, Mar. 2012

  
• Entwork Reliability Evaluation Using Efficient Path Enumeration ALgorithms

  斎藤寿樹; 川原純; 吉仲亮; 井上武; 湊真一

  電子情報通信学会 技術研究報告, Jul. 2011

  

Presentations

• 二分決定グラフを用いたネットワーク信頼性計算の最近の動向

  川原 純

  電子情報通信学会 ネットワークシステム研究会, 10 Oct. 2019, Invited

  
• 二分決定グラフを用いたグラフ最適化

  川原 純

  平成30年電気関係学会関西連合大会, 01 Dec. 2018, Invited

  

Awards

• 01 Jun. 2019

  Japanese Society of Computational Statistics, 論文賞

External funds: Kakenhi

• Engineering Approach for Expanding Combinatorial Reconfiguration: Toward a General-Purpose Solver Using Power Distribution Systems as a Steppingstone

  Grant-in-Aid for Transformative Research Areas (B)

  Transformative Research Areas, Section (IV)

  Kyoto University

  川原 純

  From 02 Oct. 2020, To 31 Mar. 2023, Granted

  組合せ遷移;グラフアルゴリズム;SAT;モデル検査;ゼロサプレス型二分決定グラフ;配電切替;SATソルバー

  https://kaken.nii.ac.jp/grant/KAKENHI-PLANNED-20H05794/
• Fusion of Computer Science, Engineering and Mathematics Approaches for Expanding Combinatorial Reconfiguration

  Grant-in-Aid for Transformative Research Areas (B)

  Transformative Research Areas, Section (IV)

  Tohoku University

  伊藤 健洋

  From 02 Oct. 2020, To 31 Mar. 2023, Granted

  組合せ遷移

  https://kaken.nii.ac.jp/grant/KAKENHI-ORGANIZER-20H05792/
• Research on Integrated Techniques of Enumeration and Optimization Based on Discrete Structure Manipulation Systems

  Grant-in-Aid for Scientific Research (A)

  Medium-sized Section 61:Human informatics and related fields

  Kyoto University

  湊 真一

  From 01 Apr. 2020, To 31 Mar. 2025, Granted

  アルゴリズム;離散構造;演算処理系;列挙;索引化

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-20H00605/
• Efficient generation algorithms for geometric graph classes

  Grant-in-Aid for Scientific Research (C)

  Basic Section 61030:Intelligent informatics-related

  Kyushu Institute of Technology

  齋藤 寿樹

  From 01 Apr. 2019, To 31 Mar. 2022, Granted

  グラフアルゴリズム;列挙アルゴリズム;グラフ;データ構造;ZDD

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-19K12098/
• Informatics Study on Ultra-Scalable Blockchain Technology

  Grant-in-Aid for Scientific Research (A)

  Medium-sized Section 60:Information science, computer engineering, and related fields

  Nara Institute of Science and Technology

  笠原 正治

  From 01 Apr. 2019, To 31 Mar. 2023, Granted

  ブロック・チェーン;DSSトリレンマ;低遅延P2Pネットワーク;高速ブロック同期;IoTアクセス制御;低遅延P2Pネットワーキング

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-19H01103/
• Solving graph optimization problems by compressing and storing solution space

  Grant-in-Aid for Scientific Research (C)

  Basic Section 25010:Social systems engineering-related

  Kyoto University;Nara Institute of Science and Technology

  Jun Kawahara

  From 01 Apr. 2018, To 31 Mar. 2021, Project Closed

  グラフアルゴリズム;データ構造;二分決定グラフ;区間グラフ;平面グラフ;ホットスポット検出;選挙区割;ネットワーク信頼性評価;グラフ最適化問題;組合せ最適化;列挙アルゴリズム;多目的最適化

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-18K04610/
• Research on algorithms and data structures for solving theoretically hard problems in practical time

  Grant-in-Aid for Scientific Research (A)

  Medium-sized Section 60:Information science, computer engineering, and related fields

  Japan Advanced Institute of Science and Technology

  上原 隆平

  From 01 Apr. 2018, To 31 Mar. 2023, Granted

  アルゴリズム;遷移問題;BDD;データ構造;グラフアルゴリズム;列挙アルゴリズム

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-18H04091/
• Approximate Computing to Cope with Imperfect Information from Growing Data Size

  Grant-in-Aid for Scientific Research (A)

  Kyoto University

  KAZUO IWAMA

  From 01 Apr. 2013, To 31 Mar. 2016, Project Closed

  アルゴリズム;計算困難問題;情報の補填;数理モデル化;理論的性能保証

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-25240002/
• Automated Competitive Analysis and Computer-Aided Development Systems for Online Algorithms

  Grant-in-Aid for Young Scientists (B)

  Nara Institute of Science and Technology;Hokkaido University

  Jun KAWAHARA

  From 28 Apr. 2011, To 31 Mar. 2014, Project Closed

  オンラインアルゴリズム;競合比解析;自動解析;kフレーム転送量最大化;アルゴリズム;オンライン問題;ユニットクラスタリング;フレーム転送量最大化

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-23700001/
• Studies on Algorithms for Insufficient Spatial Information

  Grant-in-Aid for Scientific Research (A)

  Kyoto University

  Kazuo IWAMA

  From 01 Apr. 2010, To 31 Mar. 2013, Project Closed

  アルゴリズム理論;グラフ問題;アルゴリズム的ゲーム理論;乱化計算;アルゴリズム;計算困難問題;情報の補填;数理モデル化;理論的性能保証;劣線形時間;乱化アルゴリズム;分散アルゴリズム;准線形時間

  https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-22240001/

Education

Teaching subject(s)

• From Apr. 2019, To Mar. 2020

  Operating Systems

  Spring, 工学部
• From Apr. 2019, To Mar. 2020

  Mathematics in Practice for Computer Science

  Spring, 工学部
• From Apr. 2020, To Mar. 2021

  Reading and Writing Scientific English

  Spring, 工学部
• From Apr. 2020, To Mar. 2021

  Operating Systems

  Spring, 工学部
• From Apr. 2020, To Mar. 2021

  Computer Science Laboratory and Exercise 2

  Fall, 工学部
• From Apr. 2020, To Mar. 2021

  Mathematics in Practice for Computer Science

  Spring, 工学部
• From Apr. 2020, To Mar. 2021

  Theory of Discrete Algorithms

  Spring, 情報学研究科
• From Apr. 2021, To Mar. 2022

  Operating Systems

  Spring, 工学部
• From Apr. 2021, To Mar. 2022

  Computer Science Laboratory and Exercise 2

  Fall, 工学部
• From Apr. 2021, To Mar. 2022

  Computer Science Laboratory and Exercise 3

  Spring, 工学部
• From Apr. 2021, To Mar. 2022

  Mathematics in Practice for Computer Science

  Spring, 工学部
• From Apr. 2021, To Mar. 2022

  Theory of Discrete Algorithms

  Spring, 情報学研究科

Administration

Faculty management (title, position)

• From 01 Apr. 2019, To 31 Mar. 2020

  情報セキュリティ委員会技術責任者
• From 01 Apr. 2019, To 31 Mar. 2022

  情報セキュリティ作業委員会委員
• From 01 Apr. 2019, To 31 Mar. 2022

  計算機小委員会委員