Pursuing a Superfast Robber in an Interval Graph - Abbas Mehrabian (CoRR, 2010)

Zero-Sum Flows in Regular Graphs. - Saieed Akbari; Akbar Daemi; Omid Hatami; Adel Javanmard; Abbas Mehrabian (Graphs Comb., 2010)

A Randomly Embedded Random Graph is Not a Spanner. - Abbas Mehrabian (CCCG, 2011)

On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game. - Noga Alon; Abbas Mehrabian (Electron. J. Comb., 2011)

Lower Bounds for the Cop Number when the Robber is Fast. - Abbas Mehrabian (Comb. Probab. Comput., 2011)

The capture time of grids. - Abbas Mehrabian (Discret. Math., 2011)

On a DAG Partitioning Problem. - Soroush Alamdari; Abbas Mehrabian (WAW, 2012)

On the Density of Nearly Regular Graphs with a Good Edge-Labeling. - Abbas Mehrabian (SIAM J. Discret. Math., 2012)

On the Stretch Factor of Randomly Embedded Random Graphs. - Abbas Mehrabian; Nick Wormald (Discret. Comput. Geom., 2013)

On the Longest Paths and the Diameter in Random Apollonian Networks. - Ehsan Ebrahimzadeh; Linda Farczadi; Pu Gao; Abbas Mehrabian; Cristiane M. Sato; Nick Wormald; Jonathan Zung (Electron. Notes Discret. Math., 2013)

On the Maximum Density of Graphs with Unique-Path Labelings. - Abbas Mehrabian; Dieter Mitsche; Pawel Pralat (SIAM J. Discret. Math., 2013)

On the push&pull protocol for rumour spreading. - Hüseyin Acan; Andrea Collevecchio; Abbas Mehrabian; Nick Wormald (CoRR, 2014)

On longest paths and diameter in random apollonian network. - Ehsan Ebrahimzadeh; Linda Farczadi; Pu Gao; Abbas Mehrabian; Cristiane M. Sato; Nick Wormald; Jonathan Zung (Random Struct. Algorithms, 2014)

On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]. - Hüseyin Acan; Andrea Collevecchio; Abbas Mehrabian; Nick Wormald (PODC, 2015)

Rumours Spread Slowly in a Small World Spatial Network. - Jeannette C. M. Janssen; Abbas Mehrabian (WAW, 2015)

Nowhere-zero Unoriented Flows in Hamiltonian Graphs. - Saieed Akbari; Akbar Daemi; Omid Hatami; Adel Javanmard; Abbas Mehrabian (Ars Comb., 2015)

The fast robber on interval and chordal graphs. - Abbas Mehrabian (Discret. Appl. Math., 2015)

Chasing a Fast Robber on Planar Graphs and Random Graphs. - Noga Alon; Abbas Mehrabian (J. Graph Theory, 2015)

A Bounded Budget Network Creation Game. - Shayan Ehsani; Saber Shokat Fadaee; MohammadAmin Fazli; Abbas Mehrabian; Sina Sadeghian Sadeghabad; Mohammad Ali Safari; Morteza Saghafian (ACM Trans. Algorithms, 2015)

It's a Small World for Random Surfers. - Abbas Mehrabian; Nick Wormald (Algorithmica, 2016)

A simple tool for bounding the deviation of random matrices on geometric sets. - Christopher Liaw; Abbas Mehrabian; Yaniv Plan; Roman Vershynin (CoRR, 2016)

Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees. - Andrea Collevecchio; Abbas Mehrabian; Nick Wormald (J. Appl. Probab., 2016)

Randomized rumor spreading in poorly connected small-world networks. - Abbas Mehrabian; Ali Pourmiri (Random Struct. Algorithms, 2016)

The String of Diamonds Is Tight for Rumor Spreading. - Omer Angel; Abbas Mehrabian; Yuval Peres (APPROX-RANDOM, 2017)

Nearly-tight VC-dimension bounds for piecewise linear neural networks. - Nick Harvey; Christopher Liaw; Abbas Mehrabian (COLT, 2017)

