A face in a curve arrangement is called popular if it is bounded by the ...
What is the maximum number of intersections of the boundaries of a simpl...
In this work, we study the d-Hitting Set and Feedback Vertex Set problem...
We present a linear-time algorithm for finding the quadrilateral of larg...
We present a simple linear-time algorithm for finding the quadrilateral ...
A tree with n vertices has at most 95^n/13 minimal dominating sets. The
...
We study the following separation problem: Given a collection of colored...
Our goal is to compare two planar point sets by finding subsets of a giv...
A bipartite graph G=(U,V,E) is convex if the vertices in V can be
linear...
We introduce and study the problem Ordered Level Planarity which asks fo...