Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jan Vondrák
@article{DBLP:journals/corr/abs-2402-14173,
author = {Shahar Dobzinski and
Sigal Oren and
Jan Vondr{\'{a}}k},
title = {Fairness and Incentive Compatibility via Percentage Fees},
journal = {CoRR},
volume = {abs/2402.14173},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.14173},
doi = {10.48550/ARXIV.2402.14173},
eprinttype = {arXiv},
eprint = {2402.14173},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-14173.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HenzingerLVZ23,
author = {Monika Henzinger and
Paul Liu and
Jan Vondr{\'{a}}k and
Da Wei Zheng},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Faster Submodular Maximization for Several Classes of Matroids},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {74:1--74:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.74},
doi = {10.4230/LIPICS.ICALP.2023.74},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/HenzingerLVZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/NutiV23,
author = {Pranav Nuti and
Jan Vondr{\'{a}}k},
editor = {Alberto Del Pia and
Volker Kaibel},
title = {Towards an Optimal Contention Resolution Scheme for Matchings},
booktitle = {Integer Programming and Combinatorial Optimization - 24th International
Conference, {IPCO} 2023, Madison, WI, USA, June 21-23, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13904},
pages = {378--392},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-32726-1\_27},
doi = {10.1007/978-3-031-32726-1\_27},
timestamp = {Fri, 26 May 2023 10:40:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/NutiV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/DobzinskiOV23,
author = {Shahar Dobzinski and
Sigal Oren and
Jan Vondr{\'{a}}k},
editor = {Kevin Leyton{-}Brown and
Jason D. Hartline and
Larry Samuelson},
title = {Fairness and Incentive Compatibility via Percentage Fees},
booktitle = {Proceedings of the 24th {ACM} Conference on Economics and Computation,
{EC} 2023, London, United Kingdom, July 9-12, 2023},
pages = {517--535},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3580507.3597810},
doi = {10.1145/3580507.3597810},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/DobzinskiOV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BencsC0V23,
author = {Ferenc Bencs and
P{\'{e}}ter Csikv{\'{a}}ri and
Piyush Srivastava and
Jan Vondr{\'{a}}k},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {On complex roots of the independence polynomial},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {675--699},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch29},
doi = {10.1137/1.9781611977554.CH29},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BencsC0V23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/NutiV23,
author = {Pranav Nuti and
Jan Vondr{\'{a}}k},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Secretary Problems: The Power of a Single Sample},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2015--2029},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch77},
doi = {10.1137/1.9781611977554.CH77},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/NutiV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GargHLVV23,
author = {Jugal Garg and
Edin Husic and
Wenzheng Li and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh and
Jan Vondr{\'{a}}k},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Approximating Nash Social Welfare by Matching and Local Search},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1298--1310},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585255},
doi = {10.1145/3564246.3585255},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GargHLVV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-00122,
author = {Monika Henzinger and
Paul Liu and
Jan Vondr{\'{a}}k and
Da Wei Zheng},
title = {Faster Submodular Maximization for Several Classes of Matroids},
journal = {CoRR},
volume = {abs/2305.00122},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.00122},
doi = {10.48550/ARXIV.2305.00122},
eprinttype = {arXiv},
eprint = {2305.00122},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-00122.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-04656,
author = {Shahar Dobzinski and
Wenzheng Li and
Aviad Rubinstein and
Jan Vondr{\'{a}}k},
title = {A constant factor approximation for Nash social welfare with subadditive
valuations},
journal = {CoRR},
volume = {abs/2309.04656},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.04656},
doi = {10.48550/ARXIV.2309.04656},
eprinttype = {arXiv},
eprint = {2309.04656},
timestamp = {Fri, 15 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-04656.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KangPV22,
author = {Zi Yang Kang and
Francisco Pernice and
Jan Vondr{\'{a}}k},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Fixed-Price Approximations in Bilateral Trade},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {2964--2985},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.115},
doi = {10.1137/1.9781611977073.115},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/KangPV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DobzinskiRV22,
author = {Shahar Dobzinski and
Shiri Ron and
Jan Vondr{\'{a}}k},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {On the hardness of dominant strategy mechanism design},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {690--703},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520013},
doi = {10.1145/3519935.3520013},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DobzinskiRV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-04868,
author = {Ferenc Bencs and
P{\'{e}}ter Csikv{\'{a}}ri and
Piyush Srivastava and
Jan Vondr{\'{a}}k},
title = {On complex roots of the independence polynomial},
journal = {CoRR},
volume = {abs/2204.04868},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.04868},
doi = {10.48550/ARXIV.2204.04868},
eprinttype = {arXiv},
eprint = {2204.04868},
timestamp = {Thu, 21 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-04868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-00334,
author = {Shahar Dobzinski and
Shiri Ron and
Jan Vondr{\'{a}}k},
title = {On the Hardness of Dominant Strategy Mechanism Design},
journal = {CoRR},
volume = {abs/2206.00334},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.00334},
doi = {10.48550/ARXIV.2206.00334},
eprinttype = {arXiv},
eprint = {2206.00334},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-00334.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-09159,
author = {Pranav Nuti and
Jan Vondr{\'{a}}k},
title = {Secretary Problems: The Power of a Single Sample},
journal = {CoRR},
volume = {abs/2208.09159},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.09159},
doi = {10.48550/ARXIV.2208.09159},
eprinttype = {arXiv},
eprint = {2208.09159},
timestamp = {Mon, 22 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-09159.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03599,
author = {Pranav Nuti and
Jan Vondr{\'{a}}k},
title = {Towards an Optimal Contention Resolution Scheme for Matchings},
journal = {CoRR},
volume = {abs/2211.03599},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03599},
doi = {10.48550/ARXIV.2211.03599},
eprinttype = {arXiv},
eprint = {2211.03599},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03599.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03883,
author = {Jugal Garg and
Edin Husic and
Wenzheng Li and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh and
Jan Vondr{\'{a}}k},
title = {Approximating Nash Social Welfare by Matching and Local Search},
journal = {CoRR},
volume = {abs/2211.03883},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03883},
doi = {10.48550/ARXIV.2211.03883},
eprinttype = {arXiv},
eprint = {2211.03883},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03883.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiV21,
author = {Wenzheng Li and
Jan Vondr{\'{a}}k},
title = {A constant-factor approximation algorithm for Nash Social Welfare
with submodular valuations},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {25--36},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00012},
doi = {10.1109/FOCS52979.2021.00012},
timestamp = {Wed, 09 Mar 2022 12:12:23 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/LiuRVZ21,
author = {Paul Liu and
Aviad Rubinstein and
Jan Vondr{\'{a}}k and
Junyao Zhao},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Cardinality constrained submodular maximization for random streams},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {6491--6502},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/333222170ab9edca4785c39f55221fe7-Abstract.html},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/LiuRVZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LiV21,
author = {Wenzheng Li and
Jan Vondr{\'{a}}k},
editor = {D{\'{a}}niel Marx},
title = {Estimating the Nash Social Welfare for coverage and other submodular
valuations},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1119--1130},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.69},
doi = {10.1137/1.9781611976465.69},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/LiV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-02278,
author = {Wenzheng Li and
Jan Vondr{\'{a}}k},
title = {Estimating the Nash Social Welfare for coverage and other submodular
valuations},
journal = {CoRR},
volume = {abs/2101.02278},
year = {2021},
url = {https://arxiv.org/abs/2101.02278},
eprinttype = {arXiv},
eprint = {2101.02278},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-02278.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-10536,
author = {Wenzheng Li and
Jan Vondr{\'{a}}k},
title = {A constant-factor approximation algorithm for Nash Social Welfare
with submodular valuations},
journal = {CoRR},
volume = {abs/2103.10536},
year = {2021},
url = {https://arxiv.org/abs/2103.10536},
eprinttype = {arXiv},
eprint = {2103.10536},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-10536.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-14327,
author = {Zi Yang Kang and
Francisco Pernice and
Jan Vondr{\'{a}}k},
title = {Fixed-Price Approximations in Bilateral Trade},
journal = {CoRR},
volume = {abs/2107.14327},
year = {2021},
url = {https://arxiv.org/abs/2107.14327},
eprinttype = {arXiv},
eprint = {2107.14327},
timestamp = {Tue, 03 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-14327.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-07217,
author = {Paul Liu and
Aviad Rubinstein and
Jan Vondr{\'{a}}k and
Junyao Zhao},
title = {Cardinality constrained submodular maximization for random streams},
journal = {CoRR},
volume = {abs/2111.07217},
year = {2021},
url = {https://arxiv.org/abs/2111.07217},
eprinttype = {arXiv},
eprint = {2111.07217},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-07217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HarveyV20,
author = {Nicholas J. A. Harvey and
Jan Vondr{\'{a}}k},
title = {An Algorithmic Proof of the Lov{\'{a}}sz Local Lemma via Resampling
Oracles},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {2},
pages = {394--428},
year = {2020},
url = {https://doi.org/10.1137/18M1167176},
doi = {10.1137/18M1167176},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HarveyV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FeldmanKV20,
author = {Vitaly Feldman and
Pravesh Kothari and
Jan Vondr{\'{a}}k},
title = {Tight bounds on \emph{{\(\mathscr{l}\)}}\({}_{\mbox{1}}\) approximation
and learning of self-bounding functions},
journal = {Theor. Comput. Sci.},
volume = {808},
pages = {86--98},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.11.013},
doi = {10.1016/J.TCS.2019.11.013},
timestamp = {Fri, 31 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FeldmanKV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BadanidiyuruK0V20,
author = {Ashwinkumar Badanidiyuru and
Amin Karbasi and
Ehsan Kazemi and
Jan Vondr{\'{a}}k},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {Submodular Maximization Through Barrier Functions},
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/061412e4a03c02f9902576ec55ebbe77-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BadanidiyuruK0V20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiLV20,
author = {Wenzheng Li and
Paul Liu and
Jan Vondr{\'{a}}k},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {A polynomial lower bound on adaptive complexity of submodular maximization},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {140--152},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384311},
doi = {10.1145/3357713.3384311},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LiLV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-03523,
author = {Ashwinkumar Badanidiyuru and
Amin Karbasi and
Ehsan Kazemi and
Jan Vondr{\'{a}}k},
title = {Submodular Maximization Through Barrier Functions},
journal = {CoRR},
volume = {abs/2002.03523},
year = {2020},
url = {https://arxiv.org/abs/2002.03523},
eprinttype = {arXiv},
eprint = {2002.03523},
timestamp = {Wed, 12 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-03523.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-09130,
author = {Wenzheng Li and
Paul Liu and
Jan Vondr{\'{a}}k},
title = {A polynomial lower bound on adaptive complexity of submodular maximization},
journal = {CoRR},
volume = {abs/2002.09130},
year = {2020},
url = {https://arxiv.org/abs/2002.09130},
eprinttype = {arXiv},
eprint = {2002.09130},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-09130.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FeldmanV19,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
editor = {Alina Beygelzimer and
Daniel Hsu},
title = {High probability generalization bounds for uniformly stable algorithms
with nearly optimal rate},
booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
AZ, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {99},
pages = {1270--1279},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v99/feldman19a.html},
timestamp = {Mon, 08 Jul 2019 16:13:41 +0200},
biburl = {https://dblp.org/rec/conf/colt/FeldmanV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LiuV19,
author = {Paul Liu and
Jan Vondr{\'{a}}k},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Submodular Optimization in the MapReduce Model},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {18:1--18:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.18},
doi = {10.4230/OASICS.SOSA.2019.18},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/LiuV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-10710,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
title = {High probability generalization bounds for uniformly stable algorithms
with nearly optimal rate},
journal = {CoRR},
volume = {abs/1902.10710},
year = {2019},
url = {http://arxiv.org/abs/1902.10710},
eprinttype = {arXiv},
eprint = {1902.10710},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-10710.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/FeldmanV18,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
editor = {Samy Bengio and
Hanna M. Wallach and
Hugo Larochelle and
Kristen Grauman and
Nicol{\`{o}} Cesa{-}Bianchi and
Roman Garnett},
title = {Generalization Bounds for Uniformly Stable Algorithms},
booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
on Neural Information Processing Systems 2018, NeurIPS 2018, December
3-8, 2018, Montr{\'{e}}al, Canada},
pages = {9770--9780},
year = {2018},
url = {https://proceedings.neurips.cc/paper/2018/hash/05a624166c8eb8273b8464e8d9cb5bd9-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/FeldmanV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HarveySV18,
author = {Nicholas J. A. Harvey and
Piyush Srivastava and
Jan Vondr{\'{a}}k},
editor = {Artur Czumaj},
title = {Computing the Independence Polynomial: from the Tree Threshold down
to the Roots},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1557--1576},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.102},
doi = {10.1137/1.9781611975031.102},
timestamp = {Thu, 21 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/HarveySV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-01489,
author = {Paul Liu and
Jan Vondr{\'{a}}k},
title = {Submodular Optimization in the MapReduce Model},
journal = {CoRR},
volume = {abs/1810.01489},
year = {2018},
url = {http://arxiv.org/abs/1810.01489},
eprinttype = {arXiv},
eprint = {1810.01489},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-01489.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-09859,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
title = {Generalization Bounds for Uniformly Stable Algorithms},
journal = {CoRR},
volume = {abs/1812.09859},
year = {2018},
url = {http://arxiv.org/abs/1812.09859},
eprinttype = {arXiv},
eprint = {1812.09859},
timestamp = {Wed, 02 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-09859.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SviridenkoVW17,
author = {Maxim Sviridenko and
Jan Vondr{\'{a}}k and
Justin Ward},
title = {Optimal Approximation for Submodular and Supermodular Optimization
with Bounded Curvature},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1197--1218},
year = {2017},
url = {https://doi.org/10.1287/moor.2016.0842},
doi = {10.1287/MOOR.2016.0842},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SviridenkoVW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/FeldmanKV17,
author = {Vitaly Feldman and
Pravesh Kothari and
Jan Vondr{\'{a}}k},
editor = {Steve Hanneke and
Lev Reyzin},
title = {Tight Bounds on {\(\mathscr{l}\)}\({}_{\mbox{1}}\) Approximation and
Learning of Self-Bounding Functions},
booktitle = {International Conference on Algorithmic Learning Theory, {ALT} 2017,
15-17 October 2017, Kyoto University, Kyoto, Japan},
series = {Proceedings of Machine Learning Research},
volume = {76},
pages = {540--559},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v76/feldman17a.html},
timestamp = {Wed, 03 Apr 2019 18:17:23 +0200},
biburl = {https://dblp.org/rec/conf/alt/FeldmanKV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RoughgardenTV17,
author = {Tim Roughgarden and
Inbal Talgam{-}Cohen and
Jan Vondr{\'{a}}k},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {When Are Welfare Guarantees Robust?},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {22:1--22:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.22},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.22},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/RoughgardenTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChatziafratisRV17,
author = {Vaggos Chatziafratis and
Tim Roughgarden and
Jan Vondr{\'{a}}k},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Stability and Recovery for Independence Systems},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {26:1--26:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.26},
doi = {10.4230/LIPICS.ESA.2017.26},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/ChatziafratisRV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChatziafratisRV17,
author = {Vaggos Chatziafratis and
Tim Roughgarden and
Jan Vondr{\'{a}}k},
title = {Stability and Recovery for Independence Systems},
journal = {CoRR},
volume = {abs/1705.00127},
year = {2017},
url = {http://arxiv.org/abs/1705.00127},
eprinttype = {arXiv},
eprint = {1705.00127},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChatziafratisRV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DobzinskiV16,
author = {Shahar Dobzinski and
Jan Vondr{\'{a}}k},
title = {Impossibility Results for Truthful Combinatorial Auctions with Submodular
Valuations},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {5:1--5:19},
year = {2016},
url = {https://doi.org/10.1145/2786754},
doi = {10.1145/2786754},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DobzinskiV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanV16,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
title = {Optimal Bounds on Approximation of Submodular and {XOS} Functions
by Juntas},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {3},
pages = {1129--1170},
year = {2016},
url = {https://doi.org/10.1137/140958207},
doi = {10.1137/140958207},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeldmanV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HarveySV16,
author = {Nicholas J. A. Harvey and
Piyush Srivastava and
Jan Vondr{\'{a}}k},
title = {Computing the independence polynomial in Shearer's region for the
{LLL}},
journal = {CoRR},
volume = {abs/1608.02282},
year = {2016},
url = {http://arxiv.org/abs/1608.02282},
eprinttype = {arXiv},
eprint = {1608.02282},
timestamp = {Thu, 21 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HarveySV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RoughgardenTV16,
author = {Tim Roughgarden and
Inbal Talgam{-}Cohen and
Jan Vondr{\'{a}}k},
title = {When Are Welfare Guarantees Robust?},
journal = {CoRR},
volume = {abs/1608.02402},
year = {2016},
url = {http://arxiv.org/abs/1608.02402},
eprinttype = {arXiv},
eprint = {1608.02402},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RoughgardenTV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geb/DughmiV15,
author = {Shaddin Dughmi and
Jan Vondr{\'{a}}k},
title = {Limitations of randomized mechanisms for combinatorial auctions},
journal = {Games Econ. Behav.},
volume = {92},
pages = {370--400},
year = {2015},
url = {https://doi.org/10.1016/j.geb.2014.01.007},
doi = {10.1016/J.GEB.2014.01.007},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/geb/DughmiV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/MirzasoleimanBK15,
author = {Baharan Mirzasoleiman and
Ashwinkumar Badanidiyuru and
Amin Karbasi and
Jan Vondr{\'{a}}k and
Andreas Krause},
editor = {Blai Bonet and
Sven Koenig},
title = {Lazier Than Lazy Greedy},
booktitle = {Proceedings of the Twenty-Ninth {AAAI} Conference on Artificial Intelligence,
January 25-30, 2015, Austin, Texas, {USA}},
pages = {1812--1818},
publisher = {{AAAI} Press},
year = {2015},
url = {https://doi.org/10.1609/aaai.v29i1.9486},
doi = {10.1609/AAAI.V29I1.9486},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/MirzasoleimanBK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanV15,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
editor = {Venkatesan Guruswami},
title = {Tight Bounds on Low-Degree Spectral Concentration of Submodular and
{XOS} Functions},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {923--942},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.61},
doi = {10.1109/FOCS.2015.61},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HarveyV15,
author = {Nicholas J. A. Harvey and
Jan Vondr{\'{a}}k},
editor = {Venkatesan Guruswami},
title = {An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1327--1346},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.85},
doi = {10.1109/FOCS.2015.85},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HarveyV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChekuriJV15,
author = {Chandra Chekuri and
T. S. Jayram and
Jan Vondr{\'{a}}k},
editor = {Tim Roughgarden},
title = {On Multiplicative Weight Updates for Concave and Submodular Function
Maximization},
booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
pages = {201--210},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2688073.2688086},
doi = {10.1145/2688073.2688086},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ChekuriJV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/SingerV15,
author = {Yaron Singer and
Jan Vondr{\'{a}}k},
editor = {Corinna Cortes and
Neil D. Lawrence and
Daniel D. Lee and
Masashi Sugiyama and
Roman Garnett},
title = {Information-theoretic lower bounds for convex optimization with erroneous
oracles},
booktitle = {Advances in Neural Information Processing Systems 28: Annual Conference
on Neural Information Processing Systems 2015, December 7-12, 2015,
Montreal, Quebec, Canada},
pages = {3204--3212},
year = {2015},
url = {https://proceedings.neurips.cc/paper/2015/hash/393c55aea738548df743a186d15f3bef-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/SingerV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MirzakhaniV15,
author = {Maryam Mirzakhani and
Jan Vondr{\'{a}}k},
editor = {Piotr Indyk},
title = {Sperner's Colorings, Hypergraph Labeling Problems and Fair Division},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {873--886},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.60},
doi = {10.1137/1.9781611973730.60},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/MirzakhaniV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SviridenkoVW15,
author = {Maxim Sviridenko and
Jan Vondr{\'{a}}k and
Justin Ward},
editor = {Piotr Indyk},
title = {Optimal approximation for submodular and supermodular optimization
with bounded curvature},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1134--1148},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.76},
doi = {10.1137/1.9781611973730.76},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/SviridenkoVW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EneVW15,
author = {Alina Ene and
Jan Vondr{\'{a}}k and
Yi Wu},
title = {Local Distribution and the Symmetry Gap: Approximability of Multiway
Partitioning Problems},
journal = {CoRR},
volume = {abs/1503.03905},
year = {2015},
url = {http://arxiv.org/abs/1503.03905},
eprinttype = {arXiv},
eprint = {1503.03905},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EneVW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HarveyV15,
author = {Nicholas J. A. Harvey and
Jan Vondr{\'{a}}k},
title = {An Algorithmic Proof of the Lopsided Lovasz Local Lemma},
journal = {CoRR},
volume = {abs/1504.02044},
year = {2015},
url = {http://arxiv.org/abs/1504.02044},
eprinttype = {arXiv},
eprint = {1504.02044},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HarveyV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmanV15,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
title = {Tight Bounds on Low-degree Spectral Concentration of Submodular and
{XOS} functions},
journal = {CoRR},
volume = {abs/1504.03391},
year = {2015},
url = {http://arxiv.org/abs/1504.03391},
eprinttype = {arXiv},
eprint = {1504.03391},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmanV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SeshadhriV14,
author = {C. Seshadhri and
Jan Vondr{\'{a}}k},
title = {Is Submodularity Testable?},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {1--25},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9719-2},
doi = {10.1007/S00453-012-9719-2},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SeshadhriV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriVZ14,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k and
Rico Zenklusen},
title = {Submodular Function Maximization via the Multilinear Relaxation and
Contention Resolution Schemes},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {6},
pages = {1831--1879},
year = {2014},
url = {https://doi.org/10.1137/110839655},
doi = {10.1137/110839655},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriVZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EneV14,
author = {Alina Ene and
Jan Vondr{\'{a}}k},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex
Coloring Conjecture},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {144--159},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.144},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.144},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/EneV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/JayramV14,
author = {T. S. Jayram and
Jan Vondr{\'{a}}k},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Exchangeability and Realizability: De Finetti Theorems on Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {762--778},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.762},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.762},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/JayramV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ita/FeldmanV14,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
title = {Optimal bounds on approximation of submodular and {XOS} functions
by juntas},
booktitle = {2014 Information Theory and Applications Workshop, {ITA} 2014, San
Diego, CA, USA, February 9-14, 2014},
pages = {1--10},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/ITA.2014.6804263},
doi = {10.1109/ITA.2014.6804263},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/ita/FeldmanV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BadanidiyuruV14,
author = {Ashwinkumar Badanidiyuru and
Jan Vondr{\'{a}}k},
editor = {Chandra Chekuri},
title = {Fast algorithms for maximizing submodular functions},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1497--1514},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.110},
doi = {10.1137/1.9781611973402.110},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/BadanidiyuruV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SharmaV14,
author = {Ankit Sharma and
Jan Vondr{\'{a}}k},
editor = {David B. Shmoys},
title = {Multiway cut, pairwise realizable distributions, and descending thresholds},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {724--733},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591866},
doi = {10.1145/2591796.2591866},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SharmaV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmanKV14,
author = {Vitaly Feldman and
Pravesh Kothari and
Jan Vondr{\'{a}}k},
title = {Nearly Tight Bounds on {\(\mathscr{l}\)}\({}_{\mbox{1}}\) Approximation
of Self-Bounding Functions},
journal = {CoRR},
volume = {abs/1404.4702},
year = {2014},
url = {http://arxiv.org/abs/1404.4702},
eprinttype = {arXiv},
eprint = {1404.4702},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmanKV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MirzasoleimanBKVK14,
author = {Baharan Mirzasoleiman and
Ashwinkumar Badanidiyuru and
Amin Karbasi and
Jan Vondr{\'{a}}k and
Andreas Krause},
title = {Lazier Than Lazy Greedy},
journal = {CoRR},
volume = {abs/1409.7938},
year = {2014},
url = {http://arxiv.org/abs/1409.7938},
eprinttype = {arXiv},
eprint = {1409.7938},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MirzasoleimanBKVK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GharanV13,
author = {Shayan Oveis Gharan and
Jan Vondr{\'{a}}k},
title = {On Variants of the Matroid Secretary Problem},
journal = {Algorithmica},
volume = {67},
number = {4},
pages = {472--497},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9795-y},
doi = {10.1007/S00453-013-9795-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GharanV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/KimelfeldVW13,
author = {Benny Kimelfeld and
Jan Vondr{\'{a}}k and
David P. Woodruff},
title = {Multi-Tuple Deletion Propagation: Approximations and Complexity},
journal = {Proc. {VLDB} Endow.},
volume = {6},
number = {13},
pages = {1558--1569},
year = {2013},
url = {http://www.vldb.org/pvldb/vol6/p1558-kimelfeld.pdf},
doi = {10.14778/2536258.2536267},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/KimelfeldVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vondrak13,
author = {Jan Vondr{\'{a}}k},
title = {Symmetry and Approximability of Submodular Maximization Problems},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {1},
pages = {265--304},
year = {2013},
url = {https://doi.org/10.1137/110832318},
doi = {10.1137/110832318},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Vondrak13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeeSV13,
author = {Jon Lee and
Maxim Sviridenko and
Jan Vondr{\'{a}}k},
title = {Matroid Matching: The Power of Local Search},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {1},
pages = {357--379},
year = {2013},
url = {https://doi.org/10.1137/11083232X},
doi = {10.1137/11083232X},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LeeSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigecom/FeldmanV13,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
title = {Structure and learning of valuation functions},
journal = {SIGecom Exch.},
volume = {12},
number = {2},
pages = {50--53},
year = {2013},
url = {https://doi.org/10.1145/2692359.2692371},
doi = {10.1145/2692359.2692371},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigecom/FeldmanV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FeldmanKV13,
author = {Vitaly Feldman and
Pravesh Kothari and
Jan Vondr{\'{a}}k},
editor = {Shai Shalev{-}Shwartz and
Ingo Steinwart},
title = {Representation, Approximation and Learning of Submodular Functions
Using Low-rank Decision Trees},
booktitle = {{COLT} 2013 - The 26th Annual Conference on Learning Theory, June
12-14, 2013, Princeton University, NJ, {USA}},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {30},
pages = {711--740},
publisher = {JMLR.org},
year = {2013},
url = {http://proceedings.mlr.press/v30/Feldman13.html},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/conf/colt/FeldmanKV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edbt/EltabakhOSHPV13,
author = {Mohamed Y. Eltabakh and
Fatma {\"{O}}zcan and
Yannis Sismanis and
Peter J. Haas and
Hamid Pirahesh and
Jan Vondr{\'{a}}k},
editor = {Giovanna Guerrini and
Norman W. Paton},
title = {Eagle-eyed elephant: split-oriented indexing in Hadoop},
booktitle = {Joint 2013 {EDBT/ICDT} Conferences, {EDBT} '13 Proceedings, Genoa,
Italy, March 18-22, 2013},
pages = {89--100},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2452376.2452388},
doi = {10.1145/2452376.2452388},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/edbt/EltabakhOSHPV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanV13,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
title = {Optimal Bounds on Approximation of Submodular and {XOS} Functions
by Juntas},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {227--236},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.32},
doi = {10.1109/FOCS.2013.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EneVW13,
author = {Alina Ene and
Jan Vondr{\'{a}}k and
Yi Wu},
editor = {Sanjeev Khanna},
title = {Local Distribution and the Symmetry Gap: Approximability of Multiway
Partitioning Problems},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {306--325},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.23},
doi = {10.1137/1.9781611973105.23},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/EneVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DobzinskiV13,
author = {Shahar Dobzinski and
Jan Vondr{\'{a}}k},
editor = {Sanjeev Khanna},
title = {Communication Complexity of Combinatorial Auctions with Submodular
Valuations},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {1205--1215},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.87},
doi = {10.1137/1.9781611973105.87},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DobzinskiV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KapralovPV13,
author = {Michael Kapralov and
Ian Post and
Jan Vondr{\'{a}}k},
editor = {Sanjeev Khanna},
title = {Online Submodular Welfare Maximization: Greedy is Optimal},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {1216--1225},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.88},
doi = {10.1137/1.9781611973105.88},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KapralovPV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-0730,
author = {Vitaly Feldman and
Pravesh Kothari and
Jan Vondr{\'{a}}k},
title = {Representation, Approximation and Learning of Submodular Functions
Using Low-rank Decision Trees},
journal = {CoRR},
volume = {abs/1304.0730},
year = {2013},
url = {http://arxiv.org/abs/1304.0730},
eprinttype = {arXiv},
eprint = {1304.0730},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-0730.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmanV13,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
title = {Optimal Bounds on Approximation of Submodular and {XOS} Functions
by Juntas},
journal = {CoRR},
volume = {abs/1307.3301},
year = {2013},
url = {http://arxiv.org/abs/1307.3301},
eprinttype = {arXiv},
eprint = {1307.3301},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmanV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SharmaV13,
author = {Ankit Sharma and
Jan Vondr{\'{a}}k},
title = {Multiway Cut, the Golden Ratio, and Descending Thresholds},
journal = {CoRR},
volume = {abs/1309.2729},
year = {2013},
url = {http://arxiv.org/abs/1309.2729},
eprinttype = {arXiv},
eprint = {1309.2729},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SharmaV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/KimelfeldVW12,
author = {Benny Kimelfeld and
Jan Vondr{\'{a}}k and
Ryan Williams},
title = {Maximizing Conjunctive Views in Deletion Propagation},
journal = {{ACM} Trans. Database Syst.},
volume = {37},
number = {4},
pages = {24:1--24:37},
year = {2012},
url = {https://doi.org/10.1145/2389241.2389243},
doi = {10.1145/2389241.2389243},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tods/KimelfeldVW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/DobzinskiV12,
author = {Shahar Dobzinski and
Jan Vondr{\'{a}}k},
editor = {Boi Faltings and
Kevin Leyton{-}Brown and
Panos Ipeirotis},
title = {The computational complexity of truthfulness in combinatorial auctions},
booktitle = {Proceedings of the 13th {ACM} Conference on Electronic Commerce, {EC}
2012, Valencia, Spain, June 4-8, 2012},
pages = {405--422},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2229012.2229044},
doi = {10.1145/2229012.2229044},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/DobzinskiV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DobzinskiV12,
author = {Shahar Dobzinski and
Jan Vondr{\'{a}}k},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {From query complexity to computational complexity},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {1107--1116},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214076},
doi = {10.1145/2213977.2214076},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DobzinskiV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2789,
author = {Shahar Dobzinski and
Jan Vondr{\'{a}}k},
title = {The Computational Complexity of Truthfulness in Combinatorial Auctions},
journal = {CoRR},
volume = {abs/1202.2789},
year = {2012},
url = {http://arxiv.org/abs/1202.2789},
eprinttype = {arXiv},
eprint = {1202.2789},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-2789.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2792,
author = {Shahar Dobzinski and
Jan Vondr{\'{a}}k},
title = {On the Hardness of Welfare Maximization in Combinatorial Auctions
with Submodular Valuations},
journal = {CoRR},
volume = {abs/1202.2792},
year = {2012},
url = {http://arxiv.org/abs/1202.2792},
eprinttype = {arXiv},
eprint = {1202.2792},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-2792.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-1025,
author = {Mikhail Kapralov and
Ian Post and
Jan Vondr{\'{a}}k},
title = {Online and stochastic variants of welfare maximization},
journal = {CoRR},
volume = {abs/1204.1025},
year = {2012},
url = {http://arxiv.org/abs/1204.1025},
eprinttype = {arXiv},
eprint = {1204.1025},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-1025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeMV11,
author = {Uriel Feige and
Vahab S. Mirrokni and
Jan Vondr{\'{a}}k},
title = {Maximizing Non-monotone Submodular Functions},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {4},
pages = {1133--1153},
year = {2011},
url = {https://doi.org/10.1137/090779346},
doi = {10.1137/090779346},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FeigeMV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CalinescuCPV11,
author = {Gruia C{\u{a}}linescu and
Chandra Chekuri and
Martin P{\'{a}}l and
Jan Vondr{\'{a}}k},
title = {Maximizing a Monotone Submodular Function Subject to a Matroid Constraint},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {6},
pages = {1740--1766},
year = {2011},
url = {https://doi.org/10.1137/080733991},
doi = {10.1137/080733991},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CalinescuCPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GharanV11,
author = {Shayan Oveis Gharan and
Jan Vondr{\'{a}}k},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {On Variants of the Matroid Secretary Problem},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {335--346},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_29},
doi = {10.1007/978-3-642-23719-5\_29},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/GharanV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DughmiV11,
author = {Shaddin Dughmi and
Jan Vondr{\'{a}}k},
editor = {Rafail Ostrovsky},
title = {Limitations of Randomized Mechanisms for Combinatorial Auctions},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {502--511},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.64},
doi = {10.1109/FOCS.2011.64},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DughmiV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/SeshadhriV11,
author = {C. Seshadhri and
Jan Vondr{\'{a}}k},
editor = {Bernard Chazelle},
title = {Is Submodularity Testable?},
booktitle = {Innovations in Computer Science - {ICS} 2011, Tsinghua University,
Beijing, China, January 7-9, 2011. Proceedings},
pages = {195--210},
publisher = {Tsinghua University Press},
year = {2011},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/21.html},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/SeshadhriV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/KimelfeldVW11,
author = {Benny Kimelfeld and
Jan Vondr{\'{a}}k and
Ryan Williams},
editor = {Maurizio Lenzerini and
Thomas Schwentick},
title = {Maximizing conjunctive views in deletion propagation},
booktitle = {Proceedings of the 30th {ACM} {SIGMOD-SIGACT-SIGART} Symposium on
Principles of Database Systems, {PODS} 2011, June 12-16, 2011, Athens,
Greece},
pages = {187--198},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1989284.1989308},
doi = {10.1145/1989284.1989308},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/KimelfeldVW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriVZ11,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k and
Rico Zenklusen},
editor = {Dana Randall},
title = {Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1080--1097},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.82},
doi = {10.1137/1.9781611973082.82},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriVZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GharanV11,
author = {Shayan Oveis Gharan and
Jan Vondr{\'{a}}k},
editor = {Dana Randall},
title = {Submodular Maximization by Simulated Annealing},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1098--1116},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.83},
doi = {10.1137/1.9781611973082.83},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GharanV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/VondrakCZ11,
author = {Jan Vondr{\'{a}}k and
Chandra Chekuri and
Rico Zenklusen},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Submodular function maximization via the multilinear relaxation and
contention resolution schemes},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {783--792},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993740},
doi = {10.1145/1993636.1993740},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/VondrakCZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vlds/CohenKKV11,
author = {Sara Cohen and
Benny Kimelfeld and
Georgia Koutrika and
Jan Vondr{\'{a}}k},
editor = {Marco Brambilla and
Fabio Casati and
Stefano Ceri},
title = {On Principles of Egocentric Person Search in Social Networks},
booktitle = {Proceedings of the First International Workshop on Searching and Integrating
New Web Data Sources - Very Large Data Search, Seattle, WA, USA, September
2, 2011},
series = {{CEUR} Workshop Proceedings},
volume = {880},
pages = {3--6},
publisher = {CEUR-WS.org},
year = {2011},
url = {https://ceur-ws.org/Vol-880/VLDS-p03-Cohen.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:44 +0100},
biburl = {https://dblp.org/rec/conf/vlds/CohenKKV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4081,
author = {Shayan Oveis Gharan and
Jan Vondr{\'{a}}k},
title = {On Variants of the Matroid Secretary Problem},
journal = {CoRR},
volume = {abs/1104.4081},
year = {2011},
url = {http://arxiv.org/abs/1104.4081},
eprinttype = {arXiv},
eprint = {1104.4081},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-4593,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k and
Rico Zenklusen},
title = {Submodular Function Maximization via the Multilinear Relaxation and
Contention Resolution Schemes},
journal = {CoRR},
volume = {abs/1105.4593},
year = {2011},
url = {http://arxiv.org/abs/1105.4593},
eprinttype = {arXiv},
eprint = {1105.4593},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-4593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-1053,
author = {Shaddin Dughmi and
Tim Roughgarden and
Jan Vondr{\'{a}}k and
Qiqi Yan},
title = {An approximately truthful-in-expectation mechanism for combinatorial
auctions using value queries},
journal = {CoRR},
volume = {abs/1109.1053},
year = {2011},
url = {http://arxiv.org/abs/1109.1053},
eprinttype = {arXiv},
eprint = {1109.1053},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-1053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-1055,
author = {Shaddin Dughmi and
Jan Vondr{\'{a}}k},
title = {Limitations of randomized mechanisms for combinatorial auctions},
journal = {CoRR},
volume = {abs/1109.1055},
year = {2011},
url = {http://arxiv.org/abs/1109.1055},
eprinttype = {arXiv},
eprint = {1109.1055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-1055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-4860,
author = {Jan Vondr{\'{a}}k},
title = {Symmetry and approximability of submodular maximization problems},
journal = {CoRR},
volume = {abs/1110.4860},
year = {2011},
url = {http://arxiv.org/abs/1110.4860},
eprinttype = {arXiv},
eprint = {1110.4860},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-4860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SudakovV10,
author = {Benny Sudakov and
Jan Vondr{\'{a}}k},
title = {A randomized embedding algorithm for trees},
journal = {Comb.},
volume = {30},
number = {4},
pages = {445--470},
year = {2010},
url = {https://doi.org/10.1007/s00493-010-2422-5},
doi = {10.1007/S00493-010-2422-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/SudakovV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LeeSV10,
author = {Jon Lee and
Maxim Sviridenko and
Jan Vondr{\'{a}}k},
title = {Submodular Maximization over Multiple Matroids via Generalized Exchange
Properties},
journal = {Math. Oper. Res.},
volume = {35},
number = {4},
pages = {795--806},
year = {2010},
url = {https://doi.org/10.1287/moor.1100.0463},
doi = {10.1287/MOOR.1100.0463},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/LeeSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/FeigeV10,
author = {Uriel Feige and
Jan Vondr{\'{a}}k},
title = {The Submodular Welfare Problem with Demand Queries},
journal = {Theory Comput.},
volume = {6},
number = {1},
pages = {247--290},
year = {2010},
url = {https://doi.org/10.4086/toc.2010.v006a011},
doi = {10.4086/TOC.2010.V006A011},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/FeigeV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriVZ10,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k and
Rico Zenklusen},
title = {Dependent Randomized Rounding via Exchange Properties of Combinatorial
Structures},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {575--584},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.60},
doi = {10.1109/FOCS.2010.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriVZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeSV10,
author = {Jon Lee and
Maxim Sviridenko and
Jan Vondr{\'{a}}k},
editor = {Leonard J. Schulman},
title = {Matroid matching: the power of local search},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {369--378},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806741},
doi = {10.1145/1806689.1806741},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LeeSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1005-2791,
author = {Jan Vondr{\'{a}}k},
title = {A note on concentration of submodular functions},
journal = {CoRR},
volume = {abs/1005.2791},
year = {2010},
url = {http://arxiv.org/abs/1005.2791},
eprinttype = {arXiv},
eprint = {1005.2791},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1005-2791.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1632,
author = {Shayan Oveis Gharan and
Jan Vondr{\'{a}}k},
title = {Submodular Maximization by Simulated Annealing},
journal = {CoRR},
volume = {abs/1007.1632},
year = {2010},
url = {http://arxiv.org/abs/1007.1632},
eprinttype = {arXiv},
eprint = {1007.1632},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-1632.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-0831,
author = {C. Seshadhri and
Jan Vondr{\'{a}}k},
title = {Is submodularity testable?},
journal = {CoRR},
volume = {abs/1008.0831},
year = {2010},
url = {http://arxiv.org/abs/1008.0831},
eprinttype = {arXiv},
eprint = {1008.0831},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-0831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CalinescuCV09,
author = {Gruia C{\u{a}}linescu and
Chandra Chekuri and
Jan Vondr{\'{a}}k},
title = {Disjoint bases in a polymatroid},
journal = {Random Struct. Algorithms},
volume = {35},
number = {4},
pages = {418--430},
year = {2009},
url = {https://doi.org/10.1002/rsa.20274},
doi = {10.1002/RSA.20274},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CalinescuCV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/SankarVP09,
author = {Lalitha Sankar and
Jan Vondr{\'{a}}k and
H. Vincent Poor},
title = {K-user fading interference channels: The ergodic very strong case},
booktitle = {47th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009},
pages = {82--87},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/ALLERTON.2009.5394846},
doi = {10.1109/ALLERTON.2009.5394846},
timestamp = {Wed, 29 Nov 2023 20:15:57 +0100},
biburl = {https://dblp.org/rec/conf/allerton/SankarVP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LeeSV09,
author = {Jon Lee and
Maxim Sviridenko and
Jan Vondr{\'{a}}k},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Submodular Maximization over Multiple Matroids via Generalized Exchange
Properties},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {244--257},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_19},
doi = {10.1007/978-3-642-03685-9\_19},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/LeeSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Vondrak09,
author = {Jan Vondr{\'{a}}k},
title = {Symmetry and Approximability of Submodular Maximization Problems},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {651--670},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.24},
doi = {10.1109/FOCS.2009.24},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Vondrak09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-4348,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k},
title = {Randomized Pipage Rounding for Matroid Polytopes and Applications},
journal = {CoRR},
volume = {abs/0909.4348},
year = {2009},
url = {http://arxiv.org/abs/0909.4348},
eprinttype = {arXiv},
eprint = {0909.4348},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-4348.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-4874,
author = {Lalitha Sankar and
Jan Vondr{\'{a}}k and
H. Vincent Poor},
title = {K-User Fading Interference Channels: The Ergodic Very Strong Case},
journal = {CoRR},
volume = {abs/0910.4874},
year = {2009},
url = {http://arxiv.org/abs/0910.4874},
eprinttype = {arXiv},
eprint = {0910.4874},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-4874.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DeanGV08,
author = {Brian C. Dean and
Michel X. Goemans and
Jan Vondr{\'{a}}k},
title = {Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity},
journal = {Math. Oper. Res.},
volume = {33},
number = {4},
pages = {945--964},
year = {2008},
url = {https://doi.org/10.1287/moor.1080.0330},
doi = {10.1287/MOOR.1080.0330},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/DeanGV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/SudakovV08,
author = {Benny Sudakov and
Jan Vondr{\'{a}}k},
title = {How many random edges make a dense hypergraph non-2-colorable?},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {290--306},
year = {2008},
url = {https://doi.org/10.1002/rsa.25155},
doi = {10.1002/RSA.25155},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/SudakovV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/MirrokniSV08,
author = {Vahab S. Mirrokni and
Michael Schapira and
Jan Vondr{\'{a}}k},
editor = {Lance Fortnow and
John Riedl and
Tuomas Sandholm},
title = {Tight information-theoretic lower bounds for welfare maximization
in combinatorial auctions},
booktitle = {Proceedings 9th {ACM} Conference on Electronic Commerce (EC-2008),
Chicago, IL, USA, June 8-12, 2008},
pages = {70--77},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1386790.1386805},
doi = {10.1145/1386790.1386805},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/MirrokniSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Vondrak08,
author = {Jan Vondr{\'{a}}k},
editor = {Cynthia Dwork},
title = {Optimal approximation for the submodular welfare problem in the value
oracle model},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {67--74},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374389},
doi = {10.1145/1374376.1374389},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Vondrak08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Vondrak07,
author = {Jan Vondr{\'{a}}k},
title = {Shortest-path metric approximation for random subgraphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {95--104},
year = {2007},
url = {https://doi.org/10.1002/rsa.20150},
doi = {10.1002/RSA.20150},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Vondrak07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeMV07,
author = {Uriel Feige and
Vahab S. Mirrokni and
Jan Vondr{\'{a}}k},
title = {Maximizing Non-Monotone Submodular Functions},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {461--471},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.29},
doi = {10.1109/FOCS.2007.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeigeMV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CalinescuCPV07,
author = {Gruia C{\u{a}}linescu and
Chandra Chekuri and
Martin P{\'{a}}l and
Jan Vondr{\'{a}}k},
editor = {Matteo Fischetti and
David P. Williamson},
title = {Maximizing a Submodular Set Function Subject to a Matroid Constraint
(Extended Abstract)},
booktitle = {Integer Programming and Combinatorial Optimization, 12th International
{IPCO} Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4513},
pages = {182--196},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72792-7\_15},
doi = {10.1007/978-3-540-72792-7\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CalinescuCPV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/PachRV06,
author = {J{\'{a}}nos Pach and
Rados Radoicic and
Jan Vondr{\'{a}}k},
title = {Nearly equal distances and Szemer{\'{e}}di's regularity lemma},
journal = {Comput. Geom.},
volume = {34},
number = {1},
pages = {11--19},
year = {2006},
url = {https://doi.org/10.1016/j.comgeo.2005.06.002},
doi = {10.1016/J.COMGEO.2005.06.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/PachRV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/PachRV06,
author = {J{\'{a}}nos Pach and
Rados Radoicic and
Jan Vondr{\'{a}}k},
title = {On the diameter of separated point sets with many nearly equal distances},
journal = {Eur. J. Comb.},
volume = {27},
number = {8},
pages = {1321--1332},
year = {2006},
url = {https://doi.org/10.1016/j.ejc.2006.05.007},
doi = {10.1016/J.EJC.2006.05.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/PachRV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AlonRSV06,
author = {Noga Alon and
Rados Radoicic and
Benny Sudakov and
Jan Vondr{\'{a}}k},
title = {A Ramsey-type result for the hypercube},
journal = {J. Graph Theory},
volume = {53},
number = {3},
pages = {196--208},
year = {2006},
url = {https://doi.org/10.1002/jgt.20181},
doi = {10.1002/JGT.20181},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AlonRSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoemansV06,
author = {Michel X. Goemans and
Jan Vondr{\'{a}}k},
title = {Covering minimum spanning trees of random subgraphs},
journal = {Random Struct. Algorithms},
volume = {29},
number = {3},
pages = {257--276},
year = {2006},
url = {https://doi.org/10.1002/rsa.20115},
doi = {10.1002/RSA.20115},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GoemansV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeV06,
author = {Uriel Feige and
Jan Vondr{\'{a}}k},
title = {Approximation algorithms for allocation problems: Improving the factor
of 1 - 1/e},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {667--676},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.14},
doi = {10.1109/FOCS.2006.14},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeigeV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GoemansV06,
author = {Michel X. Goemans and
Jan Vondr{\'{a}}k},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Stochastic Covering and Adaptivity},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {532--543},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_50},
doi = {10.1007/11682462\_50},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/GoemansV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DeanGV05,
author = {Brian C. Dean and
Michel X. Goemans and
Jan Vondr{\'{a}}k},
title = {Adaptivity and approximation for stochastic packing problems},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {395--404},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070487},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/DeanGV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DeanGV04,
author = {Brian C. Dean and
Michel X. Goemans and
Jan Vondr{\'{a}}k},
title = {Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {208--217},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.15},
doi = {10.1109/FOCS.2004.15},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DeanGV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoemansV04,
author = {Michel X. Goemans and
Jan Vondr{\'{a}}k},
editor = {J. Ian Munro},
title = {Covering minimum spanning trees of random subgraphs},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {934--941},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982933},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GoemansV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aam/ChowFGV03,
author = {Timothy Y. Chow and
C. Kenneth Fan and
Michel X. Goemans and
Jan Vondr{\'{a}}k},
title = {Wide partitions, Latin tableaux, and Rota's basis conjecture},
journal = {Adv. Appl. Math.},
volume = {31},
number = {2},
pages = {334--358},
year = {2003},
url = {https://doi.org/10.1016/S0196-8858(03)00015-0},
doi = {10.1016/S0196-8858(03)00015-0},
timestamp = {Wed, 07 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aam/ChowFGV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoeblV03,
author = {Martin Loebl and
Jan Vondr{\'{a}}k},
title = {Towards a theory of frustrated degeneracy},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {179--193},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00043-8},
doi = {10.1016/S0012-365X(03)00043-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LoeblV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SamalV01,
author = {Robert S{\'{a}}mal and
Jan Vondr{\'{a}}k},
title = {The limit checker number of a graph},
journal = {Discret. Math.},
volume = {235},
number = {1-3},
pages = {343--347},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00292-2},
doi = {10.1016/S0012-365X(00)00292-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SamalV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GalluccioLV01,
author = {Anna Galluccio and
Martin Loebl and
Jan Vondr{\'{a}}k},
title = {Optimization via enumeration: a new algorithm for the Max Cut Problem},
journal = {Math. Program.},
volume = {90},
number = {2},
pages = {273--290},
year = {2001},
url = {https://doi.org/10.1007/PL00011425},
doi = {10.1007/PL00011425},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/GalluccioLV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BabilonNPV99,
author = {Robert Babilon and
Helena Nyklov{\'{a}} and
Ondrej Pangr{\'{a}}c and
Jan Vondr{\'{a}}k},
editor = {Jan Kratochv{\'{\i}}l},
title = {Visibility Representations of Complete Graphs},
booktitle = {Graph Drawing, 7th International Symposium, GD'99, Stir{\'{\i}}n
Castle, Czech Republic, September 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1731},
pages = {333--340},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46648-7\_34},
doi = {10.1007/3-540-46648-7\_34},
timestamp = {Sun, 13 Nov 2022 09:57:36 +0100},
biburl = {https://dblp.org/rec/conf/gd/BabilonNPV99.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-04-21 18:27 CEST 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:
