BACK
Citations of Ľubomír Török

 
Journal papers

  • Török, Ľ., Vrťo, I., Antibandwidth of three-dimensional meshes,
    Discrete Mathematics 310 (2010) pp. 505-510, ISSN 0012-365X, ADCA.
    •     cited by:
        1) Otachi Y., Ryohei S., Bandwidth and pathwidth of three-dimensional grids
          Discrete Mathematics 311 (2011) 881-887, ISSN 0012-365X, Elsevier.
          Category: 1.1
          link

  • Calamoneri, T., Massini, A., Török, Ľ., Vrťo, I., Antibandwidth of complete k-ary trees,
    Discrete Mathematics 309 no. 22 (2009) pp. 6408-6414, ISSN 0012-365X (0.502 - IF2008), ADCA.
    •     cited by:
        1) Bansal R., Srivastava K., Memetic algorithm for the antibandwidth maximization problem,
           Journal of Heuristics, 17, No. 1, (2011), 39-60, Springer.
           Category: 1.1.
           link.

        2)Yifan Hu, Kobourov S., Veeramoni S., On maximum differential graph coloring,
           Lecture Notes In Computer Science, 6502, (2011), 274-286, Springer.
           Category: 1.2.
           link.

  • Raspaud, A., Shröder, H., Sýkora, O., Torok, L., Vrťo, I., Antibandwidth and cyclic antibandwidth of meshes and hypercubes,
    Discrete Mathematics 309 (2009) pp. 3541-3552, ISSN 0012-365X (0.502 - IF2008), ADCA.
    •     cited by:
        1) Bansal R., Srivastava K., A memetic algorithm for the cyclic antibandwidth maximization problem,
           Soft Computing - A Fusion of Foundations, Methodologies and Applications,
           15 No. 2, 397-412, DOI: 10.1007/s00500-009-0538-6, (2011) Springer.
           Category: 1.1
           link.
        2) Xiaohan Wang, Xiaolin Wu, Dumitrescu, S., On explicit forumlas for bandwidth and antibandwidth of hypercubes,
           Discrete Applied Mathematics, 157 iss 8, (2009), 1947-1952, Elsevier.
           Category: 1.1
           link
        3) Tiao Jiang, Miller, Z., Pritikin, D., Separation numbers of trees, Theoretical computer science, 410, iss 38-40, (2009), 3769-3781, Elsevier.
           Category: 1.1.
           link
        4) Bansal R., Srivastava K., Memetic algorithm for the antibandwidth maximization problem,
           Journal of Heuristics, 17, No. 1, (2011), 39-60, Springer.
           Category: 1.1.
           link.
        5) A. Duarte, R. Martí, M.G.C. Resende and R.M.A. Silva, GRASP with path relinking heuristics for the antibandwidth problem,
          Networks, 58, (2011), 171-189, (2009).
          Category: 1.1
          link.
        6) Xiaohan Wang, Xiaolin Wu, Index assignment optimization for Joint Source-Channel MAP Decoding,
          IEEE Transactions on Communications, 58, No. 3, (2010), 901-910, ISSN:0090-6778, IEEE Press.
          Category: 1.2.
          link.
        7)Yifan Hu, Kobourov S., Veeramoni S., On maximum differential graph coloring,
           Lecture Notes In Computer Science, 6502, (2011), 274-286, Springer.
           Category: 1.2.
           link.



    Proceedings papers

  • Dobrev, S., Královič R., Pardubská, D., Török, Ľ., Vrťo, I.,
    Antibandwidth and cyclic antibandwidth of Hamming graphs
    in Proc. Electronic Notes in Discrete Mathematics 34, Elsevier, 2009, 295-300, ISSN 1571-0653, ADEB.         cited by:
        1) Bansal R., Srivastava K., Memetic algorithm for the antibandwidth maximization problem,
           Journal of Heuristics, 17, No. 1 ,(2011), 39-60, Springer.
           Category: 1.1.
           link.
        2)Yifan Hu, Kobourov S., Veeramoni S., On maximum differential graph coloring,
           Lecture Notes In Computer Science, 6502, (2011), 274-286, Springer.
           Category: 1.2.
           link.


  • Török, Ľ., Vrťo, I., Antibandwidth of three-dimensional meshes
    in Proc. Electronic Notes in Discrete Mathematics 28, Elsevier, 2007, 161-167, ADEB.
    •     cited by:
        1) Bansal R., Srivastava K., Memetic algorithm for the antibandwidth maximization problem,
           Journal of Heuristics, 17, No.1, (2011), 39-60, Springer.
           Category: 1.1.
           link.
        2) A. Duarte, R. Martí, M.G.C. Resende and R.M.A. Silva, GRASP with path relinking heuristics for the antibandwidth problem,
          Networks, 58, (2011), 171-189, (2009).
          Category: 1.1
          link.
        3)Yifan Hu, Kobourov S., Veeramoni S., On maximum differential graph coloring,
           Lecture Notes In Computer Science, 6502, (2011), 274-286, Springer.
           Category: 1.2.
           link.


  • Calamoneri, T., Massini, A., Török, Ľ., Vrťo, I., Antibandwidth of complete k-ary trees
    in Proc. Electronic Notes in Discrete Mathematics 24, Elsevier, 2006, 259-266, ADEB.
    •     cited by:
        1) Kazumasa Aoki, Kyohei Kozawa, Yota Otachi, Kazuyuki Ukegawa, Koichi Yamayaki,
          On the path distance width of complete k-ary trees,
           Kyoto University Research Information Repository (KURENAI) 1599 (2008), 141-147.
           Category: 3
           link.
        2) Tiao Jiang, Zevi Miller, Dan Pritikin, Separation of trees, Theoretical computer science, 410 iss 38-40, (2009), 3769-3781, Elsevier.
           Category: 1.1
           link
    		  
    BACK