Search Results for author:
Found 5 papers, 0 papers with code
Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning
Using this technique we obtain a major improvement of $O^*((\frac{cn}{\log{n}})^{n})$ for Allen's interval algebra.
A Fast Algorithm for Consistency Checking Partially Ordered Time
Partially ordered models of time occur naturally in applications where agents or processes cannot perfectly communicate with each other, and can be traced back to the seminal work of Lamport.
Computational Short Cuts in Infinite Domain Constraint Satisfaction
We show that this kind of infinite-domain backdoors have many of the positive computational properties that finite-domain backdoors have: the associated computational problems are fixed-parameter tractable whenever the underlying constraint language is finite.
A Multivariate Complexity Analysis of Qualitative Reasoning Problems
Qualitative reasoning is an important subfield of artificial intelligence where one describes relationships with qualitative, rather than numerical, relations.
Component twin-width as a parameter for BINARY-CSP and its semiring generalisations
We illustrate the advantages of this framework by instantiating our general algorithmic approach on several classes of problems (e. g., the $H$-coloring problem and its variants), and showing that it improves the best complexity upper bounds in the literature for several well-known problems.
