Martin Pergel

Available identifiers

Publication	Date of Publication	Type
Recognising the overlap graphs of subtrees of restricted trees is hard	2024-10-18	Paper
On unit grid intersection graphs and several other intersection graph classes	2024-10-18	Paper
On flips in planar matchings	2022-12-21	Paper
Recognising the overlap graphs of subtrees of restricted trees is hard	2021-12-22	Paper
On flips in planar matchings	2020-12-29	Paper
Homothetic polygons and beyond: maximal cliques in intersection graphs	2018-09-06	Paper
On edge intersection graphs of paths with 2 bends	2017-06-14	Paper
The complexity of the partial order dimension problem: closing the gap	2017-01-27	Paper
On edge intersection graphs of paths with 2 bends	2016-12-22	Paper
Intersection graphs of homothetic polygons	2013-06-28	Paper
Unit Grid Intersection Graphs: Recognition and Properties	2013-06-07	Paper
Beyond homothetic polygons: recognition and maximum clique	2013-03-21	Paper
Clustered planarity: small clusters in cycles and Eulerian graphs	2010-02-04	Paper
Graph Drawing	2009-08-11	Paper
Geometric Intersection Graphs: Do Short Cycles Help?	2009-03-06	Paper
The Complexity of Sorting with Networks of Stacks and Queues	2008-11-25	Paper
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete	2008-07-01	Paper
Clustered Planarity: Small Clusters in Eulerian Graphs	2008-03-25	Paper

This page was built for person: Martin Pergel