BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Hungary
1 × Spain
1 × The Netherlands
1 × United Kingdom
2 × Canada
2 × Greece
4 × USA
Collaborated with:
B.Raghavachari B.Saha R.Gandhi A.Srinivasan R.Thurimella U.Vishkin Y.A.Kim Y.(.Wan M.Charikar E.Rivlin A.Rosenfeld N.E.Young S.G.Mitchell V.V.Vazirani E.Halperin G.Kortsarz G.Aggarwal T.Feder K.Kenthapadi R.Panigrahy D.Thomas A.Zhu
Talks about:
algorithm (7) approxim (5) cover (4) problem (2) weight (2) improv (2) graph (2) capac (2) hard (2) hypergraph (1)

Person: Samir Khuller

DBLP DBLP: Khuller:Samir

Contributed to:

ICALP (1) 20122012
ICALP (1) 20092009
PODS 20062006
ICALP 20032003
PODS 20032003
ICALP 20012001
STOC 19981998
ICALP 19951995
STOC 19951995
STOC 19941994
ICALP 19921992
STOC 19921992
ICALP 19911991

Wrote 13 papers:

ICALP-v1-2012-SahaK #set
Set Cover Revisited: Hypergraph Cover with Hard Capacities (BS, SK), pp. 762–773.
ICALP-v1-2009-KhullerS #on the
On Finding Dense Subgraphs (SK, BS), pp. 597–608.
PODS-2006-AggarwalFKKPTZ #clustering
Achieving anonymity via clustering (GA, TF, KK, SK, RP, DT, AZ), pp. 153–162.
ICALP-2003-GandhiHKKS #algorithm #approximate
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities (RG, EH, SK, GK, AS), pp. 164–175.
PODS-2003-KhullerKW #algorithm #migration
Algorithms for data migration with cloning (SK, YAK, YC(W), pp. 27–36.
ICALP-2001-GandhiKS #algorithm #approximate #problem
Approximation Algorithms for Partial Covering Problems (RG, SK, AS), pp. 225–236.
STOC-1998-CharikarKR #algorithm
Algorithms for Capacitated Vehicle Routing (MC, SK, BR), pp. 349–358.
ICALP-1995-KhullerRR #named
Graphbots: Mobility in Discrete Spaces (SK, ER, AR), pp. 593–604.
STOC-1995-KhullerR #algorithm #approximate #problem
Improved approximation algorithms for uniform connectivity problems (SK, BR), pp. 1–10.
STOC-1994-KhullerRY
Low degree spanning trees of small weight (SK, BR, NEY), pp. 412–421.
ICALP-1992-KhullerT #algorithm #approximate #graph
Approximation Algorithms for Graph Augmentation (SK, RT), pp. 330–341.
STOC-1992-KhullerV #approximate #graph
Biconnectivity Approximations and Graph Carvings (SK, UV), pp. 759–770.
ICALP-1991-KhullerMV #algorithm #online
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages (SK, SGM, VVV), pp. 728–738.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.