Skip to main content

Research Repository

Advanced Search

Outputs (216)

Contraction and Deletion Blockers for Perfect Graphs and H -free Graphs (2018)
Journal Article
Diner, Ö., Paulusma, D., Picouleau, C., & Ries, B. (2018). Contraction and Deletion Blockers for Perfect Graphs and H -free Graphs. Theoretical Computer Science, 746, 49-72. https://doi.org/10.1016/j.tcs.2018.06.023

We study the following problem: for given integers d, k and graph G, can we reduce some fixed graph parameter π of G by at least d via at most k graph operations from some fixed set S? As parameters we take the chromatic number χ, clique number ω and... Read More about Contraction and Deletion Blockers for Perfect Graphs and H -free Graphs.

Linear read-once and related Boolean functions (2018)
Journal Article
Lozin, V., Razgon, I., Zamaraev, V., Zamaraeva, E., & Zolotykh, N. (2018). Linear read-once and related Boolean functions. Discrete Applied Mathematics, 250, 16-27. https://doi.org/10.1016/j.dam.2018.05.001

It is known that a positive Boolean function depending on variables has at least extremal points, i.e. minimal ones and maximal zeros. We show that has exactly extremal points if and only if it is linear read-once. The class of linear read-once funct... Read More about Linear read-once and related Boolean functions.

BotDet: A System for Real Time Botnet Command and Control Traffic Detection (2018)
Journal Article
Ghafir, I., Prenosil, V., Hammoudeh, M., Baker, T., Jabbar, S., Khalid, S., & Jaf, S. (2018). BotDet: A System for Real Time Botnet Command and Control Traffic Detection. IEEE Access, 6, 38947-38958. https://doi.org/10.1109/access.2018.2846740

Over the past decade, the digitization of services transformed the healthcare sector leading to a sharp rise in cybersecurity threats. Poor cybersecurity in the healthcare sector, coupled with high value of patient records attracted the attention of... Read More about BotDet: A System for Real Time Botnet Command and Control Traffic Detection.

On the Complexity of the Model Checking Problem (2018)
Journal Article
Madelaine, F. R., & Martin, B. D. (2018). On the Complexity of the Model Checking Problem. SIAM Journal on Computing, 47(3), 769-797. https://doi.org/10.1137/140965715

The complexity of the model checking problem for various fragments of first-order logic (FO) has attracted much attention over the last two decades, in particular for the fragment induced by ∃ and ∧ and that induced by ∀, ∃, and ∧, which are better k... Read More about On the Complexity of the Model Checking Problem.

A conceptual framework for social movements analytics for national security (2018)
Presentation / Conference Contribution
Cárdenas, P., Theodoropoulos, G., Obara, B., & Kureshi, I. (2018, June). A conceptual framework for social movements analytics for national security. Presented at International Conference on Computational Science, Wuxi, China

Social media tools have changed our world due to the way they convey information between individuals; this has led to many social movements either starting on social media or being organised and managed through this medium. At times however, certain... Read More about A conceptual framework for social movements analytics for national security.

Collaborative Creative Computing (2018)
Presentation / Conference Contribution
Bradley, S., & Church, S. (2018, June). Collaborative Creative Computing. Presented at London Computing Education Research Symposium (2018 LCERS)., London, England

Extended Patch Prioritization for Depth Filling Within Constrained Exemplar-Based RGB-D Image Completion (2018)
Presentation / Conference Contribution
Atapour-Abarghouei, A., & Breckon, T. P. (2018, December). Extended Patch Prioritization for Depth Filling Within Constrained Exemplar-Based RGB-D Image Completion. Presented at International Conference Image Analysis and Recognition, Póvoa de Varzim, Portugal

We address the problem of hole filling in depth images, obtained from either active or stereo sensing, for the purposes of depth image completion in an exemplar-based framework. Most existing exemplar-based inpainting techniques, designed for color i... Read More about Extended Patch Prioritization for Depth Filling Within Constrained Exemplar-Based RGB-D Image Completion.

Independent Feedback Vertex Set for P5-free Graphs (2018)
Journal Article
Bonamy, M., Dabrowski, K., Feghali, C., Johnson, M., & Paulusma, D. (2018). Independent Feedback Vertex Set for P5-free Graphs. Algorithmica, 81(4), 1416-1449. https://doi.org/10.1007/s00453-018-0474-x

The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a given integer k≥0 , to delete at most k vertices from a given graph so that what remains is a forest. The variant in which the deleted vertices must... Read More about Independent Feedback Vertex Set for P5-free Graphs.

EnergyChain: Enabling Energy Trading for Smart Homes using Blockchains in Smart Grid Ecosystem (2018)
Presentation / Conference Contribution
Aggarwal, S., Chaudhary, R., Aujla, G. S., Jindal, A., Dua, A., & Kumar, N. (2018, December). EnergyChain: Enabling Energy Trading for Smart Homes using Blockchains in Smart Grid Ecosystem. Presented at Proceedings of the 1st ACM MobiHoc Workshop on Networking and Cybersecurity for Smart Cities - SmartCitiesSecurity'18, Los Angeles, USA