English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In the Cluster Vertex Deletion problem the input is a graph $G$ and aninteger $k$. The goal is to decide whether there is a set of vertices $S$ ofsize at most $k$ such that the deletion of the vertices of $S$ from $G$ resultsa graph in which every connected component is a clique. We give an algorithmfor Cluster Vertex Deletion whose running time is $O^*(1.811^k)$.

Faster parameterized algorithm for Cluster Vertex Deletion