A dynamic programming algorithm for covering problems with (greedy) totally balanced constraint matrices

Characterising (k,l)-leaf powers

Discrete Applied Mathematics

Ptolemaic graphs and interval graphs are leaf powers

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Improved complexity bounds for location problems on the real line

Operations Research Letters

On (k, l)-leaf powers

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science