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
- 2025
[j169]Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs I: The Framework. Algorithmica 87(3): 429-464 (2025)- [j168]Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang:
Comparing width parameters on graph classes. Eur. J. Comb. 127: 104163 (2025) - [j167]Nick Brettell
, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen:
Computing subset vertex covers in H-free graphs. Theor. Comput. Sci. 1032: 115088 (2025) - [i109]Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma:
Non-crossing H-graphs: a generalization of proper interval graphs admitting FPT algorithms. CoRR abs/2501.11192 (2025) - [i108]Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith:
A forbidden subgraph study for cut problems on graphs permitting loops and multiedges. CoRR abs/2502.07769 (2025) - 2024
- [j166]Márton Benedek, Péter Biró, Daniël Paulusma, Xin Ye:
Computing balanced solutions for large international kidney exchange schemes. Auton. Agents Multi Agent Syst. 38(1): 18 (2024) - [j165]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. Eur. J. Comb. 117: 103821 (2024) - [j164]Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving problems on generalized convex graphs via mim-width. J. Comput. Syst. Sci. 140: 103493 (2024) - [j163]Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM J. Discret. Math. 38(2): 1315-1350 (2024) - [j162]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Classifying subset feedback vertex set for H-free graphs. Theor. Comput. Sci. 1003: 114624 (2024) - [j161]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius. Theor. Comput. Sci. 1017: 114795 (2024) - [c142]Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye:
Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. AAMAS 2024: 2153-2155 - [c141]Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith:
Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CiE 2024: 233-251 - [c140]Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. ISAAC 2024: 47:1-47:18 - [c139]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. IWOCA 2024: 206-217 - [c138]Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT 2024: 29:1-29:17 - [c137]Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith:
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. WG 2024: 415-429 - [c136]Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen:
The Complexity of Diameter on H-free Graphs. WG 2024: 444-459 - [i107]Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen:
The Complexity of Diameter on H-free graphs. CoRR abs/2402.16678 (2024) - [i106]Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark H. Siggers, Siani Smith:
Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CoRR abs/2403.00497 (2024) - [i105]Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith:
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. CoRR abs/2404.11389 (2024) - 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] - [i104]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) - [i103]Felicia Lucke, Daniël Paulusma, Bernard Ries:
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. CoRR abs/2304.01099 (2023) - [i102]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) - [i101]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) - [i100]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) - [i99]Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang:
Comparing Width Parameters on Graph Classes. CoRR abs/2308.05817 (2023) - [i98]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) - [i97]Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Maximizing Matching Cuts. CoRR abs/2312.12960 (2023) - [i96]Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye:
Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded. CoRR abs/2312.16653 (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]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) - [c108]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 - [c107]Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Clique-width for hereditary graph classes. BCC 2019: 1-56 - [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]Paul S. Bonsma, Daniël Paulusma:
Using Contracted Solution Graphs for Solving Reconfiguration Problems. MFCS 2016: 20:1-20:15 - [c83]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A Linear Kernel for Finding Square Roots of Almost Planar Graphs. SWAT 2016: 4:1-4:14 - [c82]Konrad K. Dabrowski, François Dross, Daniël Paulusma:
Colouring Diamond-free Graphs. SWAT 2016: 16:1-16:14 - [i34]David Allison, Daniël Paulusma:
New Bounds for the Snake-in-the-Box Problem. CoRR abs/1603.05119 (2016) - [i33]Alexandre Blanché, Konrad Kazimierz Dabrowski, Matthew Johnson, Daniël Paulusma:
Colouring on Hereditary Graph Classes Closed under Complementation. CoRR abs/1607.06757 (2016) - [i32]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
A Linear Kernel for Finding Square Roots of Almost Planar Graphs. CoRR abs/1608.06136 (2016) - [i31]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Squares of Low Maximum Degree. CoRR abs/1608.06142 (2016) - [i30]Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. CoRR abs/1611.03671 (2016) - 2015
- [j82]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. Algorithmica 71(1): 21-35 (2015) - [j81]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
Modifying a Graph Using Vertex Elimination. Algorithmica 72(1): 99-125 (2015) - [j80]Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs. Comput. J. 58(11): 3074-3088 (2015) - [j79]Petr A. Golovach, Daniël Paulusma, Bernard Ries:
Coloring graphs characterized by a forbidden subgraph. Discret. Appl. Math. 180: 101-110 (2015) - [j78]Matthew Johnson, Daniël Paulusma, Anthony Stewart:
Knocking out Pk-free graphs. Discret. Appl. Math. 190-191: 100-108 (2015) - [j77]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe Equivalence of Colourings of Cubic Graphs. Electron. Notes Discret. Math. 49: 243-249 (2015) - [j76]Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Split Graphs. Electron. Notes Discret. Math. 49: 497-503 (2015) - [j75]Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma:
What Graphs are 2-Dot Product Graphs? Electron. Notes Discret. Math. 49: 705-711 (2015) - [j74]Barnaby Martin, Daniël Paulusma:
The computational complexity of disconnected cut and 2K2-partition. J. Comb. Theory B 111: 17-37 (2015) - [j73]Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory 79(4): 282-299 (2015) - [j72]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. SIAM J. Discret. Math. 29(1): 348-375 (2015) - [j71]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
Algorithms for diversity and clustering in social networks through dot product graphs. Soc. Networks 41: 48-55 (2015) - [j70]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590: 86-95 (2015) - [c81]Konrad K. Dabrowski, Daniël Paulusma:
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. CIAC 2015: 167-181 - [c80]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction Blockers for Graphs with Forbidden Induced Paths. CIAC 2015: 194-207 - [c79]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. CSR 2015: 143-156 - [c78]Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos:
Minimal Disconnected Cuts in Planar Graphs. FCT 2015: 243-254 - [c77]Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. IWOCA 2015: 100-111 - [c76]Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding Clique-Width via Perfect Graphs. LATA 2015: 676-688 - [c75]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) 2015: 139-150 - [c74]Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
The Price of Connectivity for Cycle Transversals. MFCS (2) 2015: 395-406 - [c73]Daniël Paulusma:
Open Problems on Graph Coloring for Special Graph Classes. WG 2015: 16-30 - [c72]Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky:
The Stable Fixtures Problem with Payments. WG 2015: 49-63 - [i29]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem and its Consequences. CoRR abs/1501.05800 (2015) - [i28]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. CoRR abs/1502.06948 (2015) - [i27]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe Equivalence of Colourings of Cubic Graphs. CoRR abs/1503.03430 (2015) - [i26]Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. CoRR abs/1506.06564 (2015) - [i25]Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. CoRR abs/1508.02773 (2015) - [i24]Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky:
The Stable Fixtures Problem with Payments. CoRR abs/1508.06420 (2015) - [i23]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of $H$-free Split Graphs. CoRR abs/1509.04273 (2015) - [i22]Paul S. Bonsma, Daniël Paulusma:
Using Contracted Solution Graphs for Solving Reconfiguration Problems. CoRR abs/1509.06357 (2015) - [i21]Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma:
The Price of Connectivity for Feedback Vertex Set. CoRR abs/1510.02639 (2015) - [i20]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
What Graphs are 2-Dot Product Graphs? CoRR abs/1511.05009 (2015) - [i19]Konrad Kazimierz Dabrowski, François Dross, Daniël Paulusma:
Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs. CoRR abs/1512.07849 (2015) - 2014
- [j69]Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica 51(7): 473-497 (2014) - [j68]Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica 69(3): 501-521 (2014) - [j67]Petr A. Golovach, Daniël Paulusma:
List coloring in the absence of two subgraphs. Discret. Appl. Math. 166: 123-130 (2014) - [j66]Petr A. Golovach, Daniël Paulusma, Jian Song:
Coloring graphs without short cycles and long induced paths. Discret. Appl. Math. 167: 107-120 (2014) - [j65]Jérémie Chalopin, Daniël Paulusma:
Packing bipartite graphs with covers of complete bipartite graphs. Discret. Appl. Math. 168: 40-50 (2014) - [j64]Petr A. Golovach, Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos:
Lift-contractions. Eur. J. Comb. 35: 286-296 (2014) - [j63]Petr A. Golovach, Daniël Paulusma, Jian Song:
Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput. 237: 204-214 (2014) - [j62]Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 27(1): 132-143 (2014) - [j61]Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck:
Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput. Syst. 54(2): 244-260 (2014) - [j60]Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma:
Colouring of graphs with Ramsey-type forbidden subgraphs. Theor. Comput. Sci. 522: 34-43 (2014) - [j59]Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
Solutions for the stable roommates problem with payments. Theor. Comput. Sci. 540: 53-61 (2014) - [c71]Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. AAIM 2014: 162-173 - [c70]Konrad Kazimierz Dabrowski, Daniël Paulusma:
Classifying the Clique-Width of H-Free Bipartite Graphs. COCOON 2014: 489-500 - [c69]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. FSTTCS 2014: 97-108 - [c68]Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Finding Shortest Paths Between Graph Colourings. IPEC 2014: 221-233 - [c67]Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma:
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. MFCS (2) 2014: 57-68 - [c66]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem. MFCS (2) 2014: 287-298 - [c65]Matthew Johnson, Daniël Paulusma, Anthony Stewart:
Knocking Out P k -free Graphs. MFCS (2) 2014: 396-407 - [c64]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. WG 2014: 225-237 - [i18]Konrad K. Dabrowski, Daniël Paulusma:
Classifying the Clique-Width of $H$-Free Bipartite Graphs. CoRR abs/1402.7060 (2014) - [i17]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. CoRR abs/1403.0789 (2014) - [i16]Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR abs/1403.6347 (2014) - [i15]Konrad K. Dabrowski, Daniël Paulusma:
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs. CoRR abs/1405.7092 (2014) - [i14]Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding Clique-Width via Perfect Graphs. CoRR abs/1406.6298 (2014) - [i13]Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs. CoRR abs/1407.1480 (2014) - [i12]Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song:
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs. CoRR abs/1407.1482 (2014) - [i11]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR abs/1408.6676 (2014) - [i10]Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. CoRR abs/1410.6863 (2014) - 2013
- [j58]Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65(1): 129-145 (2013) - [j57]Petr A. Golovach, Daniël Paulusma, Jian Song:
4-coloring H-free graphs when H is small. Discret. Appl. Math. 161(1-2): 140-150 (2013) - [j56]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Characterizing graphs of small carving-width. Discret. Appl. Math. 161(13-14): 1888-1893 (2013) - [j55]Jirí Fiala, Marcin Kaminski, Daniël Paulusma:
A note on contracting claw-free graphs. Discret. Math. Theor. Comput. Sci. 15(2): 223-232 (2013) - [j54]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three complexity results on coloring Pk-free graphs. Eur. J. Comb. 34(3): 609-619 (2013) - [j53]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Choosability on H-free graphs. Inf. Process. Lett. 113(4): 107-110 (2013) - [j52]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining planarity by contracting few edges. Theor. Comput. Sci. 476: 38-46 (2013) - [j51]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. 481: 74-84 (2013) - [j50]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of acyclic and almost acyclic CNF formulas. Theor. Comput. Sci. 481: 85-99 (2013) - [j49]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Detecting induced minors in AT-free graphs. Theor. Comput. Sci. 482: 20-32 (2013) - [c63]Petr A. Golovach, Daniël Paulusma:
List Coloring in the Absence of Two Subgraphs. CIAC 2013: 288-299 - [c62]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. FCT 2013: 121-132 - [c61]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. ISAAC 2013: 130-140 - [c60]Petr A. Golovach, Daniël Paulusma, Iain A. Stewart:
Graph Editing to a Fixed Target. IWOCA 2013: 192-205 - [c59]Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. IPEC 2013: 16-27 - [c58]Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider:
Model Counting for CNF Formulas of Bounded Modular Treewidth. STACS 2013: 55-66 - [c57]Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG 2013: 127-138 - [c56]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Sparse Square Roots. WG 2013: 177-188 - [c55]Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma:
Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. WG 2013: 201-212 - [i9]Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. CoRR abs/1301.5953 (2013) - [i8]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Parameterized Algorithms for Finding Square Roots. CoRR abs/1310.5469 (2013) - 2012
- [j48]Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding vertex-surjective graph homomorphisms. Acta Informatica 49(6): 381-394 (2012) - [j47]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-Path Problem for Claw-free Graphs. Algorithmica 62(1-2): 499-519 (2012) - [j46]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Induced Paths of Given Parity in Claw-Free Graphs. Algorithmica 62(1-2): 537-563 (2012) - [j45]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Containment relations in split graphs. Discret. Appl. Math. 160(1-2): 155-163 (2012) - [j44]Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma:
Distance three labelings of trees. Discret. Appl. Math. 160(6): 764-779 (2012) - [j43]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos:
On graph contractions and induced minors. Discret. Appl. Math. 160(6): 799-809 (2012) - [j42]Péter Biró, Walter Kern, Daniël Paulusma:
Computing solutions for matching games. Int. J. Game Theory 41(1): 75-90 (2012) - [j41]Iain A. Stewart, Daniël Paulusma, Matthew Johnson:
Editorial. J. Discrete Algorithms 12: 1 (2012) - [j40]Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms 14: 173-188 (2012) - [j39]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms 15: 56-62 (2012) - [j38]Jirí Fiala, Marcin Kaminski, Daniël Paulusma:
Detecting induced star-like minors in polynomial time. J. Discrete Algorithms 17: 74-85 (2012) - [j37]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. 414(1): 9-19 (2012) - [j36]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. 420: 28-35 (2012) - [j35]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. Theor. Comput. Sci. 423: 1-10 (2012) - [j34]Petr A. Golovach, Daniël Paulusma, Jian Song:
Computing vertex-surjective homomorphisms to partially reflexive trees. Theor. Comput. Sci. 457: 86-100 (2012) - [c54]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Characterizing Graphs of Small Carving-Width. COCOA 2012: 360-370 - [c53]Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding Vertex-Surjective Graph Homomorphisms. CSR 2012: 160-171 - [c52]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. ESA 2012: 515-526 - [c51]Petr A. Golovach, Daniël Paulusma, Jian Song:
Closing Complexity Gaps for Coloring Problems on H-Free Graphs. ISAAC 2012: 14-23 - [c50]Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Detecting Induced Minors in AT-Free Graphs. ISAAC 2012: 495-505 - [c49]Petr A. Golovach, Daniël Paulusma, Bernard Ries:
Coloring Graphs Characterized by a Forbidden Subgraph. MFCS 2012: 443-454 - [c48]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges. MFCS 2012: 455-466 - [c47]Petr A. Golovach, Daniël Paulusma, Jian Song:
4-Coloring H-Free Graphs When H Is Small. SOFSEM 2012: 289-300 - [c46]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-Free Graphs. SWAT 2012: 153-164 - [c45]Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
Solutions for the Stable Roommates Problem with Payments. WG 2012: 69-80 - [c44]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
How to Eliminate a Graph. WG 2012: 320-331 - [i7]Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. CoRR abs/1202.4419 (2012) - [i6]Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding vertex-surjective graph homomorphisms. CoRR abs/1204.2124 (2012) - [i5]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges. CoRR abs/1204.5113 (2012) - 2011
- [j33]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
On disconnected cuts and separators. Discret. Appl. Math. 159(13): 1345-1351 (2011) - [j32]Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. 38: 161-166 (2011) - [j31]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Lift Contractions. Electron. Notes Discret. Math. 38: 407-412 (2011) - [j30]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms 9(3): 299-306 (2011) - [j29]Jérémie Chalopin, Daniël Paulusma:
Graph labelings derived from models in distributed computing: A complete complexity classification. Networks 58(3): 207-231 (2011) - [j28]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Parameterizing cut sets in a graph by the number of their components. Theor. Comput. Sci. 412(45): 6340-6350 (2011) - [j27]Daniël Paulusma, Johan M. M. van Rooij:
On partitioning a graph into two connected subgraphs. Theor. Comput. Sci. 412(48): 6761-6769 (2011) - [c43]Barnaby Martin, Daniël Paulusma:
The Computational Complexity of Disconnected Cut and 2K 2-Partition. CP 2011: 561-575 - [c42]Petr A. Golovach, Daniël Paulusma, Jian Song:
Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. CSR 2011: 261-274 - [c41]Petr A. Golovach, Daniël Paulusma, Jian Song:
Coloring Graphs without Short Cycles and Long Induced Paths. FCT 2011: 193-204 - [c40]Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC 2011: 110-119 - [c39]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Increasing the Minimum Degree of a Graph by Contractions. IPEC 2011: 67-79 - [c38]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma:
Contracting a Chordal Graph to a Split Graph or a Tree. MFCS 2011: 339-350 - [c37]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). SAT 2011: 47-60 - [c36]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. WG 2011: 119-130 - [i4]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II). CoRR abs/1104.4279 (2011) - [i3]Barnaby Martin, Daniël Paulusma:
The Computational Complexity of Disconnected Cut and 2K2-Partition. CoRR abs/1104.4779 (2011) - 2010
- [j26]Pim van 't Hof, Daniël Paulusma:
A new characterization of P6-free graphs. Discret. Appl. Math. 158(7): 731-740 (2010) - [j25]Matthew Johnson, Daniël Paulusma, Chantal Wood:
Path factors and parallel knock-out schemes of almost claw-free graphs. Discret. Math. 310(9): 1413-1423 (2010) - [j24]Hajo Broersma, Daniël Paulusma:
Computing sharp 2-factors in claw-free graphs. J. Discrete Algorithms 8(3): 321-329 (2010) - [j23]Jirí Fiala, Daniël Paulusma:
Comparing Universal Covers in Polynomial Time. Theory Comput. Syst. 46(4): 620-635 (2010) - [j22]Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij:
Computing role assignments of chordal graphs. Theor. Comput. Sci. 411(40-42): 3601-3613 (2010) - [c35]Jérémie Chalopin, Daniël Paulusma:
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. CIAC 2010: 276-287 - [c34]Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck:
Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR 2010: 240-251 - [c33]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Contractions of Planar Graphs in Polynomial Time. ESA (1) 2010: 122-133 - [c32]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. FSTTCS 2010: 84-95 - [c31]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167 - [c30]Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA 2010: 167-180 - [c29]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos:
On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514 - [c28]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-path Problem for Claw-free Graphs. STACS 2010: 371-382 - [c27]Péter Biró, Walter Kern, Daniël Paulusma:
On Solution Concepts for Matching Games. TAMC 2010: 117-127 - [c26]Petr A. Golovach, Bernard Lidický, Daniël Paulusma:
L(2, 1, 1)-Labeling Is NP-Complete for Trees. TAMC 2010: 211-221 - [c25]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. WG 2010: 63-74 - [i2]Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Contracting planar graphs to contractions of triangulations. CoRR abs/1012.2460 (2010)
2000 – 2009
- 2009
- [j21]Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto:
lambda-backbone colorings along pairwise disjoint stars and matchings. Discret. Math. 309(18): 5596-5609 (2009) - [j20]Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discuss. Math. Graph Theory 29(1): 143-162 (2009) - [j19]Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto:
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. Graphs Comb. 25(4): 427-460 (2009) - [j18]Walter Kern, Daniël Paulusma:
On the Core and f-Nucleolus of Flow Games. Math. Oper. Res. 34(4): 981-991 (2009) - [j17]Hajo Broersma, Matthew Johnson, Daniël Paulusma:
Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009) - [j16]Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider:
Covering graphs with few complete bipartite subgraphs. Theor. Comput. Sci. 410(21-23): 2045-2053 (2009) - [j15]Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger:
Partitioning graphs into connected parts. Theor. Comput. Sci. 410(47-49): 4834-4843 (2009) - [c24]Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger:
Partitioning Graphs into Connected Parts. CSR 2009: 143-154 - [c23]Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij:
Computing Role Assignments of Chordal Graphs. FCT 2009: 193-204 - [c22]Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009: 514-523 - [c21]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Parameterizing Cut Sets in a Graph by the Number of Their Components. ISAAC 2009: 605-615 - [c20]Daniël Paulusma, Johan M. M. van Rooij:
On Partitioning a Graph into Two Connected Subgraphs. ISAAC 2009: 1215-1224 - [c19]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104 - [c18]Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53 - [c17]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Induced Paths of Given Parity in Claw-Free Graphs. WG 2009: 341-352 - [i1]Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma:
The k-in-a-path problem for claw-free graphs. CoRR abs/0912.5468 (2009) - 2008
- [j14]Daniël Paulusma, Kiyoshi Yoshimoto:
Relative length of longest paths and longest cycles in triangle-free graphs. Discret. Math. 308(7): 1222-1229 (2008) - [j13]Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4): 850-880 (2008) - [j12]Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. Networks 51(3): 178-189 (2008) - [j11]Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The computational complexity of graph contractions II: Two tough polynomially solvable cases. Networks 52(1): 32-56 (2008) - [j10]Hajo Broersma, Agostino Capponi, Daniël Paulusma:
A New Algorithm for On-line Coloring Bipartite Graphs. SIAM J. Discret. Math. 22(1): 72-91 (2008) - [j9]Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393(1-3): 182-195 (2008) - [c16]Pim van 't Hof, Daniël Paulusma:
A New Characterization of P6-Free Graphs. COCOON 2008: 415-424 - [c15]Jirí Fiala, Daniël Paulusma:
Comparing Universal Covers in Polynomial Time. CSR 2008: 158-167 - [c14]Matthew Johnson, Daniël Paulusma, Chantal Wood:
Path factors and parallel knock-out schemes of almost claw-free graphs. IWOCA 2008: 27-41 - [c13]Hajo Broersma, Daniël Paulusma:
Computing Sharp 2-Factors in Claw-Free Graphs. MFCS 2008: 193-204 - [e1]Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma:
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Lecture Notes in Computer Science 5344, 2008, ISBN 978-3-540-92247-6 [contents] - 2007
- [j8]Daniël Paulusma, Kiyoshi Yoshimoto:
Cycles through specified vertices in triangle-free graphs. Discuss. Math. Graph Theory 27(1): 179-191 (2007) - [j7]Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto:
On components of 2-factors in claw-free graphs. Electron. Notes Discret. Math. 29: 289-293 (2007) - [c12]Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider:
Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351 - [c11]Hajo Broersma, Matthew Johnson, Daniël Paulusma:
Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340 - [c10]Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. SOFSEM (1) 2007: 188-199 - 2006
- [c9]Hajo Broersma, Agostino Capponi, Daniël Paulusma:
On-Line Coloring of H-Free Bipartite Graphs. CIAC 2006: 284-295 - [c8]Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261 - [c7]Jérémie Chalopin, Daniël Paulusma:
Graph Labelings Derived from Models in Distributed Computing. WG 2006: 301-312 - 2005
- [j6]Jirí Fiala, Daniël Paulusma:
A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349(1): 67-81 (2005) - [c6]Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351 - [c5]Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG 2005: 115-126 - 2004
- [j5]Walter Kern, Daniël Paulusma:
The computational complexity of the elimination problem in generalized sports competitions. Discret. Optim. 1(2): 205-214 (2004) - [c4]Lodewijk T. Smit, Gerard J. M. Smit, Johann L. Hurink, Hajo Broersma, Daniël Paulusma, Pascal T. Wolkotte:
Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. FPT 2004: 421-424 - [c3]Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger:
The Computational Complexity of the Minimum Weight Processor Assignment Problem. WG 2004: 189-200 - 2003
- [j4]Walter Kern, Daniël Paulusma:
Matching Games: The Least Core and the Nucleolus. Math. Oper. Res. 28(2): 294-308 (2003) - [c2]Jirí Fiala, Daniël Paulusma:
The Computational Complexity of the Role Assignment Problem. ICALP 2003: 817-828 - [c1]Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The Complexity of Graph Contractions. WG 2003: 322-333 - 2001
- [j3]Walter Kern, Daniël Paulusma:
The new FIFA rules are hard: complexity aspects of sports competitions. Discret. Appl. Math. 108(3): 317-323 (2001) - [j2]Theo S. H. Driessen, Daniël Paulusma:
Two extensions of the Shapley value for cooperative games. Math. Methods Oper. Res. 53(1): 35-49 (2001) - 2000
- [j1]Ulrich Faigle, Walter Kern, Daniël Paulusma:
Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Methods Oper. Res. 52(1): 23-38 (2000)
Coauthor Index
Hajo Broersma
aka: Haitze J. Broersma
aka: Haitze J. Broersma
Konrad K. Dabrowski
aka: Konrad Kazimierz Dabrowski
aka: Konrad Kazimierz Dabrowski
[j165] [j163] [j156] [i98] [c127] [i94] [j140] [j137] [j136] [c124] [e3] [j132] [j131] [j128] [c110] [i71] [i69] [j126] [j119] [j117] [j116] [c107] [c106] [c103] [i62] [i60] [i59] [j112] [j111] [j109] [c100] [c96] [i53] [i49] [j102] [j100] [j99] [j98] [j96] [c93] [c92] [c91] [c89] [i46] [i45] [i41] [i40] [i39] [i37] [i36] [j91] [j90] [j89] [j86] [c86] [c82] [i33] [i30] [j76] [c81] [c79] [c77] [c76] [c75] [i28] [i26] [i25] [i23] [i19] [j60] [c70] [c69] [i18] [i15] [i14] [i10] [c55]
[j154] [j150] [j144] [c120] [c115] [i81] [i79] [i63] [j125] [j124] [j114] [j110] [j106] [j99] [j97] [j95] [c94] [c88] [i48] [i47] [j94] [j87] [j86] [j83] [c85] [c83] [i32] [i31] [j82] [j81] [j79] [j73] [j72] [c79] [i25] [j69] [j68] [j67] [j66] [j64] [j63] [j60] [j59] [c69] [c64] [i17] [i12] [i10] [j57] [j54] [j53] [j52] [j51] [j49] [c63] [c60] [c59] [c57] [c56] [c55] [i9] [i8] [j48] [j45] [j44] [j39] [j37] [j36] [j35] [j34] [c53] [c52] [c51] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [i7] [i6] [i5] [j31] [c42] [c41] [c40] [c39] [c38] [c36] [c31] [c26] [c25] [c22] [c19]
[j169] [j165] [c142] [c139] [c138] [j157] [c133] [i102] [i101] [i96] [j149] [j145] [i93] [i88] [i87] [j140] [j138] [j137] [j135] [c124] [c116] [e3] [j134] [j132] [j128] [c111] [c109] [i73] [i72] [i70] [j126] [j124] [j122] [j117] [j116] [c107] [c106] [c105] [c103] [i62] [i60] [i59] [j112] [j108] [c100] [c95] [i53] [i49] [j103] [j97] [c94] [c93] [c92] [c91] [i48] [i46] [i44] [i41] [i40] [i39] [i35] [j93] [j88] [j85] [i33] [j80] [j78] [j77] [j75] [j71] [c77] [c74] [i29] [i27] [i26] [i20] [j62] [j61] [c71] [c68] [c66] [c65] [i16] [i13] [i12] [c61] [j41] [j32] [j25] [c34] [j17] [j9] [c14] [c11] [c8]
Marcin Kaminski 0001
aka: Marcin Jakub Kaminski
aka: Marcin Jakub Kaminski
[j169] [i108] [c141] [c140] [c139] [c138] [i106] [j160] [j158] [j155] [c133] [i102] [i101] [j154] [j153] [j151] [j146] [j144] [j143] [j141] [c129] [c128] [c126] [i92] [i91] [i88] [i87] [i86] [c123] [c122] [c121] [c120] [c119] [c115] [i83] [i82] [i81] [i79] [i78] [i76] [j130] [c114] [i66] [i65] [i64] [j124] [j122] [j115] [c104] [e2] [c102] [c97] [i57] [c94] [i48] [i38] [j74] [j48] [c53] [i6] [c43] [i3]
[j169] [i108] [c141] [c140] [c139] [c138] [c137] [i106] [i105] [j160] [j158] [j155] [c133] [i102] [i101] [j154] [j153] [j151] [j146] [j144] [j143] [j141] [c129] [c128] [c126] [i92] [i91] [i88] [i87] [i86] [c123] [c122] [c121] [c120] [c119] [c115] [i83] [i82] [i81] [i79] [i78] [i76] [c114] [i66] [i65] [i64] [c104]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-22 00:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
