Peter Damaschke

Orcid: 0000-0003-4047-7594

According to our database1, Peter Damaschke authored at least 118 papers between 1989 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Tandem Duplication Parameterized by the Length Difference.
Proceedings of the Prague Stringology Conference 2023, 2023

2021
On an Ordering Problem in Weighted Hypergraphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Distance-Based Solution of Patrolling Problems with Individual Waiting Times.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem.
Oper. Res. Lett., 2020

Enumerating Grid Layouts of Graphs.
J. Graph Algorithms Appl., 2020

Dividing Splittable Goods Evenly and With Limited Fragmentation.
Algorithmica, 2020

Equitable induced decompositions of twin graphs.
Australas. J Comb., 2020

Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Two Robots Patrolling on a Line: Integer Version and Approximability.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
Combinatorial search in two and more rounds.
Theor. Comput. Sci., 2019

Optimal partial clique edge covering guided by potential energy minimization.
Optim. Lett., 2019

Parameterized Mixed Graph Coloring.
J. Comb. Optim., 2019

2018
The Solution Space of Sorting with Recurring Comparison Faults.
Theory Comput. Syst., 2018

Saving Probe Bits by Cube Domination.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

An Optimization Problem Related to Bloom Filters with Bit Patterns.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017
Calculating approximation guarantees for partial set cover of pairs.
Optim. Lett., 2017

Refined algorithms for hitting many intervals.
Inf. Process. Lett., 2017

Finding defectives on a line by random docking and interval group tests.
Discret. Math. Algorithms Appl., 2017

2016
Deterministic versus randomized adaptive test cover.
Theor. Comput. Sci., 2016

Sufficient conditions for edit-optimal clusters.
Inf. Process. Lett., 2016

Adaptive group testing with a constrained number of positive responses improved.
Discret. Appl. Math., 2016

Summarizing Online User Reviews Using Bicliques.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Computing Giant Graph Diameters.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015
Finding and enumerating large intersections.
Theor. Comput. Sci., 2015

Parameterizations of hitting set of bundles and inverse scope.
J. Comb. Optim., 2015

Pairs Covered by a Sequence of Sets.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Randomized Adaptive Test Cover.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014
Editing Simple Graphs.
J. Graph Algorithms Appl., 2014

Strict group testing and the set basis problem.
J. Comb. Theory A, 2014

Enumerating maximal bicliques in bipartite graphs with favorable degree sequences.
Inf. Process. Lett., 2014

Editing the Simplest Graphs.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing.
Theor. Comput. Sci., 2013

Two New Perspectives on Multi-Stage Group Testing.
Algorithmica, 2013

Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Cluster Editing with Locally Bounded Modifications Revisited.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover.
Theor. Comput. Sci., 2012

A note on the parameterized complexity of unordered maximum tree orientation.
Discret. Appl. Math., 2012

Randomized Group Testing Both Query-Optimal and Minimal Adaptive.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

2011
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries.
Networks, 2011

Even faster parameterized cluster deletion and cluster editing.
Inf. Process. Lett., 2011

Bounds for Nonadaptive Group Tests to estimate the Amount of Defectives.
Discret. Math. Algorithms Appl., 2011

Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover.
Discret. Optim., 2011

Parameterized Reductions and Algorithms for Another Vertex Cover Generalization.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

2010
Fixed-Parameter Enumerability of Cluster Editing and Related Problems.
Theory Comput. Syst., 2010

Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity.
Discret. Math. Algorithms Appl., 2010

Homogeneous String Segmentation using Trees and Weighted Independent Sets.
Algorithmica, 2010

2009
The union of minimal hitting sets: Parameterized combinatorial bounds and counting.
J. Discrete Algorithms, 2009

Multiple hypernode hitting sets and smallest two-cores with targets.
J. Comb. Optim., 2009

Ranking hypotheses to minimize the search cost in probabilistic inference models.
Discret. Appl. Math., 2009

Online Search with Time-Varying Price Bounds.
Algorithmica, 2009

Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008
Minimum Common String Partition Parameterized.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Competitive Search for Longest Empty Intervals.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Overlaps help: Improved bounds for group testing with interval queries.
Discret. Appl. Math., 2007

Segmenting Strings Homogeneously Via Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.
Proceedings of the STACS 2007, 2007

2006
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction.
Theor. Comput. Sci., 2006

Scheduling search procedures: The wheel of fortune.
J. Sched., 2006

Fast algorithms for finding disjoint subsequences with extremal densities.
Pattern Recognit., 2006

