Edit Profile (opens in new tab) Dabrowski, Konrad Kazimierz Co-Author Distance Author ID: dabrowski.konrad-kazimierz Published as: Dabrowski, Konrad K.; Dabrowski, Konrad; Dabrowski, Konrad Kazimierz; Kazimierz Dabrowski, Konrad more...less External Links: MGP · ORCID · dblp Documents Indexed: 58 Publications since 2010, including 1 Additional arXiv Preprint 2 Contributions as Editor Co-Authors: 45 Co-Authors with 60 Joint Publications 1,525 Co-Co-Authors all top 5 Co-Authors 0 single-authored 49 Paulusma, Daniël 19 Johnson, Matthew 14 Lozin, Vadim Vladislavovich 7 Bonamy, Marthe 7 Dross, François 6 Feghali, Carl 6 Golovach, Petr A. 6 Huang, Shenwei 6 Zamaraev, Victor A. 4 Brandstädt, Andreas 4 van ’t Hof, Pim 3 Blanché, Alexandre 3 Jeong, Jisu 3 Kanté, Mamadou Moustapha 3 Oum, Sang-Il 3 Paesani, Giacomo 3 Rzążewski, Paweł 2 Alves, Sancrey Rodrigues 2 Bulteau, Laurent 2 Faria, Luerbio 2 Gadouleau, Maximilien 2 Georgiou, Nicholas 2 Klein, Sulamita 2 Masařík, Tomáš 2 Mertzios, George B. 2 Müller, Haiko 2 Novotná, Jana 2 Ordyniak, Sebastian 2 Raman, Rajiv 2 Rautenbach, Dieter 2 Ries, Bernard 2 Sau, Ignasi 2 Thilikos, Dimitrios M. 1 Bousquet, Nicolas 1 de Werra, Dominique 1 Demange, Marc 1 dos Santos Souza, Uéverton 1 Fertin, Guillaume 1 Jonsson, Peter 1 Köhler, Noleen 1 Osipov, George 1 Pierron, Théo 1 Souza, Uéverton S. 1 Stacho, Juraj 1 Vialette, Stéphane all top 5 Serials 5 Journal of Computer and System Sciences 5 Journal of Graph Theory 3 Discrete Applied Mathematics 3 Information Processing Letters 3 Theoretical Computer Science 3 Algorithmica 2 Discrete Mathematics 2 SIAM Journal on Discrete Mathematics 1 Artificial Intelligence 1 European Journal of Combinatorics 1 Order 1 Graphs and Combinatorics 1 Journal of Discrete Algorithms 1 London Mathematical Society Lecture Note Series Fields 55 Combinatorics (05-XX) 30 Computer science (68-XX) 2 General and overarching topics; collections (00-XX) 1 Order, lattices, ordered algebraic structures (06-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 52 Publications have been cited 364 times in 196 Documents Cited by ▼ Year ▼ Colouring vertices of triangle-free graphs without forests. Zbl 1237.05071 Dabrowski, Konrad K.; Lozin, Vadim; Raman, Rajiv; Ries, Bernard 29 2012 New results on maximum induced matchings in bipartite graphs and beyond. Zbl 1267.68118 Dabrowski, Konrad K.; Demange, Marc; Lozin, Vadim V. 27 2013 Clique-width for hereditary graph classes. Zbl 1476.05175 Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 22 2019 Colouring of graphs with Ramsey-type forbidden subgraphs. Zbl 1279.68104 Dabrowski, Konrad K.; Golovach, Petr A.; Paulusma, Daniel 20 2014 Colouring diamond-free graphs. Zbl 1372.05067 Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël 17 2017 Independent feedback vertex sets for graphs of bounded diameter. Zbl 1422.68104 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 14 2018 Classifying the clique-width of \(H\)-free bipartite graphs. Zbl 1329.05228 Dabrowski, Konrad K.; Paulusma, Daniël 14 2016 Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1422.68105 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 14 2019 Bounding clique-width via perfect graphs. Zbl 1425.05117 Kazimierz Dabrowski, Konrad; Huang, Shenwei; Paulusma, Daniël 11 2015 Bounding the clique-width of \(H\)-free split graphs. Zbl 1348.05147 Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 10 2016 Bounding the clique-width of \(H\)-free chordal graphs. Zbl 1370.05154 Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 10 2017 Clique-width of graph classes defined by two forbidden induced subgraphs. Zbl 1462.05310 Dabrowski, Konrad K.; Paulusma, Daniël 9 2015 Recognizing graphs close to bipartite graphs. Zbl 1441.68167 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 9 2017 Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. Zbl 1247.68109 Dabrowski, Konrad; Lozin, Vadim; Müller, Haiko; Rautenbach, Dieter 8 2012 Bounding the clique-width of \(H\)-free chordal graphs. Zbl 1468.05055 Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 8 2015 On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. Zbl 1400.68078 Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. 8 2018 On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 1459.05332 Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł 8 2020 Bounding clique-width via perfect graphs. Zbl 1428.05220 Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 8 2019 On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs. Zbl 1476.68200 Dabrowski, Konrad K.; Paulusma, Daniël 7 2018 Colouring vertices of triangle-free graphs. Zbl 1309.68091 Dabrowski, Konrad; Lozin, Vadim; Raman, Rajiv; Ries, Bernard 7 2010 Parameterized algorithms for the independent set problem in some hereditary graph classes. Zbl 1295.68131 Dabrowski, Konrad; Lozin, Vadim; Müller, Haiko; Rautenbach, Dieter 6 2011 Classifying the clique-width of \(H\)-free bipartite graphs. Zbl 1425.05114 Dabrowski, Konrad Kazimierz; Paulusma, Daniël 6 2014 Clique-width and well-quasi-ordering of triangle-free graph classes. Zbl 1442.05184 Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël 6 2020 On factorial properties of chordal bipartite graphs. Zbl 1246.05136 Dabrowski, Konrad; Lozin, Vadim V.; Zamaraev, Victor 5 2012 Colouring diamond-free graphs. Zbl 1378.68070 Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël 5 2016 Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1474.68216 Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël 5 2016 Editing to Eulerian graphs. Zbl 1360.68503 Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniel 5 2014 Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1457.68122 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 5 2017 Hereditary graph classes: when the complexities of coloring and clique cover coincide. Zbl 1417.05060 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 5 2019 Contracting bipartite graphs to paths and cycles. Zbl 1415.05037 Dabrowski, Konrad K.; Paulusma, Daniël 4 2017 Clique-width for graph classes closed under complementation. Zbl 1441.05167 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor 4 2020 Editing to Eulerian graphs. Zbl 1346.05150 Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël 3 2016 Editing to a planar graph of given degrees. Zbl 1356.68095 Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël; Thilikos, Dimitrios M. 3 2015 Clique-width and well-quasi-ordering of triangle-free graph classes. Zbl 1483.05178 Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël 3 2017 On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. Zbl 1483.68247 Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; dos Santos Souza, Uéverton 3 2016 Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. Zbl 1512.68196 Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 3 2019 Bounding the clique-width of \(H\)-free split graphs. Zbl 1346.05210 Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 3 2015 Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. Zbl 1512.68195 Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo 3 2021 On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Zbl 1516.05185 Dabrowski, Konrad K.; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Zamaraev, Viktor 3 2018 Computing small pivot-minors. Zbl 1517.68286 Dabrowski, Konrad K.; Dross, François; Jeong, Jisu; Kanté, Mamadou Moustapha; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniël 3 2018 Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. Zbl 1522.05362 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 3 2021 Editing to a planar graph of given degrees. Zbl 1356.68096 Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël; Thilikos, Dimitrios M. 2 2017 Stable-\(\Pi\) partitions of graphs. Zbl 1306.05189 Dabrowski, Konrad K.; Lozin, Vadim V.; Stacho, Juraj 2 2015 Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1443.05064 Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël 2 2019 Well-quasi-ordering versus clique-width: new results on bigenic classes. Zbl 1482.05281 Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël 2 2016 Colouring of graphs with Ramsey-type forbidden subgraphs. Zbl 1417.68064 Dabrowski, Konrad K.; Golovach, Petr A.; Paulusma, Daniël 2 2013 Clique-width for graph classes closed under complementation. Zbl 1441.05193 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor 2 2017 Well-quasi-ordering versus clique-width: new results on bigenic classes. Zbl 1404.05179 Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël 2 2018 Contracting bipartite graphs to paths and cycles. Zbl 1378.05195 Dabrowski, Konrad K.; Paulusma, Daniël 1 2017 Combinatorics and algorithms for augmenting graphs. Zbl 1342.05098 Dabrowski, Konrad K.; Lozin, Vadim V.; de Werra, Dominique; Zamaraev, Viktor 1 2016 An algorithmic framework for locally constrained homomorphisms. Zbl 07682405 Bulteau, Laurent; Dabrowski, Konrad K.; Köhler, Noleen; Ordyniak, Sebastian; Paulusma, Daniël 1 2022 Clique-width: harnessing the power of atoms. Zbl 07636200 Dabrowski, Konrad K.; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Rzążewski, Paweł 1 2020 An algorithmic framework for locally constrained homomorphisms. Zbl 07682405 Bulteau, Laurent; Dabrowski, Konrad K.; Köhler, Noleen; Ordyniak, Sebastian; Paulusma, Daniël 1 2022 Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. Zbl 1512.68195 Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo 3 2021 Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. Zbl 1522.05362 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 3 2021 On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 1459.05332 Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł 8 2020 Clique-width and well-quasi-ordering of triangle-free graph classes. Zbl 1442.05184 Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël 6 2020 Clique-width for graph classes closed under complementation. Zbl 1441.05167 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor 4 2020 Clique-width: harnessing the power of atoms. Zbl 07636200 Dabrowski, Konrad K.; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Rzążewski, Paweł 1 2020 Clique-width for hereditary graph classes. Zbl 1476.05175 Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 22 2019 Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1422.68105 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 14 2019 Bounding clique-width via perfect graphs. Zbl 1428.05220 Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 8 2019 Hereditary graph classes: when the complexities of coloring and clique cover coincide. Zbl 1417.05060 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 5 2019 Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. Zbl 1512.68196 Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 3 2019 Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1443.05064 Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël 2 2019 Independent feedback vertex sets for graphs of bounded diameter. Zbl 1422.68104 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 14 2018 On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. Zbl 1400.68078 Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. 8 2018 On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs. Zbl 1476.68200 Dabrowski, Konrad K.; Paulusma, Daniël 7 2018 On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Zbl 1516.05185 Dabrowski, Konrad K.; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Zamaraev, Viktor 3 2018 Computing small pivot-minors. Zbl 1517.68286 Dabrowski, Konrad K.; Dross, François; Jeong, Jisu; Kanté, Mamadou Moustapha; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniël 3 2018 Well-quasi-ordering versus clique-width: new results on bigenic classes. Zbl 1404.05179 Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël 2 2018 Colouring diamond-free graphs. Zbl 1372.05067 Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël 17 2017 Bounding the clique-width of \(H\)-free chordal graphs. Zbl 1370.05154 Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 10 2017 Recognizing graphs close to bipartite graphs. Zbl 1441.68167 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 9 2017 Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1457.68122 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 5 2017 Contracting bipartite graphs to paths and cycles. Zbl 1415.05037 Dabrowski, Konrad K.; Paulusma, Daniël 4 2017 Clique-width and well-quasi-ordering of triangle-free graph classes. Zbl 1483.05178 Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël 3 2017 Editing to a planar graph of given degrees. Zbl 1356.68096 Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël; Thilikos, Dimitrios M. 2 2017 Clique-width for graph classes closed under complementation. Zbl 1441.05193 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor 2 2017 Contracting bipartite graphs to paths and cycles. Zbl 1378.05195 Dabrowski, Konrad K.; Paulusma, Daniël 1 2017 Classifying the clique-width of \(H\)-free bipartite graphs. Zbl 1329.05228 Dabrowski, Konrad K.; Paulusma, Daniël 14 2016 Bounding the clique-width of \(H\)-free split graphs. Zbl 1348.05147 Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 10 2016 Colouring diamond-free graphs. Zbl 1378.68070 Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël 5 2016 Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1474.68216 Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël 5 2016 Editing to Eulerian graphs. Zbl 1346.05150 Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël 3 2016 On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. Zbl 1483.68247 Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; dos Santos Souza, Uéverton 3 2016 Well-quasi-ordering versus clique-width: new results on bigenic classes. Zbl 1482.05281 Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël 2 2016 Combinatorics and algorithms for augmenting graphs. Zbl 1342.05098 Dabrowski, Konrad K.; Lozin, Vadim V.; de Werra, Dominique; Zamaraev, Viktor 1 2016 Bounding clique-width via perfect graphs. Zbl 1425.05117 Kazimierz Dabrowski, Konrad; Huang, Shenwei; Paulusma, Daniël 11 2015 Clique-width of graph classes defined by two forbidden induced subgraphs. Zbl 1462.05310 Dabrowski, Konrad K.; Paulusma, Daniël 9 2015 Bounding the clique-width of \(H\)-free chordal graphs. Zbl 1468.05055 Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 8 2015 Editing to a planar graph of given degrees. Zbl 1356.68095 Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël; Thilikos, Dimitrios M. 3 2015 Bounding the clique-width of \(H\)-free split graphs. Zbl 1346.05210 Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël 3 2015 Stable-\(\Pi\) partitions of graphs. Zbl 1306.05189 Dabrowski, Konrad K.; Lozin, Vadim V.; Stacho, Juraj 2 2015 Colouring of graphs with Ramsey-type forbidden subgraphs. Zbl 1279.68104 Dabrowski, Konrad K.; Golovach, Petr A.; Paulusma, Daniel 20 2014 Classifying the clique-width of \(H\)-free bipartite graphs. Zbl 1425.05114 Dabrowski, Konrad Kazimierz; Paulusma, Daniël 6 2014 Editing to Eulerian graphs. Zbl 1360.68503 Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniel 5 2014 New results on maximum induced matchings in bipartite graphs and beyond. Zbl 1267.68118 Dabrowski, Konrad K.; Demange, Marc; Lozin, Vadim V. 27 2013 Colouring of graphs with Ramsey-type forbidden subgraphs. Zbl 1417.68064 Dabrowski, Konrad K.; Golovach, Petr A.; Paulusma, Daniël 2 2013 Colouring vertices of triangle-free graphs without forests. Zbl 1237.05071 Dabrowski, Konrad K.; Lozin, Vadim; Raman, Rajiv; Ries, Bernard 29 2012 Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. Zbl 1247.68109 Dabrowski, Konrad; Lozin, Vadim; Müller, Haiko; Rautenbach, Dieter 8 2012 On factorial properties of chordal bipartite graphs. Zbl 1246.05136 Dabrowski, Konrad; Lozin, Vadim V.; Zamaraev, Victor 5 2012 Parameterized algorithms for the independent set problem in some hereditary graph classes. Zbl 1295.68131 Dabrowski, Konrad; Lozin, Vadim; Müller, Haiko; Rautenbach, Dieter 6 2011 Colouring vertices of triangle-free graphs. Zbl 1309.68091 Dabrowski, Konrad; Lozin, Vadim; Raman, Rajiv; Ries, Bernard 7 2010 all cited Publications top 5 cited Publications all top 5 Cited by 260 Authors 65 Paulusma, Daniël 32 Dabrowski, Konrad Kazimierz 21 Golovach, Petr A. 17 Johnson, Matthew 14 Lozin, Vadim Vladislavovich 11 Huang, Shenwei 10 Milanič, Martin 10 Paesani, Giacomo 10 Rautenbach, Dieter 9 Brettell, Nick 9 Malyshev, Dmitriĭ Sergeevich 9 Souza, Uéverton S. 9 Zamaraev, Victor A. 8 Feghali, Carl 7 Brandstädt, Andreas 7 Rzążewski, Paweł 6 Martin, Barnaby D. 6 Munaro, Andrea 6 Smith, Siani 6 Song, Jian 5 Bonamy, Marthe 5 Joos, Felix Claudius 4 Agrawal, Akanksha 4 Alecu, Bogdan 4 Faria, Luerbio 4 Fomin, Fedor V. 4 Fürst, Maximilian 4 Masařík, Tomáš 4 Mosca, Raffaele 4 Saurabh, Saket 4 Thomassé, Stéphan 3 Atminas, Aistis 3 Bonomo-Braberman, Flavia 3 Bousquet, Nicolas 3 Brause, Christoph 3 Chiarelli, Nina 3 Couturier, Jean-Francois 3 de Werra, Dominique 3 Ekim, Tınaz 3 Horsfield, Jake 3 Ju, Yiao 3 Karthick, T. 3 Kratsch, Dieter 3 Novotná, Jana 3 Otachi, Yota 3 Pivač, Nevena 3 Schweitzer, Pascal 3 Tale, Prafullkumar 3 Thilikos, Dimitrios M. 3 Trotignon, Nicolas 3 van ’t Hof, Pim 3 Watrigant, Rémi 2 Alves, Sancrey Rodrigues 2 Baste, Julien 2 Belmonte, Rémy 2 Blanché, Alexandre 2 Bonnet, Edouard 2 Brignall, Robert 2 Broersma, Hajo J. 2 Charbit, Pierre 2 Dallard, Clément 2 Draque Penso, Lucia 2 Dross, François 2 Duarte, Marcio Antônio 2 Ducoffe, Guillaume 2 Furuya, Michitaka 2 Gaspers, Serge 2 Goedgebeur, Jan 2 Jaffke, Lars 2 Kanté, Mamadou Moustapha 2 Klein, Sulamita 2 Klimošová, Tereza 2 Knop, Dušan 2 Koana, Tomohiro 2 Komusiewicz, Christian 2 Koutecký, Martin 2 Lima, Paloma T. 2 Lin, Min Chih 2 Lokshtanov, Daniel 2 Maffray, Frédéric 2 Malík, Josef 2 Merkel, Owen D. 2 Mertzios, George B. 2 Oum, Sang-Il 2 Panolan, Fahad 2 Rai, Ashutosh 2 Raman, Venkatesh 2 Ries, Bernard 2 Sau, Ignasi 2 Slívová, Veronika 2 Sommer, Frank 2 Spirkl, Sophie Theresa 2 Štorgel, Kenny 2 Wu, Baoyindureng 1 Adefokun, Tayo Charles 1 Ahat, Betül 1 Ajayi, Deborah Olayide A. 1 Alekseev, Vladimir E. 1 Aliaj, Jurgen 1 Alves, Matheus S. D. ...and 160 more Authors all top 5 Cited in 33 Serials 26 Theoretical Computer Science 20 Discrete Applied Mathematics 18 Algorithmica 13 SIAM Journal on Discrete Mathematics 12 Discrete Mathematics 11 Journal of Computer and System Sciences 7 Journal of Graph Theory 6 Information Processing Letters 4 Graphs and Combinatorics 4 Optimization Letters 3 European Journal of Combinatorics 3 The Electronic Journal of Combinatorics 2 Applied Mathematics and Computation 2 Journal of Combinatorial Theory. Series B 2 Annals of Operations Research 2 International Transactions in Operational Research 2 Journal of Discrete Algorithms 2 Discrete Optimization 2 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 1 Acta Informatica 1 Mathematische Nachrichten 1 Order 1 The Australasian Journal of Combinatorics 1 Computational and Applied Mathematics 1 Acta Universitatis Matthiae Belii. Series Mathematics 1 INFORMS Journal on Computing 1 Theory of Computing Systems 1 Journal of Combinatorial Optimization 1 Discrete Dynamics in Nature and Society 1 AKCE International Journal of Graphs and Combinatorics 1 Logical Methods in Computer Science 1 Algorithms 1 Computer Science Review all top 5 Cited in 8 Fields 157 Combinatorics (05-XX) 127 Computer science (68-XX) 11 Operations research, mathematical programming (90-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 2 Mathematical logic and foundations (03-XX) 1 General and overarching topics; collections (00-XX) 1 Commutative algebra (13-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) Citations by Year