
Daniël Paulusma
Person information
- affiliation: Durham University, School of Engineering and Computing Sciences, UK
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
- [j135]Marthe Bonamy
, Nicolas Bousquet
, Konrad K. Dabrowski
, Matthew Johnson
, Daniël Paulusma
, Théo Pierron
:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83(3): 822-852 (2021) - [i76]Barnaby Martin, Daniël Paulusma, Siani Smith:
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CoRR abs/2101.07856 (2021) - 2020
- [j134]Matthew Johnson
, Giacomo Paesani
, Daniël Paulusma
:
Connected Vertex Cover for (sP1+P5)-Free Graphs. Algorithmica 82(1): 20-40 (2020) - [j133]Tereza Klimosová, Josef Malík, Tomás Masarík
, Jana Novotná, Daniël Paulusma
, Veronika Slívová:
Colouring (Pr + Ps)-Free Graphs. Algorithmica 82(7): 1833-1858 (2020) - [j132]Konrad K. Dabrowski
, Carl Feghali
, Matthew Johnson
, Giacomo Paesani
, Daniël Paulusma
, Pawel Rzazewski
:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82(10): 2841-2866 (2020) - [j131]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
:
Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. 108: 64-91 (2020) - [j130]Barnaby Martin, Daniël Paulusma
, Erik Jan van Leeuwen:
Disconnected cuts in claw-free graphs. J. Comput. Syst. Sci. 113: 60-75 (2020) - [j129]Frits Hof, Walter Kern, Sascha Kurz
, Kanstantsin Pashkovich, Daniël Paulusma
:
Simple games versus weighted voting games: bounding the critical threshold value. Soc. Choice Welf. 54(4): 609-621 (2020) - [j128]Alexandre Blanché
, Konrad K. Dabrowski
, Matthew Johnson
, Vadim V. Lozin
, Daniël Paulusma
, Viktor Zamaraev
:
Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. 34(2): 1107-1147 (2020) - [c113]Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. ESA 2020: 22:1-22:22 - [c112]Walter Kern, Daniël Paulusma:
Contracting to a Longest Path in H-Free Graphs. ISAAC 2020: 22:1-22:18 - [c111]Nick Brettell, Jake Horsfield, Andrea Munaro
, Giacomo Paesani, Daniël Paulusma:
Bounding the Mim-Width of Hereditary Graph Classes. IPEC 2020: 6:1-6:18 - [c110]Hans L. Bodlaender
, Nick Brettell
, Matthew Johnson
, Giacomo Paesani
, Daniël Paulusma
, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes. LATIN 2020: 613-624 - [c109]Konrad K. Dabrowski
, Tomás Masarík
, Jana Novotná
, Daniël Paulusma
, Pawel Rzazewski
:
Clique-Width: Harnessing the Power of Atoms. WG 2020: 119-133 - [c108]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing Subset Transversals in H-Free Graphs. WG 2020: 187-199 - [i75]Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
:
Bounding the Mim-Width of Hereditary Graph Classes. CoRR abs/2004.05018 (2020) - [i74]Nick Brettell, Jake Horsfield, Daniël Paulusma
:
Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective. CoRR abs/2004.05022 (2020) - [i73]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR abs/2004.07492 (2020) - [i72]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
:
Computing Subset Transversals in H-Free Graphs. CoRR abs/2005.13938 (2020) - [i71]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma
, Pawel Rzazewski:
Clique-Width: Harnessing the Power of Atoms. CoRR abs/2006.03578 (2020) - [i70]Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. CoRR abs/2007.14514 (2020) - [i69]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Tree pivot-minors and linear rank-width. CoRR abs/2008.00561 (2020) - [i68]Nick Brettell, Andrea Munaro, Daniël Paulusma:
List k-Colouring Pt-Free Graphs with No Induced 1-Subdivision of K1, s: a Mim-width Perspective. CoRR abs/2008.01590 (2020) - [i67]Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving problems on generalized convex graphs via mim-width. CoRR abs/2008.09004 (2020) - [i66]Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. CoRR abs/2008.09415 (2020) - [i65]Gaetan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith:
The complexity of L(p, q)-Edge-Labelling. CoRR abs/2008.12226 (2020) - [i64]Barnaby Martin, Daniël Paulusma, Siani Smith:
Hard Problems That Quickly Become Very Easy. CoRR abs/2012.09770 (2020) - [i63]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-free Graphs. CoRR abs/2012.09814 (2020)
2010 – 2019
- 2019
- [j127]Paul S. Bonsma, Daniël Paulusma
:
Using contracted solution graphs for solving reconfiguration problems. Acta Informatica 56(7-8): 619-648 (2019) - [j126]Marthe Bonamy, Konrad K. Dabrowski
, Carl Feghali
, Matthew Johnson
, Daniël Paulusma
:
Independent Feedback Vertex Set for P5-Free Graphs. Algorithmica 81(4): 1342-1369 (2019) - [j125]Petr A. Golovach
, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
:
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica 81(7): 2795-2828 (2019) - [j124]Petr A. Golovach, Matthew Johnson, Barnaby Martin
, Daniël Paulusma
, Anthony Stewart:
Surjective H-colouring: New hardness results. Comput. 8(1): 27-42 (2019) - [j123]Daniël Paulusma
, Christophe Picouleau, Bernard Ries
:
Critical vertices and edges in H-free graphs. Discret. Appl. Math. 257: 361-367 (2019) - [j122]Matthew Johnson, Barnaby Martin
, George B. Mertzios, Daniël Paulusma:
Report on BCTCS & AlgoUK 2019. Bull. EATCS 128 (2019) - [j121]Daniël Paulusma
, Stefan Szeider:
On the parameterized complexity of (k, s)-SAT. Inf. Process. Lett. 143: 34-36 (2019) - [j120]Esther Galby, Paloma T. Lima, Daniël Paulusma
, Bernard Ries
:
Classifying k-edge colouring for H-free graphs. Inf. Process. Lett. 146: 39-43 (2019) - [j119]Konrad K. Dabrowski
, Shenwei Huang, Daniël Paulusma
:
Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. 104: 202-215 (2019) - [j118]Serge Gaspers, Shenwei Huang, Daniël Paulusma
:
Colouring square-free graphs without long induced paths. J. Comput. Syst. Sci. 106: 60-79 (2019) - [j117]Alexandre Blanché
, Konrad K. Dabrowski
, Matthew Johnson
, Daniël Paulusma
:
Hereditary graph classes: When the complexities of coloring and clique cover coincide. J. Graph Theory 91(3): 267-289 (2019) - [j116]Konrad K. Dabrowski
, François Dross
, Matthew Johnson
, Daniël Paulusma
:
Filling the complexity gaps for colouring planar and bounded degree graphs. J. Graph Theory 92(4): 377-393 (2019) - [j115]Benoît Larose, Barnaby Martin
, Daniël Paulusma
:
Surjective H-Colouring over Reflexive Digraphs. ACM Trans. Comput. Theory 11(1): 3:1-3:21 (2019) - [c107]Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma:
Generalized Matching Games for International Kidney Exchange. AAMAS 2019: 413-421 - [c106]Laurent Bulteau
, Konrad K. Dabrowski
, Guillaume Fertin
, Matthew Johnson
, Daniël Paulusma
, Stéphane Vialette:
Finding a Small Number of Colourful Components. CPM 2019: 20:1-20:14 - [c105]Carl Feghali
, Matthew Johnson
, Giacomo Paesani
, Daniël Paulusma
:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT 2019: 258-273 - [c104]Barnaby Martin
, Daniël Paulusma
, Siani Smith:
Colouring H-Free Graphs of Bounded Diameter. MFCS 2019: 14:1-14:14 - [c103]Marthe Bonamy
, Konrad K. Dabrowski
, Matthew Johnson
, Daniël Paulusma
:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. WADS 2019: 181-195 - [e2]Florin Manea, Barnaby Martin
, Daniël Paulusma, Giuseppe Primiero:
Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings. Lecture Notes in Computer Science 11558, Springer 2019, ISBN 978-3-030-22995-5 [contents] - [i62]Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Clique-Width for Hereditary Graph Classes. CoRR abs/1901.00335 (2019) - [i61]Esther Galby, Paloma T. Lima, Daniël Paulusma
, Bernard Ries:
On the Parameterized Complexity of k-Edge Colouring. CoRR abs/1901.01861 (2019) - [i60]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR abs/1908.00491 (2019) - [i59]Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev:
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. CoRR abs/1910.05254 (2019) - [i58]Maria Chudnovsky, Daniël Paulusma
, Oliver Schaudt:
Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271). Dagstuhl Reports 9(6): 125-142 (2019) - 2018
- [j114]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach
, Dieter Kratsch, Daniël Paulusma
, Anthony Stewart:
Computing square roots of graphs with low maximum degree. Discret. Appl. Math. 248: 93-101 (2018) - [j113]Péter Biró, Walter Kern, Daniël Paulusma
, Péter Wojuteczky:
The stable fixtures problem with payments. Games Econ. Behav. 108: 245-268 (2018) - [j112]Marthe Bonamy, Konrad K. Dabrowski
, Carl Feghali, Matthew Johnson
, Daniël Paulusma
:
Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. 131: 26-32 (2018) - [j111]Konrad K. Dabrowski
, Daniël Paulusma
:
On colouring (2P2, H)-free and (P5, H)-free graphs. Inf. Process. Lett. 134: 35-41 (2018) - [j110]Petr A. Golovach
, Dieter Kratsch, Daniël Paulusma
, Anthony Stewart:
Finding Cactus Roots in Polynomial Time. Theory Comput. Syst. 62(6): 1409-1426 (2018) - [j109]Konrad K. Dabrowski, Vadim V. Lozin
, Daniël Paulusma
:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Order 35(2): 253-274 (2018) - [j108]Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson
, Martin Milanic, Daniël Paulusma
:
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. 705: 75-83 (2018) - [j107]Öznur Yasar Diner
, Daniël Paulusma
, Christophe Picouleau
, Bernard Ries
:
Contraction and deletion blockers for perfect graphs and H-free graphs. Theor. Comput. Sci. 746: 49-72 (2018) - [c102]Barnaby Martin
, Daniël Paulusma
, Erik Jan van Leeuwen:
Disconnected Cuts in Claw-free Graphs. ESA 2018: 61:1-61:14 - [c101]Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná
, Daniël Paulusma
, Veronika Slívová:
Colouring (P_r+P_s)-Free Graphs. ISAAC 2018: 5:1-5:13 - [c100]Konrad K. Dabrowski, Matthew Johnson
, Giacomo Paesani, Daniël Paulusma
, Viktor Zamaraev:
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS 2018: 63:1-63:15 - [c99]Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
:
Simple Games Versus Weighted Voting Games. SAGT 2018: 69-81 - [c98]Serge Gaspers, Shenwei Huang, Daniël Paulusma
:
Colouring Square-Free Graphs without Long Induced Paths. STACS 2018: 35:1-35:15 - [c97]Benoît Larose, Barnaby Martin
, Daniël Paulusma
:
Surjective H-Colouring over Reflexive Digraphs. STACS 2018: 49:1-49:14 - [c96]Konrad K. Dabrowski
, François Dross
, Jisu Jeong
, Mamadou Moustapha Kanté
, O-joung Kwon
, Sang-il Oum
, Daniël Paulusma
:
Computing Small Pivot-Minors. WG 2018: 125-138 - [c95]Matthew Johnson
, Giacomo Paesani, Daniël Paulusma
:
Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. WG 2018: 279-291 - [i57]Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen:
Disconnected Cuts in Claw-free Graphs. CoRR abs/1803.03663 (2018) - [i56]Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová:
Colouring (P_r+P_s)-Free Graphs. CoRR abs/1804.11091 (2018) - [i55]Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma:
Simple Games versus Weighted Voting Games. CoRR abs/1805.02192 (2018) - [i54]Serge Gaspers, Shenwei Huang, Daniël Paulusma:
Colouring Square-Free Graphs without Long Induced Paths. CoRR abs/1805.08270 (2018) - [i53]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CoRR abs/1808.03561 (2018) - [i52]Walter Kern, Daniël Paulusma
:
Contracting to a Longest Path in H-Free Graphs. CoRR abs/1810.01542 (2018) - [i51]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
Classifying k-Edge Colouring for H-free Graphs. CoRR abs/1810.04379 (2018) - [i50]Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma:
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. CoRR abs/1810.08841 (2018) - [i49]Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy. CoRR abs/1811.12252 (2018) - 2017
- [j106]Petr A. Golovach
, Daniël Paulusma
, Iain A. Stewart
:
Graph editing to a fixed target. Discret. Appl. Math. 216: 181-190 (2017) - [j105]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
:
The price of connectivity for feedback vertex set. Discret. Appl. Math. 217: 132-143 (2017) - [j104]Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma
, Primoz Potocnik, Nicolas Trotignon:
Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. 231: 1-3 (2017) - [j103]Carl Feghali, Matthew Johnson
, Daniël Paulusma
:
Kempe equivalence of colourings of cubic graphs. Eur. J. Comb. 59: 1-10 (2017) - [j102]Konrad K. Dabrowski, Daniël Paulusma
:
Contracting Bipartite Graphs to Paths and Cycles. Electron. Notes Discret. Math. 61: 309-315 (2017) - [j101]Christophe Picouleau, Daniël Paulusma
, Bernard Ries
:
Reducing the Chromatic Number by Vertex or Edge Deletions. Electron. Notes Discret. Math. 62: 243-248 (2017) - [j100]Konrad K. Dabrowski
, Daniël Paulusma
:
Contracting bipartite graphs to paths and cycles. Inf. Process. Lett. 127: 37-42 (2017) - [j99]Konrad Kazimierz Dabrowski
, Petr A. Golovach
, Pim van 't Hof, Daniël Paulusma
, Dimitrios M. Thilikos:
Editing to a planar graph of given degrees. J. Comput. Syst. Sci. 85: 168-182 (2017) - [j98]Konrad K. Dabrowski
, François Dross, Daniël Paulusma
:
Colouring diamond-free graphs. J. Comput. Syst. Sci. 89: 410-431 (2017) - [j97]Petr A. Golovach
, Matthew Johnson
, Daniël Paulusma
, Jian Song:
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. J. Graph Theory 84(4): 331-363 (2017) - [j96]Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
:
Bounding the Clique-Width of H-Free Chordal Graphs. J. Graph Theory 86(1): 42-77 (2017) - [j95]Petr A. Golovach
, Dieter Kratsch, Daniël Paulusma
, Anthony Stewart:
A linear kernel for finding square roots of almost planar graphs. Theor. Comput. Sci. 689: 36-47 (2017) - [c94]Petr A. Golovach
, Matthew Johnson
, Barnaby Martin, Daniël Paulusma
, Anthony Stewart:
Surjective H-Colouring: New Hardness Results. CiE 2017: 270-281 - [c93]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson
, Daniël Paulusma
:
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC 2017: 16:1-16:12 - [c92]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson
, Daniël Paulusma
:
Recognizing Graphs Close to Bipartite Graphs. MFCS 2017: 70:1-70:14 - [c91]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson
, Vadim V. Lozin, Daniël Paulusma
, Viktor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. MFCS 2017: 73:1-73:14 - [c90]Daniël Paulusma
, Christophe Picouleau, Bernard Ries
:
Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. TAMC 2017: 470-483 - [c89]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
:
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. WG 2017: 220-233 - [c88]Petr A. Golovach
, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
:
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG 2017: 275-288 - [i48]Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
Surjective H-Colouring: New Hardness Results. CoRR abs/1701.02188 (2017) - [i47]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma:
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. CoRR abs/1703.05102 (2017) - [i46]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. CoRR abs/1705.07681 (2017) - [i45]Konrad Kazimierz Dabrowski, Daniël Paulusma:
Contracting Bipartite Graphs to Paths and Cycles. CoRR abs/1706.03750 (2017) - [i44]Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity. CoRR abs/1706.08050 (2017) - [i43]Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Critical Vertices and Edges in $H$-free Graphs. CoRR abs/1706.09043 (2017) - [i42]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. CoRR abs/1706.09052 (2017) - [i41]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR abs/1707.09383 (2017) - [i40]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR abs/1707.09402 (2017) - [i39]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR abs/1707.09817 (2017) - [i38]Benoît Larose, Barnaby Martin, Daniël Paulusma:
Surjective H-Colouring over Reflexive Digraphs. CoRR abs/1709.09486 (2017) - [i37]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes. CoRR abs/1711.08837 (2017) - [i36]Konrad K. Dabrowski, Daniël Paulusma:
On Colouring (2P2, H)-Free and (P5, H)-Free Graphs. CoRR abs/1712.02447 (2017) - [i35]Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Connected Vertex Cover for (sP1+P5)-Free Graphs. CoRR abs/1712.08362 (2017) - 2016
- [j94]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach
, Dieter Kratsch, Daniël Paulusma
:
Parameterized Algorithms for Finding Square Roots. Algorithmica 74(2): 602-629 (2016) - [j93]Matthew Johnson
, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
:
Finding Shortest Paths Between Graph Colourings. Algorithmica 75(2): 295-321 (2016) - [j92]Daniël Paulusma
, Friedrich Slivovsky, Stefan Szeider:
Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica 76(1): 168-194 (2016) - [j91]Konrad K. Dabrowski, Daniël Paulusma
:
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. Comput. J. 59(5): 650-666 (2016) - [j90]Konrad Kazimierz Dabrowski
, Daniël Paulusma
:
Classifying the clique-width of H-free bipartite graphs. Discret. Appl. Math. 200: 43-51 (2016) - [j89]Andreas Brandstädt, Konrad K. Dabrowski
, Shenwei Huang, Daniël Paulusma
:
Bounding the clique-width of H-free split graphs. Discret. Appl. Math. 211: 30-39 (2016) - [j88]Tatiana Romina Hartinger, Matthew Johnson
, Martin Milanic, Daniël Paulusma
:
The price of connectivity for cycle transversals. Eur. J. Comb. 58: 203-224 (2016) - [j87]Petr A. Golovach
, Dieter Kratsch, Daniël Paulusma
, Anthony Stewart:
Squares of Low Clique Number. Electron. Notes Discret. Math. 55: 195-198 (2016) - [j86]Konrad Kazimierz Dabrowski
, Petr A. Golovach
, Pim van 't Hof, Daniël Paulusma
:
Editing to Eulerian graphs. J. Comput. Syst. Sci. 82(2): 213-228 (2016) - [j85]Carl Feghali, Matthew Johnson
, Daniël Paulusma
:
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. J. Graph Theory 83(4): 340-358 (2016) - [j84]Marcin Kaminski, Daniël Paulusma
, Anthony Stewart, Dimitrios M. Thilikos:
Minimal disconnected cuts in planar graphs. Networks 68(4): 250-259 (2016) - [j83]Petr A. Golovach
, Daniël Paulusma
, Erik Jan van Leeuwen:
Induced disjoint paths in circular-arc graphs in linear time. Theor. Comput. Sci. 640: 70-83 (2016) - [c87]Daniël Paulusma
, Christophe Picouleau, Bernard Ries
:
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. ISCO 2016: 38-49 - [c86]Konrad K. Dabrowski, Vadim V. Lozin
, Daniël Paulusma
:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. IWOCA 2016: 253-265 - [c85]Petr A. Golovach
, Dieter Kratsch, Daniël Paulusma
, Anthony Stewart:
Finding Cactus Roots in Polynomial Time. IWOCA 2016: 361-372 - [c84]