default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmin Saberi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Yiding Feng, Rad Niazadeh
, Amin Saberi:
Two-Stage Stochastic Matching and Pricing with Applications to Ride Hailing. Oper. Res. 72(4): 1574-1594 (2024)- [j41]Yiding Feng, Rad Niazadeh, Amin Saberi:
Technical Note - Near-Optimal Bayesian Online Assortment of Reusable Resources. Oper. Res. 72(5): 1861-1873 (2024) - [j40]Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. Math. Oper. Res. 49(3): 1582-1606 (2024) - [j39]Christos H. Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc:
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. Math. Oper. Res. 49(3): 1607-1628 (2024) - [c82]Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting. FOCS 2024: 1294-1331 - [c81]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Sublinear Algorithms for TSP via Path Covers. ICALP 2024: 19:1-19:16 - [c80]Federico Barbero, Ameya Velingker, Amin Saberi, Michael M. Bronstein, Francesco Di Giovanni:
Locality-Aware Graph Rewiring in GNNs. ICLR 2024 - [c79]Alexandre Hayderi, Amin Saberi, Ellen Vitercik, Anders Wikum:
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation. ICML 2024 - [c78]Alexander Braun, Thomas Kesselheim, Tristan Pollner, Amin Saberi:
Approximating Optimum Online for Capacitated Resource Allocation. EC 2024: 278 - [i49]Alan Chung, Amin Saberi, Morgane Austern:
Statistical Guarantees for Link Prediction using Graph Neural Networks. CoRR abs/2402.02692 (2024) - [i48]Shayan Talaei, Mohammadreza Pourreza, Yu-Chen Chang, Azalia Mirhoseini, Amin Saberi:
CHESS: Contextual Harnessing for Efficient SQL Synthesis. CoRR abs/2405.16755 (2024) - [i47]Alexandre Hayderi, Amin Saberi, Ellen Vitercik, Anders Wikum:
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation. CoRR abs/2406.05959 (2024) - [i46]Alexander Braun, Thomas Kesselheim, Tristan Pollner, Amin Saberi:
Approximating Optimum Online for Capacitated Resource Allocation. CoRR abs/2406.07757 (2024) - [i45]Amin Saberi, Mingwei Yang, Sophie H. Yu:
Stochastic Online Metric Matching: Adversarial is no Harder than Stochastic. CoRR abs/2407.14785 (2024) - [i44]Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc:
New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. CoRR abs/2407.15285 (2024) - [i43]Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting. CoRR abs/2409.15713 (2024) - [i42]Mohammadreza Pourreza, Hailong Li, Ruoxi Sun, Yeounoh Chung, Shayan Talaei, Gaurav Tarlok Kakkar, Yu Gan, Amin Saberi, Fatma Ozcan, Sercan Ö. Arik:
CHASE-SQL: Multi-Path Reasoning and Preference Optimized Candidate Selection in Text-to-SQL. CoRR abs/2410.01943 (2024) - 2023
- [j38]Arash Asadpour, Rad Niazadeh, Amin Saberi, Ali Shameli:
Sequential Submodular Maximization and Applications to Ranking an Assortment of Products. Oper. Res. 71(4): 1154-1170 (2023) - [j37]Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley:
Edge-Weighted Online Windowed Matching. Math. Oper. Res. 48(2): 999-1016 (2023) - [c77]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Beating Greedy Matching in Sublinear Time. SODA 2023: 3900-3945 - [i41]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Sublinear Algorithms for TSP via Path Covers. CoRR abs/2301.05350 (2023) - [i40]Federico Barbero, Ameya Velingker, Amin Saberi, Michael M. Bronstein, Francesco Di Giovanni:
Locality-Aware Graph-Rewiring in GNNs. CoRR abs/2310.01668 (2023) - [i39]Yeganeh Alimohammadi, Luana Ruiz, Amin Saberi:
A Local Graph Limits Perspective on Sampling-Based GNNs. CoRR abs/2310.10953 (2023) - 2022
- [j36]Marco Pavone, Amin Saberi, Maximilian Schiffer, Matt Wu Tsao:
Technical Note - Online Hypergraph Matching with Delays. Oper. Res. 70(4): 2194-2212 (2022) - [c76]Mohammad Roghani, Amin Saberi, David Wajc:
Beating the Folklore Algorithm for Dynamic Matching. ITCS 2022: 111:1-111:23 - [c75]Mohammad Akbarpour, Yeganeh Alimohammadi, Shengwu Li, Amin Saberi:
The Value of Excess Supply in Spatial Matching Markets. EC 2022: 62 - [c74]Kristen Kessel, Ali Shameli, Amin Saberi, David Wajc:
The Stationary Prophet Inequality Problem. EC 2022: 243-244 - [c73]Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. EC 2022: 321-322 - [c72]Arash Asadpour, Rad Niazadeh, Amin Saberi, Ali Shameli:
Sequential Submodular Maximization and Applications to Ranking an Assortment of Products. EC 2022: 817 - [c71]Yiding Feng, Rad Niazadeh, Amin Saberi:
Near-Optimal Bayesian Online Assortment of Reusable Resources. EC 2022: 964-965 - [c70]Yeganeh Alimohammadi, Christian Borgs, Amin Saberi:
Algorithms Using Local Graph Features to Predict Epidemics. SODA 2022: 3430-3451 - [i38]Tristan Pollner, Mohammad Roghani, Amin Saberi, David Wajc:
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. CoRR abs/2205.08667 (2022) - [i37]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Beating Greedy Matching in Sublinear Time. CoRR abs/2206.13057 (2022) - [i36]Yiding Feng, Rad Niazadeh, Amin Saberi:
Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing. CoRR abs/2210.11648 (2022) - 2021
- [c69]Amin Saberi, David Wajc:
The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. ICALP 2021: 109:1-109:18 - [c68]Itai Ashlagi, Mark Braverman, Amin Saberi, Clayton Thomas, Geng Zhao:
Tiered Random Matching Markets: Rank Is Proportional to Popularity. ITCS 2021: 46:1-46:16 - [c67]Nima Anari, Nathan Hu, Amin Saberi, Aaron Schild:
Sampling Arborescences in Parallel. ITCS 2021: 83:1-83:18 - [c66]Mobin Y. Jeloudar, Irene Lo, Tristan Pollner, Amin Saberi:
Decentralized Matching in a Probabilistic Environment. EC 2021: 635-653 - [c65]Christos H. Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc:
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. EC 2021: 763-764 - [c64]Yiding Feng, Rad Niazadeh, Amin Saberi:
Two-stage Stochastic Matching with Application to Ride Hailing. SODA 2021: 2862-2877 - [i35]Christos H. Papadimitriou, Tristan Pollner, Amin Saberi, David Wajc:
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. CoRR abs/2102.10261 (2021) - [i34]Yeganeh Alimohammadi, Christian Borgs, Amin Saberi:
Locality of Random Digraphs on Expanders. CoRR abs/2103.09952 (2021) - [i33]Mohammad Akbarpour, Yeganeh Alimohammadi, Shengwu Li, Amin Saberi:
The Value of Excess Supply in Spatial Matching Markets. CoRR abs/2104.03219 (2021) - [i32]Amin Saberi, David Wajc:
The Greedy Algorithm is \emph{not} Optimal for On-Line Edge Coloring. CoRR abs/2105.06944 (2021) - [i31]Mobin Y. Jeloudar, Irene Lo, Tristan Pollner, Amin Saberi:
Decentralized Matching in a Probabilistic Environment. CoRR abs/2106.06706 (2021) - [i30]Mohammad Roghani, Amin Saberi, David Wajc:
Beating the Folklore Algorithm for Dynamic Matching. CoRR abs/2106.10321 (2021) - [i29]Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani, Amin Saberi:
Sequential importance sampling for estimating expectations over the space of perfect matchings. CoRR abs/2107.00850 (2021) - [i28]Kristen Kessel, Amin Saberi, Ali Shameli, David Wajc:
The Stationary Prophet Inequality Problem. CoRR abs/2107.10516 (2021) - [i27]Yeganeh Alimohammadi, Christian Borgs, Amin Saberi:
Algorithms Using Local Graph Features to Predict Epidemics. CoRR abs/2110.08961 (2021) - 2020
- [j35]Itai Ashlagi, Amin Saberi, Ali Shameli:
Assignment Mechanisms Under Distributional Constraints. Oper. Res. 68(2): 467-479 (2020) - [c63]Itai Ashlagi, Jacob D. Leshno, Pengyu Qian, Amin Saberi:
Queue Lengths as Constantly Adapting Prices: Allocative Efficiency Under Random Dynamics. EC 2020: 317-318 - [c62]Marco Pavone, Amin Saberi, Maximilian Schiffer, Matthew Tsao:
Online Hypergraph Matching with Delays. WINE 2020: 465 - [i26]Arash Asadpour, Rad Niazadeh, Amin Saberi, Ali Shameli:
Ranking an Assortment of Products via Sequential Submodular Optimization. CoRR abs/2002.09458 (2020) - [i25]Marco Pavone, Amin Saberi, Maximilian Schiffer, Matthew Tsao:
Online Hypergraph Matching with Delays. CoRR abs/2009.12022 (2020) - [i24]Nima Anari, Nathan Hu, Amin Saberi, Aaron Schild:
Sampling Arborescences in Parallel. CoRR abs/2012.09502 (2020)
2010 – 2019
- 2019
- [c61]Nima Anari, Rad Niazadeh, Amin Saberi, Ali Shameli:
Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection. EC 2019: 91-92 - [c60]Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley:
Edge Weighted Online Windowed Matching. EC 2019: 729-742 - [c59]Itai Ashlagi, Amin Saberi, Ali Shameli:
Assignment Mechanisms under Distributional Constraints. SODA 2019: 229-240 - [c58]AmirMahdi Ahmadinejad, Arun Jambulapati, Amin Saberi, Aaron Sidford:
Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications. SODA 2019: 1387-1404 - [c57]AmirMahdi Ahmadinejad, Hamid Nazerzadeh, Amin Saberi, Nolan Skochdopole, Kane Sweeney:
Competition in Ride-Hailing Markets. WINE 2019: 333 - 2018
- [j34]Mohsen Bayati, Andrea Montanari, Amin Saberi:
Generating Random Networks Without Short Cycles. Oper. Res. 66(5): 1227-1246 (2018) - [c56]Nima Anari, Constantinos Daskalakis, Wolfgang Maass, Christos H. Papadimitriou, Amin Saberi, Santosh S. Vempala:
Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons. NeurIPS 2018: 10880-10890 - [c55]Mohammad Akbarpour, Suraj Malladi, Amin Saberi:
Diffusion, Seeding, and the Value of Network Information. EC 2018: 641 - [c54]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava:
Approximating the Largest Root and Applications to Interlacing Families. SODA 2018: 1015-1028 - [c53]Rad Niazadeh, Amin Saberi, Ali Shameli:
Prophet Inequalities vs. Approximating Optimum Online. WINE 2018: 356-374 - [c52]Rajan Vaish, Shirish Goyal, Amin Saberi, Sharad Goel:
Creating Crowdsourced Research Talks at Scale. WWW 2018: 1-11 - [i23]Itai Ashlagi, Maximilien Burq, Patrick Jaillet, Amin Saberi:
Maximizing Efficiency in Dynamic Matching Markets. CoRR abs/1803.01285 (2018) - [i22]Nima Anari, Rad Niazadeh, Amin Saberi, Ali Shameli:
Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection. CoRR abs/1807.05477 (2018) - [i21]Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley:
Maximum Weight Online Matching with Deadlines. CoRR abs/1808.03526 (2018) - [i20]AmirMahdi Ahmadinejad, Arun Jambulapati, Amin Saberi, Aaron Sidford:
Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications. CoRR abs/1810.02348 (2018) - [i19]Itai Ashlagi, Amin Saberi, Ali Shameli:
Assignment Mechanisms under Distributional Constraints. CoRR abs/1810.04331 (2018) - [i18]Nima Anari, Constantinos Daskalakis, Wolfgang Maass, Christos H. Papadimitriou, Amin Saberi, Santosh S. Vempala:
Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons. CoRR abs/1810.11896 (2018) - 2017
- [j33]Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi:
An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem. Oper. Res. 65(4): 1043-1061 (2017) - [j32]Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. ACM Trans. Algorithms 13(4): 52:1-52:28 (2017) - [c51]Nima Anari, Leonid Gurvits, Shayan Oveis Gharan, Amin Saberi:
Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices. FOCS 2017: 914-925 - [c50]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Mohit Singh:
Nash Social Welfare, Matrix Permanent, and Stable Polynomials. ITCS 2017: 36:1-36:12 - [c49]Rajan Vaish, Sharad Goel, Amin Saberi:
Mobilizing the Crowd to Create an Open Repository of Research Talks. L@S 2017: 311-314 - [c48]Mohammad Akbarpour, Amin Saberi, Ali Shameli:
Information Aggregation in Overlapping Generations. WINE 2017: 401 - [c47]Ali Shameli, Tim Althoff, Amin Saberi, Jure Leskovec:
How Gamification Affects Physical Activity: Large-scale Analysis of Walking Challenges in a Mobile Application. WWW (Companion Volume) 2017: 455-463 - [i17]Ali Shameli, Tim Althoff, Amin Saberi, Jure Leskovec:
How Gamification Affects Physical Activity: Large-scale Analysis of Walking Challenges in a Mobile Application. CoRR abs/1702.07437 (2017) - [i16]Nima Anari, Leonid Gurvits, Shayan Oveis Gharan, Amin Saberi:
Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices. CoRR abs/1704.03486 (2017) - [i15]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava:
Approximating the Largest Root and Applications to Interlacing Families. CoRR abs/1704.03892 (2017) - 2016
- [j31]Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi:
A Simple and Efficient Algorithm for Computing Market Equilibria. ACM Trans. Algorithms 12(3): 34:1-34:15 (2016) - [c46]Anthony Kim, Vahid Liaghat, Junjie Qin, Amin Saberi:
Online Energy Storage Management: an Algorithmic Approach. APPROX-RANDOM 2016: 12:1-12:23 - [i14]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Mohit Singh:
Nash Social Welfare, Matrix Permanent, and Stable Polynomials. CoRR abs/1609.07056 (2016) - 2015
- [c45]Milad Eftekhar, Farnaz Ronaghi, Amin Saberi:
Team Formation Dynamics: A Study Using Online Learning Data. COSN 2015: 257-267 - [c44]Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. ICALP (1) 2015: 39-51 - [i13]Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. CoRR abs/1503.00941 (2015) - 2014
- [c43]Mehran Sahami, Jace Kohlmeier, Peter Norvig, Andreas Paepcke, Amin Saberi:
Panel: online learning platforms and data science. L@S 2014: 137-138 - 2013
- [j30]Hamid Nazerzadeh, Amin Saberi, Rakesh Vohra:
Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising. Oper. Res. 61(1): 98-111 (2013) - [j29]Mehmet Ercan Yildiz, Asuman E. Ozdaglar, Daron Acemoglu, Amin Saberi, Anna Scaglione:
Binary Opinion Dynamics with Stubborn Agents. ACM Trans. Economics and Comput. 1(4): 19:1-19:30 (2013) - [j28]Mohsen Bayati, David F. Gleich, Amin Saberi, Ying Wang:
Message-Passing Algorithms for Sparse Network Alignment. ACM Trans. Knowl. Discov. Data 7(1): 3:1-3:31 (2013) - 2012
- [j27]Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Ye:
Price of Correlations in Stochastic Optimization. Oper. Res. 60(1): 150-162 (2012) - [j26]Xiaotie Deng, Qi Qi, Amin Saberi:
Algorithmic Solutions for Envy-Free Cake Cutting. Oper. Res. 60(6): 1461-1476 (2012) - [j25]Vahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi:
Online Stochastic Matching: Online Actions Based on Offline Statistics. Math. Oper. Res. 37(4): 559-573 (2012) - [j24]Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi:
Online Optimization with Uncertain Information. ACM Trans. Algorithms 8(1): 2:1-2:29 (2012) - [j23]Arash Asadpour, Uriel Feige, Amin Saberi:
Santa claus meets hypergraph matchings. ACM Trans. Algorithms 8(3): 24:1-24:9 (2012) - [c42]Arthur J. Friend, Vahideh H. Manshadi, Amin Saberi:
Distributed node placement algorithms for constructing well-connected sensor networks. INFOCOM 2012: 810-818 - [c41]Vahideh H. Manshadi, Amin Saberi:
Dynamics of prisoner's dilemma and the evolution of cooperation on networks. ITCS 2012: 227-235 - 2011
- [j22]Simla Ceyhan, Mohammad Mousavi, Amin Saberi:
Social Influence and Evolution of Market Share. Internet Math. 7(2): 107-134 (2011) - [j21]Xiaotie Deng, Qi Qi, Amin Saberi, Jie Zhang:
Discrete Fixed Points: Models, Complexities, and Applications. Math. Oper. Res. 36(4): 636-652 (2011) - [c40]Shayan Oveis Gharan, Amin Saberi, Mohit Singh:
A Randomized Rounding Approach to the Traveling Salesman Problem. FOCS 2011: 550-559 - [c39]Shayan Oveis Gharan, Amin Saberi:
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus. SODA 2011: 967-975 - [c38]Vahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi:
Online Stochastic Matching: Online Actions Based on Offline Statistics. SODA 2011: 1285-1294 - [i12]Vahideh H. Manshadi, Amin Saberi:
Prisoner's Dilemma on Graphs with Large Girth. CoRR abs/1102.1038 (2011) - 2010
- [j20]Yoram Bachrach, Evangelos Markakis, Ezra Resnick, Ariel D. Procaccia, Jeffrey S. Rosenschein, Amin Saberi:
Approximating power indices: theoretical and empirical analysis. Auton. Agents Multi Agent Syst. 20(2): 105-122 (2010) - [j19]Mohsen Bayati, Jeong Han Kim, Amin Saberi:
A Sequential Algorithm for Generating Random Graphs. Algorithmica 58(4): 860-910 (2010) - [j18]Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi:
Advertisement allocation for generalized second-pricing schemes. Oper. Res. Lett. 38(6): 571-576 (2010) - [j17]Andrea Montanari, Amin Saberi:
The spread of innovations in social networks. Proc. Natl. Acad. Sci. USA 107(47): 20196-20201 (2010) - [j16]Christian Borgs, Jennifer T. Chayes, Ayalvadi Ganesh, Amin Saberi:
How to distribute antidote to control epidemics. Random Struct. Algorithms 37(2): 204-222 (2010) - [j15]Arash Asadpour, Amin Saberi:
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods. SIAM J. Comput. 39(7): 2970-2989 (2010) - [c37]Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi:
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. SODA 2010: 379-389 - [c36]Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Ye:
Correlation Robust Stochastic Optimization. SODA 2010: 1087-1096 - [c35]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng:
Subgraph sparsification and nearly optimal ultrasparsifiers. STOC 2010: 57-66 - [e1]Amin Saberi:
Internet and Network Economics - 6th International Workshop, WINE 2010, Stanford, CA, USA, December 13-17, 2010. Proceedings. Lecture Notes in Computer Science 6484, Springer 2010, ISBN 978-3-642-17571-8 [contents] - [i11]Vahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi:
Online Stochastic Matching: Online Actions Based on Offline Statistics. CoRR abs/1007.1673 (2010)
2000 – 2009
- 2009
- [j14]Andrea Montanari, Amin Saberi:
Convergence to equilibrium in local interaction games. SIGecom Exch. 8(1) (2009) - [c34]Amin Saberi, Ying Wang:
Cutting a Cake for Five People. AAIM 2009: 292-300 - [c33]Andrea Montanari, Amin Saberi:
Convergence to Equilibrium in Local Interaction Games. FOCS 2009: 303-312 - [c32]Mohsen Bayati, Margot Gerritsen, David F. Gleich, Amin Saberi, Ying Wang:
Algorithms for Large, Sparse Network Alignment Problems. ICDM 2009: 705-710 - [c31]Mohsen Bayati, Andrea Montanari, Amin Saberi:
Generating random graphs with large girth. SODA 2009: 566-575 - [c30]Arash Asadpour, Amin Saberi:
On the Inefficiency Ratio of Stable Equilibria in Congestion Games. WINE 2009: 545-552 - [i10]Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Ye:
Distributionally Robust Stochastic Programming with Binary Random Variables. CoRR abs/0902.1792 (2009) - [i9]Xiaotie Deng, Qi Qi, Amin Saberi:
On the Complexity of Envy-Free Cake Cutting. CoRR abs/0907.1334 (2009) - [i8]Shayan Oveis Gharan, Amin Saberi:
Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus. CoRR abs/0909.2849 (2009) - [i7]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng:
Subgraph Sparsification and Nearly Optimal Ultrasparsifiers. CoRR abs/0912.1623 (2009) - 2008
- [j13]Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani:
Market equilibrium via a primal-dual algorithm for a convex program. J. ACM 55(5): 22:1-22:18 (2008) - [j12]Qiqi Wang, David F. Gleich, Amin Saberi, Nasrollah Etemadi, Parviz Moin:
A Monte Carlo method for solving unsteady adjoint equations. J. Comput. Phys. 227(12): 6184-6205 (2008) - [j11]Arpita Ghosh, Stephen P. Boyd, Amin Saberi:
Minimizing Effective Resistance of a Graph. SIAM Rev. 50(1): 37-66 (2008) - [j10]Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye:
The complexity of equilibria: Hardness results for economies via a correspondence with games. Theor. Comput. Sci. 408(2-3): 188-198 (2008) - [c29]Arash Asadpour, Uriel Feige, Amin Saberi:
Santa Claus Meets Hypergraph Matchings. APPROX-RANDOM 2008: 10-20 - [c28]Yoram Bachrach, Evangelos Markakis, Ariel D. Procaccia, Jeffrey S. Rosenschein, Amin Saberi:
Approximating power indices. AAMAS (2) 2008: 943-950 - [c27]Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi:
A Fast and Simple Algorithm for Computing Market Equilibria. WINE 2008: 19-30 - [c26]Arash Asadpour, Hamid Nazerzadeh, Amin Saberi:
Stochastic Submodular Maximization. WINE 2008: 477-489 - [c25]Hamid Nazerzadeh, Amin Saberi, Rakesh Vohra:
Dynamic cost-per-action mechanisms and applications to online advertising. WWW 2008: 179-188 - [i6]Shipra Agrawal, Amin Saberi, Yinyu Ye:
Stochastic Combinatorial Optimization under Probabilistic Constraints. CoRR abs/0809.0460 (2008) - [i5]Mohsen Bayati, Andrea Montanari, Amin Saberi:
Generating Random Graphs with Large Girth. CoRR abs/0811.2853 (2008) - [i4]Andrea Montanari, Amin Saberi:
Convergence to Equilibrium in Local Interaction Games and Ising Models. CoRR abs/0812.0198 (2008) - 2007
- [j9]Milena Mihail, Amin Saberi, Prasad Tetali:
Random Walks with Lookahead on Power Law Random Graphs. Internet Math. 3(2): 147-152 (2007) - [j8]Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani:
AdWords and generalized online matching. J. ACM 54(5): 22 (2007) - [j7]Paramvir Bahl, Mohammad Taghi Hajiaghayi, Kamal Jain, Vahab S. Mirrokni, Lili Qiu, Amin Saberi:
Cell Breathing in Wireless LANs: Algorithms and Evaluation. IEEE Trans. Mob. Comput. 6(2): 164-178 (2007) - [c24]Mohsen Bayati, Jeong Han Kim, Amin Saberi:
A Sequential Algorithm for Generating Random Graphs. APPROX-RANDOM 2007: 326-340 - [c23]Christos Gkantsidis, Gagan Goel, Milena Mihail, Amin Saberi:
Towards Topology Aware Networks. INFOCOM 2007: 2591-2595 - [c22]Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi:
Allocating online advertisement space with unreliable estimates. EC 2007: 288-294 - [c21]Tomás Feder, Hamid Nazerzadeh, Amin Saberi:
Approximating nash equilibria using small-support strategies. EC 2007: 352-354 - [c20]Arash Asadpour, Amin Saberi:
An approximation algorithm for max-min fair allocation of indivisible goods. STOC 2007: 114-121 - [i3]Mohsen Bayati, Jeong Han Kim, Amin Saberi:
A Sequential Algorithm for Generating Random Graphs. CoRR abs/cs/0702124 (2007) - 2006
- [j6]Milena Mihail, Christos H. Papadimitriou, Amin Saberi:
On certain connectivity properties of the internet topology. J. Comput. Syst. Sci. 72(2): 239-251 (2006) - [j5]Christos Gkantsidis, Milena Mihail, Amin Saberi:
Random walks in peer-to-peer networks: Algorithms and evaluation. Perform. Evaluation 63(3): 241-263 (2006) - [c19]Tomás Feder, Adam Guetz, Milena Mihail, Amin Saberi:
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks. FOCS 2006: 69-76 - [c18]Mohammad Mahdian, Amin Saberi:
Multi-unit auctions with unknown supply. EC 2006: 243-249 - [c17]Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye:
Leontief economies encode nonzero sum two-player games. SODA 2006: 659-667 - 2005
- [j4]Evangelos Markakis, Amin Saberi:
On the core of the multicommodity flow game. Decis. Support Syst. 39(1): 3-10 (2005) - [c16]Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani:
AdWords and Generalized On-line Matching. FOCS 2005: 264-273 - [c15]Christos Gkantsidis, Milena Mihail, Amin Saberi:
Hybrid search schemes for unstructured peer-to-peer networks. INFOCOM 2005: 1526-1537 - [c14]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Mohammad Mahdian, Amin Saberi:
Multi-unit auctions with budget-constrained bidders. EC 2005: 44-51 - [c13]Noam Berger, Christian Borgs, Jennifer T. Chayes, Amin Saberi:
On the spread of viruses on the internet. SODA 2005: 301-310 - [c12]Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay V. Vazirani:
Price of Anarchy, Locality Gap, and a Network Service Provider Game. WINE 2005: 1046-1055 - [i2]Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye:
Leontief Economies Encode Nonzero Sum Two-Player Games. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c11]Christos Gkantsidis, Milena Mihail, Amin Saberi:
Random Walks in Peer-to-Peer Networks. INFOCOM 2004 - [c10]Christian Borgs, Jennifer T. Chayes, Mohammad Mahdian, Amin Saberi:
Exploring the community structure of newsgroups. KDD 2004: 783-787 - [c9]Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi:
On approximately fair allocations of indivisible goods. EC 2004: 125-131 - 2003
- [j3]Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6): 795-824 (2003) - [c8]Milena Mihail, Christos H. Papadimitriou, Amin Saberi:
On Certain Connectivity Properties of the Internet Topology. FOCS 2003: 28-35 - [c7]Kamal Jain, Mohammad Mahdian, Amin Saberi:
Approximating Market Equilibria. RANDOM-APPROX 2003: 98-108 - [c6]Evangelos Markakis, Amin Saberi:
On the core of the multicommodity flow game. EC 2003: 93-97 - [c5]Christos Gkantsidis, Milena Mihail, Amin Saberi:
Conductance and congestion in power law graphs. SIGMETRICS 2003: 148-159 - 2002
- [c4]Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani:
Market Equilibrium via a Primal-Dual-Type Algorithm. FOCS 2002: 389-395 - [c3]Amir Ronen, Amin Saberi:
On the Hardness of Optimal Auctions. FOCS 2002: 396-405 - [c2]Kamal Jain, Mohammad Mahdian, Amin Saberi:
A new greedy approach for facility location problems. STOC 2002: 731-740 - [i1]Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP. CoRR cs.DS/0207028 (2002) - 2001
- [c1]Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. RANDOM-APPROX 2001: 127-137 - 2000
- [j2]Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani:
On the simultaneous edge-coloring conjecture. Discret. Math. 216(1-3): 267-272 (2000) - [j1]Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani:
On a conjecture of Keedwell and the cycle double cover conjecture. Discret. Math. 216(1-3): 287-292 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
