Yusuke Kobayashi

193 papers A* 17A 12B 23C 3Misc 3Journal 127Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A PTAS for Weighted Triangle-free 2-Matching. CoRR Miguel Bosch-Calvo, Fabrizio Grandoni, Yusuke Kobayashi, Takashi Noguchi
2026	J	`jnl`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. SIAM J. Discret. Math. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2026	J	`jnl`	Polynomial Kernels with Reachability for Weighted d-Matroid Intersection. CoRR Chien-Chung Huang, Naonori Kakimura, Yusuke Kobayashi, Tatsuya Terao
2026	J	`jnl`	Reconfiguration of Time-Respecting Arborescences. Algorithmica Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2025	J	`jnl`	A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering. CoRR Akitoshi Kawamura, Yusuke Kobayashi
2025	J	`jnl`	Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures. ACM Trans. Quantum Comput. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	EFX allocations for indivisible chores: Matching-based approach. Theor. Comput. Sci. Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto
2025	J	`jnl`	Finding spanning trees with perfect matchings. Discret. Appl. Math. Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
2025	B	`conf`	Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems. ISAAC Yusuke Kobayashi, Bingkai Lin
2025	B	`conf`	Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. ISAAC Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025	J	`jnl`	Optimal general factor problem and jump system intersection. Math. Program. Yusuke Kobayashi
2025	—	`conf`	Pinwheel Covering. CIAC (2) Akitoshi Kawamura, Yusuke Kobayashi, Yosuke Kusano
2025	J	`jnl`	Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. SIAM J. Discret. Math. Yusuke Kobayashi, Ryoga Mahara
2025	J	`jnl`	Reconfiguration of colorings in triangulations of the sphere. J. Comput. Geom. Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	Reconfiguration of the Union of Arborescences. Algorithmica Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
2025	J	`jnl`	Reforming an Envy-Free Matching. Algorithmica Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	Rerouting Planar Curves and Disjoint Paths. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	—	`conf`	Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem. SOSA Yusuke Kobayashi, Takashi Noguchi
2024	J	`jnl`	Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2024	J	`jnl`	Finding Spanning Trees with Perfect Matchings. CoRR Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
2024	A	`conf`	Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. ESA Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
2024	J	`jnl`	Loss Minimization for Electrical Flows over Spanning Trees on Grids. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2024	A*	`conf`	Subquadratic Submodular Maximization with a General Matroid Constraint. ICALP Yusuke Kobayashi, Tatsuya Terao
2024	J	`jnl`	Subquadratic Submodular Maximization with a General Matroid Constraint. CoRR Yusuke Kobayashi, Tatsuya Terao
2024	J	`jnl`	Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem. CoRR Yusuke Kobayashi, Takashi Noguchi
2023	A*	`conf`	A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2023	B	`conf`	Algorithmic Theory of Qubit Routing. WADS Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023	J	`jnl`	Algorithmic Theory of Qubit Routing. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023	B	`conf`	An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. ISAAC Yusuke Kobayashi, Takashi Noguchi
2023	J	`jnl`	An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover. CoRR Yusuke Kobayashi, Takashi Noguchi
2023	B	`conf`	EFX Allocations for Indivisible Chores: Matching-Based Approach. SAGT Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto
2023	J	`jnl`	EFX Allocations for Indivisible Chores: Matching-Based Approach. CoRR Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto
2023	J	`jnl`	Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2023	J	`jnl`	Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. CoRR Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
2023	J	`jnl`	Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2023	A*	`conf`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023	J	`jnl`	Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023	J	`jnl`	Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	J	`jnl`	On reachable assignments under dichotomous preferences. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	B	`conf`	Optimal General Factor Problem and Jump System Intersection. IPCO Yusuke Kobayashi
2023	A*	`conf`	Reconfiguration of Colorings in Triangulations of the Sphere. SoCG Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	J	`jnl`	Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. Algorithmica Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2023	B	`conf`	Reconfiguration of Time-Respecting Arborescences. WADS Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2023	J	`jnl`	Reconfiguration of Time-Respecting Arborescences. CoRR Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2023	B	`conf`	Reconfiguration of the Union of Arborescences. ISAAC Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
2023	J	`jnl`	Reconfiguration of the Union of Arborescences. CoRR Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
2023	A*	`conf`	Rerouting Planar Curves and Disjoint Paths. ICALP Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	J	`jnl`	Trade-offs among degree, diameter, and number of paths. Discret. Appl. Math. Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino
2022	J	`jnl`	A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022	J	`jnl`	A Weighted Linear Matroid Parity Algorithm. SIAM J. Comput. Satoru Iwata, Yusuke Kobayashi
2022	J	`jnl`	A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Oper. Res. Lett. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	J	`jnl`	An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022	J	`jnl`	Linear-Time Recognition of Double-Threshold Graphs. Algorithmica Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2022	A*	`conf`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	B	`conf`	On Reachable Assignments Under Dichotomous Preferences. PRIMA Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	On Reachable Assignments under Dichotomous Preferences. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	B	`conf`	One-Face Shortest Disjoint Paths with a Deviation Terminal. ISAAC Yusuke Kobayashi, Tatsuya Terao
2022	J	`jnl`	Optimal General Factor Problem and Jump System Intersection. CoRR Yusuke Kobayashi
2022	J	`jnl`	Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2022	B	`conf`	Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. ISAAC Yusuke Kobayashi, Ryoga Mahara
2022	J	`jnl`	Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average. CoRR Yusuke Kobayashi, Ryoga Mahara
2022	A	`conf`	Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. STACS Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2022	J	`jnl`	Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. CoRR Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2022	J	`jnl`	Reconfiguration of colorings in triangulations of the sphere. CoRR Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	A*	`conf`	Reforming an Envy-Free Matching. AAAI Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Reforming an Envy-Free Matching. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Rerouting Planar Curves and Disjoint Paths. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	J	`jnl`	Submodular reassignment problem for reallocating agents to tasks with synergy effects. Discret. Optim. Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022	J	`jnl`	Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. Math. Program. Yusuke Kobayashi
2021	J	`jnl`	Algorithms for gerrymandering over graphs. Theor. Comput. Sci. Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2021	J	`jnl`	Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2021	J	`jnl`	Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci. Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
2021	J	`jnl`	Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. Algorithmica Yoichi Iwata, Yusuke Kobayashi
2021	J	`jnl`	Market Pricing for Matroid Rank Valuations. SIAM J. Discret. Math. Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2021	J	`jnl`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2021	J	`jnl`	Tight Approximation for Unconstrained XOS Maximization. Math. Oper. Res. Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2020	J	`jnl`	A strongly polynomial time algorithm for the maximum supply rate problem on trees. Theor. Comput. Sci. Koki Takayama, Yusuke Kobayashi
2020	A	`conf`	An FPT Algorithm for Minimum Additive Spanner Problem. STACS Yusuke Kobayashi
2020	J	`jnl`	An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2020	J	`jnl`	Complexity of the multi-service center problem. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
2020	J	`jnl`	Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2020	J	`jnl`	Diameter of colorings under Kempe changes. Theor. Comput. Sci. Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2020	J	`jnl`	Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2020	J	`jnl`	Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability. CoRR Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
2020	J	`jnl`	Finding a path with two labels forbidden in group-labeled graphs. J. Comb. Theory B Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2020	B	`conf`	Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2020	J	`jnl`	Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2020	J	`jnl`	Linear min-max relation between the treewidth of an J. Comb. Theory B Ken-ichi Kawarabayashi, Yusuke Kobayashi
2020	B	`conf`	Linear-Time Recognition of Double-Threshold Graphs. WG Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2020	B	`conf`	Market Pricing for Matroid Rank Valuations. ISAAC Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2020	J	`jnl`	Market Pricing for Matroid Rank Valuations. CoRR Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2020	J	`jnl`	On the number of edges in a graph with many two-hop disjoint paths. Discret. Appl. Math. Koki Takayama, Yusuke Kobayashi
2020	C	`conf`	Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	J	`jnl`	Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	A	`conf`	Reconfiguration of Spanning Trees with Many or Few Leaves. ESA Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2020	J	`jnl`	Reconfiguration of Spanning Trees with Many or Few Leaves. CoRR Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2020	A	`conf`	Shortest Reconfiguration of Colorings Under Kempe Changes. STACS Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2020	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2020	C	`conf`	The Steiner Problem for Count Matroids. IWOCA Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino
2020	B	`conf`	Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles. IPCO Yusuke Kobayashi
2019	J	`jnl`	A Weighted Linear Matroid Parity Algorithm. CoRR Satoru Iwata, Yusuke Kobayashi
2019	A	`conf`	Algorithms for Gerrymandering over Graphs. AAMAS Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	An FPT Algorithm for Max-Cut Parameterized by Crossing Number. CoRR Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki
2019	J	`jnl`	An FPT Algorithm for Minimum Additive Spanner Problem. CoRR Yusuke Kobayashi
2019	C	`conf`	An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. IWOCA Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki
2019	Misc	`conf`	Diameter of Colorings Under Kempe Changes. COCOON Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2019	B	`conf`	Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. IPEC Yoichi Iwata, Yusuke Kobayashi
2019	J	`jnl`	Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. CoRR Yoichi Iwata, Yusuke Kobayashi
2019	J	`jnl`	Linear-Time Recognition of Double-Threshold Graphs. CoRR Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2019	J	`jnl`	Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	B	`conf`	Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
2019	J	`jnl`	Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
2019	J	`jnl`	Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	A	`conf`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019	B	`conf`	The Perfect Matching Reconfiguration Problem. MFCS Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
2019	J	`jnl`	The Perfect Matching Reconfiguration Problem. CoRR Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
2019	J	`jnl`	Two disjoint shortest paths problem with non-negative edge length. Oper. Res. Lett. Yusuke Kobayashi, Ryo Sako
2019	J	`jnl`	Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. CoRR Yusuke Kobayashi
2018	Misc	`conf`	A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees. FAW Koki Takayama, Yusuke Kobayashi
2018	J	`jnl`	All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. SIAM J. Comput. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2018	J	`jnl`	Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. CoRR Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2018	J	`jnl`	NP-hardness and fixed-parameter tractability of the minimum spanner problem. Theor. Comput. Sci. Yusuke Kobayashi
2018	J	`jnl`	The parity Hamiltonian cycle problem. Discret. Math. Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2018	J	`jnl`	Tight Approximation for Unconstrained XOS Maximization. CoRR Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2017	A*	`conf`	A weighted linear matroid parity algorithm. STOC Satoru Iwata, Yusuke Kobayashi
2017	J	`jnl`	An algorithm for identifying cycle-plus-triangles graphs. Discret. Appl. Math. Kristóf Bérczi, Yusuke Kobayashi
2017	B	`conf`	Complexity of the Multi-Service Center Problem. ISAAC Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
2017	J	`jnl`	Efficient stabilization of cooperative matching games. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017	J	`jnl`	Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation. Algorithmica Yusuke Kobayashi, Sho Toyooka
2017	J	`jnl`	Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. SIAM J. Discret. Math. Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi
2017	J	`jnl`	Randomized strategies for cardinality robustness in the knapsack problem. Theor. Comput. Sci. Yusuke Kobayashi, Kenjiro Takazawa
2017	Misc	`conf`	Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017	A	`conf`	The Directed Disjoint Shortest Paths Problem. ESA Kristóf Bérczi, Yusuke Kobayashi
2017	—	`conf`	Tight Approximability of the Server Allocation Problem for Real-Time Applications. ALGOCLOUD Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada
2016	J	`jnl`	An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two. ACM Trans. Algorithms Ken-ichi Kawarabayashi, Yusuke Kobayashi
2016	J	`jnl`	Covering Intersecting Bi-set Families under Matroid Constraints. SIAM J. Discret. Math. Kristóf Bérczi, Tamás Király, Yusuke Kobayashi
2016	J	`jnl`	Edge-disjoint odd cycles in 4-edge-connected graphs. J. Comb. Theory B Ken-ichi Kawarabayashi, Yusuke Kobayashi
2016	A	`conf`	Efficient Stabilization of Cooperative Matching Games. AAMAS Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2016	J	`jnl`	Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network. Eur. J. Oper. Res. Kensuke Otsuki, Yusuke Kobayashi, Kazuo Murota
2016	—	`conf`	Randomized Strategies for Cardinality Robustness in the Knapsack Problem. ANALCO Yusuke Kobayashi, Kenjiro Takazawa
2015	J	`jnl`	Fence patrolling by mobile agents with distinct speeds. Distributed Comput. Akitoshi Kawamura, Yusuke Kobayashi
2015	—	`conf`	Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. ICALP (1) Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2015	J	`jnl`	Selecting vertex disjoint paths in plane graphs. Networks Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych, Yusuke Kobayashi, Anita Schöbel
2015	J	`jnl`	The Generalized Terminal Backup Problem. SIAM J. Discret. Math. Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka
2015	J	`jnl`	The Parity Hamiltonian Cycle Problem. CoRR Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2015	J	`jnl`	The complexity of minimizing the difference of two M Oper. Res. Lett. Yusuke Kobayashi
2015	J	`jnl`	The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. Comb. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2014	A*	`conf`	An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. STOC Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer
2014	J	`jnl`	Fence patrolling by mobile agents with distinct speeds. CoRR Akitoshi Kawamura, Yusuke Kobayashi
2014	A*	`conf`	Max-flow min-cut theorem and faster algorithms in a circular disk failure model. INFOCOM Yusuke Kobayashi, Kensuke Otsuki
2014	B	`conf`	Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2014	A*	`conf`	The Generalized Terminal Backup Problem. SODA Attila Bernáth, Yusuke Kobayashi
2014	J	`jnl`	Triangle-free 2-matchings and M-concave functions on jump systems. Discret. Appl. Math. Yusuke Kobayashi
2013	A*	`conf`	All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. FOCS Ken-ichi Kawarabayashi, Yusuke Kobayashi
2013	J	`jnl`	An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. ACM Trans. Algorithms Ken-ichi Kawarabayashi, Yusuke Kobayashi
2013	J	`jnl`	Robust Matchings and Matroid Intersections. SIAM J. Discret. Math. Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino
2012	J	`jnl`	A linear time algorithm for the induced disjoint paths problem in planar graphs. J. Comput. Syst. Sci. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	J	`jnl`	A proof of Cunningham's conjecture on restricted subgraphs and jump systems. J. Comb. Theory B Yusuke Kobayashi, Jácint Szabó, Kenjiro Takazawa
2012	J	`jnl`	Algorithms for Finding a Maximum Non- SIAM J. Discret. Math. Yusuke Kobayashi, Yuichi Yoshida
2012	J	`jnl`	An algorithm for (n-3)-connectivity augmentation problem: Jump system approach. J. Comb. Theory B Kristóf Bérczi, Yusuke Kobayashi
2012	J	`jnl`	An algorithm for finding a maximum t-matching excluding complete partite subgraphs. Discret. Optim. Yusuke Kobayashi, Xin Yin
2012	J	`jnl`	Cone superadditivity of discrete convex functions. Math. Program. Yusuke Kobayashi, Kazuo Murota, Robert Weismantel
2012	A	`conf`	Edge-disjoint Odd Cycles in 4-edge-connected Graphs. STACS Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	A*	`conf`	Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. SODA Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	B	`conf`	Fence Patrolling by Mobile Agents with Distinct Speeds. ISAAC Akitoshi Kawamura, Yusuke Kobayashi
2012	J	`jnl`	Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. J. Comb. Theory B Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	A	`conf`	Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. STACS Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	A*	`conf`	List-coloring graphs without subdivisions and without immersions. SODA Ken-ichi Kawarabayashi, Yusuke Kobayashi
2012	J	`jnl`	Testing the (s, t)-disconnectivity of graphs and digraphs. Theor. Comput. Sci. Yuichi Yoshida, Yusuke Kobayashi
2012	J	`jnl`	The complexity of the node capacitated in-tree packing problem. Networks Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, Mutsunori Yagiura
2012	J	`jnl`	The disjoint paths problem in quadratic time. J. Comb. Theory B Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed
2011	A	`conf`	Algorithms for Finding a Maximum Non-k-linked Graph. ESA Yusuke Kobayashi, Yuichi Yoshida
2011	J	`jnl`	An Improved Algorithm for the Half-Disjoint Paths Problem. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2011	A*	`conf`	Breaking o(n STOC Ken-ichi Kawarabayashi, Yusuke Kobayashi
2010	J	`jnl`	A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs. Discret. Optim. Yusuke Kobayashi
2010	J	`jnl`	Algorithms for finding an induced cycle in planar graphs. Comb. Ken-ichi Kawarabayashi, Yusuke Kobayashi
2010	—	`conf`	An APPROX-RANDOM Ken-ichi Kawarabayashi, Yusuke Kobayashi
2010	J	`jnl`	An Algorithm for Minimum Cost Arc-Connectivity Orientations. Algorithmica Satoru Iwata, Yusuke Kobayashi
2010	—	`conf`	Improved Algorithm for the Half-Disjoint Paths Problem. APPROX-RANDOM Ken-ichi Kawarabayashi, Yusuke Kobayashi
2010	J	`jnl`	On shortest disjoint paths in planar graphs. Discret. Optim. Yusuke Kobayashi, Christian Sommer
2010	—	`conf`	Robust Matchings and Matroid Intersections. ESA (2) Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino
2010	A*	`conf`	The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. SODA Ken-ichi Kawarabayashi, Yusuke Kobayashi
2009	A*	`conf`	Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. SODA Yusuke Kobayashi, Ken-ichi Kawarabayashi
2009	J	`jnl`	Even factors, jump systems, and discrete convexity. J. Comb. Theory B Yusuke Kobayashi, Kenjiro Takazawa
2009	J	`jnl`	Induced disjoint paths problem in a planar digraph. Discret. Appl. Math. Yusuke Kobayashi
2009	B	`conf`	On Shortest Disjoint Paths in Planar Graphs. ISAAC Yusuke Kobayashi, Christian Sommer
2008	B	`conf`	The Induced Disjoint Paths Problem. IPCO Ken-ichi Kawarabayashi, Yusuke Kobayashi
2007	J	`jnl`	Induction of M-convex functions by linking systems. Discret. Appl. Math. Yusuke Kobayashi, Kazuo Murota
2007	J	`jnl`	Operations on M-Convex Functions on Jump Systems. SIAM J. Discret. Math. Yusuke Kobayashi, Kazuo Murota, Ken'ichiro Tanaka