Kazuhiro Kurita

68 papers A* 5B 10C 3Journal 46Unranked 4
YearRankTypeTitle / Venue / Authors
2026 A* conf
Finding One Local Optimum Is Easy - but What About Two?
AAAI
Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
2026 B conf
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion.
WALCOM
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff
2026 B conf
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs.
WALCOM
Kazuhiro Kurita, Kevin Mann
2026 J jnl
On the Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees.
CoRR
Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono
2025 — conf
Designing Output Sensitive Algorithms for Subgraph Enumeration.
From Strings to Graphs, and Back Again
Alessio Conte, Kazuhiro Kurita, Andrea Marino, Giulia Punzi, Takeaki Uno, Kunihiro Wasa
2025 J jnl
Dichotomies for tree minor containment with structural parameters.
Theor. Comput. Sci.
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
2025 J jnl
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints.
Discret. Appl. Math.
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2025 J jnl
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size.
Algorithmica
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
2025 J jnl
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.
Algorithms
Yasuaki Kobayashi, Kazuhiro Kurita, Kevin Mann, Yasuko Matsui, Hirotaka Ono
2025 J jnl
Finding One Local Optimum Is Easy - But What about Two?
CoRR
Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
2025 J jnl
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion.
CoRR
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff
2025 J jnl
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs.
CoRR
Kazuhiro Kurita, Kevin Mann
2025 B conf
On the Complexity of Minimising the Moving Distance for Dispersing Objects.
WADS
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2025 J jnl
On the Complexity of Minimising the Moving Distance for Dispersing Objects.
CoRR
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2025 J jnl
Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond.
Inf. Comput.
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2025 J jnl
Space-Efficient FPT Algorithms for Degeneracy.
IEICE Trans. Inf. Syst.
Naohito Matsumoto, Kazuhiro Kurita, Masashi Kiyomi
2025 — conf
Spanner Enumeration for Temporal Graphs.
SAND
Kazuhiro Kurita, Andrea Marino, Jason Schoeters, Takeaki Uno
2025 J jnl
The Complexity of Maximal Common Subsequence Enumeration.
CoRR
Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi, Kazuhiro Kurita, Giulia Punzi
2025 J jnl
The Complexity of Maximal Common Subsequence Enumeration.
Proc. ACM Manag. Data
Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi, Kazuhiro Kurita, Giulia Punzi
2024 — conf
Algorithms for Optimally Shifting Intervals Under Intersection Graph Models.
IJTCS-FAW
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2024 J jnl
An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints.
Theor. Comput. Sci.
Kazuhiro Kurita, Kunihiro Wasa
2024 J jnl
Collecting Balls on a Line by Robots with Limited Energy.
IEICE Trans. Inf. Syst.
Tesshu Hanaka, Nicolás Honorato Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi
2024 J jnl
Computing diverse pair of solutions for tractable SAT.
CoRR
Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, Rin Saito
2024 B conf
Dichotomies for Tree Minor Containment with Structural Parameters.
WALCOM
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
2024 J jnl
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size.
CoRR
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
2024 C conf
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.
IWOCA
Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
2024 J jnl
On the complexity of finding a spanning even tree in a graph.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Atsuki Nagao, Hirotaka Ono, Kazuhisa Seto
2024 J jnl
On the hardness of inclusion-wise minimal separators enumeration.
Inf. Process. Lett.
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
2023 A* conf
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.
AAAI
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2023 J jnl
Algorithms for Optimally Shifting Intervals under Intersection Graph Models.
CoRR
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
2023 J jnl
Dichotomies for Tree Minor Containment with Structural Parameters.
CoRR
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
2023 J jnl
Enumerating Empty and Surrounding Polygons.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno
2023 J jnl
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints.
CoRR
Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
2023 J jnl
On the hardness of inclusion-wise minimal separators enumeration.
CoRR
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
2023 B conf
Optimal LZ-End Parsing Is Hard.
CPM
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
2023 J jnl
Optimal LZ-End Parsing is Hard.
CoRR
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
2023 B conf
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids.
MFCS
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2023 J jnl
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids.
CoRR
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2022 J jnl
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.
CoRR
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022 J jnl
An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints.
CoRR
Kazuhiro Kurita, Kunihiro Wasa
2022 J jnl
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.
Theory Comput. Syst.
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022 A* conf
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.
AAAI
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
2022 J jnl
Constant amortized time enumeration of Eulerian trails.
Theor. Comput. Sci.
Kazuhiro Kurita, Kunihiro Wasa
2022 A* conf
Linear-Delay Enumeration for Minimal Steiner Problems.
PODS
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2022 B conf
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings.
WG
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2021 J jnl
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number.
Theor. Comput. Sci.
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2021 J jnl
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
2021 J jnl
Constant Amortized Time Enumeration of Eulerian trails.
CoRR
Kazuhiro Kurita, Kunihiro Wasa
2021 J jnl
Efficient enumeration of dominating sets for sparse graphs.
Discret. Appl. Math.
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2021 A* conf
Finding Diverse Trees, Paths, and More.
AAAI
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
2021 J jnl
Polynomial-Delay Enumeration of Large Maximal Matchings.
CoRR
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2020 J jnl
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.
CoRR
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2020 J jnl
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints.
CoRR
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2020 B conf
Efficient Enumerations for Minimal Multicuts and Multiway Cuts.
MFCS
Kazuhiro Kurita, Yasuaki Kobayashi
2020 J jnl
Efficient Enumerations for Minimal Multicuts and Multiway Cuts.
CoRR
Kazuhiro Kurita, Yasuaki Kobayashi
2020 J jnl
Finding Diverse Trees, Paths, and More.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
2020 B conf
Finding the Anticover of a String.
CPM
Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
2020 J jnl
Polynomial Delay Enumeration for Minimal Steiner Problems.
CoRR
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2019 C conf
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.
IWOCA
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2019 J jnl
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.
CoRR
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2019 J jnl
Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices.
CoRR
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2018 B conf
Efficient Enumeration of Dominating Sets for Sparse Graphs.
ISAAC
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2018 J jnl
Efficient Enumeration of Dominating Sets for Sparse Graphs.
CoRR
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
2018 J jnl
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2018 C conf
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.
IWOCA
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura
2018 J jnl
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.
CoRR
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
2017 J jnl
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four.
CoRR
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
2017 — conf
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs.
COCOA (2)
Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno