Junichi Teruyama

According to our database1, Junichi Teruyama authored at least 26 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges.
CoRR, 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

On Computing a Center Persistence Diagram.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

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

Sink Location Problems in Dynamic Flow Grid Networks.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Red-Black Spanners for Mixed-Charging Vehicular Networks.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

2021
Almost linear time algorithms for minsum <i>k</i>-sink problems on dynamic flow path networks.
Theor. Comput. Sci., 2021

Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Locating Evacuation Centers Optimally in Path and Cycle Networks.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
Improved average complexity for comparison-based sorting.
Theor. Comput. Sci., 2020

Satisfiability Algorithm for Syntactic Read-k-times Branching Programs.
Theory Comput. Syst., 2020

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks.
Proceedings of the Combinatorial Optimization and Applications, 2020

2019
Hyperfiniteness of Real-World Networks.
Rev. Socionetwork Strateg., 2019

Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression.
J. Comput. Syst. Sci., 2019

2018
Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms.
CoRR, 2018

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.
Algorithmica, 2018

Small Complexity Gaps for Comparison-Based Sorting.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017
Improved exact algorithms for mildly sparse instances of Max SAT.
Theor. Comput. Sci., 2017

2016
An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

2015
Efficient Algorithms for Sorting <i>k</i>-Sets in Bins.
IEICE Trans. Inf. Syst., 2015

A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom.
Electron. Colloquium Comput. Complex., 2015

2014
Efficient Algorithms for Sorting k-Sets in Bins.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2012
Quantum counterfeit coin problems.
Theor. Comput. Sci., 2012

Reconstructing Strings from Substrings with Quantum Queries.
Proceedings of the Algorithm Theory - SWAT 2012, 2012


  Loading...