◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sumedha Uniyal

4 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author4

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.DM2
  • cs.DS2

identity via Semantic Scholar / OpenAlex

activity
20182020
collaborators

4 papers

cs.DM2020

Multi-transversals for Triangles and the Tuza's Conjecture

Parinya Chalermsook, Samir Khuller, Pattara Sukprasert +1

In this paper, we study a primal and dual relationship about triangles: For any graph G, let ν(G) be the maximum number of edge-disjoint triangles in G, and τ(G) be the min…

cs.DS2019

PTAS for Steiner Tree on Map Graphs

Jarosław Byrka, Mateusz Lewandowski, Syed Mohammad Meesum +2

We study the Steiner tree problem on map graphs, which substantially generalize planar graphs as they allow arbitrarily large cliques. We obtain a PTAS for Steiner tree on map grap…

cs.DS2018

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints

Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase +1

Motivated by applications in machine learning, such as subset selection and data summarization, we consider the problem of maximizing a monotone submodular function subject to mixe…

cs.DM2018

A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs

Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal

A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph G contains a cactus subgraph C where C c…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.