Daniël Paulusma

According to our database, Daniël Paulusma authored at least 254 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Solving problems on generalized convex graphs via mim-width.

Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma

J. Comput. Syst. Sci., March, 2024

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal.

Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev

Eur. J. Comb., March, 2024

Graph Homomorphism, Monotone Classes and Bounded Pathwidth.

Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark Siggers, Siani Smith

CoRR, 2024

The Complexity of Diameter on H-free graphs.

Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen

CoRR, 2024

2023

Clique-width: Harnessing the power of atoms.

Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski

J. Graph Theory, December, 2023

The Complexity of L(p, q)-Edge-Labelling.

Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith

Algorithmica, November, 2023

Finding Matching Cuts in H-Free Graphs.

Felicia Lucke, Daniël Paulusma, Bernard Ries

Algorithmica, October, 2023

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Algorithmica, September, 2023

Few induced disjoint paths for <i>H</i>-free graphs.

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Theor. Comput. Sci., 2023

The Complexity of Matching Games: A Survey.

Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye

J. Artif. Intell. Res., 2023

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded.

Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye

CoRR, 2023

Maximizing Matching Cuts.

Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries

CoRR, 2023

Computing pivot-minors.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

CoRR, 2023

Comparing Width Parameters on Graph Classes.

Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang

CoRR, 2023

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.

Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

CoRR, 2023

Partitioned Matching Games for International Kidney Exchange.

Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma

CoRR, 2023

Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius.

Felicia Lucke, Daniël Paulusma, Bernard Ries

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.

Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Matching Cuts in Graphs of High Girth and H-Free Graphs.

Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Computing Subset Vertex Covers in H-Free Graphs.

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).

Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal

Dagstuhl Reports, November, 2022

QCSP on Reflexive Tournaments.

Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný

ACM Trans. Comput. Log., 2022

Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter.

Barnaby Martin, Daniël Paulusma, Siani Smith

Theor. Comput. Sci., 2022

On the complexity of matching cut for graphs of bounded radius and <i>H</i>-free graphs.

Felicia Lucke, Daniël Paulusma, Bernard Ries

Theor. Comput. Sci., 2022

Disjoint paths and connected subgraphs for <i>H</i>-free graphs.

Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Theor. Comput. Sci., 2022

Computing subset transversals in <i>H</i>-free graphs.

Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Theor. Comput. Sci., 2022

Partitioning <i>H</i>-free graphs of bounded diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith

Theor. Comput. Sci., 2022

Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs.

Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski

SIAM J. Discret. Math., 2022

Bounding the mim-width of hereditary graph classes.

Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma

J. Graph Theory, 2022

Induced Disjoint Paths in AT-free graphs.

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2022

Computing Weighted Subset Odd Cycle Transversals in <i>H</i>-free graphs.

Nick Brettell, Matthew Johnson, Daniël Paulusma

J. Comput. Syst. Sci., 2022

Hard problems that quickly become very easy.

Barnaby Martin, Daniël Paulusma, Siani Smith

Inf. Process. Lett., 2022

List <i>k</i>-colouring <i>P</i>_<i>t</i>-free graphs: A Mim-width perspective.

Nick Brettell, Jake Horsfield, Andrea Munaro, Daniël Paulusma

Inf. Process. Lett., 2022

Colouring graphs of bounded diameter in the absence of small cycles.

Barnaby Martin, Daniël Paulusma, Siani Smith

Discret. Appl. Math., 2022

New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching.

Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries

CoRR, 2022

Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision.

Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

CoRR, 2022

Complexity Framework For Forbidden Subgraphs.

Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

CoRR, 2022

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs.

Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

CoRR, 2022

On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs.

Felicia Lucke, Daniël Paulusma, Bernard Ries

CoRR, 2022

Acyclic, Star, and Injective Colouring: Bounding the Diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith

Electron. J. Comb., 2022

Classifying Subset Feedback Vertex Set for H-Free Graphs.

Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

An Algorithmic Framework for Locally Constrained Homomorphisms.

Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Few Induced Disjoint Paths for H-Free Graphs.

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

Computing Balanced Solutions for Large International Kidney Exchange Schemes.

Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Steiner trees for hereditary graph classes: A treewidth perspective.

Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen

Theor. Comput. Sci., 2021

Tree Pivot-Minors and Linear Rank-Width.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

