Hüseyin Acan

Publication Activity (10 Years)

Years Active: 2006-2022
Publications (10 Years): 17

Top Topics

Connected Components

Graph Theoretic

Top Venues

J. Appl. Probab.

J. Comb. Theory, Ser. A

Publications

Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct navigational oracles for families of intersection graphs on a circle. Theor. Comput. Sci. 928 (2022)
Hüseyin Acan, Alan M. Frieze, Boris G. Pittel
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. J. Appl. Probab. 59 (2) (2022)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct representations of Intersection Graphs on a Circle. DCC (2021)
Hüseyin Acan, Charles F. Burnette, Sean Eberhard, Eric Schmutz, James Thomas
Permutations with equal orders. Comb. Probab. Comput. 30 (5) (2021)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Succinct Encodings for Families of Interval Graphs. Algorithmica 83 (3) (2021)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle. CoRR (2020)
Hüseyin Acan, Boris G. Pittel
On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph. Random Struct. Algorithms 56 (1) (2020)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Succinct Data Structures for Families of Interval Graphs. CoRR (2019)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Succinct Data Structures for Families of Interval Graphs. WADS (2019)
Hüseyin Acan, Jeff Kahn
Disproof of a packing conjecture of Alon and Spencer. Random Struct. Algorithms 55 (3) (2019)
Hüseyin Acan, Pat Devlin, Jeff Kahn
Proof of an entropy conjecture of Leighton and Moitra. J. Comb. Theory, Ser. A 161 (2019)
Hüseyin Acan, Boris G. Pittel
Formation of a giant component in the intersection graph of a random chord diagram. J. Comb. Theory, Ser. B 125 (2017)
Hüseyin Acan
On a uniformly random chord diagram and its intersection graph. Discret. Math. 340 (8) (2017)
Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
On the Push&Pull Protocol for Rumor Spreading. SIAM J. Discret. Math. 31 (2) (2017)
Hüseyin Acan, Pawel Hitczenko
On random trees obtained from permutation graphs. Discret. Math. 339 (12) (2016)
Hüseyin Acan, Pawel Hitczenko
On the covariances of outdegrees in random plane recursive trees. J. Appl. Probab. 52 (3) (2015)
Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]. PODC (2015)
Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
On the push&pull protocol for rumour spreading. CoRR (2014)
Hüseyin Acan, Boris G. Pittel
On the connected components of a random permutation graph with a given number of edges. J. Comb. Theory, Ser. A 120 (8) (2013)
Hüseyin Acan, Kamer Kaya, Ali Aydin Selçuk
Capture Resilient ElGamal Signature Protocols. ISCIS (2006)