Thomas Wolle (homepage)

Thomas Wolle

Welcome to my homepage!

Contact

email:	before the @ write: "thomas.wolle" after the @ write: "nicta.com.au" or "gmail.com"
fon:	+61 2 8306 0757	fax:	+61 2 8306 0771
postal:	Locked Bag 9013 Alexandria NSW 1435 Australia	office:	Level 5 West (Building J12) School of Information Technologies 1 Cleveland Street The University of Sydney NSW 2006 Australia
web:	http://thomaswolle.net

Research Activities

Researcher in the HPI project at NICTA in Sydney.
Research areas: algorithm design and analysis, computational geometry, graph theory, algorithm engineering,
Co-lecturing COMP 5045 (Computational Geometry) at the University of Sydney (School of IT) 2010
Co-supervising summer scholar students: David, Merlin, Sidong

Publications

(including: all technical reports, conference versions, journal versions, theses, book chapters)

The copyright of some of the articles was transfered to publishers that published the original version of the articles.
(such as: Elsevier (GCTA), Springer-Verlag (LNCS, GeoInformatica), ...)
In such a case, the linked pdf-files are preprints or postprints.
This list of articles has been created with JabRaf and Mark Schenk's export filter.

Benkert, M., Djordjevic, B., Gudmundsson, J. & Wolle, T. (), "Finding Popular Places" , International Journal of Computational Geometry and Applications (IJCGA).

[BibTeX] [PDF]

BibTeX:

@article{Benkert2008a,
  author = {M. Benkert and B. Djordjevic and J. Gudmundsson and T. Wolle},
  title = {Finding Popular Places},
  journal = {International Journal of Computational Geometry and Applications (IJCGA)},
  note = {(to appear)}
}

Djordjevic, B., Gudmundsson, J., Pham, A. & Wolle, T. (), "Detecting Regular Visit Patterns" , Algorithmica. , In Proceedings of the 16th European Symposium on Algorithms (ESA 2008). Berlin Heidelberg Springer-Verlag.

[BibTeX] [PDF]

BibTeX:

@article{Djordjevic,
  author = {B. Djordjevic and J. Gudmundsson and A. Pham and T. Wolle},
  title = {Detecting Regular Visit Patterns},
  booktitle = {Proceedings of the 16th European Symposium on Algorithms (ESA 2008)},
  journal = {Algorithmica},
  publisher = {Springer-Verlag},
  note = {(to appear)}
}

Dujmovic, V., Gudmundsson, J., Morin, P. & Wolle, T. (2010), "Notes on Large Angle Crossing Graphs", In Theory of Computing 2010. Australian Computer Society.

[BibTeX] [URL]

BibTeX:

