Outputs (126)

Predicting Performance in an Introductory Programming Course by Logging and Analyzing Student Programming Behavior (2013)
Conference Proceeding
Watson, C., Li, F. W., & Godwin, J. L. (2013). Predicting Performance in an Introductory Programming Course by Logging and Analyzing Student Programming Behavior. In Proceedings of the 2013 IEEE 13th International Conference on Advanced Learning Technologies (ICALT 2013) (319-323). https://doi.org/10.1109/icalt.2013.99

The high failure rates of many programming courses means there is a need to identify struggling students as early as possible. Prior research has focused upon using a set of tests to assess the use of a student's demographic, psychological and cognit... Read More about Predicting Performance in an Introductory Programming Course by Logging and Analyzing Student Programming Behavior.

Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes (2013)
Conference Proceeding
Zeh, A., Wachter-Zeh, A., Gadouleau, M., & Bezzateev, S. (2013). Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes. In International Symposium on Information Theory Proceedings (ISIT 2013), 7-12 July 2013, Istanbul, Turkey ; proceedings (126-130). https://doi.org/10.1109/isit.2013.6620201

Two generalizations of the Hartmann-Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to th... Read More about Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes.

Advancing Research Infrastructure Using OpenStack (2013)
Journal Article
Kureshi, I., Pulley, C., Brennan, J., Holmes, V., Bonner, S., & James, J. (2013). Advancing Research Infrastructure Using OpenStack. International Journal of Advanced Computer Science and Applications, 3(4), 63-69. https://doi.org/10.14569/specialissue.2013.030408

Cloud computing, which evolved from grid computing, virtualisation and automation, has a potential to deliver a variety of services to the end user via the Internet. Using the Web to deliver Infrastructure, Software and Platform as a Service (SaaS/Pa... Read More about Advancing Research Infrastructure Using OpenStack.

Graph editing to a fixed target (2013)
Conference Proceeding
Golovach, P., Paulusma, D., & Stewart, I. A. (2013). Graph editing to a fixed target. In T. Lecroq, & L. Mouchard (Eds.), Combinatorial algorithms : 24th International Workshop, IWOCA 2013, 10-12 July 2013, Rouen, France ; revised selected papers (192-205). https://doi.org/10.1007/978-3-642-45278-9_17

For a fixed graph H, the H-Minor Edit problem takes as input a graph G and an integer k and asks whether G can be modified into H by a total of at most k edge contractions, edge deletions and vertex deletions. Replacing edge contractions by vertex di... Read More about Graph editing to a fixed target.

Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree (2013)
Conference Proceeding
Chaplick, S., Fiala, J., Hof, V. '. P., Paulusma, D., & Tesar, M. (2013). Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. In L. Gąsieniec, & F. Wolter (Eds.), Fundamentals of computation theory : 19th International Symposium, FCT 2013, 19-21 August 2013, Liverpool, UK ; proceedings (121-132). https://doi.org/10.1007/978-3-642-40164-0_14

A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its restriction to the neighborhood of every vertex of G is bijective, surjective, or injective, respectively. We prove that the problems of testing whether... Read More about Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree.

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints (2013)
Conference Proceeding
Belmonte, R., Golovach, P., Hof, V. '. P., & Paulusma, D. (2013). Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. In 8th International Symposium, IPEC 2013, 4-6 September 2013, Sophia Antipolis, France ; revised selected papers (16-27). https://doi.org/10.1007/978-3-319-03898-8_3

Motivated by recent results of Mathieson and Szeider (J. Comput. Syst. Sci. 78(1): 179–191, 2012), we study two graph modification problems where the goal is to obtain a graph whose vertices satisfy certain degree constraints. The Regular Contraction... Read More about Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.

Colouring of Graphs with Ramsey-Type Forbidden Subgraphs (2013)
Conference Proceeding
Dabrowski, K. K., Golovach, P. A., & Paulusma, D. (2013). Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. In A. Brandstädt, K. Jansen, & R. Reischuk (Eds.), Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, 19-21 June 2013, Lübeck, Germany ; revised papers (201-212). https://doi.org/10.1007/978-3-642-45043-3_18

A colouring of a graph G = (V;E) is a mapping c : V ! f1; 2; : : :g such that c(u) 6= c(v) if uv 2 E; if jc(V )j k then c is a k-colouring. The Colouring problem is that of testing whether a given graph has a k-colouring for some given integer k. If... Read More about Colouring of Graphs with Ramsey-Type Forbidden Subgraphs.

Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs (2013)
Conference Proceeding
Johnson, M., Paulusma, D., & van Leeuwen, E. (2013). Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. In L. Cai, S. Cheng, & T. Lam (Eds.), Algorithms and computation : 24th International Symposium, ISAAC 2013, Hong Kong, China, 16-18 December 2013 ; proceedings (130-140). https://doi.org/10.1007/978-3-642-45030-3_13

Social networks are often analyzed through a graph model of the network. The dot product model assumes that two individuals are connected in the social network if their attributes or opinions are similar. In the model, a d-dimensional vector a v repr... Read More about Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs.

List Coloring in the Absence of Two Subgraphs (2013)
Conference Proceeding
Golovach, P. A., & Paulusma, D. (2013). List Coloring in the Absence of Two Subgraphs. In P. G. Spirakis, & M. Serna (Eds.), Algorithms and complexity : 8th International Conference, CIAC 2013, 22-24 May 2013, Barcelona, Spain ; proceedings (288-299). https://doi.org/10.1007/978-3-642-38233-8_24

list assignment of a graph G = (V;E) is a function L that assigns a list L(u) of so-called admissible colors to each u 2 V . The List Coloring problem is that of testing whether a given graph G = (V;E) has a coloring c that respects a given list assi... Read More about List Coloring in the Absence of Two Subgraphs.

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (2013)
Conference Proceeding
Broersma, H. J., Fiala, J., Golovach, P. A., Kaiser, T., Paulusma, D., & Proskurowski, A. (2013). Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. In A. Brandstädt, K. Jansen, & R. Reischuk (Eds.), Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, 19-21 June 2013, Lübeck, Germany ; revised papers (127-138). https://doi.org/10.1007/978-3-642-45043-3_12

We show that for all k ≤ − 1 an interval graph is − (k + 1)-Hamilton-connected if and only if its scattering number is at most k. We also give an O(n + m) time algorithm for computing the scattering number of an interval graph with n vertices and m e... Read More about Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.