Dan Vilenchik
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 11
- Complexity and Algorithms in Graphs 5
-
- Constraint Satisfaction and Optimization 9
- Co-authors
- Michael Krivelevich (9 shared papers)Amin Coja‐Oghlan (9 shared papers)Yair Neuman (4 shared papers)Elchanan Mossel (2 shared papers)Kobi Gal (2 shared papers)Uriel Feige (4 shared papers)Robert Krauthgamer (1 shared paper)Boaz Nadler (1 shared paper)
- Journals
- Scientific Reports (2 papers)Random Structures and Algorithms (2 papers)Discrete Mathematics & Theoretical Computer Science (2 papers)Combinatorics Probability Computing (2 papers)Big Data (1 paper)
- Partner nations
- IsraelUnited StatesGermany
In The Last Decade
Dan Vilenchik
43 papers receiving 240 citations
Peers
Comparison fields: 5 of 71
- Discrete Mathematics and Combinatorics 28
- Computational Theory and Mathematics 74
- Signal Processing 31
- Computer Graphics and Computer-Aided Design 10
- Computer Networks and Communications 56
Countries citing papers authored by Dan Vilenchik
This map shows the geographic impact of Dan Vilenchik's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dan Vilenchik with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dan Vilenchik more than expected).
Fields of papers citing papers by Dan Vilenchik
This network shows the impact of papers produced by Dan Vilenchik. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dan Vilenchik. The network helps show where Dan Vilenchik may publish in the future.
Co-authors
The 25 scholars most cited alongside Dan Vilenchik, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 46 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2018 | 24 | |
| 2 | A Spectral Approach to Analysing Belief Propagation for 3-Colouring | 2009 | 15 |
| 3 | 2019 | 15 | |
| 4 | 2013 | 13 | |
| 5 | 2006 | 13 | |
| 6 | 2019 | 12 | |
| 7 | 2006 | 12 | |
| 8 | 2015 | 10 | |
| 9 | 2009 | 9 | |
| 10 | 2019 | 8 | |
| 11 | Do Semidefinite Relaxations Really Solve Sparse PCA | 2013 | 8 |
| 12 | 2006 | 8 | |
| 13 | 2021 | 7 | |
| 14 | 2022 | 7 | |
| 15 | 2019 | 6 | |
| 16 | 2022 | 6 | |
| 17 | 2009 | 6 | |
| 18 | 2022 | 6 | |
| 19 | 2009 | 6 | |
| 20 | 2010 | 5 |
About Dan Vilenchik
Dan Vilenchik is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Statistical and Nonlinear Physics and Discrete Mathematics and Combinatorics, having authored 46 papers that have together received 250 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (11 papers), Constraint Satisfaction and Optimization (9 papers), Complexity and Algorithms in Graphs (5 papers), Complex Network Analysis Techniques (4 papers), Data Management and Algorithms (3 papers), Limits and Structures in Graph Theory (3 papers), Sports Analytics and Performance (3 papers) and Logic, Reasoning, and Knowledge (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (28 citations), Computational Theory and Mathematics (74 citations), Signal Processing (31 citations), Computer Graphics and Computer-Aided Design (10 citations) and Computer Networks and Communications (56 citations). Dan Vilenchik has collaborated with scholars based in Israel, United States and Germany. Frequent co-authors include Michael Krivelevich, Amin Coja‐Oghlan, Yair Neuman, Elchanan Mossel, Kobi Gal, Uriel Feige, Robert Krauthgamer, Boaz Nadler, Alan Frieze and Benny Sudakov. Their work appears in journals such as Scientific Reports, Random Structures and Algorithms, Discrete Mathematics & Theoretical Computer Science, Combinatorics Probability Computing and Big Data.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.