
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
We study the generalized minimum Manhattan network (GMMN) problem: given...
read it

List colouring of two matroids through reduction to partition matroids
In the list colouring problem for two matroids, we are given matroids M_...
read it

Multiple KnapsackConstrained Monotone DRSubmodular Maximization on Distributive Lattice  Continuous Greedy Algorithm on Median Complex 
We consider a problem of maximizing a monotone DRsubmodular function un...
read it

Stochastic Monotone Submodular Maximization with Queries
We study a stochastic variant of monotone submodular maximization proble...
read it

A Strongly Polynomial Algorithm for Finding a Shortest Nonzero Path in GroupLabeled Graphs
Finding a shortest path or cycle in graphs is a fundamental problem. In ...
read it

A DijkstraBased Efficient Algorithm for Finding a Shortest Nonzero Path in GroupLabeled Graphs
The parity constrained shortest path problem is a wellknown variant tha...
read it

Tight Approximation for Unconstrained XOS Maximization
A set function is called XOS if it can be represented by the maximum of ...
read it

Finding a Path in GroupLabeled Graphs with Two Labels Forbidden
The parity of the length of paths and cycles is a classical and wellstu...
read it

Subgame Perfect Equilibria of Sequential Matching Games
We study a decentralized matching market in which firms sequentially mak...
read it

Computing a Subgame Perfect Equilibrium of a Sequential Matching Game
We study a decentralized matching market in which each firm sequentially...
read it
Yutaro Yamaguchi
is this you? claim profile