Hüseyin Acan

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