Martin Pergel

According to our database, Martin Pergel authored at least 19 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Recognising the overlap graphs of subtrees of restricted trees is hard.

Jessica A. Enright, Martin Pergel

CoRR, 2022

What Makes the Recognition Problem Hard for Classes Related to Segment and String graphs?

Irina Mustata, Martin Pergel

CoRR, 2022

2021

On flips in planar matchings.

Marcel Milich, Torsten Mütze, Martin Pergel

Discret. Appl. Math., 2021

2018

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

2017

The Complexity of the Partial Order Dimension Problem: Closing the Gap.

Stefan Felsner, Irina Mustata, Martin Pergel

SIAM J. Discret. Math., 2017

On edge intersection graphs of paths with 2 bends.

Martin Pergel, Pawel Rzazewski

Discret. Appl. Math., 2017

2015

A Note on Graphs with 2 Bends.

Martin Pergel

CoRR, 2015

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

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

2013

Unit Grid Intersection Graphs: Recognition and Properties.

Irina Mustata, Martin Pergel

CoRR, 2013

2012

Beyond Homothetic Polygons: Recognition and Maximum Clique.

Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Towards a Brewery Educational Game: Would Existence of a Game Goal Improve Learning?

Cyril Brom, Edita Bromová, Martin Pergel

Proceedings of the Entertainment Computing - ICEC 2012 - 11th International Conference, 2012

2009

Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.

Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil

J. Graph Algorithms Appl., 2009

2008

Intersection graphs of homothetic polygons.

Jan Kratochvíl, Martin Pergel

Electron. Notes Discret. Math., 2008

The Complexity of Sorting with Networks of Stacks and Queues.

Stefan Felsner, Martin Pergel

Proceedings of the Algorithms, 2008

2007

Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete.

Martin Pergel

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Clustered Planarity: Small Clusters in Eulerian Graphs.

Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Geometric Intersection Graphs: Do Short Cycles Help?

Jan Kratochvíl, Martin Pergel

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2003

Two Results on Intersection Graphs of Polygons.

Jan Kratochvíl, Martin Pergel

Proceedings of the Graph Drawing, 11th International Symposium, 2003