Daniël Paulusma

Orcid: 0000-0001-5945-9287

Affiliations:
  • Durham University, School of Engineering and Computing Sciences, UK


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computing balanced solutions for large international kidney exchange schemes.
Auton. Agents Multi Agent Syst., June, 2024

Solving problems on generalized convex graphs via mim-width.
J. Comput. Syst. Sci., March, 2024

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal.
Eur. J. Comb., March, 2024

Classifying subset feedback vertex set for H-free graphs.
Theor. Comput. Sci., 2024

An Algorithmic Framework for Locally Constrained Homomorphisms.
SIAM J. Discret. Math., 2024

Finding <i>d</i>-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and <i>H</i>-Free Graphs.
CoRR, 2024

Graph Homomorphism, Monotone Classes and Bounded Pathwidth.
CoRR, 2024

The Complexity of Diameter on H-free graphs.
CoRR, 2024

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Clique-width: Harnessing the power of atoms.
J. Graph Theory, December, 2023

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

Finding Matching Cuts in H-Free Graphs.
Algorithmica, October, 2023

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.
Algorithmica, September, 2023

Few induced disjoint paths for <i>H</i>-free graphs.
Theor. Comput. Sci., 2023

The Complexity of Matching Games: A Survey.
J. Artif. Intell. Res., 2023

Maximizing Matching Cuts.
CoRR, 2023

Computing pivot-minors.
CoRR, 2023

Comparing Width Parameters on Graph Classes.
CoRR, 2023

Partitioned Matching Games for International Kidney Exchange.
CoRR, 2023

Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius.
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.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Matching Cuts in Graphs of High Girth and H-Free Graphs.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Computing Subset Vertex Covers in H-Free Graphs.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).
Dagstuhl Reports, November, 2022

QCSP on Reflexive Tournaments.
ACM Trans. Comput. Log., 2022

Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter.
Theor. Comput. Sci., 2022

On the complexity of matching cut for graphs of bounded radius and <i>H</i>-free graphs.
Theor. Comput. Sci., 2022

Disjoint paths and connected subgraphs for <i>H</i>-free graphs.
Theor. Comput. Sci., 2022

Computing subset transversals in <i>H</i>-free graphs.
Theor. Comput. Sci., 2022

Partitioning <i>H</i>-free graphs of bounded diameter.
Theor. Comput. Sci., 2022

Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs.
SIAM J. Discret. Math., 2022

Bounding the mim-width of hereditary graph classes.
J. Graph Theory, 2022

Induced Disjoint Paths in AT-free graphs.
J. Comput. Syst. Sci., 2022

Computing Weighted Subset Odd Cycle Transversals in <i>H</i>-free graphs.
J. Comput. Syst. Sci., 2022

Hard problems that quickly become very easy.
Inf. Process. Lett., 2022

List <i>k</i>-colouring <i>P</i><sub><i>t</i></sub>-free graphs: A Mim-width perspective.
Inf. Process. Lett., 2022

Colouring graphs of bounded diameter in the absence of small cycles.
Discret. Appl. Math., 2022

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

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

Complexity Framework For Forbidden Subgraphs.
CoRR, 2022

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

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

Acyclic, Star, and Injective Colouring: Bounding the Diameter.
Electron. J. Comb., 2022

Few Induced Disjoint Paths for H-Free Graphs.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

Computing Balanced Solutions for Large International Kidney Exchange Schemes.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Steiner trees for hereditary graph classes: A treewidth perspective.
Theor. Comput. Sci., 2021

Tree Pivot-Minors and Linear Rank-Width.
SIAM J. Discret. Math., 2021

Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.
J. Graph Theory, 2021

In Memoriam Walter Kern.
Discret. Appl. Math., 2021

Graph Isomorphism for (H<sub>1, H<sub>2)</sub></sub>-Free Graphs: An Almost Complete Dichotomy.
Algorithmica, 2021

Acyclic, Star, and Injective Colouring: Bounding the Diameter.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Computing Weighted Subset Transversals in H-Free Graphs.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Disjoint Paths and Connected Subgraphs for H-Free Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Partitioning H-Free Graphs of Bounded Diameter.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Injective Colouring for H-Free Graphs.
Proceedings of the Computer Science - Theory and Applications, 2021


2020
Clique-Width for Graph Classes Closed under Complementation.
SIAM J. Discret. Math., 2020

Simple games versus weighted voting games: bounding the critical threshold value.
Soc. Choice Welf., 2020

Disconnected cuts in claw-free graphs.
J. Comput. Syst. Sci., 2020

Clique-width and well-quasi-ordering of triangle-free graph classes.
J. Comput. Syst. Sci., 2020

