Výsledky vyhľadávania - "Special Issue: Parameterized and Exact Computation"

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

“…Graph Burning asks, given a graph G = ( V , E ) and an integer k , whether there exists ( b 0 , ⋯ , b k - 1 ) ∈ V k such that every vertex in G has distance at…”
Získať plný text

New Tools and Connections for Exponential-Time Approximation Autor Bansal, Nikhil, Chalermsook, Parinya, Laekhanukit, Bundit, Nanongkai, Danupon, Nederlof, Jesper

“…In this paper, we develop new tools and connections for exponential time approximation . In this setting, we are given a problem instance and an integer r > 1…”
Získať plný text

How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? Autor Bougeret, Marin, Sau, Ignasi

“…In the last years, kernelization with structural parameters has been an active area of research within the field of parameterized complexity. As a relevant…”
Získať plný text

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan Autor Nederlof, Jesper, Swennenhuis, Céline M. F.

“…We study a natural variant of scheduling that we call partial scheduling : in this variant an instance of a scheduling problem along with an integer  k is…”
Získať plný text

Structural Parameterizations with Modulator Oblivion Autor Jacob, Ashwin, Panolan, Fahad, Raman, Venkatesh, Sahlot, Vibha

“…It is known that problems like Vertex Cover , Feedback Vertex Set and Odd Cycle Transversal are polynomial time solvable in the class of chordal graphs. We…”
Získať plný text

Vertex Deletion into Bipartite Permutation Graphs Autor Bożyk, Łukasz, Derbisz, Jan, Krawczyk, Tomasz, Novotná, Jana, Okrasa, Karolina

“…A permutation graph can be defined as an intersection graph of segments whose endpoints lie on two parallel lines ℓ 1 and ℓ 2 , one on each. A bipartite…”
Získať plný text

Parameterized Complexity of Directed Spanner Problems Autor 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. For a positive integer t , a multiplicative t -spanner of a…”
Získať plný text

Component Order Connectivity in Directed Graphs Autor Bang-Jensen, Jørgen, Eiben, Eduard, Gutin, Gregory, Wahlström, Magnus, Yeo, Anders

“…A directed graph D is semicomplete if for every pair x ,  y of vertices of D ,  there is at least one arc between x and y . Thus, a tournament is a…”
Získať plný text

Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials Autor Jansen, Bart M. P., Pieterse, Astrid

“…The theory of kernelization can be used to rigorously analyze data reduction for graph coloring problems. Here, the aim is to reduce a q - Coloring input to an…”
Získať plný text

A Polynomial Kernel for Funnel Arc Deletion Set Autor Garlet Milani, Marcelo

“…In Directed Feedback Arc Set ( DFAS ) we search for a set of at most k arcs which intersect every cycle in the input digraph. It is a well-known open problem…”
Získať plný text

Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms Autor Bonnet, Édouard, Brettell, Nick, Kwon, O-joung, Marx, Dániel

“…It has long been known that Feedback Vertex Set can be solved in time 2 O ( w log w ) n O ( 1 ) on n -vertex graphs of treewidth w , but it was only recently…”
Získať plný text

Preface to the Special Issue on Parameterized and Exact Computation Autor Cao, Yixin, Pilipczuk, Marcin

Získať plný text

A Fixed-Parameter Perspective on #BIS Autor Curticapean, Radu, Dell, Holger, Fomin, Fedor, Goldberg, Leslie Ann, Lapinskas, John

“…The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the…”
Získať plný text

Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants Autor Björklund, Andreas, Kaski, Petteri, Williams, Ryan

“…We present two new data structures for computing values of an n -variate polynomial P of degree at most d over a finite field of q elements. Assuming that d…”
Získať plný text

Finding Optimal Triangulations Parameterized by Edge Clique Cover Autor Korhonen, Tuukka

“…We consider problems that can be formulated as a task of finding an optimal triangulation of a graph w.r.t. some notion of optimality. We present algorithms…”
Získať plný text

Tight Conditional Lower Bounds for Longest Common Increasing Subsequence Autor Duraj, Lech, Künnemann, Marvin, Polak, Adam

“…We consider the canonical generalization of the well-studied Longest Increasing Subsequence problem to multiple sequences, called k -LCIS: Given k integer…”
Získať plný text

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs Autor Karpov, Nikolai, Pilipczuk, Marcin, Zych-Pawlewicz, Anna

“…Given an edge-weighted graph G with a set Q of k terminals, a mimicking network is a graph with the same set of terminals that exactly preserves the size of…”
Získať plný text

Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor Autor Jansen, Bart M. P., Pilipczuk, Marcin, Wrochna, Marcin

“…The notion of Turing kernelization investigates whether a polynomial-time algorithm can solve an NP-hard problem, when it is aided by an oracle that can be…”
Získať plný text

Editor’s Note: Special Issue on Parameterized and Exact Computation

Získať plný text