research
∙
07/09/2021
Constant Delay Lattice Train Schedules
The following geometric vehicle scheduling problem has been considered: ...
share
research
∙
09/20/2019
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63--74
In the paper "Linear time algorithm to cover and hit a set of line segme...
research
∙
09/13/2019
Linear Size Planar Manhattan Network for Convex Point Sets
Let G = (V, E) be an edge-weighted geometric graph such that every edge ...
research
∙
09/09/2019
Maximum Bipartite Subgraph of Geometric Intersection Graphs
We study the Maximum Bipartite Subgraph(MBS) problem, which is defined a...
research
∙
09/09/2019
Balanced Connected Subgraph Problem in Geometric Intersection Graphs
We study the Balanced Connected Subgraph(shortly, BCS) problem on geomet...
research
∙
09/24/2018
The Balanced Connected Subgraph Problem
The problem of computing induced subgraphs that satisfy some specified r...
research
∙
05/23/2018
Maximal and maximum transitive relation contained in a given binary relation
We study the problem of finding a maximal transitive relation contained ...
research
∙
09/14/2017
A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
This paper discusses the problem of covering and hitting a set of line s...
research
∙
09/17/2015