Solving problems on generalized convex graphs via mim-width.
CoRR, 2020

List k-Colouring P<sub>t</sub>-Free Graphs with No Induced 1-Subdivision of K<sub>1, s</sub>: a Mim-width Perspective.
CoRR, 2020

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

Colouring (P<sub>r</sub> + P<sub>s</sub>)-Free Graphs.
Algorithmica, 2020

Connected Vertex Cover for (sP<sub>1+P<sub>5)</sub></sub>-Free Graphs.
Algorithmica, 2020

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

Computing Subset Transversals in H-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Steiner Trees for Hereditary Graph Classes.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Contracting to a Longest Path in H-Free Graphs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Surjective H-Colouring over Reflexive Digraphs.
ACM Trans. Comput. Theory, 2019

Filling the complexity gaps for colouring planar and bounded degree graphs.
J. Graph Theory, 2019

Hereditary graph classes: When the complexities of coloring and clique cover coincide.
J. Graph Theory, 2019

Colouring square-free graphs without long induced paths.
J. Comput. Syst. Sci., 2019

Bounding clique-width via perfect graphs.
J. Comput. Syst. Sci., 2019

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

Classifying <i>k</i>-edge colouring for <i>H</i>-free graphs.
Inf. Process. Lett., 2019

Report on BCTCS & AlgoUK 2019.
Bull. EATCS, 2019

Critical vertices and edges in H-free graphs.
Discret. Appl. Math., 2019

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

On the Parameterized Complexity of k-Edge Colouring.
CoRR, 2019

Surjective H-colouring: New hardness results.
Comput., 2019

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

Independent Feedback Vertex Set for P<sub>5</sub>-Free Graphs.
Algorithmica, 2019

Using contracted solution graphs for solving reconfiguration problems.
Acta Informatica, 2019

Graph Isomorphism for (H<sub>1</sub>, H<sub>2</sub>)-Free Graphs: An Almost Complete Dichotomy.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Colouring H-Free Graphs of Bounded Diameter.
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.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Finding a Small Number of Colourful Components.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Clique-width for hereditary graph classes.
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.
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.
Theor. Comput. Sci., 2018

Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity.
Theor. Comput. Sci., 2018

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

Finding Cactus Roots in Polynomial Time.
Theory Comput. Syst., 2018

On colouring (2<i>P</i><sub>2</sub>, <i>H</i>)-free and (<i>P</i><sub>5</sub>, <i>H</i>)-free graphs.
Inf. Process. Lett., 2018

Independent feedback vertex sets for graphs of bounded diameter.
Inf. Process. Lett., 2018

The stable fixtures problem with payments.
Games Econ. Behav., 2018

Computing square roots of graphs with low maximum degree.
Discret. Appl. Math., 2018

Classifying k-Edge Colouring for H-free Graphs.
CoRR, 2018

Computing Small Pivot-Minors.
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.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Simple Games Versus Weighted Voting Games.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Colouring (P_r+P_s)-Free Graphs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
A linear kernel for finding square roots of almost planar graphs.
Theor. Comput. Sci., 2017

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.
J. Graph Theory, 2017

Bounding the Clique-Width of <i>H</i>-Free Chordal Graphs.
J. Graph Theory, 2017

Editing to a planar graph of given degrees.
J. Comput. Syst. Sci., 2017

Colouring diamond-free graphs.
J. Comput. Syst. Sci., 2017

Reducing the Chromatic Number by Vertex or Edge Deletions.
Electron. Notes Discret. Math., 2017

Contracting Bipartite Graphs to Paths and Cycles.
Electron. Notes Discret. Math., 2017

Graph editing to a fixed target.
Discret. Appl. Math., 2017

Preface: Algorithmic Graph Theory on the Adriatic Coast.
Discret. Appl. Math., 2017

The price of connectivity for feedback vertex set.
Discret. Appl. Math., 2017

Connected Vertex Cover for (sP<sub>1</sub>+P<sub>5</sub>)-Free Graphs.
CoRR, 2017

On Colouring (2P<sub>2</sub>, H)-Free and (P<sub>5</sub>, H)-Free Graphs.
CoRR, 2017

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

Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions.
Proceedings of the Theory and Applications of Models of Computation, 2017

Recognizing Graphs Close to Bipartite Graphs.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Independent Feedback Vertex Set for P_5-free Graphs.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Induced disjoint paths in circular-arc graphs in linear time.
Theor. Comput. Sci., 2016

Minimal disconnected cuts in planar graphs.
Networks, 2016

A Reconfigurations Analogue of Brooks' Theorem and Its Consequences.
J. Graph Theory, 2016

