• Publications
  • Influence
The disjoint paths problem in quadratic time
TLDR
We consider the following well-known problem, which is called the disjoint paths problem. Expand
  • 144
  • 9
  • PDF
Fence patrolling by mobile agents with distinct speeds
TLDR
A preliminary version of this paper was presented at the 23rd International Symposium on Algorithms and Computation [10]. Expand
  • 51
  • 7
  • PDF
A weighted linear matroid parity algorithm
TLDR
In this paper, we present a combinatorial, deterministic, strongly polynomial algorithm for the weighted linear matroid parity problem. Expand
  • 18
  • 5
  • PDF
On Shortest Disjoint Paths in Planar Graphs
TLDR
We extend recent results by Colin de Verdiere and Schrijver to prove that, for a planar graph and for terminals adjacent to at most two faces, the Min-Sum 2 Disjoint Paths Problem can be solved in polynomial time. Expand
  • 35
  • 4
  • PDF
The Directed Disjoint Shortest Paths Problem
TLDR
We solve this problem affirmatively, that is, we give a first polynomial time algorithm for the directed version of 2-DSPP when the length of each edge is positive. Expand
  • 9
  • 4
  • PDF
Covering Intersecting Bi-set Families under Matroid Constraints
TLDR
We use a modification of Lovasz's method to prove a theorem on covering intersecting bi-set families under matroid constraints. Expand
  • 14
  • 4
  • PDF
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid
TLDR
A key theorem in algorithmic graph-minor theory is a min-max relation between the treewidth of a graph and its largest grid minor for some constant c_H . Expand
  • 47
  • 3
  • PDF
The Induced Disjoint Paths Problem
TLDR
We introduce a new problem which we call the induced disjoint paths problem. Expand
  • 22
  • 2
Tight Approximability of the Server Allocation Problem for Real-Time Applications
TLDR
The server allocation problem is a facility location problem for a distributed processing scheme on a real-time network. Expand
  • 6
  • 2
NP-hardness and fixed-parameter tractability of the minimum spanner problem
  • Y. Kobayashi
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 25 October 2018
TLDR
We show the NP-hardness of Minimum t -Spanner Problem in planar graphs for t ∈ { 2 , 3 , 4 } . Expand
  • 2
  • 2