隈部 壮

Complexity of graph-state preparation by Clifford circuits 

Quantum 10 2165 2026年7月18日  査読有り

Quadratic Kernel for Cliques or Trees Vertex Deletion 

36th International Symposium on Algorithms and Computation (ISAAC 2025) 359 48:1-48:15 2025年11月27日  査読有り

Max-Distance Sparsification for Diversification and Clustering 

33rd Annual European Symposium on Algorithms (ESA 2025) 351 46:1-46:14 2025年10月1日  査読有り

Courcelle's Theorem for Lipschitz Continuity 

33rd Annual European Symposium on Algorithms (ESA 2025) 351 11:1-11:14 2025年10月1日  査読有り

Lipschitz Continuous Algorithms for Covering Problems 

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2025) 1057-1093 2025年1月7日  査読有り

Lipschitz Continuous Allocations for Optimization Games 

51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) 297 102:1-102:16 2024年7月2日  査読有り

Dichotomies for Tree Minor Containment with Structural Parameters 

WALCOM: Algorithms and Computation (WALCOM 2024) 14549 392-405 2024年2月29日  査読有り

Lipschitz Continuous Algorithms for Graph Problems 

2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS 2023) 762-797 2023年  査読有り

Average Sensitivity of the Knapsack Problem 

30th Annual European Symposium on Algorithms (ESA 2022) 244 75:1-75:14 2022年9月1日  査読有り

Average Sensitivity of Dynamic Programming 

Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022) 1925-1961 2022年1月5日  査読有り

Interval Query Problem on Cube-Free Median Graphs 

32nd International Symposium on Algorithms and Computation (ISAAC 2021) 212 18:1-18:14 2021年11月30日  査読有り

Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property 

Combinatorial Algorithms (IWOCA 2021) 12757 428-441 2021年6月30日  査読有り

r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes 

WALCOM: Algorithms and Computation (WALCOM 2021) 12635 154-165 2021年2月  査読有り

Convexity of b-matching Games 

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI 2020) 261-267 2020年7月  査読有り

Convexity of Hypergraph Matching Game 

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020) 663-671 2020年5月  査読有り

Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem 

WALCOM: Algorithms and Computation (WALCOM 2019) 11355 248-260 2019年  査読有り