Kunihiko Sadakane

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 73

Top Venues

Publications

Long-Qi Chen, Che-Wei Tsao, Jin-Jie Deng, Wing-Kai Hon, Kunihiko Sadakane
τλ-Index: Locating Rare Patterns in Similar Strings. DCC (2024)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. CoRR (2024)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. SWAT (2024)
Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. CoRR (2024)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct data structure for path graphs. Inf. Comput. 296 (2024)
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Graphs with d-Dimensional t-Representation. DCC (2024)
Hiraku Morita, Erik Pohle, Kunihiko Sadakane, Peter Scholl, Kazunari Tozawa, Daniel Tschudi
MAESTRO: Multi-party AES using Lookup Tables. IACR Cryptol. ePrint Arch. 2024 (2024)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct data structures for bounded clique-width graphs. Discret. Appl. Math. 352 (2024)
Kuo-Kai Lee, Wing-Kai Hon, Chung-Shou Liao, Kunihiko Sadakane, Meng-Tsung Tsai
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries. Int. J. Comput. Geom. Appl. 33 (1&2) (2023)
Seungbum Jo, Wooyoung Park, Kunihiko Sadakane, Srinivasa Rao Satti
Practical Implementations of Compressed RAM. DCC (2023)
Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
Shortest Beer Path Queries Based on Graph Decomposition. ISAAC (2023)
Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
Shortest Beer Path Queries based on Graph Decomposition. CoRR (2023)
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Graphs with d-Dimensional t-Representation. CoRR (2023)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct representation for (non)deterministic finite automata. J. Comput. Syst. Sci. 131 (2023)
Yuma Arakawa, Gonzalo Navarro, Kunihiko Sadakane
Bi-Directional r-Indexes. CPM (2022)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct navigational oracles for families of intersection graphs on a circle. Theor. Comput. Sci. 928 (2022)
Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane
Approximating Dynamic Weighted Vertex Cover with Soft Capacities. Algorithmica 84 (1) (2022)
Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane
Succinct Data Structure for Path Graphs. DCC (2022)
Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Space-Efficient Data Structure for Posets with Applications. SWAT (2022)
Tatsuya Inoha, Kunihiko Sadakane, Yushi Uno, Yuma Yonebayashi
Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks. IEICE Trans. Inf. Syst. (3) (2022)
Jin Jie Deng, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. DCC (2022)
Kunihiko Sadakane
Succinct Representations of Graphs (Invited Talk). ISAAC (2022)
M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung
Guest editors' foreword. J. Graph Algorithms Appl. 25 (2) (2021)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. CoRR (2021)
Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching. Theor. Comput. Sci. 854 (2021)
Jin Jie Deng, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. CoRR (2021)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Representations for (Non)Deterministic Finite Automata. LATA (2021)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA (2021)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct representations of Intersection Graphs on a Circle. DCC (2021)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Path Graphs. CoRR (2021)
Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane
Storing Set Families More Compactly with Top ZDDs. Algorithms 14 (6) (2021)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Data Structures for Small Clique-Width Graphs. DCC (2021)
Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane
Approximating the Canadian Traveller Problem with Online Randomization. Algorithmica 83 (5) (2021)
Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane
Storing Set Families More Compactly with Top ZDDs. SEA (2020)
Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan
A linear-space data structure for range-LCP queries in poly-logarithmic time. Theor. Comput. Sci. 822 (2020)
Kazuki Ishiyama, Kunihiko Sadakane
Compact and succinct data structures for multidimensional orthogonal range searching. Inf. Comput. 273 (2020)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle. CoRR (2020)
Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane
Storing Set Families More Compactly with Top ZDDs. CoRR (2020)
Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Optimal In-place Algorithms for Basic Graph Problems. IWOCA (2020)
Jianbin Qin, Chuan Xiao, Sheng Hu, Jie Zhang, Wei Wang, Yoshiharu Ishikawa, Koji Tsuda, Kunihiko Sadakane
Efficient query autocompletion with edit distance-based error tolerance. VLDB J. 29 (4) (2020)
Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Enumerating Range Modes. ISAAC (2020)
Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. CPM (2020)
Kunihiko Sadakane
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Enumerating Range Modes. CoRR (2019)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Representation for (Non)Deterministic Finite Automata. CoRR (2019)
Sankardeep Chakraborty, Kunihiko Sadakane
Indexing Graph Search Trees and Applications. CoRR (2019)
Kentaro Sumigawa, Kunihiko Sadakane
Storing Partitions of Integers in Sublinear Space. Rev. Socionetwork Strateg. 13 (2) (2019)
Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane
Faster algorithms for shortest path and network flow based on graph decomposition. J. Graph Algorithms Appl. 23 (5) (2019)
Kengo Nakamura, Kunihiko Sadakane
Space-Efficient Fully Dynamic DFS in Undirected Graphs. Algorithms 12 (3) (2019)
Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Optimal In-place Algorithms for Basic Graph Problems. CoRR (2019)
Sankardeep Chakraborty, Kunihiko Sadakane
Indexing Graph Search Trees and Applications. MFCS (2019)
Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. CoRR (2018)
Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. COCOON (2018)
Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
DenseZDD: A Compact and Fast Index for Families of Sets. Algorithms 11 (8) (2018)
Kentaro Sumigawa, Kunihiko Sadakane
An Efficient Representation of Partitions of Integers. IWOCA (2018)
Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane
Faster Network Algorithms Based on Graph Decomposition. WALCOM (2018)
Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. APPROX-RANDOM (2018)
Johannes Fischer, Tomohiro I, Dominik Köppl, Kunihiko Sadakane
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. Algorithmica 80 (7) (2018)
Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno
Node Similarity with q -Grams for Real-World Labeled Networks. KDD (2018)
Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane
Compression with the tudocomp Framework. SEA (2017)
Kengo Nakamura, Kunihiko Sadakane
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs. WALCOM (2017)
Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane
Compression with the tudocomp Framework. CoRR (2017)
Kunihiko Sadakane, Gonzalo Navarro
Computation over Compressed Structured Data (NII Shonan Meeting 2017-15). NII Shonan Meet. Rep. 2017 (2017)
Kazuki Ishiyama, Koji Kobayashi, Kunihiko Sadakane
Succinct Quadtrees for Road Data. SISAP (2017)
Zechao Liu, Zoe Lin Jiang, Xuan Wang, Xinyi Huang, Siu-Ming Yiu, Kunihiko Sadakane
Offline/online attribute-based encryption with verifiable outsourced decryption. Concurr. Comput. Pract. Exp. 29 (7) (2017)
Kazuki Ishiyama, Kunihiko Sadakane
Practical Space-Efficient Data Structures for High-Dimensional Orthogonal Range Searching. SISAP (2017)
Kazuki Ishiyama, Kunihiko Sadakane
A Succinct Data Structure for Multidimensional Orthogonal Range Searching. DCC (2017)
Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2017)
Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IWOCA (2016)
Dominik Köppl, Kunihiko Sadakane
Lempel-Ziv Computation in Compressed Space (LZ-CICS). DCC (2016)
Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. CoRR (2016)
Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang
Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching. CPM (2016)
Taito Lee, Shuhei Denzumi, Kunihiko Sadakane
Engineering Hybrid DenseZDDs. SEA (2016)
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Algorithmica 71 (4) (2015)
Sudebkumar Prasant Pal, Kunihiko Sadakane
Guest Editors' foreword. Theor. Comput. Sci. 575 (2015)
Dominik Köppl, Kunihiko Sadakane
Lempel Ziv Computation In Compressed Space (LZ-CICS). CoRR (2015)
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44 (3) (2015)
Dinghua Li, Chi-Man Liu, Ruibang Luo, Kunihiko Sadakane, Tak Wah Lam
graph. Bioinform. 31 (10) (2015)
Christina Boucher, Alexander Bowe, Travis Gagie, Simon J. Puglisi, Kunihiko Sadakane
Variable-Order de Bruijn Graphs. DCC (2015)
Wing-Kin Sung, Kunihiko Sadakane, Tetsuo Shibuya, Abha Belorkar, Iana Pyrogova
An O(m, log m)-Time Algorithm for Detecting Superbubbles. IEEE ACM Trans. Comput. Biol. Bioinform. 12 (4) (2015)
Atsushi Koike, Kunihiko Sadakane
A Novel Computational Model for GPUs with Applications to Efficient Algorithms. Int. J. Netw. Comput. 5 (1) (2015)
Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira
Space-Time Trade-offs for Stack-Based Algorithms. Algorithmica 72 (4) (2015)
Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane
Canadians Should Travel Randomly. ICALP (1) (2014)
Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Fast relative Lempel-Ziv self-index for similar sequences. Theor. Comput. Sci. 532 (2014)
Atsushi Koike, Kunihiko Sadakane
A Novel Computational Model for GPUs with Application to I/O Optimal Sorting Algorithms. IPDPS Workshops (2014)
Sudebkumar Prasant Pal, Kunihiko Sadakane
Guest Editors' Foreword. J. Graph Algorithms Appl. 18 (4) (2014)
Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
DenseZDD: A Compact and Fast Index for Families of Sets. SEA (2014)
Christina Boucher, Alexander Bowe, Travis Gagie, Simon J. Puglisi, Kunihiko Sadakane
Variable-Order de Bruijn Graphs. CoRR (2014)
Gonzalo Navarro, Kunihiko Sadakane
Fully Functional Static and Dynamic Succinct Trees. ACM Trans. Algorithms 10 (3) (2014)
Shirou Maruyama, Yasuo Tabei, Hiroshi Sakamoto, Kunihiko Sadakane
Fully-Online Grammar Compression. SPIRE (2013)
Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane
Space-Time Trade-offs for Stack-Based Algorithms. STACS (2013)
Hoa Vu, Francis Y. L. Chin, Wing-Kai Hon, Henry C. M. Leung, Kunihiko Sadakane, Ken Wing-Kin Sung, Siu-Ming Yiu
-Reticulated Phylogenetic Network from a Set of Gene Trees. ISBRA (2013)
Kunihiko Sadakane, Wing-Kin Sung
Compact Data structures for Big Data (NII Shonan Meeting 2013-10). NII Shonan Meet. Rep. 2013 (2013)
Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya
Detecting Superbubbles in Assembly Graphs. WABI (2013)
Chuan Xiao, Jianbin Qin, Wei Wang, Yoshiharu Ishikawa, Koji Tsuda, Kunihiko Sadakane
Efficient Error-tolerant Query Autocompletion. Proc. VLDB Endow. 6 (6) (2013)
Wing-Kai Hon, Lap-Kei Lee, Kunihiko Sadakane, Konstantinos Tsakalidis
Compressed Persistent Index for Efficient Rank/Select Queries. WADS (2013)
Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya
Detecting Superbubbles in Assembly Graphs. CoRR (2013)
Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197 (2012)
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78 (2) (2012)
Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
Fast Relative Lempel-Ziv Self-index for Similar Sequences. FAW-AAIM (2012)

Kunihiko Sadakane.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kunihiko Sadakane