Edit Profile (opens in new tab) Pilipczuk, Michał Compute Distance To: Compute Author ID: pilipczuk.michal Published as: Pilipczuk, Michał; Pilipczuk, Michal; Pilipczuk, MichaŁ Homepage: https://www.mimuw.edu.pl/~mp248287/ External Links: MGP · Wikidata · dblp Documents Indexed: 146 Publications since 2010, including 1 Book 3 Contributions as Editor Co-Authors: 97 Co-Authors with 147 Joint Publications 2,286 Co-Co-Authors all top 5 Co-Authors 2 single-authored 65 Pilipczuk, Marcin L. 46 Cygan, Marek 25 Fomin, Fedor V. 18 Wojtaszczyk, Jakub Onufry 17 Lokshtanov, Daniel 16 Wrochna, Marcin 15 Saurabh, Saket 14 Siebertz, Sebastian 10 Bliznets, Ivan A. 9 Bonamy, Marthe 9 Van Leeuwen, Erik Jan 8 Marx, Dániel 7 Giannopoulou, Archontia C. 7 Kowalik, Łukasz 7 Kreutzer, Stephan 6 Drange, Pål Grønås 6 Kratsch, Stefan 6 Villanger, Yngve 5 Bojańczyk, Mikołaj 5 Golovach, Petr A. 5 Komosa, Paweł 5 Paul, Christophe 5 Raymond, Jean-Florent 5 Socała, Arkadiusz 5 Toruńczyk, Szymon 5 Wahlström, Magnus 4 Nederlof, Jesper 4 Ossona de Mendez, Patrice 4 Rabinovich, Roman 4 Rzążewski, Paweł 4 Thilikos, Dimitrios M. 3 Barbero, Florian 3 Chudnovsky, Maria 3 Kwon, Ojoung 3 Nešetřil, Jaroslav 3 Thomassé, Stéphan 3 Wiese, Andreas 2 Chistikov, Dmitry V. 2 Czerwiński, Wojciech 2 Eickmeyer, Kord 2 Gajarský, Jakub 2 Grohe, Martin 2 Grzesik, Andrzej 2 Heggernes, Pinar 2 Hofman, Piotr 2 Jansen, Bart M. P. 2 Klimošová, Tereza 2 Mach, Lukáš 2 Manne, Fredrik 2 Paulusma, Daniël 2 Quiroz, Daniel A. 2 Sankowski, Piotr 2 Schlotter, Ildikó 2 Škrekovski, Riste 2 van den Heuvel, Jan 2 van ’t Hof, Pim 2 Walczak, Bartosz 2 Wehar, Michael 1 Abramovskaya, Tat’yana Viktorovna 1 Adamaszek, Anna 1 Bodlaender, Hans L. 1 Bousquet, Nicolas 1 Briański, Marcin 1 Bringmann, Karl 1 Chitnis, Rajesh Hemant 1 Cohen-Addad, Vincent 1 Defrain, Oscar 1 Dregi, Markus Sortland 1 Dross, François 1 Eiben, Eduard 1 Gabizon, Ariel 1 Ganian, Robert 1 Gavoille, Cyril 1 Hajiaghayi, Mohammad Taghi 1 Heinrich, Marc 1 Kawarabayashi, Ken-ichi 1 King, Jason 1 Kisfaludi-Bak, Sándor 1 Knop, Dušan 1 Kociumaka, Tomasz 1 Masařík, Tomáš 1 Micek, Piotr 1 Misra, Pranabendu 1 Munaro, Andrea 1 Nadara, Wojciech 1 Novotná, Jana 1 Okrasa, Karolina 1 Ordyniak, Sebastian 1 Philip, Geevarghese 1 Reidl, Felix 1 Sánchez Villaamil, Fernando 1 Seweryn, Michał T. 1 Sikdar, Somnath 1 Spirkl, Sophie Theresa 1 van Rooij, Johan M. M. 1 Zehavi, Meirav 1 Zhu, Xuding all top 5 Serials 16 Algorithmica 8 SIAM Journal on Discrete Mathematics 7 SIAM Journal on Computing 7 ACM Transactions on Algorithms 7 ACM Transactions on Computation Theory 4 The Electronic Journal of Combinatorics 4 Theory of Computing Systems 3 Journal of Combinatorial Theory. Series B 3 European Journal of Combinatorics 3 Logical Methods in Computer Science 2 Discrete Applied Mathematics 2 Journal of Computer and System Sciences 2 MATCH - Communications in Mathematical and in Computer Chemistry 2 ACM Transactions on Computational Logic 1 Journal of Graph Theory 1 Theoretical Computer Science 1 Information and Computation 1 Lecture Notes in Computer Science 1 LIPIcs – Leibniz International Proceedings in Informatics all top 5 Fields 128 Computer science (68-XX) 108 Combinatorics (05-XX) 12 Mathematical logic and foundations (03-XX) 11 Operations research, mathematical programming (90-XX) 5 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 4 General and overarching topics; collections (00-XX) 1 Numerical analysis (65-XX) 1 Biology and other natural sciences (92-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 115 Publications have been cited 1,285 times in 895 Documents Cited by ▼ Year ▼ Parameterized algorithms. Zbl 1334.90001Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 439 2015 Solving connectivity problems parameterized by treewidth in single exponential time (extended abstract). Zbl 1292.68122Cygan, Marek; Nederlof, Jesper; Pilipczuk, Marcin; Pilipczuk, Michał; van Rooij, Johan M. M.; Wojtaszczyk, Jakub Onufry 123 2011 A \(c^k n\) 5-approximation algorithm for treewidth. Zbl 1333.05282Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus S.; Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał 72 2016 On multiway cut parameterized above lower bounds. Zbl 1322.68098Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 31 2013 Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. Zbl 1422.68253Marx, Dániel; Pilipczuk, Michał 28 2015 Subset feedback vertex set is fixed-parameter tractable. Zbl 1268.05196Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 25 2013 Designing FPT algorithms for cut problems using randomized contractions. Zbl 1348.68063Chitnis, Rajesh; Cygan, Marek; Hajiaghayi, MohammadTaghi; Pilipczuk, Marcin; Pilipczuk, Michał 21 2016 Minimum bisection is fixed parameter tractable. Zbl 1315.05134Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 21 2014 Kernelization and sparseness: the case of dominating set. Zbl 1388.68110Drange, Pål Grønås; Dregi, Markus; Fomin, Fedor V.; Kreutzer, Stephan; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Reidl, Felix; Sánchez Villaamil, Fernando; Saurabh, Saket; Siebertz, Sebastian; Sikdar, Somnath 19 2016 Tight bounds for parameterized complexity of cluster editing with a small number of clusters. Zbl 1311.68076Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve 19 2014 Problems parameterized by treewidth tractable in single exponential time: a logical approach. Zbl 1343.68120Pilipczuk, Michał 18 2011 Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask). Zbl 1359.68139Marx, Dániel; Pilipczuk, Michał 15 2014 Polynomial-time algorithm for maximum weight independent set on \(P_6\)-free graphs. Zbl 1431.68047Grzesik, Andrzej; Klimošová, Tereza; Pilipczuk, Marcin; Pilipczuk, Michał 15 2019 Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. Zbl 1358.05284Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 13 2017 Parameterized complexity of Eulerian deletion problems. Zbl 1284.05157Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó 13 2014 Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 12 2014 Subset feedback vertex set is fixed-parameter tractable. Zbl 1334.68096Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 12 2011 A polynomial kernel for trivially perfect editing. Zbl 1466.68045Drange, Pål Grønås; Pilipczuk, Michał 11 2015 On multiway cut parameterized above lower bounds. Zbl 1352.68100Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 11 2012 On the hardness of losing width. Zbl 1290.68045Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 11 2014 Subexponential-time parameterized algorithm for Steiner tree on planar graphs. Zbl 1354.68132Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; Van Leeuwen, Erik Jan 10 2013 Fixed-parameter tractability of multicut in directed acyclic graphs. Zbl 1326.05053Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Wahlström, Magnus 10 2015 Known algorithms for edge clique cover are probably optimal. Zbl 1329.05216Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał 10 2016 Kernelization hardness of connectivity problems in \(d\)-degenerate graphs. Zbl 1309.68079Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 9 2010 Dominating set is fixed parameter tractable in claw-free graphs. Zbl 1228.68030Cygan, Marek; Philip, Geevarghese; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 9 2011 Exploring the subexponential complexity of completion problems. Zbl 1347.68180Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve 8 2015 A subexponential parameterized algorithm for proper interval completion. Zbl 1330.68102Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał 8 2015 Exploring subexponential parameterized complexity of completion problems. Zbl 1359.68126Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve 8 2014 Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. Zbl 1395.68359Fomin, Fedor V.; Pilipczuk, Michał 8 2013 Finding a maximum induced degenerate subgraph faster than \(2^{n}\). Zbl 1374.68726Pilipczuk, Marcin; Pilipczuk, Michał 8 2012 Polynomial bounds for centered colorings on proper minor-closed graph classes. Zbl 1434.05056Pilipczuk, Michał; Siebertz, Sebastian 8 2019 Neighborhood complexity and kernelization for nowhere dense classes of graphs. Zbl 1441.68176Eickmeyer, Kord; Giannopoulou, Archontia C.; Kreutzer, Stephan; Kwon, O-Joung; Pilipczuk, Michał; Rabinovich, Roman; Siebertz, Sebastian 7 2017 Network sparsification for Steiner problems on planar and bounded-genus graphs. Zbl 1454.68114Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; van Leeuwen, Erik Jan 6 2018 The stubborn problem is stubborn no more: a polynomial algorithm for 3-compatible colouring and the stubborn List partition problem. Zbl 1376.68063Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 6 2011 Clique cover and graph separation: new incompressibility results. Zbl 1321.68302Cygan, Marek; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Wahlström, Magnus 6 2014 Some results on Vizing’s conjecture and related problems. Zbl 1251.05126Pilipczuk, Marcin; Pilipczuk, Michał; Škrekovski, Riste 6 2012 Polynomial kernelization for removing induced claws and diamonds. Zbl 1368.68222Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; van Leeuwen, Erik Jan; Wrochna, Marcin 6 2017 Subexponential parameterized algorithm for interval completion. Zbl 1410.68282Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał 5 2016 Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Zbl 1457.05110Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Pilipczuk, Michał; Wrochna, Marcin 5 2018 Fast algorithms for parameterized problems with relaxed disjointness constraints. Zbl 1432.68193Gabizon, Ariel; Lokshtanov, Daniel; Pilipczuk, Michał 5 2015 Definability equals recognizability for graphs of bounded treewidth. Zbl 1394.03062Bojańczyk, Mikołaj; Pilipczuk, Michał 5 2016 Optimizing tree decompositions in MSO. Zbl 1402.68140Bojańczyk, Mikołaj; Pilipczuk, Michał 5 2017 Tight bounds for parameterized complexity of cluster editing. Zbl 1354.68119Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve 5 2013 Parameterized complexity of Eulerian deletion problems. Zbl 1341.05141Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó 5 2011 Kernelization hardness of connectivity problems in \(d\)-degenerate graphs. Zbl 1252.05100Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 5 2012 Scheduling partially ordered jobs faster than \(2^{n }\). Zbl 1346.90336Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 5 2011 Lower bounds for the parameterized complexity of minimum fill-in and other completion problems. Zbl 1410.68281Bliznets, Ivan; Cygan, Marek; Komosa, Paweł; Mach, Lukáš; Pilipczuk, Michał 4 2016 Exploring the complexity of layout parameters in tournaments and semicomplete digraphs. Zbl 1454.68055Barbero, Florian; Paul, Christophe; Pilipczuk, MichaŁ 4 2018 Polynomial kernelization for removing induced claws and diamonds. Zbl 1362.68104Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; van Leeuwen, Erik Jan; Wrochna, Marcin 4 2016 On cutwidth parameterized by vertex cover. Zbl 1303.05185Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 4 2014 Solving the 2-disjoint connected subgraphs problem faster than \(2^n\). Zbl 1306.05125Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 4 2014 An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion. Zbl 1309.68090Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 4 2010 On the hardness of losing width. Zbl 1352.68089Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 4 2012 Shortest paths in one-counter systems. Zbl 1475.68147Chistikov, Dmitry; Czerwiński, Wojciech; Hofman, Piotr; Pilipczuk, Michał; Wehar, Michael 4 2016 On the inequality between radius and Randić index for graphs. Zbl 1289.05060Cygan, Marek; Pilipczuk, Michał 4 2012 Fixed-parameter tractability of multicut in directed acyclic graphs. Zbl 1272.68158Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Wahlström, Magnus 4 2012 On group feedback vertex set parameterized by the size of the cutset. Zbl 1331.68100Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał 4 2012 Relation between Randić index and average distance of trees. Zbl 1265.05140Cygan, Marek; Pilipczuk, Michał; Škrekovski, Riste. 4 2011 On low rank-width colorings. Zbl 1428.05110Kwon, O-joung; Pilipczuk, Michał; Siebertz, Sebastian 4 2020 Enumerating minimal dominating sets in \(K_t\)-free graphs and variants. Zbl 07342482Bonamy, Marthe; Defrain, Oscar; Heinrich, Marc; Pilipczuk, Michał; Raymond, Jean-Florent 4 2020 First-order interpretations of bounded expansion classes. Zbl 1446.68094Gajarský, Jakub; Kreutzer, Stephan; Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michał; Siebertz, Sebastian; Toruńczyk, Szymon 4 2020 Cutwidth: obstructions and algorithmic aspects. Zbl 1398.68236Giannopoulou, Archontia C.; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin 4 2017 A subexponential parameterized algorithm for proper interval completion. Zbl 1330.68101Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał 4 2014 Linear kernels for edge deletion problems to immersion-closed graph classes. Zbl 1441.68185Giannopoulou, Archontia C.; Pilipczuk, Michal; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin 4 2017 On the number of types in sparse graphs. Zbl 1453.03031Pilipczuk, Michał; Siebertz, Sebastian; Toruńczyk, Szymon 4 2018 Shorter labeling schemes for planar graphs. Zbl 07304050Bonamy, Marthe; Gavoille, Cyril; Pilipczuk, Michał 4 2020 Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Zbl 1410.05201Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał; Saurabh, Saket; Wrochna, Marcin 3 2017 A polynomial kernel for trivially perfect editing. Zbl 1397.05070Drange, Pål Grønås; Pilipczuk, Michał 3 2018 Cutwidth: obstructions and algorithmic aspects. Zbl 1414.68035Giannopoulou, Archontia C.; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin 3 2019 On space efficiency of algorithms working on structural decompositions of graphs. Zbl 1388.68133Pilipczuk, Michał; Wrochna, Marcin 3 2016 Hitting forbidden subgraphs in graphs of bounded treewidth. Zbl 1376.68062Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał 3 2017 Lower bounds for approximation schemes for Closest String. Zbl 1378.68203Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal; Saurabh, Saket 3 2016 Computing tree-depth faster than \(2^n\). Zbl 1337.68129Fomin, Fedor V.; Giannopoulou, Archontia C.; Pilipczuk, Michał 3 2015 On cutwidth parameterized by vertex cover. Zbl 1352.68099Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 3 2012 Largest chordal and interval subgraphs faster than \(2^{n }\). Zbl 1394.68164Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve 3 2013 Clique cover and graph separation: new incompressibility results. Zbl 1272.68152Cygan, Marek; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Wahlström, Magnus 3 2012 An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion. Zbl 1252.68150Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 3 2012 A polynomial algorithm for 3-compatible coloring and the stubborn list partition problem (the stubborn problem is stubborn no more). Zbl 1254.05056Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 3 2012 Hardness of approximation for strip packing. Zbl 1427.68100Adamaszek, Anna; Kociumaka, Tomasz; Pilipczuk, Marcin; Pilipczuk, Michał 3 2017 On space efficiency of algorithms working on structural decompositions of graphs. Zbl 1427.68130Pilipczuk, Michał; Wrochna, Marcin 3 2017 How to hunt an invisible rabbit on a graph. Zbl 1327.05233Abramovskaya, Tatjana V.; Fomin, Fedor V.; Golovach, Petr A.; Pilipczuk, Michał 3 2016 On group feedback vertex set parameterized by the size of the cutset. Zbl 1336.68121Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał 3 2016 Subexponential parameterized algorithm for {Interval Completion}. Zbl 1454.68094Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał 2 2018 Minimum bisection is fixed-parameter tractable. Zbl 1421.68069Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 2 2019 Jungles, bundles, and fixed-parameter tractability. Zbl 1421.68221Fomin, Fedor V.; Pilipczuk, Michal 2 2013 Known algorithms for edge clique cover are probably optimal. Zbl 1423.05130Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michal 2 2013 On low rank-width colorings. Zbl 1483.05185Kwon, O-joung; Pilipczuk, Michał; Siebertz, Sebastian 2 2017 Largest chordal and interval subgraphs faster than \(2^n\). Zbl 1347.05236Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve 2 2016 On width measures and topological problems on semi-complete digraphs. Zbl 1415.05063Fomin, Fedor V.; Pilipczuk, Michał 2 2019 Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. Zbl 1354.68302Pilipczuk, Michał 2 2013 Computing tree-depth faster than \(2^{n }\). Zbl 1406.68039Fomin, Fedor V.; Giannopoulou, Archontia C.; Pilipczuk, Michał 2 2013 Sitting closer to friends than enemies, revisited. Zbl 1365.68351Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 2 2012 Subexponential-time algorithms for finding large induced sparse subgraphs. Zbl 1469.05159Novotná, Jana; Okrasa, Karolina; Pilipczuk, Michał; Rzążewski, Paweł; van Leeuwen, Erik Jan; Walczak, Bartosz 2 2021 First-order interpretations of bounded expansion classes. Zbl 07376053Gajarský, Jakub; Kreutzer, Stephan; Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michal; Siebertz, Sebastian; Toruńczyk, Szymon 2 2018 Clustering powers of sparse graphs. Zbl 1451.05131Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michał; Zhu, Xuding 2 2020 The generalised colouring numbers on classes of bounded expansion. Zbl 1398.05089Kreutzer, Stephan; Pilipczuk, Michał; Rabinovich, Roman; Siebertz, Sebastian 2 2016 Edge bipartization faster than \(2^k\). Zbl 1398.68406Pilipczuk, Marcin; Pilipczuk, Michał; Wrochna, Marcin 2 2017 Scheduling partially ordered jobs faster than \(2^n\). Zbl 1360.90124Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 2 2014 Quasi-polynomial time approximation schemes for the maximum weight independent set problem in \(H\)-free graphs. Zbl 07304163Chudnovsky, Maria; Pilipczuk, Marcin; Pilipczuk, Michał; Thomassé, Stéphan 2 2020 Strong immersion is a well-quasi-ordering for semicomplete digraphs. Zbl 1414.05273Barbero, Florian; Paul, Christophe; Pilipczuk, Michał 1 2019 Subexponential-time algorithms for finding large induced sparse subgraphs. Zbl 1469.05159Novotná, Jana; Okrasa, Karolina; Pilipczuk, Michał; Rzążewski, Paweł; van Leeuwen, Erik Jan; Walczak, Bartosz 2 2021 Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs. Zbl 07333296Pilipczuk, Michał; Siebertz, Sebastian 1 2021 Erdös-Hajnal properties for powers of sparse graphs. Zbl 1460.05103Briański, Marcin; Micek, Piotr; Pilipczuk, Michał; Seweryn, Michał T. 1 2021 On low rank-width colorings. Zbl 1428.05110Kwon, O-joung; Pilipczuk, Michał; Siebertz, Sebastian 4 2020 Enumerating minimal dominating sets in \(K_t\)-free graphs and variants. Zbl 07342482Bonamy, Marthe; Defrain, Oscar; Heinrich, Marc; Pilipczuk, Michał; Raymond, Jean-Florent 4 2020 First-order interpretations of bounded expansion classes. Zbl 1446.68094Gajarský, Jakub; Kreutzer, Stephan; Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michał; Siebertz, Sebastian; Toruńczyk, Szymon 4 2020 Shorter labeling schemes for planar graphs. Zbl 07304050Bonamy, Marthe; Gavoille, Cyril; Pilipczuk, Michał 4 2020 Clustering powers of sparse graphs. Zbl 1451.05131Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michał; Zhu, Xuding 2 2020 Quasi-polynomial time approximation schemes for the maximum weight independent set problem in \(H\)-free graphs. Zbl 07304163Chudnovsky, Maria; Pilipczuk, Marcin; Pilipczuk, Michał; Thomassé, Stéphan 2 2020 Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. Zbl 1433.68307Pilipczuk, Michał; van Leeuwen, Erik Jan; Wiese, Andreas 1 2020 On the maximum weight independent set problem in graphs without induced cycles of length at least five. Zbl 1459.05234Chudnovsky, Maria; Pilipczuk, Marcin; Pilipczuk, Michał; Thomassé, Stéphan 1 2020 Polynomial-time algorithm for maximum weight independent set on \(P_6\)-free graphs. Zbl 1431.68047Grzesik, Andrzej; Klimošová, Tereza; Pilipczuk, Marcin; Pilipczuk, Michał 15 2019 Polynomial bounds for centered colorings on proper minor-closed graph classes. Zbl 1434.05056Pilipczuk, Michał; Siebertz, Sebastian 8 2019 Cutwidth: obstructions and algorithmic aspects. Zbl 1414.68035Giannopoulou, Archontia C.; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin 3 2019 Minimum bisection is fixed-parameter tractable. Zbl 1421.68069Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 2 2019 On width measures and topological problems on semi-complete digraphs. Zbl 1415.05063Fomin, Fedor V.; Pilipczuk, Michał 2 2019 Strong immersion is a well-quasi-ordering for semicomplete digraphs. Zbl 1414.05273Barbero, Florian; Paul, Christophe; Pilipczuk, Michał 1 2019 Integer programming and incidence treedepth. Zbl 1436.90083Eiben, Eduard; Ganian, Robert; Knop, Dušan; Ordyniak, Sebastian; Pilipczuk, Michał; Wrochna, Marcin 1 2019 Network sparsification for Steiner problems on planar and bounded-genus graphs. Zbl 1454.68114Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; van Leeuwen, Erik Jan 6 2018 Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Zbl 1457.05110Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Pilipczuk, Michał; Wrochna, Marcin 5 2018 Exploring the complexity of layout parameters in tournaments and semicomplete digraphs. Zbl 1454.68055Barbero, Florian; Paul, Christophe; Pilipczuk, MichaŁ 4 2018 On the number of types in sparse graphs. Zbl 1453.03031Pilipczuk, Michał; Siebertz, Sebastian; Toruńczyk, Szymon 4 2018 A polynomial kernel for trivially perfect editing. Zbl 1397.05070Drange, Pål Grønås; Pilipczuk, Michał 3 2018 Subexponential parameterized algorithm for {Interval Completion}. Zbl 1454.68094Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał 2 2018 First-order interpretations of bounded expansion classes. Zbl 07376053Gajarský, Jakub; Kreutzer, Stephan; Nešetřil, Jaroslav; Ossona de Mendez, Patrice; Pilipczuk, Michal; Siebertz, Sebastian; Toruńczyk, Szymon 2 2018 Below all subsets for minimal connected dominating set. Zbl 1396.05052Lokshtanov, Daniel; Pilipczuk, Michał; Saurabh, Saket 1 2018 Hardness of approximation for \(H\)-free edge modification problems. Zbl 1427.68105Bliznets, Ivan; Cygan, Marek; Komosa, Paweł; Pilipczuk, Michał 1 2018 Parameterized circuit complexity of model-checking on sparse structures. Zbl 07298804Pilipczuk, Michał; Siebertz, Sebastian; Toruńczyk, Szymon 1 2018 Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. Zbl 1358.05284Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 13 2017 Neighborhood complexity and kernelization for nowhere dense classes of graphs. Zbl 1441.68176Eickmeyer, Kord; Giannopoulou, Archontia C.; Kreutzer, Stephan; Kwon, O-Joung; Pilipczuk, Michał; Rabinovich, Roman; Siebertz, Sebastian 7 2017 Polynomial kernelization for removing induced claws and diamonds. Zbl 1368.68222Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; van Leeuwen, Erik Jan; Wrochna, Marcin 6 2017 Optimizing tree decompositions in MSO. Zbl 1402.68140Bojańczyk, Mikołaj; Pilipczuk, Michał 5 2017 Cutwidth: obstructions and algorithmic aspects. Zbl 1398.68236Giannopoulou, Archontia C.; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin 4 2017 Linear kernels for edge deletion problems to immersion-closed graph classes. Zbl 1441.68185Giannopoulou, Archontia C.; Pilipczuk, Michal; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin 4 2017 Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Zbl 1410.05201Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał; Saurabh, Saket; Wrochna, Marcin 3 2017 Hitting forbidden subgraphs in graphs of bounded treewidth. Zbl 1376.68062Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał 3 2017 Hardness of approximation for strip packing. Zbl 1427.68100Adamaszek, Anna; Kociumaka, Tomasz; Pilipczuk, Marcin; Pilipczuk, Michał 3 2017 On space efficiency of algorithms working on structural decompositions of graphs. Zbl 1427.68130Pilipczuk, Michał; Wrochna, Marcin 3 2017 On low rank-width colorings. Zbl 1483.05185Kwon, O-joung; Pilipczuk, Michał; Siebertz, Sebastian 2 2017 Edge bipartization faster than \(2^k\). Zbl 1398.68406Pilipczuk, Marcin; Pilipczuk, Michał; Wrochna, Marcin 2 2017 Tight lower bounds for the complexity of multicoloring. Zbl 1434.68186Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin 1 2017 A \(c^k n\) 5-approximation algorithm for treewidth. Zbl 1333.05282Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus S.; Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał 72 2016 Designing FPT algorithms for cut problems using randomized contractions. Zbl 1348.68063Chitnis, Rajesh; Cygan, Marek; Hajiaghayi, MohammadTaghi; Pilipczuk, Marcin; Pilipczuk, Michał 21 2016 Kernelization and sparseness: the case of dominating set. Zbl 1388.68110Drange, Pål Grønås; Dregi, Markus; Fomin, Fedor V.; Kreutzer, Stephan; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Reidl, Felix; Sánchez Villaamil, Fernando; Saurabh, Saket; Siebertz, Sebastian; Sikdar, Somnath 19 2016 Known algorithms for edge clique cover are probably optimal. Zbl 1329.05216Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał 10 2016 Subexponential parameterized algorithm for interval completion. Zbl 1410.68282Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał 5 2016 Definability equals recognizability for graphs of bounded treewidth. Zbl 1394.03062Bojańczyk, Mikołaj; Pilipczuk, Michał 5 2016 Lower bounds for the parameterized complexity of minimum fill-in and other completion problems. Zbl 1410.68281Bliznets, Ivan; Cygan, Marek; Komosa, Paweł; Mach, Lukáš; Pilipczuk, Michał 4 2016 Polynomial kernelization for removing induced claws and diamonds. Zbl 1362.68104Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; van Leeuwen, Erik Jan; Wrochna, Marcin 4 2016 Shortest paths in one-counter systems. Zbl 1475.68147Chistikov, Dmitry; Czerwiński, Wojciech; Hofman, Piotr; Pilipczuk, Michał; Wehar, Michael 4 2016 On space efficiency of algorithms working on structural decompositions of graphs. Zbl 1388.68133Pilipczuk, Michał; Wrochna, Marcin 3 2016 Lower bounds for approximation schemes for Closest String. Zbl 1378.68203Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal; Saurabh, Saket 3 2016 How to hunt an invisible rabbit on a graph. Zbl 1327.05233Abramovskaya, Tatjana V.; Fomin, Fedor V.; Golovach, Petr A.; Pilipczuk, Michał 3 2016 On group feedback vertex set parameterized by the size of the cutset. Zbl 1336.68121Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał 3 2016 Largest chordal and interval subgraphs faster than \(2^n\). Zbl 1347.05236Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve 2 2016 The generalised colouring numbers on classes of bounded expansion. Zbl 1398.05089Kreutzer, Stephan; Pilipczuk, Michał; Rabinovich, Roman; Siebertz, Sebastian 2 2016 Hardness of approximation for \(H\)-free edge modification problems. Zbl 1398.68188Bliznets, Ivan; Cygan, Marek; Komosa, Paweł; Pilipczuk, Michał 1 2016 Parameterized algorithms. Zbl 1334.90001Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 439 2015 Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. Zbl 1422.68253Marx, Dániel; Pilipczuk, Michał 28 2015 A polynomial kernel for trivially perfect editing. Zbl 1466.68045Drange, Pål Grønås; Pilipczuk, Michał 11 2015 Fixed-parameter tractability of multicut in directed acyclic graphs. Zbl 1326.05053Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Wahlström, Magnus 10 2015 Exploring the subexponential complexity of completion problems. Zbl 1347.68180Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve 8 2015 A subexponential parameterized algorithm for proper interval completion. Zbl 1330.68102Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał 8 2015 Fast algorithms for parameterized problems with relaxed disjointness constraints. Zbl 1432.68193Gabizon, Ariel; Lokshtanov, Daniel; Pilipczuk, Michał 5 2015 Computing tree-depth faster than \(2^n\). Zbl 1337.68129Fomin, Fedor V.; Giannopoulou, Archontia C.; Pilipczuk, Michał 3 2015 Linear kernels for outbranching problems in sparse digraphs. Zbl 1378.68062Bonamy, Marthe; Kowalik, Łukasz; Pilipczuk, Michał; Socała, Arkadiusz 1 2015 Sitting closer to friends than enemies, revisited. Zbl 1312.05067Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 1 2015 Minimum bisection is fixed parameter tractable. Zbl 1315.05134Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 21 2014 Tight bounds for parameterized complexity of cluster editing with a small number of clusters. Zbl 1311.68076Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve 19 2014 Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask). Zbl 1359.68139Marx, Dániel; Pilipczuk, Michał 15 2014 Parameterized complexity of Eulerian deletion problems. Zbl 1284.05157Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó 13 2014 Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał 12 2014 On the hardness of losing width. Zbl 1290.68045Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 11 2014 Exploring subexponential parameterized complexity of completion problems. Zbl 1359.68126Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve 8 2014 Clique cover and graph separation: new incompressibility results. Zbl 1321.68302Cygan, Marek; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Wahlström, Magnus 6 2014 On cutwidth parameterized by vertex cover. Zbl 1303.05185Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 4 2014 Solving the 2-disjoint connected subgraphs problem faster than \(2^n\). Zbl 1306.05125Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 4 2014 A subexponential parameterized algorithm for proper interval completion. Zbl 1330.68101Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał 4 2014 Scheduling partially ordered jobs faster than \(2^n\). Zbl 1360.90124Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 2 2014 On multiway cut parameterized above lower bounds. Zbl 1322.68098Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 31 2013 Subset feedback vertex set is fixed-parameter tractable. Zbl 1268.05196Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 25 2013 Subexponential-time parameterized algorithm for Steiner tree on planar graphs. Zbl 1354.68132Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; Van Leeuwen, Erik Jan 10 2013 Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. Zbl 1395.68359Fomin, Fedor V.; Pilipczuk, Michał 8 2013 Tight bounds for parameterized complexity of cluster editing. Zbl 1354.68119Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve 5 2013 Largest chordal and interval subgraphs faster than \(2^{n }\). Zbl 1394.68164Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve 3 2013 Jungles, bundles, and fixed-parameter tractability. Zbl 1421.68221Fomin, Fedor V.; Pilipczuk, Michal 2 2013 Known algorithms for edge clique cover are probably optimal. Zbl 1423.05130Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michal 2 2013 Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. Zbl 1354.68302Pilipczuk, Michał 2 2013 Computing tree-depth faster than \(2^{n }\). Zbl 1406.68039Fomin, Fedor V.; Giannopoulou, Archontia C.; Pilipczuk, Michał 2 2013 On multiway cut parameterized above lower bounds. Zbl 1352.68100Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 11 2012 Finding a maximum induced degenerate subgraph faster than \(2^{n}\). Zbl 1374.68726Pilipczuk, Marcin; Pilipczuk, Michał 8 2012 Some results on Vizing’s conjecture and related problems. Zbl 1251.05126Pilipczuk, Marcin; Pilipczuk, Michał; Škrekovski, Riste 6 2012 Kernelization hardness of connectivity problems in \(d\)-degenerate graphs. Zbl 1252.05100Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 5 2012 On the hardness of losing width. Zbl 1352.68089Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 4 2012 On the inequality between radius and Randić index for graphs. Zbl 1289.05060Cygan, Marek; Pilipczuk, Michał 4 2012 Fixed-parameter tractability of multicut in directed acyclic graphs. Zbl 1272.68158Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Wahlström, Magnus 4 2012 On group feedback vertex set parameterized by the size of the cutset. Zbl 1331.68100Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał 4 2012 On cutwidth parameterized by vertex cover. Zbl 1352.68099Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 3 2012 Clique cover and graph separation: new incompressibility results. Zbl 1272.68152Cygan, Marek; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Wahlström, Magnus 3 2012 An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion. Zbl 1252.68150Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry 3 2012 ...and 15 more Documents all cited Publications top 5 cited Publications all top 5 Cited by 1,033 Authors 75 Saurabh, Saket 52 Pilipczuk, Michał 44 Fomin, Fedor V. 38 Lokshtanov, Daniel 38 Pilipczuk, Marcin L. 34 Sau, Ignasi 31 Golovach, Petr A. 30 Zehavi, Meirav 25 Niedermeier, Rolf 25 Thilikos, Dimitrios M. 24 Jansen, Bart M. P. 23 Panolan, Fahad 22 Raman, Venkatesh 22 Ramanujan, M. S. 21 Bodlaender, Hans L. 21 Kratsch, Stefan 21 Marx, Dániel 21 Van Leeuwen, Erik Jan 20 Otachi, Yota 19 Ganian, Robert 18 Cygan, Marek 18 Gutin, Gregory Z. 18 Paulusma, Daniël 16 Agrawal, Akanksha 16 Komusiewicz, Christian 16 van Bevern, René 16 Wang, Jianxin 15 Baste, Julien 15 Hanaka, Tesshu 15 Misra, Neeldhara 15 Ordyniak, Sebastian 15 Paul, Christophe 15 Philip, Geevarghese 15 Sorge, Manuel 14 Bonnet, Edouard 14 Eiben, Eduard 14 Lampis, Michael 13 Kwon, Ojoung 13 Rzążewski, Paweł 13 Tale, Prafullkumar 13 Wahlström, Magnus 12 Feng, Qilong 12 Molter, Hendrik 12 Ono, Hirotaka 11 Hermelin, Danny 11 Knop, Dušan 11 Kolay, Sudeshna 11 Suchý, Ondřej 10 Bredereck, Robert 10 Fernau, Henning 10 Fluschnik, Till 10 Heggernes, Pinar 10 Krithika, R. 10 Majumdar, Diptapriyo 10 Mnich, Matthias 10 Mouawad, Amer E. 10 Nichterlein, André 10 Siebertz, Sebastian 9 Belmonte, Rémy 9 Mertzios, George B. 9 Reidl, Felix 8 Bousquet, Nicolas 8 Cao, Yixin 8 Chen, Jian-er 8 Chitnis, Rajesh Hemant 8 Feldmann, Andreas Emil 8 Kobayashi, Yasuaki 8 Kobayashi, Yusuke 8 Kowalik, Łukasz 8 Kratsch, Dieter 8 Li, Shaohua 8 Misra, Pranabendu 8 Szeider, Stefan 8 Thomassé, Stéphan 7 Bergougnoux, Benjamin 7 Gupta, Sushmita 7 Johnson, Matthew 7 Kanté, Mamadou Moustapha 7 Kim, Eunjung 7 Kisfaludi-Bak, Sándor 7 Kiyomi, Masashi 7 Lima, Paloma T. 7 Rai, Ashutosh 7 Sikora, Florian 7 Wojtaszczyk, Jakub Onufry 7 Wrochna, Marcin 7 Yeo, Anders 6 Dabrowski, Konrad Kazimierz 6 Drange, Pål Grønås 6 Giannopoulou, Archontia C. 6 Jaffke, Lars 6 Kawarabayashi, Ken-ichi 6 Li, Wenjun 6 Liedloff, Mathieu 6 Masařík, Tomáš 6 Papadopoulos, Charis 6 van der Zanden, Tom C. 6 Villanger, Yngve 5 Araújo, Júlio César Silva 5 Aravind, N. R. ...and 933 more Authors all top 5 Cited in 70 Serials 133 Algorithmica 113 Theoretical Computer Science 65 Discrete Applied Mathematics 62 Journal of Computer and System Sciences 52 SIAM Journal on Discrete Mathematics 34 Theory of Computing Systems 25 Information Processing Letters 19 SIAM Journal on Computing 17 Journal of Combinatorial Optimization 14 Information and Computation 13 European Journal of Combinatorics 12 Artificial Intelligence 12 Discrete Mathematics 8 Journal of Graph Algorithms and Applications 8 Logical Methods in Computer Science 7 Journal of Combinatorial Theory. Series B 7 The Electronic Journal of Combinatorics 6 Journal of Discrete Algorithms 5 Journal of Scheduling 5 Discrete Optimization 4 Computer Science Review 3 Computers & Operations Research 3 Annals of Operations Research 3 ACM Transactions on Computation Theory 2 Applied Mathematics and Computation 2 Operations Research 2 Operations Research Letters 2 Discrete & Computational Geometry 2 International Journal of Foundations of Computer Science 2 European Journal of Operational Research 2 Mathematical Programming. Series A. Series B 2 The Journal of Artificial Intelligence Research (JAIR) 2 Fundamenta Informaticae 2 Journal of Applied and Computational Topology 1 Rocky Mountain Journal of Mathematics 1 Bulletin of Mathematical Biology 1 Moscow University Computational Mathematics and Cybernetics 1 Advances in Applied Mathematics 1 Mathematical Social Sciences 1 Combinatorica 1 Acta Mathematica Hungarica 1 Social Choice and Welfare 1 Graphs and Combinatorics 1 Journal of Symbolic Computation 1 Machine Learning 1 Computational Geometry 1 Historia Mathematica 1 Distributed Computing 1 Computational Complexity 1 Computational Optimization and Applications 1 International Journal of Computer Vision 1 Annals of Mathematics and Artificial Intelligence 1 Discussiones Mathematicae. Graph Theory 1 Data Mining and Knowledge Discovery 1 Journal of the European Mathematical Society (JEMS) 1 RAIRO. Operations Research 1 Quantum Information Processing 1 Sibirskie Èlektronnye Matematicheskie Izvestiya 1 Proceedings of the Steklov Institute of Mathematics 1 Optimization Letters 1 Asian-European Journal of Mathematics 1 Discrete Mathematics, Algorithms and Applications 1 Algorithms 1 Science China. Information Sciences 1 RAIRO. Theoretical Informatics and Applications 1 ACM Transactions on Algorithms 1 Journal of the Operations Research Society of China 1 Bulletin of the Hellenic Mathematical Society 1 AIMS Mathematics 1 Advances in Combinatorics all top 5 Cited in 22 Fields 733 Computer science (68-XX) 564 Combinatorics (05-XX) 114 Operations research, mathematical programming (90-XX) 32 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 16 Mathematical logic and foundations (03-XX) 11 Biology and other natural sciences (92-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 3 General algebraic systems (08-XX) 3 Linear and multilinear algebra; matrix theory (15-XX) 3 Statistics (62-XX) 2 History and biography (01-XX) 2 Number theory (11-XX) 2 Convex and discrete geometry (52-XX) 2 Probability theory and stochastic processes (60-XX) 1 General and overarching topics; collections (00-XX) 1 Commutative algebra (13-XX) 1 Category theory; homological algebra (18-XX) 1 Group theory and generalizations (20-XX) 1 Algebraic topology (55-XX) 1 Manifolds and cell complexes (57-XX) 1 Numerical analysis (65-XX) 1 Quantum theory (81-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.