@inproceedings{Dujmovic2010,
  author = {Vida Dujmovic and Joachim Gudmundsson and Pat Morin and Thomas Wolle},
  title = {Notes on Large Angle Crossing Graphs},
  booktitle = {Theory of Computing 2010},
  publisher = {Australian Computer Society},
  year = {2010},
  note = {(to appear)},
  url = {http://arxiv.org/abs/0908.3545}
}

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 -- Theory and Applications. , November, 2009. Vol. 42 (9) , pp. 939-951.

[BibTeX] [DOI] [PDF]

BibTeX:

@article{Bodlaender2009,
  author = {Hans L. Bodlaender and Corinne Feremans and Alexander Grigoriev and Eelko Penninkx and René Sitters and Thomas Wolle},
  title = {On the minimum corridor connection problem and other generalized geometric problems},
  journal = {Computational Geometry -- Theory and Applications},
  year = {2009},
  volume = {42},
  number = {9},
  pages = {939--951},
  doi = {http://dx.doi.org/10.1016/j.comgeo.2009.05.001}
}

Buchin, K., Cabello, S., Gudmundsson, J., Löffler, M., Luo, J., Rote, Gü., I.Silveira, R., Speckmann, B. & Wolle, T. (2009), "Detecting Hotspots in Geographic Networks", In Advances in GIScience, Proceedings of the 12th AGILE Conference., pp. 217-231. Springer Berlin Heidelberg.

[BibTeX] [DOI] [PDF]

BibTeX:

@inproceedings{Buchin2009,
  author = {Kevin Buchin and Sergio Cabello and Joachim Gudmundsson and Maarten Löffler and Jun Luo and Günther Rote and Rodrigo I.Silveira and Bettina Speckmann and Thomas Wolle},
  title = {Detecting Hotspots in Geographic Networks},
  booktitle = {Advances in GIScience, Proceedings of the 12th AGILE Conference},
  publisher = {Springer Berlin Heidelberg},
  year = {2009},
  pages = {217--231},
  doi = {http://dx.doi.org/10.1007/978-3-642-00318-9_11}
}

Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C. & Wolle, T. (2009), "Compressing Spatio-Temporal Trajectories" , Computational Geometry -- Theory and Applications. , November, 2009. Vol. 42 (9) , pp. 825-841.

[BibTeX] [DOI] [PDF]

BibTeX:

@article{Gudmundsson2009,
  author = {Joachim Gudmundsson and Jyrki Katajainen and Damian Merrick and Cahya Ong and Thomas Wolle},
  title = {Compressing Spatio-Temporal Trajectories},
  journal = {Computational Geometry -- Theory and Applications},
  year = {2009},
  volume = {42},
  number = {9},
  pages = {825--841},
  doi = {http://dx.doi.org/10.1016/j.comgeo.2009.02.002}
}

Knauer, C., Löffler, M., Scherfenberg, M. & Wolle, T. (2009), "The directed Hausdorff distance between imprecise point sets", In Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009).(5878) Springer-Verlag.

[BibTeX] [PDF]

BibTeX:

@inproceedings{Knauer2009,
  author = {Christian Knauer and Maarten Löffler and Marc Scherfenberg and Thomas Wolle},
  title = {The directed Hausdorff distance between imprecise point sets},
  booktitle = {Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009)},
  publisher = {Springer-Verlag},
  year = {2009},
  number = {5878},
  note = {(to appear)}
}

Andersson, M., Gudmundsson, J., Laube, P. & Wolle, T. (2008), "Reporting Leaders and Followers Among Trajectories of Moving Point Objects" , GeoInformatica. , December, 2008. Vol. 12 (4) , pp. 497-528.

[BibTeX] [DOI] [PDF]

BibTeX:

@article{Andersson2008,
  author = {M. Andersson and J. Gudmundsson and P. Laube and T. Wolle},
  title = {Reporting Leaders and Followers Among Trajectories of Moving Point Objects},
  journal = {GeoInformatica},
  year = {2008},
  volume = {12},
  number = {4},
  pages = {497--528},
  doi = {http://dx.doi.org/10.1007/s10707-007-0037-9}
}

Benkert, M., Gudmundsson, J., Hübner, F. & Wolle, T. (2008), "Reporting Flock Patterns" , Computational Geometry -- Theory and Applications. , November, 2008. Vol. 41 (3) , pp. 111-125.

[BibTeX] [DOI] [PDF]

BibTeX:

@article{Benkert2008,
  author = {M. Benkert and J. Gudmundsson and F. Hübner and T. Wolle},
  title = {Reporting Flock Patterns},
  journal = {Computational Geometry -- Theory and Applications},
  year = {2008},
  volume = {41},
  number = {3},
  pages = {111--125},
  doi = {http://dx.doi.org/10.1016/j.comgeo.2007.10.003}
}

Djordjevic, B., Gudmundsson, J., Pham, A. & Wolle, T. (2008), "Detecting Regular Visit Patterns", In Proceedings of the 16th European Symposium on Algorithms (ESA 2008). Berlin Heidelberg. September 2008. Volume 5193, pp. 344-355. Springer-Verlag.

[BibTeX] [DOI] [PDF]

BibTeX:

@inproceedings{Djordjevic2008,
  author = {B. Djordjevic and J. Gudmundsson and A. Pham and T. Wolle},
  title = {Detecting Regular Visit Patterns},
  booktitle = {Proceedings of the 16th European Symposium on Algorithms (ESA 2008)},
  publisher = {Springer-Verlag},
  year = {2008},
  volume = {5193},
  pages = {344--355},
  doi = {http://dx.doi.org/10.1007/978-3-540-87744-8_29}
}

Gudmundsson, J., Laube, P. & Wolle, T. (2008), "Encyclopedia of GIS" , pp. 726-732. Springer.

[BibTeX] [DOI] [PDF]

BibTeX:

@inbook{GudmundssonLW2008,
  author = {J. Gudmundsson and P. Laube and T. Wolle},
  title = {Encyclopedia of GIS},
  publisher = {Springer},
  year = {2008},
  pages = {726-732},
  doi = {http://dx.doi.org/10.1007/978-0-387-35973-1_823}
}

Laube, P., Duckham, M. & Wolle, T. (2008), "Decentralized Movement Pattern Detection amongst Mobile Geosensor Nodes", In Proceedings of the 5th International Conference on Geographic Information Systems (GIScience 2008). September 2008. Volume 5266, pp. 199-216. Springer-Verlag.

[BibTeX] [DOI] [PDF]

BibTeX:

@inproceedings{Laube2008,
  author = {P. Laube and M. Duckham and T. Wolle},
  title = {Decentralized Movement Pattern Detection amongst Mobile Geosensor Nodes},
  booktitle = {Proceedings of the 5th International Conference on Geographic Information Systems (GIScience 2008)},
  publisher = {Springer-Verlag},
  year = {2008},
  volume = {5266},
  pages = {199-216},
  doi = {http://dx.doi.org/10.1007/978-3-540-87473-7_13}
}

Andersson, M., Gudmundsson, J., Laube, P. & Wolle, T. (2007), "Reporting Leadership Patterns Among Trajectories", In Proceedings of the 22nd ACM Symposium on Applied Computing. New York, NY, USA., pp. 3-7. ACM.

[BibTeX] [DOI] [PDF]

BibTeX:

@inproceedings{aglw-lqtd-07,
  author = {M. Andersson and J. Gudmundsson and P. Laube and T. Wolle},
  title = {Reporting Leadership Patterns Among Trajectories},
  booktitle = {Proceedings of the 22nd ACM Symposium on Applied Computing},
  publisher = {ACM},
  year = {2007},
  pages = {3--7},
  doi = {http://doi.acm.org/10.1145/1244002.1244004}
}

Benkert, M., Djordjevic, B., Gudmundsson, J. & Wolle, T. (2007), "Finding Popular Places", In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007). Berlin Heidelberg. Volume 4835, pp. 776-787. Springer-Verlag.

[BibTeX] [DOI] [PDF]

BibTeX:

@inproceedings{Benkert2007conf,
  author = {M. Benkert and B. Djordjevic and J. Gudmundsson and T. Wolle},
  title = {Finding Popular Places},
  booktitle = {Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007)},
  publisher = {Springer-Verlag},
  year = {2007},
  volume = {4835},
  pages = {776--787},
  doi = {http://dx.doi.org/10.1007/978-3-540-77120-3_67}
}

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". Utrecht University, Department of Information and Computing Sciences, Technical Report UU-CS-2007-031, 2007.

[BibTeX] [URL]

BibTeX:

@techreport{Bodlaender2007,
  author = {H. L. Bodlaender and C. Feremans and A. Grigoriev and E. Penninkx and R. Sitters and T. Wolle},
  title = {On the minimum corridor connection problem and other generalized geometric problems},
  year = {2007},
  number = {UU-CS-2007-031},
  url = {http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-031.ps.gz}
}

Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C. & Wolle, T. (2007), "Compressing Spatio-Temporal Trajectories", In Proceedings of the the 18th Annual International Symposium on Algorithms and Computation (ISAAC). Berlin Heidelberg. Volume 4835, pp. 763-775. Springer-Verlag.

[BibTeX] [DOI] [PDF]

BibTeX:

@inproceedings{gkmow-cstt-07,
  author = {J. Gudmundsson and J. Katajainen and D. Merrick and C. Ong and T. Wolle},
  title = {Compressing Spatio-Temporal Trajectories},
  booktitle = {Proceedings of the the 18th Annual International Symposium on Algorithms and Computation (ISAAC)},
  publisher = {Springer-Verlag},
  year = {2007},
  volume = {4835},
  pages = {763--775},
  doi = {http://dx.doi.org/10.1007/978-3-540-77120-3_66}
}

Andersson, M., Gudmundsson, J., Laube, P. & Wolle, T. (2006), "Reporting Leaders and Followers Among Trajectories of Moving Point Objects". National ICT Australia, Technical Report PA006075, 2006.

[BibTeX] [PDF]

BibTeX:

@techreport{aglw-rlafatompo-06t,
  author = {M. Andersson and J. Gudmundsson and P. Laube and T. Wolle},
  title = {Reporting Leaders and Followers Among Trajectories of Moving Point Objects},
  year = {2006},
  number = {PA006075}
}

Benkert, M., Gudmundsson, J., Hübner, F. & Wolle, T. (2006), "Reporting Flock Patterns", In Proceedings of the 14th European Symposium on Algorithms (ESA 2006). Volume 4168, pp. 660-671. Springer-Verlag.

[BibTeX] [DOI] [PDF]

BibTeX:

@inproceedings{bghw-rfp-06,
  author = {M. Benkert and J. Gudmundsson and F. Hübner and T. Wolle},
  title = {Reporting Flock Patterns},
  booktitle = {Proceedings of the 14th European Symposium on Algorithms (ESA 2006)},
  publisher = {Springer-Verlag},
  year = {2006},
  volume = {4168},
  pages = {660--671},
  doi = {http://dx.doi.org/10.1007/11841036_59}
}

Benkert, M., Gudmundsson, J., Hübner, F. & Wolle, T. (2006), "Reporting Flock Patterns". Fakultät für Informatik, Universität Karlsruhe, Technical Report 2006-14, 2006.

[BibTeX] [URL] [PDF]

BibTeX:

@techreport{bghw-rfp-06t,
  author = {M. Benkert and J. Gudmundsson and F. Hübner and T. Wolle},
  title = {Reporting Flock Patterns},
  year = {2006},
  number = {2006-14},
  url = {http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=/ira/2006/14}
}

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 Proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006. Berlin Heidelberg. Volume 4368, pp. 69-82. Springer-Verlag.

[BibTeX] [DOI] [PDF]

BibTeX:

@inproceedings{Bodlaender2006a,
  author = {H. L. Bodlaender and C. Feremans and A. Grigoriev and E. Penninkx and R. Sitters and T. Wolle},
  title = {On the minimum corridor connection problem and other generalized geometric problems},
  booktitle = {Proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006},
  publisher = {Springer-Verlag},
  year = {2006},
  volume = {4368},
  pages = {69--82},
  doi = {http://dx.doi.org/10.1007/11970125_6}
}

Bodlaender, H.L., Koster, A.M.C.A. & Wolle, T. (2006), "Contraction and Treewidth Lower Bounds" , Journal of Graph Algorithms and Applications. Vol. 10 (1) , pp. 5-49.

[BibTeX] [URL]

BibTeX:

@article{Bodlaender2006,
  author = {H. L. Bodlaender and A. M. C. A. Koster and T. Wolle},
  title = {Contraction and Treewidth Lower Bounds},
  journal = {Journal of Graph Algorithms and Applications},
  year = {2006},
  volume = {10},
  number = {1},
  pages = {5--49},
  url = {http://jgaa.info/accepted/2006/BodlaenderWolleKoster2006.10.1.pdf}
}

Koster, A.M.C.A., Wolle, T. & Bodlaender, H.L. (2005), "Degree-Based Treewidth Lower Bounds", In Proceedings of the 4th international Workshop on Efficient and Experimental Algorithms (WEA 2005). Berlin Heidelberg. Volume 3503, pp. 101-112. Springer-Verlag.

[BibTeX] [PDF]

BibTeX:

@inproceedings{Koster2005,
  author = {A. M. C. A. Koster and T. Wolle and H. L. Bodlaender},
  title = {Degree-Based Treewidth Lower Bounds},
  booktitle = {Proceedings of the 4th international Workshop on Efficient and Experimental Algorithms (WEA 2005)},
  publisher = {Springer-Verlag},
  year = {2005},
  volume = {3503},
  pages = {101--112}
}

Wolle, T. (2005), "Computational Aspects of Treewidth: Lower Bounds and Network Reliability" . School: Department of Computer Science, Utrecht University, The Netherlands.

[BibTeX] [URL]

BibTeX:

@phdthesis{Wolle2005,
  author = {T. Wolle},
  title = {Computational Aspects of Treewidth: Lower Bounds and Network Reliability},
  school = {Department of Computer Science, Utrecht University, The Netherlands},
  year = {2005},
  url = {http://igitur-archive.library.uu.nl/dissertations/2005-0614-200103/full.pdf}
}

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

[BibTeX] [URL]

BibTeX:

@techreport{Bodlaender2004b,
  author = {H. L. Bodlaender and A. M. C. A. Koster and T. Wolle},
  title = {Contraction and Treewidth Lower Bounds},
  year = {2004},
  number = {UU-CS-2004-034},
  url = {http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-034.pdf}
}

Bodlaender, H.L., Koster, A.M.C.A. & Wolle, T. (2004), "Contraction and Treewidth Lower Bounds", In Proceedings of the 12th European Symposium on Algorithms (ESA 2004). Berlin Heidelberg. Volume 3221, pp. 628-639. Springer-Verlag.

[BibTeX] [PDF]

BibTeX:

@inproceedings{Bodlaender2004c,
  author = {H. L. Bodlaender and A. M. C. A. Koster and T. Wolle},
  title = {Contraction and Treewidth Lower Bounds},
  booktitle = {Proceedings of the 12th European Symposium on Algorithms (ESA 2004)},
  publisher = {Springer-Verlag},
  year = {2004},
  volume = {3221},
  pages = {628--639}
}

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

[BibTeX] [URL]

BibTeX:

@techreport{Bodlaender2004,
  author = {H. L. Bodlaender and T. Wolle},
  title = {A Note on the Complexity of Network Reliability Problems},
  year = {2004},
  number = {UU-CS-2004-001},
  url = {http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-001.pdf}
}

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

[BibTeX] [URL]

BibTeX:

@techreport{Bodlaender2004a,
  author = {H. L. Bodlaender and T. Wolle},
  title = {Contraction Degeneracy on Cographs},
  year = {2004},
  number = {UU-CS-2004-031},
  url = {http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-031.pdf}
}

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

[BibTeX] [URL]

BibTeX:

@techreport{Koster2004,
  author = {A. M. C. A. Koster and T. Wolle and H. L. Bodlaender},
  title = {Degree-Based Treewidth Lower Bounds},
  year = {2004},
  number = {UU-CS-2004-050},
  url = {http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-050.pdf}
}

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

[BibTeX] [URL]

BibTeX:

@techreport{Wolle2004,
  author = {T. Wolle and H. L. Bodlaender},
  title = {A Note on Edge Contraction},
  year = {2004},
  number = {UU-CS-2004-028},
  url = {http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-028.pdf}
}

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

[BibTeX] [URL]

BibTeX:

@techreport{Wolle2004a,
  author = {T. Wolle and A. M. C. A. Koster and H. L. Bodlaender},
  title = {A Note on Contraction Degeneracy},
  year = {2004},
  number = {UU-CS-2004-042},
  url = {http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-042.pdf}
}

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

[BibTeX] [URL]

BibTeX:

@techreport{Wolle2003,
  author = {T. Wolle},
  title = {A Framework for Network Reliability Problems on Graphs of Bounded Treewidth},
  year = {2003},
  number = {UU-CS-2003-026},
  url = {http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-026.pdf}
}

Wolle, T. (2002), "A Framework for Network Reliability Problems on Graphs of Bounded Treewidth", In ISAAC '02: Proceedings of the 13th International Symposium on Algorithms and Computation. Berlin Heidelberg. Volume 2518, pp. 137-149. Springer-Verlag.

[BibTeX] [PDF]

BibTeX:

@inproceedings{Wolle2002,
  author = {T. Wolle},
  title = {A Framework for Network Reliability Problems on Graphs of Bounded Treewidth},
  booktitle = {ISAAC '02: Proceedings of the 13th International Symposium on Algorithms and Computation},
  publisher = {Springer-Verlag},
  year = {2002},
  volume = {2518},
  pages = {137--149}
}

Stuff

Dense Outliers - a blog on theoretical computer science in Australia
SACT homepage - Sydney Algorithms and Computational Thinking
DO THE TEST!
Improve your English
your IP address: 38.107.191.94
your browser:
your OS:
page last modified: 2010-02-19 01:43:52
I'm not responsible for the content of any linked site.
Some statistics

Coauthors

Past Activities

Researcher in the DMIST project at NICTA in Sydney.
Research student at the Department of Information and Computing Sciences (on Google Maps) at Utrecht University (on Google Maps)
supervisor: Hans Bodlaender and Jan van Leeuwen; topic: graphs, graph algorithms, treewidth
Student in computer science at the Friedrich Schiller University in Jena (on Google Maps)
supervisor: Dieter Kratsch; topic: graphs, graph algorithms, dominating set approximation
Programme committee member of:
ACSC 2009 in Wellington, New Zealand (held in conjunction with the Australian Computer Science Week 2009).
ACSC 2010 in Brisbane, Australia, 2010-01-18 to 2010-01-22 (held in conjunction with the Australian Computer Science Week 2010).
Supervision or co-supervision of students (master and/or summer scholar students): Cahya, Susan, Paul, Yahya, David, Merlin, Sidong
Co-lecturing COMP 5045 (Computational Geometry, previously known as COMP 4045) at the University of Sydney (School of IT) in 2006, 2007, 2008, 2009
And some other things that are part of the job...