Travelled to:
1 × Hungary
1 × Italy
1 × Spain
2 × Sweden
3 × USA
Collaborated with:
M.V.Marathe D.J.Rosenkrantz I.Davidson H.B.H.III R.Ravi M.Ester P.Chundi R.Sundaram C.L.Barrett J.P.Smith A.Adiga C.J.Kuhlman R.E.Stearns S.O.Krumke H.Noltemeier H.Wirth
Talks about:
approxim (2) problem (2) network (2) complex (2) cluster (2) multi (2) constraint (1) bicriteria (1) increment (1) framework (1)
Person: S. S. Ravi
DBLP: Ravi:S=_S=
Contributed to:
Wrote 9 papers:
- CIAA-2015-AdigaKMRRS #complexity
- Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems (AA, CJK, MVM, SSR, DJR, RES), pp. 21–34.
- ICML-2007-DavidsonR #clustering #constraints
- Intractability and clustering with constraints (ID, SSR), pp. 201–208.
- KDD-2007-DavidsonRE #clustering #incremental #performance
- Efficient incremental constrained clustering (ID, SSR, ME), pp. 240–249.
- SAC-2002-BarrettMSR #ad hoc #communication #framework #generative #modelling #network #simulation
- A mobility and traffic generation framework for modeling and simulating ad hoc communication networks (CLB, MVM, JPS, SSR), pp. 122–126.
- ICALP-1997-KrumkeMNRRSW
- Improving Spanning Trees by Upgrading Nodes (SOK, MVM, HN, RR, SSR, RS, HCW), pp. 281–291.
- SAC-1997-ChundiRR #database #distributed #multi #transaction
- Multi-site distributed database transactions utilizing deferred update (PC, DJR, SSR), pp. 118–122.
- ICALP-1995-MaratheRSRRH #design #network #problem
- Bicriteria Network Design Problems (MVM, RR, RS, SSR, DJR, HBHI), pp. 487–498.
- ICALP-1993-MaratheHR #approximate #complexity #problem #specification
- The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (MVM, HBHI, SSR), pp. 76–87.
- STOC-1993-RaviMRRH #algorithm #approximate #multi
- Many birds with one stone: multi-objective approximation algorithms (RR, MVM, SSR, DJR, HBHI), pp. 438–447.