Yutaro Yamaguchi

Discret. Appl. Math., 2024

Matroid Intersection under Minimum Rank Oracle.

[BibT_eX]

[DOI]

CoRR, 2024

Finding Spanning Trees with Perfect Matchings.

[BibT_eX]

[DOI]

CoRR, 2024

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems.

[BibT_eX]

[DOI]

Hitoshi Murakami

CoRR, 2024

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs.

[BibT_eX]

[DOI]

Ryoma Norose

CoRR, 2024

A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching.

[BibT_eX]

[DOI]

Taisuke Izumi

Naoki Kitamura

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Matroid Intersection under Restricted Oracles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., June, 2023

Hypergraph characterization of split matroids.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2023

2022

Finding a Shortest Non-Zero Path in Group-Labeled Graphs.

[BibT_eX]

[DOI]

Yoichi Iwata

Comb., December, 2022

Approximation by lexicographically maximal solutions in matching and matroid intersection problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice.

[BibT_eX]

[DOI]

So Nakashima

Math. Program., 2022

An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2022

Maintaining Optimality in Assignment Problem against Weight Updates around Vertices.

[BibT_eX]

[DOI]

CoRR, 2022

Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions.

[BibT_eX]

[DOI]

CoRR, 2022

2021

List Coloring of Two Matroids through Reduction to Partition Matroids.

[BibT_eX]

[DOI]

Kristóf Bérczi

Tamás Schwarcz

SIAM J. Discret. Math., 2021

Tight Approximation for Unconstrained XOS Maximization.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem.

[BibT_eX]

[DOI]

Yuya Masumura

Taihei Oki

Algorithmica, 2021

2020

Subgame Perfect Equilibria of Sequential Matching Games.

[BibT_eX]

[DOI]

Yu Yokoi

ACM Trans. Economics and Comput., 2020

Stochastic packing integer programs with few queries.

[BibT_eX]

[DOI]

Math. Program., 2020

Finding a path with two labels forbidden in group-labeled graphs.

[BibT_eX]

[DOI]

Yusuke Kobayashi

J. Comb. Theory B, 2020

A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Antimatroids induced by matchings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

List colouring of two matroids through reduction to partition matroids.

[BibT_eX]

[DOI]

Kristóf Bérczi

Tamás Schwarcz

CoRR, 2019

Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice - Continuous Greedy Algorithm on Median Complex -.

[BibT_eX]

[DOI]

So Nakashima

CoRR, 2019

Stochastic Monotone Submodular Maximization with Queries.

[BibT_eX]

[DOI]

CoRR, 2019

A Dijkstra-Based Efficient Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Making Bipartite Graphs DM-Irreducible.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Tight Approximation for Unconstrained XOS Maximization.

[BibT_eX]

[DOI]

Yusuke Kobayashi

CoRR, 2018

Computing a Subgame Perfect Equilibrium of a Sequential Matching Game.

[BibT_eX]

[DOI]

Yu Yokoi

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms.

[BibT_eX]

[DOI]

Yoichi Iwata

Yuichi Yoshida

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing.

[BibT_eX]

[DOI]

Yoichi Iwata

Yuichi Yoshida

CoRR, 2017

2016

Packing A-Paths in Group-Labelled Graphs via Linear Matroid Parity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Realizing symmetric set functions as hypergraph cut capacity.

[BibT_eX]

[DOI]

Discret. Math., 2016

Packing non-zero A-paths via matroid matching.

[BibT_eX]

[DOI]

Shin-ichi Tanigawa

Discret. Appl. Math., 2016

Maximizing Time-Decaying Influence in Social Networks.

[BibT_eX]

[DOI]

Naoto Ohsaka

Naonori Kakimura

Ken-ichi Kawarabayashi

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016

Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Smart Grid, 2015

Parametric Maxflows for Structured Sparse Learning with Convex Relaxations of Submodular Functions.

[BibT_eX]

[DOI]

Yoshinobu Kawahara

CoRR, 2015

Finding a Path in Group-Labeled Graphs with Two Labels Forbidden.

[BibT_eX]

[DOI]

Yusuke Kobayashi

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity.

[BibT_eX]

[DOI]