Fully Functional Static and Dynamic Succinct Trees von Navarro, Gonzalo, Sadakane, Kunihiko

Volltext

MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph von Li, Dinghua, Liu, Chi-Man, Luo, Ruibang, Sadakane, Kunihiko, Lam, Tak-Wah

Volltext

Compact and succinct data structures for multidimensional orthogonal range searching von Ishiyama, Kazuki, Sadakane, Kunihiko

Volltext

A Linear-Time Burrows-Wheeler Transform Using Induced Sorting von Okanohara, Daisuke, Sadakane, Kunihiko

Volltext

Succinct navigational oracles for families of intersection graphs on a circle von Acan, Hüseyin, Chakraborty, Sankardeep, Jo, Seungbum, Nakashima, Kei, Sadakane, Kunihiko, Satti, Srinivasa Rao

Volltext

Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks von INOHA, Tatsuya, SADAKANE, Kunihiko, UNO, Yushi, YONEBAYASHI, Yuma

Volltext

Approximating the Canadian Traveller Problem with Online Randomization von Demaine, Erik D., Huang, Yamming, Liao, Chung-Shou, Sadakane, Kunihiko

Volltext

Space-Efficient Fully Dynamic DFS in Undirected Graphs von Nakamura, Kengo, Sadakane, Kunihiko

Volltext

Storing Set Families More Compactly with Top ZDDs von Matsuda, Kotaro, Denzumi, Shuhei, Sadakane, Kunihiko

Volltext

Efficient query autocompletion with edit distance-based error tolerance von Qin, Jianbin, Xiao, Chuan, Hu, Sheng, Zhang, Jie, Wang, Wei, Ishikawa, Yoshiharu, Tsuda, Koji, Sadakane, Kunihiko

Volltext

Optimal In-place Algorithms for Basic Graph Problems von Chakraborty, Sankardeep, Sadakane, Kunihiko, Satti, Srinivasa Rao

Volltext

A framework for designing space-efficient dictionaries for parameterized and order-preserving matching von Ganguly, Arnab, Hon, Wing-Kai, Sadakane, Kunihiko, Shah, Rahul, Thankachan, Sharma V., Yang, Yilin

Volltext

A linear-space data structure for range-LCP queries in poly-logarithmic time von Abedin, Paniz, Ganguly, Arnab, Hon, Wing-Kai, Matsuda, Kotaro, Nekrich, Yakov, Sadakane, Kunihiko, Shah, Rahul, Thankachan, Sharma V.

Volltext

Storing Partitions of Integers in Sublinear Space von Sumigawa, Kentaro, Sadakane, Kunihiko

Volltext

Faster algorithms for shortest path and network flow based on graph decomposition von Kashyop, Manas Jyoti, Nagayama, Tsunehiko, Sadakane, Kunihiko

Volltext

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing von TAKAGI, Takuya, INENAGA, Shunsuke, SADAKANE, Kunihiko, ARIMURA, Hiroki

Volltext

Succinct Representations for (Non)Deterministic Finite Automata von Chakraborty, Sankardeep, Grossi, Roberto, Sadakane, Kunihiko, Satti, Srinivasa Rao

Volltext

Approximating Dynamic Weighted Vertex Cover with Soft Capacities von Wei, Hao-Ting, Hon, Wing-Kai, Horn, Paul, Liao, Chung-Shou, Sadakane, Kunihiko

Volltext

A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs von Nakamura, Kengo, Sadakane, Kunihiko

Volltext

New text indexing functionalities of the compressed suffix arrays von Sadakane, Kunihiko

Volltext