default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun Kawahara
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Brian Godwin S. Lim
, Renzo Roel P. Tan, Jun Kawahara, Shin-ichi Minato, Kazushi Ikeda:
A Recursive Framework for Evaluating Moments Using Zero-Suppressed Binary Decision Diagrams. IEEE Access 12: 91886-91895 (2024)- [j21]Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka:
Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes. Theor. Comput. Sci. 1003: 114591 (2024) - [c31]Shou Ooba, Jun Kawahara, Shin-ichi Minato:
Designing Algorithms for the Shortest Path Reconfiguration Problem Using Decision Diagram Operations. ICAART (3) 2024: 641-648 - [c30]Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito:
Scalable Hard Instances for Independent Set Reconfiguration. SEA 2024: 26:1-26:15 - 2023
- [j20]Jun Kawahara, Takanori Hara, Masahiro Sasabe:
On robustness against evacuees' unexpected movement in automatic evacuation guiding. Comput. Electr. Eng. 105: 108531 (2023) - [j19]Shoji Kasahara, Jun Kawahara, Shin-ichi Minato, Jumpei Mori:
DAG-Pathwidth: Graph Algorithmic Analyses of DAG-Type Blockchain Networks. IEICE Trans. Inf. Syst. 106(3): 272-283 (2023) - [j18]Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka:
Sorting balls and water: Equivalence and computational complexity. Theor. Comput. Sci. 978: 114158 (2023) - [c29]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CPAIOR 2023: 167-183 - [c28]Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama:
Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. ICTAI 2023: 294-302 - [c27]Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka:
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. WALCOM 2023: 151-163 - 2022
- [c26]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. COCOON 2022: 292-304 - [c25]Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka:
Sorting Balls and Water: Equivalence and Computational Complexity. FUN 2022: 16:1-16:17 - [i15]Shin-ichi Minato, Mutsunori Banbara, Takashi Horiyama, Jun Kawahara, Ichigaku Takigawa, Yutaro Yamaguchi:
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions. CoRR abs/2201.08118 (2022) - [i14]Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka:
Sorting Balls and Water: Equivalence and Computational Complexity. CoRR abs/2202.09495 (2022) - [i13]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CoRR abs/2207.13959 (2022) - [i12]Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka:
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. CoRR abs/2212.07119 (2022) - 2021
- [i11]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. CoRR abs/2111.02579 (2021) - 2020
- [c24]Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato:
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. WALCOM 2020: 211-222 - [c23]Yu Nakahata, Masaaki Nishino, Jun Kawahara, Shin-ichi Minato:
Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams. SEA 2020: 9:1-9:14 - [i10]Benjamin Fifield, Kosuke Imai, Jun Kawahara, Christopher T. Kenny:
The Essential Role of Empirical Validation in Legislative Redistricting Simulation. CoRR abs/2006.10148 (2020)
2010 – 2019
- 2019
- [j17]Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka:
The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant. J. Graph Algorithms Appl. 23(1): 29-70 (2019) - [j16]Jun Kawahara, Koki Sonoda, Takeru Inoue, Shoji Kasahara:
Efficient construction of binary decision diagrams for network reliability with imperfect vertices. Reliab. Eng. Syst. Saf. 188: 142-154 (2019) - [c22]Shin-ichi Minato, Jun Kawahara, Fumio Ishioka, Masahiro Mizuta, Koji Kurihara:
A Fast Algorithm for Combinatorial Hotspot Mining Based on Spatial Scan Statistic. SDM 2019: 91-99 - [c21]Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka:
Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. SEA² 2019: 125-141 - [i9]Takashi Horiyama, Jun Kawahara, Shin-ichi Minato, Yu Nakahata:
Decomposing a Graph into Unigraphs. CoRR abs/1904.09438 (2019) - [i8]Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato:
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. CoRR abs/1911.07465 (2019) - 2018
- [j15]Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane:
DenseZDD: A Compact and Fast Index for Families of Sets. Algorithms 11(8): 128 (2018) - [j14]Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara:
Automatic evacuation guiding scheme based on implicit interactions between evacuees and their mobile nodes. GeoInformatica 22(1): 127-141 (2018) - [j13]Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shoji Kasahara:
Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1363-1374 (2018) - [c20]Keitaro Ishiguro, Saki Minamino, Jun Kawahara, Yukie Majima:
Development of a Robot Intervention Program in Medication Instruction at a Pharmacy. IIAI-AAI 2018: 954-955 - [c19]Yuko Sakurai, Jun Kawahara, Satoshi Oyama:
Aggregating Crowd Opinions Using Shapley Value Regression. MIWAI 2018: 151-160 - [c18]Yu Nakahata, Jun Kawahara, Shoji Kasahara:
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams. SEA 2018: 21:1-21:13 - [i7]Yu Nakahata, Jun Kawahara, Shoji Kasahara:
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams. CoRR abs/1804.02160 (2018) - [i6]Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka:
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams. CoRR abs/1804.03822 (2018) - 2017
- [j12]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) - [j11]Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better bounds for online k-frame throughput maximization in network switches. Theor. Comput. Sci. 657: 173-190 (2017) - [c17]Joe Suzuki, Jun Kawahara:
Branch and Bound for Regular Bayesian Network Structure Learing. UAI 2017 - [c16]Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato:
Generating All Patterns of Graph Partitions Within a Disparity Bound. WALCOM 2017: 119-131 - [c15]Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka:
The Time Complexity of the Token Swapping Problem and Its Parallel Variants. WALCOM 2017: 448-459 - 2016
- [j10]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) - [c14]Worachate Apichanukul, Jun Kawahara, Shoji Kasahara:
Accuracy Improvement for Backup Tasks in Hadoop Speculative Algorithm. CIT 2016: 500-507 - [i5]Shoji Kasahara, Jun Kawahara:
Priority Mechanism of Bitcoin and Its Effect on Transaction-Confirmation Process. CoRR abs/1604.00103 (2016) - [i4]Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka:
The Time Complexity of the Token Swapping Problem and Its Parallel Variants. CoRR abs/1612.02948 (2016) - 2015
- [j9]Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda:
Tight analysis of priority queuing for egress traffic. Comput. Networks 91: 614-624 (2015) - [j8]Jun Kawahara, Koji M. Kobayashi:
Optimal buffer management for 2-frame throughput maximization. Comput. Networks 91: 804-820 (2015) - [j7]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. Theor. Comput. Sci. 586: 81-94 (2015) - [j6]Jun Kawahara, Koji M. Kobayashi:
An improved lower bound for one-dimensional online unit clustering. Theor. Comput. Sci. 600: 171-173 (2015) - [c13]Kazuhiro Nakatsuji, Ryota Nobe, Jun Kawahara:
Schedule guidance system for slab extraction sequence from furnace in hot rolling process. ASCC 2015: 1-4 - [c12]Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara:
Automatic Evacuation Guiding Scheme Using Trajectories of Mobile Nodes. MobiWIS 2015: 3-14 - [i3]Jun Kawahara, Koji M. Kobayashi:
An improved lower bound for one-dimensional online unit clustering. CoRR abs/1502.02422 (2015) - 2014
- [j5]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. IEEE Trans. Smart Grid 5(1): 102-111 (2014) - [c11]Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda:
Tight Analysis of Priority Queuing for Egress Traffic. COCOA 2014: 459-473 - [c10]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. FUN 2014: 364-375 - [c9]Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane:
DenseZDD: A Compact and Fast Index for Families of Sets. SEA 2014: 187-198 - 2013
- [c8]Jun Kawahara, Michiteru Kitazaki:
The effect of variance in members' attractiveness on perceived group attractiveness. SAP 2013: 141 - [c7]Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better Bounds for Online k-Frame Throughput Maximization in Network Switches. ISAAC 2013: 218-228 - [c6]Jun Kawahara, Koji M. Kobayashi:
Optimal Buffer Management for 2-Frame Throughput Maximization. SIROCCO 2013: 274-285 - [c5]Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato:
Shared-Memory Parallel Frontier-Based Search. WALCOM 2013: 170-181 - [i2]Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better Bounds for Online $k$-Frame Throughput Maximization in Network Switches. CoRR abs/1309.4919 (2013) - 2012
- [j4]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) - [j3]Ryo Yoshinaka, Jun Kawahara, Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato:
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. Inf. Process. Lett. 112(16): 636-640 (2012) - [i1]Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda:
Tight Analysis of Priority Queuing Policy for Egress Traffic. CoRR abs/1207.5959 (2012) - 2011
- [j2]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec:
A randomized algorithm for two servers in cross polytope spaces. Theor. Comput. Sci. 412(7): 563-572 (2011) - [c4]Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara:
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. WAOA 2011: 35-48
2000 – 2009
- 2008
- [j1]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara:
Randomized Competitive Analysis for Two Server Problems. Algorithms 1(1): 30-42 (2008) - [c3]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara:
Randomized Competitive Analysis for Two-Server Problems. ESA 2008: 161-172 - 2007
- [c2]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec:
A Randomized Algorithm for Two Servers in Cross Polytope Spaces. WAOA 2007: 246-259 - 2006
- [c1]Takashi Horiyama, Kazuo Iwama, Jun Kawahara:
Finite-State Online Algorithms and Their Automated Competitive Analysis. ISAAC 2006: 71-80
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-10-07 21:21 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:
