Takashi Ishizuka. On the complexity of finding a Caristi's fixed point. Information Processing Letters. 2021. 170. 106119-106119
Takashi Ishizuka. The complexity of the parity argument with potential. Journal of Computer and System Sciences. 2021. 120. 14-41
Takashi Ishizuka, Naoyuki Kamiyama. On the Complexity of Stable Fractional Hypergraph Matching. Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC). 2018. LIPIcs 123. 11:1-11:12