default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- 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.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 256 matches
- 2024
- Chandra Chekuri, Vasilis Livanos:
On submodular prophet inequalities and correlation gap. Theor. Comput. Sci. 1019: 114814 (2024) - 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) - Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. AAAI 2024: 9590-9597 - 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 - 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 - 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 - 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 - Chandra Chekuri, Junkai Song, Weizhong Zhang:
Contention Resolution for the ℓ-fold union of a matroid via the correlation gap. SOSA 2024: 396-405 - Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Network Design in Non-Uniform Fault Models. CoRR abs/2403.15547 (2024) - Jaydip Sen, Joceli Mayer, Subhasis Dasgupta, Subrata Nandi, Srinivasan Krishnaswamy, Pinaki Mitra, Mahendra Pratap Singh, Naga Prasanthi Kundeti, Chandra Sekhara Rao MVP, Sudha Sree Chekuri, Seshu Babu Pallapothu, Preethi Nanjundan, Jossy P. George, Abdelhadi El Allahi, Ilham Morino, Salma AIT Oussous, Siham Beloualid, Ahmed Tamtaoui, Abderrahim Bajit:
Information Security and Privacy in the Digital World: Some Selected Topics. CoRR abs/2404.00235 (2024) - 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) - Chandra Chekuri, Junkai Song:
Colorful Priority k-Supplier. CoRR abs/2406.14984 (2024) - 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
- Karthekeyan Chandrasekaran, Chandra Chekuri:
Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. Comb. 43(3): 455-477 (2023) - Tanvi Bajpai, Chandra Chekuri:
Bicriteria Approximation Algorithms for Priority Matroid Median. APPROX/RANDOM 2023: 7:1-7:22 - Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. APPROX/RANDOM 2023: 24:1-24:22 - 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 - Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Network Design in Non-Uniform Fault Models. ICALP 2023: 36:1-36:20 - Satvik Chekuri, Prashant Chandrasekar, Bipasha Banerjee, Sung Hee Park, Nila Masrourisaadat, Aman Ahuja, William A. Ingram, Edward A. Fox:
Integrated Digital Library System for Long Documents and their Elements. JCDL 2023: 13-24 - 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) - 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) - Chandra Chekuri, Manuel R. Torres:
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. CoRR abs/2306.02172 (2023) - Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. CoRR abs/2307.02022 (2023) - 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) - 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) - 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
- 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) - Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time. Math. Oper. Res. 47(4): 3380-3399 (2022) - 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) - Chandra Chekuri, Tanmay Inamdar:
Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory Comput. 18: 1-19 (2022)
skipping 226 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-09 07:53 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint