Marcin Pilipczuk: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

[ACM Press the Forty-Seventh Annual ACM - Portland, Oregon, USA (2015.06.14-2015.06.17)] Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15 - The Power of Dynamic Distance Oracles

Łącki, Jakub, Oćwieja, Jakub, Pilipczuk, Marcin, Sankowski, Piotr, Zych, Anna

Year:

2015

Language:

english

File:

PDF, 855 KB

english, 2015

2

On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs

Pilipczuk, Michał, Wrochna, Marcin

Journal:

ACM Transactions on Computation Theory

Year:

2018

Language:

english

File:

PDF, 756 KB

english, 2018

3

Directed Multicut is W[1]-hard, Even for Four Terminal Pairs

Pilipczuk, Marcin, Wahlström, Magnus

Journal:

ACM Transactions on Computation Theory

Year:

2018

Language:

english

File:

PDF, 507 KB

english, 2018

4

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs

Karpov, Nikolai, Pilipczuk, Marcin, Zych-Pawlewicz, Anna

Journal:

Year:

2018

Language:

english

File:

PDF, 655 KB

english, 2018

5

Tight Lower Bounds for the Complexity of Multicoloring

Bonamy, Marthe, Kowalik, łUkasz, Pilipczuk, Michał, Socała, Arkadiusz, Wrochna, Marcin

Journal:

ACM Transactions on Computation Theory

Year:

2019

Language:

english

File:

PDF, 454 KB

english, 2019

6

Tight Lower Bounds for the Complexity of Multicoloring

Bonamy, Marthe, Kowalik, łUkasz, Pilipczuk, Michał, Socała, Arkadiusz, Wrochna, Marcin

Journal:

ACM Transactions on Computation Theory

Year:

2019

File:

PDF, 454 KB

2019

7

Breaking the -barrier for Irredundance: Two lines of attack

Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk

Journal:

Journal of Discrete Algorithms

Year:

2011

Language:

english

File:

PDF, 333 KB

english, 2011

8

Exact and approximate bandwidth

Marek Cygan, Marcin Pilipczuk

Journal:

Theoretical Computer Science

Year:

2010

Language:

english

File:

PDF, 439 KB

english, 2010

9

The negative association property for the absolute values of random variables equidistributed on a generalized Orlicz ball

Marcin Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Year:

2008

Language:

english

File:

PDF, 614 KB

english, 2008

10

On the Zagreb index inequality of graphs with prescribed vertex degrees

Vesna Andova, Sašo Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Škrekovski

Journal:

Discrete Applied Mathematics

Year:

2011

Language:

english

File:

PDF, 244 KB

english, 2011

11

An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

Year:

2012

Language:

english

File:

PDF, 639 KB

english, 2012

12

Bandwidth and distortion revisited

Marek Cygan, Marcin Pilipczuk

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 282 KB

english, 2012

13

Capacitated domination faster than

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Information Processing Letters

Year:

2011

Language:

english

File:

PDF, 155 KB

english, 2011

14

Dominating set is fixed parameter tractable in claw-free graphs

Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Theoretical Computer Science

Year:

2011

Language:

english

File:

PDF, 450 KB

english, 2011

15

Kernelization hardness of connectivity problems in -degenerate graphs

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 296 KB

english, 2012

16

A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

SIAM Journal on Computing

Year:

2012

Language:

english

File:

PDF, 261 KB

english, 2012

17

Some results on Vizing’s conjecture and related problems

Marcin Pilipczuk, Michał Pilipczuk, Riste Škrekovski

Journal:

Discrete Applied Mathematics

Year:

2012

Language:

english

File:

PDF, 238 KB

english, 2012

18

Towards optimal kernel for connected vertex cover in planar graphs

Kowalik, Łukasz, Pilipczuk, Marcin, Suchan, Karol

Journal:

Discrete Applied Mathematics

Year:

2013

Language:

english

File:

PDF, 390 KB

english, 2013

19

On the Hardness of Losing Width

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk…

Journal:

Theory of Computing Systems

Year:

2014

Language:

english

File:

PDF, 444 KB

english, 2014

20

Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2n

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Year:

2014

Language:

english

File:

PDF, 517 KB

english, 2014

21

Parameterized Complexity of Eulerian Deletion Problems

Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk…

Journal:

Year:

2014

Language:

english

File:

PDF, 694 KB

english, 2014

22

On Cutwidth Parameterized by Vertex Cover

Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk…

Journal:

Year:

2014

Language:

english

File:

PDF, 537 KB

english, 2014

23

Scheduling Partially Ordered Jobs Faster than 2n

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Journal:

Year:

2014

Language:

english

File:

PDF, 803 KB

english, 2014

24

Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms

Cygan, Marek, Pilipczuk, Marcin

Journal:

Information Processing Letters

Year:

2013

Language:

english

File:

PDF, 151 KB

english, 2013

25

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters

Fomin, Fedor V., Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, Michał, Villanger, Yngve

Journal:

Journal of Computer and System Sciences

Year:

2014

Language:

english

File:

PDF, 1.08 MB

english, 2014

26

Faster deterministic Feedback Vertex Set

Kociumaka, Tomasz, Pilipczuk, Marcin

