Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Chandra Chekuri
@inproceedings{DBLP:conf/aaai/ChekuriKKM24,
author = {Chandra Chekuri and
Pooja Kulkarni and
Rucha Kulkarni and
Ruta Mehta},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {1/2-Approximate {MMS} Allocation for Separable Piecewise Linear Concave
Valuations},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {9590--9597},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i9.28815},
doi = {10.1609/AAAI.V38I9.28815},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/ChekuriKKM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriCHHQRS24,
author = {Chandra Chekuri and
Aleksander Bj{\o}rn Grodt Christiansen and
Jacob Holm and
Ivor {van der Hoog} and
Kent Quanrud and
Eva Rotenberg and
Chris Schwiegelshohn},
editor = {David P. Woodruff},
title = {Adaptive Out-Orientations with Applications},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {3062--3088},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.110},
doi = {10.1137/1.9781611977912.110},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriCHHQRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ChekuriSZ24,
author = {Chandra Chekuri and
Junkai Song and
Weizhong Zhang},
editor = {Merav Parter and
Seth Pettie},
title = {Contention Resolution for the \emph{{\(\mathscr{l}\)}}-fold union
of a matroid via the correlation gap},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {396--405},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.36},
doi = {10.1137/1.9781611977936.36},
timestamp = {Wed, 10 Apr 2024 20:26:09 +0200},
biburl = {https://dblp.org/rec/conf/sosa/ChekuriSZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-15547,
author = {Chandra Chekuri and
Rhea Jain},
title = {Approximation Algorithms for Network Design in Non-Uniform Fault Models},
journal = {CoRR},
volume = {abs/2403.15547},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.15547},
doi = {10.48550/ARXIV.2403.15547},
eprinttype = {arXiv},
eprint = {2403.15547},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-15547.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ChandrasekaranC23,
author = {Karthekeyan Chandrasekaran and
Chandra Chekuri},
title = {Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions},
journal = {Comb.},
volume = {43},
number = {3},
pages = {455--477},
year = {2023},
url = {https://doi.org/10.1007/s00493-023-00021-y},
doi = {10.1007/S00493-023-00021-Y},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ChandrasekaranC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BajpaiC23,
author = {Tanvi Bajpai and
Chandra Chekuri},
editor = {Nicole Megow and
Adam D. Smith},
title = {Bicriteria Approximation Algorithms for Priority Matroid Median},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {7:1--7:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.7},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.7},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/BajpaiC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriQ23,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Nicole Megow and
Adam D. Smith},
title = {Independent Sets in Elimination Graphs with a Submodular Objective},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {24:1--24:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.24},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.24},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChekuriQ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HarbQC23,
author = {Elfarouk Harb and
Kent Quanrud and
Chandra Chekuri},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid
and Applications to Densest Subgraph and Tree Packing},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {56:1--56:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.56},
doi = {10.4230/LIPICS.ESA.2023.56},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/HarbQC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriJ23,
author = {Chandra Chekuri and
Rhea Jain},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Approximation Algorithms for Network Design in Non-Uniform Fault Models},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {36:1--36:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.36},
doi = {10.4230/LIPICS.ICALP.2023.36},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-12850,
author = {Karthekeyan Chandrasekaran and
Chandra Chekuri and
Samuel Fiorini and
Shubhang Kulkarni and
Stefan Weltge},
title = {Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion
Set},
journal = {CoRR},
volume = {abs/2303.12850},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.12850},
doi = {10.48550/ARXIV.2303.12850},
eprinttype = {arXiv},
eprint = {2303.12850},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-12850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-02987,
author = {Elfarouk Harb and
Kent Quanrud and
Chandra Chekuri},
title = {Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid
and Applications to Densest Subgraph and Tree Packing},
journal = {CoRR},
volume = {abs/2305.02987},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.02987},
doi = {10.48550/ARXIV.2305.02987},
eprinttype = {arXiv},
eprint = {2305.02987},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-02987.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-02172,
author = {Chandra Chekuri and
Manuel R. Torres},
title = {On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms},
journal = {CoRR},
volume = {abs/2306.02172},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.02172},
doi = {10.48550/ARXIV.2306.02172},
eprinttype = {arXiv},
eprint = {2306.02172},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-02172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-02022,
author = {Chandra Chekuri and
Kent Quanrud},
title = {Independent Sets in Elimination Graphs with a Submodular Objective},
journal = {CoRR},
volume = {abs/2307.02022},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.02022},
doi = {10.48550/ARXIV.2307.02022},
eprinttype = {arXiv},
eprint = {2307.02022},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-02022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-03307,
author = {Caleb Ju and
Serif Yesil and
Mengyuan Sun and
Chandra Chekuri and
Edgar Solomonik},
title = {Efficient parallel implementation of the multiplicative weight update
method for graph-based linear programs},
journal = {CoRR},
volume = {abs/2307.03307},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.03307},
doi = {10.48550/ARXIV.2307.03307},
eprinttype = {arXiv},
eprint = {2307.03307},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-03307.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-18146,
author = {Chandra Chekuri and
Aleksander Bj{\o}rn Grodt Christiansen and
Jacob Holm and
Ivor {van der Hoog} and
Kent Quanrud and
Eva Rotenberg and
Chris Schwiegelshohn},
title = {Adaptive Out-Orientations with Applications},
journal = {CoRR},
volume = {abs/2310.18146},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.18146},
doi = {10.48550/ARXIV.2310.18146},
eprinttype = {arXiv},
eprint = {2310.18146},
timestamp = {Thu, 02 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-18146.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-08504,
author = {Chandra Chekuri and
Pooja Kulkarni and
Rucha Kulkarni and
Ruta Mehta},
title = {1/2 Approximate {MMS} Allocation for Separable Piecewise Linear Concave
Valuations},
journal = {CoRR},
volume = {abs/2312.08504},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.08504},
doi = {10.48550/ARXIV.2312.08504},
eprinttype = {arXiv},
eprint = {2312.08504},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-08504.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChekuriIQVZ22,
author = {Chandra Chekuri and
Tanmay Inamdar and
Kent Quanrud and
Kasturi R. Varadarajan and
Zhao Zhang},
title = {Algorithms for covering multiple submodular constraints and applications},
journal = {J. Comb. Optim.},
volume = {44},
number = {2},
pages = {979--1010},
year = {2022},
url = {https://doi.org/10.1007/s10878-022-00874-x},
doi = {10.1007/S10878-022-00874-X},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChekuriIQVZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/ChandrasekaranC22,
author = {Karthekeyan Chandrasekaran and
Chandra Chekuri},
title = {Hypergraph \emph{k}-Cut for Fixed \emph{k} in Deterministic Polynomial
Time},
journal = {Math. Oper. Res.},
volume = {47},
number = {4},
pages = {3380--3399},
year = {2022},
url = {https://doi.org/10.1287/moor.2021.1250},
doi = {10.1287/MOOR.2021.1250},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/ChandrasekaranC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmetrics/ChaturvediCRRSW22,
author = {Anya Chaturvedi and
Chandra Chekuri and
Andr{\'{e}}a W. Richa and
Matthias Rost and
Stefan Schmid and
Jamison Weber},
title = {Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary
Demands},
journal = {{SIGMETRICS} Perform. Evaluation Rev.},
volume = {49},
number = {3},
pages = {22--27},
year = {2022},
url = {https://doi.org/10.1145/3529113.3529121},
doi = {10.1145/3529113.3529121},
timestamp = {Wed, 31 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigmetrics/ChaturvediCRRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Chekuri022,
author = {Chandra Chekuri and
Tanmay Inamdar},
title = {Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks},
journal = {Theory Comput.},
volume = {18},
pages = {1--19},
year = {2022},
url = {https://theoryofcomputing.org/articles/v018a018/},
timestamp = {Thu, 02 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/Chekuri022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BeidemanCC022,
author = {Calvin Beideman and
Karthekeyan Chandrasekaran and
Chandra Chekuri and
Chao Xu},
editor = {Anuj Dawar and
Venkatesan Guruswami},
title = {Approximate Representation of Symmetric Submodular Functions via Hypergraph
Cut Functions},
booktitle = {42nd {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2022, December 18-20, 2022,
{IIT} Madras, Chennai, India},
series = {LIPIcs},
volume = {250},
pages = {6:1--6:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2022.6},
doi = {10.4230/LIPICS.FSTTCS.2022.6},
timestamp = {Wed, 14 Dec 2022 11:57:55 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BeidemanCC022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/HarbQC22,
author = {Elfarouk Harb and
Kent Quanrud and
Chandra Chekuri},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Faster and Scalable Algorithms for Densest Subgraph and Decomposition},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/ac8fbba029dadca99d6b8c3f913d3ed6-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/HarbQC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriQT22,
author = {Chandra Chekuri and
Kent Quanrud and
Manuel R. Torres},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Densest Subgraph: Supermodularity, Iterative Peeling, and Flow},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {1531--1555},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.64},
doi = {10.1137/1.9781611977073.64},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriQT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-12273,
author = {Chandra Chekuri and
Rhea Jain},
title = {Augmentation based Approximation Algorithms for Flexible Network Design},
journal = {CoRR},
volume = {abs/2209.12273},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.12273},
doi = {10.48550/ARXIV.2209.12273},
eprinttype = {arXiv},
eprint = {2209.12273},
timestamp = {Wed, 05 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-12273.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-01888,
author = {Tanvi Bajpai and
Chandra Chekuri},
title = {Bicriteria Approximation Algorithms for Priority Matroid Median},
journal = {CoRR},
volume = {abs/2210.01888},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.01888},
doi = {10.48550/ARXIV.2210.01888},
eprinttype = {arXiv},
eprint = {2210.01888},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-01888.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-02611,
author = {Chandra Chekuri and
Kent Quanrud},
title = {(1-{\(\epsilon\)})-approximate fully dynamic densest subgraph: linear
space and faster update time},
journal = {CoRR},
volume = {abs/2210.02611},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.02611},
doi = {10.48550/ARXIV.2210.02611},
eprinttype = {arXiv},
eprint = {2210.02611},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-02611.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-08324,
author = {Chandra Chekuri and
Rhea Jain},
title = {Approximating Flexible Graph Connectivity via R{\"{a}}cke Tree
based Rounding},
journal = {CoRR},
volume = {abs/2211.08324},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.08324},
doi = {10.48550/ARXIV.2211.08324},
eprinttype = {arXiv},
eprint = {2211.08324},
timestamp = {Wed, 23 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-08324.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriEV21,
author = {Chandra Chekuri and
Alina Ene and
Ali Vakilian},
title = {Node-weighted Network Design in Planar and Minor-closed Families of
Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {2},
pages = {14:1--14:25},
year = {2021},
url = {https://doi.org/10.1145/3447959},
doi = {10.1145/3447959},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ChekuriEV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriQT21,
author = {Chandra Chekuri and
Kent Quanrud and
Manuel R. Torres},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Fast Approximation Algorithms for Bounded Degree and Crossing Spanning
Tree Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {24:1--24:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.24},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.24},
timestamp = {Tue, 21 Sep 2021 09:36:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChekuriQT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BajpaiCCN21,
author = {Tanvi Bajpai and
Deeparnab Chakrabarty and
Chandra Chekuri and
Maryam Negahbani},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Revisiting Priority k-Center: Fairness and Outliers},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {21:1--21:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.21},
doi = {10.4230/LIPICS.ICALP.2021.21},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BajpaiCCN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriQ21,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Faster Algorithms for Rooted Connectivity in Directed Graphs},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {49:1--49:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.49},
doi = {10.4230/LIPICS.ICALP.2021.49},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriQ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriQ21a,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {50:1--50:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.50},
doi = {10.4230/LIPICS.ICALP.2021.50},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriQ21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/ChekuriL21,
author = {Chandra Chekuri and
Vasilis Livanos},
editor = {Ioannis Caragiannis and
Kristoffer Arnsfelt Hansen},
title = {On Submodular Prophet Inequalities and Correlation Gap},
booktitle = {Algorithmic Game Theory - 14th International Symposium, {SAGT} 2021,
Aarhus, Denmark, September 21-24, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12885},
pages = {410},
publisher = {Springer},
year = {2021},
url = {https://link.springer.com/content/pdf/bbm\%3A978-3-030-85947-3\%2F1.pdf},
timestamp = {Wed, 27 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/ChekuriL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChandrasekaranC21,
author = {Karthekeyan Chandrasekaran and
Chandra Chekuri},
editor = {D{\'{a}}niel Marx},
title = {Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1026--1038},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.64},
doi = {10.1137/1.9781611976465.64},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChandrasekaranC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2021,
editor = {Mikolaj Bojanczyk and
Chandra Chekuri},
title = {41st {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021,
Virtual Conference},
series = {LIPIcs},
volume = {213},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-215-0},
isbn = {978-3-95977-215-0},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-03337,
author = {Tanvi Bajpai and
Deeparnab Chakrabarty and
Chandra Chekuri and
Maryam Negahbani},
title = {Revisiting Priority k-Center: Fairness and Outliers},
journal = {CoRR},
volume = {abs/2103.03337},
year = {2021},
url = {https://arxiv.org/abs/2103.03337},
eprinttype = {arXiv},
eprint = {2103.03337},
timestamp = {Mon, 15 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-03337.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-12908,
author = {Chandra Chekuri and
Kent Quanrud},
title = {Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global
Connectivity Problems},
journal = {CoRR},
volume = {abs/2103.12908},
year = {2021},
url = {https://arxiv.org/abs/2103.12908},
eprinttype = {arXiv},
eprint = {2103.12908},
timestamp = {Tue, 06 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-12908.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-07205,
author = {Chandra Chekuri and
Kent Quanrud},
title = {Faster Algorithms for Rooted Connectivity in Directed Graphs},
journal = {CoRR},
volume = {abs/2104.07205},
year = {2021},
url = {https://arxiv.org/abs/2104.07205},
eprinttype = {arXiv},
eprint = {2104.07205},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-07205.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-03662,
author = {Chandra Chekuri and
Vasilis Livanos},
title = {On Submodular Prophet Inequalities and Correlation Gap},
journal = {CoRR},
volume = {abs/2107.03662},
year = {2021},
url = {https://arxiv.org/abs/2107.03662},
eprinttype = {arXiv},
eprint = {2107.03662},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-03662.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChekuriQT20,
author = {Chandra Chekuri and
Kent Quanrud and
Manuel R. Torres},
title = {{\(\mathscr{l}\)} \({}_{\mbox{1}}\)-Sparsity approximation bounds
for packing integer programs},
journal = {Math. Program.},
volume = {183},
number = {1},
pages = {195--214},
year = {2020},
url = {https://doi.org/10.1007/s10107-020-01472-7},
doi = {10.1007/S10107-020-01472-7},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/ChekuriQT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChekuriQX20,
author = {Chandra Chekuri and
Kent Quanrud and
Chao Xu},
title = {{LP} Relaxation and Tree Packing for Minimum k-Cut},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {2},
pages = {1334--1353},
year = {2020},
url = {https://doi.org/10.1137/19M1299359},
doi = {10.1137/19M1299359},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChekuriQX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChekuriL20,
author = {Chandra Chekuri and
Shi Li},
title = {On the Hardness of Approximating the k-Way Hypergraph Cut problem},
journal = {Theory Comput.},
volume = {16},
pages = {1--8},
year = {2020},
url = {https://doi.org/10.4086/toc.2020.v016a014},
doi = {10.4086/TOC.2020.V016A014},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChekuriL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChandrasekaranC20,
author = {Karthekeyan Chandrasekaran and
Chandra Chekuri},
editor = {Sandy Irani},
title = {Hypergraph {\textdollar}k{\textdollar}-cut for fixed {\textdollar}k{\textdollar}
in deterministic polynomial time},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {810--821},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00080},
doi = {10.1109/FOCS46700.2020.00080},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChandrasekaranC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriHQ20,
author = {Chandra Chekuri and
Sariel Har{-}Peled and
Kent Quanrud},
editor = {Shuchi Chawla},
title = {Fast LP-based Approximations for Geometric Packing and Covering Problems},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1019--1038},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.62},
doi = {10.1137/1.9781611975994.62},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriHQ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-12442,
author = {Karthekeyan Chandrasekaran and
Chandra Chekuri},
title = {Hypergraph k-cut for fixed k in deterministic polynomial time},
journal = {CoRR},
volume = {abs/2009.12442},
year = {2020},
url = {https://arxiv.org/abs/2009.12442},
eprinttype = {arXiv},
eprint = {2009.12442},
timestamp = {Wed, 30 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-12442.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-03194,
author = {Chandra Chekuri and
Kent Quanrud and
Manuel R. Torres},
title = {Fast Approximation Algorithms for Bounded Degree and Crossing Spanning
Tree Problems},
journal = {CoRR},
volume = {abs/2011.03194},
year = {2020},
url = {https://arxiv.org/abs/2011.03194},
eprinttype = {arXiv},
eprint = {2011.03194},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-03194.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ChekuriQT19,
author = {Chandra Chekuri and
Kent Quanrud and
Manuel R. Torres},
editor = {Andrea Lodi and
Viswanath Nagarajan},
title = {{\textbackslash}ell {\_}1 -sparsity Approximation Bounds for Packing
Integer Programs},
booktitle = {Integer Programming and Combinatorial Optimization - 20th International
Conference, {IPCO} 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11480},
pages = {128--140},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17953-3\_10},
doi = {10.1007/978-3-030-17953-3\_10},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ChekuriQT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriQ019,
author = {Chandra Chekuri and
Kent Quanrud and
Chao Xu},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {{LP} Relaxation and Tree Packing for Minimum k-cuts},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {7:1--7:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.7},
doi = {10.4230/OASICS.SOSA.2019.7},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriQ019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriQ19,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Timothy M. Chan},
title = {Submodular Function Maximization in Parallel via the Multilinear Relaxation},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {303--322},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.20},
doi = {10.1137/1.9781611975482.20},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriQ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriQ19a,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Timothy M. Chan},
title = {On Approximating (Sparse) Covering Integer Programs},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1596--1615},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.97},
doi = {10.1137/1.9781611975482.97},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriQ19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriQ19,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Moses Charikar and
Edith Cohen},
title = {Parallelizing greedy for submodular set function maximization in matroids
and beyond},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {78--89},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316406},
doi = {10.1145/3313276.3316406},
timestamp = {Sat, 22 Jun 2019 17:42:26 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriQ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-08698,
author = {Chandra Chekuri and
Kent Quanrud and
Manuel R. Torres},
title = {{\textdollar}{\textbackslash}ell{\_}1{\textdollar}-sparsity Approximation
Bounds for Packing Integer Programs},
journal = {CoRR},
volume = {abs/1902.08698},
year = {2019},
url = {http://arxiv.org/abs/1902.08698},
eprinttype = {arXiv},
eprint = {1902.08698},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-08698.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04413,
author = {Chandra Chekuri and
Kent Quanrud and
Zhao Zhang},
title = {On Approximating Partial Set Cover and Generalizations},
journal = {CoRR},
volume = {abs/1907.04413},
year = {2019},
url = {http://arxiv.org/abs/1907.04413},
eprinttype = {arXiv},
eprint = {1907.04413},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04413.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-07616,
author = {Chandra Chekuri and
Alina Ene and
Ali Vakilian},
title = {Node-Weighted Network Design in Planar and Minor-Closed Families of
Graphs},
journal = {CoRR},
volume = {abs/1910.07616},
year = {2019},
url = {http://arxiv.org/abs/1910.07616},
eprinttype = {arXiv},
eprint = {1910.07616},
timestamp = {Tue, 22 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-07616.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01374,
author = {Chandra Chekuri and
Tanmay Inamdar},
title = {Algorithms for Intersection Graphs of Multiple Intervals and Pseudo
Disks},
journal = {CoRR},
volume = {abs/1911.01374},
year = {2019},
url = {http://arxiv.org/abs/1911.01374},
eprinttype = {arXiv},
eprint = {1911.01374},
timestamp = {Wed, 13 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01374.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriS18,
author = {Chandra Chekuri and
Anastasios Sidiropoulos},
title = {Approximation Algorithms for Euler Genus and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1610--1643},
year = {2018},
url = {https://doi.org/10.1137/14099228X},
doi = {10.1137/14099228X},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chekuri018,
author = {Chandra Chekuri and
Chao Xu},
title = {Minimum Cuts and Sparsification in Hypergraphs},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2118--2156},
year = {2018},
url = {https://doi.org/10.1137/18M1163865},
doi = {10.1137/18M1163865},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chekuri018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChekuriEP18,
author = {Chandra Chekuri and
Alina Ene and
Marcin Pilipczuk},
title = {Constant Congestion Routing of Symmetric Demands in Planar Directed
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {2134--2160},
year = {2018},
url = {https://doi.org/10.1137/17M1150694},
doi = {10.1137/17M1150694},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChekuriEP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriG18,
author = {Chandra Chekuri and
Shalmoli Gupta},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Perturbation Resilient Clustering for k-Center and Related Problems
via {LP} Relaxations},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {9:1--9:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.9},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.9},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChekuriG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriR18,
author = {Chandra Chekuri and
Thapanapong Rukkanchanunt},
editor = {Raimund Seidel},
title = {A Note on Iterated Rounding for the Survivable Network Design Problem},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {2:1--2:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.2},
doi = {10.4230/OASICS.SOSA.2018.2},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriI18,
author = {Chandra Chekuri and
Mark Idleman},
editor = {Raimund Seidel},
title = {Congestion Minimization for Multipath Routing via Multiroute Flows},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {3:1--3:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.3},
doi = {10.4230/OASICS.SOSA.2018.3},
timestamp = {Tue, 09 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriQ18,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Artur Czumaj},
title = {Randomized {MWU} for Positive LPs},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {358--377},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.25},
doi = {10.1137/1.9781611975031.25},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriQ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-01242,
author = {Chandra Chekuri and
Kent Quanrud},
title = {Fast Approximations for Metric-TSP via Linear Programming},
journal = {CoRR},
volume = {abs/1802.01242},
year = {2018},
url = {http://arxiv.org/abs/1802.01242},
eprinttype = {arXiv},
eprint = {1802.01242},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-01242.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-04202,
author = {Chandra Chekuri and
Shalmoli Gupta},
title = {Perturbation Resilient Clustering for k-Center and Related Problems
via {LP} Relaxations},
journal = {CoRR},
volume = {abs/1806.04202},
year = {2018},
url = {http://arxiv.org/abs/1806.04202},
eprinttype = {arXiv},
eprint = {1806.04202},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-04202.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-08678,
author = {Chandra Chekuri and
Kent Quanrud},
title = {Submodular Function Maximization in Parallel via the Multilinear Relaxation},
journal = {CoRR},
volume = {abs/1807.08678},
year = {2018},
url = {http://arxiv.org/abs/1807.08678},
eprinttype = {arXiv},
eprint = {1807.08678},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-08678.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-11538,
author = {Chandra Chekuri and
Kent Quanrud},
title = {On Approximating (Sparse) Covering Integer Programs},
journal = {CoRR},
volume = {abs/1807.11538},
year = {2018},
url = {http://arxiv.org/abs/1807.11538},
eprinttype = {arXiv},
eprint = {1807.11538},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-11538.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-05765,
author = {Chandra Chekuri and
Kent Quanrud and
Chao Xu},
title = {{LP} Relaxation and Tree Packing for Minimum k-cuts},
journal = {CoRR},
volume = {abs/1808.05765},
year = {2018},
url = {http://arxiv.org/abs/1808.05765},
eprinttype = {arXiv},
eprint = {1808.05765},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-05765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-12568,
author = {Chandra Chekuri and
Kent Quanrud},
title = {Parallelizing greedy for submodular set function maximization in matroids
and beyond},
journal = {CoRR},
volume = {abs/1811.12568},
year = {2018},
url = {http://arxiv.org/abs/1811.12568},
eprinttype = {arXiv},
eprint = {1811.12568},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-12568.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriQ17,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Chris Umans},
title = {Approximating the Held-Karp Bound for Metric {TSP} in Nearly-Linear
Time},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {789--800},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.78},
doi = {10.1109/FOCS.2017.78},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriQ17,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Philip N. Klein},
title = {Near-Linear Time Approximation Schemes for some Implicit Fractional
Packing Problems},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {801--820},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.51},
doi = {10.1137/1.9781611974782.51},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriM17,
author = {Chandra Chekuri and
Vivek Madan},
editor = {Philip N. Klein},
title = {Approximating Multicut and the Demand Graph},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {855--874},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.54},
doi = {10.1137/1.9781611974782.54},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriX17,
author = {Chandra Chekuri and
Chao Xu},
editor = {Philip N. Klein},
title = {Computing minimum cuts in hypergraphs},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1085--1100},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.70},
doi = {10.1137/1.9781611974782.70},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChekuriQ17,
author = {Chandra Chekuri and
Kent Quanrud},
title = {Approximating the Held-Karp Bound for Metric {TSP} in Nearly-Linear
Time},
journal = {CoRR},
volume = {abs/1702.04307},
year = {2017},
url = {http://arxiv.org/abs/1702.04307},
eprinttype = {arXiv},
eprint = {1702.04307},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChekuriQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChekuriX17,
author = {Chandra Chekuri and
Chao Xu},
title = {A note on approximate strengths of edges in a hypergraph},
journal = {CoRR},
volume = {abs/1703.03849},
year = {2017},
url = {http://arxiv.org/abs/1703.03849},
eprinttype = {arXiv},
eprint = {1703.03849},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChekuriX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChekuriC16,
author = {Chandra Chekuri and
Julia Chuzhoy},
title = {Polynomial Bounds for the Grid-Minor Theorem},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {40:1--40:65},
year = {2016},
url = {https://doi.org/10.1145/2820609},
doi = {10.1145/2820609},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChekuriC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriEP16,
author = {Chandra Chekuri and
Alina Ene and
Marcin Pilipczuk},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Constant Congestion Routing of Symmetric Demands in Planar Directed
Graphs},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {7:1--7:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.7},
doi = {10.4230/LIPICS.ICALP.2016.7},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriEP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriQ16,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Robert Krauthgamer},
title = {A Fast Approximation for Maximum Weight Matroid Intersection},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {445--457},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch33},
doi = {10.1137/1.9781611974331.CH33},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriQ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriM16,
author = {Chandra Chekuri and
Vivek Madan},
editor = {Robert Krauthgamer},
title = {Simple and Fast Rounding Algorithms for Directed and Node-weighted
Multiway Cut},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {797--807},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch57},
doi = {10.1137/1.9781611974331.CH57},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriM16a,
author = {Chandra Chekuri and
Vivek Madan},
editor = {Robert Krauthgamer},
title = {Constant Factor Approximation for Subset Feedback Set Problems via
a new {LP} relaxation},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {808--820},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch58},
doi = {10.1137/1.9781611974331.CH58},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriM16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/LangbergC16,
author = {Michael Langberg and
Chandra Chekuri},
title = {Graph Coloring},
booktitle = {Encyclopedia of Algorithms},
pages = {869--872},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_170},
doi = {10.1007/978-1-4939-2864-4\_170},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/LangbergC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Chekuri16,
author = {Chandra Chekuri},
title = {Multicommodity Flow, Well-linked Terminals and Routing Problems},
booktitle = {Encyclopedia of Algorithms},
pages = {1359--1363},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_244},
doi = {10.1007/978-1-4939-2864-4\_244},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Chekuri16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChekuriM16,
author = {Chandra Chekuri and
Vivek Madan},
title = {Approximating Multicut and the Demand Graph},
journal = {CoRR},
volume = {abs/1607.07200},
year = {2016},
url = {http://arxiv.org/abs/1607.07200},
eprinttype = {arXiv},
eprint = {1607.07200},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChekuriM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChekuriX16,
author = {Chandra Chekuri and
Chao Xu},
title = {Computing minimum cuts in hypergraphs},
journal = {CoRR},
volume = {abs/1607.08682},
year = {2016},
url = {http://arxiv.org/abs/1607.08682},
eprinttype = {arXiv},
eprint = {1607.08682},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChekuriX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChekuriR16,
author = {Chandra Chekuri and
Thapanapong Rukkanchanunt},
title = {A note on the Survivable Network Design Problem},
journal = {CoRR},
volume = {abs/1608.02515},
year = {2016},
url = {http://arxiv.org/abs/1608.02515},
eprinttype = {arXiv},
eprint = {1608.02515},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChekuriR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChakrabartyCKK15,
author = {Deeparnab Chakrabarty and
Chandra Chekuri and
Sanjeev Khanna and
Nitish Korula},
title = {Approximability of Capacitated Network Design},
journal = {Algorithmica},
volume = {72},
number = {2},
pages = {493--514},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9862-4},
doi = {10.1007/S00453-013-9862-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChakrabartyCKK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AnBCGMS15,
author = {Hyung{-}Chan An and
Aditya Bhaskara and
Chandra Chekuri and
Shalmoli Gupta and
Vivek Madan and
Ola Svensson},
title = {Centrality of trees for capacitated k-center},
journal = {Math. Program.},
volume = {154},
number = {1-2},
pages = {29--53},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0857-y},
doi = {10.1007/S10107-014-0857-Y},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AnBCGMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChekuriE15,
author = {Chandra Chekuri and
Alina Ene},
title = {The all-or-nothing flow problem in directed graphs with symmetric
demand pairs},
journal = {Math. Program.},
volume = {154},
number = {1-2},
pages = {249--272},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0856-z},
doi = {10.1007/S10107-014-0856-Z},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ChekuriE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriKRV15,
author = {Chandra Chekuri and
Sreeram Kannan and
Adnan Raja and
Pramod Viswanath},
title = {Multicommodity Flows and Cuts in Polymatroidal Networks},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {4},
pages = {912--943},
year = {2015},
url = {https://doi.org/10.1137/130906830},
doi = {10.1137/130906830},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriKRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChekuriRX15,
author = {Chandra Chekuri and
Thapanapong Rukkanchanunt and
Chao Xu},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {On Element-Connectivity Preserving Graph Simplification},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {313--324},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_27},
doi = {10.1007/978-3-662-48350-3\_27},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/ChekuriRX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriGQ15,
author = {Chandra Chekuri and
Shalmoli Gupta and
Kent Quanrud},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Streaming Algorithms for Submodular Function Maximization},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {318--330},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_26},
doi = {10.1007/978-3-662-47672-7\_26},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriGQ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChekuriJV15,
author = {Chandra Chekuri and
T. S. Jayram and
Jan Vondr{\'{a}}k},
editor = {Tim Roughgarden},
title = {On Multiplicative Weight Updates for Concave and Submodular Function
Maximization},
booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
pages = {201--210},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2688073.2688086},
doi = {10.1145/2688073.2688086},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ChekuriJV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ChekuriKKV15,
author = {Chandra Chekuri and
Sudeep Kamath and
Sreeram Kannan and
Pramod Viswanath},
title = {Delay-constrained unicast and the triangle-cast problem},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2015,
Hong Kong, China, June 14-19, 2015},
pages = {804--808},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ISIT.2015.7282566},
doi = {10.1109/ISIT.2015.7282566},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/ChekuriKKV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriC15,
author = {Chandra Chekuri and
Julia Chuzhoy},
editor = {Piotr Indyk},
title = {Degree-3 Treewidth Sparsifiers},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {242--255},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.19},
doi = {10.1137/1.9781611973730.19},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChekuriGQ15,
author = {Chandra Chekuri and
Shalmoli Gupta and
Kent Quanrud},
title = {Streaming Algorithms for Submodular Function Maximization},
journal = {CoRR},
volume = {abs/1504.08024},
year = {2015},
url = {http://arxiv.org/abs/1504.08024},
eprinttype = {arXiv},
eprint = {1504.08024},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChekuriGQ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChekuriM15,
author = {Chandra Chekuri and
Vivek Madan},
title = {Simple and Fast Rounding Algorithms for Directed and Node-weighted
Multiway Cut},
journal = {CoRR},
volume = {abs/1507.04674},
year = {2015},
url = {http://arxiv.org/abs/1507.04674},
eprinttype = {arXiv},
eprint = {1507.04674},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChekuriM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriVZ14,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k and
Rico Zenklusen},
title = {Submodular Function Maximization via the Multilinear Relaxation and
Contention Resolution Schemes},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {6},
pages = {1831--1879},
year = {2014},
url = {https://doi.org/10.1137/110839655},
doi = {10.1137/110839655},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriVZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChekuriK14,
author = {Chandra Chekuri and
Nitish Korula},
title = {A Graph Reduction Step Preserving Element-Connectivity and Packing
Steiner Trees and Forests},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {2},
pages = {577--597},
year = {2014},
url = {https://doi.org/10.1137/120882147},
doi = {10.1137/120882147},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChekuriK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AnBCGMS14,
author = {Hyung{-}Chan An and
Aditya Bhaskara and
Chandra Chekuri and
Shalmoli Gupta and
Vivek Madan and
Ola Svensson},
editor = {Jon Lee and
Jens Vygen},
title = {Centrality of Trees for Capacitated k-Center},
booktitle = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
pages = {52--63},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0\_5},
doi = {10.1007/978-3-319-07557-0\_5},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AnBCGMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ChekuriE14,
author = {Chandra Chekuri and
Alina Ene},
editor = {Jon Lee and
Jens Vygen},
title = {The All-or-Nothing Flow Problem in Directed Graphs with Symmetric
Demand Pairs},
booktitle = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
pages = {222--233},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0\_19},
doi = {10.1007/978-3-319-07557-0\_19},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ChekuriE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriC14,
author = {Chandra Chekuri and
Julia Chuzhoy},
editor = {David B. Shmoys},
title = {Polynomial bounds for the grid-minor theorem},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {60--69},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591813},
doi = {10.1145/2591796.2591813},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2014,
editor = {Chandra Chekuri},
title = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402},
doi = {10.1137/1.9781611973402},
isbn = {978-1-61197-338-9},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChekuriC14,
author = {Chandra Chekuri and
Julia Chuzhoy},
title = {Degree-3 Treewidth Sparsifiers},
journal = {CoRR},
volume = {abs/1410.1016},
year = {2014},
url = {http://arxiv.org/abs/1410.1016},
eprinttype = {arXiv},
eprint = {1410.1016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChekuriC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ChekuriSW13,
author = {Chandra Chekuri and
F. Bruce Shepherd and
Christophe Weibel},
title = {Flow-cut gaps for integer and fractional multiflows},
journal = {J. Comb. Theory, Ser. {B}},
volume = {103},
number = {2},
pages = {248--273},
year = {2013},
url = {https://doi.org/10.1016/j.jctb.2012.11.002},
doi = {10.1016/J.JCTB.2012.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ChekuriSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriKS13,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {The All-or-Nothing Multicommodity Flow Problem},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {4},
pages = {1467--1493},
year = {2013},
url = {https://doi.org/10.1137/100796820},
doi = {10.1137/100796820},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriS13,
author = {Chandra Chekuri and
Anastasios Sidiropoulos},
title = {Approximation Algorithms for Euler Genus and Related Problems},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {167--176},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.26},
doi = {10.1109/FOCS.2013.26},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriNS13,
author = {Chandra Chekuri and
Guyslain Naves and
F. Bruce Shepherd},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Maximum Edge-Disjoint Paths in k-Sums of Graphs},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {328--339},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_28},
doi = {10.1007/978-3-642-39206-1\_28},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriE13,
author = {Chandra Chekuri and
Alina Ene},
editor = {Sanjeev Khanna},
title = {Poly-logarithmic Approximation for Maximum Node Disjoint Paths with
Constant Congestion},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {326--341},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.24},
doi = {10.1137/1.9781611973105.24},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriC13,
author = {Chandra Chekuri and
Julia Chuzhoy},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Large-treewidth graph decompositions and applications},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {291--300},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488645},
doi = {10.1145/2488608.2488645},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-4897,
author = {Chandra Chekuri and
Guyslain Naves and
F. Bruce Shepherd},
title = {Maximum Edge-Disjoint Paths in {\textdollar}k{\textdollar}-sums of
Graphs},
journal = {CoRR},
volume = {abs/1303.4897},
year = {2013},
url = {http://arxiv.org/abs/1303.4897},
eprinttype = {arXiv},
eprint = {1303.4897},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-4897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-1577,
author = {Chandra Chekuri and
Julia Chuzhoy},
title = {Large-Treewidth Graph Decompositions and Applications},
journal = {CoRR},
volume = {abs/1304.1577},
year = {2013},
url = {http://arxiv.org/abs/1304.1577},
eprinttype = {arXiv},
eprint = {1304.1577},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-1577.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-2416,
author = {Chandra Chekuri and
Anastasios Sidiropoulos},
title = {Approximation algorithms for Euler genus and related problems},
journal = {CoRR},
volume = {abs/1304.2416},
year = {2013},
url = {http://arxiv.org/abs/1304.2416},
eprinttype = {arXiv},
eprint = {1304.2416},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-2416.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-6577,
author = {Chandra Chekuri and
Julia Chuzhoy},
title = {Polynomial Bounds for the Grid-Minor Theorem},
journal = {CoRR},
volume = {abs/1305.6577},
year = {2013},
url = {http://arxiv.org/abs/1305.6577},
eprinttype = {arXiv},
eprint = {1305.6577},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-6577.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChekuriK12,
author = {Chandra Chekuri and
Nitish Korula},
title = {Pruning 2-Connected Graphs},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {436--463},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9462-5},
doi = {10.1007/S00453-010-9462-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChekuriK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriKP12,
author = {Chandra Chekuri and
Nitish Korula and
Martin P{\'{a}}l},
title = {Improved algorithms for orienteering and related problems},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {23:1--23:27},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229167},
doi = {10.1145/2229163.2229167},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChekuriKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriCH12,
author = {Chandra Chekuri and
Kenneth L. Clarkson and
Sariel Har{-}Peled},
title = {On the set multicover problem in geometric settings},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {1},
pages = {9:1--9:17},
year = {2012},
url = {https://doi.org/10.1145/2390176.2390185},
doi = {10.1145/2390176.2390185},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChekuriCH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChekuriIM12,
author = {Chandra Chekuri and
Sungjin Im and
Benjamin Moseley},
title = {Online Scheduling to Minimize Maximum Response Time and Maximum Delay
Factor},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {165--195},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a007},
doi = {10.4086/TOC.2012.V008A007},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChekuriIM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriEV12,
author = {Chandra Chekuri and
Alina Ene and
Ali Vakilian},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Prize-Collecting Survivable Network Design in Node-Weighted Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {98--109},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_9},
doi = {10.1007/978-3-642-32512-0\_9},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChekuriEV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriEV12,
author = {Chandra Chekuri and
Alina Ene and
Ali Vakilian},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Node-Weighted Network Design in Planar and Minor-Closed Families of
Graphs},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {206--217},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_18},
doi = {10.1007/978-3-642-31594-7\_18},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriEV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChekuriKRV12,
author = {Chandra Chekuri and
Sreeram Kannan and
Adnan Raja and
Pramod Viswanath},
editor = {Shafi Goldwasser},
title = {Multicommodity flows and cuts in polymatroidal networks},
booktitle = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
January 8-10, 2012},
pages = {399--408},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2090236.2090268},
doi = {10.1145/2090236.2090268},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ChekuriKRV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/AntonakopoulosCSZ11,
author = {Spyridon Antonakopoulos and
Chandra Chekuri and
F. Bruce Shepherd and
Lisa Zhang},
title = {Buy-at-Bulk Network Design with Protection},
journal = {Math. Oper. Res.},
volume = {36},
number = {1},
pages = {71--87},
year = {2011},
url = {https://doi.org/10.1287/moor.1110.0484},
doi = {10.1287/MOOR.1110.0484},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/AntonakopoulosCSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CalinescuCPV11,
author = {Gruia C{\u{a}}linescu and
Chandra Chekuri and
Martin P{\'{a}}l and
Jan Vondr{\'{a}}k},
title = {Maximizing a Monotone Submodular Function Subject to a Matroid Constraint},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {6},
pages = {1740--1766},
year = {2011},
url = {https://doi.org/10.1137/080733991},
doi = {10.1137/080733991},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CalinescuCPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriEGS11,
author = {Chandra Chekuri and
Guy Even and
Anupam Gupta and
Danny Segev},
title = {Set connectivity problems in undirected graphs and the directed steiner
network problem},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {2},
pages = {18:1--18:17},
year = {2011},
url = {https://doi.org/10.1145/1921659.1921664},
doi = {10.1145/1921659.1921664},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ChekuriEGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriE11,
author = {Chandra Chekuri and
Alina Ene},
editor = {Rafail Ostrovsky},
title = {Approximation Algorithms for Submodular Multiway Partition},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {807--816},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.34},
doi = {10.1109/FOCS.2011.34},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriE11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriE11,
author = {Chandra Chekuri and
Alina Ene},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Submodular Cost Allocation Problem and Applications},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {354--366},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_30},
doi = {10.1007/978-3-642-22006-7\_30},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriE11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ChakrabartyCKK11,
author = {Deeparnab Chakrabarty and
Chandra Chekuri and
Sanjeev Khanna and
Nitish Korula},
editor = {Oktay G{\"{u}}nl{\"{u}}k and
Gerhard J. Woeginger},
title = {Approximability of Capacitated Network Design},
booktitle = {Integer Programming and Combinatoral Optimization - 15th International
Conference, {IPCO} 2011, New York, NY, USA, June 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6655},
pages = {78--91},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20807-2\_7},
doi = {10.1007/978-3-642-20807-2\_7},
timestamp = {Tue, 29 Dec 2020 18:40:14 +0100},
biburl = {https://dblp.org/rec/conf/ipco/ChakrabartyCKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BateniCEHKM11,
author = {MohammadHossein Bateni and
Chandra Chekuri and
Alina Ene and
Mohammad Taghi Hajiaghayi and
Nitish Korula and
D{\'{a}}niel Marx},
editor = {Dana Randall},
title = {Prize-collecting Steiner Problems on Planar Graphs},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1028--1049},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.79},
doi = {10.1137/1.9781611973082.79},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/BateniCEHKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriVZ11,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k and
Rico Zenklusen},
editor = {Dana Randall},
title = {Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1080--1097},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.82},
doi = {10.1137/1.9781611973082.82},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriVZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/VondrakCZ11,
author = {Jan Vondr{\'{a}}k and
Chandra Chekuri and
Rico Zenklusen},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Submodular function maximization via the multilinear relaxation and
contention resolution schemes},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {783--792},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993740},
doi = {10.1145/1993636.1993740},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/VondrakCZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2040,
author = {Chandra Chekuri and
Alina Ene},
title = {Submodular Cost Allocation Problem and Applications},
journal = {CoRR},
volume = {abs/1105.2040},
year = {2011},
url = {http://arxiv.org/abs/1105.2040},
eprinttype = {arXiv},
eprint = {1105.2040},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2048,
author = {Chandra Chekuri and
Alina Ene},
title = {Approximation Algorithms for Submodular Multiway Partition},
journal = {CoRR},
volume = {abs/1105.2048},
year = {2011},
url = {http://arxiv.org/abs/1105.2048},
eprinttype = {arXiv},
eprint = {1105.2048},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2048.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-4593,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k and
Rico Zenklusen},
title = {Submodular Function Maximization via the Multilinear Relaxation and
Contention Resolution Schemes},
journal = {CoRR},
volume = {abs/1105.4593},
year = {2011},
url = {http://arxiv.org/abs/1105.4593},
eprinttype = {arXiv},
eprint = {1105.4593},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-4593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-6832,
author = {Chandra Chekuri and
Sreeram Kannan and
Adnan Raja and
Pramod Viswanath},
title = {Multicommodity Flows and Cuts in Polymatroidal Networks},
journal = {CoRR},
volume = {abs/1110.6832},
year = {2011},
url = {http://arxiv.org/abs/1110.6832},
eprinttype = {arXiv},
eprint = {1110.6832},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-6832.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriHKS10,
author = {Chandra Chekuri and
Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
title = {Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {5},
pages = {1772--1798},
year = {2010},
url = {https://doi.org/10.1137/090750317},
doi = {10.1137/090750317},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriHKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriVZ10,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k and
Rico Zenklusen},
title = {Dependent Randomized Rounding via Exchange Properties of Combinatorial
Structures},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {575--584},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.60},
doi = {10.1109/FOCS.2010.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriVZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriSW10,
author = {Chandra Chekuri and
F. Bruce Shepherd and
Christophe Weibel},
editor = {Moses Charikar},
title = {Flow-Cut Gaps for Integer and Fractional Multiflows},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {1198--1208},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.96},
doi = {10.1137/1.9781611973075.96},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ChekuriGIKLMMR10,
author = {Chandra Chekuri and
Avigdor Gal and
Sungjin Im and
Samir Khuller and
Jian Li and
Richard Matthew McCutchen and
Benjamin Moseley and
Louiqa Raschid},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {New Models and Algorithms for Throughput Maximization in Broadcast
Scheduling - (Extended Abstract)},
booktitle = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
pages = {71--82},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18318-8\_7},
doi = {10.1007/978-3-642-18318-8\_7},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ChekuriGIKLMMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-4357,
author = {Chandra Chekuri and
Alina Ene and
Nitish Korula},
title = {Prize-Collecting Steiner Tree and Forest in Planar Graphs},
journal = {CoRR},
volume = {abs/1006.4357},
year = {2010},
url = {http://arxiv.org/abs/1006.4357},
eprinttype = {arXiv},
eprint = {1006.4357},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-4357.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-2136,
author = {Chandra Chekuri and
F. Bruce Shepherd and
Christophe Weibel},
title = {Flow-Cut Gaps for Integer and Fractional Multiflows},
journal = {CoRR},
volume = {abs/1008.2136},
year = {2010},
url = {http://arxiv.org/abs/1008.2136},
eprinttype = {arXiv},
eprint = {1008.2136},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-2136.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-5734,
author = {Deeparnab Chakrabarty and
Chandra Chekuri and
Sanjeev Khanna and
Nitish Korula},
title = {Approximability of Capacitated Network Design},
journal = {CoRR},
volume = {abs/1009.5734},
year = {2010},
url = {http://arxiv.org/abs/1009.5734},
eprinttype = {arXiv},
eprint = {1009.5734},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-5734.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChekuriKS09,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {A Note on Multiflows and Treewidth},
journal = {Algorithmica},
volume = {54},
number = {3},
pages = {400--412},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9129-z},
doi = {10.1007/S00453-007-9129-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChekuriKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChekuriT09,
author = {Chandra Chekuri and
Luca Trevisan},
title = {Foreword},
journal = {Algorithmica},
volume = {55},
number = {1},
pages = {111--112},
year = {2009},
url = {https://doi.org/10.1007/s00453-009-9324-1},
doi = {10.1007/S00453-009-9324-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChekuriT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CalinescuCV09,
author = {Gruia C{\u{a}}linescu and
Chandra Chekuri and
Jan Vondr{\'{a}}k},
title = {Disjoint bases in a polymatroid},
journal = {Random Struct. Algorithms},
volume = {35},
number = {4},
pages = {418--430},
year = {2009},
url = {https://doi.org/10.1002/rsa.20274},
doi = {10.1002/RSA.20274},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CalinescuCV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriKS09,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {Edge-Disjoint Paths in Planar Graphs with Constant Congestion},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {1},
pages = {281--301},
year = {2009},
url = {https://doi.org/10.1137/060674442},
doi = {10.1137/060674442},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriEK09,
author = {Chandra Chekuri and
Alina Ene and
Nitish Korula},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Unsplittable Flow in Paths and Trees and Column-Restricted Packing
Integer Programs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {42--55},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_4},
doi = {10.1007/978-3-642-03685-9\_4},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChekuriEK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriG09,
author = {Chandra Chekuri and
Iftah Gamzu},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Truthful Mechanisms via Greedy Iterative Packing},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {56--69},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_5},
doi = {10.1007/978-3-642-03685-9\_5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChekuriG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChekuriCH09,
author = {Chandra Chekuri and
Kenneth L. Clarkson and
Sariel Har{-}Peled},
editor = {John Hershberger and
Efi Fogel},
title = {On the set multi-cover problem in geometric settings},
booktitle = {Proceedings of the 25th {ACM} Symposium on Computational Geometry,
Aarhus, Denmark, June 8-10, 2009},
pages = {341--350},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1542362.1542421},
doi = {10.1145/1542362.1542421},
timestamp = {Mon, 14 Jun 2021 16:24:56 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ChekuriCH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChekuriIM09,
author = {Chandra Chekuri and
Sungjin Im and
Benjamin Moseley},
editor = {Amos Fiat and
Peter Sanders},
title = {Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {444--455},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_40},
doi = {10.1007/978-3-642-04128-0\_40},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChekuriIM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriK09,
author = {Chandra Chekuri and
Nitish Korula},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {A Graph Reduction Step Preserving Element-Connectivity and Applications},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {254--265},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_22},
doi = {10.1007/978-3-642-02927-1\_22},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/ChenCK09,
author = {Chun{-}cheng Chen and
Chandra Chekuri and
Diego Klabjan},
title = {Topology Formation for Wireless Mesh Network Planning},
booktitle = {{INFOCOM} 2009. 28th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
19-25 April 2009, Rio de Janeiro, Brazil},
pages = {2671--2675},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/INFCOM.2009.5062209},
doi = {10.1109/INFCOM.2009.5062209},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/ChenCK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriM09,
author = {Chandra Chekuri and
Benjamin Moseley},
editor = {Claire Mathieu},
title = {Online scheduling to minimize the maximum delay factor},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {1116--1125},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.121},
doi = {10.1137/1.9781611973068.121},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ChekuriIM09,
author = {Chandra Chekuri and
Sungjin Im and
Benjamin Moseley},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {Longest Wait First for Broadcast Scheduling [Extended Abstract]},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {62--74},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_6},
doi = {10.1007/978-3-642-12450-1\_6},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ChekuriIM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-2795,
author = {Chandra Chekuri and
Nitish Korula},
title = {A Graph Reduction Step Preserving Element-Connectivity and Applications},
journal = {CoRR},
volume = {abs/0902.2795},
year = {2009},
url = {http://arxiv.org/abs/0902.2795},
eprinttype = {arXiv},
eprint = {0902.2795},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-2795.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-2048,
author = {Chandra Chekuri and
Sungjin Im and
Benjamin Moseley},
title = {Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling},
journal = {CoRR},
volume = {abs/0906.2048},
year = {2009},
url = {http://arxiv.org/abs/0906.2048},
eprinttype = {arXiv},
eprint = {0906.2048},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-2048.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-2395,
author = {Chandra Chekuri and
Sungjin Im and
Benjamin Moseley},
title = {Longest Wait First for Broadcast Scheduling},
journal = {CoRR},
volume = {abs/0906.2395},
year = {2009},
url = {http://arxiv.org/abs/0906.2395},
eprinttype = {arXiv},
eprint = {0906.2395},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-2395.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-2466,
author = {Chandra Chekuri and
Iftah Gamzu},
title = {Truthful Mechanisms via Greedy Iterative Packing},
journal = {CoRR},
volume = {abs/0906.2466},
year = {2009},
url = {http://arxiv.org/abs/0906.2466},
eprinttype = {arXiv},
eprint = {0906.2466},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-2466.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-0537,
author = {Chandra Chekuri and
Kenneth L. Clarkson and
Sariel Har{-}Peled},
title = {On the Set Multi-Cover Problem in Geometric Settings},
journal = {CoRR},
volume = {abs/0909.0537},
year = {2009},
url = {http://arxiv.org/abs/0909.0537},
eprinttype = {arXiv},
eprint = {0909.0537},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-0537.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-4348,
author = {Chandra Chekuri and
Jan Vondr{\'{a}}k},
title = {Randomized Pipage Rounding for Matroid Polytopes and Applications},
journal = {CoRR},
volume = {abs/0909.4348},
year = {2009},
url = {http://arxiv.org/abs/0909.4348},
eprinttype = {arXiv},
eprint = {0909.4348},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-4348.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChekuriS08,
author = {Chandra Chekuri and
F. Bruce Shepherd},
title = {Approximate Integer Decompositions for Undirected Network Design Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {1},
pages = {163--177},
year = {2008},
url = {https://doi.org/10.1137/040617339},
doi = {10.1137/040617339},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChekuriS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChekuriK08,
author = {Chandra Chekuri and
Nitish Korula},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {Pruning 2-Connected Graphs},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
pages = {119--130},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1746},
doi = {10.4230/LIPICS.FSTTCS.2008.1746},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/ChekuriK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChekuriK08a,
author = {Chandra Chekuri and
Nitish Korula},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {Single-Sink Network Design with Vertex Connectivity Requirements},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
pages = {131--142},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1747},
doi = {10.4230/LIPICS.FSTTCS.2008.1747},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/ChekuriK08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriK08,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Algorithms for 2-Route Cut Problems},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {472--484},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_39},
doi = {10.1007/978-3-540-70575-8\_39},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriEGS08,
author = {Chandra Chekuri and
Guy Even and
Anupam Gupta and
Danny Segev},
editor = {Shang{-}Hua Teng},
title = {Set connectivity problems in undirected graphs and the directed Steiner
network problem},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {532--541},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347141},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriEGS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriKP08,
author = {Chandra Chekuri and
Nitish Korula and
Martin P{\'{a}}l},
editor = {Shang{-}Hua Teng},
title = {Improved algorithms for orienteering and related problems},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {661--670},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347155},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriKP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Chekuri08,
author = {Chandra Chekuri},
editor = {Ming{-}Yang Kao},
title = {Multicommodity Flow, Well-linked Terminals and Routing Problems},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_244},
doi = {10.1007/978-0-387-30162-4\_244},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Chekuri08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2528,
author = {Chandra Chekuri and
Nitish Korula},
title = {Min-Cost 2-Connected Subgraphs With k Terminals},
journal = {CoRR},
volume = {abs/0802.2528},
year = {2008},
url = {http://arxiv.org/abs/0802.2528},
eprinttype = {arXiv},
eprint = {0802.2528},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2528.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0807-1891,
author = {Chandra Chekuri and
Benjamin Moseley},
title = {Online Scheduling to Minimize the Maximum Delay Factor},
journal = {CoRR},
volume = {abs/0807.1891},
year = {2008},
url = {http://arxiv.org/abs/0807.1891},
eprinttype = {arXiv},
eprint = {0807.1891},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0807-1891.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChakrabartiCGK07,
author = {Amit Chakrabarti and
Chandra Chekuri and
Anupam Gupta and
Amit Kumar},
title = {Approximation Algorithms for the Unsplittable Flow Problem},
journal = {Algorithmica},
volume = {47},
number = {1},
pages = {53--78},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-1210-5},
doi = {10.1007/S00453-006-1210-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChakrabartiCGK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsac/ChekuriCLNO07,
author = {Chandra Chekuri and
Julia Chuzhoy and
Liane Lewin{-}Eytan and
Joseph Naor and
Ariel Orda},
title = {Non-Cooperative Multicast and Facility Location Games},
journal = {{IEEE} J. Sel. Areas Commun.},
volume = {25},
number = {6},
pages = {1193--1206},
year = {2007},
url = {https://doi.org/10.1109/JSAC.2007.070813},
doi = {10.1109/JSAC.2007.070813},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsac/ChekuriCLNO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChekuriSOS07,
author = {Chandra Chekuri and
F. Bruce Shepherd and
Gianpaolo Oriolo and
Maria Grazia Scutell{\`{a}}},
title = {Hardness of robust network design},
journal = {Networks},
volume = {50},
number = {1},
pages = {50--54},
year = {2007},
url = {https://doi.org/10.1002/net.20165},
doi = {10.1002/NET.20165},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ChekuriSOS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Chekuri07,
author = {Chandra Chekuri},
title = {Routing and network design with robustness to changing or uncertain
traffic demands},
journal = {{SIGACT} News},
volume = {38},
number = {3},
pages = {106--129},
year = {2007},
url = {https://doi.org/10.1145/1324215.1324236},
doi = {10.1145/1324215.1324236},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Chekuri07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriMS07,
author = {Chandra Chekuri and
Marcelo Mydlarz and
F. Bruce Shepherd},
title = {Multicommodity demand flow in a tree and packing integer programs},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {3},
pages = {27},
year = {2007},
url = {https://doi.org/10.1145/1273340.1273343},
doi = {10.1145/1273340.1273343},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChekuriMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriK07,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {Edge-disjoint paths revisited},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {4},
pages = {46},
year = {2007},
url = {https://doi.org/10.1145/1290672.1290683},
doi = {10.1145/1290672.1290683},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChekuriK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChekuriP07,
author = {Chandra Chekuri and
Martin P{\'{a}}l},
title = {An O(log \emph{n}) Approximation Ratio for the Asymmetric Traveling
Salesman Path Problem},
journal = {Theory Comput.},
volume = {3},
number = {1},
pages = {197--209},
year = {2007},
url = {https://doi.org/10.4086/toc.2007.v003a010},
doi = {10.4086/TOC.2007.V003A010},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChekuriP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AntonakopoulosCSZ07,
author = {Spyridon Antonakopoulos and
Chandra Chekuri and
F. Bruce Shepherd and
Lisa Zhang},
title = {Buy-at-Bulk Network Design with Protection},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {634--644},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.17},
doi = {10.1109/FOCS.2007.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AntonakopoulosCSZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CalinescuCPV07,
author = {Gruia C{\u{a}}linescu and
Chandra Chekuri and
Martin P{\'{a}}l and
Jan Vondr{\'{a}}k},
editor = {Matteo Fischetti and
David P. Williamson},
title = {Maximizing a Submodular Set Function Subject to a Matroid Constraint
(Extended Abstract)},
booktitle = {Integer Programming and Combinatorial Optimization, 12th International
{IPCO} Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4513},
pages = {182--196},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72792-7\_15},
doi = {10.1007/978-3-540-72792-7\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CalinescuCPV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriHKS07,
author = {Chandra Chekuri and
Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Approximation algorithms for node-weighted buy-at-bulk network design},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1265--1274},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283519},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriHKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0711-4825,
author = {Chandra Chekuri and
Nitish Korula},
title = {Approximation Algorithms for Orienteering with Time Windows},
journal = {CoRR},
volume = {abs/0711.4825},
year = {2007},
url = {http://arxiv.org/abs/0711.4825},
eprinttype = {arXiv},
eprint = {0711.4825},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0711-4825.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bell/ChekuriCEFKLNSSWWZ06,
author = {Chandra Chekuri and
Paul Claisse and
Ren{\'{e}}{-}Jean Essiambre and
Steven Fortune and
Daniel C. Kilper and
Wonsuck Lee and
Nachi K. Nithi and
Iraj Saniee and
F. Bruce Shepherd and
Christopher A. White and
Gordon T. Wilfong and
Lisa Zhang},
title = {Design tools for transparent optical networks},
journal = {Bell Labs Tech. J.},
volume = {11},
number = {2},
pages = {129--143},
year = {2006},
url = {https://doi.org/10.1002/bltj.20165},
doi = {10.1002/BLTJ.20165},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bell/ChekuriCEFKLNSSWWZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChekuriEK06,
author = {Chandra Chekuri and
Guy Even and
Guy Kortsarz},
title = {A greedy approximation algorithm for the group Steiner problem},
journal = {Discret. Appl. Math.},
volume = {154},
number = {1},
pages = {15--34},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.07.010},
doi = {10.1016/J.DAM.2005.07.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChekuriEK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChekuriM06,
author = {Chandra Chekuri and
Daniele Micciancio},
title = {Special Issue: {FOCS} 2003},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {2},
pages = {205},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2005.09.002},
doi = {10.1016/J.JCSS.2005.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChekuriM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChekuriGNRS06,
author = {Chandra Chekuri and
Anupam Gupta and
Ilan Newman and
Yuri Rabinovich and
Alistair Sinclair},
title = {Embedding \emph{k}-Outerplanar Graphs into \emph{l} \({}_{\mbox{1}}\)},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {1},
pages = {119--136},
year = {2006},
url = {https://doi.org/10.1137/S0895480102417379},
doi = {10.1137/S0895480102417379},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChekuriGNRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChekuriGN06,
author = {Chandra Chekuri and
Sudipto Guha and
Joseph Naor},
title = {The Steiner \emph{k}-Cut Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {1},
pages = {261--271},
year = {2006},
url = {https://doi.org/10.1137/S0895480104445095},
doi = {10.1137/S0895480104445095},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChekuriGN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ChekuriFS06,
author = {Chandra Chekuri and
Christina Fragouli and
Emina Soljanin},
title = {On average throughput and alphabet size in network coding},
journal = {{IEEE} Trans. Inf. Theory},
volume = {52},
number = {6},
pages = {2410--2424},
year = {2006},
url = {https://doi.org/10.1109/TIT.2006.874433},
doi = {10.1109/TIT.2006.874433},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/ChekuriFS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChekuriKS06,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths
and Unsplittable Flow},
journal = {Theory Comput.},
volume = {2},
number = {7},
pages = {137--146},
year = {2006},
url = {https://doi.org/10.4086/toc.2006.v002a007},
doi = {10.4086/TOC.2006.V002A007},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChekuriKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriP06,
author = {Chandra Chekuri and
Martin P{\'{a}}l},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {An \emph{O}(log\emph{n}) Approximation Ratio for the Asymmetric Traveling
Salesman \emph{Path} Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {95--103},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_11},
doi = {10.1007/11830924\_11},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChekuriP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriHKS06,
author = {Chandra Chekuri and
Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
title = {Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {677--686},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.15},
doi = {10.1109/FOCS.2006.15},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriHKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ChekuriFS06,
author = {Chandra Chekuri and
Christina Fragouli and
Emina Soljanin},
title = {On Achievable Information Rates in Single-Source Non-Uniform Demand
Networks},
booktitle = {Proceedings 2006 {IEEE} International Symposium on Information Theory,
{ISIT} 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14,
2006},
pages = {773--777},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/ISIT.2006.261718},
doi = {10.1109/ISIT.2006.261718},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/ChekuriFS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/ChekuriCLNO06,
author = {Chandra Chekuri and
Julia Chuzhoy and
Liane Lewin{-}Eytan and
Joseph Naor and
Ariel Orda},
editor = {Joan Feigenbaum and
John C.{-}I. Chuang and
David M. Pennock},
title = {Non-cooperative multicast and facility location games},
booktitle = {Proceedings 7th {ACM} Conference on Electronic Commerce (EC-2006),
Ann Arbor, Michigan, USA, June 11-15, 2006},
pages = {72--81},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1134707.1134716},
doi = {10.1145/1134707.1134716},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/ChekuriCLNO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKS06,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
editor = {Jon M. Kleinberg},
title = {Edge-disjoint paths in Planar graphs with constant congestion},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {757--766},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132621},
doi = {10.1145/1132516.1132621},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChekuriGKNR05,
author = {Chandra Chekuri and
Anupam Gupta and
Amit Kumar and
Joseph Naor and
Danny Raz},
title = {Building Edge-Failure Resilient Networks},
journal = {Algorithmica},
volume = {43},
number = {1-2},
pages = {17--41},
year = {2005},
url = {https://doi.org/10.1007/s00453-005-1156-z},
doi = {10.1007/S00453-005-1156-Z},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChekuriGKNR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChekuriGK05,
author = {Chandra Chekuri and
Anupam Gupta and
Amit Kumar},
title = {On a bidirected relaxation for the {MULTIWAY} {CUT} problem},
journal = {Discret. Appl. Math.},
volume = {150},
number = {1-3},
pages = {67--79},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2005.04.003},
doi = {10.1016/J.DAM.2005.04.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ChekuriGK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsac/LiBCG05,
author = {Li (Erran) Li and
Milind M. Buddhikot and
Chandra Chekuri and
Katherine Guo},
title = {Routing bandwidth guaranteed paths with local restoration in label
switched networks},
journal = {{IEEE} J. Sel. Areas Commun.},
volume = {23},
number = {2},
pages = {437--449},
year = {2005},
url = {https://doi.org/10.1109/JSAC.2004.839424},
doi = {10.1109/JSAC.2004.839424},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsac/LiBCG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriK05,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {3},
pages = {713--728},
year = {2005},
url = {https://doi.org/10.1137/S0097539700382820},
doi = {10.1137/S0097539700382820},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CharikarCP05,
author = {Moses Charikar and
Chandra Chekuri and
Martin P{\'{a}}l},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Sampling Bounds for Stochastic Optimization},
booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
and Techniques, 8th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
August 22-24, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3624},
pages = {257--269},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_22},
doi = {10.1007/11538462\_22},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/CharikarCP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriP05,
author = {Chandra Chekuri and
Martin P{\'{a}}l},
title = {A Recursive Greedy Algorithm for Walks in Directed Graphs},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {245--253},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.9},
doi = {10.1109/SFCS.2005.9},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/ChekuriFS05,
author = {Chandra Chekuri and
Christina Fragouli and
Emina Soljanin},
title = {On average throughput and alphabet size in network coding},
booktitle = {Proceedings of the 2005 {IEEE} International Symposium on Information
Theory, {ISIT} 2005, Adelaide, South Australia, Australia, 4-9 September
2005},
pages = {1593--1597},
publisher = {{IEEE}},
year = {2005},
url = {https://doi.org/10.1109/ISIT.2005.1523613},
doi = {10.1109/ISIT.2005.1523613},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isit/ChekuriFS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKS05,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Multicommodity flow, well-linked terminals, and routing problems},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {183--192},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060618},
doi = {10.1145/1060590.1060618},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2005,
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Approximation, Randomization and Combinatorial Optimization, Algorithms
and Techniques, 8th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
August 22-24, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3624},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462},
doi = {10.1007/11538462},
isbn = {3-540-28239-4},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriK04,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {On Multidimensional Packing Problems},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {4},
pages = {837--851},
year = {2004},
url = {https://doi.org/10.1137/S0097539799356265},
doi = {10.1137/S0097539799356265},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CharikarCFM04,
author = {Moses Charikar and
Chandra Chekuri and
Tom{\'{a}}s Feder and
Rajeev Motwani},
title = {Incremental Clustering and Dynamic Information Retrieval},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {6},
pages = {1417--1440},
year = {2004},
url = {https://doi.org/10.1137/S0097539702418498},
doi = {10.1137/S0097539702418498},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CharikarCFM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChekuriKNZ04,
author = {Chandra Chekuri and
Sanjeev Khanna and
Joseph Naor and
Leonid Zosin},
title = {A Linear Programming Formulation and Approximation Algorithms for
the Metric Labeling Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {18},
number = {3},
pages = {608--625},
year = {2004},
url = {https://doi.org/10.1137/S0895480101396937},
doi = {10.1137/S0895480101396937},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChekuriKNZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriK04,
author = {Chandra Chekuri and
Amit Kumar},
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
title = {Maximum Coverage Problem with Group Budget Constraints and Applications},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
and Techniques, 7th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
MA, USA, August 22-24, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3122},
pages = {72--83},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27821-4\_7},
doi = {10.1007/978-3-540-27821-4\_7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChekuriK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriKS04,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {Edge-Disjoint Paths in Planar Graphs},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {71--80},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.27},
doi = {10.1109/FOCS.2004.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKS04,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {The all-or-nothing multicommodity flow problem},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {156--165},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007383},
doi = {10.1145/1007352.1007383},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriGKK04,
author = {Chandra Chekuri and
Ashish Goel and
Sanjeev Khanna and
Amit Kumar},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Multi-processor scheduling to minimize flow time with epsilon resource
augmentation},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {363--372},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007411},
doi = {10.1145/1007352.1007411},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriGKK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/ChekuriK04,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {Joseph Y.{-}T. Leung},
title = {Approximation Algorithms for Minimizing AverageWeighted Completion
Time},
booktitle = {Handbook of Scheduling - Algorithms, Models, and Performance Analysis},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {http://www.crcnetbase.com/doi/abs/10.1201/9780203489802.ch11},
doi = {10.1201/9780203489802.CH11},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/ChekuriK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriGN03,
author = {Chandra Chekuri and
Sudipto Guha and
Joseph Naor},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {Approximating Steiner k-Cuts},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {189--199},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_17},
doi = {10.1007/3-540-45061-0\_17},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriGN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriMS03,
author = {Chandra Chekuri and
Marcelo Mydlarz and
F. Bruce Shepherd},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {Multicommodity Demand Flow in a Tree},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {410--425},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_34},
doi = {10.1007/3-540-45061-0\_34},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriGNRS03,
author = {Chandra Chekuri and
Anupam Gupta and
Ilan Newman and
Yuri Rabinovich and
Alistair Sinclair},
title = {Embedding k-outerplanar graphs into l1},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {527--536},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644197},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriGNRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriK03,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {Edge disjoint paths revisited},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {628--637},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644212},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChakrabartiCGK02,
author = {Amit Chakrabarti and
Chandra Chekuri and
Anupam Gupta and
Amit Kumar},
editor = {Klaus Jansen and
Stefano Leonardi and
Vijay V. Vazirani},
title = {Approximation Algorithms for the Unsplittable Flow Problem},
booktitle = {Approximation Algorithms for Combinatorial Optimization, 5th International
Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2462},
pages = {51--66},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45753-4\_7},
doi = {10.1007/3-540-45753-4\_7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChakrabartiCGK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icnp/LiBCG02,
author = {Li Li and
Milind M. Buddhikot and
Chandra Chekuri and
Katherine Guo},
title = {Routing Bandwidth Guaranteed Paths with Local Restoration in Label
Switched Networks},
booktitle = {10th {IEEE} International Conference on Network Protocols {(ICNP}
2002), 12-15 November 2002, Paris, France, Proceedings},
pages = {110--121},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/ICNP.2002.1181392},
doi = {10.1109/ICNP.2002.1181392},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icnp/LiBCG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ChekuriGKNR02,
author = {Chandra Chekuri and
Anupam Gupta and
Amit Kumar and
Joseph Naor and
Danny Raz},
editor = {William J. Cook and
Andreas S. Schulz},
title = {Building Edge-Failure Resilient Networks},
booktitle = {Integer Programming and Combinatorial Optimization, 9th International
{IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2337},
pages = {439--456},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47867-1\_31},
doi = {10.1007/3-540-47867-1\_31},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ChekuriGKNR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriK02,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {John H. Reif},
title = {Approximation schemes for preemptive weighted flow time},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {297--305},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509954},
doi = {10.1145/509907.509954},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChekuriB01,
author = {Chandra Chekuri and
Michael A. Bender},
title = {An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly
Related Machines},
journal = {J. Algorithms},
volume = {41},
number = {2},
pages = {212--224},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1184},
doi = {10.1006/JAGM.2001.1184},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ChekuriB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriMNS01,
author = {Chandra Chekuri and
Rajeev Motwani and
B. Natarajan and
Clifford Stein},
title = {Approximation Techniques for Average Completion Time Scheduling},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {1},
pages = {146--166},
year = {2001},
url = {https://doi.org/10.1137/S0097539797327180},
doi = {10.1137/S0097539797327180},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriMNS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriK01,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {A {PTAS} for Minimizing Weighted Completion Time on Uniformly Related
Machines},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {848--861},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_69},
doi = {10.1007/3-540-48224-5\_69},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriKNZ01,
author = {Chandra Chekuri and
Sanjeev Khanna and
Joseph Naor and
Leonid Zosin},
editor = {S. Rao Kosaraju},
title = {Approximation algorithms for the metric labeling problem via a new
linear programming formulation},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {109--118},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365426},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriKNZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriKN01,
author = {Chandra Chekuri and
Sanjeev Khanna and
Joseph Naor},
editor = {S. Rao Kosaraju},
title = {A deterministic algorithm for the cost-distance problem},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {232--233},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365452},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriKN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKZ01,
author = {Chandra Chekuri and
Sanjeev Khanna and
An Zhu},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Algorithms for minimizing weighted flow time},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {84--93},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380778},
doi = {10.1145/380752.380778},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriKZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-065,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {Approximation Schemes for Preemptive Weighted Flow Time},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-065}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-065/index.html},
eprinttype = {ECCC},
eprint = {TR01-065},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BenderC00,
author = {Michael A. Bender and
Chandra Chekuri},
title = {Performance guarantees for the {TSP} with a parameterized triangle
inequality},
journal = {Inf. Process. Lett.},
volume = {73},
number = {1-2},
pages = {17--21},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(99)00160-X},
doi = {10.1016/S0020-0190(99)00160-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BenderC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChekuriR00,
author = {Chandra Chekuri and
Anand Rajaraman},
title = {Conjunctive query containment revisited},
journal = {Theor. Comput. Sci.},
volume = {239},
number = {2},
pages = {211--229},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00220-0},
doi = {10.1016/S0304-3975(99)00220-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChekuriR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dialm/ChekuriRWZ00,
author = {Chandra Chekuri and
Kavita Ramanan and
Philip A. Whiting and
Lisa Zhang},
title = {Blocking probability estimates in a partitioned sector {TDMA} system},
booktitle = {Proceedings of the 4th International Workshop on Discrete Algorithms
and Methods for Mobile Computing and Communications {(DIAL-M} 2000),
Boston, Massachusetts, USA, August 11, 2000},
pages = {28--34},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/345848.345854},
doi = {10.1145/345848.345854},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dialm/ChekuriRWZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriK00,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {David B. Shmoys},
title = {A {PTAS} for the multiple knapsack problem},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {213--222},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338254},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChekuriM99,
author = {Chandra Chekuri and
Rajeev Motwani},
title = {Precedence Constrained Scheduling to Minimize Sum of Weighted Completion
Times on a Single Machine},
journal = {Discret. Appl. Math.},
volume = {98},
number = {1-2},
pages = {29--38},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(98)00143-7},
doi = {10.1016/S0166-218X(98)00143-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChekuriM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CharikarCCDGGL99,
author = {Moses Charikar and
Chandra Chekuri and
To{-}Yat Cheung and
Zuo Dai and
Ashish Goel and
Sudipto Guha and
Ming Li},
title = {Approximation Algorithms for Directed Steiner Problems},
journal = {J. Algorithms},
volume = {33},
number = {1},
pages = {73--91},
year = {1999},
url = {https://doi.org/10.1006/jagm.1999.1042},
doi = {10.1006/JAGM.1999.1042},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/CharikarCCDGGL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AingworthCIM99,
author = {Donald Aingworth and
Chandra Chekuri and
Piotr Indyk and
Rajeev Motwani},
title = {Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {4},
pages = {1167--1181},
year = {1999},
url = {https://doi.org/10.1137/S0097539796303421},
doi = {10.1137/S0097539796303421},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AingworthCIM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AfratiBCKKKMQSSS99,
author = {Foto N. Afrati and
Evripidis Bampis and
Chandra Chekuri and
David R. Karger and
Claire Kenyon and
Sanjeev Khanna and
Ioannis Milis and
Maurice Queyranne and
Martin Skutella and
Clifford Stein and
Maxim Sviridenko},
title = {Approximation Schemes for Minimizing Average Weighted Completion Time
with Release Dates},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {32--44},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814574},
doi = {10.1109/SFFCS.1999.814574},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AfratiBCKKKMQSSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriK99,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {On Multi-Dimensional Packing Problems},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {185--194},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314555},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriM99,
author = {Chandra Chekuri and
Rajeev Motwani},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Minimizing Weighted Completion Time on a Single Machine},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {873--874},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.315060},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BenderC99,
author = {Michael A. Bender and
Chandra Chekuri},
editor = {Frank K. H. A. Dehne and
Arvind Gupta and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Performance Guarantees for the {TSP} with a Parameterized Triangle
Inequality},
booktitle = {Algorithms and Data Structures, 6th International Workshop, {WADS}
'99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1663},
pages = {80--85},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48447-7\_10},
doi = {10.1007/3-540-48447-7\_10},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BenderC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Chekuri98,
author = {Chandra Chekuri},
title = {Approximation algorithms for scheduling problems},
school = {Stanford University, {USA}},
year = {1998},
url = {https://searchworks.stanford.edu/view/4028646},
timestamp = {Wed, 31 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Chekuri98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CharikarCGGP98,
author = {Moses Charikar and
Chandra Chekuri and
Ashish Goel and
Sudipto Guha and
Serge A. Plotkin},
title = {Approximating a Finite Metric by a Small Number of Tree Metrics},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {379--388},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743488},
doi = {10.1109/SFCS.1998.743488},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CharikarCGGP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CherukiB98,
author = {Chandra Chekuri and
Michael A. Bender},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly
Related Machines},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {383--393},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_29},
doi = {10.1007/3-540-69346-7\_29},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CherukiB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CharikarCCDGGL98,
author = {Moses Charikar and
Chandra Chekuri and
To{-}Yat Cheung and
Zuo Dai and
Ashish Goel and
Sudipto Guha and
Ming Li},
editor = {Howard J. Karloff},
title = {Approximation Algorithms for Directed Steiner Problems},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {192--200},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314700},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/CharikarCCDGGL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarCGG98,
author = {Moses Charikar and
Chandra Chekuri and
Ashish Goel and
Sudipto Guha},
editor = {Jeffrey Scott Vitter},
title = {Rounding via Trees: Deterministic Approximation Algorithms for Group
Steiner Trees and \emph{k}-Median},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {114--123},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276719},
doi = {10.1145/276698.276719},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarCGG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vldb/ShivakumarGC98,
author = {Narayanan Shivakumar and
Hector Garcia{-}Molina and
Chandra Chekuri},
editor = {Ashish Gupta and
Oded Shmueli and
Jennifer Widom},
title = {Filtering with Approximate Predicates},
booktitle = {VLDB'98, Proceedings of 24rd International Conference on Very Large
Data Bases, August 24-27, 1998, New York City, New York, {USA}},
pages = {263--274},
publisher = {Morgan Kaufmann},
year = {1998},
url = {http://www.vldb.org/conf/1998/p263.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/vldb/ShivakumarGC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/ChekuriR97,
author = {Chandra Chekuri and
Anand Rajaraman},
editor = {Foto N. Afrati and
Phokion G. Kolaitis},
title = {Conjunctive Query Containment Revisited},
booktitle = {Database Theory - {ICDT} '97, 6th International Conference, Delphi,
Greece, January 8-10, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1186},
pages = {56--70},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62222-5\_36},
doi = {10.1007/3-540-62222-5\_36},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/icdt/ChekuriR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriGKLS97,
author = {Chandra Chekuri and
Andrew V. Goldberg and
David R. Karger and
Matthew S. Levine and
Clifford Stein},
editor = {Michael E. Saks},
title = {Experimental Study of Minimum Cut Algorithms},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {324--333},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314315},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriGKLS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriMNS97,
author = {Chandra Chekuri and
Rajeev Motwani and
B. Natarajan and
Clifford Stein},
editor = {Michael E. Saks},
title = {Approximation Techniques for Average Completion Time Scheduling},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {609--618},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314396},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriMNS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarCFM97,
author = {Moses Charikar and
Chandra Chekuri and
Tom{\'{a}}s Feder and
Rajeev Motwani},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Incremental Clustering and Dynamic Information Retrieval},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {626--635},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258657},
doi = {10.1145/258533.258657},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarCFM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/micro/ChekuriJMNRS96,
author = {Chandra Chekuri and
Richard Johnson and
Rajeev Motwani and
B. Natarajan and
B. Ramakrishna Rau and
Michael S. Schlansker},
editor = {Stephen W. Melvin and
Steve Beaty},
title = {Profile-driven Instruction Level Parallel Scheduling with Application
to Super Blocks},
booktitle = {Proceedings of the 29th Annual {IEEE/ACM} International Symposium
on Microarchitecture, {MICRO} 29, Paris, France, December 2-4, 1996},
pages = {58--67},
publisher = {{ACM/IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/MICRO.1996.566450},
doi = {10.1109/MICRO.1996.566450},
timestamp = {Tue, 31 May 2022 14:39:58 +0200},
biburl = {https://dblp.org/rec/conf/micro/ChekuriJMNRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AingworthCM96,
author = {Donald Aingworth and
Chandra Chekuri and
Rajeev Motwani},
editor = {{\'{E}}va Tardos},
title = {Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {547--553},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314117},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AingworthCM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/ChekuriHM95,
author = {Chandra Chekuri and
Waqar Hasan and
Rajeev Motwani},
editor = {Mihalis Yannakakis and
Serge Abiteboul},
title = {Scheduling Problems in Parallel Query Optimization},
booktitle = {Proceedings of the Fourteenth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, May 22-25, 1995, San Jose, California,
{USA}},
pages = {255--265},
publisher = {{ACM} Press},
year = {1995},
url = {https://doi.org/10.1145/212433.212471},
doi = {10.1145/212433.212471},
timestamp = {Sat, 24 Oct 2020 16:41:20 +0200},
biburl = {https://dblp.org/rec/conf/pods/ChekuriHM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-11 20:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
