On fault injection approaches for fault tolerance of feedforward neural networks. - Takehiro Ito; Itsuo Takanami (Asian Test Symposium, 1997)

Algorithms for the Multicolorings of Partial k-Trees. - Takehiro Ito; Takao Nishizeki; Xiao Zhou 001 (COCOON, 2002)

Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA. - Takehiro Ito; Yuichiro Shibata; Kiyoshi Oguri (FPL, 2004)

Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. - Takehiro Ito; Xiao Zhou 001; Takao Nishizeki (WG, 2004)

Partitioning trees of supply and demand. - Takehiro Ito; Xiao Zhou 001; Takao Nishizeki (Int. J. Found. Comput. Sci., 2005)

Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. - Takehiro Ito; Xiao Zhou 001; Takao Nishizeki (J. Discrete Algorithms, 2006)

Partitioning Graphs of Supply and Demand. - Takehiro Ito (WALCOM, 2007)

Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size. - Takehiro Ito; Kazuya Goto; Xiao Zhou 001; Takao Nishizeki (IEICE Trans. Inf. Syst., 2007)

Algorithms for finding distance-edge-colorings of graphs. - Takehiro Ito; Akira Kato; Xiao Zhou 001; Takao Nishizeki (J. Discrete Algorithms, 2007)

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. - Takehiro Ito; Takeaki Uno; Xiao Zhou 001; Takao Nishizeki (ISAAC, 2008)

Approximability of partitioning graphs with supply and demand. - Takehiro Ito; Erik D. Demaine; Xiao Zhou 001; Takao Nishizeki (J. Discrete Algorithms, 2008)

Partitioning graphs of supply and demand. - Takehiro Ito; Xiao Zhou 001; Takao Nishizeki (Discret. Appl. Math., 2009)

A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2. - Takehiro Ito; W. Sean Kennedy; Bruce A. Reed (Electron. Notes Discret. Math., 2009)

On disconnected cuts and separators. - Takehiro Ito; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Discret. Appl. Math., 2011)

Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. - Takehiro Ito; Naoki Sakamoto; Xiao Zhou 001; Takao Nishizeki (IEICE Trans. Inf. Syst., 2011)

Laser Interferometric Measuring Method of Involute Artifact and Stabilization of Measurement. - Masaharu Komori; Fumi Takeoka; Aizoh Kubo; Hiroshige Fujio; Takehiro Ito; Sonko Osawa; Osamu Sato; Toshiyuki Takatsuji (Int. J. Autom. Technol., 2011)

On the complexity of reconfiguration problems. - Takehiro Ito; Erik D. Demaine; Nicholas J. A. Harvey; Christos H. Papadimitriou; Martha Sideri; Ryuhei Uehara; Yushi Uno (Theor. Comput. Sci., 2011)

Parameterizing cut sets in a graph by the number of their components. - Takehiro Ito; Marcin Kaminski 001; Daniël Paulusma; Dimitrios M. Thilikos (Theor. Comput. Sci., 2011)

Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. - Takashi Horiyama; Takehiro Ito; Keita Nakatsuka; Akira Suzuki 001; Ryuhei Uehara (CCCG, 2012)

Reconfiguration of List L(2, 1)-Labelings in a Graph. - Takehiro Ito; Kazuto Kawamura; Hirotaka Ono 001; Xiao Zhou 001 (ISAAC, 2012)

Minimum Cost Partitions of Trees with Supply and Demand. - Takehiro Ito; Takuya Hara; Xiao Zhou 001; Takao Nishizeki (Algorithmica, 2012)

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. - Takehiro Ito; Takao Nishizeki; Michael Schröder 001; Takeaki Uno; Xiao Zhou 001 (Algorithmica, 2012)

Reconfiguration of list edge-colorings in a graph. - Takehiro Ito; Marcin Kaminski 001; Erik D. Demaine (Discret. Appl. Math., 2012)

