Marx Dniel

Dniel Marx

Information about the author Dniel Marx will soon be added to the site.
Found 11 papers in total
Chordal Editing is Fixed-Parameter Tractable
Chordal Editing is Fixed-Parameter Tractable
2016
Graph modification problems are typically asked as follows: is there a small set of...
A faster FPT algorithm for Bipartite Contraction
A faster FPT algorithm for Bipartite Contraction
2013
The Bipartite Contraction problem is to decide, given a graph G and a parameter k,...
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
2015
We study the problem of finding small s – t separators that induce graphs having...
Cleaning Interval Graphs
Cleaning Interval Graphs
2013
We investigate a special case of the Induced Subgraph Isomorphism problem, where both...
Parameterized Complexity of Eulerian Deletion Problems
Parameterized Complexity of Eulerian Deletion Problems
2014
We study a family of problems where the goal is to make a graph Eulerian, i.e.,...
Obtaining a Planar Graph by Vertex Deletion
Obtaining a Planar Graph by Vertex Deletion
2012
In the k ‐ Apex problem the task is to find at most k vertices whose deletion...
Stable assignment with couples: Parameterized complexity and local search
Stable assignment with couples: Parameterized complexity and local search
2011
We study the Hospitals/Residents with Couples problem, a variant of the classical...
Parameterized complexity and local search approaches for the stable marriage problem with ties
Parameterized complexity and local search approaches for the stable marriage problem with ties
2010
We consider the variant of the classical Stable Marriage problem where preference...
Searching the k-change neighborhood for TSP is W[1]-hard
Searching the k-change neighborhood for TSP is W[1]-hard
2008
We show that searching the k -change neighborhood is W[1]-hard for metric TSP, which...
Searching the k-change neighborhood for a traveling salesperson problem (TSP) is W[1]-hard
Searching the k-change neighborhood for a traveling salesperson problem (TSP) is W[1]-hard
2008
We show that searching the k -change neighborhood is W[1]-hard for metric TSP, which...
A short proof of the NP-completeness of minimum sum interval coloring
A short proof of the NP-completeness of minimum sum interval coloring
2005
In the minimum sum coloring problem we have to assign positive integers to the...
Papers per page: