Theoretical Computer Science Talks
Short Talks

Greedy approximation for the Group Steiner tree problem

Polylogarithmic Inapproximability of Radio Broadcast

Shallowlight ktrees and ktrees for buy at bulk

Complete partitions of graphs

Finding graphs with maximum number of edges with girth at least g

Robust network design with exponential number of scenarios

Approximating some networkdesign problems with node costs

Tight approximation Algorithms for connectivity Augmentation problems

Fault tolerant Group Steiner problems

Approximating some network design problems with degree bounds

On Set Expansion problems

Power optimization for connectivity problems

Approximating Source Location and Star SNDP

Low Risk Kidney Exchange

Integrality gaps for the tree augmentation problem

Bounded Degree Group Steiner Problems
 APPROX2024
Long Talks

Approximation algorithm for nonuniform multicommodity buy at bulk

Multicoloring bounded tree width graphs and planar graphs

Approximating the directed version of the Steiner forest problem

Increasing the connectivity of a graph from 1 to 2

On the Achromatic number problem

The Matroid Secretary problem

What did I learn on cut expansion and density problems?

On the advantage of overlap for clustering

Comparing min cost and min power connectivity problems

Approximating Steiner kForest and Non preemptive Dial a Ride with almost uniform weights

The interesting behavior of the Source Location problem

Tight running times for exact solutions and approximation algorithms

When do weights matter in approximation algorithms?

Using fixed parameter tractable tie or sub exponential time to get better ratios

Improved power covering problems via IRR

Approximating Facility Location and Edge Activation problems
Survey Talks

Multicoloring problems and techniques

Rare Approximation Ratios

Survey On Connectivity via Survey of techniques

An updated survey on the Group Steiner Problem in Graphs

A survey on approximating graph spanners

A survey on approximating graph spanners by Mike Dinitz

A survey on the Tree Augmentation problem

A survey on the Directed Steiner problem

A survey on Treewidth, Planar graphs, and Fixed Parameter Tractability