Skip to main content

Research Repository

Advanced Search

All Outputs (134)

An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar (2016)
Journal Article
Erickson, A., Kiasari, A., Navaridas, J., & Stewart, I. (2016). An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar. IEEE Transactions on Parallel and Distributed Systems, 28(3), 689-703. https://doi.org/10.1109/tpds.2016.2591011

DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network be... Read More about An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar.

Bounding clique-width via perfect graphs (2016)
Journal Article
Dabrowski, K., Huang, S., & Paulusma, D. (2019). Bounding clique-width via perfect graphs. Journal of Computer and System Sciences, 104, 202-215. https://doi.org/10.1016/j.jcss.2016.06.007

We continue the study into the clique-width of graph classes defined by two forbidden induced graphs. We present three new classes of bounded clique-width and one of unbounded clique-width. The four new graph classes have in common that one of their... Read More about Bounding clique-width via perfect graphs.

Gaze Prediction using Machine Learning for Dynamic Stereo Manipulation in Games (2016)
Conference Proceeding
Koulieris, G., Drettakis, G., Cunningham, D., & Mania, K. (2016). Gaze Prediction using Machine Learning for Dynamic Stereo Manipulation in Games. In T. Höllerer, V. Interrante, A. Lécuyer, & E. Suma (Eds.), 2016 IEEE Virtual Reality Conference (VR) : Greenville, South Carolina, USA, 19-23 March 2016. Proceedings (113-120). https://doi.org/10.1109/vr.2016.7504694

Comfortable, high-quality 3D stereo viewing is becoming a requirement for interactive applications today. Previous research shows that manipulating disparity can alleviate some of the discomfort caused by 3D stereo, but it is best to do this locally,... Read More about Gaze Prediction using Machine Learning for Dynamic Stereo Manipulation in Games.

Determining majority in networks with local interactions and very small local memory (2016)
Journal Article
Mertzios, G., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2017). Determining majority in networks with local interactions and very small local memory. Distributed Computing, 30(1), 1-16. https://doi.org/10.1007/s00446-016-0277-8

We study the problem of determining the majority type in an arbitrary connected network, each vertex of which has initially two possible types. The vertices may later change into other types, out of a set of a few additional possible types, and can i... Read More about Determining majority in networks with local interactions and very small local memory.

The price of connectivity for cycle transversals (2016)
Journal Article
Hartinger, T., Johnson, M., Milanič, M., & Paulusma, D. (2016). The price of connectivity for cycle transversals. European Journal of Combinatorics, 58, 203-224. https://doi.org/10.1016/j.ejc.2016.06.003

For a family of graphs F, an F-transversal of a graph G is a subset S⊆V(G) that intersects every subset of V(G) that induces a subgraph isomorphic to a graph in F. Let tF(G) be the minimum size of an F-transversal of G, and View the MathML source be... Read More about The price of connectivity for cycle transversals.

A linear kernel for finding square roots of almost planar graphs (2016)
Conference Proceeding
Golovach, P., Kratsch, D., Paulusma, D., & Stewart, A. (2016). A linear kernel for finding square roots of almost planar graphs. In R. Pagh (Ed.), 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). https://doi.org/10.4230/lipics.swat.2016.4

A graph H is a square root of a graph G if G can be obtained from H by the addition of edges between any two vertices in H that are of distance 2 of each other. The Square Root problem is that of deciding whether a given graph admits a square root. W... Read More about A linear kernel for finding square roots of almost planar graphs.

Colouring diamond-free graphs (2016)
Conference Proceeding
Dabrowski, K. K., Dross, F., & Paulusma, D. (2016). Colouring diamond-free graphs. In R. Pagh (Ed.), 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). https://doi.org/10.4230/lipics.swat.2016.16

The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (proper) k-colouring. For all graphs H up to five vertices, we classify the computational complexity of Colouring for (diamond,H)-free graphs. Our proof i... Read More about Colouring diamond-free graphs.

Reevaluating Reconstruction Filters for Path-Searching Tasks in 3D (2016)
Journal Article
Roberts, D., & Ivrissimtzis, I. (2017). Reevaluating Reconstruction Filters for Path-Searching Tasks in 3D. Computer Graphics Forum, 36(6), 291-302. https://doi.org/10.1111/cgf.12939

In this paper, we present an experiment on stereoscopic direct volume rendering, aiming at understanding the relationship between the choice of reconstruction filter and participant performance on tasks requiring spatial understanding such as 3D path... Read More about Reevaluating Reconstruction Filters for Path-Searching Tasks in 3D.

Robust Statistical Methods for Empirical Software Engineering (2016)
Journal Article
Kitchenham, B., Madeyski, L., Budgen, D., Keung, J., Brereton, P., Charters, S., …Pohthong, A. (2016). Robust Statistical Methods for Empirical Software Engineering. Empirical Software Engineering, 22(2), 579-630. https://doi.org/10.1007/s10664-016-9437-5

There have been many changes in statistical theory in the past 30 years, including increased evidence that non-robust methods may fail to detect important results. The statistical advice available to software engineering researchers needs to be updat... Read More about Robust Statistical Methods for Empirical Software Engineering.

An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances (2016)
Journal Article
Bordewich, M., & Tokac, N. (2016). An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances. Discrete Applied Mathematics, 213, 47-59. https://doi.org/10.1016/j.dam.2016.05.011

