.

Browsing School of Arts and Sciences by Author "Sikora, Florian"

LAUR Repository

Browsing School of Arts and Sciences by Author "Sikora, Florian"

Sort by: Order: Results:

  • On the complexity of QoS-Aware service selection problem 
    Abu-Khzam, Faisal N.; Bazgan, Cristina; El Haddad, Joyce; Sikora, Florian (Springer, 2017-03-16)
    This paper addresses the QoS-aware service selection problem considering complex workflow patterns. More specifically, it focuses on the complexity issues of the problem. The NPNP-hardness of the problem, under various ...
  • On the complexity of various parameterizations of common induced subgraph isomorphism 
    Abu-Khzam, Faisal N.; Bonnet, Edouard; Sikora, Florian (Springer, 2017-03-16)
    Maximum Common Induced Subgraph (henceforth MCIS) is among the most studied classical NPNP -hard problems. MCIS remains NPNP -hard on many graph classes including bipartite graphs, planar graphs and k-trees. Little is ...

Search LAUR


Advanced Search

Browse

My Account