Katerina Asdre

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The 1-fixed-endpoint path cover problem is Polynomial on interval graphs Algorithmica	2010-09-27	Paper
A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs Theoretical Computer Science	2010-03-09	Paper
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs Frontiers in Algorithmics	2008-06-19	Paper
A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs Networks	2008-01-07	Paper
The harmonious coloring problem is NP-complete for interval and permutation graphs Discrete Applied Mathematics	2007-10-29	Paper
NP-completeness results for some problems on subclasses of bipartite and chordal graphs Theoretical Computer Science	2007-09-03	Paper
An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs Journal of Parallel and Distributed Computing	2007-02-19	Paper
P-tree structures and event horizon: efficient event-set implementations Journal of Computer Science and Technology	2006-10-12	Paper

Research outcomes over time

This page was built for person: Katerina Asdre