Traditional “distance based methods” reconstruct a phylogenetic tree from a matrix of pair-wise distances between taxa. A phylogenetic network is a generalisation of a phylogenetic tree that can describe evolutionary events such as reticulation and h... Read More about An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances.

Induced disjoint paths in circular-arc graphs in linear time (2016)
Journal Article
Golovach, P., Paulusma, D., & van Leeuwen, E. (2016). Induced disjoint paths in circular-arc graphs in linear time. Theoretical Computer Science, 640, 70-83. https://doi.org/10.1016/j.tcs.2016.06.003

The Induced Disjoint Paths problem is to test whether an graph G on n vertices with k distinct pairs of vertices (si,ti) contains paths P1,…,Pk such that Pi connects si and ti for i=1,…,k, and Pi and Pj have neither common vertices nor adjacent verti... Read More about Induced disjoint paths in circular-arc graphs in linear time.

Motivational gamification strategies rooted in self-determination theory for social adaptive E-Learning (2016)
Conference Proceeding
Cristea, A., & Shi, L. (2016). Motivational gamification strategies rooted in self-determination theory for social adaptive E-Learning. In A. Micarelli, J. Stamper, & K. Panourgia (Eds.), Intelligent Tutoring Systems, 13th International Conference, ITS 2016, Zagreb, Croatia, June 7-10, 2016, Proceedings (294-300). https://doi.org/10.1007/978-3-319-39583-8_32

This study uses gamification as the carrier of understanding the motivational benefits of applying the Self-Determination Theory (SDT) in social adaptive e-learning, by proposing motivational gamification strategies rooted in SDT, as well as developi... Read More about Motivational gamification strategies rooted in self-determination theory for social adaptive E-Learning.

On Finite Monoids of Cellular Automata (2016)
Conference Proceeding
Castillo-Ramirez, A., & Gadouleau, M. (2016). On Finite Monoids of Cellular Automata. In M. Cook, & T. Neary (Eds.), Cellular automata and discrete complex systems : 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016. Proceedings (90-104). https://doi.org/10.1007/978-3-319-39300-1_8

For any group G and set A, a cellular automaton over G and A is a transformation τ:AG→AGτ:AG→AG defined via a finite neighbourhood S⊆GS⊆G (called a memory set of ττ) and a local function μ:AS→Aμ:AS→A. In this paper, we assume that G and A are both fi... Read More about On Finite Monoids of Cellular Automata.

Form Follows Function - Do algorithms and applications challenge or drag behind the hardware evolution? (2016)
Conference Proceeding
Weinzierl, T. (2016). Form Follows Function - Do algorithms and applications challenge or drag behind the hardware evolution?.

Exascale roadmaps are dominated by predictions on hardware trends. At the same time, hardware-software co-design is a frequently cited phrase. It suggests that software development has an impact on the hardware evolution. Is this assumption valid? If... Read More about Form Follows Function - Do algorithms and applications challenge or drag behind the hardware evolution?.

Resilience of Luminance based Liveness Tests under Attacks with Processed Imposter Images (2016)
Conference Proceeding
Omar, L., & Ivrissimtzis, I. (2016). Resilience of Luminance based Liveness Tests under Attacks with Processed Imposter Images. In V. Skala (Ed.),

Liveness tests are techniques employed by face recognition authentication systems, aiming at verifying that a live face rather than a photo is standing in front of the system camera. In this paper, we study the resilience of a standard liveness test... Read More about Resilience of Luminance based Liveness Tests under Attacks with Processed Imposter Images.

Graph editing to a given degree sequence (2016)
Conference Proceeding
Golovach, P., & Mertzios, G. (2016). Graph editing to a given degree sequence. In A. Kulikov, & G. Woeginger (Eds.), Computer science – Theory and applications : 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016. Proceedings (177-191). https://doi.org/10.1007/978-3-319-34171-2_13

We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence where the aim is to obtain a graph with a given degree sequence σσ by at most k vertex or edge deletions and edge addition... Read More about Graph editing to a given degree sequence.

Bio-Inspired Embedded Vision System for Autonomous Micro-Robots: The LGMD Case (2016)
Journal Article
Hu, C., Arvin, F., Xiong, C., & Yue, S. (2017). Bio-Inspired Embedded Vision System for Autonomous Micro-Robots: The LGMD Case. IEEE Transactions on Cognitive and Developmental Systems, 9(3), 241-254. https://doi.org/10.1109/tcds.2016.2574624

In this paper, we present a new bio-inspired vision system embedded for micro-robots. The vision system takes inspiration from locusts in detecting fast approaching objects. Neurophysiological research suggested that locusts use a wide-field visual n... Read More about Bio-Inspired Embedded Vision System for Autonomous Micro-Robots: The LGMD Case.

On the Fixed Parameter Tractability of Agreement-based Phylogenetic Distances (2016)
Journal Article
Bordewich, M., Scornavacca, C., Tokac, N., & Weller, M. (2017). On the Fixed Parameter Tractability of Agreement-based Phylogenetic Distances. Journal of Mathematical Biology, 74(1), 239-257. https://doi.org/10.1007/s00285-016-1023-3

Three important and related measures for summarizing the dissimilarity in phylogenetic trees are the minimum number of hybridization events required to fit two phylogenetic trees onto a single phylogenetic network (the hybridization number), the (roo... Read More about On the Fixed Parameter Tractability of Agreement-based Phylogenetic Distances.