A human observer can effortlessly identify visible portions of geometric objects present in the
environment. However, computations of visible portions of objects from a viewpoint involving …

We first consider the problem of partitioning the edges of a graph~ into bipartite cliques such
that the total order of the cliques is minimized, where the order of a clique is the number of …

Handbook of DISCRETE AND COMPUTATIONAL GEOMETRY Page 1 i “K25063” — 2017/9/15
— 18:58 — page 875 — i i i 33 VISIBILITY Joseph O’Rourke INTRODUCTION In a …

We describe a new algorithm for generating all maximal bicliques (ie complete bipartite, not
necessarily induced subgraphs) of a graph. The algorithm is inspired by, and is quite similar …

In graphs of bounded arboricity, the total complexity of all maximal complete bipartite
subgraphs is O (n). We described a linear time algorithm to list such subgraphs. The …

Unsolved problems in visibility graphs of points, segments, and polygons Page 1 22 Unsolved
Problems in Visibility Graphs of Points, Segments, and Polygons SUBIR K. GHOSH, Tata …

This paper describes a new algorithm for constructing the set of free bitangents of a
collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O …

To cover the edges of a graph with a minimum number of cliques is an NP-hard problem
with many applications. For this problem we develop efficient and effective polynomial-time …

We introduce two new related metrics, the geodesic width and the link width, for measuring
the “distance” between two nonintersecting polylines in the plane. If the two polylines have n …

We consider problems related to finding short cycles, small cliques, small independent sets,
and small subgraphs in geometric intersection graphs. We obtain a plethora of new results …