Peter Damaschke

Biträdande professor vid Chalmers, Data- och informationsteknik, Data Science

Link to personal page

Källa: chalmers.se

Visar 91 publikationer

2018

The solution space of sorting with recurring comparison faults

Peter Damaschke
Theory of Computing Systems. Vol. 62 (6), p. 1427-1442
Artikel i vetenskaplig tidskrift
2018

Saving probe bits by cube domination

Peter Damaschke
Lecture Notes in Computer Science. Vol. 11159, p. 139-151
Paper i proceeding
2018

An optimization problem related to Bloom filters with bit patterns

Peter Damaschke, Alexander Schliep
Lecture Notes in Computer Science. Vol. 10706, p. 525-538
Paper i proceeding
2017

Finding defectives on a line by random docking and interval group tests

Peter Damaschke
Discrete Mathematics, Algorithms and Applications. Vol. 9 (3)
Artikel i vetenskaplig tidskrift
2017

Refined algorithms for hitting many intervals

Peter Damaschke
Information Processing Letters. Vol. 118, p. 117-122
Artikel i vetenskaplig tidskrift
2017

Calculating approximation guarantees for partial set cover of pairs

Peter Damaschke
Optimization Letters. Vol. 11 (7), p. 1293-1302
Artikel i vetenskaplig tidskrift
2017

Dividing splittable goods evenly and with limited fragmentation

Peter Damaschke
Leibniz International Proceedings in Informatics, LIPIcs. Vol. 83, p. 9:1 - 9:13
Paper i proceeding
2016

Computing giant graph diameters

Peter Damaschke
Lecture Notes in Computer Science. Vol. 9843, p. 373-384
Paper i proceeding
2016

Sufficient conditions for edit-optimal clusters

Peter Damaschke
Information Processing Letters. Vol. 116 (4), p. 267-272
Artikel i vetenskaplig tidskrift
2016

Adaptive group testing with a constrained number of positive responses improved

Peter Damaschke
Discrete Applied Mathematics. Vol. 205, p. 208-212
Artikel i vetenskaplig tidskrift
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
Paper i proceeding
2016

Summarizing online user reviews using bicliques

Muhammad Azam Sheikh, Peter Damaschke, Olof Mogren
Lecture Notes in Computer Science. Vol. 9587, p. 569-579
Paper i proceeding
2016

Deterministic versus randomized adaptive test cover

Peter Damaschke
Theoretical Computer Science. Vol. 653, p. 42-52
Artikel i vetenskaplig tidskrift
2015

Randomized adaptive test cover

Peter Damaschke
Lecture Notes in Computer Science. Vol. 9079, p. 182-193
Paper i proceeding
2015

Parameterizations of hitting set of bundles and inverse scope

Peter Damaschke
Journal of Combinatorial Optimization. Vol. 29 (4), p. 847-855
Artikel i vetenskaplig tidskrift
2015

Finding and enumerating large intersections

Peter Damaschke
Theoretical Computer Science. Vol. 580, p. 75-82
Artikel i vetenskaplig tidskrift
2015

Pairs covered by a sequence of sets

Peter Damaschke
Lecture Notes in Computer Science. Vol. 9210, p. 214-226
Paper i proceeding
2014

Editing simple graphs

Peter Damaschke, Olof Mogren
Journal of Graph Algorithms and Applications. Vol. 18 (4), p. 557-576
Artikel i vetenskaplig tidskrift
2014

Editing the simplest graphs

Peter Damaschke, Olof Mogren
Lecture Notes in Computer Science. Vol. 8344, p. 249-260
Paper i proceeding
2014

Strict group testing and the set basis problem

Peter Damaschke, Muhammad Azam Sheikh, Gabor Wiener
Journal of Combinatorial Theory - Series A. Vol. 126 (1), p. 70-91
Artikel i vetenskaplig tidskrift
2014

Enumerating maximal bicliques in bipartite graphs with favorable degree sequences

Peter Damaschke
Information Processing Letters. Vol. 114 (6), p. 317-321
Artikel i vetenskaplig tidskrift
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
Paper i proceeding
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
Artikel i vetenskaplig tidskrift
2013

