Thomas Böhme

Herwig Unger

Proceedings of the 3rd International Conference on Communication and Information Processing, 2017

2014

PDSearch: Using Pictures as Queries.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Information and Communication Technology, 2014

2013

Bounds for the Security of the Vivaldi Network Coordinate System.

[BibT_eX]

[DOI]

Proceedings of the 2013 Conference on Networked Systems, 2013

2012

A Note on Semi-steady States in Stochastic Cellular Automata.

[BibT_eX]

[DOI]

Jens Schreyer

Erika Skrabul'áková

Proceedings of the Autonomous Systems: Developments and Trends, 2012

2011

Minors in Graphs with High Chromatic Number.

[BibT_eX]

[DOI]

Andrew Thomason

Comb. Probab. Comput., 2011

Local Computation of Vertex Colorings.

[BibT_eX]

[DOI]

Jens Schreyer

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

Hadwiger numbers and over-dominating colourings.

[BibT_eX]

[DOI]

Andrew Thomason

Discret. Math., 2010

2009

Linear connectivity forces large complete bipartite minors.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

John Maharry

J. Comb. Theory B, 2009

Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

John Maharry

J. Comb. Theory B, 2009

Learning of winning strategies for terminal games with linear-size memory.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2009

Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density.

[BibT_eX]

[DOI]

Discret. Math., 2009

A Game Theoretic Approach to Graph Probleras.

[BibT_eX]

[DOI]

Jens Schreyer

Proceedings of the 9th International Conference on Innovative Coummunity Systems, 2009

2008

Ordered and linked chordal graphs.

[BibT_eX]

[DOI]

Tobias Gerlach

Michael Stiebitz

Discuss. Math. Graph Theory, 2008

2006

Linkability in iterated line graphs.

[BibT_eX]

[DOI]

Martin Knor

Ludovít Niepel

Discret. Math., 2006

2005

Disjoint Kr-minors in large graphs with given average degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

Evaluating profiling and query expansion methods for P2P information retrieval.

[BibT_eX]

[DOI]

Hans Friedrich Witschel

Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks, 2005

2004

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

2003

Domination, Packing and Excluded Minors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

2002

Long Cycles in Graphs on a Fixed Surface.

[BibT_eX]

[DOI]

Carsten Thomassen

J. Comb. Theory B, 2002

Ka, k Minors in Graphs of Bounded Tree-Width.

[BibT_eX]

[DOI]

John Maharry

J. Comb. Theory B, 2002

Labeled K2, t Minors in Plane Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

2001

Menger's Theorem.

[BibT_eX]

[DOI]

Frank Göring

J. Graph Theory, 2001

1999

Dirac's map-color theorem for choosability.

[BibT_eX]

[DOI]

Michael Stiebitz

J. Graph Theory, 1999

More than one tough chordal planar graphs are Hamiltonian.

[BibT_eX]

[DOI]

Michal Tkác

J. Graph Theory, 1999

On certain Hamiltonian cycles in planar graphs.

[BibT_eX]

[DOI]

Michal Tkác

J. Graph Theory, 1999

1998

A planarity criterion for cubic bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

On Hamiltonian cycles in 4- and 5-connected plane triangulations.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

Spanning trees with pairwise nonadjacent endvertices.

[BibT_eX]

[DOI]

Hajo Broersma

F. Göbel

Michael Stiebitz

Discret. Math., 1997

1996

Toughness and longest cycles in 2-connected planar graphs.

[BibT_eX]

[DOI]

Haitze J. Broersma

Henk Jan Veldman

J. Graph Theory, 1996

1993

Aspects of the Automatic Generation of Parallel Programs.

[BibT_eX]