default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaris Angelidakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Haris Angelidakis, Dylan Hyatt-Denesik
, Laura Sanità:
Node connectivity augmentation via iterative randomized rounding. Math. Program. 199(1): 995-1031 (2023)- 2022
- [j1]Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A technique for obtaining true approximations for k-center with covering constraints. Math. Program. 192(1): 3-27 (2022) - [c8]Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen:
Fair and Fast k-Center Clustering for Data Summarization. ICML 2022: 669-702 - 2021
- [c7]Georg Anegg, Haris Angelidakis, Rico Zenklusen:
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. SOSA 2021: 196-203 - [i8]Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità:
Node Connectivity Augmentation via Iterative Randomized Rounding. CoRR abs/2108.02041 (2021) - [i7]Haris Angelidakis, Ivan Sergeev, Pontus Westermark:
Improved approximation algorithms for two Euclidean k-Center variants. CoRR abs/2112.05083 (2021) - 2020
- [c6]Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. IPCO 2020: 52-65 - [i6]Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. CoRR abs/2007.03946 (2020) - [i5]Georg Anegg, Haris Angelidakis, Rico Zenklusen:
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. CoRR abs/2009.00697 (2020)
2010 – 2019
- 2019
- [c5]Haris Angelidakis, Pranjal Awasthi, Avrim Blum, Vaggos Chatziafratis, Chen Dan:
Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem. ESA 2019: 7:1-7:16 - 2018
- [i4]Haris Angelidakis:
Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings. CoRR abs/1807.09389 (2018) - [i3]Haris Angelidakis, Pranjal Awasthi, Avrim Blum, Vaggos Chatziafratis, Chen Dan:
Bilu-Linial stability, certified algorithms and the Independent Set problem. CoRR abs/1810.08414 (2018) - 2017
- [c4]Haris Angelidakis, Yury Makarychev, Pasin Manurangsi:
An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut. IPCO 2017: 39-50 - [c3]Haris Angelidakis, Yury Makarychev, Vsevolod Oparin:
Algorithmic and Hardness Results for the Hub Labeling Problem. SODA 2017: 1442-1461 - [c2]Haris Angelidakis, Konstantin Makarychev, Yury Makarychev:
Algorithms for stable and perturbation-resilient problems. STOC 2017: 438-451 - 2016
- [i2]Haris Angelidakis, Yury Makarychev, Pasin Manurangsi:
An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut. CoRR abs/1611.05530 (2016) - [i1]Haris Angelidakis, Yury Makarychev, Vsevolod Oparin:
Algorithmic and Hardness Results for the Hub Labeling Problem. CoRR abs/1611.06605 (2016) - 2013
- [c1]Haris Angelidakis, Dimitris Fotakis, Thanasis Lianeas:
Stochastic Congestion Games with Risk-Averse Players. SAGT 2013: 86-97
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:00 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:
