default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChandra Chekuri
Person information
SPARQL queries 
🛈 Please note that only 74% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j64]Chandra Chekuri, Vasilis Livanos
:
On submodular prophet inequalities and correlation gap. Theor. Comput. Sci. 1019: 114814 (2024)- [j63]Anya Chaturvedi, Chandra Chekuri, Mengxue Liu, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber:
Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands. IEEE/ACM Trans. Netw. 32(2): 1435-1450 (2024) - [c121]Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. AAAI 2024: 9590-9597 - [c120]Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, Weihao Zhu:
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. APPROX/RANDOM 2024: 9:1-9:21 - [c119]Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing. ESA 2024: 41:1-41:21 - [c118]Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu:
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. ESA 2024: 42:1-42:19 - [c117]Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. SODA 2024: 3062-3088 - [c116]Chandra Chekuri, Junkai Song, Weizhong Zhang:
Contention Resolution for the ℓ-fold union of a matroid via the correlation gap. SOSA 2024: 396-405 - [i60]Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Network Design in Non-Uniform Fault Models. CoRR abs/2403.15547 (2024) - [i59]Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing. CoRR abs/2404.16725 (2024) - [i58]Chandra Chekuri, Junkai Song:
Colorful Priority k-Supplier. CoRR abs/2406.14984 (2024) - [i57]Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu:
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. CoRR abs/2407.01904 (2024) - 2023
- [j62]Karthekeyan Chandrasekaran, Chandra Chekuri:
Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. Comb. 43(3): 455-477 (2023) - [c115]Tanvi Bajpai, Chandra Chekuri:
Bicriteria Approximation Algorithms for Priority Matroid Median. APPROX/RANDOM 2023: 7:1-7:22 - [c114]Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. APPROX/RANDOM 2023: 24:1-24:22 - [c113]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. ESA 2023: 56:1-56:17 - [c112]Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Network Design in Non-Uniform Fault Models. ICALP 2023: 36:1-36:20 - [i56]Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge:
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR abs/2303.12850 (2023) - [i55]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. CoRR abs/2305.02987 (2023) - [i54]Chandra Chekuri, Manuel R. Torres:
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. CoRR abs/2306.02172 (2023) - [i53]Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. CoRR abs/2307.02022 (2023) - [i52]Caleb Ju, Serif Yesil, Mengyuan Sun, Chandra Chekuri, Edgar Solomonik:
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs. CoRR abs/2307.03307 (2023) - [i51]Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. CoRR abs/2310.18146 (2023) - [i50]Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
1/2 Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. CoRR abs/2312.08504 (2023) - 2022
- [j61]Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, Zhao Zhang:
Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim. 44(2): 979-1010 (2022) - [j60]Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time. Math. Oper. Res. 47(4): 3380-3399 (2022) - [j59]Anya Chaturvedi, Chandra Chekuri, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber:
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands. SIGMETRICS Perform. Evaluation Rev. 49(3): 22-27 (2022) - [j58]Chandra Chekuri, Tanmay Inamdar:
Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory Comput. 18: 1-19 (2022) - [c111]Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu:
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS 2022: 6:1-6:18 - [c110]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Faster and Scalable Algorithms for Densest Subgraph and Decomposition. NeurIPS 2022 - [c109]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. SODA 2022: 1531-1555 - [i49]Chandra Chekuri, Rhea Jain:
Augmentation based Approximation Algorithms for Flexible Network Design. CoRR abs/2209.12273 (2022) - [i48]Tanvi Bajpai, Chandra Chekuri:
Bicriteria Approximation Algorithms for Priority Matroid Median. CoRR abs/2210.01888 (2022) - [i47]Chandra Chekuri, Kent Quanrud:
(1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time. CoRR abs/2210.02611 (2022) - [i46]Chandra Chekuri, Rhea Jain:
Approximating Flexible Graph Connectivity via Räcke Tree based Rounding. CoRR abs/2211.08324 (2022) - 2021
- [j57]Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-weighted Network Design in Planar and Minor-closed Families of Graphs. ACM Trans. Algorithms 17(2): 14:1-14:25 (2021) - [c108]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. APPROX-RANDOM 2021: 24:1-24:21 - [c107]Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani:
Revisiting Priority k-Center: Fairness and Outliers. ICALP 2021: 21:1-21:20 - [c106]Chandra Chekuri, Kent Quanrud:
Faster Algorithms for Rooted Connectivity in Directed Graphs. ICALP 2021: 49:1-49:16 - [c105]Chandra Chekuri, Kent Quanrud:
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. ICALP 2021: 50:1-50:20 - [c104]Chandra Chekuri, Vasilis Livanos:
On Submodular Prophet Inequalities and Correlation Gap. SAGT 2021: 410 - [c103]Karthekeyan Chandrasekaran, Chandra Chekuri:
Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. SODA 2021: 1026-1038 - [e3]Mikolaj Bojanczyk, Chandra Chekuri:
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. LIPIcs 213, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-215-0 [contents] - [i45]Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani:
Revisiting Priority k-Center: Fairness and Outliers. CoRR abs/2103.03337 (2021) - [i44]Chandra Chekuri, Kent Quanrud:
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems. CoRR abs/2103.12908 (2021) - [i43]Chandra Chekuri, Kent Quanrud:
Faster Algorithms for Rooted Connectivity in Directed Graphs. CoRR abs/2104.07205 (2021) - [i42]Chandra Chekuri, Vasilis Livanos:
On Submodular Prophet Inequalities and Correlation Gap. CoRR abs/2107.03662 (2021) - 2020
- [j56]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
ℓ 1-Sparsity approximation bounds for packing integer programs. Math. Program. 183(1): 195-214 (2020) - [j55]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-Cut. SIAM J. Discret. Math. 34(2): 1334-1353 (2020) - [j54]Chandra Chekuri, Shi Li:
On the Hardness of Approximating the k-Way Hypergraph Cut problem. Theory Comput. 16: 1-8 (2020) - [c102]Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. FOCS 2020: 810-821 - [c101]Chandra Chekuri, Sariel Har-Peled, Kent Quanrud:
Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA 2020: 1019-1038 - [i41]Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph k-cut for fixed k in deterministic polynomial time. CoRR abs/2009.12442 (2020) - [i40]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. CoRR abs/2011.03194 (2020)
2010 – 2019
- 2019
- [c100]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
\ell _1 -sparsity Approximation Bounds for Packing Integer Programs. IPCO 2019: 128-140 - [c99]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-cuts. SOSA 2019: 7:1-7:18 - [c98]Chandra Chekuri, Kent Quanrud:
Submodular Function Maximization in Parallel via the Multilinear Relaxation. SODA 2019: 303-322 - [c97]Chandra Chekuri, Kent Quanrud:
On Approximating (Sparse) Covering Integer Programs. SODA 2019: 1596-1615 - [c96]Chandra Chekuri, Kent Quanrud:
Parallelizing greedy for submodular set function maximization in matroids and beyond. STOC 2019: 78-89 - [i39]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
$\ell_1$-sparsity Approximation Bounds for Packing Integer Programs. CoRR abs/1902.08698 (2019) - [i38]Chandra Chekuri, Kent Quanrud, Zhao Zhang:
On Approximating Partial Set Cover and Generalizations. CoRR abs/1907.04413 (2019) - [i37]Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. CoRR abs/1910.07616 (2019) - [i36]Chandra Chekuri, Tanmay Inamdar:
Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks. CoRR abs/1911.01374 (2019) - 2018
- [j53]Chandra Chekuri, Anastasios Sidiropoulos:
Approximation Algorithms for Euler Genus and Related Problems. SIAM J. Comput. 47(4): 1610-1643 (2018) - [j52]Chandra Chekuri, Chao Xu:
Minimum Cuts and Sparsification in Hypergraphs. SIAM J. Comput. 47(6): 2118-2156 (2018) - [j51]Chandra Chekuri, Alina Ene, Marcin Pilipczuk:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. SIAM J. Discret. Math. 32(3): 2134-2160 (2018) - [c95]Chandra Chekuri, Shalmoli Gupta:
Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations. APPROX-RANDOM 2018: 9:1-9:16 - [c94]Chandra Chekuri, Thapanapong Rukkanchanunt:
A Note on Iterated Rounding for the Survivable Network Design Problem. SOSA 2018: 2:1-2:10 - [c93]Chandra Chekuri, Mark Idleman:
Congestion Minimization for Multipath Routing via Multiroute Flows. SOSA 2018: 3:1-3:12 - [c92]Chandra Chekuri, Kent Quanrud:
Randomized MWU for Positive LPs. SODA 2018: 358-377 - [i35]Chandra Chekuri, Kent Quanrud:
Fast Approximations for Metric-TSP via Linear Programming. CoRR abs/1802.01242 (2018) - [i34]Chandra Chekuri, Shalmoli Gupta:
Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations. CoRR abs/1806.04202 (2018) - [i33]Chandra Chekuri, Kent Quanrud:
Submodular Function Maximization in Parallel via the Multilinear Relaxation. CoRR abs/1807.08678 (2018) - [i32]Chandra Chekuri, Kent Quanrud:
On Approximating (Sparse) Covering Integer Programs. CoRR abs/1807.11538 (2018) - [i31]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-cuts. CoRR abs/1808.05765 (2018) - [i30]Chandra Chekuri, Kent Quanrud:
Parallelizing greedy for submodular set function maximization in matroids and beyond. CoRR abs/1811.12568 (2018) - 2017
- [c91]Chandra Chekuri, Kent Quanrud:
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. FOCS 2017: 789-800 - [c90]Chandra Chekuri, Kent Quanrud:
Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. SODA 2017: 801-820 - [c89]Chandra Chekuri, Vivek Madan:
Approximating Multicut and the Demand Graph. SODA 2017: 855-874 - [c88]Chandra Chekuri, Chao Xu:
Computing minimum cuts in hypergraphs. SODA 2017: 1085-1100 - [i29]Chandra Chekuri, Kent Quanrud:
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. CoRR abs/1702.04307 (2017) - [i28]Chandra Chekuri, Chao Xu:
A note on approximate strengths of edges in a hypergraph. CoRR abs/1703.03849 (2017) - 2016
- [j50]Chandra Chekuri, Julia Chuzhoy:
Polynomial Bounds for the Grid-Minor Theorem. J. ACM 63(5): 40:1-40:65 (2016) - [c87]Chandra Chekuri, Alina Ene, Marcin Pilipczuk:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. ICALP 2016: 7:1-7:14 - [c86]Chandra Chekuri, Kent Quanrud:
A Fast Approximation for Maximum Weight Matroid Intersection. SODA 2016: 445-457 - [c85]Chandra Chekuri, Vivek Madan:
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. SODA 2016: 797-807 - [c84]Chandra Chekuri, Vivek Madan:
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation. SODA 2016: 808-820 - [r4]Michael Langberg, Chandra Chekuri:
Graph Coloring. Encyclopedia of Algorithms 2016: 869-872 - [r3]Chandra Chekuri:
Multicommodity Flow, Well-linked Terminals and Routing Problems. Encyclopedia of Algorithms 2016: 1359-1363 - [i27]Chandra Chekuri, Vivek Madan:
Approximating Multicut and the Demand Graph. CoRR abs/1607.07200 (2016) - [i26]Chandra Chekuri, Chao Xu:
Computing minimum cuts in hypergraphs. CoRR abs/1607.08682 (2016) - [i25]Chandra Chekuri, Thapanapong Rukkanchanunt:
A note on the Survivable Network Design Problem. CoRR abs/1608.02515 (2016) - 2015
- [j49]Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
Approximability of Capacitated Network Design. Algorithmica 72(2): 493-514 (2015) - [j48]Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of trees for capacitated k-center. Math. Program. 154(1-2): 29-53 (2015) - [j47]Chandra Chekuri, Alina Ene:
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program. 154(1-2): 249-272 (2015) - [j46]Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity Flows and Cuts in Polymatroidal Networks. SIAM J. Comput. 44(4): 912-943 (2015) - [c83]Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu:
On Element-Connectivity Preserving Graph Simplification. ESA 2015: 313-324 - [c82]Chandra Chekuri, Shalmoli Gupta, Kent Quanrud:
Streaming Algorithms for Submodular Function Maximization. ICALP (1) 2015: 318-330 - [c81]Chandra Chekuri, T. S. Jayram, Jan Vondrák:
On Multiplicative Weight Updates for Concave and Submodular Function Maximization. ITCS 2015: 201-210 - [c80]Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Delay-constrained unicast and the triangle-cast problem. ISIT 2015: 804-808 - [c79]Chandra Chekuri, Julia Chuzhoy:
Degree-3 Treewidth Sparsifiers. SODA 2015: 242-255 - [i24]Chandra Chekuri, Shalmoli Gupta, Kent Quanrud:
Streaming Algorithms for Submodular Function Maximization. CoRR abs/1504.08024 (2015) - [i23]Chandra Chekuri, Vivek Madan:
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. CoRR abs/1507.04674 (2015) - 2014
- [j45]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. SIAM J. Comput. 43(6): 1831-1879 (2014) - [j44]Chandra Chekuri, Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests. SIAM J. Discret. Math. 28(2): 577-597 (2014) - [c78]Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of Trees for Capacitated k-Center. IPCO 2014: 52-63 - [c77]Chandra Chekuri, Alina Ene:
The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. IPCO 2014: 222-233 - [c76]Chandra Chekuri, Julia Chuzhoy:
Polynomial bounds for the grid-minor theorem. STOC 2014: 60-69 - [e2]Chandra Chekuri:
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. SIAM 2014, ISBN 978-1-61197-338-9 [contents] - [i22]Chandra Chekuri, Julia Chuzhoy:
Degree-3 Treewidth Sparsifiers. CoRR abs/1410.1016 (2014) - 2013
- [j43]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-cut gaps for integer and fractional multiflows. J. Comb. Theory B 103(2): 248-273 (2013) - [j42]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
The All-or-Nothing Multicommodity Flow Problem. SIAM J. Comput. 42(4): 1467-1493 (2013) - [c75]Chandra Chekuri, Anastasios Sidiropoulos:
Approximation Algorithms for Euler Genus and Related Problems. FOCS 2013: 167-176 - [c74]Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd:
Maximum Edge-Disjoint Paths in k-Sums of Graphs. ICALP (1) 2013: 328-339 - [c73]Chandra Chekuri, Alina Ene:
Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion. SODA 2013: 326-341 - [c72]Chandra Chekuri, Julia Chuzhoy:
Large-treewidth graph decompositions and applications. STOC 2013: 291-300 - [i21]Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd:
Maximum Edge-Disjoint Paths in $k$-sums of Graphs. CoRR abs/1303.4897 (2013) - [i20]Chandra Chekuri, Julia Chuzhoy:
Large-Treewidth Graph Decompositions and Applications. CoRR abs/1304.1577 (2013) - [i19]Chandra Chekuri, Anastasios Sidiropoulos:
Approximation algorithms for Euler genus and related problems. CoRR abs/1304.2416 (2013) - [i18]Chandra Chekuri, Julia Chuzhoy:
Polynomial Bounds for the Grid-Minor Theorem. CoRR abs/1305.6577 (2013) - 2012
- [j41]Chandra Chekuri, Nitish Korula:
Pruning 2-Connected Graphs. Algorithmica 62(1-2): 436-463 (2012) - [j40]Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. ACM Trans. Algorithms 8(3): 23:1-23:27 (2012) - [j39]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the set multicover problem in geometric settings. ACM Trans. Algorithms 9(1): 9:1-9:17 (2012) - [j38]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor. Theory Comput. 8(1): 165-195 (2012) - [c71]Chandra Chekuri, Alina Ene, Ali Vakilian:
Prize-Collecting Survivable Network Design in Node-Weighted Graphs. APPROX-RANDOM 2012: 98-109 - [c70]Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. ICALP (1) 2012: 206-217 - [c69]Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity flows and cuts in polymatroidal networks. ITCS 2012: 399-408 - 2011
- [j37]Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang:
Buy-at-Bulk Network Design with Protection. Math. Oper. Res. 36(1): 71-87 (2011) - [j36]Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák:
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. SIAM J. Comput. 40(6): 1740-1766 (2011) - [j35]Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev:
Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Trans. Algorithms 7(2): 18:1-18:17 (2011) - [c68]Chandra Chekuri, Alina Ene:
Approximation Algorithms for Submodular Multiway Partition. FOCS 2011: 807-816 - [c67]Chandra Chekuri, Alina Ene:
Submodular Cost Allocation Problem and Applications. ICALP (1) 2011: 354-366 - [c66]Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
Approximability of Capacitated Network Design. IPCO 2011: 78-91 - [c65]MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx:
Prize-collecting Steiner Problems on Planar Graphs. SODA 2011: 1028-1049 - [c64]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. SODA 2011: 1080-1097 - [c63]Jan Vondrák, Chandra Chekuri, Rico Zenklusen:
Submodular function maximization via the multilinear relaxation and contention resolution schemes. STOC 2011: 783-792 - [i17]Chandra Chekuri, Alina Ene:
Submodular Cost Allocation Problem and Applications. CoRR abs/1105.2040 (2011) - [i16]Chandra Chekuri, Alina Ene:
Approximation Algorithms for Submodular Multiway Partition. CoRR abs/1105.2048 (2011) - [i15]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. CoRR abs/1105.4593 (2011) - [i14]Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity Flows and Cuts in Polymatroidal Networks. CoRR abs/1110.6832 (2011) - 2010
- [j34]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. SIAM J. Comput. 39(5): 1772-1798 (2010) - [c62]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. FOCS 2010: 575-584 - [c61]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-Cut Gaps for Integer and Fractional Multiflows. SODA 2010: 1198-1208 - [c60]Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid:
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). WAOA 2010: 71-82 - [i13]Chandra Chekuri, Alina Ene, Nitish Korula:
Prize-Collecting Steiner Tree and Forest in Planar Graphs. CoRR abs/1006.4357 (2010) - [i12]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-Cut Gaps for Integer and Fractional Multiflows. CoRR abs/1008.2136 (2010) - [i11]Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
Approximability of Capacitated Network Design. CoRR abs/1009.5734 (2010)
2000 – 2009
- 2009
- [j33]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
A Note on Multiflows and Treewidth. Algorithmica 54(3): 400-412 (2009) - [j32]Chandra Chekuri, Luca Trevisan:
Foreword. Algorithmica 55(1): 111-112 (2009) - [j31]Gruia Calinescu, Chandra Chekuri, Jan Vondrák:
Disjoint bases in a polymatroid. Random Struct. Algorithms 35(4): 418-430 (2009) - [j30]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
Edge-Disjoint Paths in Planar Graphs with Constant Congestion. SIAM J. Comput. 39(1): 281-301 (2009) - [c59]Chandra Chekuri, Alina Ene, Nitish Korula:
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. APPROX-RANDOM 2009: 42-55 - [c58]Chandra Chekuri, Iftah Gamzu:
Truthful Mechanisms via Greedy Iterative Packing. APPROX-RANDOM 2009: 56-69 - [c57]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the set multi-cover problem in geometric settings. SCG 2009: 341-350 - [c56]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. ESA 2009: 444-455 - [c55]Chandra Chekuri, Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Applications. ICALP (1) 2009: 254-265 - [c54]Chun-cheng Chen, Chandra Chekuri, Diego Klabjan:
Topology Formation for Wireless Mesh Network Planning. INFOCOM 2009: 2671-2675 - [c53]Chandra Chekuri, Benjamin Moseley:
Online scheduling to minimize the maximum delay factor. SODA 2009: 1116-1125 - [c52]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling [Extended Abstract]. WAOA 2009: 62-74 - [i10]Chandra Chekuri, Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Applications. CoRR abs/0902.2795 (2009) - [i9]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. CoRR abs/0906.2048 (2009) - [i8]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling. CoRR abs/0906.2395 (2009) - [i7]Chandra Chekuri, Iftah Gamzu:
Truthful Mechanisms via Greedy Iterative Packing. CoRR abs/0906.2466 (2009) - [i6]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the Set Multi-Cover Problem in Geometric Settings. CoRR abs/0909.0537 (2009) - [i5]Chandra Chekuri, Jan Vondrák:
Randomized Pipage Rounding for Matroid Polytopes and Applications. CoRR abs/0909.4348 (2009) - 2008
- [j29]Chandra Chekuri, F. Bruce Shepherd:
Approximate Integer Decompositions for Undirected Network Design Problems. SIAM J. Discret. Math. 23(1): 163-177 (2008) - [c51]Chandra Chekuri, Nitish Korula:
Pruning 2-Connected Graphs. FSTTCS 2008: 119-130 - [c50]Chandra Chekuri, Nitish Korula:
Single-Sink Network Design with Vertex Connectivity Requirements. FSTTCS 2008: 131-142 - [c49]Chandra Chekuri, Sanjeev Khanna:
Algorithms for 2-Route Cut Problems. ICALP (1) 2008: 472-484 - [c48]Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev:
Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541 - [c47]Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. SODA 2008: 661-670 - [r2]Chandra Chekuri:
Multicommodity Flow, Well-linked Terminals and Routing Problems. Encyclopedia of Algorithms 2008 - [i4]Chandra Chekuri, Nitish Korula:
Min-Cost 2-Connected Subgraphs With k Terminals. CoRR abs/0802.2528 (2008) - [i3]Chandra Chekuri, Benjamin Moseley:
Online Scheduling to Minimize the Maximum Delay Factor. CoRR abs/0807.1891 (2008) - 2007
- [j28]Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar:
Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica 47(1): 53-78 (2007) - [j27]Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-Cooperative Multicast and Facility Location Games. IEEE J. Sel. Areas Commun. 25(6): 1193-1206 (2007) - [j26]Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà:
Hardness of robust network design. Networks 50(1): 50-54 (2007) - [j25]Chandra Chekuri:
Routing and network design with robustness to changing or uncertain traffic demands. SIGACT News 38(3): 106-129 (2007) - [j24]Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd:
Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Algorithms 3(3): 27 (2007) - [j23]Chandra Chekuri, Sanjeev Khanna:
Edge-disjoint paths revisited. ACM Trans. Algorithms 3(4): 46 (2007) - [j22]Chandra Chekuri, Martin Pál:
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. Theory Comput. 3(1): 197-209 (2007) - [c46]Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang:
Buy-at-Bulk Network Design with Protection. FOCS 2007: 634-644 - [c45]Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák:
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO 2007: 182-196 - [c44]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation algorithms for node-weighted buy-at-bulk network design. SODA 2007: 1265-1274 - [i2]Chandra Chekuri, Nitish Korula:
Approximation Algorithms for Orienteering with Time Windows. CoRR abs/0711.4825 (2007) - 2006
- [j21]Chandra Chekuri, Paul Claisse, René-Jean Essiambre, Steven Fortune, Daniel C. Kilper, Wonsuck Lee, Nachi K. Nithi, Iraj Saniee, F. Bruce Shepherd, Christopher A. White, Gordon T. Wilfong, Lisa Zhang:
Design tools for transparent optical networks. Bell Labs Tech. J. 11(2): 129-143 (2006) - [j20]Chandra Chekuri, Guy Even, Guy Kortsarz:
A greedy approximation algorithm for the group Steiner problem. Discret. Appl. Math. 154(1): 15-34 (2006) - [j19]Chandra Chekuri, Daniele Micciancio:
Special Issue: FOCS 2003. J. Comput. Syst. Sci. 72(2): 205 (2006) - [j18]Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Embedding k-Outerplanar Graphs into l 1. SIAM J. Discret. Math. 20(1): 119-136 (2006) - [j17]Chandra Chekuri, Sudipto Guha, Joseph Naor:
The Steiner k-Cut Problem. SIAM J. Discret. Math. 20(1): 261-271 (2006) - [j16]Chandra Chekuri, Christina Fragouli, Emina Soljanin:
On average throughput and alphabet size in network coding. IEEE Trans. Inf. Theory 52(6): 2410-2424 (2006) - [j15]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory Comput. 2(7): 137-146 (2006) - [c43]Chandra Chekuri, Martin Pál:
An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. APPROX-RANDOM 2006: 95-103 - [c42]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS 2006: 677-686 - [c41]Chandra Chekuri, Christina Fragouli, Emina Soljanin:
On Achievable Information Rates in Single-Source Non-Uniform Demand Networks. ISIT 2006: 773-777 - [c40]Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-cooperative multicast and facility location games. EC 2006: 72-81 - [c39]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
Edge-disjoint paths in Planar graphs with constant congestion. STOC 2006: 757-766 - 2005
- [j14]Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz:
Building Edge-Failure Resilient Networks. Algorithmica 43(1-2): 17-41 (2005) - [j13]Chandra Chekuri, Anupam Gupta, Amit Kumar:
On a bidirected relaxation for the MULTIWAY CUT problem. Discret. Appl. Math. 150(1-3): 67-79 (2005) - [j12]Li (Erran) Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo:
Routing bandwidth guaranteed paths with local restoration in label switched networks. IEEE J. Sel. Areas Commun. 23(2): 437-449 (2005) - [j11]Chandra Chekuri, Sanjeev Khanna:
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. SIAM J. Comput. 35(3): 713-728 (2005) - [c38]Moses Charikar, Chandra Chekuri, Martin Pál:
Sampling Bounds for Stochastic Optimization. APPROX-RANDOM 2005: 257-269 - [c37]Chandra Chekuri, Martin Pál:
A Recursive Greedy Algorithm for Walks in Directed Graphs. FOCS 2005: 245-253 - [c36]Chandra Chekuri, Christina Fragouli, Emina Soljanin:
On average throughput and alphabet size in network coding. ISIT 2005: 1593-1597 - [c35]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
Multicommodity flow, well-linked terminals, and routing problems. STOC 2005: 183-192 - [e1]Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan:
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. Lecture Notes in Computer Science 3624, Springer 2005, ISBN 3-540-28239-4 [contents] - 2004
- [j10]Chandra Chekuri, Sanjeev Khanna:
On Multidimensional Packing Problems. SIAM J. Comput. 33(4): 837-851 (2004) - [j9]Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani:
Incremental Clustering and Dynamic Information Retrieval. SIAM J. Comput. 33(6): 1417-1440 (2004) - [j8]Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin:
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. SIAM J. Discret. Math. 18(3): 608-625 (2004) - [c34]Chandra Chekuri, Amit Kumar:
Maximum Coverage Problem with Group Budget Constraints and Applications. APPROX-RANDOM 2004: 72-83 - [c33]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
Edge-Disjoint Paths in Planar Graphs. FOCS 2004: 71-80 - [c32]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
The all-or-nothing multicommodity flow problem. STOC 2004: 156-165 - [c31]Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar:
Multi-processor scheduling to minimize flow time with epsilon resource augmentation. STOC 2004: 363-372 - [r1]Chandra Chekuri, Sanjeev Khanna:
Approximation Algorithms for Minimizing AverageWeighted Completion Time. Handbook of Scheduling 2004 - 2003
- [c30]Chandra Chekuri, Sudipto Guha, Joseph Naor:
Approximating Steiner k-Cuts. ICALP 2003: 189-199 - [c29]Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd:
Multicommodity Demand Flow in a Tree. ICALP 2003: 410-425 - [c28]Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Embedding k-outerplanar graphs into l1. SODA 2003: 527-536 - [c27]Chandra Chekuri, Sanjeev Khanna:
Edge disjoint paths revisited. SODA 2003: 628-637 - 2002
- [c26]Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar:
Approximation Algorithms for the Unsplittable Flow Problem. APPROX 2002: 51-66 - [c25]Li Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo:
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks. ICNP 2002: 110-121 - [c24]Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz:
Building Edge-Failure Resilient Networks. IPCO 2002: 439-456 - [c23]Chandra Chekuri, Sanjeev Khanna:
Approximation schemes for preemptive weighted flow time. STOC 2002: 297-305 - 2001
- [j7]Chandra Chekuri, Michael A. Bender:
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. J. Algorithms 41(2): 212-224 (2001) - [j6]Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein:
Approximation Techniques for Average Completion Time Scheduling. SIAM J. Comput. 31(1): 146-166 (2001) - [c22]Chandra Chekuri, Sanjeev Khanna:
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. ICALP 2001: 848-861 - [c21]Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin:
Approximation algorithms for the metric labeling problem via a new linear programming formulation. SODA 2001: 109-118 - [c20]Chandra Chekuri, Sanjeev Khanna, Joseph Naor:
A deterministic algorithm for the cost-distance problem. SODA 2001: 232-233 - [c19]Chandra Chekuri, Sanjeev Khanna, An Zhu:
Algorithms for minimizing weighted flow time. STOC 2001: 84-93 - [i1]Chandra Chekuri, Sanjeev Khanna:
Approximation Schemes for Preemptive Weighted Flow Time. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j5]Michael A. Bender, Chandra Chekuri:
Performance guarantees for the TSP with a parameterized triangle inequality. Inf. Process. Lett. 73(1-2): 17-21 (2000) - [j4]Chandra Chekuri, Anand Rajaraman:
Conjunctive query containment revisited. Theor. Comput. Sci. 239(2): 211-229 (2000) - [c18]Chandra Chekuri, Kavita Ramanan, Philip A. Whiting, Lisa Zhang:
Blocking probability estimates in a partitioned sector TDMA system. DIAL-M 2000: 28-34 - [c17]Chandra Chekuri, Sanjeev Khanna:
A PTAS for the multiple knapsack problem. SODA 2000: 213-222
1990 – 1999
- 1999
- [j3]Chandra Chekuri, Rajeev Motwani:
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine. Discret. Appl. Math. 98(1-2): 29-38 (1999) - [j2]Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li:
Approximation Algorithms for Directed Steiner Problems. J. Algorithms 33(1): 73-91 (1999) - [j1]Donald Aingworth, Chandra Chekuri, Piotr Indyk, Rajeev Motwani:
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). SIAM J. Comput. 28(4): 1167-1181 (1999) - [c16]Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko:
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44 - [c15]Chandra Chekuri, Sanjeev Khanna:
On Multi-Dimensional Packing Problems. SODA 1999: 185-194 - [c14]Chandra Chekuri, Rajeev Motwani:
Minimizing Weighted Completion Time on a Single Machine. SODA 1999: 873-874 - [c13]Michael A. Bender, Chandra Chekuri:
Performance Guarantees for the TSP with a Parameterized Triangle Inequality. WADS 1999: 80-85 - 1998
- [b1]Chandra Chekuri:
Approximation algorithms for scheduling problems. Stanford University, USA, 1998 - [c12]Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin:
Approximating a Finite Metric by a Small Number of Tree Metrics. FOCS 1998: 379-388 - [c11]Chandra Chekuri, Michael A. Bender:
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. IPCO 1998: 383-393 - [c10]Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li:
Approximation Algorithms for Directed Steiner Problems. SODA 1998: 192-200 - [c9]Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha:
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median. STOC 1998: 114-123 - [c8]Narayanan Shivakumar, Hector Garcia-Molina, Chandra Chekuri:
Filtering with Approximate Predicates. VLDB 1998: 263-274 - 1997
- [c7]Chandra Chekuri, Anand Rajaraman:
Conjunctive Query Containment Revisited. ICDT 1997: 56-70 - [c6]Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein:
Experimental Study of Minimum Cut Algorithms. SODA 1997: 324-333 - [c5]Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein:
Approximation Techniques for Average Completion Time Scheduling. SODA 1997: 609-618 - [c4]Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani:
Incremental Clustering and Dynamic Information Retrieval. STOC 1997: 626-635 - 1996
- [c3]Chandra Chekuri, Richard Johnson, Rajeev Motwani, B. Natarajan, B. Ramakrishna Rau, Michael S. Schlansker:
Profile-driven Instruction Level Parallel Scheduling with Application to Super Blocks. MICRO 1996: 58-67 - [c2]Donald Aingworth, Chandra Chekuri, Rajeev Motwani:
Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). SODA 1996: 547-553 - 1995
- [c1]Chandra Chekuri, Waqar Hasan, Rajeev Motwani:
Scheduling Problems in Parallel Query Optimization. PODS 1995: 255-265
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 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:
