Jakub Onufry Wojtaszczyk

From MaRDI portal
Revision as of 02:55, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:486987

Available identifiers

zbMath Open wojtaszczyk.jakub-onufryMaRDI QIDQ486987

List of research outcomes

PublicationDate of PublicationType
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time2023-10-31Paper
Approximation Schemes for Capacitated Geometric Network Design2018-11-28Paper
https://portal.mardi4nfdi.de/entity/Q53651462017-09-29Paper
Scheduling partially ordered jobs faster than \(2^n\)2017-05-17Paper
On some extensions of the FKN theorem2016-02-02Paper
On Multiway Cut Parameterized above Lower Bounds2015-09-24Paper
Sitting closer to friends than enemies, revisited2015-05-29Paper
Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)2015-01-19Paper
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time2014-07-30Paper
Subset Feedback Vertex Set Is Fixed-Parameter Tractable2013-06-27Paper
Capacitated domination faster than \(O(2^n)\)2013-04-04Paper
A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)2012-11-29Paper
An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion2012-11-21Paper
Kernelization hardness of connectivity problems in \(d\)-degenerate graphs2012-10-26Paper
Sitting Closer to Friends Than Enemies, Revisited2012-09-25Paper
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n2012-06-29Paper
On Multiway Cut Parameterized above Lower Bounds2012-06-15Paper
Dominating set is fixed parameter tractable in claw-free graphs2011-12-07Paper
Scheduling Partially Ordered Jobs Faster Than 2 n2011-09-16Paper
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack2011-08-23Paper
Approximation Schemes for Capacitated Geometric Network Design2011-07-06Paper
Subset Feedback Vertex Set Is Fixed-Parameter Tractable2011-07-06Paper
No return to convexity2011-03-04Paper
An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion2010-12-07Paper
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs2010-11-16Paper
Capacitated Domination Faster Than O(2 n )2010-06-22Paper
Irredundant Set Faster Than O(2 n )2010-05-28Paper
A Simpler Proof of the Negative Association Property for Absolute Values of Measures Tied to Generalized Orlicz Balls2009-06-11Paper
On the infimum convolution inequality2008-10-20Paper
The negative association property for the absolute values of random variables equidistributed on a generalized Orlicz ball2008-09-02Paper
The Square Negative Correlation Property for Generalized Orlicz Balls2007-11-05Paper
A series whose sum range is an arbitrary finite set2006-01-03Paper
Multivariate integration in \(C^{\infty}([0,1^{d})\) is not strongly tractable.]2004-03-14Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jakub Onufry Wojtaszczyk