Skip to main content

Research Repository

Advanced Search

All Outputs (124)

Recent development in multimedia e-learning technologies (2014)
Journal Article
Lau, R. W., Yen, N. Y., Li, F. W., & Wah, B. (2014). Recent development in multimedia e-learning technologies. World Wide Web, 17(2), 189-198. https://doi.org/10.1007/s11280-013-0206-8

Multimedia and networking technologies have significantly impacted on our daily activities, particularly in terms of how we learn. Nowadays, classroom teaching no longer simply relies on chalk and blackboard as the prime medium for course disseminati... Read More about Recent development in multimedia e-learning technologies.

List coloring in the absence of two subgraphs (2014)
Journal Article
Golovach, P., & Paulusma, D. (2014). List coloring in the absence of two subgraphs. Discrete Applied Mathematics, 166, 123-130. https://doi.org/10.1016/j.dam.2013.10.010

A 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∈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 assignmen... Read More about List coloring in the absence of two subgraphs.

Computing and counting longest paths on circular-arc graphs in polynomial time (2014)
Journal Article
Mertzios, G., & Bezáková, I. (2014). Computing and counting longest paths on circular-arc graphs in polynomial time. Discrete Applied Mathematics, 164(Part 2), 383-399. https://doi.org/10.1016/j.dam.2012.08.024

The longest path problem asks for a path with the largest number of vertices in a given graph. In contrast to the Hamiltonian path problem, until recently polynomial algorithms for the longest path problem were known only for small graph classes, suc... Read More about Computing and counting longest paths on circular-arc graphs in polynomial time.

D2MOPSO: MOPSO Based on Decomposition and Dominance with Archiving Using Crowding Distance in Objective and Solution Spaces (2014)
Journal Article
Al Moubayed, N., Petrovski, A., & McCall, J. (2014). D2MOPSO: MOPSO Based on Decomposition and Dominance with Archiving Using Crowding Distance in Objective and Solution Spaces. Evolutionary Computation, 22(1), 47-77. https://doi.org/10.1162/evco_a_00104

This paper improves a recently developed multi-objective particle swarm optimizer () that incorporates dominance with decomposition used in the context of multi-objective optimization. Decomposition simplifies a multi-objective problem (MOP) by trans... Read More about D2MOPSO: MOPSO Based on Decomposition and Dominance with Archiving Using Crowding Distance in Objective and Solution Spaces.

Balls into non-uniform bins (2014)
Journal Article
Berenbrink, P., Brinkmann, A., Friedetzky, T., & Nagel, L. (2014). Balls into non-uniform bins. Journal of Parallel and Distributed Computing, 74(2), 2065-2076. https://doi.org/10.1016/j.jpdc.2013.10.008

Balls-into-bins games for uniform bins are widely used to model randomised load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. The... Read More about Balls into non-uniform bins.

Colouring of graphs with Ramsey-type forbidden subgraphs (2014)
Journal Article
Dabrowski, K., Golovach, P., & Paulusma, D. (2014). Colouring of graphs with Ramsey-type forbidden subgraphs. Theoretical Computer Science, 522, 34-43. https://doi.org/10.1016/j.tcs.2013.12.004

A colouring of a graph G=(V,E) is a mapping c:V→{1,2,…} such that c(u)≠c(v) if uv∈E; if |c(V)|⩽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 a graph contain... Read More about Colouring of graphs with Ramsey-type forbidden subgraphs.

Obtaining Online Ecological Colourings by Generalizing First-Fit (2014)
Journal Article
Johnson, M., Patel, V., Paulusma, D., & Trunck, T. (2014). Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory of Computing Systems, 54(2), 244-260. https://doi.org/10.1007/s00224-013-9513-9

A colouring of a graph is ecological if every pair of vertices that have the same set of colours in their neighbourhood are coloured alike. We consider the following problem: if a graph G and an ecological colouring c of G are given, can further vert... Read More about Obtaining Online Ecological Colourings by Generalizing First-Fit.

Hardware-aware block size tailoring on adaptive spacetree grids for shallow water waves (2014)
Conference Proceeding
Weinzierl, T., Wittmann, R., Unterweger, K., Bader, M., Breuer, A., & Rettenberger, S. (2014). Hardware-aware block size tailoring on adaptive spacetree grids for shallow water waves. In A. Größlinger, & H. Köstler (Eds.), HiStencils 2014 - Proceedings of the 1st international workshop on high-performance stencil computations (57-64)

Spacetrees are a popular formalism to describe dynamically adaptive Cartesian grids. Though they directly yield an adaptive spatial discretisation, i.e. a mesh, it is often more efficient to augment them by regular Cartesian blocks embedded into the... Read More about Hardware-aware block size tailoring on adaptive spacetree grids for shallow water waves.

Parameterized Domination in Circle Graphs (2014)
Journal Article
Bousquet, N., Gonçalves, D., Mertzios, G., Paul, C., Sau, I., & Thomassé, S. (2014). Parameterized Domination in Circle Graphs. Theory of Computing Systems, 54(1), 45-72. https://doi.org/10.1007/s00224-013-9478-8

