Complexity of Finding Perfect Bipartite Matchings Minimizing the Number of Intersecting Edges. - Grzegorz Guspiel (CoRR, 2017)

Universal targets for homomorphisms of edge-colored graphs. - Grzegorz Guspiel; Grzegorz Gutowski (J. Comb. Theory B, 2017)

The Partial Visibility Representation Extension Problem. - Steven Chaplick; Grzegorz Guspiel; Grzegorz Gutowski; Tomasz Krawczyk; Giuseppe Liotta (Algorithmica, 2018)

On an Extremal Problem for Poset Dimension. - Grzegorz Guspiel; Piotr Micek; Adam Polak 001 (Order, 2018)

Connecting the Dots (with Minimum Crossings). - Akanksha Agrawal 001; Grzegorz Guspiel; Jayakrishnan Madathil; Saket Saurabh 001; Meirav Zehavi (SoCG, 2019)

An in-place, subquadratic algorithm for permutation inversion. - Grzegorz Guspiel (CoRR, 2019)

Smaller universal targets for homomorphisms of edge-colored graphs. - Grzegorz Guspiel (J. Comb. Optim., 2022)

Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. - Benjamin Bergougnoux; Jakub Gajarský; Grzegorz Guspiel; Petr Hlinený; Filip Pokrývka; Marek Sokolowski 001 (ISAAC, 2023)