Concepedia

Katerina Asdre

KA

5

Publications

126

Citations

5

H-Index

2007

Active since

Affiliations

University of Ioannina(Current)

Katerina Asdre is an author at University of Ioannina specializing in discrete mathematics, combinatorial optimization, and graph theory.

Top concepts

Graph TheoryDiscrete MathematicsCombinatorial OptimizationEngineeringComputational GeometryComputational ComplexityComputer ScienceMathematical ProgrammingCovering Problems

Publications per year

2007–2009

5

Publications

5

The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs

Katerina Asdre, Stavros D. Nikolopoulos · Algorithmica · 2009 · 47 citations

Mathematical Programming, Geometric Graph Theory, Engineering +8

The harmonious coloring problem is NP-complete for interval and permutation graphs

Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos · Discrete Applied Mathematics · 2007 · 23 citations

Mathematical Programming, Engineering, Graph Theory +11

NP-completeness results for some problems on subclasses of bipartite and chordal graphs

Katerina Asdre, Stavros D. Nikolopoulos · Theoretical Computer Science · 2007 · 21 citations

Chordal Graphs, Graph Minor, Engineering +10

A polynomial solution to the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-fixed-endpoint path cover problem on proper interval graphs

Katerina Asdre, Stavros D. Nikolopoulos · Theoretical Computer Science · 2009 · 21 citations

Math Xmlns, Geometric Graph Theory, Geometric Algorithm +8

A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs

Katerina Asdre, Stavros D. Nikolopoulos · Networks · 2007 · 14 citations

Geometric Graph Theory, Covering Problems, Graph Theory +15

Rows per page

1–5 of 5