Daniël Paulusma

According to our database1, Daniël Paulusma
  • authored at least 238 papers between 2000 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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.
Journal of Graph Theory, 2017

Bounding the Clique-Width of H-Free Chordal Graphs.
Journal of 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

Contracting bipartite graphs to paths and cycles.
Inf. Process. Lett., 2017

Contracting Bipartite Graphs to Paths and Cycles.
Electronic Notes in Discrete Mathematics, 2017

Kempe equivalence of colourings of cubic graphs.
Eur. J. Comb., 2017

Graph editing to a fixed target.
Discrete Applied Mathematics, 2017

Preface: Algorithmic Graph Theory on the Adriatic Coast.
Discrete Applied Mathematics, 2017

The price of connectivity for feedback vertex set.
Discrete Applied Mathematics, 2017

Critical Vertices and Edges in $H$-free Graphs.
CoRR, 2017

Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2.
CoRR, 2017

Surjective H-Colouring: New Hardness Results.
CoRR, 2017

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

Contracting Bipartite Graphs to Paths and Cycles.
CoRR, 2017

Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity.
CoRR, 2017

Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration.
CoRR, 2017

Independent Feedback Vertex Set for $P_5$-free Graphs.
CoRR, 2017

Independent Feedback Vertex Sets for Graphs of Bounded Diameter.
CoRR, 2017

Clique-Width for Graph Classes Closed under Complementation.
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

Surjective H-Colouring: New Hardness Results.
Proceedings of the Unveiling Dynamics and Complexity, 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.
Journal of Graph Theory, 2016

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

Squares of Low Clique Number.
Electronic Notes in Discrete Mathematics, 2016

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

Classifying the clique-width of H-free bipartite graphs.
Discrete Applied Mathematics, 2016

Bounding the clique-width of H-free split graphs.
Discrete Applied Mathematics, 2016

A Linear Kernel for Finding Square Roots of Almost Planar Graphs.
CoRR, 2016

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.
CoRR, 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

A Linear Kernel for Finding Square Roots of Almost Planar Graphs.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Colouring Diamond-free Graphs.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Using Contracted Solution Graphs for Solving Reconfiguration Problems.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Finding Cactus Roots in Polynomial Time.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 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.
Social Networks, 2015

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

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

The computational complexity of disconnected cut and 2K2-partition.
J. Comb. Theory, Ser. B, 2015

Kempe Equivalence of Colourings of Cubic Graphs.
Electronic Notes in Discrete Mathematics, 2015

Bounding the Clique-Width of H-free Split Graphs.
Electronic Notes in Discrete Mathematics, 2015

What Graphs are 2-Dot Product Graphs?
Electronic Notes in Discrete Mathematics, 2015

Coloring graphs characterized by a forbidden subgraph.
Discrete Applied Mathematics, 2015

Knocking out Pk-free graphs.
Discrete Applied Mathematics, 2015

Kempe Equivalence of Colourings of Cubic Graphs.
CoRR, 2015

A Reconfigurations Analogue of Brooks' Theorem and its Consequences.
CoRR, 2015

Editing to a Planar Graph of Given Degrees.
CoRR, 2015

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

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs.
CoRR, 2015

Bounding the Clique-Width of $H$-free Split Graphs.
CoRR, 2015

Bounding the Clique-Width of H-free Chordal Graphs.
CoRR, 2015

Using Contracted Solution Graphs for Solving Reconfiguration Problems.
CoRR, 2015

The Stable Fixtures Problem with Payments.
CoRR, 2015

The Price of Connectivity for Feedback Vertex Set.
CoRR, 2015

What Graphs are 2-Dot Product Graphs?
CoRR, 2015

Narrowing the Complexity Gap for Colouring (Cs, Pt)-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

The Stable Fixtures Problem with Payments.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

The Price of Connectivity for Cycle Transversals.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

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

Bounding Clique-Width via Perfect Graphs.
Proceedings of the Language and Automata Theory and Applications, 2015

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Minimal Disconnected Cuts in Planar Graphs.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Editing to a Planar Graph of Given Degrees.
Proceedings of the Computer Science - Theory and Applications, 2015

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

Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
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

Lift-contractions.
Eur. J. Comb., 2014

Coloring graphs without short cycles and long induced paths.
Discrete Applied Mathematics, 2014

List coloring in the absence of two subgraphs.
Discrete Applied Mathematics, 2014

Packing bipartite graphs with covers of complete bipartite graphs.
Discrete Applied Mathematics, 2014

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

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time.
CoRR, 2014

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

Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
CoRR, 2014

Classifying the Clique-Width of $H$-Free Bipartite Graphs.
CoRR, 2014

Bounding Clique-Width via Perfect Graphs.
CoRR, 2014

Editing to Eulerian Graphs.
CoRR, 2014

Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree.
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 Inf., 2014

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

