Geometric Graphs with No Self-intersecting Path of Length Three
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
European Journal of Combinatorics
Excluded permutation matrices and the Stanley-Wilf conjecture
Journal of Combinatorial Theory Series A
Geometric graphs with no self-intersecting path of length three
European Journal of Combinatorics - Special issue: Topological graph theory
Forbidden patterns and unit distances
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On 0-1 matrices and small excluded submatrices
Journal of Combinatorial Theory Series A
Hereditary properties of partitions, ordered graphs and ordered hypergraphs
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
Note: On linear forbidden submatrices
Journal of Combinatorial Theory Series A
On constants in the Füredi--Hajnal and the Stanley--Wilf conjecture
Journal of Combinatorial Theory Series A
Note: Extremal functions of forbidden double permutation matrices
Journal of Combinatorial Theory Series A
On nonlinear forbidden 0-1 matrices: a refutation of a Füredi-Hajnal conjecture
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
Journal of Combinatorial Theory Series A
On the structure and composition of forbidden sequences, with geometric applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
Origins of Nonlinearity in Davenport-Schinzel Sequences
SIAM Journal on Discrete Mathematics
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Journal of Combinatorial Theory Series A
Hi-index | 0.05 |