Peter Damaschke

ORCID

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 26

Top Venues

FernUniv. Hagen (PHD)

Education History

FernUniv. Hagen

PHD

Publications

Peter Damaschke
Tandem Duplication Parameterized by the Length Difference. PSC (2023)
Peter Damaschke
On an Ordering Problem in Weighted Hypergraphs. IWOCA (2021)
Peter Damaschke
Distance-Based Solution of Patrolling Problems with Individual Waiting Times. ATMOS (2021)
Raad Salman, Fredrik Ekstedt, Peter Damaschke
Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem. Oper. Res. Lett. 48 (2) (2020)
Peter Damaschke
Two Robots Patrolling on a Line: Integer Version and Approximability. IWOCA (2020)
Raad Salman, Fredrik Ekstedt, Peter Damaschke
Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem. SOCS (2020)
Peter Damaschke
Enumerating Grid Layouts of Graphs. J. Graph Algorithms Appl. 24 (3) (2020)
Peter Damaschke
Equitable induced decompositions of twin graphs. Australas. J Comb. 76 (2020)
Peter Damaschke
Dividing Splittable Goods Evenly and With Limited Fragmentation. Algorithmica 82 (5) (2020)
Peter Damaschke
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges. IWOCA (2020)
Peter Damaschke
Optimal partial clique edge covering guided by potential energy minimization. Optim. Lett. 13 (7) (2019)
Peter Damaschke
Parameterized Mixed Graph Coloring. J. Comb. Optim. 38 (2) (2019)
Peter Damaschke
Combinatorial search in two and more rounds. Theor. Comput. Sci. 780 (2019)
Peter Damaschke
Saving Probe Bits by Cube Domination. WG (2018)
Peter Damaschke, Alexander Schliep
An Optimization Problem Related to Bloom Filters with Bit Patterns. SOFSEM (2018)
Peter Damaschke
The Solution Space of Sorting with Recurring Comparison Faults. Theory Comput. Syst. 62 (6) (2018)
Peter Damaschke
Dividing Splittable Goods Evenly and With Limited Fragmentation. MFCS (2017)
Peter Damaschke
Refined algorithms for hitting many intervals. Inf. Process. Lett. 118 (2017)
Peter Damaschke
Calculating approximation guarantees for partial set cover of pairs. Optim. Lett. 11 (7) (2017)
Peter Damaschke
Finding defectives on a line by random docking and interval group tests. Discret. Math. Algorithms Appl. 9 (3) (2017)
Azam Sheikh Muhammad, Peter Damaschke, Olof Mogren
Summarizing Online User Reviews Using Bicliques. SOFSEM (2016)
Peter Damaschke
Sufficient conditions for edit-optimal clusters. Inf. Process. Lett. 116 (4) (2016)
Peter Damaschke
Deterministic versus randomized adaptive test cover. Theor. Comput. Sci. 653 (2016)
Peter Damaschke
Computing Giant Graph Diameters. IWOCA (2016)
Peter Damaschke
The Solution Space of Sorting with Recurring Comparison Faults. IWOCA (2016)
Peter Damaschke
Adaptive group testing with a constrained number of positive responses improved. Discret. Appl. Math. 205 (2016)
Peter Damaschke
Randomized Adaptive Test Cover. CIAC (2015)
Peter Damaschke
Parameterizations of hitting set of bundles and inverse scope. J. Comb. Optim. 29 (4) (2015)
Peter Damaschke
Finding and enumerating large intersections. Theor. Comput. Sci. 580 (2015)
Peter Damaschke
Pairs Covered by a Sequence of Sets. FCT (2015)
Peter Damaschke, Olof Mogren
Editing the Simplest Graphs. WALCOM (2014)
Peter Damaschke
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences. Inf. Process. Lett. 114 (6) (2014)
Peter Damaschke, Olof Mogren
Editing Simple Graphs. J. Graph Algorithms Appl. 18 (4) (2014)
Peter Damaschke, Azam Sheikh Muhammad, Gábor Wiener
Strict group testing and the set basis problem. J. Comb. Theory, Ser. A 126 (2014)
Peter Damaschke
Cluster Editing with Locally Bounded Modifications Revisited. IWOCA (2013)
Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch
Two New Perspectives on Multi-Stage Group Testing. Algorithmica 67 (3) (2013)
Peter Damaschke
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing. Theor. Comput. Sci. 511 (2013)
Peter Damaschke, Azam Sheikh Muhammad
A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies. COCOON (2013)
Peter Damaschke, Ömer Egecioglu, Leonid Molokov
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. WALCOM (2013)
Peter Damaschke, Leonid Molokov
Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices. ISBRA (2012)
Peter Damaschke, Azam Sheikh Muhammad
Randomized Group Testing Both Query-Optimal and Minimal Adaptive. SOFSEM (2012)
Sebastian Böcker, Peter Damaschke
A note on the parameterized complexity of unordered maximum tree orientation. Discret. Appl. Math. 160 (10-11) (2012)
Peter Damaschke, Leonid Molokov
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover. Theor. Comput. Sci. 452 (2012)
Peter Damaschke, Azam Sheikh Muhammad
Bounds for Nonadaptive Group Tests to estimate the Amount of Defectives. Discret. Math. Algorithms Appl. 3 (4) (2011)
Peter Damaschke
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries. Networks 57 (4) (2011)
Sebastian Böcker, Peter Damaschke
Even faster parameterized cluster deletion and cluster editing. Inf. Process. Lett. 111 (14) (2011)
Peter Damaschke, Leonid Molokov
Parameterized Reductions and Algorithms for Another Vertex Cover Generalization. WADS (2011)
Peter Damaschke
Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing. IPEC (2011)
Peter Damaschke
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover. Discret. Optim. 8 (1) (2011)
Peter Damaschke, Azam Sheikh Muhammad
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives. COCOA (2) (2010)
Peter Damaschke
Fixed-Parameter Enumerability of Cluster Editing and Related Problems. Theory Comput. Syst. 46 (2) (2010)
Peter Damaschke
Homogeneous String Segmentation using Trees and Weighted Independent Sets. Algorithmica 57 (4) (2010)
Peter Damaschke, Azam Sheikh Muhammad
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. Discret. Math. Algorithms Appl. 2 (3) (2010)
Peter Damaschke
Multiple hypernode hitting sets and smallest two-cores with targets. J. Comb. Optim. 18 (3) (2009)
Peter Damaschke, Leonid Molokov
The union of minimal hitting sets: Parameterized combinatorial bounds and counting. J. Discrete Algorithms 7 (4) (2009)
Peter Damaschke
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. IWPEC (2009)
Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas
Online Search with Time-Varying Price Bounds. Algorithmica 55 (4) (2009)
Peter Damaschke
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. IWPEC (2009)
Peter Damaschke
Ranking hypotheses to minimize the search cost in probabilistic inference models. Discret. Appl. Math. 157 (6) (2009)
Peter Damaschke, Azam Sheikh Muhammad
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. FCT (2009)
Peter Damaschke
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets. COCOA (2008)
Peter Damaschke
Minimum Common String Partition Parameterized. WABI (2008)
Peter Damaschke
Competitive Search for Longest Empty Intervals. CCCG (2008)
Peter Damaschke
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. STACS (2007)
Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
Overlaps help: Improved bounds for group testing with interval queries. Discret. Appl. Math. 155 (3) (2007)
Peter Damaschke
Segmenting Strings Homogeneously Via Trees. WG (2007)
Peter Damaschke
Randomized vs. deterministic distance query strategies for point location on the line. Discret. Appl. Math. 154 (3) (2006)
Peter Damaschke
Multiple Spin-Block Decisions. Algorithmica 44 (1) (2006)
Peter Damaschke
Threshold Group Testing. GTIT-C (2006)
Peter Damaschke
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. Inf. Process. Lett. 100 (2) (2006)
Anders Bergkvist, Peter Damaschke, Marcel Lüthi
Linear Programs for Hypotheses Selection in Probabilistic Inference Models. J. Mach. Learn. Res. 7 (2006)
Peter Damaschke
Scheduling search procedures: The wheel of fortune. J. Sched. 9 (6) (2006)
Anders Bergkvist, Peter Damaschke
Fast algorithms for finding disjoint subsequences with extremal densities. Pattern Recognit. 39 (12) (2006)
Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas
Competitive Freshness Algorithms for Wait-Free Data Objects. Euro-Par (2006)
Peter Damaschke
Fixed-Parameter Tractable Generalizations of Cluster Editing. CIAC (2006)
Peter Damaschke
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. 351 (3) (2006)
Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro
Optimal group testing algorithms with interval queries and their application to splice site detection. Int. J. Bioinform. Res. Appl. 1 (4) (2005)
Peter Damaschke
Threshold Group Testing. Electron. Notes Discret. Math. 21 (2005)
Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro
Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. International Conference on Computational Science (2) (2005)
Anders Bergkvist, Peter Damaschke
Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. ISAAC (2005)
Peter Damaschke
On the Fixed-Parameter Enumerability of Cluster Editing. WG (2005)
Peter Damaschke, Zhen Zhou
On queuing lengths in on-line switching. Theor. Comput. Sci. 339 (2-3) (2005)
Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
Overlaps Help: Improved Bounds for Group Testing with Interval Queries. COCOON (2005)
Peter Damaschke
Scheduling Search Procedures. J. Sched. 7 (5) (2004)
Peter Damaschke
Approximate location of relevant variables under the crossover distribution. Discret. Appl. Math. 137 (1) (2004)
Peter Damaschke
Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. IWPEC (2004)
Peter Damaschke
Nearly optimal strategies for special cases of on-line capital investment. Theor. Comput. Sci. 302 (1-3) (2003)
Peter Damaschke
Point placement on the line by distance data. Discret. Appl. Math. 127 (1) (2003)
Peter Damaschke
Distributed Soft Path Coloring. STACS (2003)
Peter Damaschke
Linear-time recognition of bipartite graphs plus two edges. Discret. Math. 262 (1-3) (2003)
Peter Damaschke
On parallel attribute-efficient learning. J. Comput. Syst. Sci. 67 (1) (2003)
Peter Damaschke
Fast Perfect Phylogeny Haplotype Inference. FCT (2003)
Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
Powers of geometric intersection graphs and dispersion algorithms. Discret. Appl. Math. 132 (1-3) (2003)
Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
Powers of Geometric Intersection Graphs and Dispersion Algorithms. SWAT (2002)
Peter Damaschke
Two short notes on the on-line travelling salesman: handling times and lookahead. Theor. Comput. Sci. 289 (1) (2002)
Peter Damaschke
Optimizing a mail-order with discount and shipping costs. Inf. Process. Lett. 82 (2) (2002)
Peter Damaschke
Scheduling Search Procedures. ICALP (2002)
Peter Damaschke
Online strategies for backups. Theor. Comput. Sci. 285 (1) (2002)
Peter Damaschke
Minus domination in small-degree graphs. Discret. Appl. Math. 108 (1-2) (2001)
Peter Damaschke
Approximate Location of Relevant Variables under the Crossover Distribution. SAGA (2001)

Peter Damaschke.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Damaschke