1.4k citations
- The University of TokyoJP116 papers
- RIKENJP81 papers
- Kyoto UniversityJP52 papers
- Keio UniversityJP38 papers
- The University of OsakaJP32 papers
- Tokyo Institute of TechnologyJP27 papers
- Japan Science and Technology AgencyJP25 papers
- National Institute for Materials ScienceJP25 papers
- University of TsukubaJP25 papers
- Japan Atomic Energy AgencyJP21 papers
- Kyushu UniversityJP18 papers
- Nagoya UniversityJP17 papers
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017
A compressed dynamic self-index for highly repetitive text collections
Takaaki Nishimoto, Yoshimasa Takabatake, Yasuo Tabei
We present a novel compressed dynamic self-index for highly repetitive text collections. Signature encoding is a compressed dynamic self-index for highly repetitive texts and has a…
cs.DS2017★ 29 cited
The Densest Subgraph Problem with a Convex/Concave Size Function
Yasushi Kawase, Atsushi Miyauchi
In the densest subgraph problem, given an edge-weighted undirected graph , we are asked to find that maximizes the density, i.e., , where …
cs.DS2017
Computing a tree having a small vertex cover
Takuro Fukunaga, Takanori Maehara
We consider a new Steiner tree problem, called vertex-cover-weighted Steiner tree problem. This problem defines the weight of a Steiner tree as the minimum weight of vertex covers…