# Fingerprint Dive into the research topics where Department of Computer Science is active. These topic labels come from the works of this organisation's members. Together they form a unique fingerprint.

- Sort by
- Weight
- Alphabetically

### Engineering & Materials Science

Wireless sensor networks

Heuristic algorithms

Sensor nodes

Polynomials

Sensor networks

Coloring

Hardness

Approximation algorithms

Information systems

Electroencephalography

Neural networks

Students

Agglomeration

Fault tolerance

Learning systems

Human robot interaction

Decomposition

Robotics

Brain computer interface

Networks (circuits)

Communication

Sensors

Audition

Law enforcement

Intrusion detection

Decision trees

Computational complexity

Network protocols

Energy efficiency

Authentication

Color

Intelligent systems

Software engineering

Mobile devices

Cryptography

Fusion reactions

Topology

Dynamic programming

Genetic algorithms

Biometrics

Near field scanning optical microscopy

Testbeds

Evolutionary algorithms

Data privacy

Network architecture

Industry

Patient monitoring

Human resource management

Costs

Gesture recognition

Computer programming languages

Learning algorithms

Scheduling

Telemedicine

Smart cards

Monitoring

Near infrared spectroscopy

Defects

Synchronization

Data mining

Disasters

Recurrent neural networks

Dynamical systems

Semantics

Recommender systems

Quality of service

Radiotherapy

Energy management

Object recognition

Data fusion

Teaching

Quantum computers

Hidden Markov models

Microphones

Decoding

Face recognition

Project management

Risk management

Metadata

Controllability

Chemical activation

Fuzzy logic

Application programs

Internet

Trajectories

Shielding

Microarrays

Directed graphs

Computer vision

Image classification

Simulators

Brain

Kinematics

Computer systems

Automata theory

Robots

Processing

Quantum communication

Information filtering

Recovery

### Mathematics

Graph in graph theory

Heuristic algorithm

Hardness

Clique-width

Polynomial Algorithm

Colouring

Strings

Fixed-parameter Algorithms

Neural Networks

Information Systems

Longest Common Subsequence

Approximation Algorithms

Minimization Problem

Scale-free Networks

Subsequence

Noise-induced Transition

Cover

Hardness of Approximation

Digraph

Approximation

Growing Networks

Flow Network

Quantum Circuits

Topological Index

Boolean Networks

Steiner Triple System

Optimization

Data Aggregation

Web-based System

Parameterized Complexity

Triangle inequality

Extremal Graphs

Placement

Fitness Landscape

Clustering Coefficient

Maximum Matching

Social Interaction

Data Center

Small World

NP-complete problem

Virtual Machine

Multi-hop

Intrusion Detection

Auctions

Patterning

Polynomial-time Algorithm

Privacy

Fitness Function

Min-max

Vertex of a graph

Local Minima

Decision tree

Controllability

Complex Networks

Enumeration

Fuzzy Logic

Non-equilibrium

Anomaly

Wireless Sensor Networks

Cycle

Subset

Decompose

Genetic Algorithm

Output

Subsystem

Encoding

Configuration

Distance Matrix

Accumulate

Segmentation

Set of points

Model

Random Networks

Reasoning

Synthesis

Exact Algorithms

Disorder

Drosophilidae

Evaluation

Metric

NP-hardness

Search Space

Thermodynamic Limit

Edge Coloring

Optimization Problem

Infrastructure

Microarray

Combinatorial Problems

Unicyclic Graph

Multiset

Local Search

Neutrality

Multiplication

Ising Model

Radiotherapy

Target

Spectral Decomposition

Graph Classes

Methodology

Arc of a curve