home	education	contact	library	calendar	search
	about us	research	people	archive	services	jobs

publications by Dipl Inf T. Wolle

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

Dipl Inf T. Wolle

• contact information
• my technical reports
• former member of group algorithmic systems

some publications

Buchin, K.A., Cabello, S., Gudmundsson, J., Loeffler, M., Luo, J., Rote, G., Silveira, R., Speckmann, B. & Wolle, T. (2009). Detecting Hotspots in Geographic Networks. In M. Sester, L. Bernard & V. Paelke (Eds.), Advances in GIScience, Proc.\ 12th AGILE International Conference on Geographic Information Science (pp. 217-231). Springer.

Buchin, K.A., Cabello, S., Gudmundsson, J., L\"offler, M., Luo, J., Rote, G., Silveira, R., Speckmann, B. & Wolle, T. (2009). Detecting Hotspots in Geographic Networks. In M. Sester, L. Bernard & V. Paelke (Eds.), Advances in GIScience, Proc.\ 12th AGILE International Conference on Geographic Information Science (pp. 217-231). Springer.

Bodlaender, H.L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R. & Wolle, T. (2009). On the minimum corridor connection problem and other generalized geometric problems. Computational geometry, 42(9), 939-951.

Bodlaender, H.L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R. & Wolle, T. (2007). On the minimum corridor connection problem and other generalized geometric problems. CS-UU 2007-031. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Koster, A.M.C.A. & Wolle, T. (2006). Contraction and treewidth lower bounds. Journal of Graph Algorithms and Applications, 10, 5-49.

Bodlaender, H.L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R. & Wolle, T. (2006). On the minimum corridor connection problem and other generalized geometric problems. In T. Erleback & C. Kaklamanis (Eds.), Proceedings 4th International Workshop on Approximation and Online Algorithms Vol. 4368. Lecture Notes in Computer Science (pp. 69-82). Springer.

Wolle, T. (2005, June 13). Computational aspects of Treewidth, lower bounds and networks reliability. UU Universiteit Utrecht (158 pag.) ( Ridderprint offsetdrukkerij B.V.). Prom./coprom.: prof. dr. J. van Leeuwen & dr. H.L. Bodlaender.

Koster, A.M.C.A., Wolle, T. & Bodlaender, H.L. (2005). Degree-based treewidth lower bounds. In Sotiris.E. Nikoletseas (Ed.), Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms WEA 2005 (pp. 101-112). Springer-Verlag, Lecture Notes in Computer Science 3503.

Wolle, T., Koster, A.M.C.A. & Bodlaender, H.L. (2004). A Note on Contraction Degeneracy. UU-CS 2004-042. Utrecht: Utrecht University: Information and Computing Sciences.

Wolle, T. & Bodlaender, H.L. (2004). A Note on Edge Contraction. UU-CS 2004-028. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Wolle, T. (2004). A Note on the Complexity of Network Reliability Problems. UU-CS 2004-001. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Wolle, T. (2004). Contraction Degeneracy on Cographs. UU-CS 2004-031. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Koster, A.M.C.A. & Wolle, T. (2004). Contraction and Treewidth Lower Bounds. UU-CS 2004-034. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Koster, A.M.C.A. & Wolle, T. (2004). Contraction and treewidth lower bounds. In S. Albers & T. Radzik (Eds.), Proceedings 12th Annual European Symposium on Algorithms, ESA2004 (pp. 628-639). Springer-Verlag.

Koster, A.M.C.A., Wolle, T. & Bodlaender, H.L. (2004). Degree-Based Treewidth Lower Bounds. UU-CS 2004-050. Utrecht: Utrecht University: Information and Computing Sciences.

Koster, A.M.C.A., Wolle, T. & Bodlaender, H.L. (2004). Degree-based treewidth lower bounds. Berlin, Germany: Konrad-Zuse-Zentrum für Informationstechnik Berlin.

Wolle, T. (2003). A Framework for Network Reliability Problems on Graphs of Bounded Treewidth. UU-CS 2003-026. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Wolle, T. (2003). A Note on the Complexity of Network Reliability Problems. UU-CS 2004-001. Utrecht: Utrecht University: Information and Computing Sciences.

Wolle, T. (2002). A Framework for Network reliability Problems on Graphs of Bounded Treewidth. In P. Bose & P. Morin (Eds.), Algorithms and Computation (ISAAC 2002) (pp. 137-149). Berlin, Germany: Springer-Verlag.