Two Results on Intersection Graphs of Polygons. - Jan Kratochvíl; Martin Pergel (GD, 2003)

Geometric Intersection Graphs: Do Short Cycles Help? - Jan Kratochvíl; Martin Pergel (COCOON, 2007)

Clustered Planarity: Small Clusters in Eulerian Graphs. - Eva Jelínková; Jan Kára; Jan Kratochvíl; Martin Pergel; Ondrej Suchý 001; Tomás Vyskocil (GD, 2007)

Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. - Martin Pergel (WG, 2007)

The Complexity of Sorting with Networks of Stacks and Queues. - Stefan Felsner; Martin Pergel (ESA, 2008)

Intersection graphs of homothetic polygons. - Jan Kratochvíl; Martin Pergel (Electron. Notes Discret. Math., 2008)

Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. - Eva Jelínková; Jan Kára; Jan Kratochvíl; Martin Pergel; Ondrej Suchý 001; Tomás Vyskocil (J. Graph Algorithms Appl., 2009)

Towards a Brewery Educational Game: Would Existence of a Game Goal Improve Learning? - Cyril Brom; Edita Bromová; Martin Pergel (ICEC, 2012)

Beyond Homothetic Polygons: Recognition and Maximum Clique. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski (ISAAC, 2012)

Unit Grid Intersection Graphs: Recognition and Properties. - Irina Mustata; Martin Pergel (CoRR, 2013)

Personalized messages in a brewery educational simulation: Is the personalization principle less robust than previously thought? - Cyril Brom; Edita Bromová; Filip Dechterenko; Michaela Buchtová; Martin Pergel (Comput. Educ., 2014)

Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. - Valentin E. Brimkov; Konstanty Junosza-Szaniawski; Sean Kafer; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski; Matthew Szczepankiewicz; Joshua Terhaar (CoRR, 2014)

A Note on Graphs with 2 Bends. - Martin Pergel (CoRR, 2015)

On edge intersection graphs of paths with 2 bends. - Martin Pergel; Pawel Rzazewski (Discret. Appl. Math., 2017)

The Complexity of the Partial Order Dimension Problem: Closing the Gap. - Stefan Felsner; Irina Mustata; Martin Pergel (SIAM J. Discret. Math., 2017)

Homothetic polygons and beyond: Maximal cliques in intersection graphs. - Valentin E. Brimkov; Konstanty Junosza-Szaniawski; Sean Kafer; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski; Matthew Szczepankiewicz; Joshua Terhaar (Discret. Appl. Math., 2018)

On flips in planar matchings. - Marcel Milich; Torsten Mütze; Martin Pergel (Discret. Appl. Math., 2021)

What Makes the Recognition Problem Hard for Classes Related to Segment and String graphs? - Irina Mustata; Martin Pergel (CoRR, 2022)

Recognising the overlap graphs of subtrees of restricted trees is hard. - Jessica A. Enright; Martin Pergel (CoRR, 2022)