Editing to Eulerian graphs.
J. Comput. Syst. Sci., 2016

Squares of Low Clique Number.
Electron. Notes Discret. Math., 2016

The price of connectivity for cycle transversals.
Eur. J. Comb., 2016

Classifying the clique-width of H-free bipartite graphs.
Discret. Appl. Math., 2016

Squares of Low Maximum Degree.
CoRR, 2016

Colouring on Hereditary Graph Classes Closed under Complementation.
CoRR, 2016

New Bounds for the Snake-in-the-Box Problem.
CoRR, 2016

Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
Comput. J., 2016

Model Counting for CNF Formulas of Bounded Modular Treewidth.
Algorithmica, 2016

Parameterized Algorithms for Finding Square Roots.
Algorithmica, 2016

Finding Shortest Paths Between Graph Colourings.
Algorithmica, 2016

Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.
Theor. Comput. Sci., 2015

Algorithms for diversity and clustering in social networks through dot product graphs.
Soc. Networks, 2015

Induced Disjoint Paths in Claw-Free Graphs.
SIAM J. Discret. Math., 2015

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
J. Graph Theory, 2015

The computational complexity of disconnected cut and 2<sub>K2</sub>-partition.
J. Comb. Theory B, 2015

Kempe Equivalence of Colourings of Cubic Graphs.
Electron. Notes Discret. Math., 2015

Bounding the Clique-Width of H-free Split Graphs.
Electron. Notes Discret. Math., 2015

What Graphs are 2-Dot Product Graphs?
Electron. Notes Discret. Math., 2015

Coloring graphs characterized by a forbidden subgraph.
Discret. Appl. Math., 2015

Knocking out <sub>P</sub><sub>k</sub>-free graphs.
Discret. Appl. Math., 2015

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

Narrowing the Complexity Gap for Colouring (<i>C<sub>s</sub>, P<sub>t</sub></i>)-Free Graphs.
Comput. J., 2015

Modifying a Graph Using Vertex Elimination.
Algorithmica, 2015

List Coloring in the Absence of a Linear Forest.
Algorithmica, 2015

Open Problems on Graph Coloring for Special Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Bounding the Clique-Width of H-free Chordal Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Contraction Blockers for Graphs with Forbidden Induced Paths.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014
Colouring of graphs with Ramsey-type forbidden subgraphs.
Theor. Comput. Sci., 2014

Solutions for the stable roommates problem with payments.
Theor. Comput. Sci., 2014

Obtaining Online Ecological Colourings by Generalizing First-Fit.
Theory Comput. Syst., 2014

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.
J. Comb. Optim., 2014

Closing complexity gaps for coloring problems on H-free graphs.
Inf. Comput., 2014

Coloring graphs without short cycles and long induced paths.
Discret. Appl. Math., 2014

List coloring in the absence of two subgraphs.
Discret. Appl. Math., 2014

Packing bipartite graphs with covers of complete bipartite graphs.
Discret. Appl. Math., 2014

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

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

Colouring Reconfiguration Is Fixed-Parameter Tractable.
CoRR, 2014

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.
Algorithmica, 2014

Parameterized complexity of three edge contraction problems with degree constraints.
Acta Informatica, 2014

Knocking Out P k -free Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

A Reconfigurations Analogue of Brooks' Theorem.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Satisfiability of acyclic and almost acyclic CNF formulas.
Theor. Comput. Sci., 2013

Increasing the minimum degree of a graph by contractions.
Theor. Comput. Sci., 2013

Detecting induced minors in AT-free graphs.
Theor. Comput. Sci., 2013

Obtaining planarity by contracting few edges.
Theor. Comput. Sci., 2013

Choosability on H-free graphs.
Inf. Process. Lett., 2013

Three complexity results on coloring Pk-free graphs.
Eur. J. Comb., 2013

A note on contracting claw-free graphs.
Discret. Math. Theor. Comput. Sci., 2013

4-coloring H-free graphs when H is small.
Discret. Appl. Math., 2013

Characterizing graphs of small carving-width.
Discret. Appl. Math., 2013

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

Sparse Square Roots.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Computing vertex-surjective homomorphisms to partially reflexive trees.
Theor. Comput. Sci., 2012

Induced packing of odd cycles in planar graphs.
Theor. Comput. Sci., 2012

Determining the chromatic number of triangle-free 2P<sub>3</sub>-free graphs in polynomial time.
Theor. Comput. Sci., 2012

Updating the complexity status of coloring graphs without a fixed induced linear forest.
Theor. Comput. Sci., 2012

Editorial.
J. Discrete Algorithms, 2012