An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. - Takehiro Ito; Kazuto Kawamura; Xiao Zhou 001 (IEICE Trans. Inf. Syst., 2012)

Base Location Problems for Base-Monotone Regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (WALCOM, 2013)

Route-Enabling Graph Orientation Problems. - Takehiro Ito; Yuichiro Miyamoto; Hirotaka Ono 001; Hisao Tamaki; Ryuhei Uehara (Algorithmica, 2013)

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. - Kei Uchizawa; Takanori Aoki; Takehiro Ito; Akira Suzuki 001; Xiao Zhou 001 (Algorithmica, 2013)

The Minimum Vulnerability Problem on Graphs. - Yusuke Aoki; Bjarni V. Halldórsson; Magnús M. Halldórsson; Takehiro Ito; Christian Konrad 001; Xiao Zhou 001 (COCOA, 2014)

Polynomial-Time Algorithm for Sliding Tokens on Trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (ISAAC, 2014)

Fixed-Parameter Tractability of Token Jumping on Planar Graphs. - Takehiro Ito; Marcin Jakub Kaminski; Hirotaka Ono 001 (ISAAC, 2014)

Deterministic Algorithms for the Independent Feedback Vertex Set Problem. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (IWOCA, 2014)

On the Parameterized Complexity for Token Jumping on Graphs. - Takehiro Ito; Marcin Kaminski 001; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (TAMC, 2014)

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (CoRR, 2014)

On the Minimum Caterpillar Problem in Digraphs. - Taku Okada; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Approximability of the subset sum reconfiguration problem. - Takehiro Ito; Erik D. Demaine (J. Comb. Optim., 2014)

Complexity of finding maximum regular induced subgraphs with prescribed degree. - Yuichi Asahiro; Hiroshi Eto; Takehiro Ito; Eiji Miyano (Theor. Comput. Sci., 2014)

Base-object location problems for base-monotone regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (Theor. Comput. Sci., 2014)

Reconfiguration of list L(2,1)-labelings in a graph. - Takehiro Ito; Kazuto Kawamura; Hirotaka Ono 001; Xiao Zhou 001 (Theor. Comput. Sci., 2014)

A 4.31-approximation for the geometric unique coverage problem on unit disks. - Takehiro Ito; Shin-Ichi Nakano; Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Theor. Comput. Sci., 2014)

Generalized rainbow connectivity of graphs. - Kei Uchizawa; Takanori Aoki; Takehiro Ito; Xiao Zhou 001 (Theor. Comput. Sci., 2014)

Competitive Diffusion on Weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (WADS, 2015)

The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

Algorithms for the Independent Feedback Vertex Set Problem. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

Linear-time algorithm for sliding tokens on trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (Theor. Comput. Sci., 2015)

Swapping labeled tokens on graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (Theor. Comput. Sci., 2015)

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. - Takehiro Ito; Shin-Ichi Nakano; Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Comput. Geom., 2016)

Reconfiguration of Vertex Covers in a Graph. - Takehiro Ito; Hiroyuki Nooka; Xiao Zhou 001 (IEICE Trans. Inf. Syst., 2016)

The minimum vulnerability problem on specific graph classes. - Yusuke Aoki; Bjarni V. Halldórsson; Magnús M. Halldórsson; Takehiro Ito; Christian Konrad 001; Xiao Zhou 001 (J. Comb. Optim., 2016)

The complexity of dominating set reconfiguration. - Arash Haddadan; Takehiro Ito; Amer E. Mouawad; Naomi Nishimura; Hirotaka Ono 001; Akira Suzuki 001; Youcef Tebbal (Theor. Comput. Sci., 2016)

Tight Approximability of the Server Allocation Problem for Real-Time Applications. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto; Taichi Shiitada (ALGOCLOUD, 2017)

Complexity of Coloring Reconfiguration under Recolorability Constraints. - Hiroki Osawa; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (ISAAC, 2017)

Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. - Hiroshi Eto; Takehiro Ito; Zhilong Liu; Eiji Miyano (WALCOM, 2017)

Complexity of Tiling a Polygon with Trominoes or Bars. - Takashi Horiyama; Takehiro Ito; Keita Nakatsuka; Akira Suzuki 001; Ryuhei Uehara (Discret. Comput. Geom., 2017)

Reconfiguration of Steiner Trees in an Unweighted Graph. - Haruka Mizuta; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

Efficient stabilization of cooperative matching games. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Theor. Comput. Sci., 2017)

Algorithms for Coloring Reconfiguration Under Recolorability Constraints. - Hiroki Osawa; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (ISAAC, 2018)

Incremental Optimization of Independent Sets under Reachability Constraints. - Takehiro Ito; Haruka Mizuta; Naomi Nishimura; Akira Suzuki 001 (CoRR, 2018)

Complexity of Reconfiguration Problems for Constraint Satisfaction. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (CoRR, 2018)

The Complexity of (List) Edge-Coloring Reconfiguration Problem. - Hiroki Osawa; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Parameterized complexity of the list coloring reconfiguration problem with graph parameters. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (Theor. Comput. Sci., 2018)

The Perfect Matching Reconfiguration Problem. - Marthe Bonamy; Nicolas Bousquet 001; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Arnaud Mary; Moritz Mühlenthaler; Kunihiro Wasa (MFCS, 2019)

Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. - Haruka Mizuta; Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (MFCS, 2019)

Shortest Reconfiguration of Matchings. - Nicolas Bousquet 001; Tatsuhiko Hatanaka; Takehiro Ito; Moritz Mühlenthaler (WG, 2019)

Minimum-Cost b-Edge Dominating Sets on Trees. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Algorithmica, 2019)

The Coloring Reconfiguration Problem on Specific Graph Classes. - Tatsuhiko Hatanaka; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Inf. Syst., 2019)

Reconfiguration of maximum-weight b-matchings in a graph. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (J. Comb. Optim., 2019)

Reconfiguration of colorable sets in classes of perfect graphs. - Takehiro Ito; Yota Otachi (Theor. Comput. Sci., 2019)

Reconfiguration of Spanning Trees with Many or Few Leaves. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (ESA, 2020)

Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (ISAAC, 2020)

Shortest Reconfiguration of Colorings Under Kempe Changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (STACS, 2020)

Parameterized complexity of independent set reconfiguration problems. - Takehiro Ito; Marcin Jakub Kaminski; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (Discret. Appl. Math., 2020)

Diameter of colorings under Kempe changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (Theor. Comput. Sci., 2020)

Reconfiguring spanning and induced subgraphs. - Tesshu Hanaka; Takehiro Ito; Haruka Mizuta; Benjamin R. Moore; Naomi Nishimura; Vijay Subramanya; Akira Suzuki 001; Krishna Vaidyanathan (Theor. Comput. Sci., 2020)

Complexity of the multi-service center problem. - Takehiro Ito; Naonori Kakimura; Yusuke Kobayashi 001 (Theor. Comput. Sci., 2020)

Reconfiguring Directed Trees in a Digraph. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (COCOON, 2021)

Algorithms for gerrymandering over graphs. - Takehiro Ito; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Theor. Comput. Sci., 2021)

Approximability of the independent feedback vertex set problem for bipartite graphs. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (Theor. Comput. Sci., 2021)

Invitation to Combinatorial Reconfiguration (Invited Talk). - Takehiro Ito (CPM, 2022)

Independent Set Reconfiguration on Directed Graphs. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Masahiro Takahashi; Kunihiro Wasa (MFCS, 2022)

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (STACS, 2022)

Reconfiguration of Regular Induced Subgraphs. - Hiroshi Eto; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi; Kunihiro Wasa (WALCOM, 2022)

Invitation to Combinatorial Reconfiguration. - Takehiro Ito (WALCOM, 2022)

