default search action
Vaggos Chatziafratis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c21]Dmitrii Avdiukhin, Vaggos Chatziafratis, Konstantin Makarychev, Grigory Yaroslavtsev:
Approximation Scheme for Weighted Metric Clustering via Sherali-Adams. AAAI 2024: 7926-7934 - [c20]Vaggos Chatziafratis, Piotr Indyk:
Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. SOSA 2024: 230-243 - [i23]Vaggos Chatziafratis, Ishani Karmarkar, Ellen Vitercik:
From Large to Small Datasets: Size Generalization for Clustering Algorithm Selection. CoRR abs/2402.14332 (2024) - 2023
- [c19]Vaggos Chatziafratis, Konstantin Makarychev:
Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant. FOCS 2023: 253-284 - [c18]Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil V. Vlatakis-Gkaragkounis
, Vaggos Chatziafratis, Stelios Andrew Stavroulakis:
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. ICLR 2023 - [i22]Vaggos Chatziafratis, Piotr Indyk:
Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. CoRR abs/2312.13490 (2023) - 2022
- [c17]Clayton Hendrick Sanford, Vaggos Chatziafratis:
Expressivity of Neural Networks via Chaotic Itineraries beyond Sharkovsky's Theorem. AISTATS 2022: 9505-9549 - [c16]Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang:
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. COLT 2022: 4643-4702 - [c15]Vaggos Chatziafratis, Ioannis Panageas, Clayton Sanford, Stelios Stavroulakis:
On Scrambling Phenomena for Randomly Initialized Recurrent Networks. NeurIPS 2022 - [i21]Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab S. Mirrokni, Chen Wang:
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. CoRR abs/2206.07554 (2022) - [i20]Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Vaggos Chatziafratis, Stelios Stavroulakis:
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. CoRR abs/2208.02204 (2022) - [i19]Vaggos Chatziafratis, Ioannis Panageas, Clayton Sanford, Stelios Andrew Stavroulakis:
On Scrambling Phenomena for Randomly Initialized Recurrent Networks. CoRR abs/2210.05212 (2022) - [i18]Vaggos Chatziafratis, Konstantin Makarychev:
Phylogenetic CSPs are Approximation Resistant. CoRR abs/2212.12765 (2022) - 2021
- [c14]Danny Vainstein, Vaggos Chatziafratis, Gui Citovsky, Anand Rajagopalan, Mohammad Mahdian, Yossi Azar:
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. AISTATS 2021: 559-567 - [c13]Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian:
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT. AISTATS 2021: 1657-1665 - [c12]Pranjal Awasthi, Vaggos Chatziafratis, Xue Chen, Aravindan Vijayaraghavan:
Adversarially Robust Low Dimensional Representations. COLT 2021: 237-325 - [i17]Danny Vainstein, Vaggos Chatziafratis, Gui Citovsky, Anand Rajagopalan, Mohammad Mahdian, Yossi Azar:
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. CoRR abs/2101.10639 (2021) - [i16]Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian:
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT. CoRR abs/2102.11548 (2021) - [i15]Clayton Sanford, Vaggos Chatziafratis:
Expressivity of Neural Networks via Chaotic Itineraries beyond Sharkovsky's Theorem. CoRR abs/2110.10295 (2021) - 2020
- [c11]Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. AISTATS 2020: 3121-3132 - [c10]Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas, Xiao Wang:
Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem. ICLR 2020 - [c9]Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas:
Better depth-width trade-offs for neural networks through the lens of dynamical systems. ICML 2020: 1469-1478 - [c8]Ines Chami, Albert Gu, Vaggos Chatziafratis, Christopher Ré:
From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clustering. NeurIPS 2020 - [i14]Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas:
Better Depth-Width Trade-offs for Neural Networks through the lens of Dynamical Systems. CoRR abs/2003.00777 (2020) - [i13]Ines Chami, Albert Gu, Vaggos Chatziafratis, Christopher Ré:
From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clustering. CoRR abs/2010.00402 (2020) - [i12]Vaggos Chatziafratis, Neha Gupta, Euiwoong Lee:
Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering. CoRR abs/2010.01459 (2020)
2010 – 2019
- 2019
- [c7]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev:
Hierarchical Clustering for Euclidean Data. AISTATS 2019: 2721-2730 - [c6]Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang:
On the Computational Power of Online Gradient Descent. COLT 2019: 624-662 - [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 - [c4]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh:
Hierarchical Clustering better than Average-Linkage. SODA 2019: 2291-2304 - [i11]Pranjal Awasthi, Vaggos Chatziafratis, Xue Chen, Aravindan Vijayaraghavan:
Adversarially Robust Low Dimensional Representations. CoRR abs/1911.13268 (2019) - [i10]Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas, Xiao Wang:
Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem. CoRR abs/1912.04378 (2019) - [i9]Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. CoRR abs/1912.06983 (2019) - 2018
- [j1]Talha Cihad Gülcü
Attack Vulnerability of Power Systems Under an Equal Load Redistribution Model. IEEE/ACM Trans. Netw. 26(3): 1306-1319 (2018) - [c3]Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar:
Hierarchical Clustering with Structural Constraints. ICML 2018: 773-782 - [i8]Talha Cihad Gülcü, Vaggos Chatziafratis, Yingrui Zhang, Osman Yagan:
Attack vulnerability of power systems under an equal load redistribution model. CoRR abs/1804.01351 (2018) - [i7]Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar:
Hierarchical Clustering with Structural Constraints. CoRR abs/1805.09476 (2018) - [i6]Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang:
On the Computational Power of Online Gradient Descent. CoRR abs/1807.01280 (2018) - [i5]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh:
Hierarchical Clustering better than Average-Linkage. CoRR abs/1808.02227 (2018) - [i4]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) - [i3]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev:
Hierarchical Clustering for Euclidean Data. CoRR abs/1812.10582 (2018) - 2017
- [c2]Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák:
Stability and Recovery for Independence Systems. ESA 2017: 26:1-26:15 - [c1]Moses Charikar, Vaggos Chatziafratis:
Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics. SODA 2017: 841-854 - [i2]Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrák:
Stability and Recovery for Independence Systems. CoRR abs/1705.00127 (2017) - 2016
- [i1]Moses Charikar, Vaggos Chatziafratis:
Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics. CoRR abs/1609.09548 (2016)
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-07-25 19:28 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: