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, art, literature, satire, history, and ... :

Research

Project "Generalized and fast search strategies for parameterized problems" supported by the Swedish Research Council (VR) until 2013; my 3rd project grant from VR.

Participation in the project "Data-driven secure business intelligence" supported by the Swedish Foundation for Strategic Reserch (SSF) until 2016; with David Sands, Devdatt Dubhashi, Andrei Sabelfeld, Gerardo Schneider.

PhD students:

Leonid Molokov (co-supervisor: Devdatt Dubhashi), PhD 2013, featured in Parameterized Complexity Newsletter April 2013.
Azam Sheikh Muhammad
Olof Mogren

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.
4th International Conference on Contemporary Computing IC3, 2011 in Noida, India.
ICALP 2011 Workshop on Algorithms and Data Structures for Selection, Identification and Encoding ICALP2011GT in Zurich.

Recent Publications

Somewhat unsorted. See also DBLP.

Parameterizations of hitting set of bundles and inverse scope PDF
accepted for Journal of Combinatorial Optimization
The original publication is available at www.springerlink.com.
Two new perspectives on multi-stage group testing PDF
with Azam Sheikh Muhammad and Eberhard Triesch
accepted for Algorithmica
The final publication is available at http://link.springer.com.
A toolbox for provably optimal multistage strict group testing strategies PDF
with Azam Sheikh Muhammad
accepted for the 19th International Computing and Combinatorics Conference COCOON 2013, Hangzhou, to appear in LNCS 7936, 446-457
Fixed-parameter tractability of error correction in graphical linear systems PDF
with Omer Egecioglu and Leonid Molokov
7th International Workshop on Algorithms and Computation WALCOM 2013, IIT Kharagpur (India), LNCS 7748, 245-256
Error propagation in sparse linear systems with peptide-protein incidence matrices PDF
with Leonid Molokov
8th International Symposium on Bioinformatics Research and Applications ISBRA 2012, Dallas, LNCS (subseries LNBI) 7292, 72-83
A note on the parameterized complexity of unordered maximum tree orientation PDF
with Sebastian Böcker
Discrete Applied Mathematics 160 (2012), 1634-1638
Randomized group testing both query-optimal and minimal adaptive PDF
with Azam Sheikh Muhammad
Best Paper Award at the 38th International Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2012, Spindleruv Mlyn (Czech Republic), LNCS 7147, 214-225
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing PDF
accepted for Theoretical Computer Science
preliminary version in:
6th International Symposium on Parameterized and Exact Computation IPEC 2011 (part of ALGO 2011), Saarbrucken, LNCS 7112, 94-105
Even faster parameterized cluster deletion and cluster editing PDF
with Sebastian Böcker
Information Processing Letters 111 (2011), 717-721
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover PDF
with Leonid Molokov
Theoretical Computer Science 452 (2012), 39-46
preliminary version in:
12th Algorithms and Data Structures Symposium WADS 2011, New York, LNCS 6844, 279-289
Bounds for nonadaptive group tests to estimate the amount of defectives PDF
with Azam Sheikh Muhammad
Discrete Mathematics, Algorithms and Applications
3 (2011), 517-536
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries (ask for a copy)
Networks 57 (2011), 344-350
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover PDF
Discrete Optimization 8 (2011), 18-24
Bounded-degree techniques accelerate some parameterized graph algorithms PDF
4th International Workshop on Parameterized and Exact Computation IWPEC 2009 (part of ALGO 2009), Copenhagen, LNCS 5917, 98-109
Pareto complexity of two-parameter FPT problems: A case study for partial vertex cover PDF
4th International Workshop on Parameterized and Exact Computation IWPEC 2009 (part of ALGO 2009), Copenhagen, LNCS 5917, 110-121
Competitive group testing and learning hidden vertex covers with minimum adaptivity PDF
with Azam Sheikh Muhammad
Discrete Mathematics, Algorithms and Applications 2 (2010), 291-311
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
Theory of Computing Systems 46 (2010), 261-283
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
Algorithmica 57 (2010), 621-640
The union of minimal hitting sets: Parameterized combinatorial bounds and counting PDF
with Leonid Molokov
Journal of Discrete Algorithms 7 (2009), 391-401
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs PDF
Information Processing Letters 100 (2006), 64-68
Fast algorithms for finding disjoint subsequences with extremal densities PS
with Anders Bergkvist
Pattern Recognition 39 (2006), 2281-2292, Special Issue on Bioinformatics.
Threshold group testing PDF
in: General Theory of Information Transfer and Combinatorics, LNCS 4123, 707-718
Overlaps help: Improved bounds for group testing with interval queries
with Ferdinando Cicalese, Libertad Tansini, and Sören Werth
Discrete Applied Mathematics 155 (2007), 288-299
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science 351 (2006), 337-350, Special Issue IWPEC 2004.
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.

Teaching

I am director of the master's programme Computer Science - Algorithms, Languages and Logic at Chalmers.

Algorithms Advanced Course in period 2, autumn 2012.
Discrete Optimization in period 3, spring 2013.

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.