×
Compute Distance To:
Author ID: paulusma.daniel Recent zbMATH articles by "Paulusma, Daniël"
Published as: Paulusma, Daniël; Paulusma, Daniel; Paulusma, D.
Homepage: https://community.dur.ac.uk/daniel.paulusma/
External Links: MGP · ORCID · Google Scholar · dblp
all top 5

Co-Authors

1 single-authored
78 Golovach, Petr A.
54 Johnson, Matthew
43 Dabrowski, Konrad Kazimierz
34 van ’t Hof, Pim
31 Kamiński, Marcin Marek
25 Broersma, Hajo J.
22 Martin, Barnaby D.
20 Thilikos, Dimitrios M.
17 Kratsch, Dieter
16 Fiala, Jiří
16 Van Leeuwen, Erik Jan
15 Kern, Walter
13 Song, Jian
12 Smith, Siani
12 Stewart, Anthony
10 Feghali, Carl
10 Heggernes, Pinar
10 Ries, Bernard
10 Szeider, Stefan
9 Belmonte, Rémy
9 Huang, Shenwei
9 Paesani, Giacomo
8 Bonamy, Marthe
7 Brettell, Nick
6 Biró, Peter
6 Couturier, Jean-Francois
6 Dross, François
6 Lidický, Bernard
6 Lozin, Vadim Vladislavovich
6 Patel, Viresh
6 Picouleau, Christophe
6 Woeginger, Gerhard Johannes
5 Stewart, Iain A.
5 Yoshimoto, Kiyoshi
4 Brandstädt, Andreas
4 Chalopin, Jérémie
4 Fomin, Fedor V.
4 Milanič, Martin
4 van Rooij, Johan M. M.
3 Blanché, Alexandre
3 Brause, Christoph
3 Cochefert, Manfred
3 Hartinger, Tatiana Romina
3 Ito, Takehiro
3 Levin, Asaf
3 Lima, Paloma T.
3 Ordyniak, Sebastian
3 Salman, A. N. M.
3 Telle, Jan Arne
3 Zamaraev, Victor A.
2 Bodlaender, Hans L.
2 Bomhoff, Matthijs
2 Bonsma, Paul S.
2 Capponi, Agostino
2 Chaplick, Steven
2 Diner, Öznur Yaşar
2 Fleischner, Herbert J.
2 Gadouleau, Maximilien
2 Gaspers, Serge
2 Georgiou, Nicholas
2 Hof, Frits
2 Jeong, Jisu
2 Kaiser, Tomáš
2 Kanté, Mamadou Moustapha
2 Klimošová, Tereza
2 Kratsch, Stefan
2 Kurz, Sascha
2 Kwon, Ojoung
2 Larose, Benoit
2 Lignos, Ioannis
2 Malík, Josef
2 Manne, Fredrik
2 Marchal, Bert
2 Masařík, Tomáš
2 Mertzios, George B.
2 Mujuni, Egbert
2 Munaro, Andrea
2 Novotná, Jana
2 Oum, Sang-Il
2 Pilipczuk, Michał
2 Proskurowski, Andrzej
2 Slívová, Veronika
2 Slivovsky, Friedrich
2 Tesař, Marek
2 Trunck, Théophile
2 Wojuteczky, Péter
2 Wood, Chantal
1 Berthe, Gaétan
1 Bok, Jan
1 Bonomo-Braberman, Flavia
1 Bousquet, Nicolas
1 Brešar, Boštjan
1 Bulteau, Laurent
1 Chiarelli, Nina
1 Driessen, Theo S. H.
1 Erlebach, Thomas
1 Faigle, Ulrich
1 Fertin, Guillaume
1 Friedetzky, Tom
1 Fujisawa, Jun
...and 23 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

