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/

Global: Zendy Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In the Red-Blue Dominating Set problem, we are given a bipartite graph $G =(V_B \cup V_R,E)$ and an integer $k$, and asked whether $G$ has a subset $D\subseteq V_B$ of at most $k$ "blue" vertices such that each "red" vertex from$V_R$ is adjacent to a vertex in $D$. We provide the first explicit linearkernel for this problem on planar graphs, of size at most $43k$.

A Linear Kernel for Planar Red-Blue Dominating Set