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

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

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

“… In order to test databases on realistic workloads of large size, isolation testers must be as efficient as possible, a requirement that has initiated a study of the complexity of isolation testing…”
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

On the Parameterized Complexity of Layered Graph Drawing: Parameterized and Exact Algorithms by DUJMOVIC, Vida, FELLOWS, Michael R, KITCHING, Matthew, LIOTTA, Giuseppe, MCCARTIN, Catherine, NISHIMURA, Naomi, RAGDE, Prabhakar, ROSAMOND, Frances, WHITESIDES, Sue, WOOD, David R

Get full text

Improved Algorithms and Complexity Results for Power Domination in Graphs: Parameterized and Exact Algorithms by JIONG GUO, NIEDERMEIER, Rolf, RAIBLE, Daniel

Get full text

Fixed-Parameter Complexity of Minimum Profile Problems: Parameterized and Exact Algorithms by GUTIN, Gregory, SZEIDER, Stefan, YEO, Anders

Get full text

Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation by Paul, Christophe, Pilipczuk, Michał

“…) held in Helsinki, Finland. IPEC (formerly IWPEC) is a series of international symposia covering research in all aspects of parameterized and exact algorithms and complexity…”
Get full text

Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas by Subramani, K., Wojciechowski, Piotr

“…In this paper, we discuss algorithms for the problem of finding read-once resolution refutations of unsatisfiable 2CNF formulas within the resolution refutation system…”
Get full text

New Algorithms for Mixed Dominating Set by Dublois, Louis, Lampis, Michael, Paschos, Vangelis Th

“… We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set…”
Get full text

New Algorithms for Mixed Dominating Set by Dublois, Louis, Lampis, Michael, Paschos, Vangelis Th

“… We study the complexity of exact and parameterized algorithms for Mixed Dominating Set, resolving some open questions…”
Get full text

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time by Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, Joham M. M., Wojtaszczyk, J. O.

“…), standard dynamic programming techniques give c tw |V| O(1) time algorithms, where tw is the tree width of the input graph G = (V, E…”
Get full text

Exact and parameterized algorithms for choosability by Bliznets, Ivan, Nederlof, Jesper

“… The main objective of our paper is to construct the first non-trivial exact exponential algorithms for the C hoosability problem, and complete the picture with parameterized…”
Get full text

Parameterized Complexity of Graph Burning by Kobayashi, Yasuaki, Otachi, Yota

“… We study the parameterized complexity of this problem and answer all questions by Kare and Reddy…”
Get full text

Parameterized Complexity of (A,ℓ)-Path Packing by Belmonte, Rémy, Hanaka, Tesshu, Kanzaki, Masaaki, Kiyomi, Masashi, Kobayashi, Yasuaki, Kobayashi, Yusuke, Lampis, Michael, Ono, Hirotaka, Otachi, Yota

“… that have endpoints in A and internal points in V \ A . We study the parameterized complexity of this problem with parameters | A |, ℓ…”
Get full text

Waring Rank, Parameterized and Exact Algorithms by Pratt, Kevin

“…We show that the Waring rank (symmetric tensor rank) of a certain family of polynomials has intimate connections to the areas of parameterized and exact…”
Get full text

On the parameterized complexity of multiple-interval graph problems by Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane

“… In this sequel, we study multiple-interval graph problems from the perspective of parameterized complexity…”
Get full text

Parameterized Complexity of Independent Set in H-Free Graphs by Bonnet, Édouard, Bousquet, Nicolas, Charbit, Pierre, Thomassé, Stéphan, Watrigant, Rémi

“…In this paper, we investigate the complexity of Maximum Independent Set ( MIS ) in the class of H -free graphs, that is, graphs excluding a fixed graph as an induced subgraph…”
Get full text

Parameterized Complexity of Directed Spanner Problems by Fomin, Fedor V., Golovach, Petr A., Lochet, William, Misra, Pranabendu, Saurabh, Saket, Sharma, Roohani

“…We initiate the parameterized complexity study of minimum t -spanner problems on directed graphs…”
Get full text