A common extension of the Erdös--Stone theorem and the Alon--Yuster theorem for unbounded graphs
European Journal of Combinatorics
Almost-spanning subgraphs with bounded degree in dense graphs
European Journal of Combinatorics
Discrete Mathematics
Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Minors in graphs of large girth
Random Structures & Algorithms
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
On finding common neighborhoods in massive graphs
Theoretical Computer Science
On the number of Hamiltonian cycles in Dirac graphs
Discrete Mathematics
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
Combinatorics, Probability and Computing
Local Density in Graphs with Forbidden Subgraphs
Combinatorics, Probability and Computing
The Minimum Size of Saturated Hypergraphs
Combinatorics, Probability and Computing
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
European Journal of Combinatorics
Combinatorics, Probability and Computing
Matroid representation of clique complexes
Discrete Applied Mathematics
Hi-index | 0.01 |