A circle graph is the intersection graph of a set of chords in a circle. Keil [Discrete Appl. Math., 42(1):51–63, 1993] proved that Dominating Set, Connected Dominating Set, and Total Dominating Set are NP-complete in circle graphs. To the best of ou... Read More about Parameterized Domination in Circle Graphs.

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (2014)
Journal Article
Bonamy, M., Johnson, M., Lignos, I., Patel, V., & Paulusma, D. (2014). Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Journal of Combinatorial Optimization, 27(1), 132-143. https://doi.org/10.1007/s10878-012-9490-y

A k-colouring of a graph G=(V,E) is a mapping c:V→{1,2,…,k} such that c(u)≠c(v) whenever uv is an edge. The reconfiguration graph of the k-colourings of G contains as its vertex set the k-colourings of G, and two colourings are joined by an edge if t... Read More about Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.

Colias: An Autonomous Micro Robot for Swarm Robotic Applications (2014)
Journal Article
Arvin, F., Murray, J., Zhang, C., & Yue, S. (2014). Colias: An Autonomous Micro Robot for Swarm Robotic Applications. International Journal of Advanced Robotic Systems, 11(7), https://doi.org/10.5772/58730

Robotic swarms that take inspiration from nature are becoming a fascinating topic for multi-robot researchers. The aim is to control a large number of simple robots in order to solve common complex tasks. Due to the hardware complexities and cost of... Read More about Colias: An Autonomous Micro Robot for Swarm Robotic Applications.

Failure rates in introductory programming revisited (2014)
Conference Proceeding
Watson, C., & Li, F. W. (2014). Failure rates in introductory programming revisited. In Å. Cajander, M. Daniels, T. Clear, & A. Pears (Eds.), Proceedings of the 2014 conference on Innovation & technology in computer science education (ITiCSE '14) (39-44). https://doi.org/10.1145/2591708.2591749

Whilst working on an upcoming meta-analysis that synthesized fifty years of research on predictors of programming performance, we made an interesting discovery. Despite several studies citing a motivation for research as the high failure rates of int... Read More about Failure rates in introductory programming revisited.

No Tests Required: Comparing Traditional and Dynamic Predictors of Programming Success (2014)
Conference Proceeding
Watson, C., Li, F. W., & Godwin, J. L. (2014). No Tests Required: Comparing Traditional and Dynamic Predictors of Programming Success. In J. . D. Dougherty, K. Nagel, A. Decker, & K. Eiselt (Eds.), Proceedings of the 45th ACM Technical Symposium on Computer Science Education (469-474). https://doi.org/10.1145/2538862.2538930

Research over the past fifty years into predictors of programming performance has yielded little improvement in the identification of at-risk students. This is possibly because research to date is based upon using static tests, which fail to reflect... Read More about No Tests Required: Comparing Traditional and Dynamic Predictors of Programming Success.

Knocking Out P_k-free Graphs (2014)
Conference Proceeding
Johnson, M., Paulusma, D., & Stewart, A. (2014). Knocking Out P_k-free Graphs. In E. Csuhaj-Varjú, M. Dietzfelbinger, & Z. Ésik (Eds.), 39th International Symposium, MFCS 2014, Budapest, Hungary, 26-29August 2014 ; proceedings, Part II (396-407). https://doi.org/10.1007/978-3-662-44465-8_34

A parallel knock-out scheme for a graph proceeds in rounds in each of which each surviving vertex eliminates one of its surviving neighbours. A graph is KO-reducible if there exists such a scheme that eliminates every vertex in the graph. The Paralle... Read More about Knocking Out P_k-free Graphs.

A Reconfigurations Analogue of Brooks’ Theorem (2014)
Conference Proceeding
Feghali, C., Johnson, M., & Paulusma, D. (2014). A Reconfigurations Analogue of Brooks’ Theorem. In E. Csuhaj-Varjú, M. Dietzfelbinger, & Z. Ésik (Eds.), 39th International Symposium, MFCS 2014, Budapest, Hungary, 26-29 August 2014 ; proceedings, Part II (287-298). https://doi.org/10.1007/978-3-662-44465-8_25

Let G be a simple undirected graph on n vertices with maximum degree Δ. Brooks’ Theorem states that G has a Δ-colouring unless G is a complete graph, or a cycle with an odd number of vertices. To recolour G is to obtain a new proper colouring by chan... Read More about A Reconfigurations Analogue of Brooks’ Theorem.

Editing to Eulerian Graphs (2014)
Conference Proceeding
Dabrowski, K. K., Golovach, P. A., Hof, V. P., & Paulusma, D. (2014). Editing to Eulerian Graphs. In V. Raman, & S. P. Suresh (Eds.), 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014) (97-108). https://doi.org/10.4230/lipics.fsttcs.2014.97

We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and vertex deletion respectively.... Read More about Editing to Eulerian Graphs.

Classifying the Clique-Width of H-Free Bipartite Graphs (2014)
Conference Proceeding
Dabrowski, K. K., & Paulusma, D. (2014). Classifying the Clique-Width of H-Free Bipartite Graphs. In Z. Cai, A. Zelikovsky, & A. G. Bourgeois (Eds.), 20th International Conference, COCOON 2014, Atlanta, GA, USA, 4-6 August 2014 ; proceedings (489-500). https://doi.org/10.1007/978-3-319-08783-2_42

Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (B H ,W H ). We consider three different, natural ways of forbidding H as an induced subgraph in G. First, G is H-free if it does not contain H as an induced subgraph... Read More about Classifying the Clique-Width of H-Free Bipartite Graphs.