Peter Damaschke

Biträdande professor at Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Link to personal page

Source: chalmers.se

Projects

2012–2016

Data-Driven Secure Business Intelligence (DataBIN)

David Sands Software Technology (Chalmers)
Andrei Sabelfeld Software Technology (Chalmers)
Peter Damaschke Computing Science (Chalmers)
Devdatt Dubhashi Computing Science (Chalmers)
Olof Mogren Computing Science (Chalmers)
Fredrik Johansson Computing Science (Chalmers)
Raul Pardo Jimenez Software Technology (Chalmers)
Gerardo Schneider Software Technology (Chalmers)
Hamid Ebadi Tavallaei Software Technology (Chalmers)
Swedish Foundation for Strategic Research (SSF)

There might be more projects where Peter Damaschke participates, but you have to be logged in as a Chalmers employee to see them.

Publications

2017

Refined algorithms for hitting many intervals

Peter Damaschke,
Information Processing Letters. Vol. 118, p. 117-122
Scientific journal article - peer reviewed
2016

Deterministic versus randomized adaptive test cover

Peter Damaschke,
Theoretical Computer Science. Vol. 653, p. 42-52
Scientific journal article - peer reviewed
2016

The solution space of sorting with recurring comparison faults

Peter Damaschke,
Lecture Notes in Computer Science; 27th International Workshop on Combinatorial Algorithms IWOCA 2016, Lecture Notes in Computer Science. Vol. 9843, p. 397-408
Conference paper - peer reviewed
2016

Computing giant graph diameters

Peter Damaschke,
Lecture Notes in Computer Science ; (27th International Workshop on Combinatorial Algorithms IWOCA 2016). Vol. 9843, p. 373-384
Conference paper - peer reviewed
2016

Adaptive group testing with a constrained number of positive responses improved

Peter Damaschke,
Discrete Applied Mathematics. Vol. 205, p. 208-212
Scientific journal article - peer reviewed
2016

Sufficient conditions for edit-optimal clusters

Peter Damaschke,
Information Processing Letters. Vol. 116 (4), p. 267-272
Scientific journal article - peer reviewed
2016

Summarizing online user reviews using bicliques

Azam Sheikh Muhammad, Peter Damaschke, Olof Mogren et al
42nd International Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2016, Lecture Notes in Computer Science. Vol. 9587, p. 569-579
Conference paper - peer reviewed
2015

Pairs covered by a sequence of sets

Peter Damaschke,
20th International Symposium on Fundamentals of Computation Theory FCT 2015, Lecture Notes in Computer Science. Vol. 9210, p. 214-226
Conference paper - peer reviewed
2015

Randomized adaptive test cover

Peter Damaschke,
Lecture Notes in Computer Science: 9th International Conference on Algorithms and Complexity CIAC 2015. Vol. 9079, p. 182-193
Conference paper - peer reviewed
2015

Parameterizations of hitting set of bundles and inverse scope

Peter Damaschke,
Journal of combinatorial optimization. Vol. 29 (4), p. 847-855
Scientific journal article - peer reviewed
2015

Finding and enumerating large intersections

Peter Damaschke,
Theoretical Computer Science. Vol. 580, p. 75-82
Scientific journal article - peer reviewed
2014

Editing simple graphs

Peter Damaschke, Olof Mogren,
Journal of Graph Algorithms and Applications. Vol. 18 (4), p. 557-576
Scientific journal article - peer reviewed
2014

Strict group testing and the set basis problem

Peter Damaschke, Azam Sheikh Muhammad, Gabor Wiener et al
Journal of combinatorial theory. Series A. Vol. 126, p. 70-91
Scientific journal article - peer reviewed
2014

Enumerating maximal bicliques in bipartite graphs with favorable degree sequences

Peter Damaschke,
Information Processing Letters. Vol. 114 (6), p. 317-321
Scientific journal article - peer reviewed
2014

Editing the simplest graphs

Peter Damaschke, Olof Mogren,
Lecture Notes in Computer Science: 8th International Workshop on Algorithms and Computation WALCOM 2014, Lecture Notes in Computer Science. Vol. 8344, p. 249-260
Conference paper - peer reviewed
2013

Cluster editing with locally bounded modifications revisited

Peter Damaschke,
24th International Workshop on Combinatorial Algorithms IWOCA 2013, Lecture Notes in Computer Science. Vol. 8288, p. 433-437
Conference paper - peer reviewed
2013

Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing

Peter Damaschke,
Theoretical Computer Science. Vol. 511, p. 137-146
Scientific journal article - peer reviewed
2013

Two new perspectives on multi-stage group testing

Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch et al
Algorithmica. Vol. 67 (3), p. 324-354
Scientific journal article - peer reviewed
2013

A toolbox for provably optimal multistage strict group testing strategies

Peter Damaschke, Azam Sheikh Muhammad,
19th International Computing and Combinatorics Conference COCOON 2013, Lecture Notes in Computer Science. Vol. 7936, p. 446-457
Conference paper - peer reviewed
2013

Fixed-parameter tractability of error correction in graphical linear systems

Peter Damaschke, Ömer Egecioglu, Leonid Molokov et al
7th International Workshop on Algorithms and Computation WALCOM 2013, Lecture Notes in Computer Science. Vol. 7748, p. 245-256
Conference paper - peer reviewed
2012

Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover

Peter Damaschke, Leonid Molokov,
Theoretical Computer Science. Vol. 452, p. 39-46
Scientific journal article - peer reviewed
2012

Error propagation in sparse linear systems with peptide-protein incidence matrices

Peter Damaschke, Leonid Molokov,
8th International Symposium on Bioinformatics Research and Applications ISBRA 2012, Lecture Notes in Bioinformatics. Vol. 7292, p. 72-83
Conference paper - peer reviewed
2012

A note on the parameterized complexity of unordered maximum tree orientation

Sebastian Böcker, Peter Damaschke,
Discrete Applied Mathematics. Vol. 160 (10-11), p. 1634-1638
Scientific journal article - peer reviewed
2012

Randomized group testing both query-optimal and minimal adaptive

Peter Damaschke, Azam Sheikh Muhammad,
Lecture Notes in Computer Science. SOFSEM 2012: Theory and practice of Computer Science. 38th Conference on Current Trends in Theory and Practice of Computer Science. Spindleruv Mlyn, Czech Republic, 21 - 27 January 2012. Vol. 7147, p. 214-225
Conference paper - peer reviewed
2011

Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing

Peter Damaschke,
Lecture Notes in Computer Science. 6th International Symposium on Parameterized and Exact Computation, Saarbrucken, 6-8 September 2011. Vol. 7112, p. 94-105
Conference paper - peer reviewed
2011

Bounds for nonadaptive group tests to estimate the amount of defectives

Peter Damaschke, Azam Sheikh Muhammad,
Discrete Mathematics, Algorithms and Applications. Vol. 3 (4), p. 517-536
Scientific journal article - peer reviewed
2011

Parameterized reductions and algorithms for another vertex cover generalization

Peter Damaschke, Leonid Molokov,
12th Algorithms and Data Structures Symposium WADS 2011, Lecture Notes in Computer Science. Vol. 6844, p. 279-289
Conference paper - peer reviewed
2011

Optimal randomized group testing: A canonical form and the one-defective case

Peter Damaschke,
ICALP 2011 Workshop on Algorithms and Data Structures for Selection, Identification and Encoding ICALP2011GT, p. 55-67
Conference paper - peer reviewed
2011

Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries

Peter Damaschke,
Networks. Vol. 57 (4), p. 344-350
Scientific journal article - peer reviewed
2011

Even faster parameterized cluster deletion and cluster editing

Sebastian Böcker, Peter Damaschke,
Information Processing Letters. Vol. 111 (14), p. 717-721
Scientific journal article - peer reviewed
2011

Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover

Peter Damaschke,
Discrete Optimization. Vol. 8 (1), p. 18-24
Scientific journal article - peer reviewed
2010

Bounds for nonadaptive group tests to estimate the amount of defectives

Peter Damaschke, Azam Sheikh Muhammad,
Lecture Notes in Computer Science. 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010, Kailua-Kona, 18-20 December 2010. Vol. 6509, p. 117-130
Conference paper - peer reviewed
2010

