Browsing Department of Informatics by Title
Now showing items 921-927 of 927
-
A wide-range algorithm for minimal triangulation from an arbitrary ordering
(Journal article, 2006) -
Width Notions for Ordering-Related Problems
(Journal article; Peer reviewed, 2020)We are studying a weighted version of a linear extension problem, given some finite partial order ρ, called Completion of an Ordering. While this problem is NP-complete, we show that it lies in FPT when parameterized by ... -
Workflow management systems
(Master thesis, 2007-12-01)This master's thesis gives an insight to workflow technologies used to improve efficiency of business processes. Ways to use such technologies in order to help users through tasks in MIPS (Material Integrated Production ... -
WSDL Workshop. Semantic web application in HTML5 for the discovery, construction and analysis of workflows
(Master thesis, 2013-11-20)WSDL-Workshop is a HTML5 web application for the discovery and exploration of web services and for analysing the compatibility between web services. This is the result of a mathematical model developed from WSDL1.1. The ... -
WSDL Workshop: Semantic web application in HTML5 for the discovery, construction and analysis of workfows
(Master thesis, 2013)WSDL-Workshop is a HTML5 web application for the discovery and exploration of web services and for analyzing the compatibility between web services. This is the result of a mathematical model developed from WSDL1.1. The ... -
XHM: A system for detection of potential cross hybridizations in DNA microarrays
(Peer reviewed; Journal article, 2004-08-27)Background: Microarrays have emerged as the preferred platform for high throughput gene expression analysis. Cross-hybridization among genes with high sequence similarities can be a source of error reducing the reliability ... -
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
(Journal article; Peer reviewed, 2022)In this paper, we showcase the class XNLP as a natural place for many hard problems parameterized by linear width measures. This strengthens existing W[1]-hardness proofs for these problems, since XNLP-hardness implies ...