Core Challenge 2022: Solver and Graph Descriptions. - Takehide Soh; Yoshio Okamoto; Takehiro Ito (CoRR, 2022)

Incremental optimization of independent sets under the reconfiguration framework. - Takehiro Ito; Haruka Mizuta; Naomi Nishimura; Akira Suzuki 001 (J. Comb. Optim., 2022)

A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (Oper. Res. Lett., 2022)

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (SIAM J. Discret. Math., 2022)

Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. - Hiroshi Eto; Takehiro Ito; Zhilong Liu; Eiji Miyano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Reconfiguration of Colorings in Triangulations of the Sphere. - Takehiro Ito; Yuni Iwamasa; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (SoCG, 2023)

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. - Takehiro Ito; Jun Kawahara; Yu Nakahata; Takehide Soh; Akira Suzuki 001; Junichi Teruyama; Takahisa Toda (CPAIOR, 2023)

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto (ICALP, 2023)

Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. - Takahisa Toda; Takehiro Ito; Jun Kawahara; Takehide Soh; Akira Suzuki 001; Junichi Teruyama (ICTAI, 2023)

Reconfiguration of Time-Respecting Arborescences. - Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi; Yusuke Kobayashi 001; Shun-ichi Maezawa; Akira Suzuki 001 (WADS, 2023)

Algorithmic Theory of Qubit Routing. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (WADS, 2023)

Core Challenge 2023: Solver and Graph Descriptions. - Takehide Soh; Tomoya Tanjo; Yoshio Okamoto; Takehiro Ito (CoRR, 2023)

Reconfiguring (non-spanning) arborescences. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (Theor. Comput. Sci., 2023)

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2023)

Fixed-parameter algorithms for graph constraint logic. - Tatsuhiko Hatanaka; Felix Hommelsheim; Takehiro Ito; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)

Reconfiguration of cliques in a graph. - Takehiro Ito; Hirotaka Ono 001; Yota Otachi (Discret. Appl. Math., 2023)

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (Algorithmica, 2023)

Happy Set Problem on Subclasses of Co-comparability Graphs. - Hiroshi Eto; Takehiro Ito; Eiji Miyano; Akira Suzuki 001; Yuma Tamura (Algorithmica, 2023)

On reachable assignments under dichotomous preferences. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Theor. Comput. Sci., 2023)

Sorting balls and water: Equivalence and computational complexity. - Takehiro Ito; Jun Kawahara; Shin-ichi Minato; Yota Otachi; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Katsuhisa Yamanaka; Ryo Yoshinaka (Theor. Comput. Sci., 2023)

CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). - Takehide Soh; Tomoya Tanjo; Yoshio Okamoto; Takehiro Ito (SOCS, 2024)

Scalable Hard Instances for Independent Set Reconfiguration. - Takehide Soh; Takumu Watanabe; Jun Kawahara; Akira Suzuki 001; Takehiro Ito (SEA, 2024)

Independent Set Reconfiguration Under Bounded-Hop Token. - Hiroki Hatano; Naoki Kitamura; Taisuke Izumi; Takehiro Ito; Toshimitsu Masuzawa (CoRR, 2024)

Loss Minimization for Electrical Flows over Spanning Trees on Grids. - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yoshio Okamoto (CoRR, 2024)

Reconfiguration of vertex-disjoint shortest paths on graphs. - Rin Saito; Hiroshi Eto; Takehiro Ito; Ryuhei Uehara (J. Graph Algorithms Appl., 2024)

Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. - Tatsuya Gima; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi (Algorithmica, 2024)

Independent Set Reconfiguration Under Bounded-Hop Token Jumping. - Hiroki Hatano; Naoki Kitamura; Taisuke Izumi; Takehiro Ito; Toshimitsu Masuzawa (WALCOM, 2025)

Rerouting Planar Curves and Disjoint Paths. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi 001; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2025)

Reforming an Envy-Free Matching. - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi 001; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Algorithmica, 2025)