Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

Durham University

Computer Science

Profile

Dr Konrad Dabrowski, FHEA

Personal web page

Teaching Fellow in the Department of Computer Science
Telephone: +44 (0) 191 33 41704
Room number: E103

(email at konrad.dabrowski@durham.ac.uk)

Publications

Journal Article

Conference Paper

  • Dabrowski, K.K., Masařík, T., Novotná, J., Paulusma, D. & Rzążewski, P. (2020), Clique-Width: Harnessing the Power of Atoms, Lecture Notes in Computer Science WG 2020. Leeds, England, Springer.
  • Dabrowski, K.K., Jonsson, P., Ordyniak, S. & Osipov, G. (2020), Fine-Grained Complexity of Temporal Problems, KR 2020. Rhodes, Greece.
  • Bulteau, L. Dabrowski, K.K. , Fertin, G., Johnson, M. , Paulusma, D. & Vialette S. (2019), Finding a small number of colourful components, Leibniz International Proceedings in Informatics CPM 2019. Pisa, Italy, Schloss Dagstuhl, Saarbrücken, Germany.
  • Bonamy, M., Dabrowski, K.K., Johnson, M. & Paulusma, D. (2019), Graph isomorphism for (H1,H2)-free graphs: an almost complete dichotomy, in Friggstad, Zachary Sack, Jörg-Rüdiger & Salavatipour, Mohammad R. eds, Lecture Notes in Computer Science 11646: WADS 2019. Edmonton, Canada, Springer, Cham, 181-195.
  • Dabrowski, K.K., Johnson, M., Paesani, G. , Paulusma, D. & Zamaraev, V. (2019), Independent transversals versus transversals, 88: EuroComb 2019. Bratislava, Slovakia, Comenius University Press, 585-591.
  • Dabrowski, K.K. , Dross, F. Jeong, J. Kanté, M.M. Kwon, O. Oum, S. & Paulusma, D. (2019), Tree pivot-minors and linear rank-width, 88: EuroComb 2019. Bratislava, Slovakia, Comenius University Press, 577-583.
  • Dabrowski, K.K., Dross, F., Jeong, J., Kanté, M.M., Kwon, O., Oum, S. & Paulusma, D. (2018), Computing small pivot-minors, in Brandstädt, A., Köhler, E. & Meer, K. eds, Lecture Notes in Computer Science 11159: 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2018). Cottbus, Germany, Springer, Cham, Switzerland, 125-138.
  • Dabrowski, K.K., Johnson, M., Paesani, G., Paulusma, D. & Zamaraev, V. (2018), On the price of independence for vertex cover, feedback vertex set and odd cycle transversal, in Potapov, Igor, Spirakis, Paul & Worrell, James eds, Leibniz International Proceedings in Informatics 117: 43nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Liverpool, UK, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 63:1--63:15.
  • Dabrowski, K.K., Lozin, V.V. & Paulusma, D. (2017), Clique-width and well-quasi ordering of triangle-free graph classes, in Bodlaender, Hans L. & Woeginger, Gerhard J. eds, Lecture Notes in Computer Science 10520: WG 2017: 43rd International Workshop on Graph-Theoretic Concepts in Computer Science. Eindhoven, The Netherlands, Springer, Cham, 220-233.
  • Blanché, A., Dabrowski, K.K., Johnson, M., Lozin, V.V., Paulusma, D. & Zamaraev, V. (2017), Clique-Width for Graph Classes Closed under Complementation, in Larsen, Kim G., Bodlaender, Hans L. & Raskin, Jean-Francois eds, LIPIcs–Leibniz International Proceedings in Informatics 83: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Aalborg, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 73.
  • Dabrowski, K.K. & Paulusma, D. (2017), Contracting bipartite graphs to paths and cycles, Electronic Notes in Discrete Mathematics 61: Eurocomb 2017: European Conference on Combinatorics, Graph Theory and Applications. Vienna, Elsevier, 309-315.
  • Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M. & Paulusma, D. (2017), Independent Feedback Vertex Set for P5-free Graphs, in Okamoto, Yoshio & Tokuyama, Takeshi eds, Leibniz International Proceedings in Informatics 92: ISAAC 2017. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 16:1-16:12.
  • Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M. & Paulusma, D. (2017), Recognizing Graphs Close to Bipartite Graphs, in Larsen, Kim G., Bodlaender, Hans L. & Raskin, Jean-Francois eds, LIPIcs–Leibniz International Proceedings in Informatics 83: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Aalborg, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 70.
  • Dabrowski, K.K., Dross, F. & Paulusma, D. (2016), Colouring diamond-free graphs, in Pagh, Rasmus eds, Leibniz International Proceedings in Informatics (LIPIcs) 53: 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Reykjavik, Iceland, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Wadern, 16.
  • Dabrowski, K.K., Dross, F., Johnson, M. & Paulusma, D. (2016), Filling the complexity gaps for colouring planar and bounded degree graphs, in Lipták, Zsuzsanna & Smyth, William F. eds, Lecture Notes in Computer Science 9538: 26th International Workshop on Combinatorial Algorithms (IWOCA 2015). Verona, Italy, Springer, 100-111.
  • Alves, Sancrey Rodrigues, Dabrowski, Konrad K., Faria, Luerbio, Klein, Sulamita, Sau, Ignasi & dos Santos Souza, Uéverton (2016), On the (Parameterized) Complexity of Recognizing Well-covered (r,l)-graphs, in Chan, T.-H. Hubert, Li, Minming & Wang, Lusheng eds, Lecture Notes in Computer Science 10043: 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016). Hong Kong, China, Springer, Cham, Switzerland, 423-437.
  • Dabrowski, K.K., Lozin, V.V. & Paulusma, D. (2016), Well-quasi-ordering versus clique-width: new results on bigenic classes, in Mäkinen, Veli, Puglisi, Simon J. & Salmela, Leena eds, Lecture Notes in Computer Science 9843: 27th International Workshop on Combinatorial Algorithms (IWOCA 2016). Helsinki, Finland, Springer, Cham, Switzerland, 253-265.
  • Dabrowski, K.K., Huang, S. & Paulusma, D. (2015), Bounding clique-width via perfect graphs, in Dediu, Adrian-Horia, Formenti, Enrico, Martín-Vide, Carlos & Truthe, Bianca eds, Lecture Notes in Computer Science 8977: International Conference on Language and Automata Theory and Applications. Nice, France, Springer, Nice, 676-688.
  • Brandstädt, A., Dabrowski, K.K., Huang, S. & Paulusma, D. (2015), Bounding the Clique-Width of H-free Chordal Graphs, Lecture Notes in Computer Science 9235: 40th International Symposium, MFCS 2015. Milan, Italy, Springer, Milan, 139-150.
  • Brandstädt, A., Dabrowski, K.K., Huang, S. & Paulusma, D. (2015), Bounding the clique-width of H-free split graphs, Electronic Notes in Discrete Mathematics 49: The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015. Bergen, Norway, Elsevier, Bergen, 497-503.
  • Dabrowski, K.K. & Paulusma, D. (2015), Clique-width of graph classes defined by two forbidden induced subgraphs, in Paschos, Vangelis Th. & Widmayer, Peter eds, Lecture Notes in Computer Science 9079: 9th International Conference on Algorithms and Complexity (CIAC 2015). Paris, France, Springer, Paris, 167-181.
  • Dabrowski, K.K., Golovach, P.A., van 't Hof, P., Paulusma, D. & Thilikos, D.M. (2015), Editing to a planar graph of given degrees, Lecture Notes in Computer Science 9139: Springer, 143-156.
  • Dabrowski, K.K. & Paulusma, D. (2014), Classifying the Clique-Width of H-Free Bipartite Graphs, in Cai, Zhipeng, Zelikovsky, Alexander & Bourgeois, Anu G. eds, Lecture Notes in Computer Science 8591: 20th International Conference, COCOON 2014. Atlanta, GA, USA, Springer, Atlanta GA, 489-500.
  • Dabrowski, K.K., Golovach, P.A., Hof, van 't P. & Paulusma, D. (2014), Editing to Eulerian Graphs, in Raman, Venkatesh & Suresh, S. P. eds, Leibniz International Proceedings in Informatics (LIPIcs) 29: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Budapest, Hungary, Schloss Dagstuhl, Budapest, 97-108.
  • Dabrowski, K.K., Golovach, P.A. & Paulusma, D. (2013), Colouring of Graphs with Ramsey-Type Forbidden Subgraphs, in Brandstädt, Andreas, Jansen, Klaus, & Reischuk, Rüdiger eds, Lecture Notes in Computer Science 8165: 39th International Workshop, WG 2013. Lübeck, Germany, Springer, L├╝beck, 201-212.