Triangle-Freeness is Hard to Detect
Combinatorics, Probability and Computing
Forbidden subgraphs in connected graphs
Theoretical Computer Science
Cleaning a network with brushes
Theoretical Computer Science
Analysis of DAMA performance for tactical radio and satellite
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges
SIAM Journal on Discrete Mathematics
| Hi-index | 0.01 |