Peter Damaschke
Showing 105 publications
Tandem duplication parameterized by the length difference
On an ordering problem in weighted hypergraphs
Distance-based solution of patrolling problems with individual waiting times
Dividing splittable goods evenly and with limited fragmentation
Two robots patrolling on a line: Integer version and approximability
Ordering a sparse graph to minimize the sum of right ends of edges
Enumerating grid layouts of graphs
Equitable induced decompositions of twin graphs
Branch-and-bound for the precedence constrained generalized traveling salesman problem
Parameterized mixed graph coloring
Optimal partial clique edge covering guided by potential energy minimization
Combinatorial search in two and more rounds
The solution space of sorting with recurring comparison faults
Saving probe bits by cube domination
An optimization problem related to Bloom filters with bit patterns
Finding defectives on a line by random docking and interval group tests
Refined algorithms for hitting many intervals
Calculating approximation guarantees for partial set cover of pairs
Dividing splittable goods evenly and with limited fragmentation
Computing giant graph diameters
Sufficient conditions for edit-optimal clusters
Adaptive group testing with a constrained number of positive responses improved
The solution space of sorting with recurring comparison faults
Summarizing online user reviews using bicliques
Deterministic versus randomized adaptive test cover
Randomized adaptive test cover
Parameterizations of hitting set of bundles and inverse scope
Finding and enumerating large intersections
Pairs covered by a sequence of sets
Strict group testing and the set basis problem
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
Cluster editing with locally bounded modifications revisited
Two new perspectives on multi-stage group testing
Fixed-parameter tractability of error correction in graphical linear systems
A toolbox for provably optimal multistage strict group testing strategies
Hypothesis-Driven Approaches to Multivariate Analysis of qPCR Data
Randomized group testing both query-optimal and minimal adaptive
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
A note on the parameterized complexity of unordered maximum tree orientation
Error propagation in sparse linear systems with peptide-protein incidence matrices
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
Optimal randomized group testing: A canonical form and the one-defective case
Parameterized reductions and algorithms for another vertex cover generalization
Bounds for nonadaptive group tests to estimate the amount of defectives
Even faster parameterized cluster deletion and cluster editing
Competitive group testing and learning hidden vertex covers with minimum adaptivity
Bounds for nonadaptive group tests to estimate the amount of defectives
Homogeneous string segmentation using trees and weighted independent sets
Fixed-parameter enumerability of cluster editing and related problems
Competitive group testing and learning hidden vertex covers with minimum adaptivity
Pareto complexity of two-parameter FPT problems: A case study for partial vertex cover
Online search with time-varying price bounds
Multiple hypernode hitting sets and smallest two-cores with targets
Bounded-degree techniques accelerate some parameterized graph algorithms
The union of minimal hitting sets: parameterized combinatorial bounds and counting
Ranking hypotheses to minimize the search cost in probabilistic inference models
Multiple hypernode hitting sets and smallest two-cores with targets
Competitive search for longest empty intervals
Minimum common string partition parameterized
Segmenting strings homogeneously via trees
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Overlaps help: Improved bounds for group testing with interval queries
Fast algorithms for finding disjoint subsequences with extremal densities
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Scheduling search procedures: The wheel of fortune
Linear programs for hypotheses selection in probabilistic inference models
Linear programs for hypotheses selection in probabilistic inference models
Competitive Freshness Algorithms for Wait-free Data Objects
Randomized vs. deterministic distance query strategies for point location on the line
Fixed-parameter tractable generalizations of cluster editing
One-Way Trading with Time-Varying Exchange Rate Bounds
Threshold group testing (extended abstract)
On the fixed-parameter enumerability of cluster editing
On queuing lengths in on-line switching
Overlaps help: Improved bounds for group testing with interval queries
Competitive Freshness Algorithms for Wait-free Data Objects
Fast algorithms for finding disjoint subsequences with extremal densities
Approximate location of relevant variables under the crossover distribution
Incremental haplotype inference, phylogeny, and almost bipartite graphs
Paremeterized enumeration, transversals, and imperfect phylogeny reconstruction
Nearly optimal strategies for special cases of on-line capital investment
On parallel attribute-efficient learning
Fast perfect phylogeny haplotype inference
Point placement on the line by distance data
Linear-time recognition of bipartite graphs plus two edges
Powers of geometric intersection graphs and dispersion algorithms
Distributed soft path coloring
Optimizing a mail-order with discount and shipping costs
Powers of geometric intersection graphs and dispersion algorithms
Two short notes on the on-line traveling salesman: handling times and lookahead
Worst-case bounds for blind broadcasting in small-degree networks
Download publication list
You can download this list to your computer.
Filter and download publication list
As logged in user (Chalmers employee) you find more export functions in MyResearch.
You may also import these directly to Zotero or Mendeley by using a browser plugin. These are found herer:
Zotero Connector
Mendeley Web Importer
The service SwePub offers export of contents from Research in other formats, such as Harvard and Oxford in .RIS, BibTex and RefWorks format.
Showing 2 research projects
Data-Driven Secure Business Intelligence (DataBIN)
Generalized and fast search strategies for parameterized problems