213 Publications have been cited 1,267 times in 557 Documents Cited by Year
A survey on the computational complexity of coloring graphs with forbidden subgraphs. Zbl 1359.05039
Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian
62
2017
Updating the complexity status of coloring graphs without a fixed induced linear forest. Zbl 1234.68129
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian
33
2012
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Zbl 1284.05089
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
32
2014
Matching games: the least core and the nucleolus. Zbl 1082.91016
Kern, Walter; Paulusma, Daniël
27
2003
A complete complexity classification of the role assignment problem. Zbl 1124.91055
Fiala, Jiří; Paulusma, Daniël
26
2005
Partitioning graphs into connected parts. Zbl 1194.68179
van ’t Hof, Pim; Paulusma, Daniël; Woeginger, Gerhard J.
20
2009
Three complexity results on coloring \(P_k\)-free graphs. Zbl 1257.05037
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël
20
2013
Covering graphs with few complete bipartite subgraphs. Zbl 1168.68019
Fleischner, Herbert; Mujuni, Egbert; Paulusma, Daniël; Szeider, Stefan
20
2009
Closing complexity gaps for coloring problems on \(H\)-free graphs. Zbl 1295.05105
Golovach, Petr A.; Paulusma, Daniël; Song, Jian
20
2014
4-coloring \(H\)-free graphs when \(H\) is small. Zbl 1259.05061
Golovach, Petr A.; Paulusma, Daniël; Song, Jian
19
2013
On graph contractions and induced minors. Zbl 1241.05137
Van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël; Szeider, Stefan; Thilikos, Dimitrios M.
17
2012
Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time. Zbl 1241.05030
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian
17
2012
A reconfigurations analogue of Brooks’ theorem and its consequences. Zbl 1350.05034
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
16
2016
Colouring of graphs with Ramsey-type forbidden subgraphs. Zbl 1279.68104
Dabrowski, Konrad K.; Golovach, Petr A.; Paulusma, Daniel
16
2014
Coloring graphs without short cycles and long induced paths. Zbl 1284.05098
Golovach, Petr A.; Paulusma, Daniël; Song, Jian
16
2014
\(\lambda \)-backbone colorings along pairwise disjoint stars and matchings. Zbl 1213.05068
Broersma, H. J.; Fujisawa, J.; Marchal, L.; Paulusma, D.; Salman, A. N. M.; Yoshimoto, K.
15
2009
Finding shortest paths between graph colourings. Zbl 1350.68148
Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël
14
2016
A new characterization of \(P_{6}\)-free graphs. Zbl 1225.05145
van’t Hof, Pim; Paulusma, Daniël
14
2010
The computational complexity of graph contractions. I: Polynomially solvable and NP-complete cases. Zbl 1140.68025
Levin, Asaf; Paulusma, Daniel; Woeginger, Gerhard J.
14
2008
Open problems on graph coloring for special graph classes. Zbl 1417.05077
Paulusma, Daniël
14
2016
Obtaining planarity by contracting few edges. Zbl 1260.68156
Golovach, Petr A.; Van ’t Hof, Pim; Paulusma, Daniël
14
2013
Classifying the clique-width of \(H\)-free bipartite graphs. Zbl 1329.05228
Dabrowski, Konrad K.; Paulusma, Daniël
13
2016
Satisfiability of acyclic and almost acyclic CNF formulas. Zbl 1291.68182
Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan
12
2013
Solutions for the stable roommates problem with payments. Zbl 1341.05106
Biró, Péter; Bomhoff, Matthijs; Golovach, Petr A.; Kern, Walter; Paulusma, Daniël
12
2012
The computational complexity of graph contractions II: Two tough polynomially solvable cases. Zbl 1182.05118
Levin, Asaf; Paulusma, Daniel; Woeginger, Gerhard J.
12
2008
Contractions of planar graphs in polynomial time. Zbl 1287.05151
Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M.
12
2010
Computing solutions for matching games. Zbl 1232.91026
Biró, Péter; Kern, Walter; Paulusma, Daniël
12
2012
Clique-width for hereditary graph classes. Zbl 1476.05175
Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
11
2019
Three complexity results on coloring \(P _{k }\)-free graphs. Zbl 1267.05113
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël
11
2009
Detecting fixed patterns in chordal graphs in polynomial time. Zbl 1291.68173
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël
11
2014
Independent feedback vertex sets for graphs of bounded diameter. Zbl 1422.68104
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
11
2018
Model counting for CNF formulas of bounded modular treewidth. Zbl 1353.68137
Paulusma, Daniel; Slivovsky, Friedrich; Szeider, Stefan
10
2016
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080
Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej
10
2015
Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1422.68105
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
10
2019
Colouring diamond-free graphs. Zbl 1372.05067
Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël
10
2017
Coloring graphs characterized by a forbidden subgraph. Zbl 1303.05061
Golovach, Petr A.; Paulusma, Daniël; Ries, Bernard
10
2015
List coloring in the absence of two subgraphs. Zbl 1283.05096
Golovach, Petr A.; Paulusma, Daniël
10
2014
List coloring in the absence of a linear forest. Zbl 1307.05068
Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël
10
2015
Solutions for the stable roommates problem with payments. Zbl 1422.91546
Biró, Péter; Bomhoff, Matthijs; Golovach, Petr A.; Kern, Walter; Paulusma, Daniël
10
2014
Parameterized algorithms for finding square roots. Zbl 1332.05136
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël
10
2016
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Zbl 1380.68219
Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
10
2018
Parameterized complexity of three edge contraction problems with degree constraints. Zbl 1360.68489
Belmonte, Rémy; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël
9
2014
Reducing the clique and chromatic number via edge contractions and vertex deletions. Zbl 1432.05074
Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
9
2016
Induced disjoint paths in AT-free graphs. Zbl 1357.68084
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan
9
2012
Contraction blockers for graphs with forbidden induced paths. Zbl 1459.68156
Diner, Öznur Yaşar; Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
9
2015
The computational complexity of disconnected cut and \(2 K_2\)-partition. Zbl 1307.05128
Martin, Barnaby; Paulusma, Daniël
9
2015
Computing role assignments of chordal graphs. Zbl 1231.05182
van ’t Hof, Pim; Paulusma, Daniël; van Rooij, Johan M. M.
9
2010
Bounding clique-width via perfect graphs. Zbl 1425.05117
Kazimierz Dabrowski, Konrad; Huang, Shenwei; Paulusma, Daniël
9
2015
Bounding the clique-width of \(H\)-free split graphs. Zbl 1348.05147
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
8
2016
Colouring \((P_r + P_s)\)-free graphs. Zbl 1441.68095
Klimošová, Tereza; Malík, Josef; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Slívová, Veronika
8
2020
Bounding the clique-width of \(H\)-free chordal graphs. Zbl 1370.05154
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
8
2017
A note on contracting claw-free graphs. Zbl 1281.68124
Fiala, Jiří; Kamiński, Marcin; Paulusma, Daniël
8
2013
Blocking independent sets for \(H\)-free graphs via edge contractions and vertex deletions. Zbl 1485.68197
Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
8
2017
The \(k\)-in-a-path problem for claw-free graphs. Zbl 1236.68088
Fiala, Jiří; Kamiński, Marcin; Lidický, Bernard; Paulusma, Daniël
8
2012
Finding contractions and induced minors in chordal graphs via disjoint paths. Zbl 1350.68129
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël
7
2011
List coloring in the absence of a linear forest. Zbl 1305.05073
Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël
7
2011
The price of connectivity for cycle transversals. Zbl 1343.05157
Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
7
2016
The new FIFA rules are hard: Complexity aspects of sports competitions. Zbl 1033.90511
Kern, Walter; Paulusma, Daniël
7
2001
Finding shortest paths between graph colourings. Zbl 1341.68062
Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël
7
2014
Bounding the clique-width of \(H\)-free chordal graphs. Zbl 1468.05055
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
7
2015
Clique-width of graph classes defined by two forbidden induced subgraphs. Zbl 1462.05310
Dabrowski, Konrad K.; Paulusma, Daniël
7
2015
Contraction and deletion blockers for perfect graphs and \(H\)-free graphs. Zbl 1400.68087
Diner, Öznur Yaşar; Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
7
2018
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Zbl 1181.05036
Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M.
7
2009
Increasing the minimum degree of a graph by contractions. Zbl 1296.05185
Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M.
7
2013
The computational complexity of the role assignment problem. Zbl 1039.68094
Fiala, Jiří; Paulusma, Daniël
7
2003
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. Zbl 1210.05064
Broersma, Hajo; Paulusma, Daniël; Yoshimoto, Kiyoshi
7
2009
A new algorithm for on-line coloring bipartite graphs. Zbl 1181.05035
Broersma, Hajo J.; Capponi, Agostino; Paulusma, Daniël
7
2008
Locally constrained graph homomorphisms and equitable partitions. Zbl 1205.05141
Fiala, Jiří; Paulusma, Daniël; Telle, Jan Arne
7
2008
Kempe equivalence of colourings of cubic graphs. Zbl 1348.05074
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
6
2017
Using contracted solution graphs for solving reconfiguration problems. Zbl 1398.90188
Bonsma, Paul; Paulusma, Daniël
6
2016
On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs. Zbl 1476.68200
Dabrowski, Konrad K.; Paulusma, Daniël
6
2018
Induced packing of odd cycles in a planar graph. Zbl 1272.05157
Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M.
6
2009
Sparse square roots. Zbl 1331.05204
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël
6
2013
Note on the computational complexity of least core concepts for min-cost spanning tree games. Zbl 1054.91010
Faigle, Ulrich; Kern, Walter; Paulusma, Daniël
6
2000
Computing vertex-surjective homomorphisms to partially reflexive trees. Zbl 1251.05031
Golovach, Petr A.; Paulusma, Daniël; Song, Jian
6
2012
Path factors and parallel knock-out schemes of almost claw-free graphs. Zbl 1219.05140
Johnson, Matthew; Paulusma, Daniël; Wood, Chantal
6
2010
The computational complexity of the elimination problem in generalized sports competitions. Zbl 1087.90010
Kern, Walter; Paulusma, Daniël
6
2004
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ł
5
2020
Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68245
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
5
2020
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Zbl 1430.68122
Chaplick, Steven; Fiala, Jiří; van ’t Hof, Pim; Paulusma, Daniël; Tesař, Marek
5
2015
Critical vertices and edges in \(H\)-free graphs. Zbl 1406.05037
Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
5
2019
On partitioning a graph into two connected subgraphs. Zbl 1228.68032
Paulusma, Daniël; van Rooij, Johan M. M.
5
2011
Computing role assignments of proper interval graphs in polynomial time. Zbl 1247.05240
Heggernes, Pinar; Van ’t Hof, Pim; Paulusma, Daniël
5
2012
Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs. Zbl 1445.68110
Huang, Shenwei; Johnson, Matthew; Paulusma, Daniël
5
2014
Comparing universal covers in polynomial time. Zbl 1205.68260
Fiala, Jiří; Paulusma, Daniël
5
2010
On disconnected cuts and separators. Zbl 1223.05155
Ito, Takehiro; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M.
5
2011
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
Acyclic, star, and injective colouring: bounding the diameter. Zbl 07538588
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani
5
2021
Classifying \(k\)-edge colouring for \(H\)-free graphs. Zbl 1481.05045
Galby, Esther; Lima, Paloma T.; Paulusma, Daniël; Ries, Bernard
4
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
4
2019
Parameterizing cut sets in a graph by the number of their components. Zbl 1232.05115
Ito, Takehiro; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M.
4
2011
Finding cactus roots in polynomial time. Zbl 1391.68051
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Computing square roots of graphs with low maximum degree. Zbl 1395.05083
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2018
A linear kernel for finding square roots of almost planar graphs. Zbl 1372.05052
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2017
A linear kernel for finding square roots of almost planar graphs. Zbl 1378.68077
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Colouring diamond-free graphs. Zbl 1378.68070
Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël
4
2016
Parameterizing cut sets in a graph by the number of their components. Zbl 1272.05202
Ito, Takehiro; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M.
4
2009
4-coloring \(H\)-free graphs when \(H\) is small. Zbl 1298.05117
Golovach, Petr A.; Paulusma, Daniël; Song, Jian
4
2012
Squares of low clique number. Zbl 1356.05102
Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
The price of connectivity for feedback vertex set. Zbl 1358.05156
Belmonte, Rémy; van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël
4
2017
Colouring graphs of bounded diameter in the absence of small cycles. Zbl 1489.05056
Martin, Barnaby; Paulusma, Daniël; Smith, Siani
3
2022
List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective. Zbl 1476.05050
Brettell, Nick; Horsfield, Jake; Munaro, Andrea; Paulusma, Daniël
2
2022
Computing subset transversals in \(H\)-free graphs. Zbl 07458786
Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
2
2022
Hard problems that quickly become very easy. Zbl 07444827
Martin, Barnaby; Paulusma, Daniël; Smith, Siani
1
2022
Partitioning \(H\)-free graphs of bounded diameter. Zbl 07575095
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani
1
2022
Acyclic, star, and injective colouring: bounding the diameter. Zbl 1491.05074
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Ochem, Pascal; Paulusma, Daniël; Smith, Siani
1
2022
Acyclic, star, and injective colouring: bounding the diameter. Zbl 07538588
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani
5
2021
Injective colouring for H-free graphs. Zbl 07493522
Bok, Jan; Jedličková, Nikola; Martin, Barnaby; Paulusma, Daniël; Smith, Siani
4
2021
Computing weighted subset transversals in \(H\)-free graphs. Zbl 07498680
Brettell, Nick; Johnson, Matthew; Paulusma, Daniël
2
2021
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. Zbl 07331686
Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo
1
2021
Steiner trees for hereditary graph classes: a treewidth perspective. Zbl 1477.68203
Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan
1
2021
Colouring \((P_r + P_s)\)-free graphs. Zbl 1441.68095
Klimošová, Tereza; Malík, Josef; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Slívová, Veronika
8
2020
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ł
5
2020
Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68245
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
5
2020
Clique-width and well-quasi-ordering of triangle-free graph classes. Zbl 1442.05184
Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël
3
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
1
2020
Disconnected cuts in claw-free graphs. Zbl 1450.05073
Martin, Barnaby; Paulusma, Daniël; van Leeuwen, Erik Jan
1
2020
Clique-width for hereditary graph classes. Zbl 1476.05175
Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
11
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
10
2019
Critical vertices and edges in \(H\)-free graphs. Zbl 1406.05037
Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
5
2019
Classifying \(k\)-edge colouring for \(H\)-free graphs. Zbl 1481.05045
Galby, Esther; Lima, Paloma T.; Paulusma, Daniël; Ries, Bernard
4
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
4
2019
Bounding clique-width via perfect graphs. Zbl 1428.05220
Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
3
2019
Colouring \(H\)-free graphs of bounded diameter. Zbl 07561658
Martin, Barnaby; Paulusma, Daniël; Smith, Siani
3
2019
Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. Zbl 07152209
Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
2
2019
Colouring square-free graphs without long induced paths. Zbl 1429.68081
Gaspers, Serge; Huang, Shenwei; Paulusma, Daniël
2
2019
Surjective \(H\)-colouring: new hardness results. Zbl 1425.05055
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony
2
2019
On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 07160840
Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
1
2019
On the parameterized complexity of \((k,s)\)-SAT. Zbl 1478.68105
Paulusma, Daniël; Szeider, Stefan
1
2019
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Zbl 1421.68082
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël
1
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
1
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
11
2018
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Zbl 1380.68219
Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
10
2018
Contraction and deletion blockers for perfect graphs and \(H\)-free graphs. Zbl 1400.68087
Diner, Öznur Yaşar; Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
7
2018
On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs. Zbl 1476.68200
Dabrowski, Konrad K.; Paulusma, Daniël
6
2018
Computing square roots of graphs with low maximum degree. Zbl 1395.05083
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2018
Computing small pivot-minors. Zbl 06983001
Dabrowski, Konrad K.; Dross, François; Jeong, Jisu; Kanté, Mamadou Moustapha; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniël
3
2018
Finding cactus roots in polynomial time. Zbl 1391.68052
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
3
2018
Surjective H-colouring over reflexive digraphs. Zbl 1485.68191
Larose, Benoît; Martin, Barnaby; Paulusma, Daniël
2
2018
Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68244
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
2
2018
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Zbl 07378380
Dabrowski, Konrad K.; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Zamaraev, Viktor
2
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
The stable fixtures problem with payments. Zbl 1400.91014
Biró, Péter; Kern, Walter; Paulusma, Daniël; Wojuteczky, Péter
2
2018
Simple games versus weighted voting games. Zbl 1415.91028
Hof, Frits; Kern, Walter; Kurz, Sascha; Paulusma, Daniël
1
2018
A survey on the computational complexity of coloring graphs with forbidden subgraphs. Zbl 1359.05039
Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian
62
2017
Colouring diamond-free graphs. Zbl 1372.05067
Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël
10
2017
Bounding the clique-width of \(H\)-free chordal graphs. Zbl 1370.05154
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
8
2017
Blocking independent sets for \(H\)-free graphs via edge contractions and vertex deletions. Zbl 1485.68197
Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
8
2017
Kempe equivalence of colourings of cubic graphs. Zbl 1348.05074
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
6
2017
A linear kernel for finding square roots of almost planar graphs. Zbl 1372.05052
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2017
The price of connectivity for feedback vertex set. Zbl 1358.05156
Belmonte, Rémy; van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël
4
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
3
2017
Recognizing graphs close to bipartite graphs. Zbl 1441.68167
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
3
2017
Reducing the chromatic number by vertex or edge deletions. Zbl 1383.05117
Picouleau, Christophe; Paulusma, Daniël; Ries, Bernard
3
2017
Clique-width and well-quasi-ordering of triangle-free graph classes. Zbl 1483.05178
Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël
2
2017
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Zbl 1421.68081
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël
2
2017
Contracting bipartite graphs to paths and cycles. Zbl 1415.05037
Dabrowski, Konrad K.; Paulusma, Daniël
2
2017
Contracting bipartite graphs to paths and cycles. Zbl 1378.05195
Dabrowski, Konrad K.; Paulusma, Daniël
1
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.
1
2017
A reconfigurations analogue of Brooks’ theorem and its consequences. Zbl 1350.05034
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
16
2016
Finding shortest paths between graph colourings. Zbl 1350.68148
Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël
14
2016
Open problems on graph coloring for special graph classes. Zbl 1417.05077
Paulusma, Daniël
14
2016
Classifying the clique-width of \(H\)-free bipartite graphs. Zbl 1329.05228
Dabrowski, Konrad K.; Paulusma, Daniël
13
2016
Model counting for CNF formulas of bounded modular treewidth. Zbl 1353.68137
Paulusma, Daniel; Slivovsky, Friedrich; Szeider, Stefan
10
2016
Parameterized algorithms for finding square roots. Zbl 1332.05136
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël
10
2016
Reducing the clique and chromatic number via edge contractions and vertex deletions. Zbl 1432.05074
Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
9
2016
Bounding the clique-width of \(H\)-free split graphs. Zbl 1348.05147
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël
8
2016
The price of connectivity for cycle transversals. Zbl 1343.05157
Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
7
2016
Using contracted solution graphs for solving reconfiguration problems. Zbl 1398.90188
Bonsma, Paul; Paulusma, Daniël
6
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
Finding cactus roots in polynomial time. Zbl 1391.68051
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
A linear kernel for finding square roots of almost planar graphs. Zbl 1378.68077
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Colouring diamond-free graphs. Zbl 1378.68070
Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël
4
2016
Squares of low clique number. Zbl 1356.05102
Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Induced disjoint paths in circular-arc graphs in linear time. Zbl 1345.05051
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan
4
2016
Editing to Eulerian graphs. Zbl 1346.05150
Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël
2
2016
Minimal disconnected cuts in planar graphs. Zbl 1434.68362
Kamiński, Marcin; Paulusma, Daniël; Stewart, Anthony; Thilikos, Dimitrios M.
2
2016
The stable fixtures problem with payments. Zbl 1422.91064
Biró, Péter; Kern, Walter; Paulusma, Daniël; Wojuteczky, Péter
2
2016
Well-quasi-ordering versus clique-width: new results on bigenic classes. Zbl 1482.05281
Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël
1
2016
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080
Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej
10
2015
Coloring graphs characterized by a forbidden subgraph. Zbl 1303.05061
Golovach, Petr A.; Paulusma, Daniël; Ries, Bernard
10
2015
List coloring in the absence of a linear forest. Zbl 1307.05068
Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël
10
2015
Contraction blockers for graphs with forbidden induced paths. Zbl 1459.68156
Diner, Öznur Yaşar; Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard
9
2015
The computational complexity of disconnected cut and \(2 K_2\)-partition. Zbl 1307.05128
Martin, Barnaby; Paulusma, Daniël
9
2015
Bounding clique-width via perfect graphs. Zbl 1425.05117
Kazimierz Dabrowski, Konrad; Huang, Shenwei; 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
7
2015
Clique-width of graph classes defined by two forbidden induced subgraphs. Zbl 1462.05310
Dabrowski, Konrad K.; Paulusma, Daniël
7
2015
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Zbl 1430.68122
Chaplick, Steven; Fiala, Jiří; van ’t Hof, Pim; Paulusma, Daniël; Tesař, Marek
5
2015
Induced disjoint paths in claw-free graphs. Zbl 1311.05090
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan
3
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
2
2015
Kempe equivalence of colourings of cubic graphs. Zbl 1346.05065
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
1
2015
What graphs are 2-dot product graphs? Zbl 1346.05246
Johnson, Matthew; van Leeuwen, Erik Jan; Paulusma, Daniël
1
2015
The price of connectivity for cycle transversals. Zbl 1455.05076
Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
1
2015
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Zbl 1284.05089
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
32
2014
Closing complexity gaps for coloring problems on \(H\)-free graphs. Zbl 1295.05105
Golovach, Petr A.; Paulusma, Daniël; Song, Jian
20
2014
Colouring of graphs with Ramsey-type forbidden subgraphs. Zbl 1279.68104
Dabrowski, Konrad K.; Golovach, Petr A.; Paulusma, Daniel
16
2014
Coloring graphs without short cycles and long induced paths. Zbl 1284.05098
Golovach, Petr A.; Paulusma, Daniël; Song, Jian
16
2014
Detecting fixed patterns in chordal graphs in polynomial time. Zbl 1291.68173
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël
11
2014
List coloring in the absence of two subgraphs. Zbl 1283.05096
Golovach, Petr A.; Paulusma, Daniël
10
2014
...and 113 more Documents
all top 5