Competitive group testing and learning hidden vertex covers with minimum adaptivity

Peter Damaschke, Azam Sheikh Muhammad,
Discrete Mathematics, Algorithms and Applications. Vol. 2 (3), p. 291-311
Scientific journal article - peer reviewed
2010

Homogeneous string segmentation using trees and weighted independent sets

Peter Damaschke,
Algorithmica. Vol. 57 (4), p. 621-640
Scientific journal article - peer reviewed
2010

Fixed-parameter enumerability of cluster editing and related problems

Peter Damaschke,
Theory of Computing Systems. Vol. 46 (2), p. 261-283
Scientific journal article - peer reviewed
2009

Pareto complexity of two-parameter FPT problems: A case study for partial vertex cover

Peter Damaschke,
4th International Workshop on Parameterized and Exact Computation IWPEC 2009, Lecture Notes in Computer Science. Vol. 5917, p. 110-121
Conference paper - peer reviewed
2009

Bounded-degree techniques accelerate some parameterized graph algorithms

Peter Damaschke,
4th International Workshop on Parameterized and Exact Computation IWPEC 2009, Lecture Notes in Computer Science. Vol. 5917, p. 98-109
Conference paper - peer reviewed
2009

Multiple hypernode hitting sets and smallest two-cores with targets

Peter Damaschke,
Journal of Combinatorial Optimization (special issue COCOA 2008). Vol. 18 (3), p. 294-306
Scientific journal article - peer reviewed
2009

The union of minimal hitting sets: parameterized combinatorial bounds and counting

Peter Damaschke, Leonid Molokov,
Journal of Discrete Algorithms. Vol. 7 (4), p. 391-401
Scientific journal article - peer reviewed
2009

Competitive group testing and learning hidden vertex covers with minimum adaptivity

Peter Damaschke, Azam Sheikh Muhammad,
17th International Symposium on Fundamentals of Computation Theory FCT 2009, Lecture Notes in Computer Science. Vol. 5699, p. 84-95
Conference paper - peer reviewed
2009

Online search with time-varying price bounds

Peter Damaschke, Philippas Tsigas, Phuong Ha et al
Algorithmica. Vol. 55 (4), p. 619-642
Scientific journal article - peer reviewed
2009

Ranking hypotheses to minimize the search cost in probabilistic inference models

Peter Damaschke,
Discrete Applied Mathematics. Vol. 157, p. 1218-1228
Scientific journal article - peer reviewed
2008

Minimum common string partition parameterized

Peter Damaschke,
8th Workshop on Algorithms in Bioinformatics WABI 2008, Lecture Notes in Bioinformatics. Vol. 5251, p. 87-98
Conference paper - peer reviewed
2008

Multiple hypernode hitting sets and smallest two-cores with targets

Peter Damaschke,
2nd International Conference on Combinatorial Optimization and Applications COCOA 2008, Lecture Notes in Computer Science. Vol. 5165, p. 32-42
Conference paper - peer reviewed
2008

Competitive search for longest empty intervals (short version)

Peter Damaschke,
20th Canadian Conference on Computational Geometry CCCG 2008, p. 219-222
Conference paper - peer reviewed
2007

Segmenting strings homogeneously via trees

Peter Damaschke,
33rd International Workshop on Graph-Theoretic Concepts in Computer Science WG 2007, Lecture Notes in Computer Science. Vol. 4769, p. 214-225
Conference paper - peer reviewed
2007

The union of minimal hitting sets: Parameterized combinatorial bounds and counting

Peter Damaschke,
24th Symposium on Theoretical Aspects of Computer Science STACS 2007, Lecture Notes in Computer Science. Vol. 4393, p. 332-343
Conference paper - peer reviewed
2007

Overlaps help: Improved bounds for group testing with interval queries

Peter Damaschke, Ferdinando Cicalese, Libertad Tansini et al
Discrete Applied Mathematics. Vol. 155 (3), p. 288-299
Scientific journal article - peer reviewed
2006

Linear programs for hypotheses selection in probabilistic inference models

Anders Bergkvist, Peter Damaschke, Marcel Lüthi et al
Journal of Machine Learning Research. Vol. 7, p. 1339-1355
Scientific journal article - peer reviewed
2006

Threshold group testing

Peter Damaschke,
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science. Vol. 4123, p. 707-718
Conference paper - peer reviewed
2006

Fast algorithms for finding disjoint subsequences with extremal densities

Peter Damaschke, Anders Bergkvist,
Pattern Recognition. Vol. 39 (12), p. 2281-2292
Scientific journal article - peer reviewed
2006

Competitive Freshness Algorithms for Wait-free Data Objects

Peter Damaschke, Phuong Ha, Philippas Tsigas et al
Proceedings of the 12th European Conference on Parallel Computing (EURO-PAR '06), LNCS, Springer Verlag, . Vol. 4128, p. 811-820
Scientific journal article - peer reviewed
2006

A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs

Peter Damaschke,
Information Processing Letters. Vol. 100 (2), p. 64-68
Scientific journal article - peer reviewed
2006

Scheduling search procedures: The wheel of fortune

Peter Damaschke,
Journal of Scheduling. Vol. 9 (6), p. 545-557
Scientific journal article - peer reviewed
2006

Linear programs for hypotheses selection in probabilistic inference models

Peter Damaschke, Anders Bergkvist, Marcel Lüthi et al
Journal of Machine Learning Research. Vol. 7, p. 1339-1355
Scientific journal article - peer reviewed
2006

Fixed-parameter tractable generalizations of cluster editing

Peter Damaschke,
6th International Conference on Algorithms and Complexity CIAC 2006, Lecture Notes in Computer Science. Vol. 3998, p. 344-355
Conference paper - peer reviewed
2006

Randomized vs. deterministic distance query strategies for point location on the line

Peter Damaschke,
Discrete Applied Mathematics. Vol. 154 (3), p. 478-484
Scientific journal article - peer reviewed
2006

Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

Peter Damaschke,
Theoretical Computer Science . Vol. 351 (3), p. 337-350
Scientific journal article - peer reviewed
2006

Multiple spin-block decisions

Peter Damaschke,
Algorithmica. Vol. 44 (1), p. 33-48
Scientific journal article - peer reviewed
2005

Optimal group testing algorithms with interval queries and their application to splice site detection

Peter Damaschke, Ferdinando Cicalese, Ugo Vaccaro et al
International Journal of Bioinformatics Research and Applications. Vol. 1 (4), p. 363-388
Scientific journal article - peer reviewed
2005

On the fixed-parameter enumerability of cluster editing

Peter Damaschke,
31st International Workshop on Graph-Theoretic Concepts in Computer Science WG 2005, Lecture Notes in Computer Science. Vol. 3787, p. 283-294
Conference paper - peer reviewed
2005

Fast algorithms for finding disjoint subsequences with extremal densities

Peter Damaschke, Anders Bergkvist,
16th International Symposium on Algorithms and Computation ISAAC 2005, Lecture Notes in Computer Science . Vol. 3827, p. 714-723
Conference paper - peer reviewed
2005

Competitive Freshness Algorithms for Wait-free Data Objects

Peter Damaschke, Phuong Ha, Philippas Tsigas et al
Report
2005

One-Way Trading with Time-Varying Exchange Rate Bounds

Peter Damaschke, Phuong Ha, Philippas Tsigas et al
Report
2005

Overlaps help: Improved bounds for group testing with interval queries

Ferdinando Cicalese, Peter Damaschke, Libertad Tansini et al
11th International Computing and Combinatorics Conference COCOON 2005, Lecture Notes in Computer Science. Vol. 3595, p. 935-944
Conference paper - peer reviewed
2005

Threshold group testing (extended abstract)

Peter Damaschke,
Electronic Notes in Discrete Mathematics. Vol. 21, p. 265-271
Scientific journal article - peer reviewed
2005

On queuing lengths in on-line switching

Peter Damaschke, Zhen Zhou,
Theoretical Computer Science. Vol. 339 (2-3), p. 333-343
Scientific journal article - peer reviewed
2005

Optimal group testing strategies with interval queries and their application to splice site detection

Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro et al
International Workshop on Bioinformatics Research and Applications IWBRA 2005 (part of ICCS 2005), Lecture Notes in Computer Science. Vol. 3515, p. 1029-1037
Conference paper - peer reviewed
2004

Incremental haplotype inference, phylogeny, and almost bipartite graphs

Peter Damaschke,
2nd RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes, Proceedings (Prepint), Carnegie Mellon University, Pittsburgh 2004 , p. 1-11
Conference paper - peer reviewed
2004

Approximate location of relevant variables under the crossover distribution

Peter Damaschke,
Discrete Applied Mathematics. Vol. 137 (1), p. 47-67
Scientific journal article - peer reviewed
2004

Scheduling search procedures

Peter Damaschke,
Journal of Scheduling. Vol. 7 (5), p. 349-364
Scientific journal article - peer reviewed
2004

Paremeterized enumeration, transversals, and imperfect phylogeny reconstruction

Peter Damaschke,
1st International Workshop on Parameterized and Exact Computation IWPEC'2004, Lecture Notes in Computer Science. Vol. 3162, p. 1-12
Conference paper - peer reviewed
2003

Linear-time recognition of bipartite graphs plus two edges

Peter Damaschke,
Discrete Mathematics. Vol. 262 (1-3), p. 99-112
Scientific journal article - peer reviewed
2003

Distributed soft path coloring

Peter Damaschke,
Lecture Notes in Computer Science, 20th Symposium on Theoretical Aspects of Computer Science STACS'2003, Berlin 27 February-1 March 2003. Vol. 2607, p. 523-534
Conference paper - peer reviewed
2003

Point placement on the line by distance data

Peter Damaschke,
Discrete Applied Mathematics. Vol. 127 (1), p. 53-62
Scientific journal article - peer reviewed
2003

Nearly optimal strategies for special cases of on-line capital investment

Peter Damaschke,
Theoretical Computer Science. Vol. 302 (1), p. 35-44
Scientific journal article - peer reviewed
2003

On parallel attribute-efficient learning

Peter Damaschke,
Journal of computer and system sciences. Vol. 67 (1), p. 46-62
Scientific journal article - peer reviewed
2003

Fast perfect phylogeny haplotype inference

Peter Damaschke,
Lecture Notes in Computer Science. 14th International Symposium on Fundamentals of Computation Theory FCT'2003, Malmö, 12-15 August 2003. Vol. 2751, p. 183-194
Conference paper - peer reviewed
2003

Powers of geometric intersection graphs and dispersion algorithms

Geir Agnarsson, Peter Damaschke, Magnus Halldorsson et al
Discrete Applied Mathematics. Vol. 132 (1-3), p. 3-16
Scientific journal article - peer reviewed
2002

Scheduling Search Procedures

Peter Damaschke,
Lecture Notes in Computer Science. 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002. Vol. 2380, p. 281-292
Conference paper - peer reviewed
2002

Powers of geometric intersection graphs and dispersion algorithms

G. Agnarsson, Peter Damaschke, M. Halldórsson et al
Lecture Notes in Computer Science. 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002. Vol. 2368, p. 140-149
Conference paper - peer reviewed
2002

Optimizing a mail-order with discount and shipping costs

Peter Damaschke,
Information Processing Letters. Vol. 82 (2), p. 93-97
Scientific journal article - peer reviewed
2002

Online strategies for backups

Peter Damaschke,
Theoretical Computer Science. Vol. 285 (1), p. 43-53
Scientific journal article - peer reviewed
2002

Two short notes on the on-line traveling salesman: handling times and lookahead

Peter Damaschke,
Theoretical Computer Science. Vol. 289 (1), p. 845-852
Scientific journal article - peer reviewed
2001

Worst-case bounds for blind broadcasting in small-degree networks

Peter Damaschke,
8th International Colloquium on Structural Information and Communication Complexity SIROCCO'2001 (Proceedings in Informatics, Carleton Scientific). Vol. 11, p. 105-115
Conference paper - peer reviewed