We study the parameterized complexity of training two-layer neural netwo...
A graph with vertex set {1,…,n} is terrain-like if, for any edge
pair {a...
Data reduction rules are an established method in the algorithmic toolbo...
We study the network untangling problem introduced by Rozenshtein, Tatti...
The classic Cluster Editing problem (also known as Correlation Clusterin...
Understanding the computational complexity of training simple neural net...
In the simplest game-theoretic formulation of Schelling's model of
segre...
To address the dynamic nature of real-world networks, we generalize
comp...
We thoroughly study a novel and still basic combinatorial matrix complet...
Many consensus string problems are based on Hamming distance. We replace...
Considering matrices with missing entries, we study NP-hard matrix compl...
We prove a bijection between the triangulations of the 3-dimensional cyc...
Computing a sample mean of time series under dynamic time warping (DTW) ...
We study a simple exchange market, introduced by Gourvés, Lesca and
Wilc...
We study terrain visibility graphs, a well-known graph class closely rel...
Dynamic Time Warping (DTW) is a well-known similarity measure for time
s...
The connections within many real-world networks change over time. Thus, ...
Consensus problems for strings and sequences appear in numerous applicat...
A point visibility graph is a graph induced by a set of points in the pl...