12 citations · 13 across the 3 of their papers we have counts for
4 papers
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
We study the generalized minimum Manhattan network (GMMN) problem: given a set of pairs of two points in the Euclidean plane , we are required to find a minimum-l…
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
Kazuki Matoya, Taihei Oki
Spanning trees are a representative example of linear matroid bases that are efficiently countable. Perfect matchings of Pfaffian bipartite graphs are a countable example of common…
Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
Taihei Oki
Differential-algebraic equations (DAEs) are widely used for modeling of dynamical systems. In numerical analysis of DAEs, consistent initialization and index reduction are importan…
Multi-dimensional Graph Fourier Transform
Takashi Kurokawa, Taihei Oki, Hiromichi Nagao
Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-di…