The following pages link to Martin Pergel (Q1671343):
Displaying 16 items.
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- On edge intersection graphs of paths with 2 bends (Q2357780) (← links)
- The Complexity of the Partial Order Dimension Problem: Closing the Gap (Q2957691) (← links)
- On Edge Intersection Graphs of Paths with 2 Bends (Q3181059) (← links)
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs (Q3402368) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- The Complexity of Sorting with Networks of Stacks and Queues (Q3541104) (← links)
- Geometric Intersection Graphs: Do Short Cycles Help? (Q3608838) (← links)
- Beyond Homothetic Polygons: Recognition and Maximum Clique (Q4909578) (← links)
- Graph Drawing (Q5193167) (← links)
- Intersection graphs of homothetic polygons (Q5301023) (← links)
- Clustered Planarity: Small Clusters in Eulerian Graphs (Q5452233) (← links)
- On flips in planar matchings (Q5918594) (← links)
- On flips in planar matchings (Q5919054) (← links)
- Unit Grid Intersection Graphs: Recognition and Properties (Q6242527) (← links)
- Recognising the overlap graphs of subtrees of restricted trees is hard (Q6390050) (← links)