Cited by 679 Authors

137 Paulusma, Daniël
53 Golovach, Petr A.
26 Johnson, Matthew
25 Dabrowski, Konrad Kazimierz
19 Martin, Barnaby D.
19 van ’t Hof, Pim
18 Malyshev, Dmitriĭ Sergeevich
17 Thilikos, Dimitrios M.
16 Feghali, Carl
16 Ito, Takehiro
16 Kamiński, Marcin Marek
16 Saurabh, Saket
15 Fiala, Jiří
15 Ries, Bernard
13 Lozin, Vadim Vladislavovich
13 Van Leeuwen, Erik Jan
12 Chudnovsky, Maria
12 Kratsch, Dieter
12 Smith, Siani
11 Belmonte, Rémy
11 Heggernes, Pinar
11 Lima, Paloma T.
10 Broersma, Hajo J.
10 Schaudt, Oliver
10 Song, Jian
10 Tale, Prafullkumar
9 Bonamy, Marthe
9 Fomin, Fedor V.
9 Huang, Shenwei
9 Kern, Walter
9 Milanič, Martin
9 Zhong, Mingxian
8 Rzążewski, Paweł
8 Suzuki, Akira
7 Agrawal, Akanksha
7 Brandstädt, Andreas
7 Stewart, Anthony
7 Szeider, Stefan
7 Zhou, Xiao
6 Bousquet, Nicolas
6 Brettell, Nick
6 Bu, Yuehua
6 Galby, Esther
6 Kratochvíl, Jan
6 Mosca, Raffaele
6 Nishimura, Naomi
6 Paesani, Giacomo
6 Picouleau, Christophe
6 Spirkl, Sophie Theresa
6 Woeginger, Gerhard Johannes
6 Yoshimoto, Kiyoshi
5 Biró, Peter
5 Brause, Christoph
5 Couturier, Jean-Francois
5 Ducoffe, Guillaume
5 Klimošová, Tereza
5 Könemann, Jochen
5 Lidický, Bernard
5 Lokshtanov, Daniel
5 Novotná, Jana
5 Ordyniak, Sebastian
5 Otachi, Yota
5 Papadopoulos, Charis
5 Pilipczuk, Michał
5 Raman, Venkatesh
5 Zhou, Sizhong
4 Bang-Jensen, Jørgen
4 Bonomo-Braberman, Flavia
4 Fang, Qizhi
4 Ganian, Robert
4 Gaspers, Serge
4 Goedgebeur, Jan
4 Greco, Gianluigi
4 Havet, Frédéric
4 Jaffke, Lars
4 Kamiyama, Naoyuki
4 Karthick, T.
4 Kobayashi, Yusuke
4 Kwon, Ojoung
4 Lampis, Michael
4 Masařík, Tomáš
4 Mouawad, Amer E.
4 Munaro, Andrea
4 Newton, Jonathan
4 Pradelski, Bary S. R.
4 Purcell, Christopher J.
4 Sanità, Laura
4 Zamaraev, Victor A.
3 Baïou, Mourad
3 Barahona, Francisco
3 Bok, Jan
3 Bonsma, Paul S.
3 Brešar, Boštjan
3 Camby, Eglantine
3 Chalopin, Jérémie
3 Chandrasekaran, Karthekeyan
3 Demaine, Erik D.
3 Hartinger, Tatiana Romina
3 Hell, Pavol
3 Janczewski, Robert
...and 579 more Authors
all top 5

