-
Chapter and Conference Paper
Socially Fair Matching: Exact and Approximation Algorithms
Matching problems are some of the most well-studied problems in graph theory and combinatorial optimization, with a variety of theoretical as well as practical motivations. However, in many applications of opt...
-
Chapter and Conference Paper
Probabilistic Reliability Assessment of a Component in the Presence of Internal Defects
Structural strength may degrade during the service life of an aircraft due to undetected material defects or accidental damages. Additively manufactured or welded structures are particularly susceptible to fat...
-
Article
Open AccessA Fixed-Parameter Perspective on #BIS
The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the intermediate complexity class
-
Article
Open AccessCorrection to: Metallurgical aspects of joining commercially pure titanium to Ti-6Al-4V alloy in a T-joint configuration by laser beam welding
The article Metallurgical aspects of joining commercially pure titanium to Ti-6Al-4V alloy in a T-joint configuration by laser beam welding by Fedor Fomin, Martin Froend, Volker Ventzke, Pedro Alvarez, Stefan ...
-
Article
Open AccessMetallurgical aspects of joining commercially pure titanium to Ti-6Al-4V alloy in a T-joint configuration by laser beam welding
The present paper focuses on the metallurgical and microstructural characterization of the laser beam-welded T-joints between commercially pure titanium (CP-Ti) and Ti-6Al-4V alloy. The weld regions were compr...
-
Living Reference Work Entry In depth
Bidimensionality
-
Reference Work Entry In depth
Branchwidth of Graphs
-
Chapter and Conference Paper
Optimal Linear Arrangement of Interval Graphs
We study the optimal linear arrangement (OLA) problem on interval graphs. Several linear layout problems that are NP-hard on general graphs are solvable in polynomial time on interval graphs. We prove that, qu...
-
Chapter and Conference Paper
Computing Branchwidth Via Efficient Triangulations and Blocks
Minimal triangulations and potential maximal cliques are the main ingredients for a number of polynomial time algorithms on different graph classes computing the treewidth of a graph. Potential maximal cliques...
-
Chapter and Conference Paper
On the Domination Search Number
We introduce the domination search game which can be seen as a natural modification of the well-known node search game. Various results concerning the domination search number of a graph are presented.
