University of Bergen

output

19932026

most citedObservation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

10.9k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2018 · cs.DSShow all

5 papers · 2 filters

cs.DS2018

What is known about Vertex Cover Kernelization?

Michael R. Fellows, Lars Jaffke, Aliz Izabella Király +2

We are pleased to dedicate this survey on kernelization of the Vertex Cover problem, to Professor Juraj Hromkovič on the occasion of his 60th birthday. The Vertex Cover problem is…

cs.DS2018

A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs

Lars Jaffke, Paloma T. Lima

A $b$ -coloring of a graph $G$ is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b…

cs.DS2018★ 2 cited

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments

Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee +3

A {\em tournament} is a directed graph $T$ such that every pair of vertices is connected by an arc. A {\em feedback vertex set} is a set $S$ of vertices in $T$ such that $T - S$ is…

cs.DS2018★ 7 cited

On the Parameterized Complexity of Graph Modification to First-Order Logic Properties

Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos

We consider the problems of deciding whether an input graph can be modified by removing/adding at most k vertices/edges such that the result of the modification satisfies some prop…

cs.DS2018★ 5 cited

Evaluating and Tuning n-fold Integer Programming

Kateřina Altmanová, Dušan Knop, Martin Koutecký

In recent years, algorithmic breakthroughs in stringology, computational social choice, scheduling, etc., were achieved by applying the theory of so-called $n$ -fold integer program…