Jun Kawahara

Orcid: 0000-0002-4096-3923

According to our database1, Jun Kawahara authored at least 48 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Designing Algorithms for the Shortest Path Reconfiguration Problem Using Decision Diagram Operations.
Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

2023
Sorting balls and water: Equivalence and computational complexity.
Theor. Comput. Sci., November, 2023

DAG-Pathwidth: Graph Algorithmic Analyses of DAG-Type Blockchain Networks.
IEICE Trans. Inf. Syst., March, 2023

On robustness against evacuees' unexpected movement in automatic evacuation guiding.
Comput. Electr. Eng., January, 2023

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2023

Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability.
Proceedings of the 35th IEEE International Conference on Tools with Artificial Intelligence, 2023

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions.
CoRR, 2022

Reallocation Problems with Minimum Completion Time.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2020
The Essential Role of Empirical Validation in Legislative Redistricting Simulation.
CoRR, 2020

Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019
Efficient construction of binary decision diagrams for network reliability with imperfect vertices.
Reliab. Eng. Syst. Saf., 2019

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant.
J. Graph Algorithms Appl., 2019

Decomposing a Graph into Unigraphs.
CoRR, 2019

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

A Fast Algorithm for Combinatorial Hotspot Mining Based on Spatial Scan Statistic.
Proceedings of the 2019 SIAM International Conference on Data Mining, 2019

2018
Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Automatic evacuation guiding scheme based on implicit interactions between evacuees and their mobile nodes.
GeoInformatica, 2018

Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams.
CoRR, 2018

DenseZDD: A Compact and Fast Index for Families of Sets.
Algorithms, 2018

Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Aggregating Crowd Opinions Using Shapley Value Regression.
Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2018

Development of a Robot Intervention Program in Medication Instruction at a Pharmacy.
Proceedings of the 7th International Congress on Advanced Applied Informatics, 2018

2017
Better bounds for online k-frame throughput maximization in network switches.
Theor. Comput. Sci., 2017

Frontier-Based Search for Enumerating All Constrained Subgraphs with Compressed Representation.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

The Time Complexity of the Token Swapping Problem and Its Parallel Variants.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Generating All Patterns of Graph Partitions Within a Disparity Bound.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Branch and Bound for Regular Bayesian Network Structure Learing.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

2016
Graphillion: software library for very large sets of labeled graphs.
Int. J. Softw. Tools Technol. Transf., 2016

Priority Mechanism of Bitcoin and Its Effect on Transaction-Confirmation Process.
CoRR, 2016

Accuracy Improvement for Backup Tasks in Hadoop Speculative Algorithm.
Proceedings of the 2016 IEEE International Conference on Computer and Information Technology, 2016

2015
Swapping labeled tokens on graphs.
Theor. Comput. Sci., 2015

An improved lower bound for one-dimensional online unit clustering.
Theor. Comput. Sci., 2015

Tight analysis of priority queuing for egress traffic.
Comput. Networks, 2015

Optimal buffer management for 2-frame throughput maximization.
Comput. Networks, 2015

Automatic Evacuation Guiding Scheme Using Trajectories of Mobile Nodes.
Proceedings of the Mobile Web and Intelligent Information Systems, 2015

Schedule guidance system for slab extraction sequence from furnace in hot rolling process.
Proceedings of the 10th Asian Control Conference, 2015

2014
Distribution Loss Minimization With Guaranteed Error Bound.
IEEE Trans. Smart Grid, 2014

2013
Shared-Memory Parallel Frontier-Based Search.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

The effect of variance in members' attractiveness on perceived group attractiveness.
Proceedings of the ACM Symposium on Applied Perception 2013, 2013

2012
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations.
Inf. Process. Lett., 2012

Tight Analysis of Priority Queuing Policy for Egress Traffic
CoRR, 2012

Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs.
Algorithms, 2012

2011
A randomized algorithm for two servers in cross polytope spaces.
Theor. Comput. Sci., 2011

An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

2008
Randomized Competitive Analysis for Two Server Problems.
Algorithms, 2008

2006
Finite-State Online Algorithms and Their Automated Competitive Analysis.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006


  Loading...