Tight Load Balancing Via Randomized Local Search. - Petra Berenbrink; Peter Kling; Christopher Liaw; Abbas Mehrabian (IPDPS, 2017)

Agnostic Distribution Learning via Compression. - Hassan Ashtiani; Shai Ben-David; Abbas Mehrabian (CoRR, 2017)

Justifying the small-world phenomenon via random recursive trees. - Abbas Mehrabian (Random Struct. Algorithms, 2017)

On the Push&Pull Protocol for Rumor Spreading. - Hüseyin Acan; Andrea Collevecchio; Abbas Mehrabian; Nick Wormald (SIAM J. Discret. Math., 2017)

Rumors Spread Slowly in a Small-World Spatial Network. - Jeannette C. M. Janssen; Abbas Mehrabian (SIAM J. Discret. Math., 2017)

Sample-Efficient Learning of Mixtures. - Hassan Ashtiani; Shai Ben-David; Abbas Mehrabian (AAAI, 2018)

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. - Hassan Ashtiani; Shai Ben-David; Nicholas J. A. Harvey; Christopher Liaw; Abbas Mehrabian; Yaniv Plan (NeurIPS, 2018)

Some techniques in density estimation. - Hassan Ashtiani; Abbas Mehrabian (CoRR, 2018)

The Minimax Learning Rate of Normal and Ising Undirected Graphical Models. - Luc Devroye; Abbas Mehrabian; Tommy Reddad (CoRR, 2018)

New Algorithms for Multiplayer Bandits when Arm Means Vary Among Players. - Emilie Kaufmann; Abbas Mehrabian (CoRR, 2019)

Batched Multi-Armed Bandits with Optimal Regret. - Hossein Esfandiari; Amin Karbasi; Abbas Mehrabian; Vahab S. Mirrokni (CoRR, 2019)

Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks. - Peter L. Bartlett; Nick Harvey; Christopher Liaw; Abbas Mehrabian (J. Mach. Learn. Res., 2019)

Notes on growing a tree in a graph. - Luc Devroye; Vida Dujmovic; Alan M. Frieze; Abbas Mehrabian; Pat Morin; Bruce A. Reed (Random Struct. Algorithms, 2019)

A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players. - Abbas Mehrabian; Etienne Boursier; Emilie Kaufmann; Vianney Perchet (AISTATS, 2020)

Old Dog Learns New Tricks: Randomized UCB for Bandit Problems. - Sharan Vaswani; Abbas Mehrabian; Audrey Durand; Branislav Kveton (AISTATS, 2020)

The string of diamonds is nearly tight for rumour spreading. - Omer Angel; Abbas Mehrabian; Yuval Peres (Comb. Probab. Comput., 2020)

Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. - Hassan Ashtiani; Shai Ben-David; Nicholas J. A. Harvey; Christopher Liaw; Abbas Mehrabian; Yaniv Plan (J. ACM, 2020)

Regret Bounds for Batched Bandits. - Hossein Esfandiari; Amin Karbasi; Abbas Mehrabian; Vahab S. Mirrokni (AAAI, 2021)

Multiplayer Bandits Without Observing Collision Information. - Gábor Lugosi; Abbas Mehrabian (Math. Oper. Res., 2022)

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. - Abbas Mehrabian; Ankit Anand; Hyunjik Kim; Nicolas Sonnerat; Matej Balog; Gheorghe Comanici; Tudor Berariu; Andrew Lee; Anian Ruoss; Anna Bulanova; Daniel Toyama; Sam Blackwell; et al. (IJCAI, 2024)

AlphaEvolve: A coding agent for scientific and algorithmic discovery. - Alexander Novikov 001; Ngân Vu; Marvin Eisenberger; Emilien Dupont; Po-Sen Huang; Adam Zsolt Wagner; Sergey Shirobokov; Borislav Kozlovskii; Francisco J. R. Ruiz; Abbas Mehrabian; M. Pawan Kumar; Abigail See; et al. (CoRR, 2025)