Dear all, We are pleased to announce that the Workshop on Exposition, Exploration, and Depth 2026 will be held in IIT Delhi, New Delhi India on 19th and 20th December 2026. The workshop is co-located with the FSTTCS conference <https://www.fsttcs.org.in/2026/>. The idea behind the workshop is to provide explanations and clarity around concepts in Theoretical Computer Science, which can be of interest to a wider audience, but somehow is understood well by a small number of researchers in a subfield. For more details, please visit the URL: https://vaishs.github.io/DepthTCS/index.html The workshop will feature invited talks from experts, contributed talks, and a video competition for students and postdocs. We invite proposals for contributed talks and videos, the calls for the same are appended below. The information can also be found at the webpage mentioned above. *************** Call for contributed talks **************** We invite proposals for contributed talks on any topic in Theoretical Computer Science. The purpose of these talks is to share a general result or idea that might not be very well known outside its particular subfield of Theoretical CS, but which contains aspects of general interest, and whose intuition can be presented in an accessible manner to a wider audience. The idea is to shed light on some not-very-well-known topics and ideas which might find application in areas outside of the ones where they are customary, rather than to explore deep technical details which would assume familiarity with the basic setup. People whose contributed talks are accepted are required to register for the workshop and present their work in person. There are three important rules to be followed. - The talk must not be about a result directly based on the speaker's own work. - A contributed talk is intended to last for no more than half an hour (25 + 5 for Q&A) and must be accompanied by a clear, expository write-up of at most six pages on the topic, in the LIPIcs format <https://www.dagstuhl.de/en/publishing/series/details/lipics#author>. - The talk and the write-up should exhibit the human understanding of the presenter about the topic, and hence AI should not be used for coming up with the topic or contents of the talk. Your submission should be a work that you could confidently explain, defend, and reproduce yourself. If AI produced a substantial part of your exposition, then it is not an eligible submission. This policy and our judgement criteria are in the spirit of 3Blue1Brown’s Summer of Math Exposition <https://some.3b1b.co/ai-policy>. The proposals will be judged on the following. - Motivation: It should be clear early on in the explainer why the topic matters and why someone should be excited to learn about it. - Clarity: Jargon should be clearly explained, and the goals of the talk should be easy to understand for a general audience, some of whom might be new to the topic. - Novelty: The idea need not be brand new, but the presentation should either bring a new perspective to a familiar topic, or shed light on an overlooked or obscure idea that deserves more attention. The deadline is 5th November, 2026, AoE. We look forward to receiving your submission! Submission link: https://forms.gle/5FWUQKDF1d9yDpfx8 ********************* Call for videos ******************** We are organizing a video competition for postdocs and students as a part of the workshop. The idea is to recognize and celebrate good expositions in video form and to encourage the community to consider video expositions as a way of spreading understanding. The expository video can draw from any topic or concept in Theoretical Computer Science, and should not be more than 20 minutes (there is no lower bound, though, and shorter videos conveying an idea clearly are more than welcome). We encourage making videos for a wider TCS audience on topics which are not very well-known outside an area. The following rules must be followed for an entry to be considered for the competition. - All the creators of the video must be an undergraduate, postgraduate, or PhD student, or a postdoctoral researcher, at the time of submission. - The video must not be created through AI video generators. The narration should be by one of the creators, reflecting their understanding about the topic of the video. We follow a similar judging criteria and the same AI policy as 3Blue1Brown’s Summer of Math Exposition <https://some.3b1b.co/ai-policy>. The videos will be judged on the following. - Motivation: It should be clear early on in the explainer why the topic matters and why someone should be excited to learn about it. - Clarity: Jargon should be clearly explained, and the goals of the talk should be easy to understand for a general audience, some of whom might be new to the topic - Novelty: The idea need not be brand new, but the presentation should either bring a new perspective to a familiar topic, or shed light on an overlooked or obscure idea that deserves more attention. - Memorability: Something should make the piece stick with the audience, even months later, whether that's the beauty of the presentation, the enthusiasm of the presenter, or a mind-blowing aha! moment. The deadline is 5th November, 2026, AoE. We look forward to receiving your submission! Submission link: https://forms.gle/27WU7zovHTCAqymq7 *********************************************************************************** For any queries, please contact the organizers. Organizing Team Nikhil Balaji (IIT Delhi) Syamantak Das (IIIT Delhi) Ashutosh Rai (IIT Delhi) Vaishnavi Sundararajan (IIT Delhi) ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zaik.uni-koeln.de/AFS/publications/dmanet/ * **********************************************************