Publications

Shoham E., Cohen H., Wattad K., Rika H., Vilenchik D. 2025. Concept learning for algorithmic reasoning: Insights from SAT-solving GNNs, in Information Sciences (Elsevier), 2025.

Vilenchik D., J. Cwikel, Ezra Y., Hausdorff T., Lazarov M., Sergienko R., Abramovitz R., Schmidt I., Perez A., 2025. Method Matters: Enhancing Voice-Based Depression Detection With a New Data Collection Framework, in Depression & Anxiety (Wiley).

Barel G., Tsur O., Vilenchik D. Acquired TASTE: Multimodal Stance Detection with Textual and Structural Embeddings, in COLING 2025.

Barrett J., Gal K., Michael L., Vilenchik D. Beyond the echo chamber: modelling open-mindedness in citizens’ assemblies, in Journal of Autonomous Agents and Multi-Agent Systems, 2024. Conference version appeared in AAMAS 2025.

Soffer A.,  Viswas SJ., Alon S., Rozenberg N., Peled A., Piro D., Vilenchik D.,  Akabayov B., 2024. MolOptimizer: A Molecular Optimization Toolkit for Fragment-Based Drug Design, in Molecules. 

Salomon Y., Vax E., Osowizky A., Knafo Y., Ben David N., and  Vilenchick D. 2024. Direction of Arrival Estimation for Radionuclides Based on Neural Network Approach. in IEEE Transactions on Nuclear Science. A conference version appeared in Advancements in Nuclear Instrumentation Measurement Methods and their Applications.

Cordeiro C. , Gonceer N., Dorus S.,  Crill J., Moshayoff V., Lachman A., Moran A., Vilenchik D.,  Fedida-Metula S. 2023. Fast, accurate, and cost-effective poultry sex genotyping using Real-Time polymerase chain reaction. in Frontiers in Veterinary Science.

Neuman Y., Kozhukhov V., Vilenchik D. 2023. Data Augmentation for Modeling Human Personality: The Dexter Machine. Arxiv.

Weiss, I., Vilenchik D., 2023. Predicting Churn in Online Games by Quantifying Diversity of Engagement. Big Data.

Neuman Y., Danesi M., Vilenchik D. 2022. Using AI for Dialoguing with Texts: From Psychology to Cinema and Literature.  Routledge.

Ilan T., Vilenchik D., HARALD: Augmenting Hate Speech Data Sets with Real Data. 2022. in Findings of the EMNLP. Paper invited to the Workshop on NLP for Positive Impact 2022.

Portnikh, R., Kenzi K., Krohn, N., Vilenchik D., Marienberg-Milikowsky I., 2022. An Experimental Undogmatic Modelling of (Hebrew ) Literature, in Digital Journal for Philology, special issue on Digital Methods in Literary Studies.

Danilchenko, K., Segal, M., Vilenchik D., 2022. Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms, in ICWSM.

Sofer C., Dotsch R., Vilenchik D., Avidan G. 2022. The Compositionality of Facial Expressions, in Perception.

Fairstein R., Meir R., Vilenchik D., Gal K. 2022. Welfare vs. Representation in Participatory Budgeting, in AAMAS 2022.

Korenblum R., Kozhukhov V., Vilenchik D., Tsur O. 2022.  STEM: Unsupervised STructural EMbedding for Stance Detection, in AAAI 2022.

Soffer A., Eisdorfer S. , Ifrach M., Ilic S.,  Afek A., Schussheim H., Vilenchik, D. and Akabayov B. 2021. Inferring primase-DNA specific recognition using a data driven approach, in Nucleic Acids Research

Elmakias I., Vilenchik, D. 2021. An Oblivious Approach to Machine Translation Quality Estimation, in Mathematics.

Vilechik, D.  2020. An Unsupervised Approach to User Characterization in Online Learning and Social Platforms, in Mathematics (Education) in the Information Age, Editors Stacy A. Costa, Marcel Danesi, Dragana Martinovic, Springer

Holtzman G., Soffer A., Vilenchik D.  2020.  A greedy anytime algorithm for sparse PCA. COLT.  

Neuman Y., Vilenchik, D., and Israeli, N. 2020. From physical to social interactions: The relative entropy model. Scientific Reports. 

Tam B., Sherf D., Cohen S., Eisdorfer S., Peretz M., Soffer A., Vilenchik D., Akabayov S., Wagner G. and Akabayov B. 2019. Discovery of small-molecule inhibitors targeting the ribosomal peptidyl transferase center (PTC) of M. tuberculosis. Chemical Science. (paper appeared on cover)

Hershcovits H. , Vilenchik, D. and  Gal K. 2019. Modeling Engagement in Self-Directed Learning Systems using Principal Component Analysis. IEEE Transactions on Learning Technologies.

Vilenchik, D.,  Yichye, B., and Abutbul, M. 2019. To interpret or not  to interpret PCA? This is the question.  Proc. of the 13th AAAI Conference on Web and Social Media (ICWSM)

Neuman Y., Vilenchik D., 2019. Modeling Small Systems through the Relative Entropy Lattice. IEEE Access. 

Vilenchik D. 2019. Simple statistics are sometime too simple: A case study in social media data. IEEE Transactions on Knowledge and Data Engineering. 

