| |
| 2008 | ||
|---|---|---|
| 6 | EE | Stefan Felsner, Martin Pergel: The Complexity of Sorting with Networks of Stacks and Queues. ESA 2008: 417-429 |
| 5 | EE | Jan Kratochvíl, Martin Pergel: Intersection graphs of homothetic polygons. Electronic Notes in Discrete Mathematics 31: 277-280 (2008) |
| 2007 | ||
| 4 | EE | Jan Kratochvíl, Martin Pergel: Geometric Intersection Graphs: Do Short Cycles Help? COCOON 2007: 118-128 |
| 3 | EE | Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil: Clustered Planarity: Small Clusters in Eulerian Graphs. Graph Drawing 2007: 303-314 |
| 2 | EE | Martin Pergel: Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. WG 2007: 238-247 |
| 2003 | ||
| 1 | EE | Jan Kratochvíl, Martin Pergel: Two Results on Intersection Graphs of Polygons. Graph Drawing 2003: 59-70 |
| 1 | Stefan Felsner | [6] |
| 2 | Eva Jelínková | [3] |
| 3 | Jan Kára | [3] |
| 4 | Jan Kratochvíl | [1] [3] [4] [5] |
| 5 | Ondrej Suchý | [3] |
| 6 | Tomás Vyskocil | [3] |