Skip to main content

7 Result(s)

within Kyriaki Ioannidou Remove this filter

and

  1. Article

    Open Access

    Building and evaluating resources for sentiment analysis in the Greek language

    Sentiment lexicons and word embeddings constitute well-established sources of information for sentiment analysis in online social media. Although their effectiveness has been demonstrated in state-of-the-art ...

    Adam Tsakalidis, Symeon Papadopoulos, Rania Voskaki… in Language Resources and Evaluation (2018)

    Download PDF (740 KB) View Article

  2. No Access

    Article

    The Longest Path Problem Is Polynomial on Cocomparability Graphs

    The longest path problem is the problem of finding a path of maximum length in a graph. As a generalization of the Hamiltonian path problem, it is NP-complete on general graphs and, in fact, on every class of ...

    Kyriaki Ioannidou, Stavros D. Nikolopoulos in Algorithmica (2013)

  3. No Access

    Article

    The Longest Path Problem has a Polynomial Solution on Interval Graphs

    The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it is NP-hard on general graphs, ...

    Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos in Algorithmica (2011)

  4. No Access

    Chapter and Conference Paper

    Harmonious Coloring on Subclasses of Colinear Graphs

    Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number is the least integer k for which

    Kyriaki Ioannidou, Stavros D. Nikolopoulos in WALCOM: Algorithms and Computation (2010)

  5. No Access

    Chapter and Conference Paper

    The Longest Path Problem is Polynomial on Cocomparability Graphs

    The longest path problem is the problem of finding a path of maximum length in a graph. As a generalization of the Hamiltonian path problem, it is NP-complete on general graphs and, in fact, on every class of ...

    Kyriaki Ioannidou, Stavros D. Nikolopoulos in Graph Theoretic Concepts in Computer Science (2010)

  6. No Access

    Chapter and Conference Paper

    The Longest Path Problem Is Polynomial on Interval Graphs

    The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it is NP-hard on general graphs, ...

    Kyriaki Ioannidou, George B. Mertzios… in Mathematical Foundations of Computer Scien… (2009)

  7. No Access

    Chapter and Conference Paper

    Colinear Coloring on Graphs

    Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology, and the framework through which it was studied, we introduce the colinear color...

    Kyriaki Ioannidou, Stavros D. Nikolopoulos in WALCOM: Algorithms and Computation (2009)