Michał Pilipczuk

Cituota

	Visi	Nuo 2020
Šaltiniai	8909	5515
h-rodyklė	41	31
i10-rodyklė	122	103

1300

650

325

975

20112012201320142015201620172018201920202021202220232024202535 97 143 198 290 415 582 684 714 873 895 1000 1074 1267 394

Viešas pasiekiamumas

Peržiūrėti viską

101 straipsnis

2 straipsniai

pasiekiami

nepasiekiami

Pagal finansavimo įpareigojimus

Bendraautoriai

Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiPatvirtintas el. paštas mimuw.edu.pl
Marek CyganUniversity of WarsawPatvirtintas el. paštas mimuw.edu.pl
Fedor V. FominProfessor of Computer Science, University of BergenPatvirtintas el. paštas uib.no
Saket SaurabhProfessor at Institute of Mathematical SciencesPatvirtintas el. paštas imsc.res.in
Dániel MarxCISPA Helmholtz Center for Information SecurityPatvirtintas el. paštas cispa.saarland
Daniel LokshtanovProfessor of Computer Science, UCSBPatvirtintas el. paštas ucsb.edu
Sebastian SiebertzUniversität Bremen, AG Theoretische InformatikPatvirtintas el. paštas uni-bremen.de
Lukasz KowalikUniversity of WarsawPatvirtintas el. paštas mimuw.edu.pl
Szymon ToruńczykUniversity of WarsawPatvirtintas el. paštas mimuw.edu.pl
Marcin WrochnaInstitute of Informatics, University of WarsawPatvirtintas el. paštas mimuw.edu.pl
Jesper NederlofUtrecht UniversityPatvirtintas el. paštas uu.nl
Marthe BonamyLaBRI, CNRS, Université BordeauxPatvirtintas el. paštas u-bordeaux.fr
Stephan KreutzerProfessor of Computer Science, Technical University BerlinPatvirtintas el. paštas tu-berlin.de
Pål Grønås DrangeUniversity of Bergen, Department of InformaticsPatvirtintas el. paštas ii.uib.no
Yngve VillangerUniversity of BergenPatvirtintas el. paštas uib.no
Stefan KratschProfessor at Humboldt University BerlinPatvirtintas el. paštas informatik.hu-berlin.de
Erik Jan van LeeuwenUtrecht University, The NetherlandsPatvirtintas el. paštas uu.nl
Roman RabinovichTechnische Universität BerlinPatvirtintas el. paštas tu-berlin.de
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityPatvirtintas el. paštas uu.nl
Magnus WahlströmRoyal Holloway, University of LondonPatvirtintas el. paštas rhul.ac.uk

Stebėti

Michał Pilipczuk

University of Warsaw

Patvirtintas el. paštas mimuw.edu.pl - Pagrindinis puslapis

Parameterized complexity graph theory


Pavadinimas Rūšiuoti pagal šaltinius Rūšiuoti pagal metus Rūšiuoti pagal pavadinimą	Cituota Cituota	Metai
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	3448*	2015
Solving connectivity problems parameterized by treewidth in single exponential time M Cygan, J Nederlof, M Pilipczuk, M Pilipczuk, JMM van Rooij, ... 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 150-159, 2011	429*	2011
A 5-Approximation Algorithm for Treewidth HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ... SIAM Journal on Computing 45 (2), 317-378, 2016	389	2016
Optimal parameterized algorithms for planar facility location problems using voronoi diagrams D Marx, M Pilipczuk ACM Transactions on Algorithms (TALG) 18 (2), 1-64, 2022	120*	2022
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth FV Fomin, D Lokshtanov, S Saurabh, M Pilipczuk, M Wrochna ACM Transactions on Algorithms (TALG) 14 (3), 1-45, 2018	118	2018
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 with a small number of clusters FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger Journal of Computer and System Sciences 80 (7), 1430-1447, 2014	110*	2014
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), 1-11, 2013	109	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
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
Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask) D Marx, M Pilipczuk arXiv preprint arXiv:1307.2187, 2013	91	2013
Minimum bisection is fixed parameter tractable M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	87	2014
The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable M Cygan, D Marx, M Pilipczuk, M Pilipczuk 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 197-206, 2013	84	2013
First-order interpretations of bounded expansion classes J Gajarský, S Kreutzer, J Nešetřil, POD Mendez, M Pilipczuk, S Siebertz, ... ACM Transactions on Computational Logic (TOCL) 21 (4), 1-41, 2020	83	2020
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh SIAM Journal on Computing 46 (1), 161-189, 2017	74	2017
Network sparsification for Steiner problems on planar and bounded-genus graphs M Pilipczuk, M Pilipczuk, P Sankowski, EJ Leeuwen ACM Transactions on Algorithms (TALG) 14 (4), 1-73, 2018	72*	2018
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
Neighborhood complexity and kernelization for nowhere dense classes of graphs K Eickmeyer, AC Giannopoulou, S Kreutzer, O Kwon, M Pilipczuk, ... arXiv preprint arXiv:1612.08197, 2016	70	2016
Problems parameterized by treewidth tractable in single exponential time: A logical approach M Pilipczuk Mathematical Foundations of Computer Science 2011: 36th International …, 2011	70	2011

Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.

Straipsniai 1–20

Šaltinių per metus

Dubliuoti šaltiniai

Sujungti šaltiniai

Pridėti bendraautoriusBendraautoriai

Stebėti

Cituota

Bendraautoriai