Crossing patterns of semi-algebraic sets
Journal of Combinatorial Theory Series A
Note: On the obfuscation complexity of planar graphs
Theoretical Computer Science
Every planar graph is the intersection graph of segments in the plane: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
A bipartite strengthening of the Crossing Lemma
Journal of Combinatorial Theory Series B
A bipartite strengthening of the crossing lemma
GD'07 Proceedings of the 15th international conference on Graph drawing
Density theorems for intersection graphs of t-monotone curves
GD'12 Proceedings of the 20th international conference on Graph Drawing
Hi-index | 0.00 |