Daniël Paulusma

446 papers A* 2A 14B 82C 25Misc 9Journal 294Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Colouring Probe H-Free Graphs. STACS Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
2026	J	`jnl`	Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. Algorithmica Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2026	J	`jnl`	Optimal b-Colourings and Fall Colourings in H-Free Graphs. CoRR Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David F. Manlove, Fabricio Mendoza, Daniël Paulusma
2026	J	`jnl`	Steiner Forest for CoRR Tala Eagling-Vose, David C. Kutner, Felicia Lucke, Dániel Marx, Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2025	J	`jnl`	A forbidden subgraph study for cut problems on graphs permitting loops and multiedges. CoRR Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith
2025	J	`jnl`	Acyclic, star and injective colouring: A complexity picture for H-free graphs. J. Comput. Syst. Sci. Jan Bok, Nikola Jedlicková, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
2025	—	`conf`	Atoms Versus Avoiding Simplicial Vertices. CIAC (2) Karl Boddy, Konrad K. Dabrowski, Daniël Paulusma
2025	B	`conf`	Bounding Width on Graph Classes of Constant Diameter. WG Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2025	J	`jnl`	Bounding Width on Graph Classes of Constant Diameter. CoRR Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2025	J	`jnl`	Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification. CoRR Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Daniël Paulusma
2025	J	`jnl`	Colouring Probe CoRR Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
2025	J	`jnl`	Comparing width parameters on graph classes. Eur. J. Comb. Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang
2025	J	`jnl`	Complexity Framework for Forbidden Subgraphs I: The Framework. Algorithmica Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025	A*	`conf`	Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters. EC Rachael Colley, David F. Manlove, Daniël Paulusma, Mengxiao Zhang
2025	J	`jnl`	Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters. CoRR Rachael Colley, David F. Manlove, Daniël Paulusma, Mengxiao Zhang
2025	J	`jnl`	Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. J. Comput. Syst. Sci. Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025	J	`jnl`	Computing subset vertex covers in H-free graphs. Theor. Comput. Sci. Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
2025	J	`jnl`	Finding CoRR Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2025	B	`conf`	Finding d-Cuts in Claw-Free Graphs. ISAAC Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith
2025	J	`jnl`	Finding d-Cuts in Claw-free Graphs. CoRR Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith
2025	B	`conf`	Finding d-Cuts in Probe H-Free Graphs. FCT Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2025	J	`jnl`	Graph Classes Closed under Self-intersection. CoRR Konrad K. Dabrowski, Vadim V. Lozin, Martin Milanic, Andrea Munaro, Daniël Paulusma, Viktor Zamaraev
2025	J	`jnl`	Matching Cuts in Graphs of High Girth and H-Free Graphs. Algorithmica Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2025	J	`jnl`	Non-crossing CoRR Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma
2025	B	`conf`	Non-crossing H-Graphs: A Generalization of Proper Interval Graphs Admitting FPT Algorithms. WG Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma
2025	J	`jnl`	Partitioned matching games for international kidney exchange. Math. Program. Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
2025	J	`jnl`	Solving Problems on Graphs: From Structure to Algorithms (Dagstuhl Seminar 25041). Dagstuhl Reports Akanksha Agrawal, Maria Chudnovsky, Daniël Paulusma, Oliver Schaudt, Julien Codsi
2025	J	`jnl`	The Complexity of Diameter on ${H}$-Free Graphs. SIAM J. Discret. Math. Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
2024	J	`jnl`	An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM J. Discret. Math. Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2024	J	`jnl`	Classifying subset feedback vertex set for H-free graphs. Theor. Comput. Sci. Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2024	B	`conf`	Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. ISAAC Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen
2024	C	`conf`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024	A	`conf`	Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. AAMAS Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
2024	J	`jnl`	Computing balanced solutions for large international kidney exchange schemes. Auton. Agents Multi Agent Syst. Márton Benedek, Péter Biró, Daniël Paulusma, Xin Ye
2024	J	`jnl`	Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius. Theor. Comput. Sci. Felicia Lucke, Daniël Paulusma, Bernard Ries
2024	—	`conf`	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024	J	`jnl`	Finding CoRR Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2024	B	`conf`	Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. WG Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2024	C	`conf`	Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CiE Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith
2024	J	`jnl`	Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CoRR Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark H. Siggers, Siani Smith
2024	J	`jnl`	On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Eur. J. Comb. Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
2024	J	`jnl`	Solving problems on generalized convex graphs via mim-width. J. Comput. Syst. Sci. Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma
2024	B	`conf`	The Complexity of Diameter on H-free Graphs. WG Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
2024	J	`jnl`	The Complexity of Diameter on H-free graphs. CoRR Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
2023	J	`jnl`	Clique-width: Harnessing the power of atoms. J. Graph Theory Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
2023	J	`jnl`	Comparing Width Parameters on Graph Classes. CoRR Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang
2023	B	`conf`	Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded. CoRR Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
2023	B	`conf`	Computing Subset Vertex Covers in H-Free Graphs. FCT Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2023	J	`jnl`	Computing Subset Vertex Covers in H-Free Graphs. CoRR Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2023	J	`jnl`	Computing pivot-minors. CoRR Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2023	B	`conf`	Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. MFCS Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	J	`jnl`	Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. CoRR Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	J	`jnl`	Few induced disjoint paths for Theor. Comput. Sci. Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Finding Matching Cuts in H-Free Graphs. Algorithmica Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers WG Daniël Paulusma, Bernard Ries
2023	J	`jnl`	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	B	`conf`	Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	J	`jnl`	Maximizing Matching Cuts. CoRR Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	J	`jnl`	Partitioned Matching Games for International Kidney Exchange. CoRR Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
2023	J	`jnl`	The Complexity of L(p, q)-Edge-Labelling. Algorithmica Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
2023	J	`jnl`	The Complexity of Matching Games: A Survey. J. Artif. Intell. Res. Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye
2022	J	`jnl`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
2022	B	`conf`	An Algorithmic Framework for Locally Constrained Homomorphisms. WG Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2022	J	`jnl`	An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2022	J	`jnl`	Bounding the mim-width of hereditary graph classes. J. Graph Theory Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
2022	B	`conf`	Classifying Subset Feedback Vertex Set for H-Free Graphs. WG Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2022	J	`jnl`	Classifying Subset Feedback Vertex Set for H-Free Graphs. CoRR Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2022	J	`jnl`	Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter. Theor. Comput. Sci. Barnaby Martin, Daniël Paulusma, Siani Smith
2022	J	`jnl`	Colouring graphs of bounded diameter in the absence of small cycles. Discret. Appl. Math. Barnaby Martin, Daniël Paulusma, Siani Smith
2022	J	`jnl`	Complexity Framework For Forbidden Subgraphs. CoRR Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. CoRR Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	A	`conf`	Computing Balanced Solutions for Large International Kidney Exchange Schemes. AAMAS Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma
2022	J	`jnl`	Computing Weighted Subset Odd Cycle Transversals in J. Comput. Syst. Sci. Nick Brettell, Matthew Johnson, Daniël Paulusma
2022	J	`jnl`	Computing subset transversals in Theor. Comput. Sci. Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2022	J	`jnl`	Disjoint paths and connected subgraphs for Theor. Comput. Sci. Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2022	J	`jnl`	Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. SIAM J. Discret. Math. Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2022	C	`conf`	Few Induced Disjoint Paths for H-Free Graphs. ISCO Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Few Induced Disjoint Paths for H-Free Graphs. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	B	`conf`	Finding Matching Cuts in H-Free Graphs. ISAAC Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	Finding Matching Cuts in H-Free Graphs. CoRR Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	Hard problems that quickly become very easy. Inf. Process. Lett. Barnaby Martin, Daniël Paulusma, Siani Smith
2022	B	`conf`	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. WG Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Induced Disjoint Paths in AT-free graphs. J. Comput. Syst. Sci. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2022	J	`jnl`	List Inf. Process. Lett. Nick Brettell, Jake Horsfield, Andrea Munaro, Daniël Paulusma
2022	J	`jnl`	New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs. CoRR Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	On the complexity of matching cut for graphs of bounded radius and Theor. Comput. Sci. Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	Partitioning Theor. Comput. Sci. Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2022	J	`jnl`	QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný
2022	B	`conf`	The Complexity of L(p, q)-Edge-Labelling. WALCOM Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
2022	J	`jnl`	The Complexity of Matching Games: A Survey. CoRR Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye
2022	J	`jnl`	Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal
2021	B	`conf`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith
2021	C	`conf`	Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CIAC Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Computing Balanced Solutions for Large International Kidney Exchange Schemes. CoRR Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma
2021	B	`conf`	Computing Weighted Subset Transversals in H-Free Graphs. WADS Nick Brettell, Matthew Johnson, Daniël Paulusma
2021	C	`conf`	Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2021	J	`jnl`	Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2021	B	`conf`	Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. MFCS Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2021	J	`jnl`	Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. CoRR Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2021	J	`jnl`	Graph Isomorphism for (H Algorithmica Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron
2021	J	`jnl`	In Memoriam Walter Kern. Discret. Appl. Math. Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still
2021	Misc	`conf`	Injective Colouring for H-Free Graphs. CSR Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	B	`conf`	Partitioning H-Free Graphs of Bounded Diameter. ISAAC Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Partitioning H-Free Graphs of Bounded Diameter. CoRR Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	—	`conf`	Preface. BCC Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma
2021	A	`conf`	QCSP on Reflexive Tournaments. ESA Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
2021	J	`jnl`	QCSP on Reflexive Tournaments. CoRR Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
2021	J	`jnl`	Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2021	B	`conf`	Solving Problems on Generalized Convex Graphs via Mim-Width. WADS Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma
2021	J	`jnl`	Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2021	—	`ed.`	Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. BCC Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma
2021	J	`jnl`	Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2021	J	`jnl`	What Graphs are 2-Dot Product Graphs? Int. J. Comput. Geom. Appl. Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2020	A	`conf`	Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. ESA Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
2020	J	`jnl`	Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. CoRR Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
2020	B	`conf`	Bounding the Mim-Width of Hereditary Graph Classes. IPEC Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
2020	J	`jnl`	Bounding the Mim-Width of Hereditary Graph Classes. CoRR Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
2020	J	`jnl`	Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
2020	B	`conf`	Clique-Width: Harnessing the Power of Atoms. WG Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
2020	J	`jnl`	Clique-Width: Harnessing the Power of Atoms. CoRR Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
2020	J	`jnl`	Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2020	J	`jnl`	Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective. CoRR Nick Brettell, Jake Horsfield, Daniël Paulusma
2020	J	`jnl`	Colouring (P Algorithmica Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
2020	B	`conf`	Computing Subset Transversals in H-Free Graphs. WG Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2020	J	`jnl`	Computing Subset Transversals in H-Free Graphs. CoRR Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2020	J	`jnl`	Computing Weighted Subset Transversals in H-Free Graphs. CoRR Nick Brettell, Matthew Johnson, Daniël Paulusma
2020	J	`jnl`	Connected Vertex Cover for (sP Algorithmica Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2020	B	`conf`	Contracting to a Longest Path in H-Free Graphs. ISAAC Walter Kern, Daniël Paulusma
2020	J	`jnl`	Disconnected cuts in claw-free graphs. J. Comput. Syst. Sci. Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	Hard Problems That Quickly Become Very Easy. CoRR Barnaby Martin, Daniël Paulusma, Siani Smith
2020	J	`jnl`	Induced Disjoint Paths in AT-free Graphs. CoRR Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	List k-Colouring P CoRR Nick Brettell, Andrea Munaro, Daniël Paulusma
2020	J	`jnl`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2020	J	`jnl`	Simple games versus weighted voting games: bounding the critical threshold value. Soc. Choice Welf. Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
2020	J	`jnl`	Solving problems on generalized convex graphs via mim-width. CoRR Nick Brettell, Andrea Munaro, Daniël Paulusma
2020	B	`conf`	Steiner Trees for Hereditary Graph Classes. LATIN Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	The complexity of L(p, q)-Edge-Labelling. CoRR Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
2020	J	`jnl`	Tree pivot-minors and linear rank-width. CoRR Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2019	J	`jnl`	Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2019	J	`jnl`	Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2019	J	`jnl`	Classifying Inf. Process. Lett. Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
2019	J	`jnl`	Clique-Width for Hereditary Graph Classes. CoRR Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019	—	`conf`	Clique-width for hereditary graph classes. BCC Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019	B	`conf`	Colouring H-Free Graphs of Bounded Diameter. MFCS Barnaby Martin, Daniël Paulusma, Siani Smith
2019	J	`jnl`	Colouring square-free graphs without long induced paths. J. Comput. Syst. Sci. Serge Gaspers, Shenwei Huang, Daniël Paulusma
2019	C	`ed.`	Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings CiE Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero
2019	J	`jnl`	Critical vertices and edges in H-free graphs. Discret. Appl. Math. Daniël Paulusma, Christophe Picouleau, Bernard Ries
2019	J	`jnl`	Filling the complexity gaps for colouring planar and bounded degree graphs. J. Graph Theory Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
2019	B	`conf`	Finding a Small Number of Colourful Components. CPM Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2019	A	`conf`	Generalized Matching Games for International Kidney Exchange. AAMAS Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
2019	J	`jnl`	Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271). Dagstuhl Reports Maria Chudnovsky, Daniël Paulusma, Oliver Schaudt
2019	B	`conf`	Graph Isomorphism for (H WADS Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019	J	`jnl`	Hereditary graph classes: When the complexities of coloring and clique cover coincide. J. Graph Theory Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019	J	`jnl`	Independent Feedback Vertex Set for P Algorithmica Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2019	B	`conf`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2019	J	`jnl`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2019	J	`jnl`	On the Parameterized Complexity of k-Edge Colouring. CoRR Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
2019	J	`jnl`	On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. CoRR Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
2019	J	`jnl`	On the parameterized complexity of ( Inf. Process. Lett. Daniël Paulusma, Stefan Szeider
2019	J	`jnl`	Report on BCTCS & AlgoUK 2019. Bull. EATCS Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma
2019	J	`jnl`	Surjective H-Colouring over Reflexive Digraphs. ACM Trans. Comput. Theory Benoît Larose, Barnaby Martin, Daniël Paulusma
2019	J	`jnl`	Surjective H-colouring: New hardness results. Comput. Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2019	J	`jnl`	Using contracted solution graphs for solving reconfiguration problems. Acta Informatica Paul S. Bonsma, Daniël Paulusma
2018	J	`jnl`	Classifying k-Edge Colouring for H-free Graphs. CoRR Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
2018	B	`conf`	Colouring (P_r+P_s)-Free Graphs. ISAAC Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
2018	J	`jnl`	Colouring (P_r+P_s)-Free Graphs. CoRR Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová
2018	A	`conf`	Colouring Square-Free Graphs without Long Induced Paths. STACS Serge Gaspers, Shenwei Huang, Daniël Paulusma
2018	J	`jnl`	Colouring Square-Free Graphs without Long Induced Paths. CoRR Serge Gaspers, Shenwei Huang, Daniël Paulusma
2018	B	`conf`	Computing Small Pivot-Minors. WG Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
2018	J	`jnl`	Computing square roots of graphs with low maximum degree. Discret. Appl. Math. Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2018	B	`conf`	Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. WG Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2018	J	`jnl`	Contracting to a Longest Path in H-Free Graphs. CoRR Walter Kern, Daniël Paulusma
2018	J	`jnl`	Contraction and deletion blockers for perfect graphs and Theor. Comput. Sci. Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
2018	A	`conf`	Disconnected Cuts in Claw-free Graphs. ESA Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2018	J	`jnl`	Disconnected Cuts in Claw-free Graphs. CoRR Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2018	J	`jnl`	Finding Cactus Roots in Polynomial Time. Theory Comput. Syst. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2018	J	`jnl`	Finding a Small Number of Colourful Components. CoRR Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2018	J	`jnl`	Graph Isomorphism for (H CoRR Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2018	J	`jnl`	Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2018	J	`jnl`	Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2018	J	`jnl`	On colouring (2 Inf. Process. Lett. Konrad K. Dabrowski, Daniël Paulusma
2018	B	`conf`	On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
2018	B	`conf`	Simple Games Versus Weighted Voting Games. SAGT Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
2018	J	`jnl`	Simple Games versus Weighted Voting Games. CoRR Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
2018	J	`jnl`	Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. CoRR Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
2018	A	`conf`	Surjective H-Colouring over Reflexive Digraphs. STACS Benoît Larose, Barnaby Martin, Daniël Paulusma
2018	J	`jnl`	The stable fixtures problem with payments. Games Econ. Behav. Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
2018	J	`jnl`	Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Order Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2017	J	`jnl`	A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. J. Graph Theory Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2017	J	`jnl`	A linear kernel for finding square roots of almost planar graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2017	B	`conf`	Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2017	J	`jnl`	Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2017	C	`conf`	Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. TAMC Daniël Paulusma, Christophe Picouleau, Bernard Ries
2017	J	`jnl`	Bounding the Clique-Width of J. Graph Theory Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
2017	B	`conf`	Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. WG Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2017	B	`conf`	Clique-Width for Graph Classes Closed under Complementation. MFCS Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
2017	J	`jnl`	Clique-Width for Graph Classes Closed under Complementation. CoRR Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev
2017	J	`jnl`	Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes. CoRR Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2017	J	`jnl`	Colouring diamond-free graphs. J. Comput. Syst. Sci. Konrad K. Dabrowski, François Dross, Daniël Paulusma
2017	J	`jnl`	Connected Vertex Cover for (sP CoRR Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2017	J	`jnl`	Contracting Bipartite Graphs to Paths and Cycles. CoRR Konrad Kazimierz Dabrowski, Daniël Paulusma
2017	J	`jnl`	Contracting Bipartite Graphs to Paths and Cycles. Electron. Notes Discret. Math. Konrad K. Dabrowski, Daniël Paulusma
2017	J	`jnl`	Contracting bipartite graphs to paths and cycles. Inf. Process. Lett. Konrad K. Dabrowski, Daniël Paulusma
2017	J	`jnl`	Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. CoRR Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
2017	J	`jnl`	Critical Vertices and Edges in $H$-free Graphs. CoRR Daniël Paulusma, Christophe Picouleau, Bernard Ries
2017	J	`jnl`	Editing to a planar graph of given degrees. J. Comput. Syst. Sci. Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2017	J	`jnl`	Graph editing to a fixed target. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma, Iain A. Stewart
2017	J	`jnl`	Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	B	`conf`	Independent Feedback Vertex Set for P_5-free Graphs. ISAAC Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Kempe equivalence of colourings of cubic graphs. Eur. J. Comb. Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity. CoRR Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2017	J	`jnl`	On Colouring (2P CoRR Konrad K. Dabrowski, Daniël Paulusma
2017	J	`jnl`	Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon
2017	J	`jnl`	Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	B	`conf`	Recognizing Graphs Close to Bipartite Graphs. MFCS Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Reducing the Chromatic Number by Vertex or Edge Deletions. Electron. Notes Discret. Math. Christophe Picouleau, Daniël Paulusma, Bernard Ries
2017	J	`jnl`	Surjective H-Colouring over Reflexive Digraphs. CoRR Benoît Larose, Barnaby Martin, Daniël Paulusma
2017	C	`conf`	Surjective H-Colouring: New Hardness Results. CiE Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2017	J	`jnl`	Surjective H-Colouring: New Hardness Results. CoRR Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2017	J	`jnl`	The price of connectivity for feedback vertex set. Discret. Appl. Math. Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2016	—	`conf`	A Linear Kernel for Finding Square Roots of Almost Planar Graphs. SWAT Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	A Linear Kernel for Finding Square Roots of Almost Planar Graphs. CoRR Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. J. Graph Theory Carl Feghali, Matthew Johnson, Daniël Paulusma
2016	J	`jnl`	Bounding the clique-width of H-free split graphs. Discret. Appl. Math. Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2016	J	`jnl`	Classifying the clique-width of H-free bipartite graphs. Discret. Appl. Math. Konrad Kazimierz Dabrowski, Daniël Paulusma
2016	J	`jnl`	Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. Comput. J. Konrad K. Dabrowski, Daniël Paulusma
2016	—	`conf`	Colouring Diamond-free Graphs. SWAT Konrad K. Dabrowski, François Dross, Daniël Paulusma
2016	J	`jnl`	Colouring on Hereditary Graph Classes Closed under Complementation. CoRR Alexandre Blanché, Konrad Kazimierz Dabrowski, Matthew Johnson, Daniël Paulusma
2016	J	`jnl`	Editing to Eulerian graphs. J. Comput. Syst. Sci. Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2016	C	`conf`	Finding Cactus Roots in Polynomial Time. IWOCA Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	Finding Shortest Paths Between Graph Colourings. Algorithmica Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2016	J	`jnl`	Induced disjoint paths in circular-arc graphs in linear time. Theor. Comput. Sci. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2016	J	`jnl`	Minimal disconnected cuts in planar graphs. Networks Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos
2016	J	`jnl`	Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider
2016	J	`jnl`	New Bounds for the Snake-in-the-Box Problem. CoRR David Allison, Daniël Paulusma
2016	J	`jnl`	Parameterized Algorithms for Finding Square Roots. Algorithmica Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2016	C	`conf`	Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. ISCO Daniël Paulusma, Christophe Picouleau, Bernard Ries
2016	J	`jnl`	Squares of Low Clique Number. Electron. Notes Discret. Math. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	Squares of Low Maximum Degree. CoRR Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	The price of connectivity for cycle transversals. Eur. J. Comb. Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2016	B	`conf`	Using Contracted Solution Graphs for Solving Reconfiguration Problems. MFCS Paul S. Bonsma, Daniël Paulusma
2016	C	`conf`	Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. IWOCA Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
2016	J	`jnl`	Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. CoRR Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma
2015	J	`jnl`	A Reconfigurations Analogue of Brooks' Theorem and its Consequences. CoRR Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Algorithms for diversity and clustering in social networks through dot product graphs. Soc. Networks Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2015	C	`conf`	Bounding Clique-Width via Perfect Graphs. LATA Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
2015	J	`jnl`	Bounding the Clique-Width of $H$-free Split Graphs. CoRR Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2015	—	`conf`	Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2015	J	`jnl`	Bounding the Clique-Width of H-free Chordal Graphs. CoRR Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2015	J	`jnl`	Bounding the Clique-Width of H-free Split Graphs. Electron. Notes Discret. Math. Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
2015	C	`conf`	Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. CIAC Konrad K. Dabrowski, Daniël Paulusma
2015	J	`jnl`	Coloring graphs characterized by a forbidden subgraph. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma, Bernard Ries
2015	C	`conf`	Contraction Blockers for Graphs with Forbidden Induced Paths. CIAC Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
2015	Misc	`conf`	Editing to a Planar Graph of Given Degrees. CSR Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2015	J	`jnl`	Editing to a Planar Graph of Given Degrees. CoRR Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2015	C	`conf`	Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. IWOCA Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. CoRR Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Induced Disjoint Paths in Claw-Free Graphs. SIAM J. Discret. Math. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2015	J	`jnl`	Kempe Equivalence of Colourings of Cubic Graphs. CoRR Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Kempe Equivalence of Colourings of Cubic Graphs. Electron. Notes Discret. Math. Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Knocking out Discret. Appl. Math. Matthew Johnson, Daniël Paulusma, Anthony Stewart
2015	J	`jnl`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2015	J	`jnl`	List Coloring in the Absence of a Linear Forest. Algorithmica Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2015	J	`jnl`	Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
2015	B	`conf`	Minimal Disconnected Cuts in Planar Graphs. FCT Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos
2015	J	`jnl`	Modifying a Graph Using Vertex Elimination. Algorithmica Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2015	J	`jnl`	Narrowing the Complexity Gap for Colouring ( Comput. J. Shenwei Huang, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs. CoRR Konrad Kazimierz Dabrowski, François Dross, Daniël Paulusma
2015	B	`conf`	Open Problems on Graph Coloring for Special Graph Classes. WG Daniël Paulusma
2015	—	`conf`	The Price of Connectivity for Cycle Transversals. MFCS (2) Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2015	J	`jnl`	The Price of Connectivity for Feedback Vertex Set. CoRR Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma
2015	B	`conf`	The Stable Fixtures Problem with Payments. WG Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
2015	J	`jnl`	The Stable Fixtures Problem with Payments. CoRR Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
2015	J	`jnl`	The computational complexity of disconnected cut and 2 J. Comb. Theory B Barnaby Martin, Daniël Paulusma
2015	J	`jnl`	Using Contracted Solution Graphs for Solving Reconfiguration Problems. CoRR Paul S. Bonsma, Daniël Paulusma
2015	J	`jnl`	What Graphs are 2-Dot Product Graphs? CoRR Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2015	J	`jnl`	What Graphs are 2-Dot Product Graphs? Electron. Notes Discret. Math. Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma
2014	—	`conf`	A Reconfigurations Analogue of Brooks' Theorem. MFCS (2) Carl Feghali, Matthew Johnson, Daniël Paulusma
2014	J	`jnl`	A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs. CoRR Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2014	J	`jnl`	Bounding Clique-Width via Perfect Graphs. CoRR Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2014	J	`jnl`	Classifying the Clique-Width of $H$-Free Bipartite Graphs. CoRR Konrad K. Dabrowski, Daniël Paulusma
2014	Misc	`conf`	Classifying the Clique-Width of H-Free Bipartite Graphs. COCOON Konrad Kazimierz Dabrowski, Daniël Paulusma
2014	J	`jnl`	Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs. CoRR Konrad K. Dabrowski, Daniël Paulusma
2014	J	`jnl`	Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput. Petr A. Golovach, Daniël Paulusma, Jian Song
2014	J	`jnl`	Coloring graphs without short cycles and long induced paths. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma, Jian Song
2014	J	`jnl`	Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2014	J	`jnl`	Colouring of graphs with Ramsey-type forbidden subgraphs. Theor. Comput. Sci. Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma
2014	J	`jnl`	Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2014	—	`conf`	Editing to Eulerian Graphs. FSTTCS Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2014	J	`jnl`	Editing to Eulerian Graphs. CoRR Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2014	B	`conf`	Finding Shortest Paths Between Graph Colourings. IPEC Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2014	—	`conf`	Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. MFCS (2) Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma
2014	B	`conf`	Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. WG Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2014	J	`jnl`	Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. CoRR Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2014	—	`conf`	Knocking Out P k -free Graphs. MFCS (2) Matthew Johnson, Daniël Paulusma, Anthony Stewart
2014	J	`jnl`	Lift-contractions. Eur. J. Comb. Petr A. Golovach, Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos
2014	J	`jnl`	List coloring in the absence of two subgraphs. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma
2014	J	`jnl`	Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
2014	J	`jnl`	Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs. CoRR Shenwei Huang, Matthew Johnson, Daniël Paulusma
2014	C	`conf`	Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. AAIM Shenwei Huang, Matthew Johnson, Daniël Paulusma
2014	J	`jnl`	Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput. Syst. Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck
2014	J	`jnl`	Packing bipartite graphs with covers of complete bipartite graphs. Discret. Appl. Math. Jérémie Chalopin, Daniël Paulusma
2014	J	`jnl`	Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2014	J	`jnl`	Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma
2014	J	`jnl`	Solutions for the stable roommates problem with payments. Theor. Comput. Sci. Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
2013	J	`jnl`	4-coloring H-free graphs when H is small. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma, Jian Song
2013	J	`jnl`	A note on contracting claw-free graphs. Discret. Math. Theor. Comput. Sci. Jirí Fiala, Marcin Kaminski, Daniël Paulusma
2013	B	`conf`	Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. ISAAC Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2013	J	`jnl`	Characterizing graphs of small carving-width. Discret. Appl. Math. Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2013	J	`jnl`	Choosability on H-free graphs. Inf. Process. Lett. Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2013	B	`conf`	Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. WG Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma
2013	J	`jnl`	Detecting induced minors in AT-free graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013	J	`jnl`	Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
2013	C	`conf`	Graph Editing to a Fixed Target. IWOCA Petr A. Golovach, Daniël Paulusma, Iain A. Stewart
2013	J	`jnl`	Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2013	J	`jnl`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs CoRR Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2013	B	`conf`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2013	C	`conf`	List Coloring in the Absence of Two Subgraphs. CIAC Petr A. Golovach, Daniël Paulusma
2013	B	`conf`	Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. FCT Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
2013	A	`conf`	Model Counting for CNF Formulas of Bounded Modular Treewidth. STACS Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider
2013	J	`jnl`	Obtaining planarity by contracting few edges. Theor. Comput. Sci. Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2013	J	`jnl`	Parameterized Algorithms for Finding Square Roots. CoRR Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013	B	`conf`	Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. IPEC Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2013	J	`jnl`	Satisfiability of acyclic and almost acyclic CNF formulas. Theor. Comput. Sci. Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2013	B	`conf`	Sparse Square Roots. WG Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013	J	`jnl`	Three complexity results on coloring Pk-free graphs. Eur. J. Comb. Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
2012	B	`conf`	4-Coloring H-Free Graphs When H Is Small. SOFSEM Petr A. Golovach, Daniël Paulusma, Jian Song
2012	C	`conf`	Characterizing Graphs of Small Carving-Width. COCOA Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	B	`conf`	Closing Complexity Gaps for Coloring Problems on H-Free Graphs. ISAAC Petr A. Golovach, Daniël Paulusma, Jian Song
2012	B	`conf`	Coloring Graphs Characterized by a Forbidden Subgraph. MFCS Petr A. Golovach, Daniël Paulusma, Bernard Ries
2012	J	`jnl`	Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2012	J	`jnl`	Computing solutions for matching games. Int. J. Game Theory Péter Biró, Walter Kern, Daniël Paulusma
2012	J	`jnl`	Computing vertex-surjective homomorphisms to partially reflexive trees. Theor. Comput. Sci. Petr A. Golovach, Daniël Paulusma, Jian Song
2012	J	`jnl`	Containment relations in split graphs. Discret. Appl. Math. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	B	`conf`	Detecting Induced Minors in AT-Free Graphs. ISAAC Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2012	J	`jnl`	Detecting induced star-like minors in polynomial time. J. Discrete Algorithms Jirí Fiala, Marcin Kaminski, Daniël Paulusma
2012	J	`jnl`	Determining the chromatic number of triangle-free 2P Theor. Comput. Sci. Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2012	J	`jnl`	Distance three labelings of trees. Discret. Appl. Math. Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma
2012	J	`jnl`	Editorial. J. Discrete Algorithms Iain A. Stewart, Daniël Paulusma, Matthew Johnson
2012	J	`jnl`	Finding Induced Paths of Given Parity in Claw-Free Graphs. Algorithmica Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2012	Misc	`conf`	Finding Vertex-Surjective Graph Homomorphisms. CSR Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
2012	J	`jnl`	Finding vertex-surjective graph homomorphisms CoRR Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
2012	J	`jnl`	Finding vertex-surjective graph homomorphisms. Acta Informatica Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
2012	B	`conf`	How to Eliminate a Graph. WG Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2012	—	`conf`	Induced Disjoint Paths in AT-Free Graphs. SWAT Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2012	J	`jnl`	Induced Disjoint Paths in Claw-Free Graphs CoRR Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2012	A	`conf`	Induced Disjoint Paths in Claw-Free Graphs. ESA Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2012	J	`jnl`	Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	J	`jnl`	Obtaining Planarity by Contracting Few Edges CoRR Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2012	B	`conf`	Obtaining Planarity by Contracting Few Edges. MFCS Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2012	J	`jnl`	On graph contractions and induced minors. Discret. Appl. Math. Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2012	J	`jnl`	On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2012	B	`conf`	Solutions for the Stable Roommates Problem with Payments. WG Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
2012	J	`jnl`	The k-in-a-Path Problem for Claw-free Graphs. Algorithmica Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
2012	J	`jnl`	Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2011	B	`conf`	Coloring Graphs without Short Cycles and Long Induced Paths. FCT Petr A. Golovach, Daniël Paulusma, Jian Song
2011	Misc	`conf`	Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. CSR Petr A. Golovach, Daniël Paulusma, Jian Song
2011	B	`conf`	Contracting a Chordal Graph to a Split Graph or a Tree. MFCS Petr A. Golovach, Marcin Kaminski, Daniël Paulusma
2011	J	`jnl`	Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	B	`conf`	Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2011	J	`jnl`	Graph labelings derived from models in distributed computing: A complete complexity classification. Networks Jérémie Chalopin, Daniël Paulusma
2011	B	`conf`	Increasing the Minimum Degree of a Graph by Contractions. IPEC Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	Lift Contractions. Electron. Notes Discret. Math. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	B	`conf`	List Coloring in the Absence of a Linear Forest. WG Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2011	J	`jnl`	On disconnected cuts and separators. Discret. Appl. Math. Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	On partitioning a graph into two connected subgraphs. Theor. Comput. Sci. Daniël Paulusma, Johan M. M. van Rooij
2011	J	`jnl`	On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma
2011	J	`jnl`	Parameterizing cut sets in a graph by the number of their components. Theor. Comput. Sci. Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II) CoRR Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2011	A	`conf`	Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). SAT Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2011	A	`conf`	The Computational Complexity of Disconnected Cut and 2K 2-Partition. CP Barnaby Martin, Daniël Paulusma
2011	J	`jnl`	The Computational Complexity of Disconnected Cut and 2K2-Partition CoRR Barnaby Martin, Daniël Paulusma
2010	J	`jnl`	A new characterization of P Discret. Appl. Math. Pim van 't Hof, Daniël Paulusma
2010	J	`jnl`	Comparing Universal Covers in Polynomial Time. Theory Comput. Syst. Jirí Fiala, Daniël Paulusma
2010	C	`conf`	Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2010	J	`jnl`	Computing role assignments of chordal graphs. Theor. Comput. Sci. Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij
2010	J	`jnl`	Computing sharp 2-factors in claw-free graphs. J. Discrete Algorithms Hajo Broersma, Daniël Paulusma
2010	J	`jnl`	Contracting planar graphs to contractions of triangulations CoRR Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2010	—	`conf`	Contractions of Planar Graphs in Polynomial Time. ESA (1) Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2010	B	`conf`	Narrowing Down the Gap on the Complexity of Coloring WG Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2010	Misc	`conf`	Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck
2010	—	`conf`	On Coloring Graphs without Induced Forests. ISAAC (2) Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2010	B	`conf`	On Contracting Graphs to Fixed Pattern Graphs. SOFSEM Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2010	C	`conf`	On Solution Concepts for Matching Games. TAMC Péter Biró, Walter Kern, Daniël Paulusma
2010	C	`conf`	Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. CIAC Jérémie Chalopin, Daniël Paulusma
2010	J	`jnl`	Path factors and parallel knock-out schemes of almost claw-free graphs. Discret. Math. Matthew Johnson, Daniël Paulusma, Chantal Wood
2010	—	`conf`	Satisfiability of Acyclic and Almost Acyclic CNF Formulas. FSTTCS Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2010	A	`conf`	The k-in-a-path Problem for Claw-free Graphs. STACS Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
2009	J	`jnl`	Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discuss. Math. Graph Theory Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman
2009	B	`conf`	Computing Role Assignments of Chordal Graphs. FCT Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij
2009	J	`jnl`	Covering graphs with few complete bipartite subgraphs. Theor. Comput. Sci. Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
2009	B	`conf`	Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
2009	B	`conf`	Finding Induced Paths of Given Parity in Claw-Free Graphs. WG Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2009	B	`conf`	Induced Packing of Odd Cycles in a Planar Graph. ISAAC Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2009	B	`conf`	On Partitioning a Graph into Two Connected Subgraphs. ISAAC Daniël Paulusma, Johan M. M. van Rooij
2009	J	`jnl`	On the Core and Math. Oper. Res. Walter Kern, Daniël Paulusma
2009	B	`conf`	Parameterizing Cut Sets in a Graph by the Number of Their Components. ISAAC Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2009	Misc	`conf`	Partitioning Graphs into Connected Parts. CSR Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger
2009	J	`jnl`	Partitioning graphs into connected parts. Theor. Comput. Sci. Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger
2009	J	`jnl`	Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. Graphs Comb. Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto
2009	J	`jnl`	The k-in-a-path problem for claw-free graphs CoRR Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma
2009	C	`conf`	Three Complexity Results on Coloring IWOCA Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
2009	J	`jnl`	Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. Hajo Broersma, Matthew Johnson, Daniël Paulusma
2009	J	`jnl`	lambda-backbone colorings along pairwise disjoint stars and matchings. Discret. Math. Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto
2008	J	`jnl`	A New Algorithm for On-line Coloring Bipartite Graphs. SIAM J. Discret. Math. Hajo Broersma, Agostino Capponi, Daniël Paulusma
2008	Misc	`conf`	A New Characterization of P6-Free Graphs. COCOON Pim van 't Hof, Daniël Paulusma
2008	Misc	`conf`	Comparing Universal Covers in Polynomial Time. CSR Jirí Fiala, Daniël Paulusma
2008	B	`conf`	Computing Sharp 2-Factors in Claw-Free Graphs. MFCS Hajo Broersma, Daniël Paulusma
2008	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers WG Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma
2008	J	`jnl`	Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. Jirí Fiala, Daniël Paulusma, Jan Arne Telle
2008	C	`conf`	Path factors and parallel knock-out schemes of almost claw-free graphs. IWOCA Matthew Johnson, Daniël Paulusma, Chantal Wood
2008	J	`jnl`	Relative length of longest paths and longest cycles in triangle-free graphs. Discret. Math. Daniël Paulusma, Kiyoshi Yoshimoto
2008	J	`jnl`	The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. Networks Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
2008	J	`jnl`	The computational complexity of graph contractions II: Two tough polynomially solvable cases. Networks Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
2008	J	`jnl`	The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
2007	—	`conf`	Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
2007	J	`jnl`	Cycles through specified vertices in triangle-free graphs. Discuss. Math. Graph Theory Daniël Paulusma, Kiyoshi Yoshimoto
2007	—	`conf`	Improved Upper Bounds for SOFSEM (1) Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman
2007	J	`jnl`	On components of 2-factors in claw-free graphs. Electron. Notes Discret. Math. Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto
2007	B	`conf`	Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO Hajo Broersma, Matthew Johnson, Daniël Paulusma
2006	B	`conf`	Graph Labelings Derived from Models in Distributed Computing. WG Jérémie Chalopin, Daniël Paulusma
2006	C	`conf`	On-Line Coloring of H-Free Bipartite Graphs. CIAC Hajo Broersma, Agostino Capponi, Daniël Paulusma
2006	B	`conf`	The Computational Complexity of the Parallel Knock-Out Problem. LATIN Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
2005	J	`jnl`	A complete complexity classification of the role assignment problem. Theor. Comput. Sci. Jirí Fiala, Daniël Paulusma
2005	B	`conf`	Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG Jirí Fiala, Daniël Paulusma, Jan Arne Telle
2005	B	`conf`	Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS Jirí Fiala, Daniël Paulusma, Jan Arne Telle
2004	—	`conf`	Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. FPT Lodewijk T. Smit, Gerard J. M. Smit, Johann L. Hurink, Hajo Broersma, Daniël Paulusma, Pascal T. Wolkotte
2004	B	`conf`	The Computational Complexity of the Minimum Weight Processor Assignment Problem. WG Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger
2004	J	`jnl`	The computational complexity of the elimination problem in generalized sports competitions. Discret. Optim. Walter Kern, Daniël Paulusma
2003	J	`jnl`	Matching Games: The Least Core and the Nucleolus. Math. Oper. Res. Walter Kern, Daniël Paulusma
2003	B	`conf`	The Complexity of Graph Contractions. WG Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
2003	A*	`conf`	The Computational Complexity of the Role Assignment Problem. ICALP Jirí Fiala, Daniël Paulusma
2001	J	`jnl`	The new FIFA rules are hard: complexity aspects of sports competitions. Discret. Appl. Math. Walter Kern, Daniël Paulusma
2001	J	`jnl`	Two extensions of the Shapley value for cooperative games. Math. Methods Oper. Res. Theo S. H. Driessen, Daniël Paulusma
2000	J	`jnl`	Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Methods Oper. Res. Ulrich Faigle, Walter Kern, Daniël Paulusma