research
∙
08/09/2023
Approximation algorithm for finding multipacking on Cactus
For a graph G = (V, E) with vertex set V and edge set E, a function f : ...
share
research
∙
08/05/2023
Burning a binary tree and its generalization
Graph burning is a graph process that models the spread of social contag...
research
∙
06/13/2023
An update on (n,m)-chromatic numbers
An (n,m)-graph is a graph with n types of arcs and m types of edges. A h...
research
∙
04/03/2023
Counting the minimum number of arcs in an oriented graph having weak diameter 2
An oriented graph has weak diameter at most d if every non-adjacent pair...
research
∙
03/30/2023
A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs
The weighted k-center problem in graphs is a classical facility location...
research
∙
03/11/2023
Two-tier PON virtualisation with scheduler synchronization supporting application-level ultra-low latency in MEC based Cloud-RAN, using MESH-PON
Ultra-low end-to-end latency is one of the most important requirements i...
research
∙
12/08/2022
Triangle-free projective-planar graphs with diameter two: domination and characterization
In 1975, Plesník characterized all triangle-free planar graphs as having...
research
∙
08/23/2022
Schedulers Synchronization Supporting Ultra Reliable Low Latency Communications (URLLC) in Cloud-RAN over Virtualised Mesh PON
We propose a mechanism to support URLLC Open-RAN ultra-low latency over ...
research
∙
03/22/2022
Optimal Slicing of Virtualised Passive Optical Networks to Support Dense Deployment of Cloud-RAN and Multi-Access Edge Computing
The commercialization of Cloud-RAN, and Open-RAN in particular, is a key...
research
∙
02/24/2022
Complexity Results on Untangling Red-Blue Matchings
Given a matching between n red points and n blue points by line segments...
research
∙
07/28/2021
On fractional version of oriented coloring
We introduce the fractional version of oriented coloring and initiate it...
research
∙
06/01/2021
Optimal virtual PON slicing to support ultra-low latency mesh traffic pattern in MEC-based Cloud-RAN
As progressive densification of cells, deployment of Cloud-RAN and MEC a...
research
∙
04/23/2021
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
A terrain is an x-monotone polygon whose lower boundary is a single line...
research
∙
04/15/2021
On clique numbers of colored mixed graphs
An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph havin...
research
∙
09/25/2020
On the signed chromatic number of some classes of graphs
A signed graph (G, σ) is a graph G along with a function σ: E(G) →{+,-}....
research
∙
06/30/2020
Algorithms and complexity for geodetic sets on planar and chordal graphs
We study the complexity of finding the geodetic number on subclasses of ...
research
∙
04/13/2020
PON Virtualisation with EAST-WEST Communications for Low-Latency Converged Multi-Access Edge Computing (MEC)
We propose a virtual-PON based Mobile Fronthaul (MFH) architecture that ...
research
∙
11/22/2019
Pushable chromatic number of graphs with degree constraints
Pushable homomorphisms and the pushable chromatic number χ_p of oriented...
research
∙
11/14/2018
Computing the Minkowski Sum of Convex Polytopes in ^d
We propose a method to efficiently compute the Minkowski sum, denoted by...
research
∙
10/12/2018
On relative clique number of colored mixed graphs
An (m, n)-colored mixed graph is a graph having arcs of m different colo...
research
∙
09/26/2018
Approximating Minimum Dominating Set on String Graphs
In this paper, we give approximation algorithms for the Minimum Dominati...
research
∙
04/18/2018
On bounds on bend number of split and cocomparability graphs
A path is a simple, piecewise linear curve made up of alternating horizo...
research
∙
04/18/2018