The following pages link to Hüseyin Acan (Q388719):
Displaying 15 items.
- On the connected components of a random permutation graph with a given number of edges (Q388720) (← links)
- On random trees obtained from permutation graphs (Q738839) (← links)
- Proof of an entropy conjecture of Leighton and Moitra (Q1621423) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Succinct data structures for families of interval graphs (Q2285077) (← links)
- Formation of a giant component in the intersection graph of a random chord diagram (Q2396892) (← links)
- On a uniformly random chord diagram and its intersection graph (Q2397541) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- On the Push&Pull Protocol for Rumour Spreading (Q2796277) (← links)
- On the covariances of outdegrees in random plane recursive trees (Q3449942) (← links)
- Disproof of a packing conjecture of Alon and Spencer (Q4973635) (← links)
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs (Q5086992) (← links)
- On connectivity, conductance and bootstrap percolation for a random <i>k</i>‐out, age‐biased graph (Q5113931) (← links)
- On the Push&Pull Protocol for Rumor Spreading (Q5346546) (← links)
- On a memory game and preferential attachment graphs (Q5740704) (← links)
