| Publication | Date of Publication | Type |
|---|
| Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius | 2024-12-03 | Paper |
| Complexity framework for forbidden subgraphs III: when problems are tractable on subcubic graphs | 2024-12-03 | Paper |
Tree pivot-minors and linear rank-width
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Independent transversals versus transversals
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
Theoretical Computer Science | 2024-10-07 | Paper |
| Finding matching cuts in \(H\)-free graphs | 2024-09-11 | Paper |
Classifying subset feedback vertex set for \(H\)-free graphs
Theoretical Computer Science | 2024-06-04 | Paper |
An algorithmic framework for locally constrained homomorphisms
SIAM Journal on Discrete Mathematics | 2024-05-08 | Paper |
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
European Journal of Combinatorics | 2024-01-23 | Paper |
| scientific article; zbMATH DE number 7788594 (Why is no real title available?) | 2024-01-15 | Paper |
Solving problems on generalized convex graphs via mim-width
Journal of Computer and System Sciences | 2024-01-04 | Paper |
| Maximizing Matching Cuts | 2023-12-20 | Paper |
The complexity of \(L(p, q)\)-edge-labelling
Algorithmica | 2023-11-17 | Paper |
Contracting to a longest path in H-free graphs
(available as arXiv preprint) | 2023-11-14 | Paper |
| Bounding the Mim-Width of Hereditary Graph Classes. | 2023-11-13 | Paper |
| Computing pivot-minors | 2023-11-08 | Paper |
Clique‐width: Harnessing the power of atoms
Journal of Graph Theory | 2023-11-06 | Paper |
The complexity of matching games: a survey
The Journal of Artificial Intelligence Research (JAIR) | 2023-10-23 | Paper |
Finding matching cuts in \(H\)-free graphs
Algorithmica | 2023-10-06 | Paper |
Bounding the mim‐width of hereditary graph classes
Journal of Graph Theory | 2023-10-04 | Paper |
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
Journal of Graph Theory | 2023-10-04 | Paper |
Induced disjoint paths and connected subgraphs for \(H\)-free graphs
Algorithmica | 2023-09-27 | Paper |
QCSP on Reflexive Tournaments
(available as arXiv preprint) | 2023-09-20 | Paper |
| Comparing Width Parameters on Graph Classes | 2023-08-10 | Paper |
| Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs | 2023-08-08 | Paper |
Few induced disjoint paths for \(H\)-free graphs
Lecture Notes in Computer Science | 2023-08-03 | Paper |
| Computing Subset Vertex Covers in $H$-Free Graphs | 2023-07-11 | Paper |
Induced disjoint paths and connected subgraphs for \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Classifying subset feedback vertex set for \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
An algorithmic framework for locally constrained homomorphisms
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
An algorithmic framework for locally constrained homomorphisms
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem | 2023-05-02 | Paper |
| Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs | 2023-05-01 | Paper |
Colouring graphs of bounded diameter in the absence of small cycles
Lecture Notes in Computer Science | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7651161 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Matching Cuts in Graphs of High Girth and H-Free Graphs | 2022-12-23 | Paper |
Computing subset transversals in \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Clique-width: harnessing the power of atoms
(available as arXiv preprint) | 2022-12-21 | Paper |
| Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision | 2022-11-25 | Paper |
| Complexity Framework For Forbidden Subgraphs I: The Framework | 2022-11-23 | Paper |
Few induced disjoint paths for \(H\)-free graphs
Theoretical Computer Science | 2022-11-17 | Paper |
On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
Theoretical Computer Science | 2022-10-21 | Paper |
| Steiner trees for hereditary graph classes | 2022-10-13 | Paper |
Feedback vertex set and even cycle transversal for \(H\)-free graphs: finding large block graphs
SIAM Journal on Discrete Mathematics | 2022-10-06 | Paper |
Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
Theoretical Computer Science | 2022-09-01 | Paper |
Partitioning \(H\)-free graphs of bounded diameter
Theoretical Computer Science | 2022-08-25 | Paper |
| Colouring H-free graphs of bounded diameter. | 2022-07-21 | Paper |
| Colouring (P_r+P_s)-Free Graphs | 2022-07-21 | Paper |
Finding a small number of colourful components
(available as arXiv preprint) | 2022-07-18 | Paper |
The complexity of \(L(p, q)\)-edge-labelling
(available as arXiv preprint) | 2022-07-13 | Paper |
Acyclic, star, and injective colouring: bounding the diameter
The Electronic Journal of Combinatorics | 2022-06-13 | Paper |
Acyclic, star, and injective colouring: bounding the diameter
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
Journal of Computer and System Sciences | 2022-05-16 | Paper |
Colouring graphs of bounded diameter in the absence of small cycles
Discrete Applied Mathematics | 2022-04-20 | Paper |
On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs
(available as arXiv preprint) | 2022-04-14 | Paper |
Solving problems on generalized convex graphs via mim-width
(available as arXiv preprint) | 2022-03-25 | Paper |
| Computing weighted subset transversals in \(H\)-free graphs | 2022-03-25 | Paper |
Disjoint paths and connected subgraphs for \(H\)-free graphs
Lecture Notes in Computer Science | 2022-03-22 | Paper |
| Injective colouring for H-free graphs | 2022-03-21 | Paper |
Few Induced Disjoint Paths for $H$-Free Graphs
(available as arXiv preprint) | 2022-03-07 | Paper |
What Graphs are 2-Dot Product Graphs?
International Journal of Computational Geometry & Applications | 2022-02-01 | Paper |
Computing subset transversals in \(H\)-free graphs
Theoretical Computer Science | 2022-01-18 | Paper |
Tree pivot-minors and linear rank-width
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
Hard problems that quickly become very easy
Information Processing Letters | 2021-12-14 | Paper |
Disjoint paths and connected subgraphs for \(H\)-free graphs
Theoretical Computer Science | 2021-12-01 | Paper |
Induced disjoint paths in AT-free graphs
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter
(available as arXiv preprint) | 2021-11-23 | Paper |
List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective
Information Processing Letters | 2021-10-19 | Paper |
In memoriam Walter Kern
Discrete Applied Mathematics | 2021-09-15 | Paper |
Disconnected cuts in claw-free graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
scientific article; zbMATH DE number 7378380 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Disjoint Paths and Connected Subgraphs for H-Free Graphs
(available as arXiv preprint) | 2021-05-13 | Paper |
Partitioning H-Free Graphs of Bounded Diameter
(available as arXiv preprint) | 2021-05-10 | Paper |
Acyclic, Star, and Injective Colouring: Bounding the Diameter
(available as arXiv preprint) | 2021-04-21 | Paper |
Steiner trees for hereditary graph classes: a treewidth perspective
Theoretical Computer Science | 2021-04-15 | Paper |
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
Algorithmica | 2021-04-08 | Paper |
Clique-width for hereditary graph classes
Surveys in Combinatorics 2019 | 2021-02-06 | Paper |
| Independent Feedback Vertex Set for P_5-free Graphs | 2020-11-25 | Paper |
On cycle transversals and their connected variants in the absence of a small linear forest
Algorithmica | 2020-10-12 | Paper |
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
(available as arXiv preprint) | 2020-08-21 | Paper |
| Colouring square-free graphs without long induced paths | 2020-08-05 | Paper |
| Surjective \texttt{H}-colouring over reflexive digraphs | 2020-08-05 | Paper |
Computing Weighted Subset Transversals in $H$-Free Graphs
(available as arXiv preprint) | 2020-07-28 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Journal of Graph Theory | 2020-07-17 | Paper |
Clique-width for graph classes closed under complementation
SIAM Journal on Discrete Mathematics | 2020-06-09 | Paper |
Disconnected cuts in claw-free graphs
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Clique-Width: Harnessing the Power of Atoms
(available as arXiv preprint) | 2020-06-05 | Paper |
Computing Subset Transversals in $H$-Free Graphs
(available as arXiv preprint) | 2020-05-28 | Paper |
| Recognizing Graphs Close to Bipartite Graphs | 2020-05-26 | Paper |
| scientific article; zbMATH DE number 7204407 (Why is no real title available?) | 2020-05-26 | Paper |
Colouring \((P_r + P_s)\)-free graphs
Algorithmica | 2020-05-21 | Paper |
| Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective | 2020-04-10 | Paper |
Simple games versus weighted voting games: bounding the critical threshold value
Social Choice and Welfare | 2020-04-08 | Paper |
Simple games versus weighted voting games: bounding the critical threshold value
Social Choice and Welfare | 2020-04-08 | Paper |
On cycle transversals and their connected variants in the absence of a small linear forest
Fundamentals of Computation Theory | 2020-01-30 | Paper |
On cycle transversals and their connected variants in the absence of a small linear forest
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Connected vertex cover for \((sP_1+P_5)\)-free graphs
Algorithmica | 2020-01-16 | Paper |
| Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy | 2020-01-16 | Paper |
Surjective H-Colouring over Reflexive Digraphs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Surjective H-Colouring over Reflexive Digraphs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Clique-width and well-quasi-ordering of triangle-free graph classes
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Surjective \(H\)-colouring: new hardness results
Computability | 2019-10-28 | Paper |
Using contracted solution graphs for solving reconfiguration problems
Acta Informatica | 2019-10-17 | Paper |
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
(available as arXiv preprint) | 2019-10-11 | Paper |
Colouring square-free graphs without long induced paths
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Colouring square-free graphs without long induced paths
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
Journal of Graph Theory | 2019-08-15 | Paper |
Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
Journal of Graph Theory | 2019-08-15 | Paper |
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
(available as arXiv preprint) | 2019-08-01 | Paper |
Bounding clique-width via perfect graphs
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Bounding clique-width via perfect graphs
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | Paper |
Classifying \(k\)-edge colouring for \(H\)-free graphs
Information Processing Letters | 2019-04-26 | Paper |
Independent feedback vertex set for \(P_5\)-free graphs
Algorithmica | 2019-04-25 | Paper |
Critical vertices and edges in \(H\)-free graphs
Discrete Applied Mathematics | 2019-03-11 | Paper |
On the parameterized complexity of \((k,s)\)-SAT
Information Processing Letters | 2019-01-18 | Paper |
| On the Parameterized Complexity of $k$-Edge Colouring | 2019-01-07 | Paper |
Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy
(available as arXiv preprint) | 2018-11-29 | Paper |
| Computing small pivot-minors | 2018-11-22 | Paper |
Connected vertex cover for \((sP_1+P_5)\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Connected vertex cover for \((sP_1+P_5)\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Simple games versus weighted voting games
(available as arXiv preprint) | 2018-11-08 | Paper |
| Simple games versus weighted voting games | 2018-11-08 | Paper |
Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
Theoretical Computer Science | 2018-09-27 | Paper |
Computing square roots of graphs with low maximum degree
Discrete Applied Mathematics | 2018-09-17 | Paper |
Computing square roots of graphs with low maximum degree
Discrete Applied Mathematics | 2018-09-17 | Paper |
Finding cactus roots in polynomial time
Theory of Computing Systems | 2018-08-03 | Paper |
Well-quasi-ordering versus clique-width: new results on bigenic classes
Order | 2018-07-27 | Paper |
The stable fixtures problem with payments
Games and Economic Behavior | 2018-07-12 | Paper |
The stable fixtures problem with payments
Games and Economic Behavior | 2018-07-12 | Paper |
Minimal disconnected cuts in planar graphs
Networks | 2018-05-23 | Paper |
| Reducing the chromatic number by vertex or edge deletions | 2018-04-09 | Paper |
On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs
Information Processing Letters | 2018-04-04 | Paper |
Using contracted solution graphs for solving reconfiguration problems
(available as arXiv preprint) | 2018-03-21 | Paper |
Disconnected Cuts in Claw-free Graphs
(available as arXiv preprint) | 2018-03-09 | Paper |
Contracting bipartite graphs to paths and cycles
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Contracting bipartite graphs to paths and cycles
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Clique-width and well-quasi-ordering of triangle-free graph classes
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Clique-width and well-quasi-ordering of triangle-free graph classes
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Independent feedback vertex sets for graphs of bounded diameter
Information Processing Letters | 2017-12-13 | Paper |
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Theoretical Computer Science | 2017-11-16 | Paper |
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Theoretical Computer Science | 2017-11-16 | Paper |
Obtaining online ecological colourings by generalizing first-fit
Theory of Computing Systems | 2017-11-07 | Paper |
| Colouring diamond-free graphs | 2017-10-17 | Paper |
| A linear kernel for finding square roots of almost planar graphs | 2017-10-17 | Paper |
Bounding the Clique‐Width of H‐Free Chordal Graphs
Journal of Graph Theory | 2017-09-26 | Paper |
A linear kernel for finding square roots of almost planar graphs
Theoretical Computer Science | 2017-09-07 | Paper |
A linear kernel for finding square roots of almost planar graphs
Theoretical Computer Science | 2017-09-07 | Paper |
Colouring diamond-free graphs
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Contracting bipartite graphs to paths and cycles
Information Processing Letters | 2017-08-16 | Paper |
| Surjective \(H\)-colouring: new hardness results | 2017-08-04 | Paper |
Surjective \(H\)-colouring: new hardness results
(available as arXiv preprint) | 2017-08-04 | Paper |
Blocking independent sets for \(H\)-free graphs via edge contractions and vertex deletions
Lecture Notes in Computer Science | 2017-05-19 | Paper |
| Editing to Eulerian graphs | 2017-04-25 | Paper |
A survey on the computational complexity of coloring graphs with forbidden subgraphs
Journal of Graph Theory | 2017-04-21 | Paper |
A survey on the computational complexity of coloring graphs with forbidden subgraphs
Journal of Graph Theory | 2017-04-21 | Paper |
The price of connectivity for feedback vertex set
Discrete Applied Mathematics | 2017-03-15 | Paper |
| Squares of low clique number | 2017-02-14 | Paper |
| Model counting for CNF formulas of bounded modular treewidth | 2017-01-30 | Paper |
Editing to a planar graph of given degrees
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Graph editing to a fixed target
Discrete Applied Mathematics | 2016-11-24 | Paper |
A reconfigurations analogue of Brooks' theorem and its consequences
Journal of Graph Theory | 2016-11-17 | Paper |
A reconfigurations analogue of Brooks' theorem and its consequences
Journal of Graph Theory | 2016-11-17 | Paper |
Bounding the clique-width of \(H\)-free split graphs
Discrete Applied Mathematics | 2016-11-02 | Paper |
Model counting for CNF formulas of bounded modular treewidth
Algorithmica | 2016-11-01 | Paper |
Open problems on graph coloring for special graph classes
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
The stable fixtures problem with payments
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
| What graphs are 2-dot product graphs? | 2016-10-14 | Paper |
What graphs are 2-dot product graphs?
(available as arXiv preprint) | 2016-10-14 | Paper |
Bounding the clique-width of \(H\)-free split graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Kempe equivalence of colourings of cubic graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Kempe equivalence of colourings of cubic graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Kempe equivalence of colourings of cubic graphs
European Journal of Combinatorics | 2016-10-12 | Paper |
Well-quasi-ordering versus clique-width: new results on bigenic classes
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Finding cactus roots in polynomial time
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Finding shortest paths between graph colourings
Algorithmica | 2016-09-07 | Paper |
The price of connectivity for cycle transversals
European Journal of Combinatorics | 2016-08-16 | Paper |
Induced disjoint paths in circular-arc graphs in linear time
Theoretical Computer Science | 2016-07-05 | Paper |
Bounding clique-width via perfect graphs
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Parameterized algorithms for finding square roots
Algorithmica | 2016-03-29 | Paper |
Parameterized algorithms for finding square roots
Algorithmica | 2016-03-29 | Paper |
| New Bounds for the Snake-in-the-Box Problem | 2016-03-01 | Paper |
Classifying the clique-width of \(H\)-free bipartite graphs
Discrete Applied Mathematics | 2016-01-21 | Paper |
Editing to Eulerian graphs
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Editing to a planar graph of given degrees
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Editing to a planar graph of given degrees
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Minimal disconnected cuts in planar graphs
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Clique-width of graph classes defined by two forbidden induced subgraphs
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Clique-width of graph classes defined by two forbidden induced subgraphs
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Contraction Blockers for Graphs with Forbidden Induced Paths
Lecture Notes in Computer Science | 2015-09-21 | Paper |
The price of connectivity for cycle transversals
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Bounding the clique-width of \(H\)-free chordal graphs
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Finding shortest paths between graph colourings
Parameterized and Exact Computation | 2015-09-15 | Paper |
Finding shortest paths between graph colourings
Parameterized and Exact Computation | 2015-09-15 | Paper |
Induced disjoint paths in circular-arc graphs in linear time
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory | 2015-07-23 | Paper |
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
Journal of Graph Theory | 2015-07-23 | Paper |
Knocking out \(P_k\)-free graphs
Discrete Applied Mathematics | 2015-07-06 | Paper |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Theoretical Computer Science | 2015-06-10 | Paper |
Modifying a graph using vertex elimination
Algorithmica | 2015-05-21 | Paper |
Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Induced disjoint paths in claw-free graphs
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
Induced disjoint paths in claw-free graphs
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
The computational complexity of disconnected cut and \(2 K_2\)-partition
Journal of Combinatorial Theory. Series B | 2015-03-05 | Paper |
List coloring in the absence of a linear forest
Algorithmica | 2015-03-02 | Paper |
Coloring graphs characterized by a forbidden subgraph
Discrete Applied Mathematics | 2014-11-28 | Paper |
Parameterized complexity of three edge contraction problems with degree constraints
Acta Informatica | 2014-11-14 | Paper |
A reconfigurations analogue of Brooks' theorem
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Forbidden induced subgraphs and the price of connectivity for feedback vertex set
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Knocking out \(P _{k }\)-free graphs
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Classifying the clique-width of \(H\)-free bipartite graphs
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Lift-contractions
European Journal of Combinatorics | 2014-07-29 | Paper |
Closing complexity gaps for coloring problems on \(H\)-free graphs
Information and Computation | 2014-07-18 | Paper |
Detecting fixed patterns in chordal graphs in polynomial time
Algorithmica | 2014-07-03 | Paper |
| scientific article; zbMATH DE number 6302975 (Why is no real title available?) | 2014-06-11 | Paper |
Solutions for the stable roommates problem with payments
Theoretical Computer Science | 2014-06-06 | Paper |
Characterizing graphs of small carving-width
Discrete Applied Mathematics | 2014-04-22 | Paper |
Packing bipartite graphs with covers of complete bipartite graphs
Discrete Applied Mathematics | 2014-04-02 | Paper |
Coloring graphs without short cycles and long induced paths
Discrete Applied Mathematics | 2014-03-27 | Paper |
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
List coloring in the absence of two subgraphs
Discrete Applied Mathematics | 2014-02-18 | Paper |
| A note on contracting claw-free graphs | 2014-02-14 | Paper |
Colouring of graphs with Ramsey-type forbidden subgraphs
Theoretical Computer Science | 2014-01-24 | Paper |
Graph editing to a fixed target
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Algorithms to measure diversity and clustering in social networks through dot product graphs
Algorithms and Computation | 2014-01-14 | Paper |
Detecting induced minors in AT-free graphs
Theoretical Computer Science | 2014-01-09 | Paper |
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
Parameterized and Exact Computation | 2013-12-10 | Paper |
Sparse square roots
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Colouring of graphs with Ramsey-type forbidden subgraphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science | 2013-11-29 | Paper |
Increasing the minimum degree of a graph by contractions
Theoretical Computer Science | 2013-11-29 | Paper |
| On the diameter of reconfiguration graphs for vertex colourings | 2013-11-01 | Paper |
| Lift contractions | 2013-11-01 | Paper |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Detecting induced star-like minors in polynomial time
Journal of Discrete Algorithms | 2013-06-24 | Paper |
List coloring in the absence of two subgraphs
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Obtaining planarity by contracting few edges
Theoretical Computer Science | 2013-04-17 | Paper |
Closing complexity gaps for coloring problems on \(H\)-free graphs
Algorithms and Computation | 2013-03-21 | Paper |
Detecting induced minors in AT-free graphs
Algorithms and Computation | 2013-03-21 | Paper |
Choosability on \(H\)-free graphs
Information Processing Letters | 2013-03-20 | Paper |
Exact algorithms for finding longest cycles in claw-free graphs
Algorithmica | 2013-03-05 | Paper |
Three complexity results on coloring \(P_k\)-free graphs
European Journal of Combinatorics | 2013-01-24 | Paper |
4-coloring \(H\)-free graphs when \(H\) is small
Discrete Applied Mathematics | 2012-11-22 | Paper |
Solutions for the stable roommates problem with payments
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
How to eliminate a graph
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Characterizing Graphs of Small Carving-Width
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Finding vertex-surjective graph homomorphisms
Acta Informatica | 2012-10-15 | Paper |
Computing vertex-surjective homomorphisms to partially reflexive trees
Theoretical Computer Science | 2012-10-11 | Paper |
Induced disjoint paths in claw-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Coloring graphs characterized by a forbidden subgraph
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Obtaining planarity by contracting few edges
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Obtaining planarity by contracting few edges
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Computing role assignments of proper interval graphs in polynomial time
Journal of Discrete Algorithms | 2012-09-13 | Paper |
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Finding vertex-surjective graph homomorphisms
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Finding vertex-surjective graph homomorphisms
Computer Science – Theory and Applications | 2012-09-10 | Paper |
| Satisfiability of acyclic and almost acyclic CNF formulas | 2012-08-29 | Paper |
Induced disjoint paths in AT-free graphs
Lecture Notes in Computer Science | 2012-08-14 | Paper |
4-coloring \(H\)-free graphs when \(H\) is small
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Increasing the minimum degree of a graph by contractions
Parameterized and Exact Computation | 2012-06-15 | Paper |
Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time
Theoretical Computer Science | 2012-05-14 | Paper |
On graph contractions and induced minors
Discrete Applied Mathematics | 2012-05-11 | Paper |
Distance three labelings of trees
Discrete Applied Mathematics | 2012-05-11 | Paper |
The \(k\)-in-a-path problem for claw-free graphs
Algorithmica | 2012-04-26 | Paper |
Finding induced paths of given parity in claw-free graphs
Algorithmica | 2012-04-26 | Paper |
Containment relations in split graphs
Discrete Applied Mathematics | 2012-03-19 | Paper |
Updating the complexity status of coloring graphs without a fixed induced linear forest
Theoretical Computer Science | 2012-03-13 | Paper |
Induced packing of odd cycles in planar graphs
Theoretical Computer Science | 2012-03-13 | Paper |
Computing solutions for matching games
International Journal of Game Theory | 2012-02-22 | Paper |
| The \(k\)-in-a-path problem for claw-free graphs | 2012-01-23 | Paper |
Parameterizing cut sets in a graph by the number of their components
Theoretical Computer Science | 2012-01-09 | Paper |
| Path factors and parallel knock-out schemes of almost claw-free graphs | 2011-12-19 | Paper |
Finding contractions and induced minors in chordal graphs via disjoint paths
Algorithms and Computation | 2011-12-16 | Paper |
List coloring in the absence of a linear forest
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
On partitioning a graph into two connected subgraphs
Theoretical Computer Science | 2011-12-07 | Paper |
Graph labelings derived from models in distributed computing: A complete complexity classification
Networks | 2011-11-21 | Paper |
Contracting planar graphs to contractions of triangulations
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Coloring graphs without short cycles and long induced paths
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Contracting a chordal graph to a split graph or a tree
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
On disconnected cuts and separators
Discrete Applied Mathematics | 2011-08-10 | Paper |
Satisfiability of acyclic and almost acyclic CNF formulas. II
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Computing vertex-surjective homomorphisms to partially reflexive trees
Computer Science – Theory and Applications | 2011-06-17 | Paper |
Computing role assignments of proper interval graphs in polynomial time
Lecture Notes in Computer Science | 2011-05-19 | Paper |
On the core and \(f\)-nucleolus of flow games
Mathematics of Operations Research | 2011-04-27 | Paper |
On coloring graphs without induced forests
Algorithms and Computation | 2010-12-09 | Paper |
Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Computing role assignments of chordal graphs
Theoretical Computer Science | 2010-10-11 | Paper |
Contractions of Planar Graphs in Polynomial Time
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Computing sharp 2-factors in claw-free graphs
Journal of Discrete Algorithms | 2010-08-18 | Paper |
Comparing universal covers in polynomial time
Theory of Computing Systems | 2010-08-13 | Paper |
Obtaining online ecological colourings by generalizing first-fit
Computer Science – Theory and Applications | 2010-06-22 | Paper |
\(L(2,1,1)\)-labeling is NP-complete for trees
Lecture Notes in Computer Science | 2010-06-17 | Paper |
On solution concepts for matching games
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Packing bipartite graphs with covers of complete bipartite graphs
Lecture Notes in Computer Science | 2010-05-28 | Paper |
A new characterization of \(P_{6}\)-free graphs
Discrete Applied Mathematics | 2010-05-25 | Paper |
Path factors and parallel knock-out schemes of almost claw-free graphs
Discrete Mathematics | 2010-05-05 | Paper |
On contracting graphs to fixed pattern graphs
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Fast exact algorithms for Hamiltonicity in claw-free graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Finding induced paths of given parity in claw-free graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
Graphs and Combinatorics | 2010-01-18 | Paper |
The complexity of graph contractions.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Induced Packing of Odd Cycles in a Planar Graph
Algorithms and Computation | 2009-12-17 | Paper |
On partitioning a graph into two connected subgraphs
Algorithms and Computation | 2009-12-17 | Paper |
Parameterizing cut sets in a graph by the number of their components
Algorithms and Computation | 2009-12-17 | Paper |
\(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
Discrete Mathematics | 2009-12-15 | Paper |
Three complexity results on coloring \(P _{k }\)-free graphs
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Partitioning graphs into connected parts
Theoretical Computer Science | 2009-11-06 | Paper |
Computing Role Assignments of Chordal Graphs
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Partitioning Graphs into Connected Parts
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
Discussiones Mathematicae Graph Theory | 2009-08-03 | Paper |
The computational complexity of graph contractions II: Two tough polynomially solvable cases
Networks | 2009-06-16 | Paper |
Covering graphs with few complete bipartite subgraphs
Theoretical Computer Science | 2009-05-28 | Paper |
Upper bounds and algorithms for parallel knock-out numbers
Theoretical Computer Science | 2009-03-30 | Paper |
A New Algorithm for On-line Coloring Bipartite Graphs
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
Computing Sharp 2-Factors in Claw-Free Graphs
Lecture Notes in Computer Science | 2009-02-03 | Paper |
The Computational Complexity of the Parallel Knock-Out Problem
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Graph Labelings Derived from Models in Distributed Computing
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
A New Characterization of P 6-Free Graphs
Lecture Notes in Computer Science | 2008-07-10 | Paper |
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
Networks | 2008-06-20 | Paper |
On components of 2-factors in claw-free graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Comparing Universal Covers in Polynomial Time
Computer Science – Theory and Applications | 2008-06-05 | Paper |
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics | 2008-05-13 | Paper |
Covering Graphs with Few Complete Bipartite Subgraphs
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
The computational complexity of the parallel knock-out problem
Theoretical Computer Science | 2008-04-15 | Paper |
Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Cycles through specified vertices in triangle-free graphs
Discussiones Mathematicae Graph Theory | 2008-02-22 | Paper |
Relative length of longest paths and longest cycles in triangle-free graphs
Discrete Mathematics | 2008-02-11 | Paper |
Upper Bounds and Algorithms for Parallel Knock-Out Numbers
Structural Information and Communication Complexity | 2007-11-15 | Paper |
On-Line Coloring of H-Free Bipartite Graphs
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
A complete complexity classification of the role assignment problem
Theoretical Computer Science | 2006-03-20 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Matching Games: The Least Core and the Nucleolus
Mathematics of Operations Research | 2005-11-11 | Paper |
The computational complexity of the elimination problem in generalized sports competitions
Discrete Optimization | 2005-08-22 | Paper |
The new FIFA rules are hard: Complexity aspects of sports competitions.
Discrete Applied Mathematics | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 2038757 (Why is no real title available?) | 2004-02-08 | Paper |
Two extensions of the shapley value for cooperative games
Mathematical Methods of Operations Research | 2003-07-15 | Paper |
Note on the computational complexity of least core concepts for min-cost spanning tree games.
Mathematical Methods of Operations Research | 2000-01-01 | Paper |
Partitioned Matching Games for International Kidney Exchange
(available as arXiv preprint) | N/A | Paper |
Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
(available as arXiv preprint) | N/A | Paper |
Finding $d$-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and $H$-Free Graphs
(available as arXiv preprint) | N/A | Paper |
