Jakub Onufry Wojtaszczyk

Available identifiers

zbMath Open wojtaszczyk.jakub-onufryMaRDI QIDQ486987

List of research outcomes

Publication	Date of Publication	Type
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time	2023-10-31	Paper
Approximation schemes for capacitated geometric network design	2018-11-28	Paper
The stubborn problem is stubborn no more: a polynomial algorithm for 3-compatible colouring and the stubborn List partition problem	2017-09-29	Paper
Scheduling partially ordered jobs faster than \(2^n\)	2017-05-17	Paper
On some extensions of the FKN theorem	2016-02-02	Paper
On multiway cut parameterized above lower bounds	2015-09-24	Paper
Sitting closer to friends than enemies, revisited	2015-05-29	Paper
Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)	2015-01-19	Paper
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time	2014-07-30	Paper
Subset feedback vertex set is fixed-parameter tractable	2013-06-27	Paper
Capacitated domination faster than \(O(2^n)\)	2013-04-04	Paper
A polynomial algorithm for 3-compatible coloring and the stubborn list partition problem (the stubborn problem is stubborn no more)	2012-11-29	Paper
An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion	2012-11-21	Paper
Kernelization hardness of connectivity problems in \(d\)-degenerate graphs	2012-10-26	Paper
Sitting closer to friends than enemies, revisited	2012-09-25	Paper
Solving the 2-disjoint connected subgraphs problem faster than \(2^{n }\)	2012-06-29	Paper
On multiway cut parameterized above lower bounds	2012-06-15	Paper
Dominating set is fixed parameter tractable in claw-free graphs	2011-12-07	Paper
Scheduling partially ordered jobs faster than \(2^{n }\)	2011-09-16	Paper
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack	2011-08-23	Paper
Approximation schemes for capacitated geometric network design	2011-07-06	Paper
Subset feedback vertex set is fixed-parameter tractable	2011-07-06	Paper
No return to convexity	2011-03-04	Paper
An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion	2010-12-07	Paper
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs	2010-11-16	Paper
Capacitated domination faster than \(O(2^{n })\)	2010-06-22	Paper
Irredundant Set Faster Than O(2 n )	2010-05-28	Paper
A Simpler Proof of the Negative Association Property for Absolute Values of Measures Tied to Generalized Orlicz Balls	2009-06-11	Paper
On the infimum convolution inequality	2008-10-20	Paper
The negative association property for the absolute values of random variables equidistributed on a generalized Orlicz ball	2008-09-02	Paper
The Square Negative Correlation Property for Generalized Orlicz Balls	2007-11-05	Paper
A series whose sum range is an arbitrary finite set	2006-01-03	Paper
Multivariate integration in \(C^{\infty}([0,1]^{d})\) is not strongly tractable.	2004-03-14	Paper

Research outcomes over time

This page was built for person: Jakub Onufry Wojtaszczyk