For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
This paper examines the computational role of inhibition as it moves towards balancing concurrent excitation using the biologically-inspired Temporal Noisy-Leaky Integrator (TNLI) ...
Chris Christodoulou, Trevor G. Clarkson, John G. T...