Peter Damaschke

Associate Professor (Docent)

Computer Science and Engineering, Chalmers University
41296 Göteborg, Sweden
EDIT Building, room 6478
Email: ptr(at)chalmers.se
Phone: +46 31 772 5405

Vita

Born in 1963 in (Eastern) Germany, married, two children.
Studied mathematics in Halle and Jena, 1991 Dr. rer. nat.
1991-2000 assistant at the Department of Computer Science, FernUniversität Hagen.
1994 Habilitation in computer science.
Since 2000 docent at Chalmers.

Interests: listening to classical music, cooking, literature, satire, history, and ... :

Research

Project "Combinatorial inference algorithms - parameterization and clustering" supported by the Swedish Research Council until 2010.

Some of my recent work addresses aspects of Data Mining:

algorithms for finding holes in numerical data sets sampled from unknown random distributions,
strategies for variants of the group testing problem,
enumeration of hitting sets in hypergraphs, with applications to combinatorial inference,
enumeration of clusterings that are close to a given similarity graph,
partitioning of strings under different criteria.

Application domains include: prediction of numerical attributes from easier observable correlated attributes, combinatorial problems in proteomics and genetics, automatic segmentation of biological signals and strings (for example: EEGs, genomic sequences).

PhD students:
Leonid Molokov (co-supervisor: Devdatt Dubhashi)
Azam Sheikh Muhammad

Some master thesis proposals for CTH/GU students.

Membership in editorial boards and program committees:

The Open Information Systems Journal
International Symposium on Bioinformatics Research and Applications ISBRA (2006-2008).
IEEE 22nd International Conference on Advanced Information Networking and Applications AINA 2008 in GinoWan, Okinawa.

Selected Recent Publications

Somewhat unsorted. See also DBLP.

Bounded-degree techniques accelerate some parameterized graph algorithms PDF
and
Pareto complexity of two-parameter FPT problems: A case study for partial vertex cover PDF
both presented at the 4th International Workshop on Parameterized and Exact Computation IWPEC 2009 (part of ALGO 2009), Copenhagen, to appear in LNCS 5917
Competitive group testing and learning hidden vertex covers with minimum adaptivity PDF
with Azam Sheikh Muhammad
17th International Symposium on Fundamentals of Computation Theory FCT 2009, Wroclaw, LNCS 5699, 84-95
Minimum common string partition parameterized PDF
8th Workshop on Algorithms in Bioinformatics WABI 2008, Karlsruhe, LNCS (subseries LNBI) 5251, 87-98
Fixed-parameter enumerability of cluster editing and related problems PDF
accepted for Theory of Computing Systems
The original publication is available at www.springerlink.com.
Competitive search for longest empty intervals PDF (long version)
20th Canadian Conference on Computational Geometry CCCG 2008, Montreal
Multiple hypernode hitting sets and smallest two-cores with targets PDF
Journal of Combinatorial Optimization 18 (2009), 294-306
The original publication is available at www.springerlink.com.
Online search with time-varying price bounds
with Phuong Hoai Ha and Philippas Tsigas
Algorithmica 55 (2009), 619-642
The original publication is available at www.springerlink.com.
Ranking hypotheses to minimize the search costs in probabilistic inference models PDF
Discrete Applied Mathematics 157 (2009), 1218-1228, Special Issue on Reformulation Techniques in Mathematical Programming
Homogeneous string segmentation using trees and weighted independent sets PDF
accepted for Algorithmica
The union of minimal hitting sets: Parameterized combinatorial bounds and counting PDF
with Leonid Molokov
Journal of Discrete Algorithms 7 (2009), 391-401
preliminary version without co-author in: 24th Symposium on Theoretical Aspects of Computer Science STACS 2007, Aachen, LNCS 4393, 332-343
Linear programs for hypotheses selection in probabilistic inference models PS
with Anders Bergkvist and Marcel Lüthi
Journal of Machine Learning Research 7 (2006), 1339-1355
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs PDF
Information Processing Letters 100 (2006), 64-68
Competitive freshness algorithms for wait-free data objects
with Phuong Hoai Ha and Philippas Tsigas
12th European Conference on Parallel Computing Euro-Par 2006, Dresden, LNCS 4128, 811-820
Scheduling search procedures: The wheel of fortune PDF
Journal of Scheduling 9 (2006), 545-557
The original publication is available at www.springerlink.com.
Multiple spin-block decisions PDF
Algorithmica 44 (2006), 33-48
The original publication is available at www.springerlink.com.
Fast algorithms for finding disjoint subsequences with extremal densities PS
with Anders Bergkvist
Pattern Recognition 39 (2006), 2281-2292, Special Issue on Bioinformatics.
Preliminary version in: 16th International Symposium on Algorithms and Computation ISAAC 2005, Sanya (China), LNCS 3827, 714-723
Threshold group testing PDF
in: General Theory of Information Transfer and Combinatorics, LNCS 4123, 707-718
Extended abstract in: Electronic Notes in Discrete Mathematics 21 (2005), 265-271
Overlaps help: Improved bounds for group testing with interval queries PS
with Ferdinando Cicalese, Libertad Tansini, and Sören Werth
Discrete Applied Mathematics 155 (2007), 288-299
Preliminary version in: 11th International Computing and Combinatorics Conference COCOON 2005, Kunming (China), LNCS 3595, 935-944
On queuing lengths in on-line switching PS
with Zhen Zhou
Theoretical Computer Science 339 (2005), 333-343
Optimal group testing strategies with interval queries and their application to splice site detection PDF
with Ferdinando Cicalese and Ugo Vaccaro
International Journal of Bioinformatics Research and Applications 1 (2005), 363-388
Extended abstract in: International Workshop on Bioinformatics Research and Applications IWBRA 2005 (part of ICCS 2005), Atlanta, LNCS 3515, 1029-1037
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction PS
Theoretical Computer Science 351 (2006), 337-350, Special Issue IWPEC 2004.
Preliminary version in: 1st International Workshop on Parameterized and Exact Computation IWPEC 2004 (part of ALGO 2004), Bergen, LNCS 3162, 1-12
Incremental haplotype inference, phylogeny and almost bipartite graphs PDF (extended version)
2nd RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes, Carnegie Mellon Univ. Pittsburgh 2004, 1-11
Brief description and related software.
Nearly optimal strategies for special cases of on-line capital investment PDF
Theoretical Computer Science 302 (2003), 35-44

Teaching

Bachelor project in period 3-4, spring 2007, project group "Mining for large empty regions in data sets".
Algorithms in period 1, autumn 2008.
Machine Learning in period 3, winter 2009.
Artificial Intelligence in period 4, spring 2009 (lecture on searching).
Bachelor project in period 3-4, spring 2009, project group "Cluster editing".
Algorithms Advanced Course in period 2, autumn 2009.

Disclaimer

This is a personal www page. Opinions expressed here do not represent the official views of Chalmers University of Technology.
The author is not responsible for the contents of external links.