Konrad K. Dabrowski

589 total citations
29 papers, 168 citations indexed

About

Konrad K. Dabrowski is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Konrad K. Dabrowski has authored 29 papers receiving a total of 168 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 17 papers in Discrete Mathematics and Combinatorics and 8 papers in Computer Networks and Communications. Recurrent topics in Konrad K. Dabrowski's work include Advanced Graph Theory Research (26 papers), Limits and Structures in Graph Theory (17 papers) and Complexity and Algorithms in Graphs (10 papers). Konrad K. Dabrowski is often cited by papers focused on Advanced Graph Theory Research (26 papers), Limits and Structures in Graph Theory (17 papers) and Complexity and Algorithms in Graphs (10 papers). Konrad K. Dabrowski collaborates with scholars based in United Kingdom, France and Sweden. Konrad K. Dabrowski's co-authors include Daniël Paulusma, Vadim Lozin, Marc Demange, Rajiv Raman, Petr A. Golovach, Bernard Ries, Matthew Johnson, Shenwei Huang, Andreas Brandstädt and Marthe Bonamy and has published in prestigious journals such as Artificial Intelligence, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Konrad K. Dabrowski

25 papers receiving 161 citations

Peers

Konrad K. Dabrowski

CTM

DMC

CNC

EEE

Deepak Rajendraprasad India

Mostafa Blidia Algeria

Marthe Bonamy France

Alexey Pokrovskiy United Kingdom

Charis Papadopoulos Greece

Aline Parreau France

Luke Postle Canada

Edita Máčajová Slovakia

Mamadou Moustapha Kanté France

Hoàng-Oanh Le Germany

Deepak Rajendraprasad India

Konrad K. Dabrowski

166 ×1.0

CTM

78 ×0.9

DMC

34 ×1.0

39 ×1.3

CNC

22 ×1.2

EEE

Citations per year, relative to Konrad K. Dabrowski Konrad K. Dabrowski (= 1×) peers Deepak Rajendraprasad

Countries citing papers authored by Konrad K. Dabrowski

Since Specialization

Citations

This map shows the geographic impact of Konrad K. Dabrowski's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Konrad K. Dabrowski with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Konrad K. Dabrowski more than expected).

Fields of papers citing papers by Konrad K. Dabrowski

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Konrad K. Dabrowski. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Konrad K. Dabrowski. The network helps show where Konrad K. Dabrowski may publish in the future.

Co-authorship network of co-authors of Konrad K. Dabrowski

This figure shows the co-authorship network connecting the top 25 collaborators of Konrad K. Dabrowski. A scholar is included among the top collaborators of Konrad K. Dabrowski based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Konrad K. Dabrowski. Konrad K. Dabrowski is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Dabrowski, Konrad K., et al.. (2024). Learning Small Decision Trees for Data of Low Rank-Width. Proceedings of the AAAI Conference on Artificial Intelligence. 38(9). 10476–10483. 2 indexed citations

Dabrowski, Konrad K., et al.. (2023). Solving infinite-domain CSPs using the patchwork property. Artificial Intelligence. 317. 103880–103880.

Dabrowski, Konrad K., et al.. (2023). On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. European Journal of Combinatorics. 117. 103821–103821.

Dabrowski, Konrad K., et al.. (2021). Solving Infinite-Domain CSPs Using the Patchwork Property. Proceedings of the AAAI Conference on Artificial Intelligence. 35(5). 3715–3723. 4 indexed citations

Dabrowski, Konrad K., et al.. (2020). On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. IRIS Research product catalog (Sapienza University of Rome). 6 indexed citations

Dabrowski, Konrad K., et al.. (2020). Clique-Width for Graph Classes Closed under Complementation. SIAM Journal on Discrete Mathematics. 34(2). 1107–1147. 1 indexed citations

Dabrowski, Konrad K., Vadim Lozin, & Daniël Paulusma. (2019). Clique-width and well-quasi-ordering of triangle-free graph classes. Journal of Computer and System Sciences. 108. 64–91. 3 indexed citations

Bonamy, Marthe, et al.. (2018). Independent Feedback Vertex Set for $$P_5$$ P 5 -Free Graphs. Algorithmica. 81(4). 1342–1369. 10 indexed citations

Brandstädt, Andreas, Konrad K. Dabrowski, Shenwei Huang, & Daniël Paulusma. (2017). Bounding the Clique‐Width of H‐Free Chordal Graphs. Journal of Graph Theory. 86(1). 42–77. 6 indexed citations

10.

Dabrowski, Konrad K., et al.. (2016). Colouring on Hereditary Graph Classes Closed under Complementation.. arXiv (Cornell University). 1 indexed citations

11.

Dabrowski, Konrad K., et al.. (2015). Combinatorics and Algorithms for Augmenting Graphs. Graphs and Combinatorics. 32(4). 1339–1352. 2 indexed citations

12.

Dabrowski, Konrad K. & Daniël Paulusma. (2015). Classifying the clique-width of H-free bipartite graphs. Discrete Applied Mathematics. 200. 43–51. 12 indexed citations

13.

Dabrowski, Konrad K., Petr A. Golovach, Pim van ’t Hof, & Daniël Paulusma. (2015). Editing to Eulerian graphs. Journal of Computer and System Sciences. 82(2). 213–228. 2 indexed citations

14.

Dabrowski, Konrad K. & Daniël Paulusma. (2015). Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. The Computer Journal. 59(5). 650–666. 14 indexed citations

15.

Dabrowski, Konrad K., Petr A. Golovach, & Daniël Paulusma. (2013). Colouring of graphs with Ramsey-type forbidden subgraphs. Theoretical Computer Science. 522. 34–43. 18 indexed citations

16.

Dabrowski, Konrad K., et al.. (2013). Stable-Π partitions of graphs. Discrete Applied Mathematics. 182. 104–114.

17.

Dabrowski, Konrad K., Marc Demange, & Vadim Lozin. (2013). New results on maximum induced matchings in bipartite graphs and beyond. Theoretical Computer Science. 478. 33–40. 25 indexed citations

18.

Dabrowski, Konrad K., Vadim Lozin, Rajiv Raman, & Bernard Ries. (2012). Colouring vertices of triangle-free graphs without forests. Discrete Mathematics. 312(7). 1372–1385. 26 indexed citations

19.

Dabrowski, Konrad K., et al.. (2012). On factorial properties of chordal bipartite graphs. Discrete Mathematics. 312(16). 2457–2465. 5 indexed citations

20.

Dabrowski, Konrad K., Vadim Lozin, Haiko Müller, & Dieter Rautenbach. (2011). Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. Journal of Discrete Algorithms. 14. 207–213. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact