Publications of D. Peleg

BACK TO COATI PUBLICATION INDEX

Publications of D. Peleg

Articles in journal or book's chapters
  1. O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh. On the approximability of some degree-constrained subgraph problems. Discrete Applied Mathematics, 160(12):1661 - 1679, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  2. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in Graphs. Journal of Algorithms, 53(1):85--112, 2004. [PDF ] [bibtex-entry]
     
  3. J-C. Bermond, J. Bond, D. Peleg, and S. Pérennes. The power of small coalitions in graphs. Discrete Applied Mathematics, Editor's Choice, 127(3):399-414, 2003. [PDF ] [bibtex-entry]
     
  4. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Directed Virtual Path Layout in ATM networks. Theoretical Computer Science, 291(1):3--28, 2003. [PDF ] [bibtex-entry]
     
  5. P. Fraigniaud, A. Pelc, D. Peleg, and S. Pérennes. Assigning labels in unknown network with a leader. Distributed Computing, 14(3):163--183, 2001. [bibtex-entry]
     
Conference's articles
  1. O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh. Degree-Constrained Subgraph Problems : Hardness and Approximation Results. In 6th International Workshop on Approximation and Online Algorithms (ALGO-WAOA 2008), volume 5426 of Lecture Notes in Computer Science, Karlsruhe, Germany, pages 29-42, September 2008. [PDF ] [Abstract] [bibtex-entry]
     
  2. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance Labeling in Graphs. In SODA'01, pages 210--219, 2001. [bibtex-entry]
     
  3. P. Fraigniaud, A. Pelc, D. Peleg, and S. Pérennes. Assigning labels in unknown anonymous networks. In Proceedings of PODC 2000, (Nineteenth Annual ACM SIGACT-SIGOPS Symposium on PRINCIPLES OF DISTRIBUTED COMPUTING), pages 101--112, 2000. [bibtex-entry]
     
  4. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Virtual path layouts with low congestion or low diameter in ATM networks. In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99), Roscoff, France, pages 77-82, May 1999. [bibtex-entry]
     
  5. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Virtual path layouts in simple ATM networks. In Proc. Conference IFIP ATM '98,Ilkley,U.K.,Jul. 1998, 1998. [bibtex-entry]
     
  6. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Directed virtual path layouts in ATM networks. In Proc. Conference DISC98, Andros, Greece,Sep. 1998 Lecture Notes in Computer Science, 1499, pages 75-i88. (Full version appeared in TCS), 1998. Springer Verlag. [bibtex-entry]
     
  7. J-C. Bermond, J. Bond, D. Peleg, and S. Pérennes. Tight bounds on the size of 2-monopolies. In Proc. Conference SIROCCO96, Siena, June 96, International Informatics Series 6, pages 170--179, 1997. Carleton U. Press. [bibtex-entry]
     
  8. J-C. Bermond and D. Peleg. The power of small coalitions in graphs. In Proc. Conference SIROCCO95 Olympie June 95, International Informatics Series 2, pages 173--184, 1995. Carleton U. Press. [PDF ] [bibtex-entry]
     
Internal reports
  1. O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh. Degree-Constrained Subgraph Problems: Hardness and Approximation Results. Research Report RR-6690, INRIA, October 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Fri Oct 20 15:06:10 2017