Schlotter Ildik

Ildik Schlotter

Information about the author Ildik Schlotter will soon be added to the site.
Found 5 papers in total
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...
Papers per page: