• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 156 matches

• 2024
• 
  Hang Liao, Deeparnab Chakrabarty:
  Learning Spanning Forests Optimally in Weighted Undirected Graphs with CUT queries. ALT 2024: 785-807
• 
  Deeparnab Chakrabarty, Luc Côté, Ankita Sarkar:
  Fault-tolerant k-Supplier with Outliers. STACS 2024: 23:1-23:19
• 2023
• 
  Deeparnab Chakrabarty, Maryam Negahbani:
  Robust k-center with two types of radii. Math. Program. 197(2): 991-1007 (2023)
• 
  Deeparnab Chakrabarty, Hang Liao:
  A Query Algorithm for Learning a Spanning Forest in Weighted Undirected Graphs. ALT 2023: 259-274
• 
  Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
  A d^1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. FOCS 2023: 1796-1821
• 
  Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford:
  Parallel Submodular Function Minimization. NeurIPS 2023
• 
  Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
  Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. STOC 2023: 233-241
• 
  Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
  A d^1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids. CoRR abs/2304.01416 (2023)
• 
  Hang Liao, Deeparnab Chakrabarty:
  Learning Spanning Forests Optimally using CUT Queries in Weighted Undirected Graphs. CoRR abs/2306.10182 (2023)
• 
  Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford:
  Parallel Submodular Function Minimization. CoRR abs/2309.04643 (2023)
• 
  Deeparnab Chakrabarty, Luc Côté, Ankita Sarkar:
  Fault-tolerant k-Supplier with Outliers. CoRR abs/2310.07208 (2023)
• 
  Deeparnab Chakrabarty, Luc Côté:
  A Primal-Dual Analysis of Monotone Submodular Maximization. CoRR abs/2311.07808 (2023)
• 
  Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
  A d^1/2+o(1) Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids. Electron. Colloquium Comput. Complex. TR23 (2023)
• 2022
• 
  Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar:
  Approximation Algorithms for Continuous Clustering and Facility Location Problems. ESA 2022: 33:1-33:15
• 
  Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford:
  Improved Lower Bounds for Submodular Function Minimization. FOCS 2022: 245-254
• 
  Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar:
  Approximation Algorithms for Continuous Clustering and Facility Location Problems. CoRR abs/2206.15105 (2022)
• 
  Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford:
  Improved Lower Bounds for Submodular Function Minimization. CoRR abs/2207.04342 (2022)
• 
  Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
  Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. CoRR abs/2211.05281 (2022)
• 
  Hadley Black, Deeparnab Chakrabarty, C. Seshadhri:
  Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an $\widetilde{O}(n\sqrt{d})$ Monotonicity Tester. Electron. Colloquium Comput. Complex. TR22 (2022)
• 2021
• 
  Deeparnab Chakrabarty, Sanjeev Khanna:
  Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling. Math. Program. 188(1): 395-407 (2021)
• 
  Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna:
  Graph Connectivity and Single Element Recovery via Linear and OR Queries. ESA 2021: 7:1-7:19
• 
  Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna:
  A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. FOCS 2021: 37-48
• 
  Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani:
  Revisiting Priority k-Center: Fairness and Outliers. ICALP 2021: 21:1-21:20
• 
  Deeparnab Chakrabarty, Maryam Negahbani:
  Robust k-Center with Two Types of Radii. IPCO 2021: 268-282
• 
  Maryam Negahbani, Deeparnab Chakrabarty:
  Better Algorithms for Individually Fair k-Clustering. NeurIPS 2021: 13340-13351
• 
  Deeparnab Chakrabarty, Maryam Negahbani:
  Robust $k$-Center with Two Types of Radii. CoRR abs/2102.11435 (2021)
• 
  Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani:
  Revisiting Priority k-Center: Fairness and Outliers. CoRR abs/2103.03337 (2021)
• 
  Deeparnab Chakrabarty, Maryam Negahbani:
  Better Algorithms for Individually Fair k-Clustering. CoRR abs/2106.12150 (2021)
• 
  Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna:
  A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection. CoRR abs/2111.07474 (2021)
• 2020
• 
  Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
  Deterministic Dynamic Matching in O(1) Update Time. Algorithmica 82(4): 1057-1080 (2020)

skipping 126 more matches