Computing role assignments of proper interval graphs in polynomial time.
J. Discrete Algorithms, 2012

Detecting induced star-like minors in polynomial time.
J. Discrete Algorithms, 2012

On the parameterized complexity of coloring graphs in the absence of a linear forest.
J. Discrete Algorithms, 2012

Computing solutions for matching games.
Int. J. Game Theory, 2012

On graph contractions and induced minors.
Discret. Appl. Math., 2012

Containment relations in split graphs.
Discret. Appl. Math., 2012

Distance three labelings of trees.
Discret. Appl. Math., 2012

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

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

Finding vertex-surjective graph homomorphisms.
Acta Informatica, 2012

How to Eliminate a Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
On partitioning a graph into two connected subgraphs.
Theor. Comput. Sci., 2011

Parameterizing cut sets in a graph by the number of their components.
Theor. Comput. Sci., 2011

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

Contracting planar graphs to contractions of triangulations.
J. Discrete Algorithms, 2011

Lift Contractions.
Electron. Notes Discret. Math., 2011

On the diameter of reconfiguration graphs for vertex colourings.
Electron. Notes Discret. Math., 2011

On disconnected cuts and separators.
Discret. Appl. Math., 2011

The Computational Complexity of Disconnected Cut and 2K2-Partition
CoRR, 2011

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Contracting a Chordal Graph to a Split Graph or a Tree.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

The Computational Complexity of Disconnected Cut and 2K 2-Partition.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010
Computing role assignments of chordal graphs.
Theor. Comput. Sci., 2010

Comparing Universal Covers in Polynomial Time.
Theory Comput. Syst., 2010

Computing sharp 2-factors in claw-free graphs.
J. Discrete Algorithms, 2010

Path factors and parallel knock-out schemes of almost claw-free graphs.
Discret. Math., 2010

A new characterization of P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2010

Narrowing Down the Gap on the Complexity of Coloring <i>P</i><sub><i>k</i></sub>-Free Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

<i>L</i>(2, 1, 1)-Labeling Is NP-Complete for Trees.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Solution Concepts for Matching Games.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On Contracting Graphs to Fixed Pattern Graphs.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On Coloring Graphs without Induced Forests.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Contractions of Planar Graphs in Polynomial Time.
Proceedings of the Algorithms, 2010

2009
Partitioning graphs into connected parts.
Theor. Comput. Sci., 2009

Covering graphs with few complete bipartite subgraphs.
Theor. Comput. Sci., 2009

Upper bounds and algorithms for parallel knock-out numbers.
Theor. Comput. Sci., 2009

On the Core and <i>f</i>-Nucleolus of Flow Games.
Math. Oper. Res., 2009

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

Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number.
Discuss. Math. Graph Theory, 2009

lambda-backbone colorings along pairwise disjoint stars and matchings.
Discret. Math., 2009

Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Three Complexity Results on Coloring <i>P</i><sub><i>k</i></sub>-Free Graphs.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Induced Packing of Odd Cycles in a Planar Graph.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
The computational complexity of the parallel knock-out problem.
Theor. Comput. Sci., 2008

A New Algorithm for On-line Coloring Bipartite Graphs.
SIAM J. Discret. Math., 2008

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

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

Locally constrained graph homomorphisms and equitable partitions.
Eur. J. Comb., 2008

Relative length of longest paths and longest cycles in triangle-free graphs.
Discret. Math., 2008

A New Characterization of P6-Free Graphs.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
On components of 2-factors in claw-free graphs.
Electron. Notes Discret. Math., 2007

Cycles through specified vertices in triangle-free graphs.
Discuss. Math. Graph Theory, 2007

Improved Upper Bounds for <i>lambda</i> -Backbone Colorings Along Matchings and Stars.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006
Graph Labelings Derived from Models in Distributed Computing.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

On-Line Coloring of H-Free Bipartite Graphs.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
A complete complexity classification of the role assignment problem.
Theor. Comput. Sci., 2005

Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
The computational complexity of the elimination problem in generalized sports competitions.
Discret. Optim., 2004

The Computational Complexity of the Minimum Weight Processor Assignment Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture.
Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology, 2004

2003
Matching Games: The Least Core and the Nucleolus.
Math. Oper. Res., 2003

The Complexity of Graph Contractions.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

The Computational Complexity of the Role Assignment Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2001
Two extensions of the Shapley value for cooperative games.
Math. Methods Oper. Res., 2001

The new FIFA rules are hard: complexity aspects of sports competitions.
Discret. Appl. Math., 2001

2000
Note on the computational complexity of least core concepts for min-cost spanning tree games.
Math. Methods Oper. Res., 2000


  Loading...