We consider simplified versions of 3-Sat, the variant of the famous Satisfiability Problem
where each clause is made up of exactly three distinct literals formed over pairwise distinct …

We consider subexponential algorithms finding weighted homomorphisms from intersection
graphs of curves (string graphs) with n vertices to a fixed graph H. We provide a complete …

We consider a simplified version of Not-All-Equal 3-Sat, a variation of the famous
Satisfiability problem, where each clause is made up of exactly three distinct literals and the …

One of the most important questions in matroid optimization is to find disjoint common bases
of two matroids. The significance of the problem is well-illustrated by the long list of …

For an edge-colored graph G, a set F of edges of G is called a proper edge-cut if F is an
edge-cut of G and any pair of adjacent edges in F are assigned by different colors. An edge …

The concept of rainbow disconnection number of graphs was introduced by Chartrand et
al.(2018). Inspired by this concept, we put forward the concepts of rainbow vertex …

V této práci se zabýváme následujícím modelem šíření názoru v sociální síti. Na začátku
někteří jedinci přijmou jistý názor (například tak, že jsou uplaceni). Poté se názor v síti šíří v …

The complexity of variants of 3-SAT and Not-All-Equal 3-SAT is well studied. However, in
contrast, very little is known about the complexity of the problems' quantified counterparts. In …

We show that Monotone 3-Sat remains NP-complete if (i) each clause contains exactly three
distinct variables,(ii) each clause is unique, ie, there are no duplicates of the same clause …

Computational Complexity theory (NP) is a branch of the Theory of Computation,
mathematics, and computer science that deals with the difficulty of solving problems …