Abstract. With vast amounts of text being available in electronic format, such as news and social media, automatic multi-document summarization can help extract the most important ...
Azam Sheikh Muhammad, Peter Damaschke, Olof Mogren
Online Bin Stretching is a semi-online variant of Bin Packing with a set number of m bins, where all bins can be overpacked to capacity S ≥ 1, which is to be minimized. There is ...
The order-preserving matching problem is a variant of the pattern matching problem focusing on shapes of sequences instead of values of sequences. Given a text and a pattern, the p...
There is a growing number of different research fields that are concerned with bibliographic data analysis. In many cases, data of interest can be described as heterogeneous info...
Abstract. Ever-changing business processes in large software systems, integration of heterogeneous data sources as well as the desire for legacy service integration drive software ...
The standard parameterization of the VERTEX COVER problem (Given an undirected graph G and k ∈ N as input, does G have a vertex cover of size at most k?) has the solution size k...
Szemer´edi’s Regularity Lemma [22, 23] is one of the most powerful tools in combinatorics. It asserts that all large graphs G admit a bounded partition of E(G), most classes of...
Many statistical physics models are defined on an infinite lattice by taking appropriate limits of finite lattice regions, where a key consideration is how the boundaries are d...