Naonori Kakimura | DeepAI

AI Chat

Featured Co-authors

Tianyi Chen
60 publications
Yuichi Yoshida
39 publications
Yusuke Kobayashi
36 publications
Ken-ichi Kawarabayashi
33 publications
Kristóf Bérczi
31 publications
Takehiro Ito
25 publications
Yasushi Kawase
22 publications
Yoshio Okamoto
18 publications
Charalampos E. Tsourakakis
18 publications
Naoyuki Kamiyama
16 publications
Hanna Sumita
14 publications

∙ 05/03/2023

Algorithmic Theory of Qubit Routing

The qubit routing problem, also known as the swap minimization problem, ...

0 Takehiro Ito, et al. ∙

∙ 04/28/2023

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra

We prove that the computation of a combinatorial shortest path between t...

0 Takehiro Ito, et al. ∙

∙ 10/21/2022

Rerouting Planar Curves and Disjoint Paths

In this paper, we consider a transformation of k disjoint paths in a gra...

0 Takehiro Ito, et al. ∙

∙ 09/21/2022

On Reachable Assignments under Dichotomous Preferences

We consider the problem of determining whether a target item assignment ...

0 Takehiro Ito, et al. ∙

∙ 07/06/2022

Reforming an Envy-Free Matching

We consider the problem of reforming an envy-free matching when each age...

0 Takehiro Ito, et al. ∙

∙ 03/15/2022

Online Task Assignment Problems with Reusable Resources

We study online task assignment problem with reusable resources, motivat...

0 Hanna Sumita, et al. ∙

∙ 10/22/2021

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

We initiate the study of k-edge-connected orientations of undirected gra...

0 Takehiro Ito, et al. ∙

∙ 10/20/2021

Dynamic Bipartite Matching Market with Arrivals and Departures

In this paper, we study a matching market model on a bipartite network w...

0 Naonori Kakimura, et al. ∙

∙ 01/20/2021

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions

The contextual combinatorial semi-bandit problem with linear payoff func...

4 Kei Takemura, et al. ∙

∙ 07/17/2020

Market Pricing for Matroid Rank Valuations

In this paper, we study the problem of maximizing social welfare in comb...

0 Kristóf Bérczi, et al. ∙

∙ 02/13/2020

Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model

Maximizing a monotone submodular function under various constraints is a...

0 Chien-Chung Huang, et al. ∙

∙ 11/20/2019

Online Spectral Approximation in Random Order Streams

This paper studies spectral approximation for a positive semidefinite ma...

0 Masataka Gohda, et al. ∙

∙ 07/03/2019

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles

Motivated by adjacency in perfect matching polytopes, we study the short...

0 Takehiro Ito, et al. ∙

∙ 06/14/2019

Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising

Computational advertising has been studied to design efficient marketing...

0 Daisuke Hatano, et al. ∙

∙ 04/17/2019

Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries

In the densest subgraph problem, given a weighted undirected graph G(V,E...

0 Charalampos E. Tsourakakis, et al. ∙

∙ 06/06/2018

Causal Bandits with Propagating Inference

Bandit is a framework for designing sequential experiments. In each expe...

0 Akihiro Yabe, et al. ∙

∙ 02/17/2018

Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization

We consider maximizing a monotone submodular function under a cardinalit...

0 Chien-Chung Huang, et al. ∙

∙ 02/07/2018

The b-branching problem in digraphs

In this paper, we introduce the concept of b-branchings in digraphs, whi...

0 Naonori Kakimura, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world