|
2016
|
Editing to Eulerian graphs
published
| article-journal
doi:10.1016/j.jcss.2015.10.003
|
|
2018-06-26
|
Independent Feedback Vertex Set for $$P_5$$P5-Free Graphs
published
| article-journal
doi:10.1007/s00453-018-0474-x
|
|
2018
|
On colouring (2 P 2 , H )-free and ( P 5 , H )-free graphs
published
| article-journal
| CC-BY
doi:10.1016/j.ipl.2018.02.003
|
|
2017
|
Colouring diamond-free graphs
published
| article-journal
| CC-BY
doi:10.1016/j.jcss.2017.06.005
|
|
2018
|
Computing Small Pivot-Minors
published
| chapter
doi:10.1007/978-3-030-00256-5_11
|
|
2017
|
Editing to a planar graph of given degrees
published
| article-journal
| CC-BY
doi:10.1016/j.jcss.2016.11.009
|
|
2016
|
Bounding clique-width via perfect graphs
published
| article-journal
doi:10.1016/j.jcss.2016.06.007
|
|
2016
|
Bounding the clique-width of <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>H</mml:mi></mml:math>-free split graphs
published
| article-journal
doi:10.1016/j.dam.2016.04.003
|
|
2019-05-31
|
Filling the complexity gaps for colouring planar and bounded degree graphs
published
| article-journal
doi:10.1002/jgt.22459
|
|
2020
|
Clique-Width for Graph Classes Closed under Complementation
published
| article-journal
doi:10.1137/18m1235016
|
|
2021-05-17
|
Negative effects of artificial diets on growth and the digestive tract of 1‐month‐old Redhead cichlid (
Vieja melanura
, Günther, 1862)
published
| article-journal
doi:10.1111/are.15323
|
|
2023-07-10
|
Clique‐width: Harnessing the power of atoms
published
| article-journal
| CC-BY
doi:10.1002/jgt.23000
|
|
2024-04-18
|
An Algorithmic Framework for Locally Constrained Homomorphisms
published
| article-journal
doi:10.1137/22m1513290
|
|
2018
|
Independent feedback vertex sets for graphs of bounded diameter
published
| article-journal
| CC-BY
doi:10.1016/j.ipl.2017.11.004
|
|
2016
|
Classifying the clique-width of <mml:math altimg="si106.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>H</mml:mi></mml:math>-free bipartite graphs
published
| article-journal
doi:10.1016/j.dam.2015.06.030
|
|
2019
|
Graph Isomorphism for $$(H_1,H_2)$$ ( H 1 , H 2 ) -Free Graphs: An Almost Complete Dichotomy
published
| chapter
doi:10.1007/978-3-030-24766-9_14
|
|
2020-08-05
|
Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy
published
| article-journal
| CC-BY
doi:10.1007/s00453-020-00747-x
|
|
2021-05-24
|
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
published
| article-journal
| CC-BY
doi:10.1002/jgt.22683
|
|
2023-12-13
|
Parameterized Complexity Classification for Interval Constraints
published
| article-journal
| CC-BY
doi:10.4230/lipics.ipec.2023.11
|
|
2017
|
Contracting bipartite graphs to paths and cycles
published
| article-journal
| CC-BY
doi:10.1016/j.ipl.2017.06.013
|
|
2018-11-25
|
Hereditary graph classes: When the complexities of
coloring
and
clique cover
coincide
published
| article-journal
doi:10.1002/jgt.22431
|
|
2020-04-29
|
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
published
| article-journal
doi:10.1007/s00453-020-00706-6
|
|
2020
|
Clique-Width: Harnessing the Power of Atoms
published
| chapter
doi:10.1007/978-3-030-60440-0_10
|
|
2023
|
Solving Infinite-Domain CSPs Using the Patchwork Property
published
| article-journal
| CC-BY
doi:10.1016/j.artint.2023.103880
|
|
2016-01-01
|
On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs
published
| article-journal
| v1
doi:10.60692/f5k75-d4b64
|
|
2016-01-01
|
On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs
published
| article-journal
| v1
doi:10.60692/vna2a-svz14
|