Two new perspectives on multi-stage group testing

Peter Damaschke, Muhammad Azam Sheikh, Eberhard Triesch
Algorithmica. Vol. 67 (3), p. 324-354
Artikel i vetenskaplig tidskrift
2013

Fixed-parameter tractability of error correction in graphical linear systems

Peter Damaschke, Ömer Egecioglu, Leonid Molokov
7th International Workshop on Algorithms and Computation WALCOM 2013, Lecture Notes in Computer Science. Vol. 7748, p. 245-256
Paper i proceeding
2013

A toolbox for provably optimal multistage strict group testing strategies

Peter Damaschke, Muhammad Azam Sheikh
19th International Computing and Combinatorics Conference COCOON 2013, Lecture Notes in Computer Science. Vol. 7936, p. 446-457
Paper i proceeding
2012

Randomized group testing both query-optimal and minimal adaptive

Peter Damaschke, Muhammad Azam Sheikh
Lecture Notes in Computer Science. Vol. 7147, p. 214-225
Paper i proceeding
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
Artikel i vetenskaplig tidskrift
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
Artikel i vetenskaplig tidskrift
2012

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

Peter Damaschke, Leonid Molokov
Lecture Notes in Computer Science. Vol. 7292, p. 72-83
Paper i proceeding
2011

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

Peter Damaschke
Networks. Vol. 57 (4), p. 344-350
Artikel i vetenskaplig tidskrift
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
Paper i proceeding
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
Artikel i vetenskaplig tidskrift
2011

Parameterized reductions and algorithms for another vertex cover generalization

Peter Damaschke, Leonid Molokov
Lecture Notes in Computer Science. Vol. 6844, p. 279-289
Paper i proceeding
2011

Bounds for nonadaptive group tests to estimate the amount of defectives

Peter Damaschke, Muhammad Azam Sheikh
Discrete Mathematics, Algorithms and Applications. Vol. 3 (4), p. 517-536
Artikel i vetenskaplig tidskrift
2011

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

Peter Damaschke
Lecture Notes in Computer Science. Vol. 7112, p. 94-105
Paper i proceeding
2011

Even faster parameterized cluster deletion and cluster editing

Sebastian Böcker, Peter Damaschke
Information Processing Letters. Vol. 111 (14), p. 717-721
Artikel i vetenskaplig tidskrift
2010

Competitive group testing and learning hidden vertex covers with minimum adaptivity

Peter Damaschke, Muhammad Azam Sheikh
Discrete Mathematics, Algorithms and Applications. Vol. 2 (3), p. 291-311
Artikel i vetenskaplig tidskrift
2010

Bounds for nonadaptive group tests to estimate the amount of defectives

Peter Damaschke, Muhammad Azam Sheikh
Lecture Notes in Computer Science. Vol. 6509 (PART 2), p. 117-130
Paper i proceeding
2010

Homogeneous string segmentation using trees and weighted independent sets

Peter Damaschke
Algorithmica. Vol. 57 (4), p. 621-640
Artikel i vetenskaplig tidskrift
2010

Fixed-parameter enumerability of cluster editing and related problems

Peter Damaschke
Theory of Computing Systems. Vol. 46 (2), p. 261-283
Artikel i vetenskaplig tidskrift
2009

Competitive group testing and learning hidden vertex covers with minimum adaptivity

Peter Damaschke, Muhammad Azam Sheikh
Lecture Notes in Computer Science. Vol. 5699, p. 84-95
Paper i proceeding
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
Paper i proceeding
2009

Online search with time-varying price bounds

Peter Damaschke, Philippas Tsigas, Phuong Ha
Algorithmica. Vol. 55 (4), p. 619-642
Artikel i vetenskaplig tidskrift
2009

Multiple hypernode hitting sets and smallest two-cores with targets

Peter Damaschke
Journal of Combinatorial Optimization. Vol. 18 (3), p. 294-306
Artikel i vetenskaplig tidskrift
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
Paper i proceeding
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
Artikel i vetenskaplig tidskrift
2009

