### Classifying k-edge colouring for H-free graphs

E. Galby, P. T. Lima, D. Paulusma and B. Ries

submitted

arXiv

### Rainbow vertex coloring bipartite graphs and chordal graphs

P. Heggernes, D. Issac, J. Lauri, P. T. Lima and E. J. van Leeuwen

MFCS 2018, Leibniz International Proceedings in Informatics 117 (2018), 83:1-83:13.

lipics

### Parameterized aspects of strong subgraph closure

P. A. Golovach, P. Heggernes, A. L. Konstantinidis, P. T. Lima and C. Papadopoulos

SWAT 2018, Leibniz International Proceedings in Informatics 101 (2018), 23:1-23:13.

lipics arXiv

### Transversals of longest paths

M. R. Cerioli, C. G. Fernandes, R. Gómez, J. Gutiérrez and P. T. Lima

LAGOS 2017, Eletronic Notes in Discrete Mathematics 62 (2017), 135-140.

endm arXiv

### Finding connected secluded subgraphs

P. A. Golovach, P. Heggernes, P. T. Lima and P. Montealegre

IPEC 2017, Leibniz International Proceedings in Informatics 89 (2018), 18:1-18:13.

lipics arXiv

### Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2

P. A. Golovach, P. Heggernes, D. Kratsch, P. T. Lima and D. Paulusma

WG 2017, Lecture Notes in Computer Science 10520 (2017), 275-288.

lncs arXiv

### Intersection of longest paths in graph classes

M. R. Cerioli and P. Lima

CTW 2016, Eletronic Notes in Discrete Mathematics 55 (2016), 139-142.

endm