@danupon

Graph algorithms and complexity theory. Director@Max Planck Institute for Informatics.

tiny.cc/danupon
Joined September 2008
  • Tweets219
  • Following402
  • Followers1K
Accepted papers for #STOC2026 acm-stoc.org/stoc2026/accept…
1
4
1
36
13,834
If you’re going to repaint your walls, you first put down a coat of primer to bring them back to neutral. In the same way, “priming” a graph can bring it into a new state that makes it easier to color. quantamagazine.org/the-faste…

The Fastest Way Yet to Color Graphs | Quanta Magazine

Researchers have devised a scheme for painting the edges of a graph that’s almost as speedy as possible.

quantamagazine.org
2
16
1
89
9,897
James Cook (left) and Ian Mertz recently devised a new algorithm that solved a specific problem using much less space than anyone thought possible. quantamagazine.org/for-algor…
4
25
5
185
17,617
Until now, the only known algorithms for accomplishing some computations required an amount of space roughly proportional to their runtime. The computer scientist Ryan Williams has found a way to do any computation using much less space. quantamagazine.org/for-algor…
2
15
1
81
11,490
Accepted papers for ICALP'25 is now online! Please register for an amazing program and come visit us here in Aarhus! conferences.au.dk/icalp2025/…
4
13
1,428
A new strongly poly-time algo for negative-weight shortest paths, O~(m sqrt(n)) time, by my colleague Satish Rao. This is the same problem Bellman-Ford, which we teach to undergrads, solved in O(mn) 70 yrs ago. Just 13 pgs! (*puts on todo list to read*) arxiv.org/abs/2503.22613

Randomized $\tilde{O}(m\sqrt{n})$ Bellman-Ford from Fineman and...

A classical algorithm by Bellman and Ford from the 1950's computes shortest paths in weighted graphs on $n$ vertices and $m$ edges with possibly negative weights in $O(mn)$ time. Indeed, this...

arxiv.org
4
43
9
279
71,038
The irony is that I kind of agree with Sabine @skdh that most academic research is BS, even in math. This is one of the (many) reasons why I left academia. Yet her economic analysis is dead-wrong, and public funding of mathematical research is wise, justified and cost-effective🧵
Daniel Litt
@littmath4 Mar 2025
Very revealing exchange here IMO. You can judge the quality of the claims yourself but fwiw this seems to me to be an argument against publicly funding public goods in general.
27
50
13
506
71,203
Submit your papers to ICALP'25 by February 8th and visit us in lovely Aarhus! conferences.au.dk/icalp2025 Have been working hard with @ICaragiannis as General Chairs to plan an amazing week for you!
4
26
3,495
Excited to co-organise another summer school on learning theory! This time in beautiful Odense, Denmark. Please share and apply here: event.sdu.dk/algoml2025

PhD School on Intersections of Algorithms and Machine Learning Theory

event.sdu.dk
10
41
2,615
If you are a "senior" people (beyond postdoc) and wants to meet the fresh young minds in TCS online, please consider registering at our junior-senior lunches! Registration: docs.google.com/spreadsheets… More info: sites.google.com/view/itcs20… #OnlineParallels

Junior-Senior Lunch

docs.google.com
3
4
1,276
Tenure-track openings at MPIs in all areas of CS and its intersection with other discipline, deadline Dec 1st. I cannot think of better positions in Europe for young researchers who want to start a group! Ping me if you want to hear my personal experience! apply.cis.mpg.de/register/tt…
2
11
38
5,272
Interesting result: every election has Condorcet dimension at most 6. arxiv.org/pdf/2411.03390
1
11
2
88
11,142
Sunday at 11 AM ET I'll be on a panel moderated by Mohammand Hajiaghayi on Job Market Strategies for CS PhD Students and Postdocs with Samir Khuller and Nicole Immorlica. youtube.com/live/diQXSDW007Q

CS Job Market Strategies for Ph.D. Students and Postdocs by Fortnow,...

We are pleased to invite you to a LIVE distinguished YouTube panel ...

youtube.com
2
17
1,670
Third video on data structure lower bounds from the Swiss Winter School on Theoretical Computer Science 2020 is now available youtube.com/watch?v=QKMPm94L…
3
22
1,263
Come join our fantastic department - and even better, our research group 😉
Computer Science at Aarhus University@csaudk30 Oct 2024
Join a fast-growing #ComputerScience department 🚀 We’re hiring Assist. & Assoc. Professors starting in June 25. We hope to expand our expertise in areas such as 𝘘𝘶𝘢𝘯𝘵𝘶𝘮 𝘊𝘰𝘮𝘱𝘶𝘵𝘪𝘯𝘨, 𝘈𝘐/𝘔𝘓, 𝘕𝘓𝘗 & 𝘚𝘰𝘧𝘵𝘸𝘢𝘳𝘦 𝘌𝘯𝘨𝘪𝘯𝘦𝘦𝘳𝘪𝘯𝘨 cs.au.dk/about-us/vacancies/…
1
10
1,281
A new proof shows that an upgraded version of a 70-year-old algorithm reigns supreme: It finds the most efficient pathways through any graph. @benbenbrubaker reports: quantamagazine.org/computer-…

Computer Scientists Establish the Best Way to Traverse a Graph | Quanta Magazine

Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.”

quantamagazine.org
4
109
6
379
49,585
2 awesome opportunities for TCS research (in different career stages): 1. Motwani Postdoc applications just opened! academicjobsonline.org/ajo/j… 2. Our crowdsourced spreadsheet of TCS Masters programs (same link, Fall 2024 updated info): cs.princeton.edu/~smattw/mas…
4
14
50
11,317
Today I present our position paper on the next Framework Programme during the @ERC_Research meeting in Berlin: mpg.de/23583552/mpg-position…
1
4
14
2,467
Some SODA25 papers that I like. What're yours? minorfree.github.io/SODA25/
3
1
15
1,717
SOSA 2025 was so much fun to co-chair with @ioanabercea and a great PC! We just finalized the exciting list of papers that will appear at the conference in New Orleans in January: rasmuspagh.net/SOSA25%20Acce…
10
1
37
3,583
Load more