Ildikó Schlotter Person-Info

( Ich bin Ildikó Schlotter)



	Dániel Marx Britta Dorn Parameterized Complexity Algorithmica Fleiner Obtaining Multivariate Computer Science Conference

News

Wissenschaftliche Veröffentlichungen

(1 - 4 von 14

–alle anzeigen

)

dblp: Britta Dorn

dblp.uni-trier.de

List of computer science publications by Britta Dorn

dblp: Algorithmica, Volume 58, 2010

dblp.uni-trier.de

Bibliographic content of Algorithmica, Volume 58, 2010

dblp: 34. WG 2008: Durham, UK

dblp.uni-trier.de

Bibliographic content of 34. WG 2008: Durham, UK

dblp: CoRR January 2015

dblp.org

Bibliographic content of CoRR January 2015

Veröffentlichungen allgemein

(1 - 4 von 8

–alle anzeigen

)

Cleaning Interval Graphs | SpringerLink

link.springer.com

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

Parameterized Complexity of Eulerian Deletion Problems.

www.biomedsearch.com

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

Obtaining a Planar Graph by Vertex Deletion : Dániel Marx : Free...

archive.org

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

Parameterized Complexity and Local Search Approaches for the Stable...

link.springer.com

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

Sonstiges

(1 - 7 von 48

–alle anzeigen

)

Bin Packing with Fixed Number of Bins Revisited |...

www.springerprofessional.de

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.

Parameterized Complexity of Eulerian Deletion Problems - Semantic...

www.semanticscholar.org

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

IJCAI-16

ijcai-16.org

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

September | | Thore Husfeldt

thorehusfeldt.com

4 posts published by thorehusfeldt during September 2010

Parameterized Complexity and Local Search Approaches for the Stable...

www.semanticscholar.org

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

econ.core.hu

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

Schlotter

www.aaai.org

Campaign Management under Approval-Driven Voting Rules

Verwandte Suchanfragen zu Ildikó Schlotter

Stefan Kratsch
Klaus Jansen
Dániel Marx

Personen
Vorname "Ildikó" (203)
Name "Schlotter" (410)

sortiert nach Relevanz / Datum

Erweiterte Suche

Dossier exportieren

Person-Suchen: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Impressum AGB Datenschutz

+1

Weltweit