research
∙
07/14/2023
Delaying Decisions and Reservation Costs
We study the Feedback Vertex Set and the Vertex Cover problem in a natur...
share
research
∙
07/04/2023
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond
It is known that first-order logic with some counting extensions can be ...
research
∙
10/28/2020
Approximate Evaluation of First-Order Counting Queries
Kuske and Schweikardt introduced the very expressive first-order countin...
research
∙
09/29/2020
Online Simple Knapsack with Reservation Costs
In the Online Simple Knapsack Problem we are given a knapsack of unit si...
research
∙
06/25/2020
First-Order Model-Checking in Random Graphs and Complex Networks
Complex networks are everywhere. They appear for example in the form of ...
research
∙
05/04/2020
Advice for Online Knapsack With Removable Items
In the proportional knapsack problem, we are given a knapsack of some ca...
research
∙
10/01/2019
The Complexity of Packing Edge-Disjoint Paths
We introduce and study the complexity of Path Packing. Given a graph G a...
research
∙
09/27/2018
Reoptimization of Parameterized Problems
Parameterized complexity allows us to analyze the time complexity of pro...
research
∙
06/05/2018
Fast Dynamic Programming on Graph Decompositions
In this paper, we consider tree decompositions, branch decompositions, a...
research
∙
03/29/2018
The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness
Preferential attachment graphs are random graphs designed to mimic prope...
research
∙
09/26/2017