Ge Xia

activity

20112023

most citedThe Stretch Factor of the Delaunay Triangulation Is Less Than 1.998

73 citations · 80 across the 10 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2017★ 3 cited

The Complexity of Tree Partitioning

Zhao An, Qilong Feng, Iyad Kanj +1

Given a tree $T$ on $n$ vertices, and $k, b, s_{1}, \dots, s_{b} \in N$ , the Tree Partitioning problem asks if at most $k$ edges can be removed from $T$ so that the resulting componen…

cs.CC2011

What makes normalized weighted satisfiability tractable

Iyad Kanj, Ge Xia

We consider the weighted antimonotone and the weighted monotone satisfiability problems on normalized circuits of depth at most $t \geq 2$ , abbreviated {\sc wsat $^{-} [t]$ } and {\sc w…