Naoyuki Kamiyama

CoRR, 2024

The Strongly Stable Matching Problem with Closures.

[BibT_eX]

[DOI]

CoRR, 2024

Reachability of Fair Allocations via Sequential Exchanges.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

On reachable assignments under dichotomous preferences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., November, 2023

On optimization problems in acyclic hypergraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., August, 2023

Pareto efficient matchings with pairwise preferences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, January, 2023

Algorithmic Theory of Qubit Routing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Reconfiguration of Time-Respecting Arborescences.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

On Connectedness of Solutions to Integer Linear Systems.

[BibT_eX]

[DOI]

Takasugu Shigenobu

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

A Matroid Generalization of the Super-Stable Matching Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

A parameterized view to the robust recoverable base problem of matroids under structural uncertainty.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

Submodular reassignment problem for reallocating agents to tasks with synergy effects.

[BibT_eX]

[DOI]

Discret. Optim., 2022

A Note on Robust Subsets of Transversal Matroids.

[BibT_eX]

[DOI]

CoRR, 2022

Strongly Stable Matchings under Matroid Constraints.

[BibT_eX]

[DOI]

CoRR, 2022

On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games.

[BibT_eX]

[DOI]

Takashi Ishizuka

CoRR, 2022

NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game.

[BibT_eX]

[DOI]

Takashi Ishizuka

CoRR, 2022

Reforming an Envy-Free Matching.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Algorithms for gerrymandering over graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the complexity of fair house allocation.

[BibT_eX]

[DOI]

Pasin Manurangsi

Warut Suksompong

Oper. Res. Lett., 2021

Envy-free matchings with one-sided preferences and matroid constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

The envy-free matching problem with pairwise preferences.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Optimal class assignment problem: a case study at Gunma University.

[BibT_eX]

[DOI]

CoRR, 2021

Distributed Reconfiguration of Spanning Trees.

[BibT_eX]

[DOI]

Yukiko Yamauchi

Yota Otachi

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

MAS Network: Surrogate Neural Network for Multi-agent Simulation.

[BibT_eX]

[DOI]

Proceedings of the Multi-Agent-Based Simulation XXII - 22nd International Workshop, 2021

2020

Popular matchings with two-sided preference lists and matroid constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Lexicographically optimal earliest arrival flows.

[BibT_eX]

[DOI]

Networks, 2020

The b-branching problem in digraphs.

[BibT_eX]

[DOI]

Naonori Kakimura

Kenjiro Takazawa

Discret. Appl. Math., 2020

Envy-free Relaxations for Goods, Chores, and Mixed Items.

[BibT_eX]

[DOI]

Kristóf Bérczi

Erika R. Bérczi-Kovács

Endre Boros

Fekadu Tolessa Gedefa

CoRR, 2020

The Distance-Constrained Matroid Median Problem.

[BibT_eX]

[DOI]

Algorithmica, 2020

Optimal Control of Pedestrian Flows by Congestion Forecasts Satisfying User Equilibrium Conditions.

[BibT_eX]

[DOI]

Hiroaki Yamada

Proceedings of the PRIMA 2020: Principles and Practice of Multi-Agent Systems, 2020

On Stable Matchings with Pairwise Preferences and Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

An Information Distribution Method for Avoiding Hunting Phenomenon in Theme Parks.

[BibT_eX]

[DOI]

Hiroaki Yamada

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Discrete Newton methods for the evacuation problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Pareto Stable Matchings under One-Sided Matroid Constraints.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

An improved algorithm for testing substitutability of weak preferences.

[BibT_eX]

[DOI]

Susumu Kawanaka

Math. Soc. Sci., 2019

Exact and approximation algorithms for weighted matroid intersection.

[BibT_eX]

[DOI]

Chien-Chung Huang

Naonori Kakimura

Math. Program., 2019

Reconfiguration of maximum-weight b-matchings in a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

A note on balanced flows in equality networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Minimum-Cost b-Edge Dominating Sets on Trees.

[BibT_eX]

[DOI]

Algorithmica, 2019

Many-to-Many Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

The mixed evacuation problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

A Note on Submodular Function Minimization with Covering Type Linear Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2018

On the Complexity of Stable Fractional Hypergraph Matching.

[BibT_eX]

[DOI]

Takashi Ishizuka

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

A note on the submodular vertex cover problem with submodular penalties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Efficient stabilization of cooperative matching games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Popular Matchings with Ties and Matroid Constraints.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Strategic issues in college admissions with score-limits.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2017

Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Modeling and Managing Airport Passenger Flow Under Uncertainty: A Case of Fukuoka Airport in Japan.

[BibT_eX]

[DOI]

Proceedings of the Social Informatics, 2017

Tight Approximability of the Server Allocation Problem for Real-Time Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - Third International Workshop, 2017

2016

Extended formulations for sparsity matroids.

[BibT_eX]

[DOI]

Math. Program., 2016

A Matroid Approach to Stable Matchings with Lower Quotas.

[BibT_eX]

[DOI]

Tamás Fleiner

Math. Oper. Res., 2016

The popular matching and condensation problems under matroid constraints.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

2015

The nucleolus of arborescence games in directed acyclic graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

On packing arborescences in temporal networks.

[BibT_eX]

[DOI]

Yasushi Kawase

Inf. Process. Lett., 2015

Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

2014

An inductive construction of minimally rigid body-hinge simple graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

A New Approach to the Pareto Stable Matching Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2014

The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

A note on the serial dictatorship with project closures.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Independent arborescences in directed graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

On Total Unimodularity of Edge-Edge Adjacency Matrices.

[BibT_eX]

[DOI]

Yusuke Matsumoto

Keiko Imai

Algorithmica, 2013

2012

The root location problem for arc-disjoint arborescences.

[BibT_eX]

[DOI]

Satoru Fujishige

Discret. Appl. Math., 2012

2011

Covering directed graphs by in-trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem.

[BibT_eX]

[DOI]

Yusuke Matsumoto

Keiko Imai

Inf. Process. Lett., 2011

Improved Approximation Algorithms for Firefighter Problem on Trees.

[BibT_eX]

[DOI]

Yutaka Iwaikawa

Tomomi Matsui

IEICE Trans. Inf. Syst., 2011

Submodular Function Minimization under a Submodular Set Covering Constraint.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

Robustness of Minimum Cost Arborescences.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

On Totally Unimodularity of Edge-Edge Adjacency Matrices.

[BibT_eX]

[DOI]

Yusuke Matsumoto

Keiko Imai

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking.

[BibT_eX]

[DOI]

Tomomi Matsui

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

A Relation between the Protocol Partition Number and the Quasi-Additive Bound

[BibT_eX]

[DOI]

CoRR, 2010

The Prize-Collecting Edge Dominating Set Problem in Trees.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph.

[BibT_eX]

[DOI]

Kristóf Bérczi

Satoru Fujishige

Inf. Process. Lett., 2009

Computational Complexities of University Interview Timetabling.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Arc-disjoint in-trees in directed graphs.

[BibT_eX]

[DOI]

Comb., 2009

A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

The Minimum Weight In-Tree Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Modelling, 2008

2007

An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity.

[BibT_eX]

[DOI]