Kunihiro Wasa
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
29
Venues
15
Active years
2012–2023
Best venue rank
A*
Where they publish
Papers
29 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | IWOCA | Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries. | Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka |
| 2023 | MFCS | Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2022 | MFCS | Independent Set Reconfiguration on Directed Graphs. | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa |
| 2022 | PODS | Linear-Delay Enumeration for Minimal Steiner Problems. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2022 | STACS | Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
| 2022 | WALCOM | Reconfiguration of Regular Induced Subgraphs. | Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa |
| 2022 | WG | Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2021 | COCOON | Reconfiguring Directed Trees in a Digraph. | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa |
| 2020 | CPM | Finding the Anticover of a String. | Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa |
| 2020 | ESA | Reconfiguration of Spanning Trees with Many or Few Leaves. | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
| 2020 | STACS | Shortest Reconfiguration of Colorings Under Kempe Changes. | Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mhlenthaler, Akira Suzuki, Kunihiro Wasa |
| 2019 | COCOON | Diameter of Colorings Under Kempe Changes. | Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mhlenthaler, Akira Suzuki, Kunihiro Wasa |
| 2019 | COCOON | Max-Min 3-Dispersion Problems. | Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2019 | IWOCA | An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. | Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura |
| 2019 | MFCS | The Perfect Matching Reconfiguration Problem. | Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mhlenthaler, Kunihiro Wasa |
| 2019 | MFCS | Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. | Alessio Conte, Roberto Grossi, Mamadou Moustapha Kant, Andrea Marino, Takeaki Uno, Kunihiro Wasa |
| 2018 | COCOA | An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy. | Kunihiro Wasa, Takeaki Uno |
| 2018 | COCOON | Efficient Enumeration of Bipartite Subgraphs in Graphs. | Kunihiro Wasa, Takeaki Uno |
| 2018 | FAW | Exact Algorithms for the Max-Min Dispersion Problem. | Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2018 | ISAAC | Efficient Enumeration of Dominating Sets for Sparse Graphs. | Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno |
| 2018 | IWOCA | Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. | Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura |
| 2017 | COCOA | Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. | Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno |
| 2017 | COCOON | Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. | Alessio Conte, Mamadou Moustapha Kant, Yota Otachi, Takeaki Uno, Kunihiro Wasa |
| 2017 | ISAAC | On Maximal Cliques with Connectivity Constraints in Directed Graphs. | Alessio Conte, Mamadou Moustapha Kant, Takeaki Uno, Kunihiro Wasa |
| 2016 | LATA | The Complexity of Induced Tree Reconfiguration Problems. | Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura |
| 2014 | ISAAC | Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. | Kunihiro Wasa, Hiroki Arimura, Takeaki Uno |
| 2013 | DIS | Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. | Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura |
| 2013 | SISAP | Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. | Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura |
| 2012 | COCOON | Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. | Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura |