Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanië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
- 2023
[j160]Barnaby Martin
, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica 85(9): 2580-2604 (2023)- [j159]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. Algorithmica 85(10): 3290-3322 (2023) - [j158]Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith:
The Complexity of L(p, q)-Edge-Labelling. Algorithmica 85(11): 3406-3429 (2023) - [j157]Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye:
The Complexity of Matching Games: A Survey. J. Artif. Intell. Res. 77: 459-485 (2023) - [j156]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-width: Harnessing the power of atoms. J. Graph Theory 104(4): 769-810 (2023) - [j155]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Few induced disjoint paths for H-free graphs. Theor. Comput. Sci. 939: 182-193 (2023) - [c135]Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Computing Subset Vertex Covers in H-Free Graphs. FCT 2023: 88-102 - [c134]Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC 2023: 31:1-31:16 - [c133]Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS 2023: 57:1-57:15 - [c132]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. MFCS 2023: 64:1-64:15 - [e4]Daniël Paulusma, Bernard Ries:
Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers. Lecture Notes in Computer Science 14093, Springer 2023, ISBN 978-3-031-43379-5 [contents] - [i102]Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma:
Partitioned Matching Games for International Kidney Exchange. CoRR abs/2301.13181 (2023) - [i101]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. CoRR abs/2304.01099 (2023) - [i100]Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR abs/2305.01104 (2023) - [i99]Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR abs/2305.01613 (2023) - [i98]Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Computing Subset Vertex Covers in H-Free Graphs. CoRR abs/2307.05701 (2023) - [i97]Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang:
Comparing Width Parameters on Graph Classes. CoRR abs/2308.05817 (2023) - [i96]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Computing pivot-minors. CoRR abs/2311.04656 (2023) - 2022
- [j154]Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith:
Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. 29(2) (2022) - [j153]Barnaby Martin, Daniël Paulusma, Siani Smith:
Colouring graphs of bounded diameter in the absence of small cycles. Discret. Appl. Math. 314: 150-161 (2022) - [j152]Nick Brettell, Jake Horsfield, Andrea Munaro, Daniël Paulusma:
List k-colouring Pt-free graphs: A Mim-width perspective. Inf. Process. Lett. 173: 106168 (2022) - [j151]Barnaby Martin, Daniël Paulusma, Siani Smith:
Hard problems that quickly become very easy. Inf. Process. Lett. 174: 106213 (2022) - [j150]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-free graphs. J. Comput. Syst. Sci. 124: 170-191 (2022) - [j149]Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Odd Cycle Transversals in H-free graphs. J. Comput. Syst. Sci. 128: 71-85 (2022) - [j148]Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma:
Bounding the mim-width of hereditary graph classes. J. Graph Theory 99(1): 117-151 (2022) - [j147]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. SIAM J. Discret. Math. 36(4): 2453-2472 (2022) - [j146]Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Disjoint paths and connected subgraphs for H-free graphs. Theor. Comput. Sci. 898: 59-68 (2022) - [j145]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing subset transversals in H-free graphs. Theor. Comput. Sci. 902: 76-92 (2022) - [j144]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Partitioning H-free graphs of bounded diameter. Theor. Comput. Sci. 930: 37-52 (2022) - [j143]Barnaby Martin, Daniël Paulusma, Siani Smith:
Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter. Theor. Comput. Sci. 931: 104-116 (2022) - [j142]Felicia Lucke, Daniël Paulusma, Bernard Ries:
On the complexity of matching cut for graphs of bounded radius and H-free graphs. Theor. Comput. Sci. 936: 33-42 (2022) - [j141]Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný:
QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. 23(3): 14:1-14:22 (2022) - [c131]Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma:
Computing Balanced Solutions for Large International Kidney Exchange Schemes. AAMAS 2022: 82-90 - [c130]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. ISAAC 2022: 22:1-22:16 - [c129]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Few Induced Disjoint Paths for H-Free Graphs. ISCO 2022: 89-101 - [c128]Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith:
The Complexity of L(p, q)-Edge-Labelling. WALCOM 2022: 175-186 - [c127]Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
An Algorithmic Framework for Locally Constrained Homomorphisms. WG 2022: 114-128 - [c126]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. WG 2022: 398-411 - [c125]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Classifying Subset Feedback Vertex Set for H-Free Graphs. WG 2022: 412-424 - [i95]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Classifying Subset Feedback Vertex Set for H-Free Graphs. CoRR abs/2201.00430 (2022) - [i94]Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR abs/2201.11731 (2022) - [i93]Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye:
The Complexity of Matching Games: A Survey. CoRR abs/2202.06898 (2022) - [i92]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR abs/2202.11595 (2022) - [i91]Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Few Induced Disjoint Paths for H-Free Graphs. CoRR abs/2203.03319 (2022) - [i90]Felicia Lucke, Daniël Paulusma, Bernard Ries:
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs. CoRR abs/2204.07129 (2022) - [i89]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Finding Matching Cuts in H-Free Graphs. CoRR abs/2207.07095 (2022) - [i88]Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR abs/2211.12203 (2022) - [i87]Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework For Forbidden Subgraphs. CoRR abs/2211.12887 (2022) - [i86]Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. CoRR abs/2211.14214 (2022) - [i85]Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR abs/2212.12317 (2022) - [i84]Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal:
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports 12(11): 109-123 (2022) - 2021
- [j140]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) - [j139]Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still:
In Memoriam Walter Kern. Discret. Appl. Math. 303: 2-3 (2021) - [j138]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
What Graphs are 2-Dot Product Graphs? Int. J. Comput. Geom. Appl. 31(1): 1-16 (2021) - [j137]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory 98(1): 81-109 (2021) - [j136]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. SIAM J. Discret. Math. 35(4): 2922-2945 (2021) - [j135]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. Theor. Comput. Sci. 867: 30-39 (2021) - [c124]Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Preface. BCC 2021: vii-viii - [c123]Barnaby Martin, Daniël Paulusma, Siani Smith:
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CIAC 2021: 367-380 - [c122]Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Injective Colouring for H-Free Graphs. CSR 2021: 18-30 - [c121]Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný:
QCSP on Reflexive Tournaments. ESA 2021: 58:1-58:15 - [c120]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Partitioning H-Free Graphs of Bounded Diameter. ISAAC 2021: 21:1-21:14 - [c119]Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA 2021: 414-427 - [c118]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. MFCS 2021: 82:1-82:14 - [c117]Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving Problems on Generalized Convex Graphs via Mim-Width. WADS 2021: 200-214 - [c116]Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. WADS 2021: 229-242 - [c115]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG 2021: 336-348 - [e3]Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. Cambridge University Press 2021, ISBN 978-1-009-01888-3 [contents] - [i83]Barnaby Martin, Daniël Paulusma, Siani Smith:
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CoRR abs/2101.07856 (2021) - [i82]Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný:
QCSP on Reflexive Tournaments. CoRR abs/2104.10570 (2021) - [i81]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR abs/2104.10593 (2021) - [i80]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. CoRR abs/2105.02736 (2021) - [i79]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Partitioning H-Free Graphs of Bounded Diameter. CoRR abs/2105.04588 (2021) - [i78]Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR abs/2105.06349 (2021) - [i77]Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma:
Computing Balanced Solutions for Large International Kidney Exchange Schemes. CoRR abs/2109.06788 (2021) - [i76]Barnaby Martin, Daniël Paulusma, Siani Smith:
Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter. CoRR abs/2111.11897 (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) - [c114]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 - [c113]Walter Kern, Daniël Paulusma:
Contracting to a Longest Path in H-Free Graphs. ISAAC 2020: 22:1-22:18 - [c112]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 - [c111]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 - [c110]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 - [c109]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]Gaétan 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]