Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Vahab S. Mirrokni
Seyed Vahab Mirrokni
2010 – today
- 2013
[j34]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour: Two-stage Robust Network Design with Exponential Scenarios. Algorithmica 65(2): 391-408 (2013)- [j33]Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh: PASS Approximation: A Framework for Analyzing and Designing Heuristics. Algorithmica 66(2): 450-478 (2013)
- [j32]Nima AhmadiPourAnari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni: Equilibrium pricing with positive externalities. Theor. Comput. Sci. 476: 1-15 (2013)
- [j31]Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala: Optimal Auctions with Positive Network Externalities. ACM Trans. Economics and Comput. 1(2): 13 (2013)
- [c73]Nikhil R. Devanur, Zhiyi Huang, Nitish Korula, Vahab S. Mirrokni, Qiqi Yan: Whole-page optimization and submodular welfare maximization with online bidders. ACM Conference on Electronic Commerce 2013: 305-322
- [c72]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme: Clinching Auction with Online Supply. SODA 2013: 605-619
- [i13]Zeyuan Allen Zhu, Silvio Lattanzi, Vahab S. Mirrokni: A Local Algorithm for Finding Well-Connected Clusters. CoRR abs/1304.8132 (2013)
- 2012
- [j30]Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala: How to approximate optimal auctions. SIGecom Exchanges 11(1): 30-33 (2012)
- [j29]George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos: Convergence and approximation in potential games. Theor. Comput. Sci. 438: 13-27 (2012)
- [c71]Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni: Online allocation of display ads with smooth delivery. KDD 2012: 1213-1221
- [c70]MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad: On the Non-progressive Spread of Influence through Social Networks. LATIN 2012: 315-326
- [c69]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni: Advantage of Overlapping Clusters for Minimizing Conductance. LATIN 2012: 494-505
- [c68]Vahab S. Mirrokni, Nithum Thain, Adrian Vetta: A Theoretical Examination of Practical Game Playing: Lookahead Search. SAGT 2012: 251-262
- [c67]Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam: Simultaneous approximations for adversarial and stochastic online budgeted allocation. SODA 2012: 1690-1701
- [c66]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme: Polyhedral clinching auctions and the adwords polytope. STOC 2012: 107-122
- [c65]Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan: Budget Optimization for Online Campaigns with Positive Carryover Effects. WINE 2012: 86-99
- [c64]Vahab S. Mirrokni, Sebastien Roch, Mukund Sundararajan: On Fixed-Price Marketing for Goods with Positive Network Externalities. WINE 2012: 532-538
- [c63]Reid Andersen, David F. Gleich, Vahab S. Mirrokni: Overlapping clusters for distributed computation. WSDM 2012: 273-282
- [i12]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme: Polyhedral Clinching Auctions and the Adwords Polytope. CoRR abs/1201.0404 (2012)
- [i11]Vahab S. Mirrokni, Nithum Thain, Adrian Vetta: On the Implications of Lookahead Search in Game Playing. CoRR abs/1202.4134 (2012)
- [i10]Gagan Goel, Vahab S. Mirrokni, Renato Paes Leme: Clinching Auctions with Online Supply. CoRR abs/1210.1456 (2012)
- 2011
- [j28]Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko: Approximating Minimum-Power Degree and Connectivity Problems. Algorithmica 60(4): 735-742 (2011)
- [j27]Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam: Permutation Betting Markets: Singleton Betting with Extra Information. Algorithmica 60(4): 853-876 (2011)
- [j26]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko: Tight Approximation Algorithms for Maximum Separable Assignment Problems. Math. Oper. Res. 36(3): 416-431 (2011)
- [j25]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated Two-Sided Matching Markets. SIAM J. Comput. 40(1): 92-106 (2011)
- [j24]Uriel Feige, Vahab S. Mirrokni, Jan Vondrák: Maximizing Non-monotone Submodular Functions. SIAM J. Comput. 40(4): 1133-1153 (2011)
- [j23]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng: Competitive routing over time. Theor. Comput. Sci. 412(39): 5420-5432 (2011)
- [c62]Ullas Gargi, Wenjun Lu, Vahab S. Mirrokni, Sangho Yoon: Large-Scale Community Detection on YouTube for Topic Discovery and Exploration. ICWSM 2011
- [c61]Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala: Optimal auctions with positive network externalities. ACM Conference on Electronic Commerce 2011: 11-20
- [c60]Santiago Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan: Yield optimization of display advertising with ad exchange. ACM Conference on Electronic Commerce 2011: 27-28
- [c59]Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver: Inner product spaces for MinSum coordination mechanisms. STOC 2011: 539-548
- [c58]Bernhard Haeupler, Vahab S. Mirrokni, Morteza Zadimoghaddam: Online Stochastic Weighted Matching: Improved Approximation Algorithms. WINE 2011: 170-181
- [i9]Santiago Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan: Yield Optimization of Display Advertising with Ad Exchange. CoRR abs/1102.2551 (2011)
- 2010
- [j22]Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni: Secure Overlay Network Design. Algorithmica 57(1): 82-96 (2010)
- [j21]Magnús M. Halldórsson, Joseph Y. Halpern, Erran L. Li, Vahab S. Mirrokni: On spectrum sharing games. Distributed Computing 22(4): 235-248 (2010)
- [j20]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou: The myth of the Folk Theorem. Games and Economic Behavior 70(1): 34-43 (2010)
- [j19]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discrete Math. 23(4): 2053-2078 (2010)
- [c57]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein: Online Stochastic Packing Applied to Display Ad Allocation. ESA (1) 2010: 182-194
- [c56]Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav: Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. LATIN 2010: 565-576
- [c55]Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan, Mallesh M. Pai: Auctions with intermediaries: extended abstract. ACM Conference on Electronic Commerce 2010: 23-32
- [c54]Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Vahab S. Mirrokni, Hamid Mahini, Afshin Nikzad: Optimal Iterative Pricing over Social Networks (Extended Abstract). WINE 2010: 415-423
- [c53]Nima Anari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni: Equilibrium Pricing with Positive Externalities (Extended Abstract). WINE 2010: 424-431
- [c52]Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan: Mining advertiser-specific user behavior using adfactors. WWW 2010: 31-40
- [c51]Nicole Immorlica, Vahab S. Mirrokni: Optimal marketing and pricing over social networks. WWW 2010: 1349-1350
- [i8]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein: Online Stochastic Ad Allocation: Efficiency and Fairness. CoRR abs/1001.5076 (2010)
- [i7]Richard Cole, Vasilis Gkatzelis, Vahab S. Mirrokni: Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling. CoRR abs/1010.1886 (2010)
2000 – 2009
- 2009
- [j18]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated two-sided matching markets. SIGecom Exchanges 8(1) (2009)
- [j17]Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz: Coordination mechanisms for selfish scheduling. Theor. Comput. Sci. 410(17): 1589-1598 (2009)
- [c50]Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh: PASS Approximation. APPROX-RANDOM 2009: 111-124
- [c49]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan: Online Stochastic Matching: Beating 1-1/e. FOCS 2009: 117-126
- [c48]Eyal Even-Dar, Vahab S. Mirrokni: Tutorial summary: Convergence of natural dynamics to equilibria. ICML 2009: 173
- [c47]Vahab S. Mirrokni, Alexander Skopalik: On the complexity of nash dynamics and sink equilibria. ACM Conference on Electronic Commerce 2009: 1-10
- [c46]Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni: Approximating submodular functions everywhere. SODA 2009: 535-544
- [c45]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints. STOC 2009: 323-332
- [c44]Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng: Competitive Routing over Time. WINE 2009: 18-29
- [c43]Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál: Online Ad Assignment with Free Disposal. WINE 2009: 374-385
- [c42]Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan, Yishay Mansour, Uri Nadav: Bid optimization for broad match ad auctions. WWW 2009: 231-240
- [i6]Eyal Even-Dar, Yishay Mansour, Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav: Bid Optimization in Broad-Match Ad Auctions. CoRR abs/0901.3754 (2009)
- [i5]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints. CoRR abs/0902.0353 (2009)
- [i4]Vahab S. Mirrokni, Alexander Skopalik: On the complexity of Nash dynamics and Sink Equilibria. CoRR abs/0902.0382 (2009)
- [i3]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan: Online Stochastic Matching: Beating 1-1/e. CoRR abs/0905.4100 (2009)
- [i2]Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav: Quasi-Proportional Mechanisms: Prior-free Revenue Maximization. CoRR abs/0909.5365 (2009)
- 2008
- [j16]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng: Local Computation of PageRank Contributions. Internet Mathematics 5(1): 23-45 (2008)
- [j15]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: A Unified Approach to Congestion Games and Two-Sided Markets. Internet Mathematics 5(4): 439-457 (2008)
- [j14]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber: Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Theory Comput. Syst. 42(1): 2-26 (2008)
- [j13]Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni: Limitations of cross-monotonic cost-sharing schemes. ACM Transactions on Algorithms 4(2) (2008)
- [c41]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Kamal Jain, Vahab S. Mirrokni, Shang-Hua Teng: Robust PageRank and locally computable spam detection features. AIRWeb 2008: 69-76
- [c40]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour: Two-Stage Robust Network Design with Exponential Scenarios. ESA 2008: 589-600
- [c39]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng: On the Stability of Web Crawling and Web Search. ISAAC 2008: 680-691
- [c38]Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko: Approximating Minimum-Power Degree and Connectivity Problems. LATIN 2008: 423-435
- [c37]Vahab S. Mirrokni, Michael Schapira, Jan Vondrák: Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. ACM Conference on Electronic Commerce 2008: 70-77
- [c36]Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam: Permutation betting markets: singleton betting with extra information. ACM Conference on Electronic Commerce 2008: 180-189
- [c35]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: Uncoordinated two-sided matching markets. ACM Conference on Electronic Commerce 2008: 256-263
- [c34]Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik: Fast convergence to nearly optimal solutions in potential games. ACM Conference on Electronic Commerce 2008: 264-273
- [c33]Yossi Azar, Kamal Jain, Vahab S. Mirrokni: (Almost) optimal coordination mechanisms for unrelated machine scheduling. SODA 2008: 323-332
- [c32]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou: The myth of the folk theorem. STOC 2008: 365-372
- [c31]Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh: A combinatorial allocation mechanism with penalties for banner advertising. WWW 2008: 169-178
- [c30]Jason D. Hartline, Vahab S. Mirrokni, Mukund Sundararajan: Optimal marketing strategies over social networks. WWW 2008: 189-198
- [c29]Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz: Trust-based recommendation systems: an axiomatic approach. WWW 2008: 199-208
- [r1]
- 2007
- [j12]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov: Power optimization for connectivity problems. Math. Program. 110(1): 195-208 (2007)
- [j11]Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami: Subjective-cost policy routing. Theor. Comput. Sci. 378(2): 175-189 (2007)
- [j10]Paramvir Bahl, Mohammad Taghi Hajiaghayi, Kamal Jain, Vahab S. Mirrokni, Lili Qiu, Amin Saberi: Cell Breathing in Wireless LANs: Algorithms and Evaluation. IEEE Trans. Mob. Comput. 6(2): 164-178 (2007)
- [j9]Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. IEEE/ACM Trans. Netw. 15(6): 1345-1358 (2007)
- [c28]Uriel Feige, Vahab S. Mirrokni, Jan Vondrák: Maximizing Non-Monotone Submodular Functions. FOCS 2007: 461-471
- [c27]Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni: Robust Combinatorial Optimization with Exponential Scenarios. IPCO 2007: 439-453
- [c26]Zeinab Abbassi, Vahab S. Mirrokni: A Recommender System Based on Local Random Walks and Spectral Methods. WebKDD/SNA-KDD 2007: 139-153
- [c25]Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng: Local Computation of PageRank Contributions. WAW 2007: 150-165
- [c24]Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking: A Unified Approach to Congestion Games and Two-Sided Markets. WINE 2007: 30-41
- [i1]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou: The Myth of the Folk Theorem. Electronic Colloquium on Computational Complexity (ECCC) 14(082) (2007)
- 2006
- [j8]Saieed Akbari, Vahab S. Mirrokni, Bashir S. Sadjad: A relation between choosability and uniquely list colorability. J. Comb. Theory, Ser. B 96(4): 577-583 (2006)
- [j7]Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni, Marina Thottan: Market sharing games applied to content distribution in ad hoc networks. IEEE Journal on Selected Areas in Communications 24(5): 1020-1033 (2006)
- [j6]Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni: Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. Wireless Networks 12(2): 179-188 (2006)
- [c23]
- [c22]Mohammad Taghi Hajiaghayi, Erran L. Li, Vahab S. Mirrokni, Marina Thottan: Bandwidth Sharing Network Design for Multi-Class Traffic. INFOCOM 2006
- [c21]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko: Tight approximation algorithms for maximum general assignment problems. SODA 2006: 611-620
- [c20]George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos: Convergence and Approximation in Potential Games. STACS 2006: 349-360
- [c19]David Abraham, Ning Chen, Vijay Kumar, Vahab S. Mirrokni: Assignment Problems in Rental Markets. WINE 2006: 198-213
- 2005
- [c18]Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta: Sink Equilibria and Convergence. FOCS 2005: 142-154
- [c17]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov: Power Optimization for Connectivity Problems. IPCO 2005: 349-361
- [c16]Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni: Limitations of cross-monotonic cost sharing schemes. SODA 2005: 602-611
- [c15]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber: Traffic engineering of management flows by link augmentations on confluent trees. SPAA 2005: 289-298
- [c14]Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni: Cycle Cover with Short Cycles. STACS 2005: 641-653
- [c13]Nicole Immorlica, Erran L. Li, Vahab S. Mirrokni, Andreas S. Schulz: Coordination Mechanisms for Selfish Scheduling. WINE 2005: 55-69
- [c12]Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami: Subjective-Cost Policy Routing. WINE 2005: 174-183
- 2004
- [c11]Vahab S. Mirrokni, Adrian Vetta: Convergence Issues in Competitive Games. APPROX-RANDOM 2004: 183-194
- [c10]Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni: Locality-sensitive hashing scheme based on p-stable distributions. Symposium on Computational Geometry 2004: 253-262
- [c9]Marina Thottan, Erran L. Li, Bin Yao, Vahab S. Mirrokni, Sanjoy Paul: Distributed Network Monitoring for Evolving IP Networks. ICDCS 2004: 712-719
- [c8]Marina Thottan, Vahab S. Mirrokni, Hüseyin Uzunalioglu, Sanjoy Paul: A Simple Polynomial Time Framework For Reduced Path Decomposition in Multi-Path Routing. INFOCOM 2004
- [c7]Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni, Marina Thottan: Market sharing games applied to content distribution in ad-hoc networks. MobiHoc 2004: 55-66
- [c6]Magnús M. Halldórsson, Joseph Y. Halpern, Erran L. Li, Vahab S. Mirrokni: On spectrum sharing games. PODC 2004: 107-114
- [c5]Nicole Immorlica, David R. Karger, Maria Minkoff, Vahab S. Mirrokni: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. SODA 2004: 691-700
- 2003
- [j5]Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni: The facility location problem with general cost functions. Networks 42(1): 42-47 (2003)
- [c4]Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. MOBICOM 2003: 300-312
- 2002
- [j4]Manuela M. Veloso, Tucker R. Balch, Peter Stone, Hiroaki Kitano, Fuminori Yamasaki, Ken Endo, Minoru Asada, Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan: RoboCup-2001: The Fifth Robotic Soccer World Championships. AI Magazine 23(1): 55-68 (2002)
- [j3]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni: Length-constrained path-matchings in graphs. Networks 39(4): 210-215 (2002)
- 2001
- [j2]Saeed Akbari, Seyed Vahab Mirrokni, Sayyed Bashir Sadjad: Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges. J. Comb. Theory, Ser. B 82(2): 316-318 (2001)
- [c3]Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan: A Fast Vision System for Middle Size Robots in RoboCup. RoboCup 2001: 71-80
- [c2]Mansour Jamzad, Hamid Reza Chitsaz, Amirali Foroughnassiraei, Reza Ghorbani, Moslem Kazemi, Vahab S. Mirrokni, Sayyed Bashir Sadjad: Basic Requirements for a Teamwork in Middle Size RoboCup. RoboCup 2001: 621-626
- 2000
- [j1]Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani: On the simultaneous edge-coloring conjecture. Discrete Mathematics 216(1-3): 267-272 (2000)
- [c1]Mansour Jamzad, Amirali Foroughnassiraei, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni, Reza Ghorbani, Abbas Heydarnoori, Moslem Kazemi, Hamid Reza Chitsaz, Farid Mobasser, Mohsen Ebrahimi Moghaddam, M. Gudarzi, N. Ghaffarzadegan: A Goal Keeper for Middle Size RoboCup. RoboCup 2000: 583-586
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:44 CEST by the dblp team