Marcin Pilipczuk

Dikutip oleh

	Semua	Sejak 2020
Kutipan	7403	4493
indeks-h	38	28
indeks-i10	98	78

1100

550

275

825

20112012201320142015201620172018201920202021202220232024202563 135 159 174 232 352 483 570 595 764 720 776 901 1017 303

Akses publik

Lihat semua

78 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Michał PilipczukUniversity of WarsawEmail yang diverifikasi di mimuw.edu.pl
Marek CyganUniversity of WarsawEmail yang diverifikasi di mimuw.edu.pl
Daniel LokshtanovProfessor of Computer Science, UCSBEmail yang diverifikasi di ucsb.edu
Saket SaurabhProfessor at Institute of Mathematical SciencesEmail yang diverifikasi di imsc.res.in
Dániel MarxCISPA Helmholtz Center for Information SecurityEmail yang diverifikasi di cispa.saarland
Fedor V. FominProfessor of Computer Science, University of BergenEmail yang diverifikasi di uib.no
Lukasz KowalikUniversity of WarsawEmail yang diverifikasi di mimuw.edu.pl
Stefan KratschProfessor at Humboldt University BerlinEmail yang diverifikasi di informatik.hu-berlin.de
Magnus WahlströmRoyal Holloway, University of LondonEmail yang diverifikasi di rhul.ac.uk
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceEmail yang diverifikasi di mini.pw.edu.pl
Manuel SorgeTU WienEmail yang diverifikasi di ac.tuwien.ac.at
Erik Jan van LeeuwenUtrecht University, The NetherlandsEmail yang diverifikasi di uu.nl
Piotr SankowskiUniversity of Warsaw, MIM Solutions,Email yang diverifikasi di mimuw.edu.pl
Tomáš MasaříkUniversity of WarsawEmail yang diverifikasi di mimuw.edu.pl
Tomasz KociumakaMax Planck Institute for Informatics, Saarland Informatics CampusEmail yang diverifikasi di mpi-inf.mpg.de
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyEmail yang diverifikasi di tue.nl
Johan M. M. van RooijUtrecht University (20%) and Valcon (80%)Email yang diverifikasi di uu.nl
Jesper NederlofUtrecht UniversityEmail yang diverifikasi di uu.nl
Yngve VillangerUniversity of BergenEmail yang diverifikasi di uib.no
Vincent Cohen-AddadGoogle Research (former CNRS & Sorbonne Université)Email yang diverifikasi di lip6.fr

Ikuti

Marcin Pilipczuk

Instytut Informatyki, Uniwersytet Warszawski

Email yang diverifikasi di mimuw.edu.pl - Beranda

algorithms parameterized complexity


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Parameterized Algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer, 2015	3160	2015
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM Van Rooij, ... ACM Transactions on Algorithms (TALG) 18 (2), 1-31, 2022	429*	2022
Faster deterministic feedback vertex set T Kociumaka, M Pilipczuk Information Processing Letters 114 (10), 556-560, 2014	132	2014
Designing FPT Algorithms for Cut Problems Using Randomized Contractions R Chitnis, M Cygan, MT Hajiaghayi, M Pilipczuk, M Pilipczuk SIAM Journal on Computing 45 (4), 1171-1229, 2016	117	2016
Tight bounds for Parameterized Complexity of Cluster Editing. FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger STACS 20, 32-43, 2013	110*	2013
Polynomial-time Algorithm for Maximum Weight Independent Set on P₆-free Graphs A Grzesik, T Klimošová, M Pilipczuk, M Pilipczuk ACM Transactions on Algorithms (TALG) 18 (1), 1-57, 2022	109	2022
On multiway cut parameterized above lower bounds M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk ACM Transactions on Computation Theory (TOCT) 5 (1), 3, 2013	108	2013
Subset feedback vertex set is fixed-parameter tractable M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk SIAM Journal on Discrete Mathematics 27 (1), 290-309, 2013	101	2013
Exact and approximate bandwidth M Cygan, M Pilipczuk Theoretical Computer Science 411 (40), 3701-3713, 2010	99	2010
Known algorithms for EDGE CLIQUE COVER are probably optimal M Cygan, M Pilipczuk, M Pilipczuk SIAM Journal on Computing 45 (1), 67-83, 2016	96	2016
Minimum bisection is fixed parameter tractable M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh Proceedings of the 46th Annual ACM Symposium on Theory of Computing, 323-332, 2014	87	2014
The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable M Cygan, D Marx, M Pilipczuk, M Pilipczuk Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on …, 2013	83	2013
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on …, 2014	73	2014
Kernelization and sparseness: the case of dominating set PG Drange, MS Dregi, FV Fomin, S Kreutzer, D Lokshtanov, M Pilipczuk, ... arXiv preprint arXiv:1411.4575, 2014	72	2014
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs M Pilipczuk, M Pilipczuk, P Sankowski, EJV Leeuwen ACM Transactions on Algorithms (TALG) 14 (4), 53, 2018	71*	2018
A fast branching algorithm for cluster vertex deletion A Boral, M Cygan, T Kociumaka, M Pilipczuk Theory of Computing Systems 58 (2), 357-376, 2016	70	2016
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five M Chudnovsky, M Pilipczuk, M Pilipczuk, S Thomassé arXiv preprint arXiv:1903.04761, 2019	64*	2019
Parameterized complexity of eulerian deletion problems M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter Algorithmica 68 (1), 41-61, 2014	61	2014
Clique cover and graph separation: New incompressibility results M Cygan, S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström ACM Transactions on Computation Theory (TOCT) 6 (2), 1-19, 2014	58	2014
On multiway cut parameterized above lower bounds M Cygan, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk Parameterized and Exact Computation: 6th International Symposium, IPEC 2011 …, 2012	58	2012

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama