Get started
Author

Takashi Ishizuka

Observed name: Ishizuka, Takashi
ORCID: 0000-0003-0418-8170
Observed ORCID: 0000-0003-0418-8170
OpenAlex ID: A5020868715
The complexity of the parity argument with potential
2021 · Takashi Ishizuka · Journal of Computer and System Sciences · 11
On the Complexity of Stable Fractional Hypergraph Matching
2018 · Ishizuka, Takashi, Kamiyama, Naoyuki · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 3
PDF
On the complexity of some restricted variants of Quotient Pigeon and a weak variant of Kőnig
2025 · Takashi Ishizuka · Information Processing Letters · 2
Corrigendum: PLS is contained in PLC
2023 · Ishizuka, Takashi · arXiv (Cornell University) · 1
PDF
The PPP-completeness of Ward-Szabó
2026 · Takashi Ishizuka · Theoretical Computer Science
Note on Constrained Long Choice with Multiple Beginning Elements
2024 · Takashi Ishizuka · Theory of Computing Systems
PDF
On the complexity of finding a Caristi's fixed point
2021 · Takashi Ishizuka · Information Processing Letters
Works count: 7
Citation count: 17
H-index: 2
I10-index: 1
Year
Topic
Type