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

A directed graph $G$ is called a pumpkin if $G$ is a union of induced pathswith a common start vertex $s$ and a common end vertex $t$, and the internalvertices of every two paths are disjoint. We give an algorithm that given adirected graph $G$ and an integer $k$, decides whether a pumpkin can beobtained from $G$ by deleting at most $k$ vertices. The algorithm runs in$O^*(2^k)$ time.

Faster parameterized algorithm for pumpkin vertex deletion set