Ranking hypotheses to minimize the search cost in probabilistic inference models

Peter Damaschke
Discrete Applied Mathematics. Vol. 157, p. 1218-1228
Artikel i vetenskaplig tidskrift
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
Paper i proceeding
2008

Competitive search for longest empty intervals

Peter Damaschke
20th Annual Canadian Conference on Computational Geometry, CCCG 2008; Montreal, QC; Canada; 13 August 2008 through 15 August 2008, p. 219-222
Paper i proceeding
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
Paper i proceeding
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
Paper i proceeding
2007

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

Peter Damaschke
Lecture Notes in Computer Science. Vol. 4393, p. 332-343
Paper i proceeding
2007

Overlaps help: Improved bounds for group testing with interval queries

Peter Damaschke, Peter Damaschke, Libertad Tansini et al
Discrete Applied Mathematics. Vol. 155 (3), p. 288-299
Artikel i vetenskaplig tidskrift
2006

Threshold group testing

Peter Damaschke
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science. Vol. 4123, p. 707-718
Paper i proceeding
2006

Fast algorithms for finding disjoint subsequences with extremal densities

Peter Damaschke, Anders Bergkvist
Pattern Recognition. Vol. 39 (12), p. 2281-2292
Artikel i vetenskaplig tidskrift
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
Artikel i vetenskaplig tidskrift
2006

Multiple spin-block decisions

Peter Damaschke
Algorithmica. Vol. 44 (1), p. 33-48
Artikel i vetenskaplig tidskrift
2006

Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

Peter Damaschke
Theoretical Computer Science. Vol. 351 (3), p. 337-350
Artikel i vetenskaplig tidskrift
2006

Scheduling search procedures: The wheel of fortune

Peter Damaschke
Journal of Scheduling. Vol. 9 (6), p. 545-557
Artikel i vetenskaplig tidskrift
2006

Linear programs for hypotheses selection in probabilistic inference models

Anders Bergkvist, Peter Damaschke, Marcel Lüthi
Journal of Machine Learning Research. Vol. 7, p. 1339-1355
Artikel i vetenskaplig tidskrift
2006

Linear programs for hypotheses selection in probabilistic inference models

Peter Damaschke, Anders Bergkvist, Marcel Lüthi
Journal of Machine Learning Research. Vol. 7, p. 1339-1355
Artikel i vetenskaplig tidskrift
2006

Competitive Freshness Algorithms for Wait-free Data Objects

