𝗔𝗽𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻 𝗣𝗿𝗼𝗰𝗲𝗱𝘂𝗿𝗲
Applicants should prepare the following documents in PDF format:
• Curriculum Vitae including publication list
• Research statement describing proposed research (1-2 pages)
• Contact details of two referees (they will be contacted later, if needed)

(6/6)

𝗘𝗹𝗶𝗴𝗶𝗯𝗶𝗹𝗶𝘁𝘆
Candidates must:
• Hold a Ph.D. in Computer Science (in areas related to Algorithms) at the time of joining, with an excellent research record
• Candidates who have submitted their Ph.D. thesis may also apply, provided proof of submission is included with the application.
(5/n)

𝗙𝗲𝗹𝗹𝗼𝘄𝘀𝗵𝗶𝗽 𝗢𝘃𝗲𝗿𝘃𝗶𝗲𝘄
Selected fellows will receive:
• A consolidated fellowship of ₹80,000–1,30,000 per month (depending on experience and profile).
• A research grant for conference travel, computing, and contingency support

Foreign nationals are eligible to apply.

(4/n)

𝗥𝗲𝘀𝗲𝗮𝗿𝗰𝗵 𝗔𝗿𝗲𝗮𝘀 (for postdoc applications)
• Approximation Algorithms
• Online Algorithms
• Fair Division and Algorithmic Game Theory
• Computational Geometry
• Data Structures
• Combinatorial Optimization
• Online Learning
• Beyond Worst-case Analysis
• Spectral Algorithms

(2/n)

(6/6)

𝗥𝗲𝘀𝗲𝗮𝗿𝗰𝗵 𝗶𝘀 𝘆𝗲𝗮𝗿𝘀 𝗼𝗳 𝗳𝗮𝗶𝗹𝘂𝗿𝗲𝘀 𝗮𝗻𝗱 𝗮 𝗳𝗲𝘄 𝗱𝗮𝘆𝘀 𝗼𝗳 𝘀𝘂𝗰𝗰𝗲𝘀𝘀.

🥳 𝗧𝗼𝗱𝗮𝘆 𝗶𝘀 𝗼𝗻𝗲 𝗼𝗳 𝘁𝗵𝗼𝘀𝗲 𝗱𝗮𝘆𝘀. 🥳

(5/n)
📈 The results.
1️⃣ Settles a classical open problem
2️⃣ introduces a resource contraction lemma, a structural tool that is likely to be useful far beyond this specific problem.
3️⃣ The paper establishes connections to fine-grained complexity (k-SUM conjecture), and proves structural barriers.

(4/n) It generalizes the classical knapsack problem (NP-hard but admits PTAS).

The central question that resisted progress for decades was:
Can we get PTAS for the two-dimensional knapsack?
It's repeatedly appeared as a major open question in lists of the top open problems in geometric packing.

(3/n)

The problem: The two-dimensional geometric knapsack problem with rotations lies at the heart of packing, scheduling, and resource allocation.
The problem looks deceptively simple:
𝗚𝗶𝘃𝗲𝗻 𝗮 𝘀𝗲𝘁 𝗼𝗳 𝗿𝗲𝗰𝘁𝗮𝗻𝗴𝗹𝗲𝘀, 𝗽𝗮𝗰𝗸 𝗮𝘀 𝗺𝗮𝗻𝘆 𝗮𝘀 𝗽𝗼𝘀𝘀𝗶𝗯𝗹𝗲 𝗶𝗻𝘁𝗼 𝗮 𝘀𝗾𝘂𝗮𝗿𝗲 𝗶𝗻 𝗮𝗻 𝗮𝘅𝗶𝘀-𝗮𝗹𝗶𝗴𝗻𝗲𝗱 𝘄𝗮𝘆.

We show a mathematically grounded user-interest model capturing these effects and a near-optimal scheduling algorithm for ad timing.

The main takeaway is simple:
Uniform spacing is rarely optimal.
Timing that respects human psychology matters.

Link: arxiv.org/pdf/2509.20304

#ICLR #ML #Algorithms

We build an optimization framework grounded in three well-known effects from psychology:
Mere exposure: early repetitions can increase interest,
Hedonic adaptation: attention eventually decays,
Fatigue / operant conditioning: overexposure backfires.

Traditionally hosted in India, FSTTCS is now taking a historic step. For the first time, FSTTCS 2026 will be held outside India, in Abu Dhabi, UAE.

Looking ahead, FSTTCS 2027 will be hosted at IIT Indore. I am delighted to serve as the PC Chair (Track A) for 2027.

#FSTTCS #India #CS #Theory

Part1:

🏴󠁧󠁢󠁥󠁮󠁧󠁿 🇺🇸 English: www.youtube.com/watch?v=oLVj...

🇮🇳 🇧🇩 Bangla: www.youtube.com/watch?v=3NTp...

Part 2:

🏴󠁧󠁢󠁥󠁮󠁧󠁿 🇺🇸 English: www.youtube.com/watch?v=4-ms...

🇮🇳 🇧🇩 Bangla: www.youtube.com/watch?v=faDg...

Part 3:

🏴󠁧󠁢󠁥󠁮󠁧󠁿 🇺🇸 English: www.youtube.com/watch?v=-OeT...

🇮🇳 🇧🇩 Bangla: www.youtube.com/watch?v=x8rM...