96 Infos zu Ildikó Schlotter

1 Aktuelle Nachrichten

14 Wissenschaftliche Publikationen

List of computer science publications by Britta Dorn

Bibliographic content of Algorithmica, Volume 58, 2010

Bibliographic content of 34. WG 2008: Durham, UK

Bibliographic content of CoRR January 2015

8 Allgemeine Veröffentlichungen

We investigate a special case of the Induced Subgraph Isomorphismproblem, where both input graphs are interval graphs. We show the NP-hardness of this problem,...

We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of...

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 a...

We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding

48 Webfunde aus dem Netz

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.

We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of...

International Joint Conference on Artificial Intelligence, July 9–15, 2016, New York

4 posts published by thorehusfeldt during September 2010

We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a...

Magyar Tudományos Akadémia Közgazdaságtudományi Intézet

Campaign Management under Approval-Driven Voting Rules