4 citations · 9 across the 4 of their papers we have counts for
5 papers
An in-place, subquadratic algorithm for permutation inversion
Grzegorz Guśpiel
We assume the permutation is given by an -element array in which the -th element denotes the value . Constructing its inverse in-place (i.e. using bits…
Complexity of Finding Perfect Bipartite Matchings Minimizing the Number of Intersecting Edges
Grzegorz Guśpiel
Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines fo…
On an extremal problem for poset dimension
Grzegorz Guśpiel, Piotr Micek, Adam Polak
Let be the largest integer such that every poset on elements has a -dimensional subposet on elements. What is the asymptotics of ? It is easy to see that…
The Partial Visibility Representation Extension Problem
Steven Chaplick, Grzegorz Guśpiel, Grzegorz Gutowski +2
For a graph , a function is called a \emph{bar visibility representation} of when for each vertex , is a horizontal line segment (\emph{bar}) and $uv…
Universal targets for homomorphisms of edge-colored graphs
Grzegorz Guśpiel, Grzegorz Gutowski
A -edge-colored graph is a finite, simple graph with edges labeled by numbers . A function from the vertex set of one -edge-colored graph to another is a homomorp…