BibTeX records: Haris Angelidakis

download as .bib file

@article{DBLP:journals/mp/AngelidakisHS23,
  author       = {Haris Angelidakis and
                  Dylan Hyatt{-}Denesik and
                  Laura Sanit{\`{a}}},
  title        = {Node connectivity augmentation via iterative randomized rounding},
  journal      = {Math. Program.},
  volume       = {199},
  number       = {1},
  pages        = {995--1031},
  year         = {2023},
  url          = {https://doi.org/10.1007/s10107-022-01854-z},
  doi          = {10.1007/S10107-022-01854-Z},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/AngelidakisHS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/AneggAKZ22,
  author       = {Georg Anegg and
                  Haris Angelidakis and
                  Adam Kurpisz and
                  Rico Zenklusen},
  title        = {A technique for obtaining true approximations for k-center with covering
                  constraints},
  journal      = {Math. Program.},
  volume       = {192},
  number       = {1},
  pages        = {3--27},
  year         = {2022},
  url          = {https://doi.org/10.1007/s10107-021-01645-y},
  doi          = {10.1007/S10107-021-01645-Y},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/AneggAKZ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icml/AngelidakisKSZ22,
  author       = {Haris Angelidakis and
                  Adam Kurpisz and
                  Leon Sering and
                  Rico Zenklusen},
  editor       = {Kamalika Chaudhuri and
                  Stefanie Jegelka and
                  Le Song and
                  Csaba Szepesv{\'{a}}ri and
                  Gang Niu and
                  Sivan Sabato},
  title        = {Fair and Fast k-Center Clustering for Data Summarization},
  booktitle    = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
                  2022, Baltimore, Maryland, {USA}},
  series       = {Proceedings of Machine Learning Research},
  volume       = {162},
  pages        = {669--702},
  publisher    = {{PMLR}},
  year         = {2022},
  url          = {https://proceedings.mlr.press/v162/angelidakis22a.html},
  timestamp    = {Sun, 06 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icml/AngelidakisKSZ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sosa/AneggAZ21,
  author       = {Georg Anegg and
                  Haris Angelidakis and
                  Rico Zenklusen},
  editor       = {Hung Viet Le and
                  Valerie King},
  title        = {Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching
                  and the F{\"{u}}redi, Kahn, and Seymour Conjecture},
  booktitle    = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
                  January 11-12, 2021},
  pages        = {196--203},
  publisher    = {{SIAM}},
  year         = {2021},
  url          = {https://doi.org/10.1137/1.9781611976496.22},
  doi          = {10.1137/1.9781611976496.22},
  timestamp    = {Wed, 17 Mar 2021 13:30:03 +0100},
  biburl       = {https://dblp.org/rec/conf/sosa/AneggAZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2108-02041,
  author       = {Haris Angelidakis and
                  Dylan Hyatt{-}Denesik and
                  Laura Sanit{\`{a}}},
  title        = {Node Connectivity Augmentation via Iterative Randomized Rounding},
  journal      = {CoRR},
  volume       = {abs/2108.02041},
  year         = {2021},
  url          = {https://arxiv.org/abs/2108.02041},
  eprinttype    = {arXiv},
  eprint       = {2108.02041},
  timestamp    = {Thu, 05 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2108-02041.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2112-05083,
  author       = {Haris Angelidakis and
                  Ivan Sergeev and
                  Pontus Westermark},
  title        = {Improved approximation algorithms for two Euclidean k-Center variants},
  journal      = {CoRR},
  volume       = {abs/2112.05083},
  year         = {2021},
  url          = {https://arxiv.org/abs/2112.05083},
  eprinttype    = {arXiv},
  eprint       = {2112.05083},
  timestamp    = {Mon, 13 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2112-05083.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ipco/AneggAKZ20,
  author       = {Georg Anegg and
                  Haris Angelidakis and
                  Adam Kurpisz and
                  Rico Zenklusen},
  editor       = {Daniel Bienstock and
                  Giacomo Zambelli},
  title        = {A Technique for Obtaining True Approximations for k-Center with Covering
                  Constraints},
  booktitle    = {Integer Programming and Combinatorial Optimization - 21st International
                  Conference, {IPCO} 2020, London, UK, June 8-10, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12125},
  pages        = {52--65},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-45771-6\_5},
  doi          = {10.1007/978-3-030-45771-6\_5},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ipco/AneggAKZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2007-03946,
  author       = {Georg Anegg and
                  Haris Angelidakis and
                  Adam Kurpisz and
                  Rico Zenklusen},
  title        = {A Technique for Obtaining True Approximations for k-Center with Covering
                  Constraints},
  journal      = {CoRR},
  volume       = {abs/2007.03946},
  year         = {2020},
  url          = {https://arxiv.org/abs/2007.03946},
  eprinttype    = {arXiv},
  eprint       = {2007.03946},
  timestamp    = {Mon, 20 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2007-03946.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2009-00697,
  author       = {Georg Anegg and
                  Haris Angelidakis and
                  Rico Zenklusen},
  title        = {Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching
                  and the F{\"{u}}redi, Kahn, and Seymour Conjecture},
  journal      = {CoRR},
  volume       = {abs/2009.00697},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.00697},
  eprinttype    = {arXiv},
  eprint       = {2009.00697},
  timestamp    = {Wed, 16 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-00697.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/AngelidakisABCD19,
  author       = {Haris Angelidakis and
                  Pranjal Awasthi and
                  Avrim Blum and
                  Vaggos Chatziafratis and
                  Chen Dan},
  editor       = {Michael A. Bender and
                  Ola Svensson and
                  Grzegorz Herman},
  title        = {Bilu-Linial Stability, Certified Algorithms and the Independent Set
                  Problem},
  booktitle    = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
                  9-11, 2019, Munich/Garching, Germany},
  series       = {LIPIcs},
  volume       = {144},
  pages        = {7:1--7:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2019.7},
  doi          = {10.4230/LIPICS.ESA.2019.7},
  timestamp    = {Mon, 07 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/AngelidakisABCD19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1807-09389,
  author       = {Haris Angelidakis},
  title        = {Shortest path queries, graph partitioning and covering problems in
                  worst and beyond worst case settings},
  journal      = {CoRR},
  volume       = {abs/1807.09389},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.09389},
  eprinttype    = {arXiv},
  eprint       = {1807.09389},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-09389.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1810-08414,
  author       = {Haris Angelidakis and
                  Pranjal Awasthi and
                  Avrim Blum and
                  Vaggos Chatziafratis and
                  Chen Dan},
  title        = {Bilu-Linial stability, certified algorithms and the Independent Set
                  problem},
  journal      = {CoRR},
  volume       = {abs/1810.08414},
  year         = {2018},
  url          = {http://arxiv.org/abs/1810.08414},
  eprinttype    = {arXiv},
  eprint       = {1810.08414},
  timestamp    = {Mon, 07 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1810-08414.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ipco/AngelidakisMM17,
  author       = {Haris Angelidakis and
                  Yury Makarychev and
                  Pasin Manurangsi},
  editor       = {Friedrich Eisenbrand and
                  Jochen K{\"{o}}nemann},
  title        = {An Improved Integrality Gap for the C{\u{a}}linescu-Karloff-Rabani
                  Relaxation for Multiway Cut},
  booktitle    = {Integer Programming and Combinatorial Optimization - 19th International
                  Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10328},
  pages        = {39--50},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-59250-3\_4},
  doi          = {10.1007/978-3-319-59250-3\_4},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/AngelidakisMM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/AngelidakisMO17,
  author       = {Haris Angelidakis and
                  Yury Makarychev and
                  Vsevolod Oparin},
  editor       = {Philip N. Klein},
  title        = {Algorithmic and Hardness Results for the Hub Labeling Problem},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {1442--1461},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.94},
  doi          = {10.1137/1.9781611974782.94},
  timestamp    = {Tue, 02 Feb 2021 17:07:33 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AngelidakisMO17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/AngelidakisMM17,
  author       = {Haris Angelidakis and
                  Konstantin Makarychev and
                  Yury Makarychev},
  editor       = {Hamed Hatami and
                  Pierre McKenzie and
                  Valerie King},
  title        = {Algorithms for stable and perturbation-resilient problems},
  booktitle    = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages        = {438--451},
  publisher    = {{ACM}},
  year         = {2017},
  url          = {https://doi.org/10.1145/3055399.3055487},
  doi          = {10.1145/3055399.3055487},
  timestamp    = {Sun, 02 Jun 2019 21:10:31 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/AngelidakisMM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/AngelidakisMM16,
  author       = {Haris Angelidakis and
                  Yury Makarychev and
                  Pasin Manurangsi},
  title        = {An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation
                  for Multiway Cut},
  journal      = {CoRR},
  volume       = {abs/1611.05530},
  year         = {2016},
  url          = {http://arxiv.org/abs/1611.05530},
  eprinttype    = {arXiv},
  eprint       = {1611.05530},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AngelidakisMM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/AngelidakisMO16,
  author       = {Haris Angelidakis and
                  Yury Makarychev and
                  Vsevolod Oparin},
  title        = {Algorithmic and Hardness Results for the Hub Labeling Problem},
  journal      = {CoRR},
  volume       = {abs/1611.06605},
  year         = {2016},
  url          = {http://arxiv.org/abs/1611.06605},
  eprinttype    = {arXiv},
  eprint       = {1611.06605},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AngelidakisMO16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sagt/AngelidakisFL13,
  author       = {Haris Angelidakis and
                  Dimitris Fotakis and
                  Thanasis Lianeas},
  editor       = {Berthold V{\"{o}}cking},
  title        = {Stochastic Congestion Games with Risk-Averse Players},
  booktitle    = {Algorithmic Game Theory - 6th International Symposium, {SAGT} 2013,
                  Aachen, Germany, October 21-23, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8146},
  pages        = {86--97},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-41392-6\_8},
  doi          = {10.1007/978-3-642-41392-6\_8},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sagt/AngelidakisFL13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.