The following pages link to Abbas Mehrabian (Q329280):
Displayed 38 items.
- It's a small world for random surfers (Q329281) (← links)
- The price of anarchy in network creation games is (mostly) constant (Q372985) (← links)
- The planar \(k\)-means problem is NP-hard (Q441888) (← links)
- The fast robber on interval and chordal graphs (Q476326) (← links)
- Zero-sum flows in regular graphs (Q605010) (← links)
- The capture time of grids (Q616367) (← links)
- On a generalization of Meyniel's conjecture on the Cops and Robbers game (Q625381) (← links)
- Cops and Robber game with a fast robber on expander graphs and random graphs (Q1929738) (← links)
- On the stretch factor of randomly embedded random graphs (Q1953060) (← links)
- The minimax learning rates of normal and Ising undirected graphical models (Q2192304) (← links)
- Positional games (Q2438527) (← links)
- On the Push&Pull Protocol for Rumour Spreading (Q2796277) (← links)
- (Q2810174) (← links)
- Randomized rumor spreading in poorly connected small-world networks (Q2818280) (← links)
- Longest paths in random Apollonian networks and largest <i>r</i>-ary subtrees of random <i>d</i>-ary recursive trees (Q2836235) (← links)
- On the Maximum Density of Graphs with Unique-Path Labelings (Q2870502) (← links)
- On a DAG Partitioning Problem (Q2900581) (← links)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
- It's a Small World for Random Surfers (Q2969667) (← links)
- Justifying the small-world phenomenon via random recursive trees (Q2977566) (← links)
- Rumours Spread Slowly in a Small World Spatial Network (Q3460743) (← links)
- Rumors Spread Slowly in a Small-World Spatial Network (Q4588846) (← links)
- On the Density of Nearly Regular Graphs with a Good Edge-Labeling (Q4899061) (← links)
- A Bounded Budget Network Creation Game (Q4962196) (← links)
- The string of diamonds is nearly tight for rumour spreading (Q4993087) (← links)
- The String of Diamonds Is Tight for Rumor Spreading (Q5002629) (← links)
- Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes (Q5056446) (← links)
- Multiplayer Bandits Without Observing Collision Information (Q5085139) (← links)
- Lower Bounds for the Cop Number when the Robber is Fast (Q5199510) (← links)
- Notes on growing a tree in a graph (Q5242878) (← links)
- On longest paths and diameter in random apollonian networks (Q5256390) (← links)
- A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets (Q5278301) (← links)
- On the Push&Pull Protocol for Rumor Spreading (Q5346546) (← links)
- (Q5381117) (← links)
- Cops and Robber Game with a Fast Robber on Interval, Chordal, and Planar Graphs (Q6220364) (← links)
- On the Maximum Density of Graphs with Good Edge-Labellings (Q6237090) (← links)
- Tight Load Balancing via Randomized Local Search (Q6288480) (← links)
- The total variation distance between high-dimensional Gaussians with the same mean (Q6308512) (← links)