Outputs (137)

Simple dynamics on graphs (2016)
Journal Article
Gadouleau, M., & Richard, A. (2016). Simple dynamics on graphs. Theoretical Computer Science, 628, 62-77. https://doi.org/10.1016/j.tcs.2016.03.013

Can the interaction graph of a finite dynamical system force this system to have a “complex” dynamics? In other words, given a finite interval of integers A, which are the signed digraphs G such that every finite dynamical system f:An→An with G as in... Read More about Simple dynamics on graphs.

Investigation of cue-based aggregation in static and dynamic environments with a mobile robot swarm (2016)
Journal Article
Arvin, F., Turgut, A. E., Krajník, T., & Yue, S. (2016). Investigation of cue-based aggregation in static and dynamic environments with a mobile robot swarm. Adaptive Behavior, 24(2), 102-118. https://doi.org/10.1177/1059712316632851

Aggregation is one of the most fundamental behaviors and has been studied in swarm robotic researches for more than two decades. Studies in biology have revealed that the environment is a preeminent factor, especially in cue-based aggregation. This c... Read More about Investigation of cue-based aggregation in static and dynamic environments with a mobile robot swarm.

Ranks of finite semigroups of one-dimensional cellular automata (2016)
Journal Article
Castillo-Ramirez, A., & Gadouleau, M. (2016). Ranks of finite semigroups of one-dimensional cellular automata. Semigroup Forum, 93(2), 347-362. https://doi.org/10.1007/s00233-016-9783-z

Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of all confi... Read More about Ranks of finite semigroups of one-dimensional cellular automata.

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (2016)
Journal Article
Golovach, P., Johnson, M., Paulusma, D., & Song., J. (2017). A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. Journal of Graph Theory, 84(4), 331-363. https://doi.org/10.1002/jgt.22028

For a positive integer k, a k-coloring of a graph inline image is a mapping inline image such that inline image whenever inline image. The COLORING problem is to decide, for a given G and k, whether a k-coloring of G exists. If k is fixed (i.e., it i... Read More about A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.

Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes (2016)
Journal Article
Kuo, C., & Stewart, I. (2016). Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes. Theoretical Computer Science, 627, 102-106. https://doi.org/10.1016/j.tcs.2016.02.029

Let F v and Fe be sets of faulty vertices and faulty edges, respectively, in the folded hypercube FQn so that |F v | + |Fe | ≤ n − 2, for n ≥ 2. Choose any fault-free edge e. If n ≥ 3 then there is a fault-free cycle of length l in FQn containing e,... Read More about Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes.

What Do We Know and How Well Do We Know It? Current Knowledge about Software Engineering Practices (2016)
Presentation / Conference Contribution
Budgen, D. (2015, July). What Do We Know and How Well Do We Know It? Current Knowledge about Software Engineering Practices. Presented at 10th International Joint Conference on Software Technologies (ICSOFT), Colmar, France

Context: The ‘prescriptions’ used in software engineering for developing and maintaining systems make use of a set of ‘practice models’, which have largely been derived by codifying successful experiences of expert practitioners. Aim: To review the w... Read More about What Do We Know and How Well Do We Know It? Current Knowledge about Software Engineering Practices.

Filling the complexity gaps for colouring planar and bounded degree graphs (2016)
Presentation / Conference Contribution
Dabrowski, K. K., Dross, F., Johnson, M., & Paulusma, D. (2015, October). Filling the complexity gaps for colouring planar and bounded degree graphs. Presented at 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italy

We consider a natural restriction of the List Colouring problem, k-Regular List Colouring, which corresponds to the List Colouring problem where every list has size exactly k. We give a complete classification of the complexity of k-Regular List Colo... Read More about Filling the complexity gaps for colouring planar and bounded degree graphs.

Intersection Graphs of L-Shapes and Segments in the Plane (2016)
Journal Article
Felsner, S., Knauer, K., Mertzios, G., & Ueckerdt, T. (2016). Intersection Graphs of L-Shapes and Segments in the Plane. Discrete Applied Mathematics, 206, 48-55. https://doi.org/10.1016/j.dam.2016.01.028

An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: Full-size image (25 K), Full-size image (25 K),Full-size image (25 K) and Full-size image (25 K). A k-bend path is a simple path in t... Read More about Intersection Graphs of L-Shapes and Segments in the Plane.

A 3D Steganalytic Algorithm and Steganalysis-Resistant Watermarking (2016)
Journal Article
Yang, Y., Pintus, R., Rushmeier, H., & Ivrissimtzis, I. (2017). A 3D Steganalytic Algorithm and Steganalysis-Resistant Watermarking. IEEE Transactions on Visualization and Computer Graphics, 23(2), 1002-2626. https://doi.org/10.1109/tvcg.2016.2525771

We propose a simple yet efficient steganalytic algorithm for watermarks embedded by two state-of-the-art 3D watermarking algorithms by Cho et al. The main observation is that while in a clean model the means/variances of Cho et al.’s normalized histo... Read More about A 3D Steganalytic Algorithm and Steganalysis-Resistant Watermarking.

On using Feature Descriptors as Visual Words for Object Detection within X-ray Baggage Security Screening (2016)
Presentation / Conference Contribution
Kundegorski, M., Akcay, S., Devereux, M., Mouton, A., & Breckon, T. (2016, January). On using Feature Descriptors as Visual Words for Object Detection within X-ray Baggage Security Screening. Presented at International Conference on Imaging for Crime Detection and Prevention, Madrid, Spain

Here we explore the use of various feature point descriptors as visual word variants within a Bag-of-Visual-Words (BoVW) representation scheme for image classification based threat detection within baggage security X-ray imagery. Using a classical Bo... Read More about On using Feature Descriptors as Visual Words for Object Detection within X-ray Baggage Security Screening.