Peter Damaschke, Phuong Ha, Philippas Tsigas
Proceedings of the 12th European Conference on Parallel Computing (EURO-PAR '06), LNCS, Springer Verlag,. Vol. 4128, p. 811-820
Artikel i vetenskaplig tidskrift
2006

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

Peter Damaschke
Discrete Applied Mathematics. Vol. 154 (3), p. 478-484
Artikel i vetenskaplig tidskrift
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
Paper i proceeding
2005

One-Way Trading with Time-Varying Exchange Rate Bounds

Peter Damaschke, Phuong Ha, Philippas Tsigas
Rapport
2005

Threshold group testing (extended abstract)

Peter Damaschke
Electronic Notes in Discrete Mathematics. Vol. 21, p. 265-271
Artikel i vetenskaplig tidskrift
2005

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

Peter Damaschke, Peter Damaschke, Ugo Vaccaro
International Journal of Bioinformatics Research and Applications. Vol. 1 (4), p. 363-388
Artikel i vetenskaplig tidskrift
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
Paper i proceeding
2005

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

Peter Damaschke, Peter Damaschke, Ugo Vaccaro
Lecture Notes in Computer Science. Vol. 3515, p. 1029-1037
Paper i proceeding
2005

On queuing lengths in on-line switching

Peter Damaschke, Zhen Zhou
Theoretical Computer Science. Vol. 339 (2-3), p. 333-343
Artikel i vetenskaplig tidskrift
2005

Overlaps help: Improved bounds for group testing with interval queries

Peter Damaschke, Peter Damaschke, Libertad Tansini et al
11th International Computing and Combinatorics Conference COCOON 2005, Lecture Notes in Computer Science. Vol. 3595, p. 935-944
Paper i proceeding
2005

Competitive Freshness Algorithms for Wait-free Data Objects

Peter Damaschke, Phuong Ha, Philippas Tsigas
Rapport
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
Paper i proceeding
2004

Approximate location of relevant variables under the crossover distribution

Peter Damaschke
Discrete Applied Mathematics. Vol. 137 (1), p. 47-67
Artikel i vetenskaplig tidskrift
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
Paper i proceeding
2004

Scheduling search procedures

Peter Damaschke
Journal of Scheduling. Vol. 7 (5), p. 349-364
Artikel i vetenskaplig tidskrift
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
Paper i proceeding
2003

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

Peter Damaschke
Theoretical Computer Science. Vol. 302 (1), p. 35-44
Artikel i vetenskaplig tidskrift
2003

On parallel attribute-efficient learning

Peter Damaschke
Journal of Computer and System Sciences. Vol. 67 (1), p. 46-62
Artikel i vetenskaplig tidskrift
2003

Fast perfect phylogeny haplotype inference

Peter Damaschke
Lecture Notes in Computer Science. Vol. 2751, p. 183-194
Paper i proceeding
2003

Point placement on the line by distance data

Peter Damaschke
Discrete Applied Mathematics. Vol. 127 (1), p. 53-62
Artikel i vetenskaplig tidskrift
2003

Linear-time recognition of bipartite graphs plus two edges

Peter Damaschke
Discrete Mathematics. Vol. 262 (1-3), p. 99-112
Artikel i vetenskaplig tidskrift
2003

Powers of geometric intersection graphs and dispersion algorithms

Geir Agnarsson, Peter Damaschke, Magnus Halldorsson
Discrete Applied Mathematics. Vol. 132 (1-3), p. 3-16
Artikel i vetenskaplig tidskrift
2003

Distributed soft path coloring

Peter Damaschke
Lecture Notes in Computer Science. Vol. 2607, p. 523-534
Paper i proceeding
2002

Optimizing a mail-order with discount and shipping costs

Peter Damaschke
Information Processing Letters. Vol. 82 (2), p. 93-97
Artikel i vetenskaplig tidskrift
2002

Powers of geometric intersection graphs and dispersion algorithms

G. Agnarsson, Peter Damaschke, M. Halldórsson
Lecture Notes in Computer Science. Vol. 2368, p. 140-149
Paper i proceeding
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
Artikel i vetenskaplig tidskrift
2002

Scheduling Search Procedures

Peter Damaschke
Lecture Notes in Computer Science. Vol. 2380, p. 281-292
Paper i proceeding
2002

Online strategies for backups

Peter Damaschke
Theoretical Computer Science. Vol. 285 (1), p. 43-53
Artikel i vetenskaplig tidskrift
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
Paper i proceeding

Spara referenser

Om du har installerat Zotero eller Mendeley på din dator kan du direkt ta ut referenser från de publikationer du ser i listan.

Du laddar ner dessa pluginer här:
Zotero
Mendeley

Visar 2 forskningsprojekt

2012–2016

Informationsdriven säker Business Intelligence (DataBIN)

David Sands Programvaruteknik
Devdatt Dubhashi Datavetenskap
Peter Damaschke Datavetenskap
Gerardo Schneider Programvaruteknik
Olof Mogren Datavetenskap
Raul Pardo Jimenez Programvaruteknik
Hamid Ebadi Tavallaei Programvaruteknik
Fredrik Johansson Datavetenskap
Andrei Sabelfeld Programvaruteknik
Stiftelsen för Strategisk forskning (SSF)

2011–2013

Generaliserade och snabba sökstrategier för parameteriserade problem

Peter Damaschke Datavetenskap
Vetenskapsrådet (VR)

3 publikationer finns
Det kan finnas fler projekt där Peter Damaschke medverkar, men du måste vara inloggad som anställd på Chalmers för att kunna se dem.