# CLASSIS: The renaissance of graph classes - New algorithmic theory of forbidden induced subgraphs

En algoritme er en rekke med instruksjoner på hvordan et problem skal løses av en datamaskin. Algoritmer former grunnmuren av informatikkfaget. Grafalgoritmer er en sentral del av algoritmefeltet. Ethvert nettverk, som Internett, sosiale nettverk, kommunikasjonsnettverk osv, er en graf, og dermed...

# Efficient Algorithms for Graph Modification Problems

Motivated by the identification of some hidden combinatorial structures on experimental data-sets, graph modification problems cover a broad range of classical graph optimization problems, among which are edge-completion, edge-deletion, edge-edition or ve rtex-deletion problems. These problems a...

# Obtaining efficient algorithms by input restrictions: re-drawing the borderline of tractability

One of the greatest achievements in theoretical computer science is the development of the NP-completeness theory, providing a solid and convincing mathematical foundation for the study of computationally intractable problems, that are abundant and ubiqui tous. Such problems are called NP-hard. D...

# SCOPE - Exploiting Structure to Cope with Hard Problems

En algoritme er en liste med presise instruksjoner for å løse en oppgave ved hjelp av en datamaskin. Mange av de mest interessante oppgavene vi vil løse med datamaskiner er så vanskelige at ingen har så langt klart å finne en rask og god algoritme for å løse dem. En god del av disse oppgavene kan...

# GROW 2009 - Graph Classes, Optimization, and Width Parameters

The University of Bergen has been given the honor of organizing a conference for mathematicians and computer scientists engaged in cutting-edge research in the area of discrete optimization algorithms on graphs: GROW 2009 - 4th International Workshop on G raph Classes, Optimization, and Width Par...

...

# Minimal Separators and Triangulations in Graphs - Algorithms and Applications

Research in minimal separators and minimal triangulations is undergoing an expanding phase, with several new researchers joining the field and exciting results published yearly. The applicants of this project proposal have been heavily involved in resear ch in several aspects of minimal separato...

...