default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSumedha Uniyal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Parinya Chalermsook
, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20(1): 6:1-6:20 (2024)- [c7]Gruia Calinescu, Sumedha Uniyal:
Local Optimization Algorithms for Maximum Planar Subgraph. ESA 2024: 38:1-38:18 - 2021
- [i6]Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR abs/2111.06299 (2021) - 2020
- [c6]Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. LATIN 2020: 3-14 - [c5]Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal:
Multi-transversals for Triangles and the Tuza's Conjecture. SODA 2020: 1955-1974 - [i5]Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal:
Multi-transversals for Triangles and the Tuza's Conjecture. CoRR abs/2001.00257 (2020)
2010 – 2019
- 2019
- [c4]Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal:
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. ICALP 2019: 85:1-85:15 - [c3]Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal:
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. STACS 2019: 19:1-19:14 - [i4]Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. CoRR abs/1912.00717 (2019) - 2018
- [i3]Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal:
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. CoRR abs/1804.03485 (2018) - [i2]Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal:
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. CoRR abs/1804.10947 (2018) - 2016
- [c2]Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal:
An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation. IPCO 2016: 262-274 - 2015
- [c1]Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal:
Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. WAOA 2015: 13-24 - [i1]Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal:
An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation. CoRR abs/1511.07494 (2015)
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-09-26 01:51 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:
