Lightnews — Scholar-powered news

Arindam Khan @arindamkhan.bsky.social · 2d

All these rates are not uniform across subareas. Small subcommunities often push papers from their cliques.

1 2

Reposted by Arindam Khan

Sariel Har-Peled @sarielhp.bsky.social · 8d

Accept more papers!
sarielhp.org/misc/bloge/2...

Accept more papers!

sarielhp.org

1 2 5

Arindam Khan @arindamkhan.bsky.social · 13d

Packing hypercubes & spheres in d-dim: ICALP’22, ICALP’24 — settled with a PTAS!
Online & fairness variants: Algorithmica’21 (random-order arrival), AAMAS’21 (group fairness).
If you’re exploring these directions, I’d love to connect — feel free to reach out after checking out some of these papers.

2

Arindam Khan @arindamkhan.bsky.social · 13d

💫 Some of my recent research on knapsack:
- 2D Knapsack: FOCS’17 paper gave improved approximation after a decade (Jansen–Zhang SODA’04); SOCG’21 showed pseudo-polynomial time can achieve better approximations.
- 3D Knapsack: SOCG’25 paper gave the first improvement since Diedrich et al., 07.

(1/2)

1 1

Arindam Khan @arindamkhan.bsky.social · 13d

💡 Why Knapsack is one of my favorite problems:
✅ Simple to state, hard to solve (NP-hard). Elegant techniques, longstanding open problems!
- 1D Knapsack: allows pseudo-polynomial time algorithms.
- 2D Knapsack: a PTAS remains open.
- 3D & higher: beautiful challenges in geometry.

1 1

Arindam Khan @arindamkhan.bsky.social · 13d

🎒 Knapsack — We understand what's truly important when we pack our bags!

📢 I’ve just rolled out a comprehensive 7-part lecture series on the Knapsack Problem — one of the cornerstone problems in algorithms.

📺 Watch the full series on my channel:
👉 Algo-rindam lnkd.in/gBxPtkCq

1 3

Arindam Khan @arindamkhan.bsky.social · 20d

NeurIPS (and large AI conferences) are becoming a joke 😅

forum.cspaper.org/topic/140/wh...

When Acceptance Isn’t Enough: NeurIPS 2025 rejects 400 accepted papers due to venue crisis?

A Shock to the AI Research Community NeurIPS 2025, the 39th iteration of the world’s premier AI conference, finds itself embroiled in controversy. Despite pr...

forum.cspaper.org

2

Arindam Khan @arindamkhan.bsky.social · 23d

🚀 Biggest Graph Algorithms Workshop in India!

Walmart Center for Tech Excellence (WACE) at CSA, IISc is organizing the Frontiers of Graph Algorithms Workshop, happening during December 8–12, 2025 at the Indian Institute of Science (IISc), Bengaluru! 🎓

Details: algo.csa.iisc.ac.in/graphworkshop/

2 16

Arindam Khan @arindamkhan.bsky.social · 28d

Had a fun and productive week in Germany, participating in the Dagstuhl seminar on Precision in Geometric Algorithms.

Photo: with my "packing" team: Anders Aamand (Rice University), Eunjin Oh (POSTECH), Linda Kleist (U Hamburg), Csaba Toth (CalState), and Mikkel Vind Abrahamsen (U Copenhagen).

6

Arindam Khan @arindamkhan.bsky.social · Sep 2

📺 Watch the lectures:

👉 English:
Part 1: lnkd.in/g3gXx22R
Part 2: lnkd.in/ggEKj4xE
Part 3: lnkd.in/gMBFCshb

👉 Bangla:
Part 1: lnkd.in/gXnXj5z9
Part 2: lnkd.in/gkuV5GMC
Part 3: lnkd.in/g_Ba3env

This link will take you to a page that’s not on LinkedIn

lnkd.in

1

Arindam Khan @arindamkhan.bsky.social · Sep 2

But we do have the magic of algorithms. 💡

In my new video lecture for Design and Analysis of Algorithms, I dive into Interval Scheduling: Given a set of overlapping job requests, find the best non-overlapping subset to serve.

(2/n)

1 2

Arindam Khan @arindamkhan.bsky.social · Sep 2

✨ Magic of Algorithms: Scheduling for Muggles ✨

Remember Hermione in Prisoner of Azkaban?
She wanted to attend all her classes—Care of Magical Creatures, Arithmancy, Muggle Studies … but schedules overlapped. Her secret weapon? The time-turner. ⏳
For us mere muggles, we dn’t have time-turners. 1/n

1 1 3