Kazuhiro Kurita

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 46

Top Topics

Independent Set

Grows Quadratically

Subgraph Mining

Top Venues

Theor. Comput. Sci.

Publications

Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration. Inf. Process. Lett. 185 (2024)
Kazuhiro Kurita, Kunihiro Wasa
An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints. Theor. Comput. Sci. 1005 (2024)
Tesshu Hanaka, Nicolás Honorato Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi
Collecting Balls on a Line by Robots with Limited Energy. IEICE Trans. Inf. Syst. 107 (3) (2024)
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
Dichotomies for Tree Minor Containment with Structural Parameters. WALCOM (2024)
Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. IWOCA (2024)
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR (2024)
Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno
Enumerating Empty and Surrounding Polygons. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106 (9) (2023)
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration. CoRR (2023)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. MFCS (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing is Hard. CoRR (2023)
Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono
Algorithms for Optimally Shifting Intervals under Intersection Graph Models. CoRR (2023)
Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints. CoRR (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing Is Hard. CPM (2023)
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
Dichotomies for Tree Minor Containment with Structural Parameters. CoRR (2023)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI (2023)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. CoRR (2023)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. 66 (2) (2022)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Linear-Delay Enumeration for Minimal Steiner Problems. PODS (2022)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. WG (2022)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. AAAI (2022)
Kazuhiro Kurita, Kunihiro Wasa
Constant amortized time enumeration of Eulerian trails. Theor. Comput. Sci. 923 (2022)
Kazuhiro Kurita, Kunihiro Wasa
An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints. CoRR (2022)
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR (2022)
Kazuhiro Kurita, Kunihiro Wasa
Constant Amortized Time Enumeration of Eulerian trails. CoRR (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
Finding Diverse Trees, Paths, and More. AAAI (2021)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. Theor. Comput. Sci. 874 (2021)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay Enumeration of Large Maximal Matchings. CoRR (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. CoRR (2021)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient enumeration of dominating sets for sparse graphs. Discret. Appl. Math. 303 (2021)
Kazuhiro Kurita, Yasuaki Kobayashi
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. MFCS (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
Finding Diverse Trees, Paths, and More. CoRR (2020)
Kazuhiro Kurita, Yasuaki Kobayashi
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. CoRR (2020)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. CoRR (2020)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial Delay Enumeration for Minimal Steiner Problems. CoRR (2020)
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR (2020)
Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
Finding the Anticover of a String. CPM (2020)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. CoRR (2019)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. CoRR (2019)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA (2019)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR (2018)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC (2018)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Dominating Sets for Sparse Graphs. CoRR (2018)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA (2018)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. COCOA (2) (2017)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. CoRR (2017)