Search Results - "Parameterized complexity and exact algorithms"

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern by Focke, Jacob, Hörsch, Florian, Li, Shaohua, Marx, Dániel

“…The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph G and a demand graph H on a set $$T\subseteq V(G)$$ T…”
Get full text

AWDIT: An Optimal Weak Database Isolation Tester by Møldrup, Lasse, Pavlogiannis, Andreas

“…Database isolation is a formal contract concerning the level of data consistency that a database provides to its clients. In order to achieve low latency, high…”
Get full text

Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis by Conrado, Giovanna Kobus, Goharshady, Amir Kafshdar, Kochekov, Kerim, Tsai, Yun Chen, Zaher, Ahmed Khaled

“…Algebraic Program Analysis (APA) is a ubiquitous framework that has been employed as a unifying model for various problems in data-flow analysis, termination…”
Get full text

Efficient parameterized algorithms for data packing by Chatterjee, Krishnendu, Goharshady, Amir Kafshdar, Okati, Nastaran, Pavlogiannis, Andreas

“…There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in…”
Get full text

Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms by Cattanéo, David, Perdrix, Simon

“…The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which…”
Get full text

Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard) by Marx, Dániel, Sankar, Govind S., Schepper, Philipp

“…In the general AntiFactor problem, a graph G and, for every vertex v of G , a set X v ⊆ N of forbidden degrees is given. The task is to find a set S of edges…”
Get full text

Computing Generalized Convolutions Faster Than Brute Force by Esmer, Barış Can, Kulik, Ariel, Marx, Dániel, Schepper, Philipp, Węgrzycki, Karol

“…In this paper, we consider a general notion of convolution. Let D be a finite domain and let D n be the set of n -length vectors (tuples) of D . Let f : D × D…”
Get full text

Multivariate Analysis of Orthogonal Range Searching and Graph Distances by Bringmann, Karl, Husfeldt, Thore, Magnusson, Måns

“…We show that the eccentricities, diameter, radius, and Wiener index of an undirected n -vertex graph with nonnegative edge lengths can be computed in time O (…”
Get full text