# 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

Polynomials

Sensor nodes

Sensor networks

Coloring

Hardness

Students

Neural networks

Approximation algorithms

Information systems

Learning systems

Electroencephalography

Agglomeration

Fault tolerance

Human robot interaction

Decomposition

Robotics

Brain computer interface

Networks (circuits)

Communication

Object recognition

Sensors

Audition

Law enforcement

Intrusion detection

Decision trees

Computational complexity

Network protocols

Authentication

Color

Intelligent systems

Industry

Learning algorithms

Mobile devices

Cryptography

Fusion reactions

Topology

Dynamic programming

Genetic algorithms

Biometrics

Near field scanning optical microscopy

Testbeds

Evolutionary algorithms

Data privacy

Network architecture

Costs

Gesture recognition

Computer programming languages

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

Data fusion

Teaching

Quantum computers

Hidden Markov models

Software engineering

Microphones

Decoding

Face recognition

Risk management

Metadata

Controllability

Chemical activation

Energy efficiency

Fuzzy logic

Application programs

Internet

Trajectories

Shielding

Microarrays

Directed graphs

Genes

Computer vision

Image classification

Simulators

Brain

Data structures

Kinematics

Computer systems

Experiments

Automata theory

Robots

Processing

Quantum communication

Information filtering

Recovery

### Mathematics

Graph in graph theory

Heuristic algorithm

Hardness

Clique-width

Neural Networks

Extremal Graphs

Polynomial Algorithm

Colouring

Strings

Fixed-parameter Algorithms

Topological Index

Information Systems

Longest Common Subsequence

Approximation Algorithms

Minimization Problem

Scale-free Networks

Subsequence

Noise-induced Transition

Cover

Hardness of Approximation

Digraph

Bent Function

Approximation

Growing Networks

Flow Network

Quantum Circuits

Trading Strategies

Boolean Networks

Steiner Triple System

Optimization

Data Aggregation

Web-based System

Parameterized Complexity

Triangle inequality

Placement

Fitness Landscape

Clustering Coefficient

Maximum Matching

Social Interaction

Data Center

Small World

NP-complete problem

Virtual Machine

Multi-hop

Intrusion Detection

Auctions

Patterning

Unicyclic Graph

Polynomial-time Algorithm

Privacy

Fitness Function

Min-max

Model

Vertex of a graph

Local Minima

Decision tree

Controllability

Complex Networks

Enumeration

Fuzzy Logic

Non-equilibrium

Evaluation

Anomaly

Girth

Wireless Sensor Networks

Forecasting

Cycle

Subset

Decompose

Genetic Algorithm

Output

Subsystem

Encoding

Configuration

Distance Matrix

Accumulate

Segmentation

Set of points

Random Networks

Reasoning

Chemistry

Synthesis

Exact Algorithms

Disorder

Drosophilidae

Connected graph

Metric

NP-hardness

Search Space

Thermodynamic Limit

Edge Coloring

Extremes

Optimization Problem

Infrastructure

Microarray

Combinatorial Problems

Multiset

Local Search

Neutrality

Multiplication