Suchergebnisse - Parameterized complexity and exact algorithms

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern von 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 …”
Volltext

Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis von 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 …”
Volltext

Efficient parameterized algorithms for data packing von 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 …”
Volltext

AWDIT: An Optimal Weak Database Isolation Tester von 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 …”
Volltext

Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms von 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 …”
Volltext

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

Volltext

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

Volltext

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

Volltext

Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation von 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 …”
Volltext

Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas von 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 …”
Volltext

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

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

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

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

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time von 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 …”
Volltext

Exact and parameterized algorithms for choosability von 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 …”
Volltext

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

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

Parameterized Complexity of (A,ℓ)-Path Packing von 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 |, ℓ …”
Volltext

Waring Rank, Parameterized and Exact Algorithms von 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 …”
Volltext

On the parameterized complexity of multiple-interval graph problems von 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 …”
Volltext

Parameterized Complexity of Independent Set in H-Free Graphs von 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 …”
Volltext

Parameterized Complexity of Directed Spanner Problems von 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 …”
Volltext