You are here

Publications

Export 674 results:
Filters: First Letter Of Last Name is J  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
J
I. \'{a}n Juhos and van Hemert, J., Graph Colouring Heuristics Guided by Higher Order Graph Properties, in Lecture Notes in Computer Science, 2008, vol. 4972, p. 97--109.
I. Juhos and van Hemert, J. I., Increasing the efficiency of graph colouring algorithms with a representation based on vector operations, Journal of Software, vol. 1, p. 24--33, 2006.
I. Juhos, Tóth, A., Tezuka, M., Tann, P., and van Hemert, J. I., A new permutation model for solving the graph k-coloring problem, in Kalmàr Workshop on Logic and Computer Science, 2003, p. 189--199.
I. Juhos, Tóth, A., and van Hemert, J. I., Binary Merge Model Representation of the Graph Colouring Problem, in Springer Lecture Notes on Computer Science, 2004, p. 124--134.
I. Juhos, Tóth, A., and van Hemert, J. I., Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring, in Springer Lecture Notes on Computer Science, 2005, p. 132--143.
I. Juhos and van Hemert, J. I., Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem, in Studies in Computational Intelligence, C. Cotta and van Hemert, J. I., Eds. Springer, 2008, p. 167--184.
I. Juhos and van Hemert, J. I., Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation, in Springer Lecture Notes on Computer Science, 2006, p. 123--134.
J. M. P. F. G. R. F. José Daniel García, Jesús Carretero, Specifying use case behavior with interaction models, Journal of Object Technology, vol. 4, no. 9, p. 16, 2005.