The following pages link to Kazuhiro Kurita (Q1671002):
Displayed 12 items.
- Efficient enumeration of subgraphs and induced subgraphs with bounded girth (Q1671003) (← links)
- Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs (Q1708606) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (Q2301754) (← links)
- Constant amortized time enumeration of Eulerian trails (Q2672609) (← links)
- (Q5089231) (← links)
- (Q5090998) (← links)
- Finding the Anticover of a String (Q5874427) (← links)
- Polynomial-delay and polynomial-space enumeration of large maximal matchings (Q6039434) (← links)
- On the hardness of inclusion-wise minimal separators enumeration (Q6195343) (← links)