Not all aberrations are equal: Reading impairment depends on aberration type and magnitude.
(2011)
Journal Article
All Outputs (82)
On partitioning a graph into two connected subgraphs (2011)
Journal Article
Suppose a graph G is given with two vertex-disjoint sets of vertices Z1 and Z2. Can we partition the remaining vertices of G such that we obtain two connected vertex-disjoint subgraphs of G that contain Z1 and Z2, respectively? This problem is known... Read More about On partitioning a graph into two connected subgraphs.
Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications (2011)
Journal Article
Peano - A Traversal and Storage Scheme for Octree-Like Adaptive Cartesian Multiscale Grids (2011)
Journal Article
The longest path problem has a polynomial solution on interval graphs (2011)
Journal Article
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it is NP-hard on general graphs, as it is a generalization of the Hamilton... Read More about The longest path problem has a polynomial solution on interval graphs.
Parameterizing cut sets in a graph by the number of their components (2011)
Journal Article
For a connected graph G=(V,E), a subset U⊆V is a disconnected cut if U disconnects G and the subgraph G[U] induced by U is disconnected as well. A cut U is a k-cut if G[U] contains exactly k(≥1) components. More specifically, a k-cut U is a (k,ℓ)-cut... Read More about Parameterizing cut sets in a graph by the number of their components.
Composition Games for Distributed Systems: The EU Grants Games (2011)
Presentation / Conference Contribution
The recognition of tolerance and bounded tolerance graphs (2011)
Journal Article
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure and its num... Read More about The recognition of tolerance and bounded tolerance graphs.
Contracting planar graphs to contractions of triangulations (2011)
Journal Article
For every graph H, there exists a polynomial-time algorithm deciding if a planar input graph G can be contracted to H. However, the degree of the polynomial depends on the size of H. We identify a class of graphs C such that for every fixed H∈C, ther... Read More about Contracting planar graphs to contractions of triangulations.
Bipancyclicity in k-ary n-cubes with faulty edges under a conditional fault assumption (2011)
Journal Article
We prove that a k-ary 2-cube Q^k_2 with 3 faulty edges but where every vertex is incident with at least 2 healthy edges is bipancyclic, if k \geq 3, and k-pancyclic, if k \geq 5 is odd (these results are optimal). We go on to show that when k \geq 4... Read More about Bipancyclicity in k-ary n-cubes with faulty edges under a conditional fault assumption.
On disconnected cuts and separators (2011)
Journal Article
For a connected graph G=(V,E), a subset U⊆V is called a disconnected cut if U disconnects the graph, and the subgraph induced by U is disconnected as well. A natural condition is to impose that for any u∈U, the subgraph induced by (V∖U)∪{u} is connec... Read More about On disconnected cuts and separators.
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time (2011)
Presentation / Conference Contribution
The longest path problem asks for a path with the largest number of vertices in a given graph. The first polynomial time algorithm (with running time O(n4)) has been recently developed for interval graphs. Even though interval and circular-arc graphs... Read More about Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time.
Clustering based leaders' selection in multi-objective evolutionary algorithms (2011)
Presentation / Conference Contribution
Clustering-based Leaders Selection (CLS) is a novel leaders selection technique in multi-objective evolutionary algorithms. Clustering is applied on both the objective and solution spaces whereby each individual is assigned to two clusters; one in th... Read More about Clustering based leaders' selection in multi-objective evolutionary algorithms.
Multi-objective Optimisation of Cancer Chemotherapy using Smart PSO with Decomposition (2011)
Presentation / Conference Contribution
The paper presents a novel approach to optimising cancer chemotherapy with respect to conflicting treatment objectives aimed at reducing the number of cancerous cells and at limiting the amounts of anti-cancer drugs used. The approach is based on the... Read More about Multi-objective Optimisation of Cancer Chemotherapy using Smart PSO with Decomposition.
Vertex Splitting and the Recognition of Trapezoid Graphs (2011)
Journal Article
Trapezoid graphs are the intersection family of trapezoids where every trapezoid has a pair of opposite sides lying on two parallel lines. These graphs have received considerable attention and lie strictly between permutation graphs (where the trapez... Read More about Vertex Splitting and the Recognition of Trapezoid Graphs.
Query-driven Multiscale Data Postprocessing in Computational Fluid Dynamics (2011)
Presentation / Conference Contribution
Automatic Road Environment Classification (2011)
Journal Article
Iris Segmentation using an Edge Detector based on Fuzzy Sets Theory and Cellular Learning Automata (2011)
Journal Article
Iris-based biometric systems identify individuals based on the characteristics of their iris, since they are proven to remain unique for a long time. An iris recognition system includes four phases, the most important of which is preprocessing in whi... Read More about Iris Segmentation using an Edge Detector based on Fuzzy Sets Theory and Cellular Learning Automata.
A multipath analysis of biswapped networks (2011)
Journal Article
Biswapped networks of the form $Bsw(G)$ have recently been proposed as interconnection networks to be implemented as optical transpose interconnection systems. We provide a systematic construction of $\kappa+1$ vertex-disjoint paths joining any two d... Read More about A multipath analysis of biswapped networks.