default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuhiro Kurita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j10]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
:
Dichotomies for tree minor containment with structural parameters. Theor. Comput. Sci. 1026: 114984 (2025)- 2024
- [j9]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): 325-327 (2024) - [j8]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: 106469 (2024) - [j7]Kazuhiro Kurita, Kunihiro Wasa:
An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints. Theor. Comput. Sci. 1005: 114628 (2024) - [c15]Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono:
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. IWOCA 2024: 232-246 - [c14]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. WALCOM 2024: 392-405 - [i22]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 abs/2405.13613 (2024) - 2023
- [j6]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): 1082-1091 (2023) - [c13]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: 3968-3976 - [c12]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing Is Hard. CPM 2023: 3:1-3:11 - [c11]Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. MFCS 2023: 58:1-58:14 - [i21]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing is Hard. CoRR abs/2302.02586 (2023) - [i20]Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. CoRR abs/2307.08948 (2023) - [i19]Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa:
On the hardness of inclusion-wise minimal separators enumeration. CoRR abs/2308.15444 (2023) - [i18]Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono:
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints. CoRR abs/2308.16426 (2023) - [i17]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. CoRR abs/2311.03225 (2023) - [i16]Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono:
Algorithms for Optimally Shifting Intervals under Intersection Graph Models. CoRR abs/2312.16964 (2023) - 2022
- [j5]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): 502-515 (2022) - [j4]Kazuhiro Kurita, Kunihiro Wasa:
Constant amortized time enumeration of Eulerian trails. Theor. Comput. Sci. 923: 1-12 (2022) - [c10]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi:
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. AAAI 2022: 3758-3766 - [c9]Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Linear-Delay Enumeration for Minimal Steiner Problems. PODS 2022: 301-313 - [c8]Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. WG 2022: 342-355 - [i15]Kazuhiro Kurita, Kunihiro Wasa:
An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints. CoRR abs/2201.08647 (2022) - [i14]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 abs/2201.08940 (2022) - 2021
- [j3]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient enumeration of dominating sets for sparse graphs. Discret. Appl. Math. 303: 283-295 (2021) - [j2]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: 32-41 (2021) - [c7]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi:
Finding Diverse Trees, Paths, and More. AAAI 2021: 3778-3786 - [i13]Kazuhiro Kurita, Kunihiro Wasa:
Constant Amortized Time Enumeration of Eulerian trails. CoRR abs/2101.10473 (2021) - [i12]Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Polynomial-Delay Enumeration of Large Maximal Matchings. CoRR abs/2105.04146 (2021) - [i11]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi:
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. CoRR abs/2112.05403 (2021) - 2020
- [c6]Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa:
Finding the Anticover of a String. CPM 2020: 2:1-2:11 - [c5]Kazuhiro Kurita, Yasuaki Kobayashi:
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. MFCS 2020: 60:1-60:14 - [i10]Kazuhiro Kurita, Yasuaki Kobayashi:
Efficient Enumerations for Minimal Multicuts and Multiway Cuts. CoRR abs/2006.16222 (2020) - [i9]Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi:
Finding Diverse Trees, Paths, and More. CoRR abs/2009.03687 (2020) - [i8]Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. CoRR abs/2009.08830 (2020) - [i7]Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Polynomial Delay Enumeration for Minimal Steiner Problems. CoRR abs/2010.11462 (2020) - [i6]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 abs/2012.04910 (2020)
2010 – 2019
- 2019
- [c4]Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA 2019: 339-351 - [i5]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. CoRR abs/1903.02161 (2019) - [i4]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 abs/1906.09680 (2019) - 2018
- [j1]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. 101-A(9): 1383-1391 (2018) - [c3]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC 2018: 8:1-8:13 - [c2]Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura:
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA 2018: 201-213 - [i3]Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Dominating Sets for Sparse Graphs. CoRR abs/1802.07863 (2018) - [i2]Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR abs/1806.04307 (2018) - 2017
- [c1]Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno:
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. COCOA (2) 2017: 169-181 - [i1]Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. CoRR abs/1707.02740 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
