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

 
Journal papers

  • Dobrev, S, Královič, R., Pardubská, D., Török, Ľ, Vrťo, I., Antibandwidth and cyclic antibandwidth of Hamming graphs,
    Discrete applied mathematics 161, Elsevier, iss. 10-11 (2013) pp. 1402-1408, ISSN: 0166-218X, ADCA.
  •     cited by:
        1) Bekos, M. A., Kaufmann, M., Kobourov, S., Veeramoni, S., A note on maximum differential coloring of planar graphs,
           Journal of Discrete Algorithms, 29, (2014) pp. 1-7, Elsevier.
           Category: 1.2.
           link.

        2) Dumitrescu, S., Wan, Y.H., Bit-Error Resilient Index Assignment for Multiple Seacription Scalar Quantizers,
           IEEE Transactions On Information Theory, 61 iss. 5, (2015) pp. 2748-2763, IEEE.
           Category: 1.1.
           link.

  • 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

        2)Hu, Y.F., Kobourov, S., Veeramoni, S., On Maximum Differential Graph Coloring
          Graph Drawing 6502 (2011) 274-286, Springer.
          Category: 1.1
          link

        3) Billera, L. J., Blanco, S. A., Bandwidth of the product of paths of the same length,
           Discrete Applied Mathematics, 161, (2013), 3080-3086, Springer.
           Category: 1.1.
           link.

        4) Scott, J., Hu, Y., Level based heuristics and hill climbing for the antibandwidth maximization problem,
           Numerical linear algebra with applications, 21 , iss. 1, (2014), 51-67, Wiley.
           Category: 1.1.
           link.

        5) Bekos, M. A., Kaufmann, M., Kobourov, S., Veeramoni, S., A note on maximum differential coloring of planar graphs,
           Journal of Discrete Algorithms, 29, (2014), 1-7, Elsevier.
           Category: 1.2.
           link.

        6) Dumitrescu, S., Yinghan Wan, Bit-Error Resilient Index Assignment for Multiple Description Scalar Quantizers,
           Information Theory, IEEE Transactions on, 61 iss. 5, (2015), 2748-2763, IEEE.
           Category: 1.2.
           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) Lee, D.-H., Cheong, M., Kim, S.-M., Some results on the antibandwidth of k-ary complete trees of height 3 for odd k,
           Far East Journal of Mathematical Sciences, 70, iss. 1, (2012), 121 - 134, Elsevier.
           Category: 1.2.
           link.

        3) Rahman, Md.S., Eshan, T. A., Al Abdullah, S., Rahman, Md. S., Antibandwidth problem for itchy caterpillars (Conference paper),
           2014 International Conference on Informatics, Electronics and Vision, ICIEV 2014, Article Number 6850837.        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) 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

        2) 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

        3) 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.

        4) 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.
          Category: 1.1
          link.

        5) 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.

        6) 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.

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


        8) Pantrigo, J.J., Marti, R., Duarte, A., Pardo, E.G., Scatter search for the cutwidth minimization problem,
           Annals of operations reasearch, 199, No. 1, (2012), 285-304, Springer.
           Category: 1.1.
           link.

        9) Betancour, L.C., Rodriguez-Tello, E., An improved mememtic algorithm for the antibandwidth problem,
           Lecture Notes in Computer Science, 7401, (2012), pp. 121-132, Springer.
           Category: 1.2.
           link.


        10) Lee, D.-H., Cheong, M., Kim, S.-M., Some results on the antibandwidth of k-ary complete trees of height 3 for odd k,
           Far East Journal of Mathematical Sciences, 70, iss. 1, (2012), 121 - 134, Elsevier.        Category: 1.2.
           link.

        11) Lozano, M., Duarte, A., Gortazar, F., Marti, R., Variable neighbourhood search with ejection chains for the antibandwidth problem,
           Journal of Heuristics, 18 iss. 6, (2012), pp. 919-938, Springer.
           Category: 1.1.
           link.


        12) Duarte,A., Escudero,L.F., Martí,R., Mladenovic, N., Pantrigo, J.J., Sánchez-Oro, J., Variable neighborhood search for the Vertex Separation Problem,
           Computers and Operations Research, 39 iss. 12, (2012), 3247-3255, Elsevier.
           Category: 1.1.
           link.


        13) Marti,R., Pantrigo, J.J., Duarte, J., Pardo, E.G., Branch and bound for the cutwidth minimization problem,
           Computers and Operations Research, 40 iss. 1, (2013), 137-149, Elsevier.
           Category: 1.1.
           link.


        14) Pardo, E.G., Mladenovic, N., Pantrigo, J.J., Duarte, A., Variable formulation search for the cutwidth minimization problem,
           Applied soft computing, 13 iss. 5, (2013), pp. 2242-2252, Springer.
           Category: 1.1.
           link.


        15) Pop, P.C., Matei, O., Increasing the antibandwidth of sparse matrices by a genetic algorithm,
           Lecture Notes in Computer Science, 7906, (2013), 242 - 251, Springer.
           Category: 1.2.
           link.


        16) Lozano, M., Duarte, A., Gortazar, F., Marti, R., A hybrid metaheuristic for the cyclic amtibandwidth problem,
           Knowledge-Based Systems, 54, (2013), 103-113, Elsevier.
           Category: 1.1.
           link.


        17) Gansner, E., Hu, Y., Kobourov, S. G., Viewing data as maps (chapter),
           Handbook of Human Centric visualization, (2013) pp. 63-92, Springer
           Category: ??.
           link.

        18) Rahman, Md.S., Eshan, T. A., Al Abdullah, S., Rahman, Md. S., Antibandwidth problem for itchy caterpillars (Conference paper),
           2014 International Conference on Informatics, Electronics and Vision, ICIEV 2014, Article Number 6850837.
           Category: 1.2.
           link.


        19) Bekos, M. A., Kaufmann, M., Kobourov, S., Veeramoni, S., A note on maximum differential coloring of planar graphs,
           Journal of Discrete Algorithms, 29, (2014), pp 1-7, Elsevier.
           Category: 1.2.
           link.


        20) Scott, J., Hu, Y., Level based heuristics and hill climbing for the antibandwidth maximization problem,
           Numerical linear algebra with applications, 21 , iss. 1, (2014), 51-67, Wiley.
           Category: 1.1.
           link.

        21) Bekos, M. A., Kaufmann, M., Kobourov, S., Veeramoni, S., The maximum k-differential coloring problem,
           Lecture Notes in Computer Science, 8939, (2015) pp.115-127, Springer.
           Category: 1.2.
           link.

        22) Dumitrescu, S., Yinghan Wan, Bit-Error Resilient Index Assignment for Multiple Description Scalar Quantizers,
           Information Theory, IEEE Transactions on, 61 iss. 5, (2015), 2748-2763, IEEE.
           Category: 1.2.
           link.

        23) Rodriguez-Tello, E., Romero-Monsivais,H., Ramirez-Torres, G., Lardeux, F., Tabu search for the cyclic bandwdith problem,
           Computers and Operations Research, 57, (2015) pp. 17-32, Elsevier.
           Category: 1.2.
           link.

        24) Habiba, U., Rahman, M.S., Lamia, S.H., Chowdhury, T., Safe labeling of graphs with minimum span,
           2nd International Conference on Electrical Engineering and Information and Communication Technology, iCEEiCT 2015, Article number 7307460
           Category: 1.2.
           link.

        25) Bach, B., Behrisch, M., Fekete, J. D., Riche, H. N., Matrix reordering methods for table and network visualization,
           Computer Graphics Forum, 35(3), (2016) pp. 1-24, DOI: 10.1111/cgf. 12935.
           Category: 1.2.
           link.

        26) Lee, D.-H., Kim, S.-M., Cheong, M.-S., Antibandwith of complete trees,
           Computer Graphics Forum, 35(3), (2016) pp. 1-24, DOI: 10.1111/cgf. 12935.
           Category: ??.
           link.

        27) Sánchez-Oro, J., José Pantrigo, J., Duarte, A., Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem,
           Computers and Operations Research , 52, (2014) pp. 209-2019.
           Category: 1.2.
           link.



    Proceedings papers

  • Török, Ľ, Vrťo, I.,
    Antibandwidth of d-dimensional meshes,
    in Proc.Combinatorial Algorithms 20th International Workshop, IWOCA 2009,
    Lecture Notes in Computer Science
    5874, Springer,
    Berlin, (2009), 471-477, ISBN 978-3-642-10216-5. ISSN 0302-9743, ADEB.

        cited by:
        1) Billera, L. J., Blanco, S. A., Bandwidth of the product of paths of the same length,
           Discrete Applied Mathematics, 161, (2013), 3080-3086, Springer.
           Category: 1.1.
           link.

        2) Dumitrescu, S., Yinghan Wan, Bit-Error Resilient Index Assignment for Multiple Description Scalar Quantizers,
           Information Theory, IEEE Transactions on, 61 iss. 5, (2015), 2748-2763, IEEE.
           Category: 1.2.
           link.

        3) Mafteiu-Scai, L. O., The bandwidths of a matrix. A survey of algorithms,
           Analele Universitatii de Vest, Timisoara, Seria Matematica - Informatica, LII,2, (2014), 183-223
           Category: ??.
           link.


  • 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.1.
           link.

        3) Lozano, M., Duarte, A., Gortazar, F., Marti, R., Variable neighbourhood search with ejection chains for the antibandwidth problem,
           Journal of Heuristics, 18 iss. 6, (2012), pp. 919-938, Springer.
           Category: 1.1.
           link.

        4) Pop, P.C., Matei, O., Increasing the antibandwidth of sparse matrices by a genetic algorithm,
           Lecture Notes in Computer Science, 7906, (2013), 242 - 251, Springer.        Category: 1.2.
           link.

        5) Lozano, M., Duarte, A., Gortazar, F., Marti, R., A hybrid metaheuristic for the cyclic amtibandwidth problem,
           Knowledge-Based Systems, 54, (2013), 103-113, Elsevier.        Category: 1.2.
           link.

        6) Bekos, M. A., Kaufmann, M., Kobourov, S., Veeramoni, S., The maximum k-differential coloring problem,
           Lecture Notes in Computer Science, 8939, (2015) pp.115-127, Springer.
           Category: 1.2.
           link.

        7) Rodriguez-Tello, E., Romero-Monsivais,H., Ramirez-Torres, G., Lardeux, F., Tabu search for the cyclic antibandwdith problem,
           Computers and Operations Research, 57, (2015) pp. 17-32, Elsevier.
           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) 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.

        2) 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.

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

        4) Lozano, M., Duarte, A., Gortazar, F., Marti, R., Variable neighbourhood search with ejection chains for the antibandwidth problem,
           Journal of Heuristics, 18 iss. 6, (2012), pp. 919-938, Springer.
           Category: 1.1.
           link.

        5) Betancour, L.C., Rodriguez-Tello, E., An improved mememtic algorithm for the antibandwidth problem,
           Lecture Notes in Computer Science, 7401, (2012), pp. 121-132, Springer.
           Category: 1.2.
           link.

        6) Rodriguez-Tello, E., Romero-Monsivais,H., Ramirez-Torres, G., Lardeux, F., Tabu search for the cyclic antibandwdith problem,
           Computers and Operations Research, 57, (2015) pp. 17-32, Elsevier.
           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

        3) 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.

        4) Betancour, L.C., Rodriguez-Tello, E., An improved mememtic algorithm for the antibandwidth problem,
           Lecture Notes in Computer Science, 7401, (2012), pp. 121-132, Springer.
           Category: 1.2.
           link.

        5) Bekos, M. A., Kaufmann, M., Kobourov, S., Veeramoni, S., A note on maximum differential coloring of planar graphs,
           Journal of Discrete Algorithms, 29, (2014), pp 1-7, Elsevier.
           Category: 1.2.
           link.

        6) Bekos, M. A., Kaufmann, M., Kobourov, S., Veeramoni, S., The maximum k-differential coloring problem,
           Lecture Notes in Computer Science, 8939, (2015) pp.115-127, Springer.
           Category: 1.2.
           link.

        7) Rodriguez-Tello, E., Romero-Monsivais,H., Ramirez-Torres, G., Lardeux, F., Tabu search for the cyclic antibandwdith problem,
           Computers and Operations Research, 57, (2015) pp. 17-32, Elsevier.
           Category: 1.2.
           link.

        8) Hamon, R., Borgnat, P., Flandrin, P., Robardet, C., Heuristic for solving cyclic bandwidth sum problem by following the structure of the graph,
           http://arXiv.org, (2014)
           Category: ??.
           link.


  • Sýkora, O., Török, Ľ., Vrťo, I., The cyclic antibandwidth problem,
    in Proc. Electronic Notes in Discrete Mathematics 22, Elsevier, 2005, 223-227, ADEB.
  •     cited by:
        1) Bansal, R., Srivastava, K.,
           A memetic algorithm for the cyclic antibandwidth maximization problem,
           XXXII Nation systems conference (NSC 2008) (2008), 809-814.
           Category: 3
           link.

        2) Bansal, R., Srivastava, K.,       A memetic algorithm for the cyclic antibandwidth maximization problem,
          Soft Computing, 15, 2011, 397-412,
           Category: 1.2
           link

        3) Lozano, M., Duarte, A., Gortazar, F., Marti, R., A hybrid metaheuristic for the cyclic amtibandwidth problem,
           Knowledge-Based Systems, 54, (2013), 103-113, Elsevier.        Category: 1.2.
           link.

        4) Rodriguez-Tello, E., Romero-Monsivais,H., Ramirez-Torres, G., Lardeux, F., Tabu search for the cyclic antibandwdith problem,
           Computers and Operations Research, 57, (2015) pp. 17-32, Elsevier.
           Category: 1.2.
           link.

     
    BACK