Thomas Schickinger

According to our database, Thomas Schickinger authored at least 8 papers between 1999 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

<i>K</i> ₄-free subgraphs of random graphs revisited.

Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz

Comb., 2007

2006

A new average case analysis for completion time scheduling.

Mark Scharbrodt, Thomas Schickinger, Angelika Steger

J. ACM, 2006

2004

K₅-free subgraphs of random graphs.

Stefanie Gerke, Thomas Schickinger, Angelika Steger

Random Struct. Algorithms, 2004

2002

Complete subgraphs of random graphs.

Thomas Schickinger

PhD thesis, 2002

A note on triangle-free and bipartite graphs.

Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger

Discret. Math., 2002

2001

On the structure of clique-free graphs.

Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger

Random Struct. Algorithms, 2001

2000

Simplified Witness Tree Arguments.

Thomas Schickinger, Angelika Steger

Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

1999

Load Balancing Using Bisectors - A Tight Average-Case Analysis.

Stefan Bischof, Thomas Schickinger, Angelika Steger

Proceedings of the Algorithms, 1999