Linear Programs for Hypotheses Selection in Probabilistic Inference Models.
J. Mach. Learn. Res., 2006

A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs.
Inf. Process. Lett., 2006

Randomized vs. deterministic distance query strategies for point location on the line.
Discret. Appl. Math., 2006

Multiple Spin-Block Decisions.
Algorithmica, 2006

Competitive Freshness Algorithms for Wait-Free Data Objects.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

Fixed-Parameter Tractable Generalizations of Cluster Editing.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
On queuing lengths in on-line switching.
Theor. Comput. Sci., 2005

Optimal group testing algorithms with interval queries and their application to splice site detection.
Int. J. Bioinform. Res. Appl., 2005

Threshold Group Testing.
Electron. Notes Discret. Math., 2005

On the Fixed-Parameter Enumerability of Cluster Editing.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection.
Proceedings of the Computational Science, 2005

2004
Scheduling Search Procedures.
J. Sched., 2004

Approximate location of relevant variables under the crossover distribution.
Discret. Appl. Math., 2004

2003
Nearly optimal strategies for special cases of on-line capital investment.
Theor. Comput. Sci., 2003

On parallel attribute-efficient learning.
J. Comput. Syst. Sci., 2003

Linear-time recognition of bipartite graphs plus two edges.
Discret. Math., 2003

Point placement on the line by distance data.
Discret. Appl. Math., 2003

Powers of geometric intersection graphs and dispersion algorithms.
Discret. Appl. Math., 2003

Distributed Soft Path Coloring.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Fast Perfect Phylogeny Haplotype Inference.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
Two short notes on the on-line travelling salesman: handling times and lookahead.
Theor. Comput. Sci., 2002

Online strategies for backups.
Theor. Comput. Sci., 2002

Optimizing a mail-order with discount and shipping costs.
Inf. Process. Lett., 2002

2001
Minus domination in small-degree graphs.
Discret. Appl. Math., 2001

Worst-case bounds for blind broadcasting in small-degree networks.
Proceedings of the SIROCCO 8, 2001

2000
Adaptive Versus Nonadaptive Attribute-Efficient Learning.
Mach. Learn., 2000

Degree-preserving spanning trees in small-degree graphs.
Discret. Math., 2000

Efficient Dispersion Algorithms for Geometric Intersection Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Parallel Attribute-Efficient Learning of Monotone Boolean Functions.
Proceedings of the Algorithm Theory, 2000

1998
Randomized Group Testing for Mutually Obscuring Defectives.
Inf. Process. Lett., 1998

A Chip Search Problem on Binary Numbers.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Delayed Correction - Binary Search with Errors Made Very Simple but Efficient.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

Computational Aspects of Parallel Attribute-Efficient Learning.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
An Optimal Parallel Algorithm for Digital Curve Segmentation.
Theor. Comput. Sci., 1997

Finding a Pair on a Mesh with Multiple Broadcasting is Hard.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

The Algorithmic Complexity of Chemical Threshold Testing.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses.
Proceedings of IPPS '96, 1996

1995
The linear time recognition of digital arcs.
Pattern Recognit. Lett., 1995

A Parallel Algorithm for Nearly Optimal Edge Search.
Inf. Process. Lett., 1995

Searching for Faulty Leaves in Binary Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Line Segmentation of Digital Curves in Parallel.
Proceedings of the STACS 95, 1995

Searching for a Monotone Function by Independent Threshold Queries.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search.
Proceedings of the Algorithms, 1995

1994
Dominating cliques in chordal graphs.
Discret. Math., 1994

PLA Folding in Special Graph Classes.
Discret. Appl. Math., 1994

A Tight Upper Bound for Group Testing in Graphs.
Discret. Appl. Math., 1994

The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs.
Discret. Appl. Math., 1994

Berechnungskomplexität der Erkennung der semantischen Unabhängigkeit von Relationen.
PhD thesis, 1994

1993
Paths in interval graphs and circular arc graphs.
Discret. Math., 1993

1992
Distances in cocomparability graphs and their powers.
Discret. Appl. Math., 1992

1991
Irredundance number versus domination number.
Discret. Math., 1991

Logic Arrays for Interval Indicator Functions.
Proceedings of the 17th International Workshop, 1991

1990
Induced subgraphs and well-quasi-ordering.
J. Graph Theory, 1990

Domination in Convex and Chordal Bipartite Graphs.
Inf. Process. Lett., 1990

Induced Subgraph Isomorphism for Cographs in NP-Complete.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

1989
The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete.
Inf. Process. Lett., 1989


  Loading...