Chandra Chekuri
According to our database^{1},
Chandra Chekuri
authored at least 173 papers
between 1995 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on dl.acm.org
On csauthors.net:
Bibliography
2023
Comb., June, 2023
CoRR, 2023
CoRR, 2023
Efficient parallel implementation of the multiplicative weight update method for graphbased linear programs.
CoRR, 2023
CoRR, 2023
CoRR, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
Proceedings of the Approximation, 2023
Proceedings of the Approximation, 2023
2022
Math. Oper. Res., November, 2022
Theory Comput., 2022
Improved Throughput for AllorNothing Multicommodity Flows with Arbitrary Demands.
SIGMETRICS Perform. Evaluation Rev., 2022
J. Comb. Optim., 2022
CoRR, 2022
(1ε)approximate fully dynamic densest subgraph: linear space and faster update time.
CoRR, 2022
CoRR, 2022
Proceedings of the 2022 ACMSIAM Symposium on Discrete Algorithms, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022
2021
ACM Trans. Algorithms, 2021
Isolating Cuts, (Bi)Submodularity, and Faster Algorithms for Global Connectivity Problems.
CoRR, 2021
Proceedings of the Algorithmic Game Theory  14th International Symposium, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems.
Proceedings of the Approximation, 2021
2020
Theory Comput., 2020
SIAM J. Discret. Math., 2020
Math. Program., 2020
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
CoRR, 2019
CoRR, 2019
CoRR, 2019
Parallelizing greedy for submodular set function maximization in matroids and beyond.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
Proceedings of the Integer Programming and Combinatorial Optimization, 2019
2018
SIAM J. Discret. Math., 2018
SIAM J. Comput., 2018
SIAM J. Comput., 2018
CoRR, 2018
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018
Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, 2018
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018
Perturbation Resilient Clustering for kCenter and Related Problems via LP Relaxations.
Proceedings of the Approximation, 2018
2017
CoRR, 2017
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
NearLinear Time Approximation Schemes for some Implicit Fractional Packing Problems.
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
Encyclopedia of Algorithms, 2016
Encyclopedia of Algorithms, 2016
J. ACM, 2016
CoRR, 2016
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation.
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
2015
SIAM J. Comput., 2015
Math. Program., 2015
Math. Program., 2015
Algorithmica, 2015
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
On Multiplicative Weight Updates for Concave and Submodular Function Maximization.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
Proceedings of the Automata, Languages, and Programming  42nd International Colloquium, 2015
Proceedings of the Algorithms  ESA 2015, 2015
2014
A Graph Reduction Step Preserving ElementConnectivity and Packing Steiner Trees and Forests.
SIAM J. Discret. Math., 2014
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes.
SIAM J. Comput., 2014
2013
SIAM J. Comput., 2013
J. Comb. Theory, Ser. B, 2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
Polylogarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion.
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Automata, Languages, and Programming  40th International Colloquium, 2013
2012
Theory Comput., 2012
ACM Trans. Algorithms, 2012
ACM Trans. Algorithms, 2012
Algorithmica, 2012
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012
2011
Set connectivity problems in undirected graphs and the directed steiner network problem.
ACM Trans. Algorithms, 2011
SIAM J. Comput., 2011
Math. Oper. Res., 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Automata, Languages and Programming  38th International Colloquium, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2010
SIAM J. Comput., 2010
CoRR, 2010
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling  (Extended Abstract).
Proceedings of the Approximation and Online Algorithms  8th International Workshop, 2010
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
SIAM J. Comput., 2009
Random Struct. Algorithms, 2009
CoRR, 2009
CoRR, 2009
Algorithmica, 2009
Algorithmica, 2009
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009
Proceedings of the Twentieth Annual ACMSIAM Symposium on Discrete Algorithms, 2009
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
Proceedings of the Algorithms, 2009
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009
Proceedings of the Approximation, 2009
Unsplittable Flow in Paths and Trees and ColumnRestricted Packing Integer Programs.
Proceedings of the Approximation, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
SIAM J. Discret. Math., 2008
CoRR, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008
2007
An O(log <i>n</i>) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.
Theory Comput., 2007
ACM Trans. Algorithms, 2007
ACM Trans. Algorithms, 2007
Routing and network design with robustness to changing or uncertain traffic demands.
SIGACT News, 2007
Networks, 2007
IEEE J. Sel. Areas Commun., 2007
CoRR, 2007
Algorithmica, 2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
2006
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow.
Theory Comput., 2006
IEEE Trans. Inf. Theory, 2006
SIAM J. Discret. Math., 2006
SIAM J. Discret. Math., 2006
J. Comput. Syst. Sci., 2006
Discret. Appl. Math., 2006
Bell Labs Tech. J., 2006
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
An <i>O</i>(log<i>n</i>) Approximation Ratio for the Asymmetric Traveling Salesman <i>Path</i> Problem.
Proceedings of the Approximation, 2006
2005
SIAM J. Comput., 2005
Routing bandwidth guaranteed paths with local restoration in label switched networks.
IEEE J. Sel. Areas Commun., 2005
Discret. Appl. Math., 2005
Algorithmica, 2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
Proceedings of the Approximation, 2005
2004
Proceedings of the Handbook of Scheduling  Algorithms, Models, and Performance Analysis., 2004
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem.
SIAM J. Discret. Math., 2004
SIAM J. Comput., 2004
SIAM J. Comput., 2004
Multiprocessor scheduling to minimize flow time with epsilon resource augmentation.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
Proceedings of the Approximation, 2004
2003
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
2001
SIAM J. Comput., 2001
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.
J. Algorithms, 2001
Electron. Colloquium Comput. Complex., 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Approximation algorithms for the metric labeling problem via a new linear programming formulation.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
Theor. Comput. Sci., 2000
Inf. Process. Lett., 2000
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM 2000), 2000
1999
SIAM J. Comput., 1999
J. Algorithms, 1999
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine.
Discret. Appl. Math., 1999
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
1998
PhD thesis, 1998
Proceedings of the VLDB'98, 1998
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and <i>k</i>Median.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
1997
Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms, 1997
1996
Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 1996
Profiledriven Instruction Level Parallel Scheduling with Application to Super Blocks.
Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture, 1996
1995
Proceedings of the Fourteenth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 1995