I like Cocreate and have been using it for a few years. It also supports latex: cocreate.csail.mit.edu
27.01.2026 17:09
π 0
π 0
π¬ 0
π 0
I like Cocreate and have been using it for a few years. It also supports latex: cocreate.csail.mit.edu
Meike Neuwohner, Vera Traub, Rico Zenklusen
Approximation Schemes for Planar Graph Connectivity Problems
https://arxiv.org/abs/2512.21128
Had a great time organizing (with Julian Mestre, R Ravi, and Mik Zlatin) a post #FOCS2025 2-day workshop on Trends in Approximation and Online Algorithms! Featuring an amazing lineup of speakers (from established experts to rising stars) + wiki edit-a-thon + gelato cart from Mapo 1/n
Aggh! I missed FOCS this year. Anything stands out to you (other than the fact that it is in Sydney, which is hard to replicate)?
π’ #FOCS2026 will be held in NewYork City, USA!
Nov 8β11, 2026 at NYU (colocated with TCC)
General Chair: Marshall Ball
PC Chair: Sanjeev Khanna (Co-Chair: Sepehr Assadi)
Stoked about the new work with Γdouard Bonnet, Tuukka Korhonen, Jason Li, and TomΓ‘Ε‘ MasaΕΓk: a simple linear time algorithm to find a balanced separator in minor-free graphs.
A more detailed blog post, giving a complete pseudocode: minorfree.github.io/SepLinear/
Paper: arxiv.org/abs/2512.01587
I hate conference deadlines, but somehow, deadlines make magic happen. A week ago, we had a jumble of texts, but now we have what looks like a nice paper.
STOC 2026 is offering experimental pre-submission feedback using an AI tool optimized for checking mathematical rigor. Results won't go to PC or be used for training purposes. Opt-in via the submission server by November 1.
Details: acm-stoc.org/stoc202...
CFP: acm-stoc.org/stoc202...
SODA26 accepted papers out: www.siam.org/conferences-...
I did not expect the subtleties of the light version. Beautiful work!
Some questions on spanners in my talk at the Simons Institute. Since the talk, progress has been made on a few questions, but most are open. minorfree.github.io/SpannerQues/
I agreed to review 6 SODA papers this year (not counting other reviews); an idiot is here. It's hard to say no; my past self struggled to find reviewers. People (non-PC members) accepting more than 6 reviews for a theory conference are definitely inspiring; 6 is my new record. What's your number?
Report new theory jobs here: kamathematics.wordpress.com/2025/06/03/t...
On a Dagstuhl workshop that I recently co-organized: minorfree.github.io/Dagstuhl/
Tracy Kimbrel, former National Science Foundation program director extraordinaire, will receive the 2025 ACM SIGACT Distinguished Service Award. He spearheaded programs such as TRIPODS (foundations of data science) and AitF (Algorithms in the Field).
1/2
The Call for Papers (CfP) for #SODA26 is out: www.siam.org/conferences-...
The submission server is open: soda26.hotcrp.com
Deadline: β° Monday, July 14, AoE (July 15, 11:59am UTC)
Jonathan Conroy and Arnold Filtser have recently solved the padded decomposition problem for minor-free graphs, one of my favorite open problems. Congratulations to both!
Their paper here: arxiv.org/abs/2504.00278
My take: minorfree.github.io/PaddedSolved/
I first got into smoothed analysis and linear programming during my master's. Now, 9 years later, we finally have matching upper and lower bounds.
I spent a huge part of my life on this, and it feels weird that it's now finished.
Huge congratulations to my amazing student Yeyuan Chen (+co-author Zihan Zhang of OSU advised by Zeyu Guo) for being awarded the STOC 2025 Best Student Paper Award! Their monumental result proves that explicit Reed-Solomon codes can correct more errors than previously known:
arxiv.org/abs/2408.15925
I got a lot out of participating in WALDO back in 2021, so I definitely recommend checking it out! π
The next few talks on TCS+ (@tcsplus.bsky.social):
π° Tom Gur on Zero-Knowledge PCPs (March 19) (@tomgur.bsky.social)
π° Or Zamir on streaming and optimal Fβ moment estimation (April 9)
π° Ryan Williams on time v. memory (April 23) (@rrwilliams.bsky.social)
Sweet!
The STOC 2025 Theory Fest is looking for workshop proposals!
Apply here:
stoc2025theoryfest.netlify.app
Deadline is March 9th, so act fast!
Hey, it's March now. You know what would be great? Nominating trailblazing TCS researchers to the Knuth Prize!
www.sigact.org/prizes/knuth...
CALL FOR PAPERS: With Robert Calderbank, Krishna Narayanan, Henry Pfister and Mary Wootters, I'm editing a special issue of the IEEE BITS magazine on Error-Correcting Codes & invite expository/tutorial articles.
Deadline: April 17 (white paper). Please circulate widely.
www.itsoc.org/sites/defaul...
CRA statement on the cuts at NSF: "These cuts are the very definition of being pennywise and pound foolish β a shortsighted move that will undermine American innovation and technological leadership .."
cra.org/cuts-to-nsf-...
the Four Russians Method is a technique for speeding up Boolean matrix multiplication and dynamic programming. The original paper is in Russian, and I am not aware of any English translation. Now we have a translation, by Ben Rozonoyer, a PhD student at UMass.
minorfree.github.io/FourRussian/
The #FOCS2025 website is up! Featuring a Call for Papers and important dates: focs.computer.org/2025/
β° Deadline: April 3, 2025 (8pm ET)
β° Notification: July 8, 2025
ποΈ Conference: December 14β17, 2025
Content and info will be added as it becomes available (workshops, activities, travel support).
So in 1999, people wrote a paper with 11 authors! Pretty amazing. How did they find each other?
Ah this is amazing! Thanks for these.