Kazuhiro Kurita

According to our database, Kazuhiro Kurita authored at least 40 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size.

Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa

Algorithmica, September, 2025

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs.

Kazuhiro Kurita, Kevin Mann

CoRR, July, 2025

Finding One Local Optimum Is Easy - But What about Two?

Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi

CoRR, July, 2025

The Complexity of Maximal Common Subsequence Enumeration.

Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi, Kazuhiro Kurita, Giulia Punzi

Proc. ACM Manag. Data, May, 2025

Dichotomies for tree minor containment with structural parameters.

Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi

Theor. Comput. Sci., 2025

Space-Efficient FPT Algorithms for Degeneracy.

Naohito Matsumoto, Kazuhiro Kurita, Masashi Kiyomi

IEICE Trans. Inf. Syst., 2025

Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

Inf. Comput., 2025

Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

Discret. Appl. Math., 2025

On the Complexity of Minimising the Moving Distance for Dispersing Objects.

Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Spanner Enumeration for Temporal Graphs.

Kazuhiro Kurita, Andrea Marino, Jason Schoeters, Takeaki Uno

Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks, 2025

Designing Output Sensitive Algorithms for Subgraph Enumeration.

Alessio Conte, Kazuhiro Kurita, Andrea Marino, Giulia Punzi, Takeaki Uno, Kunihiro Wasa

Proceedings of the From Strings to Graphs, 2025

2024

On the hardness of inclusion-wise minimal separators enumeration.

Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa

Inf. Process. Lett., March, 2024

An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints.

Kazuhiro Kurita, Kunihiro Wasa

Theor. Comput. Sci., 2024

Collecting Balls on a Line by Robots with Limited Energy.

Tesshu Hanaka, Nicolás Honorato Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi

IEICE Trans. Inf. Syst., 2024

On the complexity of finding a spanning even tree in a graph.

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Atsuki Nagao, Hirotaka Ono, Kazuhisa Seto

CoRR, 2024

Computing diverse pair of solutions for tractable SAT.

Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, Rin Saito

CoRR, 2024

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.

Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Algorithms for Optimally Shifting Intervals Under Intersection Graph Models.

Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono

Proceedings of the Frontiers of Algorithmics - 18th International Joint Conference, 2024

2023

Enumerating Empty and Surrounding Polygons.

Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2023

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Optimal LZ-End Parsing Is Hard.

Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.

Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Constant amortized time enumeration of Eulerian trails.

Kazuhiro Kurita, Kunihiro Wasa

Theor. Comput. Sci., 2022

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.

Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

Theory Comput. Syst., 2022

Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Linear-Delay Enumeration for Minimal Steiner Problems.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number.

Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura

Theor. Comput. Sci., 2021

Efficient enumeration of dominating sets for sparse graphs.

Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno

Discret. Appl. Math., 2021

Polynomial-Delay Enumeration of Large Maximal Matchings.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

CoRR, 2021

Finding Diverse Trees, Paths, and More.

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Polynomial Delay Enumeration for Minimal Steiner Problems.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

CoRR, 2020

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints.

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

CoRR, 2020

Efficient Enumerations for Minimal Multicuts and Multiway Cuts.

Kazuhiro Kurita, Yasuaki Kobayashi

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Finding the Anticover of a String.

Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices.

Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno

CoRR, 2019

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.

Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four.

Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.

Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs.

Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno

Proceedings of the Combinatorial Optimization and Applications, 2017