Finding Shortest Paths Between Graph Colourings.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Editing to Eulerian Graphs.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Classifying the Clique-Width of H-Free Bipartite Graphs.
Proceedings of the Computing and Combinatorics - 20th International Conference, 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.
Discrete Mathematics & Theoretical Computer Science, 2013

4-coloring H-free graphs when H is small.
Discrete Applied Mathematics, 2013

Characterizing graphs of small carving-width.
Discrete Applied Mathematics, 2013

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
CoRR, 2013

Parameterized Algorithms for Finding Square Roots.
CoRR, 2013

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

Colouring of Graphs with Ramsey-Type Forbidden Subgraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

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

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Model Counting for CNF Formulas of Bounded Modular Treewidth.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

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

Graph Editing to a Fixed Target.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

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

Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

List Coloring in the Absence of Two Subgraphs.
Proceedings of the Algorithms and Complexity, 8th International Conference, 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 2P3-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.
Discrete Applied Mathematics, 2012

Containment relations in split graphs.
Discrete Applied Mathematics, 2012

Distance three labelings of trees.
Discrete Applied Mathematics, 2012

Obtaining Planarity by Contracting Few Edges
CoRR, 2012

Finding vertex-surjective graph homomorphisms
CoRR, 2012

Induced Disjoint Paths in Claw-Free Graphs
CoRR, 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 Inf., 2012

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

Solutions for the Stable Roommates Problem with Payments.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Induced Disjoint Paths in AT-Free Graphs.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

4-Coloring H-Free Graphs When H Is Small.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Coloring Graphs Characterized by a Forbidden Subgraph.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Obtaining Planarity by Contracting Few Edges.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Closing Complexity Gaps for Coloring Problems on H-Free Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Detecting Induced Minors in AT-Free Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Induced Disjoint Paths in Claw-Free Graphs.
Proceedings of the Algorithms - ESA 2012, 2012

Finding Vertex-Surjective Graph Homomorphisms.
Proceedings of the Computer Science - Theory and Applications, 2012

Characterizing Graphs of Small Carving-Width.
Proceedings of the Combinatorial Optimization and Applications, 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.
Electronic Notes in Discrete Mathematics, 2011

On the diameter of reconfiguration graphs for vertex colourings.
Electronic Notes in Discrete Mathematics, 2011

On disconnected cuts and separators.
Discrete Applied Mathematics, 2011

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

Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II)
CoRR, 2011

List Coloring in the Absence of a Linear Forest.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

Increasing the Minimum Degree of a Graph by Contractions.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

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

Coloring Graphs without Short Cycles and Long Induced Paths.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees.
Proceedings of the Computer Science - Theory and Applications, 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.
Discrete Mathematics, 2010

A new characterization of P6-free graphs.
Discrete Applied Mathematics, 2010

Contracting planar graphs to contractions of triangulations
CoRR, 2010

Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

L(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

The k-in-a-path Problem for Claw-free Graphs.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

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

Computing Role Assignments of Proper Interval Graphs in Polynomial Time.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

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

Satisfiability of Acyclic and Almost Acyclic CNF Formulas.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

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

Obtaining Online Ecological Colourings by Generalizing First-Fit.
Proceedings of the Computer Science, 2010

Packing Bipartite Graphs with Covers of Complete Bipartite Graphs.
Proceedings of the Algorithms and Complexity, 7th International Conference, 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 f-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 and Combinatorics, 2009

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

lambda-backbone colorings along pairwise disjoint stars and matchings.
Discrete Mathematics, 2009

The k-in-a-path problem for claw-free graphs
CoRR, 2009

Finding Induced Paths of Given Parity in Claw-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 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 Pk-Free Graphs.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

On Partitioning a Graph into Two Connected Subgraphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Parameterizing Cut Sets in a Graph by the Number of Their Components.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

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

Computing Role Assignments of Chordal Graphs.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Partitioning Graphs into Connected Parts.
Proceedings of the Computer Science, 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. Discrete 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.
Discrete Mathematics, 2008

Computing Sharp 2-Factors in Claw-Free Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Path factors and parallel knock-out schemes of almost claw-free graphs.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Comparing Universal Covers in Polynomial Time.
Proceedings of the Computer Science, 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.
Electronic Notes in Discrete Mathematics, 2007

Cycles through specified vertices in triangle-free graphs.
Discussiones Mathematicae Graph Theory, 2007

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

Upper Bounds and Algorithms for Parallel Knock-Out Numbers.
Proceedings of the Structural Information and Communication Complexity, 2007

Covering Graphs with Few Complete Bipartite Subgraphs.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

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

The Computational Complexity of the Parallel Knock-Out Problem.
Proceedings of the LATIN 2006: Theoretical Informatics, 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.
Discrete Optimization, 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. Meth. of OR, 2001

The new FIFA rules are hard: complexity aspects of sports competitions.
Discrete Applied Mathematics, 2001

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


  Loading...