Stefan Neumann
@neumannstefan.com
Assistant professor @ TU Wien, associate faculty @ Complexity Science Hub.
Previously: KTH, Brown, Uni Wien.
I study algorithms for data science and social-network analysis. Connecting theory 🤝 practice.
More info: https://neumannstefan.com.
Previously: KTH, Brown, Uni Wien.
I study algorithms for data science and social-network analysis. Connecting theory 🤝 practice.
More info: https://neumannstefan.com.
We uploaded a new version with links to Omer Reingold's "Research Life Stories", to Luca Trevisan's series of posts about gay and lesbian computer scientists, and so on.
Check out the updated version: eatcs.org/images/bulle...
The links are also in the comment below.
Happy reading!
Check out the updated version: eatcs.org/images/bulle...
The links are also in the comment below.
Happy reading!
November 10, 2025 at 8:20 AM
We uploaded a new version with links to Omer Reingold's "Research Life Stories", to Luca Trevisan's series of posts about gay and lesbian computer scientists, and so on.
Check out the updated version: eatcs.org/images/bulle...
The links are also in the comment below.
Happy reading!
Check out the updated version: eatcs.org/images/bulle...
The links are also in the comment below.
Happy reading!
Reposted by Stefan Neumann
We have a call for contributions. Check out the text post on the channel for details.
Alongside the new bulletin, is the first video on the new EATCS Youtube channel!
We learn about different ways to record your seminar talks.
We learn about different ways to record your seminar talks.
October 31, 2025 at 12:13 PM
We have a call for contributions. Check out the text post on the channel for details.
Reposted by Stefan Neumann
Alongside the new bulletin, is the first video on the new EATCS Youtube channel!
We learn about different ways to record your seminar talks.
We learn about different ways to record your seminar talks.
October 30, 2025 at 8:12 PM
Alongside the new bulletin, is the first video on the new EATCS Youtube channel!
We learn about different ways to record your seminar talks.
We learn about different ways to record your seminar talks.
The new EATCS Bulletin #147 is available!
eatcs.org/images/bulle...
In the TCS on the Web Column, I talked to the maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath.
It was a very fun interview!
@gautamkamath.com @schmiste-ch.bsky.social
eatcs.org/images/bulle...
In the TCS on the Web Column, I talked to the maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath.
It was a very fun interview!
@gautamkamath.com @schmiste-ch.bsky.social
October 30, 2025 at 12:44 PM
The new EATCS Bulletin #147 is available!
eatcs.org/images/bulle...
In the TCS on the Web Column, I talked to the maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath.
It was a very fun interview!
@gautamkamath.com @schmiste-ch.bsky.social
eatcs.org/images/bulle...
In the TCS on the Web Column, I talked to the maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath.
It was a very fun interview!
@gautamkamath.com @schmiste-ch.bsky.social
Reposted by Stefan Neumann
My lab is looking for a Senior Scientist (= PostDoc with option of permanency)!
We are looking for someone interested in doing cutting-edge computational social science + helping us with data & software engineering 🤓.
See job ad for details jobs.uni-graz.at/en/jobs/7d14...
We are looking for someone interested in doing cutting-edge computational social science + helping us with data & software engineering 🤓.
See job ad for details jobs.uni-graz.at/en/jobs/7d14...
Universität Graz
jobs.uni-graz.at
October 28, 2025 at 7:02 AM
My lab is looking for a Senior Scientist (= PostDoc with option of permanency)!
We are looking for someone interested in doing cutting-edge computational social science + helping us with data & software engineering 🤓.
See job ad for details jobs.uni-graz.at/en/jobs/7d14...
We are looking for someone interested in doing cutting-edge computational social science + helping us with data & software engineering 🤓.
See job ad for details jobs.uni-graz.at/en/jobs/7d14...
Reposted by Stefan Neumann
The simplex algorithm is super efficient. 80 years of experience says it runs in linear time. Nobody can explain _why_ it is so fast.
We invented a new algorithm analysis framework to find out.
We invented a new algorithm analysis framework to find out.
Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
Narrowing the gap between theory and practice is a longstanding goal of the algorithm analysis community. To further progress our understanding of how algorithms work in practice, we propose a new alg...
arxiv.org
October 27, 2025 at 1:43 AM
The simplex algorithm is super efficient. 80 years of experience says it runs in linear time. Nobody can explain _why_ it is so fast.
We invented a new algorithm analysis framework to find out.
We invented a new algorithm analysis framework to find out.
Reposted by Stefan Neumann
The debate over “LLMs as annotators” feels familiar: excitement, backlash, and anxiety about bad science. My take in a new blogpost is that LLMs don’t break measurement; they expose how fragile it already was.
doomscrollingbabel.manoel.xyz/p/labeling-d...
doomscrollingbabel.manoel.xyz/p/labeling-d...
Labeling Data with Language Models: Trick or Treat?
Large language models are now labeling data for us.
doomscrollingbabel.manoel.xyz
October 25, 2025 at 6:29 PM
The debate over “LLMs as annotators” feels familiar: excitement, backlash, and anxiety about bad science. My take in a new blogpost is that LLMs don’t break measurement; they expose how fragile it already was.
doomscrollingbabel.manoel.xyz/p/labeling-d...
doomscrollingbabel.manoel.xyz/p/labeling-d...
STOC'26 will provide an *optional* pre-submission feedback based on Gemini. The model is optimized for checking mathematical rigor.
Looks interesting. They also post example outputs and comments on them.
Announcement: acm-stoc.org/stoc2026/sto...
Example reviews: www.cs.cmu.edu/~dwoodruf/st...
Looks interesting. They also post example outputs and comments on them.
Announcement: acm-stoc.org/stoc2026/sto...
Example reviews: www.cs.cmu.edu/~dwoodruf/st...
October 25, 2025 at 2:20 PM
STOC'26 will provide an *optional* pre-submission feedback based on Gemini. The model is optimized for checking mathematical rigor.
Looks interesting. They also post example outputs and comments on them.
Announcement: acm-stoc.org/stoc2026/sto...
Example reviews: www.cs.cmu.edu/~dwoodruf/st...
Looks interesting. They also post example outputs and comments on them.
Announcement: acm-stoc.org/stoc2026/sto...
Example reviews: www.cs.cmu.edu/~dwoodruf/st...
Reposted by Stefan Neumann
🎓 PhD Position @ TU Wien (Vienna, Austria) — start Jan 2026
Join us to do research on knowledge graph embeddings.
Application deadline: November 6, 2025
🔗 Apply here: jobs.tuwien.ac.at/Job/259110
ℹ️ More details: dmki-tuwien.github.io/jobs.html
#PhD #AI #KnowledgeGraphs #MachineLearning #Vienna
Join us to do research on knowledge graph embeddings.
Application deadline: November 6, 2025
🔗 Apply here: jobs.tuwien.ac.at/Job/259110
ℹ️ More details: dmki-tuwien.github.io/jobs.html
#PhD #AI #KnowledgeGraphs #MachineLearning #Vienna
University Assistant Prae-Doc (all genders)
jobs.tuwien.ac.at
October 22, 2025 at 6:43 AM
🎓 PhD Position @ TU Wien (Vienna, Austria) — start Jan 2026
Join us to do research on knowledge graph embeddings.
Application deadline: November 6, 2025
🔗 Apply here: jobs.tuwien.ac.at/Job/259110
ℹ️ More details: dmki-tuwien.github.io/jobs.html
#PhD #AI #KnowledgeGraphs #MachineLearning #Vienna
Join us to do research on knowledge graph embeddings.
Application deadline: November 6, 2025
🔗 Apply here: jobs.tuwien.ac.at/Job/259110
ℹ️ More details: dmki-tuwien.github.io/jobs.html
#PhD #AI #KnowledgeGraphs #MachineLearning #Vienna
Reposted by Stefan Neumann
Aarhus hiring "up to six" professors in CS, all levels, also in TCS: international.au.dk/about/profil...
Aarhus University is hiring Assistant, Associate and Full Professors for the Department of Computer Science - Vacancy at Aarhus University
Vacancy at Computer Science, Dept. of, Aarhus University
international.au.dk
October 20, 2025 at 7:38 PM
Aarhus hiring "up to six" professors in CS, all levels, also in TCS: international.au.dk/about/profil...
Reposted by Stefan Neumann
We will be rebooting the EATCS Youtube channel soon. Subscribe now to get in on the ground floor!
EATCS
European Association for Theoretical Computer Science (EATCS) is an international organization founded in 1972. Its aim is to facilitate the exchange of ideas and results among theoretical computer sc...
www.youtube.com
October 18, 2025 at 11:39 AM
We will be rebooting the EATCS Youtube channel soon. Subscribe now to get in on the ground floor!
Such a strong growth in submissions over the past few years (probably because of LLMs?). 38% more than two years ago. Wow.
An acceptance rate of less than 10% is really tough.
Good luck to everyone who submitted!
An acceptance rate of less than 10% is really tough.
Good luck to everyone who submitted!
October 16, 2025 at 1:57 PM
Such a strong growth in submissions over the past few years (probably because of LLMs?). 38% more than two years ago. Wow.
An acceptance rate of less than 10% is really tough.
Good luck to everyone who submitted!
An acceptance rate of less than 10% is really tough.
Good luck to everyone who submitted!
I was just briefly scrolling over the latest ACM Career News newsletter and I find it quite funny that it contains a picture of the German Federal Minister of Defense, Boris Pistorius.
October 15, 2025 at 7:27 AM
I was just briefly scrolling over the latest ACM Career News newsletter and I find it quite funny that it contains a picture of the German Federal Minister of Defense, Boris Pistorius.
Also, if you are a reviewer for a paper with 3 weak accepts: Consider becoming the champion.
IMO often these are very solid papers. If no reviewer has objections, why not just accept it (esp. at large ML conference)? Makes the authors happy & there is one less resubmission in the peer review system
IMO often these are very solid papers. If no reviewer has objections, why not just accept it (esp. at large ML conference)? Makes the authors happy & there is one less resubmission in the peer review system
The asymmetry between the 1st and 4th options shows that weak accepts and weak rejects don't mirror each other. Uniformly weak support for a paper can be damning, and a paper usually needs a champion.
(Also, 5.8% of people are sickos.)
(Also, 5.8% of people are sickos.)
October 10, 2025 at 8:57 PM
Also, if you are a reviewer for a paper with 3 weak accepts: Consider becoming the champion.
IMO often these are very solid papers. If no reviewer has objections, why not just accept it (esp. at large ML conference)? Makes the authors happy & there is one less resubmission in the peer review system
IMO often these are very solid papers. If no reviewer has objections, why not just accept it (esp. at large ML conference)? Makes the authors happy & there is one less resubmission in the peer review system
Reposted by Stefan Neumann
Junior and senior faculty positions in computational social scientists at Bocconi, one of the world's best universiites: Assistant Prof: jobmarket.unibocconi.eu?id=841
Associate/Full Prof: jobmarket.unibocconi.eu?id=843
Associate/Full Prof: jobmarket.unibocconi.eu?id=843
Job Market - Bocconi University
Recruiting, Faculty, Post-doc Grant, Collaboration Contracts
jobmarket.unibocconi.eu
October 7, 2025 at 10:43 PM
Junior and senior faculty positions in computational social scientists at Bocconi, one of the world's best universiites: Assistant Prof: jobmarket.unibocconi.eu?id=841
Associate/Full Prof: jobmarket.unibocconi.eu?id=843
Associate/Full Prof: jobmarket.unibocconi.eu?id=843
Reposted by Stefan Neumann
The elections for new members of the EATCS General Assembly have started. All EATCS members (which includes everyone who has recently taken part in ICALP, ESA, MFCS, or DISC) can vote, log on at www.eatcs.org and follow the instructions there!
European Association for Theoretical Computer Science
European Association for Theoretical Computer Science
www.eatcs.org
October 7, 2025 at 2:08 PM
The elections for new members of the EATCS General Assembly have started. All EATCS members (which includes everyone who has recently taken part in ICALP, ESA, MFCS, or DISC) can vote, log on at www.eatcs.org and follow the instructions there!
Reposted by Stefan Neumann
Cambridge is recruiting Assistant/Associate Professors in Theoretical Computer Science. #TCS #AcademicJobs
Application deadline: 15 December 2025. Contact me for informal inquiries. See more details and apply here:
www.cst.cam.ac.uk/assistantass...
Application deadline: 15 December 2025. Contact me for informal inquiries. See more details and apply here:
www.cst.cam.ac.uk/assistantass...
October 7, 2025 at 11:38 AM
Cambridge is recruiting Assistant/Associate Professors in Theoretical Computer Science. #TCS #AcademicJobs
Application deadline: 15 December 2025. Contact me for informal inquiries. See more details and apply here:
www.cst.cam.ac.uk/assistantass...
Application deadline: 15 December 2025. Contact me for informal inquiries. See more details and apply here:
www.cst.cam.ac.uk/assistantass...
Reposted by Stefan Neumann
Some extra info: (1) Priority areas are listed, but those working in *any* area relevant to the School of CS are welcome to apply; (2) the due time of the application (Dec 1) is 🇦🇺 Sydney time (keep in mind!); (3) we welcome applications at *all* levels.
usyd.wd105.myworkdayjobs.com/en-GB/USYD_E...
usyd.wd105.myworkdayjobs.com/en-GB/USYD_E...
October 6, 2025 at 10:18 PM
Some extra info: (1) Priority areas are listed, but those working in *any* area relevant to the School of CS are welcome to apply; (2) the due time of the application (Dec 1) is 🇦🇺 Sydney time (keep in mind!); (3) we welcome applications at *all* levels.
usyd.wd105.myworkdayjobs.com/en-GB/USYD_E...
usyd.wd105.myworkdayjobs.com/en-GB/USYD_E...
Reposted by Stefan Neumann
The Swiss Winter School in TCS 2026 will take place January 25-30, featuring amazing speakers Ankur Moitra (MIT), Avishay Tal (UC Berkeley), and Vera Traub (ETHZ).
Application deadline: October 24
More information: theory.epfl.ch/WinterSchool...
Application deadline: October 24
More information: theory.epfl.ch/WinterSchool...
Swiss Winter School on Theoretical Computer Science
theory.epfl.ch
September 29, 2025 at 1:31 PM
The Swiss Winter School in TCS 2026 will take place January 25-30, featuring amazing speakers Ankur Moitra (MIT), Avishay Tal (UC Berkeley), and Vera Traub (ETHZ).
Application deadline: October 24
More information: theory.epfl.ch/WinterSchool...
Application deadline: October 24
More information: theory.epfl.ch/WinterSchool...
Reposted by Stefan Neumann
Happy Birthday Google
For many of your 27 years you were called a lazy vice. Finally you have attained the status of a thoughtful virtue of the good old days.
🥂 🥳
For many of your 27 years you were called a lazy vice. Finally you have attained the status of a thoughtful virtue of the good old days.
🥂 🥳
September 27, 2025 at 10:30 PM
Happy Birthday Google
For many of your 27 years you were called a lazy vice. Finally you have attained the status of a thoughtful virtue of the good old days.
🥂 🥳
For many of your 27 years you were called a lazy vice. Finally you have attained the status of a thoughtful virtue of the good old days.
🥂 🥳
Reposted by Stefan Neumann
A foretold, the new season of TCS+ is coming! If you cannot wait for the official announcement,* you can already sign up to attend the first talk on October 8, by Janani Sundaresan, from U Waterloo (@uwcheritoncs.bsky.social)!
www.tcsplus.org/welcome/next...
* Soon on an Internet near you!
www.tcsplus.org/welcome/next...
* Soon on an Internet near you!
TCS+ - Next TCS+ talk
Our first TCS+ talk of the season will take place on October 8 (10:00am Pacific Time, 1:00 pm Eastern Time, 19:00 Central European Summer Time, 17:00 UTC — check yours here). Janani Sundaresan, from t...
www.tcsplus.org
September 27, 2025 at 1:47 AM
A foretold, the new season of TCS+ is coming! If you cannot wait for the official announcement,* you can already sign up to attend the first talk on October 8, by Janani Sundaresan, from U Waterloo (@uwcheritoncs.bsky.social)!
www.tcsplus.org/welcome/next...
* Soon on an Internet near you!
www.tcsplus.org/welcome/next...
* Soon on an Internet near you!
Reposted by Stefan Neumann
Gurobi published their 2025 State of Mathematical Optimization report. Always a nice read!
www.gurobi.com/resources/re...
www.gurobi.com/resources/re...
September 23, 2025 at 11:29 AM
Gurobi published their 2025 State of Mathematical Optimization report. Always a nice read!
www.gurobi.com/resources/re...
www.gurobi.com/resources/re...
Reposted by Stefan Neumann
If you work on theory in responsible computing and are looking for a job, fill out this form before September 28!
Responsible computing includes private data analysis, fairness, robustness, mathematical approaches bridging computer science, law, ethics, etc.
docs.google.com/forms/d/e/1F...
Responsible computing includes private data analysis, fairness, robustness, mathematical approaches bridging computer science, law, ethics, etc.
docs.google.com/forms/d/e/1F...
September 15, 2025 at 1:03 PM
If you work on theory in responsible computing and are looking for a job, fill out this form before September 28!
Responsible computing includes private data analysis, fairness, robustness, mathematical approaches bridging computer science, law, ethics, etc.
docs.google.com/forms/d/e/1F...
Responsible computing includes private data analysis, fairness, robustness, mathematical approaches bridging computer science, law, ethics, etc.
docs.google.com/forms/d/e/1F...
Reposted by Stefan Neumann
A very nice summary by Stefan of our recent publication "Optirefine: densest subgraphs and maximum cuts with k refinements". With @stefanresearch.bsky.social, Aleksa Stankovic, and @aris-gionis.bsky.social
Suppose you are given a non-optimal solution to an algorithmic problem and you want to make a small number of changes to improve its objective function.
We give nearly-optimal approximation algorithms for this problem for Max-Cut and for Densest Subgraph.
link.springer.com/article/10.1...
We give nearly-optimal approximation algorithms for this problem for Max-Cut and for Densest Subgraph.
link.springer.com/article/10.1...
Optirefine: densest subgraphs and maximum cuts with k refinements - Data Mining and Knowledge Discovery
Data-analysis tasks often involve an iterative process, which requires refining previous solutions. For instance, when analyzing social networks, we may obtain initial communities based on noisy metad...
link.springer.com
September 12, 2025 at 1:36 PM
A very nice summary by Stefan of our recent publication "Optirefine: densest subgraphs and maximum cuts with k refinements". With @stefanresearch.bsky.social, Aleksa Stankovic, and @aris-gionis.bsky.social
Suppose you are given a non-optimal solution to an algorithmic problem and you want to make a small number of changes to improve its objective function.
We give nearly-optimal approximation algorithms for this problem for Max-Cut and for Densest Subgraph.
link.springer.com/article/10.1...
We give nearly-optimal approximation algorithms for this problem for Max-Cut and for Densest Subgraph.
link.springer.com/article/10.1...
Optirefine: densest subgraphs and maximum cuts with k refinements - Data Mining and Knowledge Discovery
Data-analysis tasks often involve an iterative process, which requires refining previous solutions. For instance, when analyzing social networks, we may obtain initial communities based on noisy metad...
link.springer.com
September 12, 2025 at 9:14 AM
Suppose you are given a non-optimal solution to an algorithmic problem and you want to make a small number of changes to improve its objective function.
We give nearly-optimal approximation algorithms for this problem for Max-Cut and for Densest Subgraph.
link.springer.com/article/10.1...
We give nearly-optimal approximation algorithms for this problem for Max-Cut and for Densest Subgraph.
link.springer.com/article/10.1...