Cited in 81 Serials

75 Theoretical Computer Science
70 Discrete Applied Mathematics
40 Algorithmica
26 SIAM Journal on Discrete Mathematics
24 Discrete Mathematics
15 Information Processing Letters
15 Journal of Computer and System Sciences
14 European Journal of Combinatorics
11 Graphs and Combinatorics
11 Journal of Combinatorial Optimization
10 Journal of Combinatorial Theory. Series B
8 The Electronic Journal of Combinatorics
8 Theory of Computing Systems
7 Artificial Intelligence
6 Journal of Graph Theory
6 Games and Economic Behavior
6 Mathematical Programming. Series A. Series B
6 Journal of Discrete Algorithms
6 Optimization Letters
5 Discrete Optimization
4 International Journal of Game Theory
4 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
4 Computer Science Review
3 Acta Informatica
3 Networks
3 Operations Research Letters
3 Information and Computation
3 Annals of Operations Research
3 Algorithms
2 Journal of Economic Theory
2 International Journal of Foundations of Computer Science
2 European Journal of Operational Research
2 Linear Algebra and its Applications
2 Complexity
2 RAIRO. Operations Research
2 Trudy Instituta Matematiki
2 Games
1 Bulletin of the Australian Mathematical Society
1 Communications in Mathematical Physics
1 Algebra Universalis
1 Applied Mathematics and Computation
1 Journal of Mathematical Economics
1 Mathematics of Operations Research
1 Operations Research
1 SIAM Journal on Computing
1 Moscow University Computational Mathematics and Cybernetics
1 Combinatorica
1 Journal of Classification
1 Social Choice and Welfare
1 Order
1 Acta Mathematicae Applicatae Sinica. English Series
1 Computers & Operations Research
1 Science in China. Series A
1 International Journal of Computational Geometry & Applications
1 Computational Geometry
1 Discrete Mathematics and Applications
1 Distributed Computing
1 The Australasian Journal of Combinatorics
1 Combinatorics, Probability and Computing
1 Computational and Applied Mathematics
1 Opuscula Mathematica
1 The Journal of Artificial Intelligence Research (JAIR)
1 Discussiones Mathematicae. Graph Theory
1 Constraints
1 INFORMS Journal on Computing
1 Mathematical Methods of Operations Research
1 Journal of Scheduling
1 Discrete Dynamics in Nature and Society
1 Acta Mathematica Sinica. English Series
1 Journal of Intelligent and Fuzzy Systems
1 ACM Journal of Experimental Algorithmics
1 Journal of Applied Logic
1 AKCE International Journal of Graphs and Combinatorics
1 Proyecciones
1 Contributions to Discrete Mathematics
1 Journal of Commutative Algebra
1 Journal of Dynamics and Games
1 ACM Transactions on Computation Theory
1 Electronic Journal of Graph Theory and Applications
1 AIMS Mathematics
1 Prikladnaya Diskretnaya Matematika

Citations by Year