Search Results - "Knop, Dušan"

Local linear set on graphs with bounded twin cover number by Knop, Dušan

“…•We study two local linear problems – Local Linear Set and Local Linear Vertex Cover – parameterized by twin cover number.•The Local Linear Vertex Cover…”
Get full text

Combinatorial n-fold integer programming and applications by Knop, Dušan, Koutecký, Martin, Mnich, Matthias

“…Many fundamental NP -hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential…”
Get full text

Scheduling meets n-fold integer programming by Knop, Dušan, Koutecký, Martin

“…Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little…”
Get full text

Multivariate algorithmics for eliminating envy by donating goods by Boehmer, Niclas, Bredereck, Robert, Heeger, Klaus, Knop, Dušan, Luo, Junjie

“…Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been…”
Get full text

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters by Bredereck, Robert, Heeger, Klaus, Knop, Dušan, Niedermeier, Rolf

“…We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby…”
Get full text

Fine-grained view on bribery for group identification by Boehmer, Niclas, Bredereck, Robert, Knop, Dušan, Luo, Junjie

“…Given a set of agents qualifying or disqualifying each other, group identification is the task of identifying a socially qualified subgroup of agents. Social…”
Get full text

The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints by Dvořák, Pavel, Eiben, Eduard, Ganian, Robert, Knop, Dušan, Ordyniak, Sebastian

“…Integer Linear Programming (ILP) has a broad range of applications in various areas of artificial intelligence. Yet in spite of recent advances, we still lack…”
Get full text

Length-bounded cuts: Proper interval graphs and structural parameters by Bentert, Matthias, Heeger, Klaus, Knop, Dušan

“…We study the Length-Bounded Cut problem for special graph classes and from a parameterized complexity viewpoint. Here, we are given a graph G, two vertices s…”
Get full text

High-multiplicity N-fold IP via configuration LP by Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

“…N -fold integer programs (IPs) form an important class of block-structured IPs for which increasingly fast algorithms have recently been developed and…”
Get full text

Parameterized Complexity of Length-bounded Cuts and Multicuts by Dvořák, Pavel, Knop, Dušan

“…We study the Minimum Length-Bounded Cut problem where the task is to find a set of edges of a graph such that after removal of this set, the shortest path…”
Get full text

Hedonic diversity games: A complexity picture with more than two colors by Ganian, Robert, Hamm, Thekla, Knop, Dušan, Schierreich, Šimon, Suchý, Ondřej

“…Hedonic diversity games are a variant of the classical hedonic games designed to better model a variety of questions concerning diversity and fairness…”
Get full text

Graph isomorphism restricted by lists by Klavík, Pavel, Knop, Dušan, Zeman, Peter

“…The complexity of graph isomorphism (GraphIso ) is a famous problem in computer science. For graphs G and H, it asks whether they are the same up to a…”
Get full text

Integer programming in parameterized complexity: Five miniatures by Gavenčiak, Tomáš, Koutecký, Martin, Knop, Dušan

“…Powerful results from the theory of integer programming have recently led to substantial advances in parameterized complexity. However, our perception is that,…”
Get full text

Parameterized complexity of configuration integer programs by Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

“…Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems. First, we develop fast exact…”
Get full text

On the Complexity of Target Set Selection in Simple Geometric Networks by Dvořák, Michal, Knop, Dušan, Schierreich, Šimon

“…Discrete Mathematics & Theoretical Computer Science, vol. 26:2, Discrete Algorithms (August 21, 2024) dmtcs:11591 We study the following model of disease…”
Get full text

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity by Dušan Knop, Martin Koutecký, Tomáš Masařík, Tomáš Toufar

“…This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs:…”
Get full text

Polynomial kernels for tracking shortest paths by Blažej, Václav, Choudhary, Pratibha, Knop, Dušan, Křišťan, Jan Matyáš, Suchý, Ondřej, Valla, Tomáš

“…Given an undirected graph G=(V,E), vertices s,t∈V, and an integer k, Tracking Shortest Paths requires deciding whether there exists a set of k vertices T⊆V…”
Get full text

IV-matching is strongly NP-hard by Folwarczný, Lukáš, Knop, Dušan

“…IV-matching is a generalization of perfect bipartite matching. The complexity of finding IV-matching in a graph was posted as an open problem in [Fiala,…”
Get full text

Maximizing Social Welfare in Score-Based Social Distance Games by Ganian, Robert, Hamm, Thekla, Knop, Dušan, Roy, Sanjukta, Schierreich, Šimon, Suchý, Ondřej

Get full text

Constant factor approximation for tracking paths and fault tolerant feedback vertex set by Blažej, Václav, Choudhary, Pratibha, Knop, Dušan, Křišťan, Jan Matyáš, Suchý, Ondřej, Valla, Tomáš

“…Consider a vertex-weighted graph G with a source s and a target t. Tracking Paths requires finding a minimum weight set of vertices (trackers) such that the…”
Get full text