Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Mohammad Mahdian

Papers on DiSC'04


Comparing and Aggregating Rankings with Ties

Exploring the Community Structure of Newsgroups

Exploring the Community Structure of Newsgroups

Publications


Note: Links lead to the DBLP on the Web.

Mohammad Mahdian

Nicole Immorlica , Mohammad Mahdian, Vahab S. Mirrokni : Cycle Cover with Short Cycles. STACS 2005 : 641-653

Lisa Fleischer , Kamal Jain , Mohammad Mahdian: Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. FOCS 2004 : 277-285

Nikhil Bansal , Lisa Fleischer , Tracy Kimbrel , Mohammad Mahdian, Baruch Schieber , Maxim Sviridenko : Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004 : 196-207

Ranveer Chandra , Lili Qiu , Kamal Jain , Mohammad Mahdian: Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks. ICNP 2004 : 271-282

Christian Borgs , Jennifer T. Chayes , Mohammad Mahdian, Amin Saberi : Exploring the community structure of newsgroups. KDD 2004 : 783-787

Ronald Fagin , Ravi Kumar , Mohammad Mahdian, D. Sivakumar , Erik Vee : Comparing and Aggregating Rankings with Ties. PODS 2004 : 47-58

Peter Adams , Mohammad Mahdian, Ebadollah S. Mahmoodian : On the forced matching numbers of bipartite graphs. Discrete Mathematics 281 (1-3): 1-12 (2004)

Mohammad Mahdian, Martin Pál : Universal Facility Location. ESA 2003 : 409-421

Mohammad Mahdian, Yingyu Ye , Jiawei Zhang : A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. RANDOM-APPROX 2003 : 129-140

Kamal Jain , Mohammad Mahdian, Amin Saberi : Approximating Market Equilibria. RANDOM-APPROX 2003 : 98-108

Kamal Jain , Mohammad Mahdian, Mohammad R. Salavatipour : Packing Steiner trees. SODA 2003 : 266-274

Veselin Jungic , Jacob Licht , Mohammad Mahdian, Jaroslav Nesetril , Rados Radoicic : Rainbow Arithmetic Progressions and Anti-Ramsey Results. Combinatorics, Probability & Computing 12 (5-6): 599-620 (2003)

Kamal Jain , Mohammad Mahdian, Evangelos Markakis , Amin Saberi , Vijay V. Vazirani : Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50 (6): 795-824 (2003)

Mohammad Taghi Hajiaghayi , Mohammad Mahdian, Vahab S. Mirrokni : The facility location problem with general cost functions. Networks 42 (1): 42-47 (2003)

Mohammad Mahdian, Yinyu Ye , Jiawei Zhang : Improved Approximation Algorithms for Metric Facility Location Problems. APPROX 2002 : 229-242

Kamal Jain , Mohammad Mahdian, Amin Saberi : A new greedy approach for facility location problems. STOC 2002 : 731-740

Kamal Jain , Mohammad Mahdian, Evangelos Markakis , Amin Saberi , Vijay V. Vazirani : Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP CoRR cs.DS/0207028 : (2002)

Mohammad Mahdian: On the computational complexity of strong edge coloring. Discrete Applied Mathematics 118 (3): 239-248 (2002)

Mohammad Ghodsi , Mohammad Taghi Hajiaghayi , Mohammad Mahdian, Vahab S. Mirrokni : Length-constrained path-matchings in graphs. Networks 39 (4): 210-215 (2002)

Mohammad Mahdian, Evangelos Markakis , Amin Saberi , Vijay V. Vazirani : A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. RANDOM-APPROX 2001 : 127-137

Mohammad Mahdian: The strong chromatic index of C4-free graphs. Random Struct. Algorithms 17 (3-4): 357-375 (2000)

Mohammad Mahdian, Ebadollah S. Mahmoodian : A Characterization of Uniquely 2-List Colorable Graphs. Ars Comb. 51 : (1999)

1 [ 16 ]

2 [ 20 ]

3 [ 18 ]

4 [ 19 ]

5 [ 18 ]

6 [ 17 ]

7 [ 20 ] [ 21 ]

8 [ 4 ]

9 [ 4 ] [ 9 ]

10 [ 22 ]

11 [ 6 ] [ 7 ] [ 10 ] [ 12 ] [ 13 ] [ 19 ] [ 21 ]

12 [ 11 ]

13 [ 20 ]

14 [ 17 ]

15 [ 11 ]

16 [ 1 ] [ 16 ]

17 [ 3 ] [ 6 ] [ 10 ]

18 [ 4 ] [ 9 ] [ 22 ]

19 [ 11 ]

20 [ 15 ]

21 [ 19 ]

22 [ 11 ]

23 [ 3 ] [ 6 ] [ 7 ] [ 10 ] [ 13 ] [ 18 ]

24 [ 12 ]

25 [ 20 ]

26 [ 17 ]

27 [ 20 ]

28 [ 3 ] [ 6 ] [ 10 ]

29 [ 17 ]

30 [ 14 ]

31 [ 8 ]

32 [ 8 ] [ 14 ]




©2005 Association for Computing Machinery