Peter Damaschke
My research interests include: Graph Theory, Combinatorial Search (and testing), various forms of Algorithms, Discrete Optimization. I am also a scientific advisor at the Fraunhofer-Chalmers Research Centre for Industrial Mathematics.
Showing 108 publications
On central placements of new vertices in a planar point set<i> </i>
Branch and bound for the fixed-shape unequal area facility layout problem
A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques
Tandem duplication parameterized by the length difference
Distance-based solution of patrolling problems with individual waiting times
On an ordering problem in weighted hypergraphs
Branch-and-bound for the precedence constrained generalized traveling salesman problem
Ordering a sparse graph to minimize the sum of right ends of edges
Two robots patrolling on a line: Integer version and approximability
Enumerating grid layouts of graphs
Dividing splittable goods evenly and with limited fragmentation
Equitable induced decompositions of twin graphs
Parameterized mixed graph coloring
Combinatorial search in two and more rounds
Optimal partial clique edge covering guided by potential energy minimization
The solution space of sorting with recurring comparison faults
An optimization problem related to Bloom filters with bit patterns
Saving probe bits by cube domination
Calculating approximation guarantees for partial set cover of pairs
Refined algorithms for hitting many intervals
Dividing splittable goods evenly and with limited fragmentation
Finding defectives on a line by random docking and interval group tests
Sufficient conditions for edit-optimal clusters
Computing giant graph diameters
Adaptive group testing with a constrained number of positive responses improved
The solution space of sorting with recurring comparison faults
Deterministic versus randomized adaptive test cover
Summarizing online user reviews using bicliques
Parameterizations of hitting set of bundles and inverse scope
Pairs covered by a sequence of sets
Randomized adaptive test cover
Finding and enumerating large intersections
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
Strict group testing and the set basis problem
Two new perspectives on multi-stage group testing
A toolbox for provably optimal multistage strict group testing strategies
Hypothesis-Driven Approaches to Multivariate Analysis of qPCR Data
Cluster editing with locally bounded modifications revisited
Fixed-parameter tractability of error correction in graphical linear systems
Error propagation in sparse linear systems with peptide-protein incidence matrices
A note on the parameterized complexity of unordered maximum tree orientation
Randomized group testing both query-optimal and minimal adaptive
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
Parameterized reductions and algorithms for another vertex cover generalization
Optimal randomized group testing: A canonical form and the one-defective case
Even faster parameterized cluster deletion and cluster editing
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
Bounds for nonadaptive group tests to estimate the amount of defectives
Competitive group testing and learning hidden vertex covers with minimum adaptivity
Bounds for nonadaptive group tests to estimate the amount of defectives
Fixed-parameter enumerability of cluster editing and related problems
Homogeneous string segmentation using trees and weighted independent sets
Competitive group testing and learning hidden vertex covers with minimum adaptivity
The union of minimal hitting sets: parameterized combinatorial bounds and counting
Multiple hypernode hitting sets and smallest two-cores with targets
Bounded-degree techniques accelerate some parameterized graph algorithms
Ranking hypotheses to minimize the search cost in probabilistic inference models
Pareto complexity of two-parameter FPT problems: A case study for partial vertex cover
Online search with time-varying price bounds
Competitive search for longest empty intervals
Minimum common string partition parameterized
Multiple hypernode hitting sets and smallest two-cores with targets
Overlaps help: Improved bounds for group testing with interval queries
Segmenting strings homogeneously via trees
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Fast algorithms for finding disjoint subsequences with extremal densities
Fixed-parameter tractable generalizations of cluster editing
Scheduling search procedures: The wheel of fortune
Competitive Freshness Algorithms for Wait-free Data Objects
Linear programs for hypotheses selection in probabilistic inference models
Randomized vs. deterministic distance query strategies for point location on the line
Linear programs for hypotheses selection in probabilistic inference models
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Competitive Freshness Algorithms for Wait-free Data Objects
Threshold group testing (extended abstract)
On the fixed-parameter enumerability of cluster editing
On queuing lengths in on-line switching
Fast algorithms for finding disjoint subsequences with extremal densities
Overlaps help: Improved bounds for group testing with interval queries
One-Way Trading with Time-Varying Exchange Rate Bounds
Approximate location of relevant variables under the crossover distribution
Incremental haplotype inference, phylogeny, and almost bipartite graphs
Paremeterized enumeration, transversals, and imperfect phylogeny reconstruction
Linear-time recognition of bipartite graphs plus two edges
Powers of geometric intersection graphs and dispersion algorithms
On parallel attribute-efficient learning
Point placement on the line by distance data
Fast perfect phylogeny haplotype inference
Distributed soft path coloring
Nearly optimal strategies for special cases of on-line capital investment
Optimizing a mail-order with discount and shipping costs
Two short notes on the on-line traveling salesman: handling times and lookahead
Powers of geometric intersection graphs and dispersion algorithms
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