Ravi Sundaram

Available identifiers

zbMath Open sundaram.raviMaRDI QIDQ210282

List of research outcomes

Publication	Date of Publication	Type
Approximating latin square extensions	2024-01-29	Paper
Service-constrained network design problems	2022-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q5091228	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5002612	2021-07-28	Paper
Realization problems on reachability sequences	2021-04-21	Paper
Realization problems on reachability sequences	2021-04-14	Paper
Cache me if you can: capacitated selfish replication games in networks	2020-02-27	Paper
Plane gossip: approximating rumor spread in planar graphs	2020-02-12	Paper
Bicriteria Network Design Problems	2019-01-10	Paper
Markovian Hitters and the Complexity of Blind Rendezvous	2018-07-16	Paper
Improving spanning trees by upgrading nodes	2018-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q5351912	2017-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q5275393	2017-07-13	Paper
Balls and Funnels: Energy Efficient Group-to-Group Anycasts	2016-09-02	Paper
A note on optical routing on trees	2016-05-26	Paper
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget	2014-12-12	Paper
Reducibility among Fractional Stability Problems	2014-07-25	Paper
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget	2014-06-10	Paper
Reducibility among Fractional Stability Problems	2014-04-11	Paper
Cache Me If You Can: Capacitated Selfish Replication Games	2012-06-29	Paper
Meet and merge	2010-08-16	Paper
Universal approximations for TSP, Steiner tree, and set cover	2010-08-16	Paper
(Almost) tight bounds and existence theorems for confluent flows	2010-08-15	Paper
(Almost) Tight bounds and existence theorems for single-commodity confluent flows	2008-12-21	Paper
On Completing Latin Squares	2007-09-03	Paper
Meet and merge: approximation algorithms for confluent flows	2006-06-30	Paper
Alternation in interaction	2002-06-02	Paper
On embedding complete graphs into hypercubes	2000-11-02	Paper
Improving Minimum Cost Spanning Trees by Upgrading Nodes	2000-02-06	Paper
Symmetric alternation captures BPP	1999-01-03	Paper
Bicriteria Network Design Problems	1998-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4395332	1998-06-11	Paper
A note on the asymptotic and computational complexity of graph distinguishability	1998-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q3129923	1997-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q3128917	1997-08-04	Paper
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE	1997-02-28	Paper
Spanning Trees—Short or Small	1996-07-24	Paper
Treewidth of Circular-Arc Graphs	1994-12-20	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Ravi Sundaram