( en | de | ru )

 

Disambiguation of "Yamaguchi, Yutaro"

Author of the publication

copydeleteadd this publication to your clipboard
An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position.

, , , , , and . IEICE Trans. Inf. Syst., 105-D (3): 503-507 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Shigeo Yamaguchi

Yutaro Nishi

Fabian Yamaguchi

Ichiro Yamaguchi

Ichiro Yamaguchi

 

Other publications of authors with the same name

Maximizing Time-Decaying Influence in Social Networks., , , and . ECML/PKDD (1), volume 9851 of Lecture Notes in Computer Science, page 132-147. Springer, (2016)An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position., , , , , and . IEICE Trans. Inf. Syst., 105-D (3): 503-507 (2022)Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity.. ISAAC, volume 64 of LIPIcs, page 63:1-63:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)GaN Amplifiers of Selectable Output Power Function with Semi-Custom Matching Networks., , , , and . IEICE Trans. Electron., 102-C (10): 682-690 (2019)Approximation by lexicographically maximal solutions in matching and matroid intersection problems., , , and . Theor. Comput. Sci., (2022)List Coloring of Two Matroids through Reduction to Partition Matroids., , and . SIAM J. Discret. Math., 35 (3): 2192-2209 (2021)Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions., , , , , and . CoRR, (2023)A Ka-Band CW 15.5W 15.6% Fractional Bandwidth GaN Power Amplifier MMIC Using Wideband BPF Inter-stage Matching Network., , , and . BCICTS, page 1-4. IEEE, (2019)Millimeter-Wave GaN Power Amplifier MMICs for 5G Application., , , and . ISCAS, page 1-4. IEEE, (2019)A Dijkstra-Based Efficient Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.. CoRR, (2019)