| 2026 | AAAI | Learning to Rank: How GNNs Solve Max-Clique and Sparse PCA. | Elad Shoham, Omri Haber, Havana Rika, Dan Vilenchik |
| 2025 | COLING | Acquired TASTE: Multimodal Stance Detection with Textual and Structural Embeddings. | Guy Barel, Oren Tsur, Dan Vilenchik |
| 2022 | AAAI | STEM: Unsupervised STructural EMbedding for Stance Detection. | Ron Korenblum Pick, Vladyslav Kozhukhov, Dan Vilenchik, Oren Tsur |
| 2022 | EMNLP | HARALD: Augmenting Hate Speech Data Sets with Real Data. | Ilan Tal, Dan Vilenchik |
| 2022 | ICWSM | Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. | Kiril Danilchenko, Michael Segal, Dan Vilenchik |
| 2020 | COLT | A Greedy Anytime Algorithm for Sparse PCA. | Guy Holtzman, Adam Soffer, Dan Vilenchik |
| 2019 | ICWSM | To Interpret or Not to Interpret PCA? This Is Our Question. | Dan Vilenchik, Barak Yichye, Maor Abutbul |
| 2018 | ICWSM | The Million Tweets Fallacy: Activity and Feedback Are Uncorrelated. | Dan Vilenchik |
| 2013 | FOCS | Chasing the K-Colorability Threshold. | Amin Coja-Oghlan, Dan Vilenchik |
| 2013 | ICALP | How Hard Is Counting Triangles in the Streaming Model? | Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik |
| 2013 | ITW | Zero vs. ε error in interference channels. | Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros |
| 2009 | ICALP | Smoothed Analysis of Balancing Networks. | Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik |
| 2009 | SODA | On smoothed | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik |
| 2007 | STACS | Why Almost All | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
| 2006 | SODA | Solving random satisfiable 3CNF formulas in expected polynomial time. | Michael Krivelevich, Dan Vilenchik |