Naoto Ohsaka

74 papers A* 15A 9B 3C 2Misc 1Journal 38Unranked 6
YearRankTypeTitle / Venue / Authors
2026 — conf
DiverXplorer: Stock Image Exploration via Diversity Adjustment for Graphic Design.
CHI Extended Abstracts
Antonio Tejero-de-Pablos, Sichao Song, Naoto Ohsaka, Mayu Otani, Shin'ichi Satoh
2026 J jnl
DiverXplorer: Stock Image Exploration via Diversity Adjustment for Graphic Design.
CoRR
Antonio Tejero-de-Pablos, Sichao Song, Naoto Ohsaka, Mayu Otani, Shin'ichi Satoh
2026 J jnl
Gap preserving reductions between reconfiguration problems.
J. Comput. Syst. Sci.
Naoto Ohsaka
2025 J jnl
Asymptotically Optimal Inapproximability of E
CoRR
Shuichi Hirahara, Naoto Ohsaka
2025 J jnl
Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Naoto Ohsaka
2025 A* conf
Asymptotically Optimal Inapproximability of Ek-SAT Reconfiguration.
FOCS
Shuichi Hirahara, Naoto Ohsaka
2025 A* conf
Asymptotically Optimal Inapproximability of Maxmin k-Cut Reconfiguration.
ICALP
Shuichi Hirahara, Naoto Ohsaka
2025 J jnl
On approximate reconfigurability of label cover.
Inf. Process. Lett.
Naoto Ohsaka
2025 B conf
Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules.
ISAAC
Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 J jnl
Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules.
CoRR
Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025 A* conf
Yet Another Simple Proof of the PCRP Theorem.
ICALP
Naoto Ohsaka
2024 A* conf
Alphabet Reduction for Reconfiguration Problems.
ICALP
Naoto Ohsaka
2024 J jnl
Alphabet Reduction for Reconfiguration Problems.
CoRR
Naoto Ohsaka
2024 J jnl
Asymptotic Inapproximability of Reconfiguration Problems: Maxmin
CoRR
Shuichi Hirahara, Naoto Ohsaka
2024 J jnl
Computational complexity of normalizing constants for the product of determinantal point processes.
Theor. Comput. Sci.
Tatsuya Matsuoka, Naoto Ohsaka
2024 A* conf
Gap Amplification for Reconfiguration Problems.
SODA
Naoto Ohsaka
2024 A* conf
Matroid Semi-Bandits in Sublinear Time.
ICML
Ruo-Chun Tzeng, Naoto Ohsaka, Kaito Ariu
2024 J jnl
Matroid Semi-Bandits in Sublinear Time.
CoRR
Ruo-Chun Tzeng, Naoto Ohsaka, Kaito Ariu
2024 J jnl
On the Parameterized Intractability of Determinant Maximization.
Algorithmica
Naoto Ohsaka
2024 A* conf
Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration.
ICALP
Shuichi Hirahara, Naoto Ohsaka
2024 J jnl
Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration.
CoRR
Shuichi Hirahara, Naoto Ohsaka
2024 J jnl
Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Naoto Ohsaka
2024 A* conf
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems.
STOC
Shuichi Hirahara, Naoto Ohsaka
2024 J jnl
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems.
CoRR
Shuichi Hirahara, Naoto Ohsaka
2024 J jnl
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Naoto Ohsaka
2024 A* conf
Safe Collaborative Filtering.
ICLR
Riku Togashi, Tatsushi Oka, Naoto Ohsaka, Tetsuro Morimura
2024 J jnl
Tight Inapproximability of Target Set Reconfiguration.
CoRR
Naoto Ohsaka
2023 A* conf
A Critical Reexamination of Intra-List Distance and Dispersion.
SIGIR
Naoto Ohsaka, Riku Togashi
2023 J jnl
A Critical Reexamination of Intra-List Distance and Dispersion.
CoRR
Naoto Ohsaka, Riku Togashi
2023 A* conf
Curse of "Low" Dimensionality in Recommender Systems.
SIGIR
Naoto Ohsaka, Riku Togashi
2023 J jnl
Curse of "Low" Dimensionality in Recommender Systems.
CoRR
Naoto Ohsaka, Riku Togashi
2023 A conf
Fast and Examination-agnostic Reciprocal Recommendation in Matching Markets.
RecSys
Yoji Tomita, Riku Togashi, Yuriko Hashizume, Naoto Ohsaka
2023 J jnl
Fast and Examination-agnostic Reciprocal Recommendation in Matching Markets.
CoRR
Yoji Tomita, Riku Togashi, Yuriko Hashizume, Naoto Ohsaka
2023 J jnl
Gap Amplification for Reconfiguration Problems.
CoRR
Naoto Ohsaka
2023 A conf
Gap Preserving Reductions Between Reconfiguration Problems.
STACS
Naoto Ohsaka
2023 J jnl
On Approximate Reconfigurability of Label Cover.
CoRR
Naoto Ohsaka
2023 J jnl
On reconfigurability of target sets.
Theor. Comput. Sci.
Naoto Ohsaka
2023 J jnl
Safe Collaborative Filtering.
CoRR
Riku Togashi, Tatsushi Oka, Naoto Ohsaka, Tetsuro Morimura
2022 J jnl
Gap Preserving Reductions between Reconfiguration Problems.
CoRR
Naoto Ohsaka
2022 B conf
On the Parameterized Intractability of Determinant Maximization.
ISAAC
Naoto Ohsaka
2022 J jnl
On the Parameterized Intractability of Determinant Maximization.
CoRR
Naoto Ohsaka
2022 A conf
Reconfiguration Problems on Submodular Functions.
WSDM
Naoto Ohsaka, Tatsuya Matsuoka
2022 J jnl
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes.
J. Artif. Intell. Res.
Naoto Ohsaka
2021 J jnl
A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph.
CoRR
Naoto Ohsaka
2021 J jnl
A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph.
Inf. Process. Lett.
Naoto Ohsaka
2021 A conf
Approximation algorithm for submodular maximization under submodular cover.
UAI
Naoto Ohsaka, Tatsuya Matsuoka
2021 J jnl
Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes.
CoRR
Naoto Ohsaka, Tatsuya Matsuoka
2021 C conf
Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions.
ACML
Tatsuya Matsuoka, Naoto Ohsaka
2021 J jnl
On Reconfigurability of Target Sets.
CoRR
Naoto Ohsaka
2021 C conf
On the Convex Combination of Determinantal Point Processes.
ACML
Tatsuya Matsuoka, Naoto Ohsaka, Akihiro Yabe
2021 A conf
Predictive Optimization with Zero-Shot Domain Adaptation.
SDM
Tomoya Sakai, Naoto Ohsaka
2021 J jnl
Predictive Optimization with Zero-Shot Domain Adaptation.
CoRR
Tomoya Sakai, Naoto Ohsaka
2021 J jnl
Reconfiguration Problems on Submodular Functions.
CoRR
Naoto Ohsaka, Tatsuya Matsuoka
2021 J jnl
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes.
CoRR
Naoto Ohsaka
2021 J jnl
Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate.
CoRR
Tatsuya Matsuoka, Naoto Ohsaka
2021 J jnl
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate.
Oper. Res. Lett.
Tatsuya Matsuoka, Naoto Ohsaka
2021 A conf
Tracking Regret Bounds for Online Submodular Optimization.
AISTATS
Tatsuya Matsuoka, Shinji Ito, Naoto Ohsaka
2021 A conf
Unconstrained MAP Inference, Exponentiated Determinantal Point Processes, and Exponential Inapproximability.
AISTATS
Naoto Ohsaka
2020 A conf
A Predictive Optimization Framework for Hierarchical Demand Matching.
SDM
Naoto Ohsaka, Tomoya Sakai, Akihiro Yabe
2020 A* conf
On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes.
ICML
Naoto Ohsaka, Tatsuya Matsuoka
2020 — conf
The Solution Distribution of Influence Maximization: A High-level Experimental Study on Three Algorithmic Approaches.
SIGMOD Conference
Naoto Ohsaka
2020 J jnl
The Solution Distribution of Influence Maximization: A High-level Experimental Study on Three Algorithmic Approaches.
CoRR
Naoto Ohsaka
2018 — conf
Boosting PageRank Scores by Optimizing Internal Link Structure.
DEXA (1)
Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi
2018 B conf
NoSingles: a space-efficient algorithm for influence maximization.
SSDBM
Diana Popova, Naoto Ohsaka, Ken-ichi Kawarabayashi, Alex Thomo
2018 A conf
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.
STACS
Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka
2017 — conf
Coarsening Massive Influence Networks for Scalable Diffusion Analysis.
SIGMOD Conference
Naoto Ohsaka, Tomohiro Sonobe, Sumio Fujita, Ken-ichi Kawarabayashi
2017 J jnl
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.
CoRR
Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka
2017 A* conf
Portfolio Optimization for Influence Spread.
WWW
Naoto Ohsaka, Yuichi Yoshida
2016 J jnl
Dynamic Influence Analysis in Evolving Networks.
Proc. VLDB Endow.
Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi
2016 — conf
Maximizing Time-Decaying Influence in Social Networks.
ECML/PKDD (1)
Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi
2015 A* conf
Efficient PageRank Tracking in Evolving Networks.
KDD
Naoto Ohsaka, Takanori Maehara, Ken-ichi Kawarabayashi
2015 — conf
Monotone k-Submodular Function Maximization with Size Constraints.
NIPS
Naoto Ohsaka, Yuichi Yoshida
2014 A* conf
Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations.
AAAI
Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi
2011 Misc conf
A reinforcement learning method to improve the sweeping efficiency for an agent.
GrC
Naoto Ohsaka, Daisuke Kitakoshi, Masato Suzuki
2025 Best paper conf
Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja.
CheckMATE
Nicolò Altamura, Enrico Bragastini, Marco Campion, Mila Dalla Preda
2026 Best paper preprint
ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage.
arXiv
Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski