Talks by Martin Kutz
Haven't we met at ...?
This is a (somewhat incomplete) list of talks I have given
at conferences and during research visits.
-
A Decomposition-Conjecture on Weak Positional Games on Hypergraphs.
DMV-Tagung,
Bonn, Germany, September 2006.
-
Computing Geometric Minimum-Dilation Graphs is NP-hard.
GD 2006,
Karlsruhe, Germany, September 2006.
[slides]
-
Faster Algorithms for Computing Longest Commmon Increasing Subsequences.
CPM 2006,
Barcelona, Spain, July 2006.
[slides]
-
Computing Shortest Non-Trivial Cycles
on Orientable Surfaces of Bounded Genus in Almost Linear Time.
Bell Labs, New Jersey, USA, June 2006.
-
Computing Shortest Non-Trivial Cycles
on Orientable Surfaces of Bounded Genus in Almost Linear Time.
SoCG 2006,
Sedona, Arizona, USA, June 2006.
[slides]
-
The Density of Iterated Crossing Points and
a Gap Result for Triangulations of Finite Point Sets.
SoCG 2006,
Sedona, Arizona, USA, June 2006.
[slides]
-
Die Berechnung kürzester nicht-trivialer Kreise auf kombinatorischen Flächen.
Mathematisches Kolloquium, Universität Rostock, Germany, March 2006.
-
Weak Positional Games on Hypergraphs of Rank Three.
EuroComb 2005, Berlin, Germany, September 2005.
[slides]
-
Angel, Devil, and King.
COCOON 2005, Kunming, China, August 2005.
[slides]
-
Reachability Substitutes.
BRICS, University of Aarhus, Denmark, June 2005.
[slides]
-
Reachability Substitutes.
Free University Berlin, Computer Science Department, Germany, June 2005.
[slides]
-
Reachability Substitutes.
Dagstuhl Seminar on Graph Drawing, Dagstuhl, Germany, May 2005.
[slides]
-
Conway's Angel in Three Dimensions.
KAM, Charles University, Prague, Czech Republic, Februaray 2004.
-
Angels with Broken Wings.
Kolloquium über Kombinatorik, Universität Magdeburg, Germany, November 2003.
-
Fast Smallest-Enclosing-Ball Computation in High Dimensions.
ESA 2003,
Budapest, Hungary, September 2003.
[slides]
-
The Complexity of Boolean Matrix Root Computation.
COCOON 2003,
Big Sky, Montana, USA, July 2003.
-
News from Angel and Devil.
ETH Zurich, Computer Science Department, Switzerland, November 2002.
-
Pure Dominance Constraints.
STACS 2002,
Antibes - Juan les Pins, France, March 2002.