A graph is O k-free if it does not contain k pairwise vertex-disjoint and non-adjacent cycles.
We prove that “sparse”(here, not containing large complete bipartite graphs as subgraphs) O …

A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three
decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit …

A disk graph is an intersection graph of disks in the Euclidean plane, where the disks
correspond to the vertices of the graph and a pair of vertices are adjacent if and only if their …

We propose a polynomial-time algorithm which takes as input a finite set of points of R^ 3
and computes, up to arbitrary precision, a maximum subset with diameter at most 1. More …

We study the complexity of Maximum Clique in intersection graphs of convex objects in the
plane. On the algorithmic side, we extend the polynomial-time algorithm for unit disks …

This thesis deals with graphs having geometric representations. On one hand we consider
graphs whose vertices can be mapped to geometric objets in an Euclidean space (for …

The induced odd cycle packing number iocp (G) iocp(G) of a graph GG is the maximum
integer kk such that GG contains an induced subgraph consisting of kk pairwise vertex …

In this paper we consider the Maximum Independent Set problem (MIS) on B 1-EPG graphs,
that is the one-bend (B 1) Edge intersection graphs of Paths on a Grid (EPG graphs). The …

We study the structure and the maximum number of maximal cliques in classes of
intersection graphs of convex sets in the plane. It is known that convex-set intersection …

Demonstrated Spectral Efficiency (SE) gain by In Band Full Duplex (IBFD) makes it an
attractive radio technology. Owing to inherent complexities in IBFD, Hybrid IBFD Cellular …