SIAM J. Discret. Math., 2021

Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

J. Graph Theory, 2021

In Memoriam Walter Kern.

Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still

Discret. Appl. Math., 2021

Graph Isomorphism for (H_{1, H₂₎}-Free Graphs: An Almost Complete Dichotomy.

Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron

Algorithmica, 2021

Acyclic, Star, and Injective Colouring: Bounding the Diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Computing Weighted Subset Transversals in H-Free Graphs.

Nick Brettell, Matthew Johnson, Daniël Paulusma

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Disjoint Paths and Connected Subgraphs for H-Free Graphs.

Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Partitioning H-Free Graphs of Bounded Diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Injective Colouring for H-Free Graphs.

Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the Computer Science - Theory and Applications, 2021

Preface.

Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma

Proceedings of the Surveys in Combinatorics, 2021

2020

Clique-Width for Graph Classes Closed under Complementation.

Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev

SIAM J. Discret. Math., 2020

Simple games versus weighted voting games: bounding the critical threshold value.

Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma

Soc. Choice Welf., 2020

Disconnected cuts in claw-free graphs.

Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2020

Clique-width and well-quasi-ordering of triangle-free graph classes.

Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma

J. Comput. Syst. Sci., 2020

Solving problems on generalized convex graphs via mim-width.

Nick Brettell, Andrea Munaro, Daniël Paulusma

CoRR, 2020

List k-Colouring P_t-Free Graphs with No Induced 1-Subdivision of K_{1, s}: a Mim-width Perspective.

Nick Brettell, Andrea Munaro, Daniël Paulusma

CoRR, 2020

Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective.

Nick Brettell, Jake Horsfield, Daniël Paulusma

CoRR, 2020

Colouring (P_r + P_s)-Free Graphs.

Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová

Algorithmica, 2020

Connected Vertex Cover for (sP_1+P₅₎-Free Graphs.

Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Algorithmica, 2020

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.

Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski

Algorithmica, 2020

Computing Subset Transversals in H-Free Graphs.

Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Steiner Trees for Hereditary Graph Classes.

Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Contracting to a Longest Path in H-Free Graphs.

Walter Kern, Daniël Paulusma

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.

Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Surjective H-Colouring over Reflexive Digraphs.

Benoît Larose, Barnaby Martin, Daniël Paulusma

ACM Trans. Comput. Theory, 2019

Filling the complexity gaps for colouring planar and bounded degree graphs.

Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma

J. Graph Theory, 2019

Hereditary graph classes: When the complexities of coloring and clique cover coincide.

Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma

J. Graph Theory, 2019

Colouring square-free graphs without long induced paths.

Serge Gaspers, Shenwei Huang, Daniël Paulusma

J. Comput. Syst. Sci., 2019

Bounding clique-width via perfect graphs.

Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma

J. Comput. Syst. Sci., 2019

On the parameterized complexity of (<i>k</i>, <i>s</i>)-SAT.

Daniël Paulusma, Stefan Szeider

Inf. Process. Lett., 2019

Classifying <i>k</i>-edge colouring for <i>H</i>-free graphs.

Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries

Inf. Process. Lett., 2019

Report on BCTCS & AlgoUK 2019.

Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma

Bull. EATCS, 2019

Critical vertices and edges in H-free graphs.

Daniël Paulusma, Christophe Picouleau, Bernard Ries

Discret. Appl. Math., 2019

Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271).

Maria Chudnovsky, Daniël Paulusma, Oliver Schaudt

Dagstuhl Reports, 2019

On the Parameterized Complexity of k-Edge Colouring.

Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries

CoRR, 2019

Surjective H-colouring: New hardness results.

Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart

Comput., 2019

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma

Algorithmica, 2019

Independent Feedback Vertex Set for P₅-Free Graphs.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

Algorithmica, 2019

Using contracted solution graphs for solving reconfiguration problems.

Paul S. Bonsma, Daniël Paulusma

Acta Informatica, 2019

Graph Isomorphism for (H₁, H₂)-Free Graphs: An Almost Complete Dichotomy.

Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Colouring H-Free Graphs of Bounded Diameter.

Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.

Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Finding a Small Number of Colourful Components.

Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Clique-width for hereditary graph classes.

Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma

Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019

Generalized Matching Games for International Kidney Exchange.

Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Contraction and deletion blockers for perfect graphs and <i>H</i>-free graphs.

Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries

Theor. Comput. Sci., 2018

Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity.

Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma

Theor. Comput. Sci., 2018

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.

Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma

Order, 2018

Finding Cactus Roots in Polynomial Time.

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Theory Comput. Syst., 2018

On colouring (2<i>P</i>₂, <i>H</i>)-free and (<i>P</i>₅, <i>H</i>)-free graphs.

Konrad K. Dabrowski, Daniël Paulusma

Inf. Process. Lett., 2018

Independent feedback vertex sets for graphs of bounded diameter.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

Inf. Process. Lett., 2018

The stable fixtures problem with payments.

Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky

Games Econ. Behav., 2018

Computing square roots of graphs with low maximum degree.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Discret. Appl. Math., 2018

Classifying k-Edge Colouring for H-free Graphs.

Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries

CoRR, 2018

Computing Small Pivot-Minors.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs.

Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Simple Games Versus Weighted Voting Games.

Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Colouring (P_r+P_s)-Free Graphs.

Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná, Daniël Paulusma, Veronika Slívová

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

A linear kernel for finding square roots of almost planar graphs.

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Theor. Comput. Sci., 2017

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.

Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song

J. Graph Theory, 2017

Bounding the Clique-Width of <i>H</i>-Free Chordal Graphs.

Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma

J. Graph Theory, 2017

Editing to a planar graph of given degrees.

Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos

J. Comput. Syst. Sci., 2017

Colouring diamond-free graphs.

Konrad K. Dabrowski, François Dross, Daniël Paulusma

J. Comput. Syst. Sci., 2017

Reducing the Chromatic Number by Vertex or Edge Deletions.

Christophe Picouleau, Daniël Paulusma, Bernard Ries

Electron. Notes Discret. Math., 2017

Contracting Bipartite Graphs to Paths and Cycles.

Konrad K. Dabrowski, Daniël Paulusma

Electron. Notes Discret. Math., 2017

Graph editing to a fixed target.

Petr A. Golovach, Daniël Paulusma, Iain A. Stewart

Discret. Appl. Math., 2017

Preface: Algorithmic Graph Theory on the Adriatic Coast.

Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon

Discret. Appl. Math., 2017

The price of connectivity for feedback vertex set.

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Discret. Appl. Math., 2017

Connected Vertex Cover for (sP₁+P₅)-Free Graphs.

Matthew Johnson, Giacomo Paesani, Daniël Paulusma

CoRR, 2017

On Colouring (2P₂, H)-Free and (P₅, H)-Free Graphs.

Konrad K. Dabrowski, Daniël Paulusma

CoRR, 2017

Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs.

Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries

CoRR, 2017

Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions.

Daniël Paulusma, Christophe Picouleau, Bernard Ries

Proceedings of the Theory and Applications of Models of Computation, 2017

Recognizing Graphs Close to Bipartite Graphs.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Independent Feedback Vertex Set for P_5-free Graphs.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Induced disjoint paths in circular-arc graphs in linear time.

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen

Theor. Comput. Sci., 2016

Minimal disconnected cuts in planar graphs.

Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos

Networks, 2016

A Reconfigurations Analogue of Brooks' Theorem and Its Consequences.

Carl Feghali, Matthew Johnson, Daniël Paulusma

J. Graph Theory, 2016

Editing to Eulerian graphs.

Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

J. Comput. Syst. Sci., 2016

Squares of Low Clique Number.

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Electron. Notes Discret. Math., 2016

The price of connectivity for cycle transversals.

Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma

Eur. J. Comb., 2016

Classifying the clique-width of H-free bipartite graphs.

Konrad Kazimierz Dabrowski, Daniël Paulusma

Discret. Appl. Math., 2016

Squares of Low Maximum Degree.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

CoRR, 2016

Colouring on Hereditary Graph Classes Closed under Complementation.

Alexandre Blanché, Konrad Kazimierz Dabrowski, Matthew Johnson, Daniël Paulusma

CoRR, 2016

New Bounds for the Snake-in-the-Box Problem.

David Allison, Daniël Paulusma

CoRR, 2016

Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.

Konrad K. Dabrowski, Daniël Paulusma

Comput. J., 2016

Model Counting for CNF Formulas of Bounded Modular Treewidth.

Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider

Algorithmica, 2016

Parameterized Algorithms for Finding Square Roots.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

Algorithmica, 2016

Finding Shortest Paths Between Graph Colourings.

Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma

Algorithmica, 2016

Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions.

Daniël Paulusma, Christophe Picouleau, Bernard Ries

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar

Theor. Comput. Sci., 2015

Algorithms for diversity and clustering in social networks through dot product graphs.

Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen

Soc. Networks, 2015

Induced Disjoint Paths in Claw-Free Graphs.

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen

SIAM J. Discret. Math., 2015

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.

Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski

J. Graph Theory, 2015

The computational complexity of disconnected cut and 2_K2-partition.

Barnaby Martin, Daniël Paulusma

J. Comb. Theory, Ser. B, 2015

Kempe Equivalence of Colourings of Cubic Graphs.

Carl Feghali, Matthew Johnson, Daniël Paulusma

Electron. Notes Discret. Math., 2015

Bounding the Clique-Width of H-free Split Graphs.

Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma

Electron. Notes Discret. Math., 2015

What Graphs are 2-Dot Product Graphs?

Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma

Electron. Notes Discret. Math., 2015

Coloring graphs characterized by a forbidden subgraph.

Petr A. Golovach, Daniël Paulusma, Bernard Ries

Discret. Appl. Math., 2015

Knocking out _P_k-free graphs.

Matthew Johnson, Daniël Paulusma, Anthony Stewart

Discret. Appl. Math., 2015

Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs.

Konrad Kazimierz Dabrowski, François Dross, Daniël Paulusma

CoRR, 2015

Narrowing the Complexity Gap for Colouring (<i>C_s, P_t</i>)-Free Graphs.

Shenwei Huang, Matthew Johnson, Daniël Paulusma

Comput. J., 2015

Modifying a Graph Using Vertex Elimination.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk

Algorithmica, 2015

List Coloring in the Absence of a Linear Forest.

Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

Algorithmica, 2015

Open Problems on Graph Coloring for Special Graph Classes.

Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Bounding the Clique-Width of H-free Chordal Graphs.

Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Contraction Blockers for Graphs with Forbidden Induced Paths.

Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Colouring of graphs with Ramsey-type forbidden subgraphs.

Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma

Theor. Comput. Sci., 2014

Solutions for the stable roommates problem with payments.

Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma

Theor. Comput. Sci., 2014

Obtaining Online Ecological Colourings by Generalizing First-Fit.

Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck

Theory Comput. Syst., 2014

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.

Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma

J. Comb. Optim., 2014

Closing complexity gaps for coloring problems on H-free graphs.

Petr A. Golovach, Daniël Paulusma, Jian Song

Inf. Comput., 2014

Coloring graphs without short cycles and long induced paths.

Petr A. Golovach, Daniël Paulusma, Jian Song

Discret. Appl. Math., 2014

List coloring in the absence of two subgraphs.

Petr A. Golovach, Daniël Paulusma

Discret. Appl. Math., 2014

Packing bipartite graphs with covers of complete bipartite graphs.

Jérémie Chalopin, Daniël Paulusma

Discret. Appl. Math., 2014

Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs.

Shenwei Huang, Matthew Johnson, Daniël Paulusma

CoRR, 2014

A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs.

Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song

CoRR, 2014

Colouring Reconfiguration Is Fixed-Parameter Tractable.

Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma

CoRR, 2014

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.

Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Algorithmica, 2014

Parameterized complexity of three edge contraction problems with degree constraints.

Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

Acta Informatica, 2014

Knocking Out P k -free Graphs.

Matthew Johnson, Daniël Paulusma, Anthony Stewart

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

A Reconfigurations Analogue of Brooks' Theorem.

Carl Feghali, Matthew Johnson, Daniël Paulusma

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set.

Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs.

Shenwei Huang, Matthew Johnson, Daniël Paulusma

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Satisfiability of acyclic and almost acyclic CNF formulas.

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider

Theor. Comput. Sci., 2013

Increasing the minimum degree of a graph by contractions.

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Theor. Comput. Sci., 2013

Detecting induced minors in AT-free graphs.

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

Theor. Comput. Sci., 2013

Obtaining planarity by contracting few edges.

Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

Theor. Comput. Sci., 2013

Choosability on H-free graphs.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma

Inf. Process. Lett., 2013

Three complexity results on coloring Pk-free graphs.

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma

Eur. J. Comb., 2013

A note on contracting claw-free graphs.

Jirí Fiala, Marcin Kaminski, Daniël Paulusma

Discret. Math. Theor. Comput. Sci., 2013

4-coloring H-free graphs when H is small.

Petr A. Golovach, Daniël Paulusma, Jian Song

Discret. Appl. Math., 2013

Characterizing graphs of small carving-width.

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Discret. Appl. Math., 2013

Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs.

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma

Algorithmica, 2013

Sparse Square Roots.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.

Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs.

Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Computing vertex-surjective homomorphisms to partially reflexive trees.

Petr A. Golovach, Daniël Paulusma, Jian Song

Theor. Comput. Sci., 2012

Induced packing of odd cycles in planar graphs.

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Theor. Comput. Sci., 2012

Determining the chromatic number of triangle-free 2P₃-free graphs in polynomial time.

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Theor. Comput. Sci., 2012

Updating the complexity status of coloring graphs without a fixed induced linear forest.

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Theor. Comput. Sci., 2012

Editorial.

Iain A. Stewart, Daniël Paulusma, Matthew Johnson

J. Discrete Algorithms, 2012

Computing role assignments of proper interval graphs in polynomial time.

Pinar Heggernes, Pim van 't Hof, Daniël Paulusma

J. Discrete Algorithms, 2012

Detecting induced star-like minors in polynomial time.

Jirí Fiala, Marcin Kaminski, Daniël Paulusma

J. Discrete Algorithms, 2012

On the parameterized complexity of coloring graphs in the absence of a linear forest.

Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

J. Discrete Algorithms, 2012

Computing solutions for matching games.

Péter Biró, Walter Kern, Daniël Paulusma

Int. J. Game Theory, 2012

On graph contractions and induced minors.

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos

Discret. Appl. Math., 2012

Containment relations in split graphs.

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Discret. Appl. Math., 2012

Distance three labelings of trees.

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma

Discret. Appl. Math., 2012

Finding Induced Paths of Given Parity in Claw-Free Graphs.

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Algorithmica, 2012

The k-in-a-Path Problem for Claw-free Graphs.

Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma

Algorithmica, 2012

Finding vertex-surjective graph homomorphisms.

Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma

Acta Informatica, 2012

How to Eliminate a Graph.

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

On partitioning a graph into two connected subgraphs.

Daniël Paulusma, Johan M. M. van Rooij

Theor. Comput. Sci., 2011

Parameterizing cut sets in a graph by the number of their components.

Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Theor. Comput. Sci., 2011

Graph labelings derived from models in distributed computing: A complete complexity classification.

Jérémie Chalopin, Daniël Paulusma

Networks, 2011

Contracting planar graphs to contractions of triangulations.

Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

J. Discrete Algorithms, 2011

Lift Contractions.

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Electron. Notes Discret. Math., 2011

On the diameter of reconfiguration graphs for vertex colourings.

Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma

Electron. Notes Discret. Math., 2011

On disconnected cuts and separators.

Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Discret. Appl. Math., 2011

The Computational Complexity of Disconnected Cut and 2K2-Partition

Barnaby Martin, Daniël Paulusma

CoRR, 2011

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Contracting a Chordal Graph to a Split Graph or a Tree.

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.

Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

The Computational Complexity of Disconnected Cut and 2K 2-Partition.

Barnaby Martin, Daniël Paulusma

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010

Computing role assignments of chordal graphs.

Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij

Theor. Comput. Sci., 2010

Comparing Universal Covers in Polynomial Time.

Jirí Fiala, Daniël Paulusma

Theory Comput. Syst., 2010

Computing sharp 2-factors in claw-free graphs.

Hajo Broersma, Daniël Paulusma

J. Discrete Algorithms, 2010

Path factors and parallel knock-out schemes of almost claw-free graphs.

Matthew Johnson, Daniël Paulusma, Chantal Wood

Discret. Math., 2010

A new characterization of P₆-free graphs.

Pim van 't Hof, Daniël Paulusma

Discret. Appl. Math., 2010

Narrowing Down the Gap on the Complexity of Coloring <i>P</i>_<i>k</i>-Free Graphs.

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

<i>L</i>(2, 1, 1)-Labeling Is NP-Complete for Trees.

Petr A. Golovach, Bernard Lidický, Daniël Paulusma

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Solution Concepts for Matching Games.

Péter Biró, Walter Kern, Daniël Paulusma

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Contracting Graphs to Fixed Pattern Graphs.

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On Coloring Graphs without Induced Forests.

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Contractions of Planar Graphs in Polynomial Time.

Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Proceedings of the Algorithms, 2010

2009

Partitioning graphs into connected parts.

Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger

Theor. Comput. Sci., 2009

Covering graphs with few complete bipartite subgraphs.

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider

Theor. Comput. Sci., 2009

Upper bounds and algorithms for parallel knock-out numbers.

Hajo Broersma, Matthew Johnson, Daniël Paulusma

Theor. Comput. Sci., 2009

On the Core and <i>f</i>-Nucleolus of Flow Games.

Walter Kern, Daniël Paulusma

Math. Oper. Res., 2009

Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.

Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto

Graphs Comb., 2009

Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number.

Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman

Discuss. Math. Graph Theory, 2009

lambda-backbone colorings along pairwise disjoint stars and matchings.

Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto

Discret. Math., 2009

Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Three Complexity Results on Coloring <i>P</i>_<i>k</i>-Free Graphs.

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Induced Packing of Odd Cycles in a Planar Graph.

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

The computational complexity of the parallel knock-out problem.

Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart

Theor. Comput. Sci., 2008

A New Algorithm for On-line Coloring Bipartite Graphs.

Hajo Broersma, Agostino Capponi, Daniël Paulusma

SIAM J. Discret. Math., 2008

The computational complexity of graph contractions II: Two tough polynomially solvable cases.

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger

Networks, 2008

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases.

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger

Networks, 2008

Locally constrained graph homomorphisms and equitable partitions.

Jirí Fiala, Daniël Paulusma, Jan Arne Telle

Eur. J. Comb., 2008

Relative length of longest paths and longest cycles in triangle-free graphs.

Daniël Paulusma, Kiyoshi Yoshimoto

Discret. Math., 2008

A New Characterization of P6-Free Graphs.

Pim van 't Hof, Daniël Paulusma

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

On components of 2-factors in claw-free graphs.

Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto

Electron. Notes Discret. Math., 2007

Cycles through specified vertices in triangle-free graphs.

Daniël Paulusma, Kiyoshi Yoshimoto

Discuss. Math. Graph Theory, 2007

Improved Upper Bounds for <i>lambda</i> -Backbone Colorings Along Matchings and Stars.

Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Graph Labelings Derived from Models in Distributed Computing.

Jérémie Chalopin, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

On-Line Coloring of H-Free Bipartite Graphs.

Hajo Broersma, Agostino Capponi, Daniël Paulusma

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

A complete complexity classification of the role assignment problem.

Jirí Fiala, Daniël Paulusma

Theor. Comput. Sci., 2005

Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms.

Jirí Fiala, Daniël Paulusma, Jan Arne Telle

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms.

Jirí Fiala, Daniël Paulusma, Jan Arne Telle

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

The computational complexity of the elimination problem in generalized sports competitions.

Walter Kern, Daniël Paulusma

Discret. Optim., 2004

The Computational Complexity of the Minimum Weight Processor Assignment Problem.

Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture.

Lodewijk T. Smit, Gerard J. M. Smit, Johann L. Hurink, Hajo Broersma, Daniël Paulusma, Pascal T. Wolkotte

Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology, 2004

2003

Matching Games: The Least Core and the Nucleolus.

Walter Kern, Daniël Paulusma

Math. Oper. Res., 2003

The Complexity of Graph Contractions.

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

The Computational Complexity of the Role Assignment Problem.

Jirí Fiala, Daniël Paulusma

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2001

Two extensions of the Shapley value for cooperative games.

Theo S. H. Driessen, Daniël Paulusma

Math. Methods Oper. Res., 2001

The new FIFA rules are hard: complexity aspects of sports competitions.

Walter Kern, Daniël Paulusma

Discret. Appl. Math., 2001

2000

Note on the computational complexity of least core concepts for min-cost spanning tree games.

Ulrich Faigle, Walter Kern, Daniël Paulusma

Math. Methods Oper. Res., 2000