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

We show NP-completeness for several planar variants of the monotonesatisfiability problem with bounded variable appearances. With one exceptionthe presented variants have an associated bipartite graph where the vertexdegree is bounded by at most four. Hence, a planar and orthogonal drawing forthese graphs can be computed efficiently, which may turn out to be useful inreductions using these variants as a starting point for proving some decisionproblem to be NP-hard.

On planar variants of the monotone satisfiability problem with bounded variable appearances