Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Karande, Chinmay
16  Ergebnisse:
Personensuche X
?
1

Optimizing budget constrained spend in search advertising:

, In: Proceedings of the sixth ACM international conference on Web search and data mining,
Karande, Chinmay ; Mehta, Aranyak ; Srikant, Ramakrishnan - p. 697-706 , 2013
Link: https://dl.acm.org/doi/1..
 
?
2

Online vertex-weighted bipartite matching and single-bid bu..:

, In: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms,
Aggarwal, Gagan ; Goel, Gagan ; Karande, Chinmay. - p. 1253-1264 , 2011
Link: https://dl.acm.org/doi/1..
 
?
3

Online bipartite matching with unknown distributions:

, In: Proceedings of the forty-third annual ACM symposium on Theory of computing,
Karande, Chinmay ; Mehta, Aranyak ; Tripathi, Pushkar - p. 587-596 , 2011
Link: https://dl.acm.org/doi/1..
 
?
4

Approximability of combinatorial problems with multi-agent ..:

Goel, Gagan ; Karande, Chinmay ; Tripathi, Pushkar.
ACM SIGecom Exchanges.  9 (2010)  1 - p. 1-4 , 2010
Link: https://dl.acm.org/doi/1..
 
?
5

Approximability of combinatorial problems with multi-agent ..:

Goel, Gagan ; Karande, Chinmay ; Tripathi, Pushkar.
ACM SIGecom Exchanges.  9 (2010)  1 - p. 1-4 , 2010
Link: https://doi.org/10.1145/..
 
?
6

Single-Parameter Combinatorial Auctions with Partially Publ..:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,
Goel, Gagan ; Karande, Chinmay ; Wang, Lei - p. 234-245 , 2010
Link: https://doi.org/10.1007/..
 
?
7

Single-parameter combinatorial auctions with partially publ..:

, In: Proceedings of the Third international conference on Algorithmic game theory,
Goel, Gagan ; Karande, Chinmay ; Wang, Lei - p. 234-245 , 2010
Link: https://dl.acm.org/doi/1..
 
?
8

Speeding up algorithms on compressed web graphs:

, In: Proceedings of the Second ACM International Conference on Web Search and Data Mining,
Karande, Chinmay ; Chellapilla, Kumar ; Andersen, Reid - p. 272-281 , 2009
Link: https://dl.acm.org/doi/1..
 
?
9

Online Vertex-Weighted Bipartite Matching and Single-bid Bu..:

Aggarwal, Gagan ; Goel, Gagan ; Karande, Chinmay.
http://arxiv.org/abs/1007.1271.  , 2010
Link: http://arxiv.org/abs/100..
 
?
10

Market Equilibrium with Transaction Costs:

Chakraborty, Sourav ; Devanur, Nikhil ; Karande, Chinmay
http://arxiv.org/abs/1001.0393.  , 2010
Link: http://arxiv.org/abs/100..
 
?
11

Single Parameter Combinatorial Auctions with Partially Publ..:

Goel, Gagan ; Karande, Chinmay ; Wang, Lei
http://arxiv.org/abs/1007.3539.  , 2010
Link: http://arxiv.org/abs/100..
 
?
12

Polynomially Correlated Knapsack is NP-complete:

Karande, Chinmay
http://arxiv.org/abs/0910.2649.  , 2009
Link: http://arxiv.org/abs/091..
 
?
13

The Effect of Malice on the Social Optimum in Linear Load B..:

Chakrabarty, Deeparnab ; Karande, Chinmay ; Sangwan, Ashish
http://arxiv.org/abs/0910.2655.  , 2009
Link: http://arxiv.org/abs/091..
 
?
14

Reporting maximal cliques: new insights into an old problem:

Cazals, Frédéric ; Karande, Chinmay
Report N°: RR-5615.  , 2006
Link: https://hal.inria.fr/inr..
 
?
15

An algorithm for reporting maximal c-cliques:

Cazals, Frédéric ; Karande, Chinmay
Report N°: RR-5642.  , 2006
Link: https://hal.inria.fr/inr..
 
1-15