Search results

  • 2010

    The MST of symmetric disk graphs is light

    Abu-Affash, A. K., Aschner, R., Carmi, P. & Katz, M. J., 21 Jul 2010, Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings. p. 236-247 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6139 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • 2009

    A linear-space algorithm for distance preserving graph embedding

    Asano, T., Bose, P., Carmi, P., Maheshwari, A., Shu, C., Smid, M. & Wuhrer, S., 1 May 2009, In: Computational Geometry: Theory and Applications. 42, 4, p. 289-304 16 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    9 Scopus citations
  • Bounding the locality of distributed routing algorithms

    Bose, P., Carmi, P. & Durocher, S., 9 Nov 2009, PODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing. p. 250-259 10 p. 1582756. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    5 Scopus citations
  • Geometric spanners with small chromatic number

    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M. & Zeh, N., 1 Feb 2009, In: Computational Geometry: Theory and Applications. 42, 2, p. 134-146 13 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    5 Scopus citations
  • Matrix columns allocation problems

    Beimel, A., Ben-Moshe, B., Ben-Shimol, Y., Carmi, P., Chai, E., Kitroser, I. & Omri, E., 17 May 2009, In: Theoretical Computer Science. 410, 21-23, p. 2174-2183 10 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
  • Minimum-Cost Load-Balancing Partitions

    Aronov, B., Carmi, P. & Katz, M. J., 1 Jul 2009, In: Algorithmica. 54, 3, p. 318-336 19 p.

    Research output: Contribution to journalArticlepeer-review

    20 Scopus citations
  • On the power of the semi-separated pair decomposition

    Abam, M. A., Carmi, P., Farshi, M. & Smid, M., 14 Sep 2009, Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings. p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5664 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    11 Scopus citations
  • 2008

    Approximating the visible region of a point on a terrain

    Ben-Moshe, B., Carmi, P. & Katz, M. J., 1 Mar 2008, In: GeoInformatica. 12, 1, p. 21-36 16 p.

    Research output: Contribution to journalArticlepeer-review

    17 Scopus citations
  • Computing the greedy spanner in near-quadratic time

    Bose, P., Carmi, P., Farshi, M., Maheshwari, A. & Smid, M., 27 Oct 2008, Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings. p. 390-401 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5124 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    6 Scopus citations
  • Distinct distances in graph drawings

    Carmi, P., Dujmović, V., Morin, P. & Wood, D. R., 25 Aug 2008, In: Electronic Journal of Combinatorics. 15, 1, R107.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    13 Scopus citations
  • Geometric spanners with small chromatic number

    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M. & Zeh, N., 27 Aug 2008, Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers. p. 75-88 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4927 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Scopus citations
  • NAPX: A polynomial time approximation scheme for the Noah's ark problem

    Hickey, G., Carmi, P., Maheshwari, A. & Zeh, N., 28 Nov 2008, Algorithms in Bioinformatics - 8th International Workshop, WABI 2008, Proceedings. p. 76-86 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5251 LNBI).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations
  • On the stretch factor of convex delaunay graphs

    Bose, P., Carmi, P., Collette, S. & Smid, M., 1 Dec 2008, Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings. p. 656-667 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5369 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Scopus citations
  • Polynomial-time approximation schemes for piercing and covering with applications in wireless networks

    Carmi, P., Katz, M. J. & Lev-Tov, N., 1 Apr 2008, In: Computational Geometry: Theory and Applications. 39, 3, p. 209-218 10 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    8 Scopus citations
  • Private approximation of search problems

    Beimel, A., Carmi, P., Nissim, K. & Weinreb, E., 29 Dec 2008, In: SIAM Journal on Computing. 38, 5, p. 1728-1760 33 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    5 Scopus citations
  • Single vehicle scheduling problems on path/tree/cycle networks with release and handling times

    Bhattacharya, B., Carmi, P., Hu, Y. & Shi, Q., 1 Dec 2008, Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings. p. 800-811 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5369 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    13 Scopus citations
  • Spanners of additively weighted point sets

    Bose, P., Carmi, P. & Couture, M., 27 Oct 2008, Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings. p. 367-377 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5124 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    7 Scopus citations
  • Spanners of complete k-partite geometric graphs

    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Morin, P. & Smid, M., 1 Dec 2008, In: SIAM Journal on Computing. 38, 5, p. 1803-1820 18 p.

    Research output: Contribution to journalArticlepeer-review

  • Spanners of complete k-Partite geometric graphs

    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Morin, P. & Smid, M., 12 May 2008, LATIN 2008: Theoretical Informatics - 8th Latin American Symposium, Proceedings. p. 170-181 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4957 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • 2007

    Covering points by unit disks of fixed location

    Carmi, P., Katz, M. J. & Lev-Tov, N., 1 Jan 2007, Algorithms and Computation - 18th International Symposium, ISAAC 2007, Proceedings. Springer Verlag, p. 644-655 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4835 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    64 Scopus citations
  • Fault-tolerant power assignment and backbone in wireless networks

    Carmi, P., Katz, M. J., Segal, M. & Shpungin, H., 1 Jan 2007, In: Ad-Hoc and Sensor Wireless Networks. 4, 4, p. 355-366 12 p.

    Research output: Contribution to journalArticlepeer-review

    2 Scopus citations
  • Linear-space algorithms for distance preserving embedding

    Asano, T., Bose, P., Carmi, P., Maheshwari, A., Shu, C., Smid, M. & Wuhrer, S., 1 Dec 2007, p. 185-188. 4 p.

    Research output: Contribution to conferencePaperpeer-review

    2 Scopus citations
  • Location oblivious distributed unit disk graph coloring

    Couture, M., Barbeau, M., Bose, P., Carmi, P. & Kranakis, E., 1 Jan 2007, Structural Information and Communication Complexity - 14th International Colloquium, SIROCCO 2007, Proceedings. Springer Verlag, p. 222-233 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4474 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Scopus citations
  • On a family of strong geometric spanners that admit local routing strategies

    Bose, P., Carmi, P., Couture, M., Smid, M. & Xu, D., 1 Jan 2007, Algorithms and Data Structures - 10th International Workshop, WADS 2007, Proceedings. Springer Verlag, p. 300-311 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4619 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    6 Scopus citations
  • Power assignment in radio networks with two power levels

    Carmi, P. & Katz, M. J., 1 Feb 2007, In: Algorithmica. 47, 2, p. 183-201 19 p.

    Research output: Contribution to journalArticlepeer-review

    27 Scopus citations
  • Power Assignment in Radio Networks with Two Power Levels

    Carmi, P. & Katz, M. J., 1 Jan 2007, In: Dagstuhl Seminar Proceedings. 6481

    Research output: Contribution to journalConference articlepeer-review

  • 2006

    Fault-tolerant power assignment and backbone in wireless networks

    Carmi, P., Segal, M., Katz, M. J. & Shpungin, H., 1 Jan 2006, Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006. Institute of Electrical and Electronics Engineers, Vol. 2006. p. 5-84 80 p. 1598943

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    6 Scopus citations
  • Minimum-cost load-balancing partitions

    Aronov, B., Carmi, P. & Katz, M. J., 1 Jan 2006, Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06. Association for Computing Machinery (ACM), p. 301-308 8 p. (Proceedings of the Annual Symposium on Computational Geometry; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    8 Scopus citations
  • Private approximation of search problems

    Beimel, A., Carmi, P., Nissim, K. & Weinreb, E., 1 Jan 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 119-128 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    17 Scopus citations
  • The minimum-area spanning tree problem

    Carmi, P., Katz, M. J. & Mitchell, J. S. B., 1 Oct 2006, In: Computational Geometry: Theory and Applications. 35, 3, p. 218-225 8 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    9 Scopus citations
  • 2005

    Geographic quorum system approximations

    Carmi, P., Dolev, S., Har-Peled, S., Katz, M. J. & Segal, M., 1 Feb 2005, In: Algorithmica. 41, 4, p. 233-244 12 p.

    Research output: Contribution to journalArticlepeer-review

    10 Scopus citations
  • Minimum-cost load-balancing partitions

    Carmi, P. & Katz, M. J., 1 Jan 2005, p. 65-67. 3 p.

    Research output: Contribution to conferencePaperpeer-review

    2 Scopus citations
  • On the Fermat-Weber center of a convex object

    Carmi, P., Har-Peled, S. & Katz, M. J., 1 Nov 2005, In: Computational Geometry: Theory and Applications. 32, 3, p. 188-195 8 p.

    Research output: Contribution to journalArticlepeer-review

    Open Access
    20 Scopus citations
  • Private Approximation of Search Problems

    Beimel, A., Carmi, P., Nissim, K. & Weinreb, E., 29 Nov 2005, Electronic Colloquium on Computational Complexity, Report No. 141 26 p.

    Research output: Contribution to specialist publicationArticle

    Open Access
  • The minimum area spanning tree problem

    Carmi, P. & Katz, M. J., 2005, Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven, p. 191-194 4 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • The minimum-area spanning tree problem

    Carmi, P., Katz, M. J. & Mitchell, J. S. B., 1 Jan 2005, In: Lecture Notes in Computer Science. 3608, p. 195-204 10 p.

    Research output: Contribution to journalConference articlepeer-review

    3 Scopus citations
  • 2004

    Approximating the visible region of a point on a terrain

    Ben-Moshe, B., Carmi, P. & Katz, M. J., 22 Nov 2004, Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algoritms and Combinatorics. Arge, L., Italiano, G. F. & Sedgewick, R. (eds.). p. 120-128 9 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Scopus citations
  • Computing all large sums-of-pairs in ℝn and the discrete planar two-watchtower problem

    Ben-Moshe, B., Carmi, P. & Katz, M. J., 14 Feb 2004, In: Information Processing Letters. 89, 3, p. 137-139 3 p.

    Research output: Contribution to journalArticlepeer-review

    6 Scopus citations
  • Power Assignment in Radio Networks with Two Power Levels

    Carmi, P. & Katz, M. J., 1 Jan 2004, Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory. Hagerup, T. & Katajainen, J. (eds.). Springer Verlag, p. 431-441 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3111).

    Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

    Open Access
    1 Scopus citations
  • 2003

    Greedy edge-disjoint paths in complete graphs

    Carmi, P., Erlebach, T. & Okamoto, Y., 1 Jan 2003, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Bodlaender, H. L. (ed.). Springer Verlag, p. 143-155 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2880).

    Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

    8 Scopus citations