Martin Pergel

24 papers A 4B 4C 1Misc 1Journal 14
YearRankTypeTitle / Venue / Authors
2025 A conf
The Bend Number of Cocomparability Graphs.
GD
Todor Antic, Vít Jelínek, Martin Pergel, Felix Schröder, Peter Stumpf, Pavel Valtr
2022 J jnl
Recognising the overlap graphs of subtrees of restricted trees is hard.
CoRR
Jessica A. Enright, Martin Pergel
2022 J jnl
What Makes the Recognition Problem Hard for Classes Related to Segment and String graphs?
CoRR
Irina Mustata, Martin Pergel
2021 J jnl
On flips in planar matchings.
Discret. Appl. Math.
Marcel Milich, Torsten Mütze, Martin Pergel
2020 B conf
On Flips in Planar Matchings.
WG
Marcel Milich, Torsten Mütze, Martin Pergel
2020 J jnl
On flips in planar matchings.
CoRR
Marcel Milich, Torsten Mütze, Martin Pergel
2018 J jnl
Homothetic polygons and beyond: Maximal cliques in intersection graphs.
Discret. Appl. Math.
Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar
2017 J jnl
On edge intersection graphs of paths with 2 bends.
CoRR
Martin Pergel, Pawel Rzazewski
2017 J jnl
On edge intersection graphs of paths with 2 bends.
Discret. Appl. Math.
Martin Pergel, Pawel Rzazewski
2017 J jnl
The Complexity of the Partial Order Dimension Problem: Closing the Gap.
SIAM J. Discret. Math.
Stefan Felsner, Irina Mustata, Martin Pergel
2016 B conf
On Edge Intersection Graphs of Paths with 2 Bends.
WG
Martin Pergel, Pawel Rzazewski
2015 J jnl
A Note on Graphs with 2 Bends.
CoRR
Martin Pergel
2014 J jnl
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique.
CoRR
Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar
2014 J jnl
Personalized messages in a brewery educational simulation: Is the personalization principle less robust than previously thought?
Comput. Educ.
Cyril Brom, Edita Bromová, Filip Dechterenko, Michaela Buchtová, Martin Pergel
2013 J jnl
Unit Grid Intersection Graphs: Recognition and Properties.
CoRR
Irina Mustata, Martin Pergel
2012 B conf
Beyond Homothetic Polygons: Recognition and Maximum Clique.
ISAAC
Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski
2012 C conf
Towards a Brewery Educational Game: Would Existence of a Game Goal Improve Learning?
ICEC
Cyril Brom, Edita Bromová, Martin Pergel
2009 J jnl
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.
J. Graph Algorithms Appl.
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil
2008 J jnl
Intersection graphs of homothetic polygons.
Electron. Notes Discret. Math.
Jan Kratochvíl, Martin Pergel
2008 A conf
The Complexity of Sorting with Networks of Stacks and Queues.
ESA
Stefan Felsner, Martin Pergel
2007 A conf
Clustered Planarity: Small Clusters in Eulerian Graphs.
GD
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil
2007 Misc conf
Geometric Intersection Graphs: Do Short Cycles Help?
COCOON
Jan Kratochvíl, Martin Pergel
2007 B conf
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete.
WG
Martin Pergel
2003 A conf
Two Results on Intersection Graphs of Polygons.
GD
Jan Kratochvíl, Martin Pergel