Journal:

Information Processing Letters

Year:

2014

Language:

english

File:

PDF, 223 KB

english, 2014

27

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable

Cygan, Marek, Marx, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal

Year:

2013

Language:

english

File:

PDF, 586 KB

english, 2013

28

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

Cygan, Marek, Nederlof, Jesper, Pilipczuk, Marcin, Pilipczuk, Michal, Rooij, Joham M.M. van, Wojtaszczyk, Jakub Onufry

Year:

2011

Language:

english

File:

PDF, 642 KB

english, 2011

29

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Designing FPT Algorithms for Cut Problems Using Randomized Contractions

Chitnis, Rajesh, Cygan, Marek, Hajiaghayi, MohammadTaghi, Pilipczuk, Marcin, Pilipczuk, Michal

Year:

2012

Language:

english

File:

PDF, 258 KB

english, 2012

30

Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

SIAM Journal on Discrete Mathematics

Year:

2013

Language:

english

File:

PDF, 265 KB

english, 2013

31

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs

Pilipczuk, Marcin, Pilipczuk, Michal, Sankowski, Piotr, Leeuwen, Erik Jan van

Year:

2014

Language:

english

File:

PDF, 362 KB

english, 2014

32

On Group Feedback Vertex Set Parameterized by the Size of the Cutset

Cygan, Marek, Marcin Pilipczuk,, Michał Pilipczuk,

Journal:

Year:

2016

Language:

english

File:

PDF, 212 KB

english, 2016

33

Sitting Closer to Friends than Enemies, Revisited

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

Theory of Computing Systems

Year:

2015

Language:

english

File:

PDF, 420 KB

english, 2015

34

A Fast Branching Algorithm for Cluster Vertex Deletion

Boral, Anudhyan, Cygan, Marek, Kociumaka, Tomasz, Pilipczuk, Marcin

Journal:

Theory of Computing Systems

Year:

2016

Language:

english

File:

PDF, 1006 KB

english, 2016

35

Faster exponential-time algorithms in graphs of bounded average degree

Cygan, Marek, Pilipczuk, Marcin

Journal:

Information and Computation

Year:

2015

Language:

english

File:

PDF, 671 KB

english, 2015

36

Parameterized Algorithms ||

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 7.88 MB

english, 2015

37

Clique Cover and Graph Separation

Cygan, Marek, Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, Michał, Wahlström, Magnus

Journal:

ACM Transactions on Computation Theory

Year:

2014

Language:

english

File:

PDF, 246 KB

english, 2014

38

Even Faster Exact Bandwidth

Cygan, Marek, Pilipczuk, Marcin

Journal:

ACM Transactions on Algorithms

Year:

2012

Language:

english

File:

PDF, 167 KB

english, 2012

39

On multiway cut parameterized above lower bounds

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, Wojtaszczyk, Jakub Onufry

Journal:

ACM Transactions on Computation Theory

Year:

2013

Language:

english

File:

PDF, 117 KB

english, 2013

40

Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs

Kratsch, Stefan, Pilipczuk, Marcin, Rai, Ashutosh, Raman, Venkatesh

Journal:

ACM Transactions on Computation Theory

Year:

2015

Language:

english

File:

PDF, 173 KB

english, 2015

41

Parameterized Algorithms || Iterative Compression

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 604 KB

english, 2015

42

Parameterized Algorithms || Matroids

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 718 KB

english, 2015

43

Parameterized Algorithms || Introduction

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 506 KB

english, 2015

44

Parameterized Algorithms || Kernelization

Cygan, Marek, Fomin, Fedor V., Kowalik, Łukasz, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Pilipczuk, Michał, Saurabh, Saket

Year:

2015

Language:

english

File:

PDF, 612 KB

english, 2015

45

Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs

Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, MichaŁ, Wahlström, Magnus

Journal:

SIAM Journal on Discrete Mathematics

Year:

2015

Language:

english

File:

PDF, 485 KB

english, 2015

46

A Subexponential Parameterized Algorithm for Proper Interval Completion

Bliznets, Ivan, Fomin, Fedor V., Pilipczuk, Marcin, Pilipczuk, Michał

Journal:

SIAM Journal on Discrete Mathematics

Year:

2015

Language:

english

File:

PDF, 366 KB

english, 2015

47

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal, Saurabh, Saket

Year:

2014

Language:

english

File:

PDF, 358 KB

english, 2014

48

Known Algorithms for Edge Clique Cover are Probably Optimal

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał

Journal:

SIAM Journal on Computing

Year:

2016

Language:

english

File:

PDF, 321 KB

english, 2016

49

Designing FPT Algorithms for Cut Problems Using Randomized Contractions

Chitnis, Rajesh, Cygan, Marek, Hajiaghayi, MohammadTaghi, Pilipczuk, Marcin, Pilipczuk, Michał

Journal:

SIAM Journal on Computing

Year:

2016

Language:

english

File:

PDF, 717 KB

english, 2016

50

A tight lower bound for Vertex Planarization on graphs of bounded treewidth

Pilipczuk, Marcin

Journal:

Discrete Applied Mathematics

Year:

2016

Language:

english

File:

PDF, 388 KB

english, 2016

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски