17 citations · 24 across the 5 of their papers we have counts for
5 papers
A polynomial-time -approximation algorithm for maximum independent set of connected subgraphs in a planar graph
Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
In the Maximum Independent Set of Objects problem, we are given an -vertex planar graph and a family of objects, where each object is a connected subgraph…
Coverability in 2-VASS with One Unary Counter is in NP
Filip Mazowiecki, Henry Sinclair-Banks, Karol Węgrzycki
Coverability in Petri nets finds applications in verification of safety properties of reactive systems. We study coverability in the equivalent model: Vector Addition Systems with…
Makespan Scheduling of Unit Jobs with Precedence Constraints in time
Jesper Nederlof, Céline M. F. Swennenhuis, Karol Węgrzycki
In a classical scheduling problem, we are given a set of jobs of unit length along with precedence constraints and the goal is to find a schedule of these jobs on identical…
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting
Andrzej Pacuk, Piotr Sankowski, Karol Węgrzycki +2
We present the Mim-Solution's approach to the RecSys Challenge 2016, which ranked 2nd. The goal of the competition was to prepare job recommendations for the users of the website X…
Locality-Sensitive Hashing without False Negatives for l_p
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki +1
In this paper, we show a construction of locality-sensitive hash functions without false negatives, i.e., which ensure collision for every pair of points within a given radius …