Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Morteza Zadimoghaddam
@inproceedings{DBLP:conf/icml/DuettingFLNZ23,
author = {Paul Duetting and
Federico Fusco and
Silvio Lattanzi and
Ashkan Norouzi{-}Fard and
Morteza Zadimoghaddam},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Fully Dynamic Submodular Maximization over Matroids},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {8821--8835},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/duetting23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/DuettingFLNZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-19918,
author = {Paul D{\"{u}}tting and
Federico Fusco and
Silvio Lattanzi and
Ashkan Norouzi{-}Fard and
Morteza Zadimoghaddam},
title = {Fully Dynamic Submodular Maximization over Matroids},
journal = {CoRR},
volume = {abs/2305.19918},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.19918},
doi = {10.48550/ARXIV.2305.19918},
eprinttype = {arXiv},
eprint = {2305.19918},
timestamp = {Wed, 07 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-19918.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FahrbachHTZ22,
author = {Matthew Fahrbach and
Zhiyi Huang and
Runzhou Tao and
Morteza Zadimoghaddam},
title = {Edge-Weighted Online Bipartite Matching},
journal = {J. {ACM}},
volume = {69},
number = {6},
pages = {45:1--45:35},
year = {2022},
url = {https://doi.org/10.1145/3556971},
doi = {10.1145/3556971},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FahrbachHTZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/DuettingFLNZ22,
author = {Paul Duetting and
Federico Fusco and
Silvio Lattanzi and
Ashkan Norouzi{-}Fard and
Morteza Zadimoghaddam},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {Deletion Robust Submodular Maximization over Matroids},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {5671--5693},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/duetting22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:52 +0200},
biburl = {https://dblp.org/rec/conf/icml/DuettingFLNZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-13128,
author = {Paul D{\"{u}}tting and
Federico Fusco and
Silvio Lattanzi and
Ashkan Norouzi{-}Fard and
Morteza Zadimoghaddam},
title = {Deletion Robust Submodular Maximization over Matroids},
journal = {CoRR},
volume = {abs/2201.13128},
year = {2022},
url = {https://arxiv.org/abs/2201.13128},
eprinttype = {arXiv},
eprint = {2201.13128},
timestamp = {Wed, 02 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-13128.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-07582,
author = {Paul D{\"{u}}tting and
Federico Fusco and
Silvio Lattanzi and
Ashkan Norouzi{-}Fard and
Morteza Zadimoghaddam},
title = {Deletion Robust Non-Monotone Submodular Maximization over Matroids},
journal = {CoRR},
volume = {abs/2208.07582},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.07582},
doi = {10.48550/ARXIV.2208.07582},
eprinttype = {arXiv},
eprint = {2208.07582},
timestamp = {Mon, 22 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-07582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AhmadianLPZ21,
author = {Sara Ahmadian and
Allen Liu and
Binghui Peng and
Morteza Zadimoghaddam},
editor = {James R. Lee},
title = {Distributed Load Balancing: {A} New Framework and Improved Guarantees},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {79:1--79:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.79},
doi = {10.4230/LIPICS.ITCS.2021.79},
timestamp = {Thu, 04 Feb 2021 10:38:38 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AhmadianLPZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Fahrbach0TZ20,
author = {Matthew Fahrbach and
Zhiyi Huang and
Runzhou Tao and
Morteza Zadimoghaddam},
editor = {Sandy Irani},
title = {Edge-Weighted Online Bipartite Matching},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {412--423},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00046},
doi = {10.1109/FOCS46700.2020.00046},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Fahrbach0TZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ita/BhaskaraLVZ20,
author = {Aditya Bhaskara and
Silvio Lattanzi and
Sergei Vassilvitskii and
Morteza Zadimoghaddam},
title = {Residual Based Sampling for Online Low Rank Approximation},
booktitle = {Information Theory and Applications Workshop, {ITA} 2020, San Diego,
CA, USA, February 2-7, 2020},
pages = {1--19},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ITA50056.2020.9244974},
doi = {10.1109/ITA50056.2020.9244974},
timestamp = {Thu, 19 Nov 2020 14:03:02 +0100},
biburl = {https://dblp.org/rec/conf/ita/BhaskaraLVZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BhaskaraKLZ20,
author = {Aditya Bhaskara and
Amin Karbasi and
Silvio Lattanzi and
Morteza Zadimoghaddam},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {Online {MAP} Inference of Determinantal Point Processes},
booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference
on Neural Information Processing Systems 2020, NeurIPS 2020, December
6-12, 2020, virtual},
year = {2020},
url = {https://proceedings.neurips.cc/paper/2020/hash/23378a2d0a25c6ade2c1da1c06c5213f-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BhaskaraKLZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BorassiELVZ20,
author = {Michele Borassi and
Alessandro Epasto and
Silvio Lattanzi and
Sergei Vassilvitskii and
Morteza Zadimoghaddam},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {Sliding Window Algorithms for k-Clustering Problems},
booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference
on Neural Information Processing Systems 2020, NeurIPS 2020, December
6-12, 2020, virtual},
year = {2020},
url = {https://proceedings.neurips.cc/paper/2020/hash/631e9c01c190fc1515b9fe3865abbb15-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BorassiELVZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/LattanziMNTZ20,
author = {Silvio Lattanzi and
Slobodan Mitrovic and
Ashkan Norouzi{-}Fard and
Jakub Tarnawski and
Morteza Zadimoghaddam},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {Fully Dynamic Algorithm for Constrained Submodular Optimization},
booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference
on Neural Information Processing Systems 2020, NeurIPS 2020, December
6-12, 2020, virtual},
year = {2020},
url = {https://proceedings.neurips.cc/paper/2020/hash/9715d04413f296eaf3c30c47cec3daa6-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/LattanziMNTZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-01929,
author = {Matthew Fahrbach and
Zhiyi Huang and
Runzhou Tao and
Morteza Zadimoghaddam},
title = {Edge-Weighted Online Bipartite Matching},
journal = {CoRR},
volume = {abs/2005.01929},
year = {2020},
url = {https://arxiv.org/abs/2005.01929},
eprinttype = {arXiv},
eprint = {2005.01929},
timestamp = {Fri, 08 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-01929.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-04704,
author = {Silvio Lattanzi and
Slobodan Mitrovic and
Ashkan Norouzi{-}Fard and
Jakub Tarnawski and
Morteza Zadimoghaddam},
title = {Fully Dynamic Algorithm for Constrained Submodular Optimization},
journal = {CoRR},
volume = {abs/2006.04704},
year = {2020},
url = {https://arxiv.org/abs/2006.04704},
eprinttype = {arXiv},
eprint = {2006.04704},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-04704.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-05850,
author = {Michele Borassi and
Alessandro Epasto and
Silvio Lattanzi and
Sergei Vassilvitskii and
Morteza Zadimoghaddam},
title = {Sliding Window Algorithms for k-Clustering Problems},
journal = {CoRR},
volume = {abs/2006.05850},
year = {2020},
url = {https://arxiv.org/abs/2006.05850},
eprinttype = {arXiv},
eprint = {2006.05850},
timestamp = {Sat, 13 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-05850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/CohenKMZ19,
author = {Maxime C. Cohen and
Philipp W. Keller and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
title = {Overcommitment in Cloud Services: Bin Packing with Chance Constraints},
journal = {Manag. Sci.},
volume = {65},
number = {7},
pages = {3255--3271},
year = {2019},
url = {https://doi.org/10.1287/mnsc.2018.3091},
doi = {10.1287/MNSC.2018.3091},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/CohenKMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhaskaraLVZ19,
author = {Aditya Bhaskara and
Silvio Lattanzi and
Sergei Vassilvitskii and
Morteza Zadimoghaddam},
editor = {David Zuckerman},
title = {Residual Based Sampling for Online Low Rank Approximation},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1596--1614},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00094},
doi = {10.1109/FOCS.2019.00094},
timestamp = {Tue, 07 Jan 2020 13:25:31 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhaskaraLVZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/FahrbachMZ19,
author = {Matthew Fahrbach and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Kamalika Chaudhuri and
Ruslan Salakhutdinov},
title = {Non-monotone Submodular Maximization with Nearly Optimal Adaptivity
and Query Complexity},
booktitle = {Proceedings of the 36th International Conference on Machine Learning,
{ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {97},
pages = {1833--1842},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v97/fahrbach19a.html},
timestamp = {Tue, 11 Jun 2019 15:37:38 +0200},
biburl = {https://dblp.org/rec/conf/icml/FahrbachMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/0001MZLK19,
author = {Ehsan Kazemi and
Marko Mitrovic and
Morteza Zadimoghaddam and
Silvio Lattanzi and
Amin Karbasi},
editor = {Kamalika Chaudhuri and
Ruslan Salakhutdinov},
title = {Submodular Streaming in All Its Glory: Tight Approximation, Minimum
Memory and Low Adaptive Complexity},
booktitle = {Proceedings of the 36th International Conference on Machine Learning,
{ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {97},
pages = {3311--3320},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v97/kazemi19a.html},
timestamp = {Tue, 11 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/0001MZLK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/BorassiELVZ19,
author = {Michele Borassi and
Alessandro Epasto and
Silvio Lattanzi and
Sergei Vassilvitskii and
Morteza Zadimoghaddam},
editor = {Dan Suciu and
Sebastian Skritek and
Christoph Koch},
title = {Better Sliding Window Algorithms to Maximize Subadditive and Diversity
Objectives},
booktitle = {Proceedings of the 38th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2019, Amsterdam, The Netherlands, June
30 - July 5, 2019},
pages = {254--268},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3294052.3319701},
doi = {10.1145/3294052.3319701},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/BorassiELVZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FahrbachMZ19,
author = {Matthew Fahrbach and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Timothy M. Chan},
title = {Submodular Maximization with Nearly Optimal Approximation, Adaptivity
and Query Complexity},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {255--273},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.17},
doi = {10.1137/1.9781611975482.17},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/FahrbachMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/EpastoMZ19,
author = {Alessandro Epasto and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Christian Scheideler and
Petra Berenbrink},
title = {Scalable Diversity Maximization via Small-size Composable Core-sets
(Brief Announcement)},
booktitle = {The 31st {ACM} on Symposium on Parallelism in Algorithms and Architectures,
{SPAA} 2019, Phoenix, AZ, USA, June 22-24, 2019},
pages = {41--42},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3323165.3323172},
doi = {10.1145/3323165.3323172},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/EpastoMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00948,
author = {Ehsan Kazemi and
Marko Mitrovic and
Morteza Zadimoghaddam and
Silvio Lattanzi and
Amin Karbasi},
title = {Submodular Streaming in All its Glory: Tight Approximation, Minimum
Memory and Low Adaptive Complexity},
journal = {CoRR},
volume = {abs/1905.00948},
year = {2019},
url = {http://arxiv.org/abs/1905.00948},
eprinttype = {arXiv},
eprint = {1905.00948},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00948.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KorulaMZ18,
author = {Nitish Korula and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
title = {Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random
Order},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {1056--1086},
year = {2018},
url = {https://doi.org/10.1137/15M1051142},
doi = {10.1137/15M1051142},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KorulaMZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/0001ZM18,
author = {Shipra Agrawal and
Morteza Zadimoghaddam and
Vahab S. Mirrokni},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Proportional Allocation: Simple, Distributed, and Diverse Matching
with High Entropy},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {99--108},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/agrawal18b.html},
timestamp = {Wed, 03 Apr 2019 18:17:30 +0200},
biburl = {https://dblp.org/rec/conf/icml/0001ZM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/0001ZK18,
author = {Ehsan Kazemi and
Morteza Zadimoghaddam and
Amin Karbasi},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Scalable Deletion-Robust Submodular Maximization: Data Summarization
with Privacy and Fairness Constraints},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {2549--2558},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/kazemi18a.html},
timestamp = {Wed, 03 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/0001ZK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Mitrovic0ZK18,
author = {Marko Mitrovic and
Ehsan Kazemi and
Morteza Zadimoghaddam and
Amin Karbasi},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Data Summarization at Scale: {A} Two-Stage Submodular Approach},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {3593--3602},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/mitrovic18a.html},
timestamp = {Wed, 03 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/Mitrovic0ZK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MirrokniTZ18,
author = {Vahab S. Mirrokni and
Mikkel Thorup and
Morteza Zadimoghaddam},
editor = {Artur Czumaj},
title = {Consistent Hashing with Bounded Loads},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {587--604},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.39},
doi = {10.1137/1.9781611975031.39},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/MirrokniTZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-02815,
author = {Marko Mitrovic and
Ehsan Kazemi and
Morteza Zadimoghaddam and
Amin Karbasi},
title = {Data Summarization at Scale: {A} Two-Stage Submodular Approach},
journal = {CoRR},
volume = {abs/1806.02815},
year = {2018},
url = {http://arxiv.org/abs/1806.02815},
eprinttype = {arXiv},
eprint = {1806.02815},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-02815.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07889,
author = {Matthew Fahrbach and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
title = {Submodular Maximization with Optimal Approximation, Adaptivity and
Query Complexity},
journal = {CoRR},
volume = {abs/1807.07889},
year = {2018},
url = {http://arxiv.org/abs/1807.07889},
eprinttype = {arXiv},
eprint = {1807.07889},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-07889.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-06932,
author = {Matthew Fahrbach and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
title = {Non-monotone Submodular Maximization with Nearly Optimal Adaptivity
Complexity},
journal = {CoRR},
volume = {abs/1808.06932},
year = {2018},
url = {http://arxiv.org/abs/1808.06932},
eprinttype = {arXiv},
eprint = {1808.06932},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-06932.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/ZadehGMZ17,
author = {Sepehr Abbasi Zadeh and
Mehrdad Ghadiri and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Satinder Singh and
Shaul Markovitch},
title = {Scalable Feature Selection via Distributed Diversity Maximization},
booktitle = {Proceedings of the Thirty-First {AAAI} Conference on Artificial Intelligence,
February 4-9, 2017, San Francisco, California, {USA}},
pages = {2876--2883},
publisher = {{AAAI} Press},
year = {2017},
url = {https://doi.org/10.1609/aaai.v31i1.10926},
doi = {10.1609/AAAI.V31I1.10926},
timestamp = {Mon, 04 Sep 2023 14:40:32 +0200},
biburl = {https://dblp.org/rec/conf/aaai/ZadehGMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/StanZ0K17,
author = {Serban Stan and
Morteza Zadimoghaddam and
Andreas Krause and
Amin Karbasi},
editor = {Doina Precup and
Yee Whye Teh},
title = {Probabilistic Submodular Maximization in Sub-Linear Time},
booktitle = {Proceedings of the 34th International Conference on Machine Learning,
{ICML} 2017, Sydney, NSW, Australia, 6-11 August 2017},
series = {Proceedings of Machine Learning Research},
volume = {70},
pages = {3241--3250},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v70/stan17a.html},
timestamp = {Wed, 29 May 2019 08:41:45 +0200},
biburl = {https://dblp.org/rec/conf/icml/StanZ0K17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmetrics/CohenKMZ17,
author = {Maxime C. Cohen and
Philipp W. Keller and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Bruce E. Hajek and
Sewoong Oh and
Augustin Chaintreau and
Leana Golubchik and
Zhi{-}Li Zhang},
title = {Overcommitment in Cloud Services Bin packing with Chance Constraints},
booktitle = {Proceedings of the 2017 {ACM} {SIGMETRICS} / International Conference
on Measurement and Modeling of Computer Systems, Urbana-Champaign,
IL, USA, June 05 - 09, 2017},
pages = {7},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3078505.3078530},
doi = {10.1145/3078505.3078530},
timestamp = {Fri, 30 Jul 2021 16:13:32 +0200},
biburl = {https://dblp.org/rec/conf/sigmetrics/CohenKMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/EpastoMZ17,
author = {Alessandro Epasto and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Christian Scheideler and
Mohammad Taghi Hajiaghayi},
title = {Bicriteria Distributed Submodular Maximization in a Few Rounds},
booktitle = {Proceedings of the 29th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2017, Washington DC, USA, July 24-26, 2017},
pages = {25--33},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087556.3087574},
doi = {10.1145/3087556.3087574},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/EpastoMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/EpastoLVZ17,
author = {Alessandro Epasto and
Silvio Lattanzi and
Sergei Vassilvitskii and
Morteza Zadimoghaddam},
editor = {Rick Barrett and
Rick Cummings and
Eugene Agichtein and
Evgeniy Gabrilovich},
title = {Submodular Optimization Over Sliding Windows},
booktitle = {Proceedings of the 26th International Conference on World Wide Web,
{WWW} 2017, Perth, Australia, April 3-7, 2017},
pages = {421--430},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3038912.3052699},
doi = {10.1145/3038912.3052699},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/EpastoLVZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Zadimoghaddam17,
author = {Morteza Zadimoghaddam},
title = {Online Weighted Matching: Beating the 1/2 Barrier},
journal = {CoRR},
volume = {abs/1704.05384},
year = {2017},
url = {http://arxiv.org/abs/1704.05384},
eprinttype = {arXiv},
eprint = {1704.05384},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Zadimoghaddam17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenKMZ17,
author = {Maxime C. Cohen and
Philipp W. Keller and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
title = {Overcommitment in Cloud Services - Bin packing with Chance Constraints},
journal = {CoRR},
volume = {abs/1705.09335},
year = {2017},
url = {http://arxiv.org/abs/1705.09335},
eprinttype = {arXiv},
eprint = {1705.09335},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CohenKMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-07112,
author = {Ehsan Kazemi and
Morteza Zadimoghaddam and
Amin Karbasi},
title = {Deletion-Robust Submodular Maximization at Scale},
journal = {CoRR},
volume = {abs/1711.07112},
year = {2017},
url = {http://arxiv.org/abs/1711.07112},
eprinttype = {arXiv},
eprint = {1711.07112},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-07112.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-05450,
author = {Nitish Korula and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
title = {Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random
Order},
journal = {CoRR},
volume = {abs/1712.05450},
year = {2017},
url = {http://arxiv.org/abs/1712.05450},
eprinttype = {arXiv},
eprint = {1712.05450},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-05450.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/AltschulerBFMRZ16,
author = {Jason M. Altschuler and
Aditya Bhaskara and
Gang Fu and
Vahab S. Mirrokni and
Afshin Rostamizadeh and
Morteza Zadimoghaddam},
editor = {Maria{-}Florina Balcan and
Kilian Q. Weinberger},
title = {Greedy Column Subset Selection: New Bounds and Distributed Algorithms},
booktitle = {Proceedings of the 33nd International Conference on Machine Learning,
{ICML} 2016, New York City, NY, USA, June 19-24, 2016},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {48},
pages = {2539--2548},
publisher = {JMLR.org},
year = {2016},
url = {http://proceedings.mlr.press/v48/altschuler16.html},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/AltschulerBFMRZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/LucicBZK16,
author = {Mario Lucic and
Olivier Bachem and
Morteza Zadimoghaddam and
Andreas Krause},
editor = {Maria{-}Florina Balcan and
Kilian Q. Weinberger},
title = {Horizontally Scalable Submodular Maximization},
booktitle = {Proceedings of the 33nd International Conference on Machine Learning,
{ICML} 2016, New York City, NY, USA, June 19-24, 2016},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {48},
pages = {2981--2989},
publisher = {JMLR.org},
year = {2016},
url = {http://proceedings.mlr.press/v48/lucic16.html},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/LucicBZK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/MirzasoleimanZK16,
author = {Baharan Mirzasoleiman and
Morteza Zadimoghaddam and
Amin Karbasi},
editor = {Daniel D. Lee and
Masashi Sugiyama and
Ulrike von Luxburg and
Isabelle Guyon and
Roman Garnett},
title = {Fast Distributed Submodular Cover: Public-Private Data Summarization},
booktitle = {Advances in Neural Information Processing Systems 29: Annual Conference
on Neural Information Processing Systems 2016, December 5-10, 2016,
Barcelona, Spain},
pages = {3594--3602},
year = {2016},
url = {https://proceedings.neurips.cc/paper/2016/hash/052335232b11864986bb2fa20fa38748-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/MirzasoleimanZK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/DemaineHMZ16,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Hamid Mahini and
Morteza Zadimoghaddam},
title = {Network Creation Games},
booktitle = {Encyclopedia of Algorithms},
pages = {1408--1412},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_752},
doi = {10.1007/978-1-4939-2864-4\_752},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/DemaineHMZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AltschulerBFMRZ16,
author = {Jason M. Altschuler and
Aditya Bhaskara and
Gang Fu and
Vahab S. Mirrokni and
Afshin Rostamizadeh and
Morteza Zadimoghaddam},
title = {Greedy Column Subset Selection: New Bounds and Distributed Algorithms},
journal = {CoRR},
volume = {abs/1605.08795},
year = {2016},
url = {http://arxiv.org/abs/1605.08795},
eprinttype = {arXiv},
eprint = {1605.08795},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AltschulerBFMRZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LucicBZK16,
author = {Mario Lucic and
Olivier Bachem and
Morteza Zadimoghaddam and
Andreas Krause},
title = {Horizontally Scalable Submodular Maximization},
journal = {CoRR},
volume = {abs/1605.09619},
year = {2016},
url = {http://arxiv.org/abs/1605.09619},
eprinttype = {arXiv},
eprint = {1605.09619},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LucicBZK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MirrokniTZ16,
author = {Vahab S. Mirrokni and
Mikkel Thorup and
Morteza Zadimoghaddam},
title = {Consistent Hashing with Bounded Loads},
journal = {CoRR},
volume = {abs/1608.01350},
year = {2016},
url = {http://arxiv.org/abs/1608.01350},
eprinttype = {arXiv},
eprint = {1608.01350},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MirrokniTZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EpastoLVZ16,
author = {Alessandro Epasto and
Silvio Lattanzi and
Sergei Vassilvitskii and
Morteza Zadimoghaddam},
title = {Submodular Optimization over Sliding Windows},
journal = {CoRR},
volume = {abs/1610.09984},
year = {2016},
url = {http://arxiv.org/abs/1610.09984},
eprinttype = {arXiv},
eprint = {1610.09984},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EpastoLVZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/BateniHSZ15,
author = {MohammadHossein Bateni and
Nima Haghpanah and
Balasubramanian Sivan and
Morteza Zadimoghaddam},
title = {Revenue Maximization with Nonexcludable Goods},
journal = {{ACM} Trans. Economics and Comput.},
volume = {3},
number = {4},
pages = {18:1--18:16},
year = {2015},
url = {https://doi.org/10.1145/2790131},
doi = {10.1145/2790131},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/BateniHSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/BhaskaraSZ15,
author = {Aditya Bhaskara and
Ananda Theertha Suresh and
Morteza Zadimoghaddam},
editor = {Guy Lebanon and
S. V. N. Vishwanathan},
title = {Sparse Solutions to Nonnegative Linear Systems and Applications},
booktitle = {Proceedings of the Eighteenth International Conference on Artificial
Intelligence and Statistics, {AISTATS} 2015, San Diego, California,
USA, May 9-12, 2015},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {38},
publisher = {JMLR.org},
year = {2015},
url = {http://proceedings.mlr.press/v38/bhaskara15.html},
timestamp = {Wed, 29 May 2019 08:41:44 +0200},
biburl = {https://dblp.org/rec/conf/aistats/BhaskaraSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MehtaWZ15,
author = {Aranyak Mehta and
Bo Waggoner and
Morteza Zadimoghaddam},
editor = {Piotr Indyk},
title = {Online Stochastic Matching with Unequal Probabilities},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1388--1404},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.92},
doi = {10.1137/1.9781611973730.92},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/MehtaWZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MirrokniZ15,
author = {Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Randomized Composable Core-sets for Distributed Submodular Maximization},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {153--162},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746624},
doi = {10.1145/2746539.2746624},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MirrokniZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KorulaMZ15,
author = {Nitish Korula and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random
Order},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {889--898},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746626},
doi = {10.1145/2746539.2746626},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KorulaMZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhaskaraSZ15,
author = {Aditya Bhaskara and
Ananda Theertha Suresh and
Morteza Zadimoghaddam},
title = {Sparse Solutions to Nonnegative Linear Systems and Applications},
journal = {CoRR},
volume = {abs/1501.01689},
year = {2015},
url = {http://arxiv.org/abs/1501.01689},
eprinttype = {arXiv},
eprint = {1501.01689},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhaskaraSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MirrokniZ15,
author = {Vahab S. Mirrokni and
Morteza Zadimoghaddam},
title = {Randomized Composable Core-sets for Distributed Submodular Maximization},
journal = {CoRR},
volume = {abs/1506.06715},
year = {2015},
url = {http://arxiv.org/abs/1506.06715},
eprinttype = {arXiv},
eprint = {1506.06715},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MirrokniZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Zadimoghaddam14,
author = {Morteza Zadimoghaddam},
title = {Online allocation algorithms with applications in computational advertising},
school = {Massachusetts Institute of Technology, Cambridge, MA, {USA}},
year = {2014},
url = {https://hdl.handle.net/1721.1/87940},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Zadimoghaddam14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BachrachLLRZ14,
author = {Yoram Bachrach and
Omer Lev and
Shachar Lovett and
Jeffrey S. Rosenschein and
Morteza Zadimoghaddam},
editor = {Ana L. C. Bazzan and
Michael N. Huhns and
Alessio Lomuscio and
Paul Scerri},
title = {Cooperative weakest link games},
booktitle = {International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '14, Paris, France, May 5-9, 2014},
pages = {589--596},
publisher = {{IFAAMAS/ACM}},
year = {2014},
url = {http://dl.acm.org/citation.cfm?id=2615827},
timestamp = {Thu, 25 Sep 2014 07:46:15 +0200},
biburl = {https://dblp.org/rec/conf/atal/BachrachLLRZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/DemaineHMMRSZ14,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
Hamid Mahini and
David L. Malec and
S. Raghavan and
Anshul Sawant and
Morteza Zadimoghaddam},
editor = {Chin{-}Wan Chung and
Andrei Z. Broder and
Kyuseok Shim and
Torsten Suel},
title = {How to influence people with partial incentives},
booktitle = {23rd International World Wide Web Conference, {WWW} '14, Seoul, Republic
of Korea, April 7-11, 2014},
pages = {937--948},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2566486.2568039},
doi = {10.1145/2566486.2568039},
timestamp = {Fri, 19 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/DemaineHMMRSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DemaineHMMRSZ14,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
Hamid Mahini and
David L. Malec and
S. Raghavan and
Anshul Sawant and
Morteza Zadimoghaddam},
title = {How to Influence People with Partial Incentives},
journal = {CoRR},
volume = {abs/1401.7970},
year = {2014},
url = {http://arxiv.org/abs/1401.7970},
eprinttype = {arXiv},
eprint = {1401.7970},
timestamp = {Fri, 19 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DemaineHMMRSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/DemaineGHSZ13,
author = {Erik D. Demaine and
Mohammad Ghodsi and
MohammadTaghi Hajiaghayi and
Amin S. Sayedi{-}Roshkhar and
Morteza Zadimoghaddam},
title = {Scheduling to minimize gaps and power consumption},
journal = {J. Sched.},
volume = {16},
number = {2},
pages = {151--160},
year = {2013},
url = {https://doi.org/10.1007/s10951-012-0309-6},
doi = {10.1007/S10951-012-0309-6},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/DemaineGHSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BateniHZ13,
author = {MohammadHossein Bateni and
Mohammad Taghi Hajiaghayi and
Morteza Zadimoghaddam},
title = {Submodular secretary problem and extensions},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {4},
pages = {32:1--32:23},
year = {2013},
url = {https://doi.org/10.1145/2500121},
doi = {10.1145/2500121},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BateniHZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BachrachKKZ13,
author = {Yoram Bachrach and
Pushmeet Kohli and
Vladimir Kolmogorov and
Morteza Zadimoghaddam},
editor = {Marie desJardins and
Michael L. Littman},
title = {Optimal Coalition Structure Generation in Cooperative Graph Games},
booktitle = {Proceedings of the Twenty-Seventh {AAAI} Conference on Artificial
Intelligence, July 14-18, 2013, Bellevue, Washington, {USA}},
pages = {81--87},
publisher = {{AAAI} Press},
year = {2013},
url = {https://doi.org/10.1609/aaai.v27i1.8653},
doi = {10.1609/AAAI.V27I1.8653},
timestamp = {Mon, 04 Sep 2023 15:56:33 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BachrachKKZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DemaineZ13,
author = {Erik D. Demaine and
Morteza Zadimoghaddam},
editor = {Sanjeev Khanna},
title = {Learning Disjunctions: Near-Optimal Trade-off between Mistakes and
"I Don't Know's"},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {1369--1379},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.99},
doi = {10.1137/1.9781611973105.99},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/DemaineZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KarbasiZ13,
author = {Amin Karbasi and
Morteza Zadimoghaddam},
editor = {Natacha Portier and
Thomas Wilke},
title = {Constrained Binary Identification Problem},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {550--561},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.550},
doi = {10.4230/LIPICS.STACS.2013.550},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KarbasiZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BateniHSZ13,
author = {MohammadHossein Bateni and
Nima Haghpanah and
Balasubramanian Sivan and
Morteza Zadimoghaddam},
editor = {Yiling Chen and
Nicole Immorlica},
title = {Revenue Maximization with Nonexcludable Goods},
booktitle = {Web and Internet Economics - 9th International Conference, {WINE}
2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8289},
pages = {40--53},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45046-4\_5},
doi = {10.1007/978-3-642-45046-4\_5},
timestamp = {Thu, 12 Aug 2021 18:47:48 +0200},
biburl = {https://dblp.org/rec/conf/wine/BateniHSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/KorulaMZ13,
author = {Nitish Korula and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Yiling Chen and
Nicole Immorlica},
title = {Bicriteria Online Matching: Maximizing Weight and Cardinality},
booktitle = {Web and Internet Economics - 9th International Conference, {WINE}
2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8289},
pages = {305--318},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45046-4\_25},
doi = {10.1007/978-3-642-45046-4\_25},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/KorulaMZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/DemaineZ12,
author = {Erik D. Demaine and
Morteza Zadimoghaddam},
title = {Constant Price of Anarchy in Network-Creation Games via Public-Service
Advertising},
journal = {Internet Math.},
volume = {8},
number = {1-2},
pages = {29--45},
year = {2012},
url = {https://doi.org/10.1080/15427951.2012.625251},
doi = {10.1080/15427951.2012.625251},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/DemaineZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineHMZ12,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Hamid Mahini and
Morteza Zadimoghaddam},
title = {The price of anarchy in network creation games},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {13:1--13:13},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151176},
doi = {10.1145/2151171.2151176},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DemaineHMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/KarbasiZ12,
author = {Amin Karbasi and
Morteza Zadimoghaddam},
title = {Sequential group testing with graph constraints},
booktitle = {2012 {IEEE} Information Theory Workshop, Lausanne, Switzerland, September
3-7, 2012},
pages = {292--296},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/ITW.2012.6404678},
doi = {10.1109/ITW.2012.6404678},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/itw/KarbasiZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MirrokniGZ12,
author = {Vahab S. Mirrokni and
Shayan Oveis Gharan and
Morteza Zadimoghaddam},
editor = {Yuval Rabani},
title = {Simultaneous approximations for adversarial and stochastic online
budgeted allocation},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1690--1701},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.134},
doi = {10.1137/1.9781611973099.134},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/MirrokniGZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/ZadimoghaddamR12,
author = {Morteza Zadimoghaddam and
Aaron Roth},
editor = {Paul W. Goldberg},
title = {Efficiently Learning from Revealed Preference},
booktitle = {Internet and Network Economics - 8th International Workshop, {WINE}
2012, Liverpool, UK, December 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7695},
pages = {114--127},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35311-6\_9},
doi = {10.1007/978-3-642-35311-6\_9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/ZadimoghaddamR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-4150,
author = {Morteza Zadimoghaddam and
Aaron Roth},
title = {Efficiently Learning from Revealed Preference},
journal = {CoRR},
volume = {abs/1211.4150},
year = {2012},
url = {http://arxiv.org/abs/1211.4150},
eprinttype = {arXiv},
eprint = {1211.4150},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-4150.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GhodsiMMZ11,
author = {Mohammad Ghodsi and
Hamid Mahini and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
title = {Permutation Betting Markets: Singleton Betting with Extra Information},
journal = {Algorithmica},
volume = {60},
number = {4},
pages = {853--876},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9378-0},
doi = {10.1007/S00453-009-9378-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GhodsiMMZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KakhbodZ11,
author = {Ali Kakhbod and
Morteza Zadimoghaddam},
title = {On the construction of prefix-free and fix-free codes with specified
codeword compositions},
journal = {Discret. Appl. Math.},
volume = {159},
number = {18},
pages = {2269--2275},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.08.003},
doi = {10.1016/J.DAM.2011.08.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KakhbodZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigecom/BachrachZK11,
author = {Yoram Bachrach and
Morteza Zadimoghaddam and
Peter B. Key},
title = {A cooperative approach to collusion in auctions},
journal = {SIGecom Exch.},
volume = {10},
number = {1},
pages = {17--22},
year = {2011},
url = {https://doi.org/10.1145/1978721.1978726},
doi = {10.1145/1978721.1978726},
timestamp = {Wed, 21 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigecom/BachrachZK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BermanDZ11,
author = {Piotr Berman and
Erik D. Demaine and
Morteza Zadimoghaddam},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {O(1)-Approximations for Maximum Movement Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {62--74},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_6},
doi = {10.1007/978-3-642-22935-0\_6},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BermanDZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/KarbasiZ11,
author = {Amin Karbasi and
Morteza Zadimoghaddam},
editor = {Alexander Kuleshov and
Vladimir M. Blinovsky and
Anthony Ephremides},
title = {Compression with graphical constraints: An interactive browser},
booktitle = {2011 {IEEE} International Symposium on Information Theory Proceedings,
{ISIT} 2011, St. Petersburg, Russia, July 31 - August 5, 2011},
pages = {953--957},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/ISIT.2011.6034280},
doi = {10.1109/ISIT.2011.6034280},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/KarbasiZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AlistarhACGZ11,
author = {Dan Alistarh and
James Aspnes and
Keren Censor{-}Hillel and
Seth Gilbert and
Morteza Zadimoghaddam},
editor = {Cyril Gavoille and
Pierre Fraigniaud},
title = {Optimal-time adaptive strong renaming, with applications to counting},
booktitle = {Proceedings of the 30th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2011, San Jose, CA, USA, June 6-8, 2011},
pages = {239--248},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993806.1993850},
doi = {10.1145/1993806.1993850},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AlistarhACGZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/HaeuplerMZ11,
author = {Bernhard Haeupler and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Ning Chen and
Edith Elkind and
Elias Koutsoupias},
title = {Online Stochastic Weighted Matching: Improved Approximation Algorithms},
booktitle = {Internet and Network Economics - 7th International Workshop, {WINE}
2011, Singapore, December 11-14, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7090},
pages = {170--181},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25510-6\_15},
doi = {10.1007/978-3-642-25510-6\_15},
timestamp = {Fri, 24 Apr 2020 14:22:03 +0200},
biburl = {https://dblp.org/rec/conf/wine/HaeuplerMZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-5248,
author = {Yoram Bachrach and
Pushmeet Kohli and
Vladimir Kolmogorov and
Morteza Zadimoghaddam},
title = {Optimal Coalition Structures in Graph Games},
journal = {CoRR},
volume = {abs/1108.5248},
year = {2011},
url = {http://arxiv.org/abs/1108.5248},
eprinttype = {arXiv},
eprint = {1108.5248},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-5248.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BateniHZ10,
author = {MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
Morteza Zadimoghaddam},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Submodular Secretary Problem and Extensions},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {39--52},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_4},
doi = {10.1007/978-3-642-15369-3\_4},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BateniHZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlistarhGGZ10,
author = {Dan Alistarh and
Seth Gilbert and
Rachid Guerraoui and
Morteza Zadimoghaddam},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {How Efficient Can Gossip Be? (On the Cost of Resilient Information
Exchange)},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6199},
pages = {115--126},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14162-1\_10},
doi = {10.1007/978-3-642-14162-1\_10},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AlistarhGGZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/SayediZB10,
author = {Amin Sayedi and
Morteza Zadimoghaddam and
Avrim Blum},
editor = {John D. Lafferty and
Christopher K. I. Williams and
John Shawe{-}Taylor and
Richard S. Zemel and
Aron Culotta},
title = {Trading off Mistakes and Don't-Know Predictions},
booktitle = {Advances in Neural Information Processing Systems 23: 24th Annual
Conference on Neural Information Processing Systems 2010. Proceedings
of a meeting held 6-9 December 2010, Vancouver, British Columbia,
Canada},
pages = {2092--2100},
publisher = {Curran Associates, Inc.},
year = {2010},
url = {https://proceedings.neurips.cc/paper/2010/hash/286674e3082feb7e5afb92777e48821f-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/SayediZB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/DemaineZ10,
author = {Erik D. Demaine and
Morteza Zadimoghaddam},
editor = {Friedhelm Meyer auf der Heide and
Cynthia A. Phillips},
title = {Scheduling to minimize power consumption using submodular functions},
booktitle = {{SPAA} 2010: Proceedings of the 22nd Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15,
2010},
pages = {21--29},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1810479.1810483},
doi = {10.1145/1810479.1810483},
timestamp = {Wed, 21 Nov 2018 11:15:55 +0100},
biburl = {https://dblp.org/rec/conf/spaa/DemaineZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GilbertGRZ10,
author = {Seth Gilbert and
Rachid Guerraoui and
Faezeh Malakouti Rad and
Morteza Zadimoghaddam},
editor = {Friedhelm Meyer auf der Heide and
Cynthia A. Phillips},
title = {Collaborative scoring with dishonest participants},
booktitle = {{SPAA} 2010: Proceedings of the 22nd Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15,
2010},
pages = {41--49},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1810479.1810488},
doi = {10.1145/1810479.1810488},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spaa/GilbertGRZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DemaineZ10,
author = {Erik D. Demaine and
Morteza Zadimoghaddam},
editor = {Haim Kaplan},
title = {Minimizing the Diameter of a Network Using Shortcut Edges},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {420--431},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_39},
doi = {10.1007/978-3-642-13731-0\_39},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/DemaineZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/DemaineZ10,
author = {Erik D. Demaine and
Morteza Zadimoghaddam},
editor = {Ravi Kumar and
D. Sivakumar},
title = {Constant Price of Anarchy in Network Creation Games via Public Service
Advertising},
booktitle = {Algorithms and Models for the Web-Graph - 7th International Workshop,
{WAW} 2010, Stanford, CA, USA, December 13-14, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6516},
pages = {122--131},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18009-5\_12},
doi = {10.1007/978-3-642-18009-5\_12},
timestamp = {Mon, 08 Mar 2021 08:56:44 +0100},
biburl = {https://dblp.org/rec/conf/waw/DemaineZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BachrachKZ10,
author = {Yoram Bachrach and
Peter B. Key and
Morteza Zadimoghaddam},
editor = {Amin Saberi},
title = {Collusion in {VCG} Path Procurement Auctions},
booktitle = {Internet and Network Economics - 6th International Workshop, {WINE}
2010, Stanford, CA, USA, December 13-17, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6484},
pages = {38--49},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17572-5\_4},
doi = {10.1007/978-3-642-17572-5\_4},
timestamp = {Wed, 21 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/BachrachKZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-0097,
author = {Ali Kakhbod and
Morteza Zadimoghaddam},
title = {On the Carter-Gill Conjecture},
journal = {CoRR},
volume = {abs/1002.0097},
year = {2010},
url = {http://arxiv.org/abs/1002.0097},
eprinttype = {arXiv},
eprint = {1002.0097},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1002-0097.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigecom/DemaineHMZ09,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Hamid Mahini and
Morteza Zadimoghaddam},
title = {The price of anarchy in cooperative network creation games},
journal = {SIGecom Exch.},
volume = {8},
number = {2},
pages = {2},
year = {2009},
url = {https://doi.org/10.1145/1980522.1980524},
doi = {10.1145/1980522.1980524},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigecom/DemaineHMZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineHMSGZ09,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Hamid Mahini and
Amin S. Sayedi{-}Roshkhar and
Shayan Oveis Gharan and
Morteza Zadimoghaddam},
title = {Minimizing movement},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {3},
pages = {30:1--30:30},
year = {2009},
url = {https://doi.org/10.1145/1541885.1541891},
doi = {10.1145/1541885.1541891},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DemaineHMSGZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DemaineHMZ09,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
Hamid Mahini and
Morteza Zadimoghaddam},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {The Price of Anarchy in Cooperative Network Creation Games},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {301--312},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1839},
doi = {10.4230/LIPICS.STACS.2009.1839},
timestamp = {Tue, 22 Jun 2021 15:43:57 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DemaineHMZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-1400,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Hamid Mahini and
Morteza Zadimoghaddam},
title = {The Price of Anarchy in Cooperative Network Creation Games},
journal = {CoRR},
volume = {abs/0902.1400},
year = {2009},
url = {http://arxiv.org/abs/0902.1400},
eprinttype = {arXiv},
eprint = {0902.1400},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-1400.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BadoiuDHSZ08,
author = {Mihai Badoiu and
Erik D. Demaine and
MohammadTaghi Hajiaghayi and
Anastasios Sidiropoulos and
Morteza Zadimoghaddam},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {21--34},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_3},
doi = {10.1007/978-3-540-85363-3\_3},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BadoiuDHSZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciss/KakhbodNZ08,
author = {Ali Kakhbod and
Ali Nazari and
Morteza Zadimoghaddam},
title = {Some notes on fix-free codes},
booktitle = {42nd Annual Conference on Information Sciences and Systems, {CISS}
2008, Princeton, NJ, USA, 19-21 March 2008},
pages = {1015--1018},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/CISS.2008.4558667},
doi = {10.1109/CISS.2008.4558667},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/ciss/KakhbodNZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/GhodsiMMZ08,
author = {Mohammad Ghodsi and
Hamid Mahini and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
editor = {Lance Fortnow and
John Riedl and
Tuomas Sandholm},
title = {Permutation betting markets: singleton betting with extra information},
booktitle = {Proceedings 9th {ACM} Conference on Electronic Commerce (EC-2008),
Chicago, IL, USA, June 8-12, 2008},
pages = {180--189},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1386790.1386821},
doi = {10.1145/1386790.1386821},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/GhodsiMMZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GhodsiMMGSZ07,
author = {Mohammad Ghodsi and
Hamid Mahini and
Kian Mirjalali and
Shayan Oveis Gharan and
Amin S. Sayedi{-}Roshkhar and
Morteza Zadimoghaddam},
title = {Spanning trees with minimum weighted degrees},
journal = {Inf. Process. Lett.},
volume = {104},
number = {3},
pages = {113--116},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.06.011},
doi = {10.1016/J.IPL.2007.06.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GhodsiMMGSZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/DemaineHMZ07,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
Hamid Mahini and
Morteza Zadimoghaddam},
editor = {Indranil Gupta and
Roger Wattenhofer},
title = {The price of anarchy in network creation games},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2007, Portland, Oregon, USA, August
12-15, 2007},
pages = {292--298},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1281100.1281142},
doi = {10.1145/1281100.1281142},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/DemaineHMZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DemaineHMSOZ07,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Hamid Mahini and
Amin S. Sayedi{-}Roshkhar and
Shayan Oveis Gharan and
Morteza Zadimoghaddam},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Minimizing movement},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {258--267},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283411},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/DemaineHMSOZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/DemaineGHSZ07,
author = {Erik D. Demaine and
Mohammad Ghodsi and
Mohammad Taghi Hajiaghayi and
Amin S. Sayedi{-}Roshkhar and
Morteza Zadimoghaddam},
editor = {Phillip B. Gibbons and
Christian Scheideler},
title = {Scheduling to minimize gaps and power consumption},
booktitle = {{SPAA} 2007: Proceedings of the 19th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, San Diego, California, USA, June
9-11, 2007},
pages = {46--54},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1248377.1248385},
doi = {10.1145/1248377.1248385},
timestamp = {Wed, 21 Nov 2018 11:13:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/DemaineGHSZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-02-07 03:49 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:
