Yoshio Okamoto | DeepAI

DeepAI AI Chat

Featured Co-authors

Martin Nöllenburg
51 publications
Karl Bringmann
49 publications
Yusuke Kobayashi
36 publications
Michael Kaufmann
34 publications
Alexander Wolff
33 publications
Yota Otachi
32 publications
Yasuaki Kobayashi
32 publications
Matias Korman
29 publications
Hans L. Bodlaender
29 publications
Tesshu Hanaka
28 publications
Birgit Vogtenhuber
28 publications

∙ 07/15/2023

Minimum Separator Reconfiguration

We study the problem of reconfiguring one minimum s-t-separator A into a...

0 Guilherme C. M. Gomes, et al. ∙

∙ 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/31/2022

Reconfiguration of colorings in triangulations of the sphere

In 1973, Fisk proved that any 4-coloring of a 3-colorable triangulation ...

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. ∙

∙ 08/04/2022

Core Challenge 2022: Solver and Graph Descriptions

This paper collects all descriptions of solvers and ISR instances submit...

0 Takehide Soh, 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. ∙

∙ 05/16/2022

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds

We consider the unlabeled motion-planning problem of m unit-disc robots ...

0 Bahareh Banyassady, 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. ∙

∙ 09/20/2019

Linear-Time Recognition of Double-Threshold Graphs

A graph G = (V,E) is a double-threshold graph if there exist a vertex-we...

0 Yusuke Kobayashi, et al. ∙

∙ 08/23/2019

Variants of the Segment Number of a Graph

The segment number of a planar graph is the smallest number of line segm...

0 Yoshio Okamoto, et al. ∙

∙ 08/18/2019

Graphs with large total angular resolution

The total angular resolution of a straight-line drawing is the minimum a...

0 Oswin Aichholzer, 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. ∙

∙ 05/25/2019

Subgraph Isomorphism on Graph Classes that Exclude a Substructure

We study Subgraph Isomorphism on graph classes defined by a fixed forbid...

0 Hans L. Bodlaender, et al. ∙

∙ 08/30/2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity

While orthogonal drawings have a long history, smooth orthogonal drawing...

0 Evmorfia Argyriou, et al. ∙

∙ 12/15/2017

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain

We study the computation of the diameter and radius under the rectilinea...

0 Man-Kwun Chiu, et al. ∙

∙ 09/08/2017

Balanced Line Separators of Unit Disk Graphs

We prove a geometric version of the graph separator theorem for the unit...

0 Paz Carmi, et al. ∙

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