Vilenchik , D. 2018. The Million Tweets Fallacy: Activity and Feedback are Uncorrelated. Proc. of the 12th International AAAI Conference on Web and Social Media (ICWSM) 

Neuman Y., Israeli, N. Vilenchik, D. and Cohen, Y. 2018. The Adaptive Behavior of a Soccer Team: An Entropy-Based Analysis. Entropy.

Sofer, C., Vilenchik , D., Dotsch, R. and Avidan, G. 2018.  Emotion Algebra reveals the richness of meanings of facial expressions. Journal of Vision

Segal, Y., Vilenchik, D.  and Hadar, O. 2018. Detecting and Coloring Anomalies in real cellular network using Principle Component Analysis. The 2nd International Symposium on Cyber Security Cryptography and Machine Learning (CSCML)

 Langberg, M. and Vilenchik, D. 2017. Constructing cospectral graphs via a new form of graph product. Linear and Multilinear Algebra.

Ilic, S., Akabayov, S., Froimovici, R., Meiry, R., Vilenchik, D., Hernandez, A., Arnathani, H. and Akabayov, B. 2017. Modulation of the activity in the Mn-substituted T7 DNA primase has a structural origin. Scientific Reports

Bapst V., Coja-Oghlan, A., Hetterich S., Rassmann F., and Vilenchik, D. 2016. The Condensation Phase Transition in Random Graph Coloring. Communications in Mathematical Physics 

Coja-Oghlan, A. and Vilenchik, D. The Chromatic Number of Random Graphs for Most Average Degrees.  2016. International Mathematics Research Notice 

Krauthgamer, R. and Nadler, B. and Vilenchik, D. 2015. Do Semi-Definite Relaxations Solve Sparse PCA up to the information limit? the Annals of Statistics

Coja-Oghlan , A. and Vilenchik, D. 2013. Chasing the k-colorability threshold. The 54th Annual Symposium on Foundations of Computer Science (FOCS)

Pak, I. and Vilenchik, D. 2013. Constructing Uniquely Realizable Graphs.  Discrete & Computational Geometry

Levi,  I., Vilenchik, D., Langberg, M. and Effros, M. 2013. Zero vs. e Error in interference channels. IEEE Information Theory Workshop (ITW).

Braverman, V., Ostrovsky, R. and Vilenchik, D. 2013. How hard is counting triangles in the streaming model. International Colloquium on Automata, Languages and Programming (ICALP). 

Sinclair, A. and Vilenchik, D. 2013. Delaying satisfiability for random 2SAT. Random Structures & Algorithms

Feige, U., Mossel, E. and Vilenchik, D. 2013. Complete convergence of message passing algorithms for some satisfiability problems. Theory of Computing

Lee, C., Sudakov, B. and Vilenchik, D. 2012. Getting a directed Hamilton cycle two times faster. Combinatorics, Probability and Computing

Friedrich, T., Sauerwald, T., and Vilenchik, D. 2011. Smoothed analysis of balancing networks. Random Structures & Algorithms

Coja-Oghlan, A., Krivelevich, M. and Vilenchik, D. 2010. Why Almost All k-Colorable Graphs Are Easy to Color. Theory of Computing. Videoed Lecture.

Feige, U., Flaxman, A. and Vilenchik, D. 2011. On the diameter of the set of satisfying assignments in random satisfiable k-CNF formulas. SIAM Journal on Discrete  Mathematics, Special Section on Constraint Satisfaction Problems and Message Passing Algorithms

Minder, L. and Vilenchik, D. 2009. Small clique detection and approximate Nash equilibria. International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM+APPROX)

Krivelevich, M., Sudakov, B. and Vilenchik, D. 2009. On the random satisfiable process. Combinatorics Probability and Computing

Coja-Oghlan A., Feige, U., Frieze, A.,  Krivelevich, M. and Vilenchik, D. 2009. On smoothed k-CNF formulas and the Walksat algorithm. Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA)

Coja-Oghlan, A.,  Mossel, E. and Vilenchik, D. 2009. A Spectral Approach to Analyzing Belief Propagation for 3-Coloring. Combinatorics Probability and Computing 

Böttcher, J. and Vilenchik, D. 2008. On the Tractability of Coloring Semi-random Graphs. Information Processing Letters

Vilenchik, D.  2007. It's all about the support: a new perspective on the satisfiability problem. Journal on Satisfiability, Boolean Modeling, and Computation 

Ben-Shimon, S. and Vilenchik, D. 2007. Message passing for the coloring problem: Gallager meets Alon and Kahale. Proceedings of the 13th International Conference on Analysis of Algorithms

Coja-Oghlan, A., Krivelevich M.,and Vilenchik,  D. 2007. Why almost all satisfiable k-CNF formulas are easy. Proceedings of the 13th International Conference on Analysis of Algorithms

Krivelevich, M. and Vilenchik, D. 2006. Semi-Random Models as Benchmarks for Coloring Algorithms. Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO)

Krivelevich, M. and Vilenchik, D. 2006. Solving random satisfiable 3CNF formulas in expected polynomial time. Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA)

Feige, U. and Vilenchik, D. 2004. A Local Search Algorithm for 3SAT. Technical Report MCS 04-07, Computer Science and Applied Mathematics, The Weizmann Institute of Science