13 citations · 77 across the 56 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CC2018
Subexponential algorithms for variants of homomorphism problem in string graphs
Karolina Okrasa, Paweł Rzążewski
We consider the complexity of finding weighted homomorphisms from intersection graphs of curves (string graphs) with vertices to a fixed graph . We provide a complete dichot…
cs.DM2018
Intersecting edge distinguishing colorings of hypergraphs
Karolina Okrasa, Paweł Rzążewski
An edge labeling of a graph distinguishes neighbors by sets (multisets, resp.), if for any two adjacent vertices and the sets (multisets, resp.) of labels appearing on edge…
cs.DS2018★ 4 cited
Finding small-width connected path decompositions in polynomial time
Dariusz Dereniowski, Dorota Osula, Paweł Rzążewski
A connected path decomposition of a simple graph is a path decomposition such that the subgraph of induced by is connected for ea…