Search Results - "Marx, Daniel"

Chordal Editing is Fixed-Parameter Tractable by Cao, Yixin, Marx, Dániel

“…Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property. The most commonly considered…”
Get full text

The Parameterized Hardness of the k-Center Problem in Transportation Networks by Feldmann, Andreas Emil, Marx, Dániel

“…In this paper we study the hardness of the k - Center problem on inputs that model transportation networks. For the problem, a graph G = ( V , E ) with edge…”
Get full text

Size Bounds and Query Plans for Relational Joins by Atserias, Albert, Grohe, Martin, Marx, Dániel

“…Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive…”
Get full text

Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset by Marx, Dániel, Razgon, Igor

“…Given an undirected graph $G$, a collection $\{(s_1,t_1), \dots, (s_{k},t_{k})\}$ of pairs of vertices, and an integer ${{p}}$, the Edge Multicut problem asks…”
Get full text

Chordal Deletion is Fixed-Parameter Tractable by Marx, Dániel

“…It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a…”
Get full text

Incompressibility of H-free edge modification problems: Towards a dichotomy by Marx, Dániel, Sandeep, R.B.

“…Given a graph G and an integer k, the H-free Edge Editing problem is to find whether there exist at most k pairs of vertices in G such that changing the…”
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

Signatures of hierarchical temporal processing in the mouse visual system by Rudelt, Lucas, González Marx, Daniel, Spitzner, F. Paul, Cramer, Benjamin, Zierenberg, Johannes, Priesemann, Viola

“…A core challenge for the brain is to process information across various timescales. This could be achieved by a hierarchical organization of temporal…”
Get full text

Embedding optimization reveals long-lasting history dependence in neural spiking activity by Rudelt, Lucas, González Marx, Daniel, Wibral, Michael, Priesemann, Viola

“…Information processing can leave distinct footprints on the statistics of neural spiking. For example, efficient coding minimizes the statistical dependencies…”
Get full text

A parameterized view on matroid optimization problems by Marx, Dániel

“…Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However,…”
Get full text

Social Decision Making in Autistic Adolescents: The Role of Theory of Mind, Executive Functioning and Emotion Regulation by Woodcock, Kate Anne, Cheung, Catherine, González Marx, Daniel, Mandy, Will

“…Social decision making is often challenging for autistic individuals. Twenty autistic adolescents made decisions in the socially interactive context of a…”
Get full text

Bin packing with fixed number of bins revisited by Jansen, Klaus, Kratsch, Stefan, Marx, Dániel, Schlotter, Ildikó

“…As Bin Packing is NP-hard already for k=2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if…”
Get full text

Completely inapproximable monotone and antimonotone parameterized problems by Marx, Dániel

“…We prove that weighted circuit satisfiability for monotone or antimonotone circuits has no fixed-parameter tractable approximation algorithm with any…”
Get full text

List H-Coloring a Graph by Removing Few Vertices by Chitnis, Rajesh, Egri, László, Marx, Dániel

“…In the deletion version of the list homomorphism problem, we are given graphs G and H , a list L ( v ) ⊆ V ( H ) for each vertex v ∈ V ( G ) , and an integer k…”
Get full text

Finding and Counting Permutations via CSPs by Berendsohn, Benjamin Aram, Kozma, László, Marx, Dániel

“…Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of…”
Get full text

Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset by Chitnis, Rajesh, Hajiaghayi, MohammadTaghi, Marx, Dániel

“…Given a directed graph $G$, a set of $k$ terminals, and an integer $p$, the Directed Vertex Multiway Cut problem asks whether there is a set $S$ of at most $p$…”
Get full text

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

Domination and Cut Problems on Chordal Graphs with Bounded Leafage by Galby, Esther, Marx, Dániel, Schepper, Philipp, Sharma, Roohani, Tale, Prafullkumar

“…The leafage of a chordal graph G is the minimum integer ℓ such that G can be realized as an intersection graph of subtrees of a tree with ℓ leaves. We consider…”
Get full text

Parameterized complexity of multicut in weighted trees by Galby, Esther, Marx, Dániel, Schepper, Philipp, Sharma, Roohani, Tale, Prafullkumar

“…In the Multicut problem, given an undirected graph G, a set of pairs of vertices P, and a budget k, the goal is to determine if there is a set S of at most k…”
Get full text

Obtaining a Planar Graph by Vertex Deletion by Marx, Dániel, Schlotter, Ildikó

“…In the  k - Apex problem the task is to find at most  k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form…”
Get full text