default search action
Vivek Madan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c14]Anastasia Razdaibiedina, Ashish Khetan, Zohar Karnin, Daniel Khashabi, Vivek Madan:
Representation Projection Invariance Mitigates Representation Collapse. EMNLP (Findings) 2023: 14638-14664 - [c13]Daksh Idnani, Vivek Madan, Naman Goyal, David J. Schwab, Ramakrishna Vedantam:
Don't forget the nullspace! Nullspace occupancy as a mechanism for out of distribution failure. ICLR 2023 - 2022
- [i9]Anastasia Razdaibiedina, Vivek Madan, Zohar Karnin, Ashish Khetan, Vishaal Kapoor:
Improving language models fine-tuning with representation consistency targets. CoRR abs/2205.11603 (2022) - 2021
- [c12]Vivek Madan, Ashish Khetan, Zohar Karnin:
TADPOLE: Task ADapted Pre-Training via AnOmaLy DEtection. EMNLP (1) 2021: 5732-5746 - [i8]Fred Qin, Vivek Madan, Ujjwal Ratan, Zohar Karnin, Vishaal Kapoor, Parminder Bhatia, Taha A. Kass-Hout
:
Improving Early Sepsis Prediction with Multi Modal Learning. CoRR abs/2107.11094 (2021) - 2020
- [j4]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the integrality gap for multiway cut. Math. Program. 183(1): 171-193 (2020) - [j3]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
A tight $\sqrt{2}$-approximation for linear 3-cut. Math. Program. 184(1): 411-443 (2020) - [c11]Vivek Madan, Aleksandar Nikolov, Mohit Singh, Uthaipon Tantipongpipat:
Maximizing Determinants under Matroid Constraints. FOCS 2020: 565-576 - [i7]Vivek Madan, Aleksandar Nikolov, Mohit Singh, Uthaipon Tantipongpipat:
Maximizing Determinants under Matroid Constraints. CoRR abs/2004.07886 (2020)
2010 – 2019
- 2019
- [j2]Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan:
On the Expansion of Group-Based Lifts. SIAM J. Discret. Math. 33(3): 1338-1373 (2019) - [c10]Vivek Madan, Mohit Singh, Uthaipon Tantipongpipat, Weijun Xie:
Combinatorial Algorithms for Optimal Design. COLT 2019: 2210-2258 - [c9]Kristóf Bérczi
Improving the Integrality Gap for Multiway Cut. IPCO 2019: 115-127 - 2018
- [b1]Vivek Madan:
On approximability and LP formulations for multicut and feedback set problems. University of Illinois Urbana-Champaign, USA, 2018 - [c8]Alexandra Kolla, Ioannis Koutis
Spectrally Robust Graph Isomorphism. ICALP 2018: 84:1-84:13 - [c7]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
A tight -approximation for Linear 3-Cut. SODA 2018: 1393-1406 - [i6]Alexandra Kolla, Ioannis Koutis, Vivek Madan, Ali Kemal Sinop:
Spectrally Robust Graph Isomorphism. CoRR abs/1805.00181 (2018) - [i5]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the Integrality Gap for Multiway Cut. CoRR abs/1807.09735 (2018) - 2017
- [c6]Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan:
On the Expansion of Group-Based Lifts. APPROX-RANDOM 2017: 24:1-24:13 - [c5]Chandra Chekuri, Vivek Madan:
Approximating Multicut and the Demand Graph. SODA 2017: 855-874 - 2016
- [c4]Chandra Chekuri, Vivek Madan:
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. SODA 2016: 797-807 - [c3]Chandra Chekuri, Vivek Madan:
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation. SODA 2016: 808-820 - [i4]Chandra Chekuri, Vivek Madan:
Approximating Multicut and the Demand Graph. CoRR abs/1607.07200 (2016) - 2015
- [j1]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) - [i3]Chandra Chekuri, Vivek Madan:
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. CoRR abs/1507.04674 (2015) - 2014
- [c2]Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of Trees for Capacitated k-Center. IPCO 2014: 52-63 - 2013
- [i2]Naman Agarwal, Alexandra Kolla, Vivek Madan:
Small Lifts of Expander Graphs are Expanding. CoRR abs/1311.3268 (2013) - 2012
- [c1]Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty
Preservation under Substructures modulo Bounded Cores. WoLLIC 2012: 291-305 - [i1]Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty:
Preservation under Substructures modulo Bounded Cores. CoRR abs/1205.1358 (2012)
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-07-25 19:27 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: