Faculty

Institution

Unit

Venue

Chandra Sekhar Chekuri

Professor

University of Illinois Urbana-Champaign

Affiliations

The Grainger College of Engineering

Siebel School of Computing and Data Science

Chandra Sekhar Chekuri is currently serving as a Siebel School Of Computing And Data Science Professor at University of Illinois Urbana-Champaign.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Chandra Sekhar Chekuri

University of Illinois Urbana-Champaign

Professor

You can click a keyword to filter the displayed items

combinatorial optimization discrete algorithms applied mathematics computer science mathematics graph theory computational complexity mathematical optimization theoretical computer science combinatorics computational optimization graph algorithms approximation theory operations research discrete optimization structural graph theory network analysis combinatorial theory mathematical programming discrete mathematics optimization problems combinatorial problems extremal graph theory network optimization scheduling (computing) computer engineering network algorithms approximation algorithms scheduling problems planar graphs numerical algorithms algorithmic efficiency telecommunication networks integer optimization convex optimization network routing algorithm hypergraph theory randomized algorithms scheduling analysis lower bounds geometric graph theory wireless communications distributed systems networked system design linear programming analysis of algorithms approximation methods directed graphs submodular function maximization matroid theory extremal set theory generalized assignment problem graph g lp relaxation databases parallel programming computational complexity theory query optimization probabilistic graph theory route planning network calculus topological graph theory monotone submodular functions single machine flow time edge-disjoint paths submodular functions lp relaxations release dates logic in computer science automated reasoning scientific computing multiple knapsack problem conjunctive query containment dependent randomized rounding approximation schemes systems engineering algorithm design theory of computation

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs. Society for Industrial and Applied Mathematics eBooks (2025)

Chandra ChekuriRhea Jain

combinatoricsdirected graphsplanar graphsgraph theorygeometric graph theorydiscrete algorithmsgraph algorithmscombinatorial optimizationapplied mathematicsnetwork analysismathematicsplanar digraphs

1/2-Approximate Mms Allocation for Separable Piecewise Linear Concave Valuations. Proceedings of the AAAI Conference on Artificial Intelligence (2024)

Chandra ChekuriPooja KulkarniRucha KulkarniRuta Mehta

valuationfair resource allocationmechanism designfairnessmathematical programmingmarket designmathematical optimizationfair divisioneconomicsgame theoryconcave extensionsapproximate mmscombinatorial optimizationapplied mathematicspolynomial timeeconomic behaviorsocial choicetheoretical economics

Adaptive Out-Orientations With Applications. Society for Industrial and Applied Mathematics eBooks (2024)

Chandra ChekuriAleksander Bjørn ChristiansenJacob HolmIvor van der HoogKent QuanrudEva RotenbergChris Schwiegelshohn

combinatorial optimizationcombinatorial theorytheoretical computer sciencediscrete algorithmscombinatoricsextremal graph theorycomputational geometrystructural graph theorygraph theorycomputational complexitycomputational sciencegraph algorithmsdiscrete mathematicsapplied mathematicsgraph matchingdynamic graphadaptive out-orientationsfully-dynamic graphcomputer science

Contention Resolution for the ℓ -Fold Union of a Matroid via the Correlation Gap. Society for Industrial and Applied Mathematics eBooks (2024)

Chandra ChekuriJunkai SongWeizhong Zhang

correlation gapcomputational complexityoriented matroidsdiscrete algorithmscontention resolutioncombinatorial theorymatroid theorytheoretical computer sciencecombinatorial optimizationdiscrete mathematicscomputer sciencemathematicscontinuous extensions

On Submodular Prophet Inequalities and Correlation Gap. Theoretical Computer Science (2024)

Chandra ChekuriVasilis Livanos

combinatoricslower boundsextremal set theoryset theorydiscrete algorithmssubmodular prophet inequalitiesapplied mathematicsmathematical logicmathematics

Improved Throughput for All-Or-Nothing Multicommodity Flows With Arbitrary Demands. IEEE/ACM Transactions on Networking (2023)

Anya ChaturvediChandra ChekuriMengxue LiuAndréa W. RichaMatthias RostStefan SchmidJamison Weber

packing formulationtelecommunication networksnetwork analysisdistributed systemscomputer engineeringgraph theorycomputational complexityarbitrary demandsnetwork routing algorithmnetwork optimizationtheoretical computer scienceweighted throughputnetwork sciencecombinatorial optimizationdiscrete algorithmsnetworked system designcomputer sciencenetwork routing

Min–Max Partitioning of Hypergraphs and Symmetric Submodular Functions. COMBINATORICA (2023)

Karthekeyan ChandrasekaranChandra Chekuri

combinatoricsextremal graph theoryextremal combinatoricsgraph theorydiscrete algorithmscombinatorial theorymin–max partitioningcombinatorial optimizationdiscrete mathematicsmathematicshypergraph theory

Algorithms for Covering Multiple Submodular Constraints and Applications. Journal of Combinatorial Optimization (2022)

Chandra ChekuriTanmay InamdarKent QuanrudKasturi VaradarajanZhao Zhang

mathematical optimizationoptimization problemscomputational complexityconvex optimizationdiscrete algorithmstheoretical computer sciencecombinatorial optimizationapplied mathematicsfinite groundsubmodular functionscomputer sciencemultiple submodular constraintsmathematics

Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. Society for Industrial and Applied Mathematics eBooks (2022)

Chandra ChekuriKent QuanrudManuel R. Torres

densest subgraphiterative peelingcombinatorial optimizationmathematicsmathematical optimizationcombinatorial theorytheoretical computer sciencediscrete algorithmsnetwork analysiscombinatoricsextremal graph theorystructural graph theorylp relaxationgraph theorygraph algorithmsdiscrete mathematicsapplied mathematicscomputer sciencehypergraph theory

Hypergraph K -Cut for Fixed K in Deterministic Polynomial Time. Mathematics of Operations Research (2022)

Karthekeyan ChandrasekaranChandra Chekuri

combinatorial optimizationmathematicscomputational optimizationmathematical optimizationcombinatorial theorycombinatorial problemstheoretical computer sciencediscrete algorithmscombinatoricstheory of computationstructural graph theorysubtle generalizationgraph theorycomputational complexitygraph algorithmsapplied mathematicsdeterministic polynomial timepolynomial timecomputer sciencehypergraph theory

1
2
3
4
5
14
10 / page

Chandra Sekhar Chekuri

Professor

University of Illinois Urbana-Champaign

Affiliations

The Grainger College of Engineering

Siebel School of Computing and Data Science

Chandra Sekhar Chekuri is currently serving as a Siebel School Of Computing And Data Science Professor at University of Illinois Urbana-Champaign.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Chandra Sekhar Chekuri

University of Illinois Urbana-Champaign

Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs. Society for Industrial and Applied Mathematics eBooks (2025)

Chandra ChekuriRhea Jain

combinatoricsdirected graphsplanar graphsgraph theorygeometric graph theorydiscrete algorithmsgraph algorithmscombinatorial optimizationapplied mathematicsnetwork analysismathematicsplanar digraphs

1/2-Approximate Mms Allocation for Separable Piecewise Linear Concave Valuations. Proceedings of the AAAI Conference on Artificial Intelligence (2024)

Chandra ChekuriPooja KulkarniRucha KulkarniRuta Mehta

Adaptive Out-Orientations With Applications. Society for Industrial and Applied Mathematics eBooks (2024)

Chandra ChekuriAleksander Bjørn ChristiansenJacob HolmIvor van der HoogKent QuanrudEva RotenbergChris Schwiegelshohn

Contention Resolution for the ℓ -Fold Union of a Matroid via the Correlation Gap. Society for Industrial and Applied Mathematics eBooks (2024)

Chandra ChekuriJunkai SongWeizhong Zhang

On Submodular Prophet Inequalities and Correlation Gap. Theoretical Computer Science (2024)

Chandra ChekuriVasilis Livanos

combinatoricslower boundsextremal set theoryset theorydiscrete algorithmssubmodular prophet inequalitiesapplied mathematicsmathematical logicmathematics

Improved Throughput for All-Or-Nothing Multicommodity Flows With Arbitrary Demands. IEEE/ACM Transactions on Networking (2023)

Anya ChaturvediChandra ChekuriMengxue LiuAndréa W. RichaMatthias RostStefan SchmidJamison Weber

Min–Max Partitioning of Hypergraphs and Symmetric Submodular Functions. COMBINATORICA (2023)

Karthekeyan ChandrasekaranChandra Chekuri

Algorithms for Covering Multiple Submodular Constraints and Applications. Journal of Combinatorial Optimization (2022)

Chandra ChekuriTanmay InamdarKent QuanrudKasturi VaradarajanZhao Zhang

Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. Society for Industrial and Applied Mathematics eBooks (2022)

Chandra ChekuriKent QuanrudManuel R. Torres

Hypergraph K -Cut for Fixed K in Deterministic Polynomial Time. Mathematics of Operations Research (2022)

Karthekeyan ChandrasekaranChandra Chekuri

1
2
3
4
5
14
10 / page

Similar Faculty Members

Sariel Har-Peled

Institution

University of Illinois Urbana-Champaign

applied mathematics

mathematics

Timothy Moon-Yew Chan

Institution

University of Illinois Urbana-Champaign

applied mathematics

geometry processing

David P. Williamson

Institution

Cornell University

network science

network algorithm

Jeff Erickson

Institution

University of Illinois Urbana-Champaign

computer science education

applied mathematics

Edward M Reingold

Institution

University of Illinois Urbana-Champaign

computer science

discrete algorithms

David B. Shmoys

Institution

Cornell University

algorithm design

computational engineering

Olgica Milenkovic

Institution

University of Illinois Urbana-Champaign

data science

information theory

Sheldon Howard Jacobson

Institution

University of Illinois Urbana-Champaign

quantum computing

technology

Bruce Hajek

Institution

University of Illinois Urbana-Champaign

game theory

mathematical biology

Sanjeev Khanna

Institution

University of Pennsylvania

discrete algorithm

combinatorial problem

Similar Faculty Members

Sariel Har-Peled

Institution

University of Illinois Urbana-Champaign

applied mathematics

mathematics

Timothy Moon-Yew Chan

Institution

University of Illinois Urbana-Champaign

applied mathematics

geometry processing

David P. Williamson

Institution

Cornell University

network science

network algorithm

Jeff Erickson

Institution

University of Illinois Urbana-Champaign

computer science education

applied mathematics

Edward M Reingold

Institution

University of Illinois Urbana-Champaign

computer science

discrete algorithms

David B. Shmoys

Institution

Cornell University

algorithm design

computational engineering

Olgica Milenkovic

Institution

University of Illinois Urbana-Champaign

data science

information theory

Sheldon Howard Jacobson

Institution

University of Illinois Urbana-Champaign

quantum computing

technology

Bruce Hajek

Institution

University of Illinois Urbana-Champaign

game theory

mathematical biology

Sanjeev Khanna

Institution

University of Pennsylvania

discrete algorithm

combinatorial problem