2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DS2026
Near-Linear Preprocessing for Range Weighted Longest Increasing Subsequence Queries
Keisuke Korogi
We give a deterministic data structure for range weighted longest increasing subsequence (LIS) queries on values with positive weights. Preprocessing takes time…
cs.NE2025
Analyzing the Landscape of the Indicator-based Subset Selection Problem
Keisuke Korogi, Ryoji Tanabe
The indicator-based subset selection problem (ISSP) involves finding a point subset that minimizes or maximizes a quality indicator. The ISSP is frequently found in evolutionary mu…
cs.NE2025★ 2 cited
Speeding up Local Search for the Indicator-based Subset Selection Problem by a Candidate List Strategy
Keisuke Korogi, Ryoji Tanabe
In evolutionary multi-objective optimization, the indicator-based subset selection problem involves finding a subset of points that maximizes a given quality indicator. Local searc…