Peter Damaschke

139 papers A* 2A 4B 26C 13Misc 4Journal 75Unranked 14

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Branch and bound for the fixed-shape unequal area facility layout problem. Comput. Ind. Eng. Fredrik Ekstedt, Raad Salman, Peter Damaschke
2025	J	`jnl`	On central placements of new vertices in a planar point set. Theor. Comput. Sci. Peter Damaschke, Fredrik Ekstedt, Raad Salman
2024	J	`jnl`	A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques. J. Graph Algorithms Appl. Peter Damaschke
2023	Misc	`conf`	Tandem Duplication Parameterized by the Length Difference. PSC Peter Damaschke
2021	C	`conf`	Distance-Based Solution of Patrolling Problems with Individual Waiting Times. ATMOS Peter Damaschke
2021	C	`conf`	On an Ordering Problem in Weighted Hypergraphs. IWOCA Peter Damaschke
2020	B	`conf`	Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem. SOCS Raad Salman, Fredrik Ekstedt, Peter Damaschke
2020	J	`jnl`	Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem. Oper. Res. Lett. Raad Salman, Fredrik Ekstedt, Peter Damaschke
2020	J	`jnl`	Dividing Splittable Goods Evenly and With Limited Fragmentation. Algorithmica Peter Damaschke
2020	J	`jnl`	Enumerating Grid Layouts of Graphs. J. Graph Algorithms Appl. Peter Damaschke
2020	J	`jnl`	Equitable induced decompositions of twin graphs. Australas. J Comb. Peter Damaschke
2020	C	`conf`	Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges. IWOCA Peter Damaschke
2020	C	`conf`	Two Robots Patrolling on a Line: Integer Version and Approximability. IWOCA Peter Damaschke
2019	J	`jnl`	Combinatorial search in two and more rounds. Theor. Comput. Sci. Peter Damaschke
2019	J	`jnl`	Optimal partial clique edge covering guided by potential energy minimization. Optim. Lett. Peter Damaschke
2019	J	`jnl`	Parameterized Mixed Graph Coloring. J. Comb. Optim. Peter Damaschke
2018	B	`conf`	An Optimization Problem Related to Bloom Filters with Bit Patterns. SOFSEM Peter Damaschke, Alexander Schliep
2018	B	`conf`	Saving Probe Bits by Cube Domination. WG Peter Damaschke
2018	J	`jnl`	The Solution Space of Sorting with Recurring Comparison Faults. Theory Comput. Syst. Peter Damaschke
2017	J	`jnl`	Calculating approximation guarantees for partial set cover of pairs. Optim. Lett. Peter Damaschke
2017	B	`conf`	Dividing Splittable Goods Evenly and With Limited Fragmentation. MFCS Peter Damaschke
2017	J	`jnl`	Finding defectives on a line by random docking and interval group tests. Discret. Math. Algorithms Appl. Peter Damaschke
2017	J	`jnl`	Refined algorithms for hitting many intervals. Inf. Process. Lett. Peter Damaschke
2016	J	`jnl`	Adaptive group testing with a constrained number of positive responses improved. Discret. Appl. Math. Peter Damaschke
2016	C	`conf`	Computing Giant Graph Diameters. IWOCA Peter Damaschke
2016	J	`jnl`	Deterministic versus randomized adaptive test cover. Theor. Comput. Sci. Peter Damaschke
2016	J	`jnl`	Sufficient conditions for edit-optimal clusters. Inf. Process. Lett. Peter Damaschke
2016	B	`conf`	Summarizing Online User Reviews Using Bicliques. SOFSEM Azam Sheikh Muhammad, Peter Damaschke, Olof Mogren
2016	C	`conf`	The Solution Space of Sorting with Recurring Comparison Faults. IWOCA Peter Damaschke
2015	J	`jnl`	Finding and enumerating large intersections. Theor. Comput. Sci. Peter Damaschke
2015	B	`conf`	Pairs Covered by a Sequence of Sets. FCT Peter Damaschke
2015	J	`jnl`	Parameterizations of hitting set of bundles and inverse scope. J. Comb. Optim. Peter Damaschke
2015	C	`conf`	Randomized Adaptive Test Cover. CIAC Peter Damaschke
2014	J	`jnl`	Editing Simple Graphs. J. Graph Algorithms Appl. Peter Damaschke, Olof Mogren
2014	B	`conf`	Editing the Simplest Graphs. WALCOM Peter Damaschke, Olof Mogren
2014	J	`jnl`	Enumerating maximal bicliques in bipartite graphs with favorable degree sequences. Inf. Process. Lett. Peter Damaschke
2014	J	`jnl`	Strict group testing and the set basis problem. J. Comb. Theory A Peter Damaschke, Azam Sheikh Muhammad, Gábor Wiener
2013	Misc	`conf`	A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies. COCOON Peter Damaschke, Azam Sheikh Muhammad
2013	C	`conf`	Cluster Editing with Locally Bounded Modifications Revisited. IWOCA Peter Damaschke
2013	B	`conf`	Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. WALCOM Peter Damaschke, Ömer Egecioglu, Leonid Molokov
2013	J	`jnl`	Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing. Theor. Comput. Sci. Peter Damaschke
2013	J	`jnl`	Two New Perspectives on Multi-Stage Group Testing. Algorithmica Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch
2012	J	`jnl`	A note on the parameterized complexity of unordered maximum tree orientation. Discret. Appl. Math. Sebastian Böcker, Peter Damaschke
2012	—	`conf`	Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices. ISBRA Peter Damaschke, Leonid Molokov
2012	J	`jnl`	Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover. Theor. Comput. Sci. Peter Damaschke, Leonid Molokov
2012	B	`conf`	Randomized Group Testing Both Query-Optimal and Minimal Adaptive. SOFSEM Peter Damaschke, Azam Sheikh Muhammad
2011	J	`jnl`	Bounds for Nonadaptive Group Tests to estimate the Amount of Defectives. Discret. Math. Algorithms Appl. Peter Damaschke, Azam Sheikh Muhammad
2011	J	`jnl`	Even faster parameterized cluster deletion and cluster editing. Inf. Process. Lett. Sebastian Böcker, Peter Damaschke
2011	J	`jnl`	Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries. Networks Peter Damaschke
2011	B	`conf`	Parameterized Reductions and Algorithms for Another Vertex Cover Generalization. WADS Peter Damaschke, Leonid Molokov
2011	J	`jnl`	Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover. Discret. Optim. Peter Damaschke
2011	B	`conf`	Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing. IPEC Peter Damaschke
2010	—	`conf`	Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives. COCOA (2) Peter Damaschke, Azam Sheikh Muhammad
2010	J	`jnl`	Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. Discret. Math. Algorithms Appl. Peter Damaschke, Azam Sheikh Muhammad
2010	J	`jnl`	Fixed-Parameter Enumerability of Cluster Editing and Related Problems. Theory Comput. Syst. Peter Damaschke
2010	J	`jnl`	Homogeneous String Segmentation using Trees and Weighted Independent Sets. Algorithmica Peter Damaschke
2009	—	`conf`	Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. IWPEC Peter Damaschke
2009	B	`conf`	Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. FCT Peter Damaschke, Azam Sheikh Muhammad
2009	J	`jnl`	Multiple hypernode hitting sets and smallest two-cores with targets. J. Comb. Optim. Peter Damaschke
2009	J	`jnl`	Online Search with Time-Varying Price Bounds. Algorithmica Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas
2009	—	`conf`	Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. IWPEC Peter Damaschke
2009	J	`jnl`	Ranking hypotheses to minimize the search cost in probabilistic inference models. Discret. Appl. Math. Peter Damaschke
2009	J	`jnl`	The union of minimal hitting sets: Parameterized combinatorial bounds and counting. J. Discrete Algorithms Peter Damaschke, Leonid Molokov
2008	—	`conf`	Competitive Search for Longest Empty Intervals. CCCG Peter Damaschke
2008	C	`conf`	Minimum Common String Partition Parameterized. WABI Peter Damaschke
2008	C	`conf`	Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets. COCOA Peter Damaschke
2007	J	`jnl`	Overlaps help: Improved bounds for group testing with interval queries. Discret. Appl. Math. Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
2007	B	`conf`	Segmenting Strings Homogeneously Via Trees. WG Peter Damaschke
2007	A	`conf`	The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. STACS Peter Damaschke
2006	J	`jnl`	A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. Inf. Process. Lett. Peter Damaschke
2006	—	`conf`	Competitive Freshness Algorithms for Wait-Free Data Objects. Euro-Par Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas
2006	J	`jnl`	Fast algorithms for finding disjoint subsequences with extremal densities. Pattern Recognit. Anders Bergkvist, Peter Damaschke
2006	C	`conf`	Fixed-Parameter Tractable Generalizations of Cluster Editing. CIAC Peter Damaschke
2006	J	`jnl`	Linear Programs for Hypotheses Selection in Probabilistic Inference Models. J. Mach. Learn. Res. Anders Bergkvist, Peter Damaschke, Marcel Lüthi
2006	J	`jnl`	Multiple Spin-Block Decisions. Algorithmica Peter Damaschke
2006	J	`jnl`	Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. Peter Damaschke
2006	J	`jnl`	Randomized vs. deterministic distance query strategies for point location on the line. Discret. Appl. Math. Peter Damaschke
2006	J	`jnl`	Scheduling search procedures: The wheel of fortune. J. Sched. Peter Damaschke
2006	—	`conf`	Threshold Group Testing. GTIT-C Peter Damaschke
2005	B	`conf`	Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. ISAAC Anders Bergkvist, Peter Damaschke
2005	J	`jnl`	On queuing lengths in on-line switching. Theor. Comput. Sci. Peter Damaschke, Zhen Zhou
2005	B	`conf`	On the Fixed-Parameter Enumerability of Cluster Editing. WG Peter Damaschke
2005	Misc	`conf`	Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. International Conference on Computational Science (2) Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro
2005	J	`jnl`	Optimal group testing algorithms with interval queries and their application to splice site detection. Int. J. Bioinform. Res. Appl. Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro
2005	Misc	`conf`	Overlaps Help: Improved Bounds for Group Testing with Interval Queries. COCOON Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
2005	J	`jnl`	Threshold Group Testing. Electron. Notes Discret. Math. Peter Damaschke
2004	J	`jnl`	Approximate location of relevant variables under the crossover distribution. Discret. Appl. Math. Peter Damaschke
2004	—	`conf`	Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. IWPEC Peter Damaschke
2004	J	`jnl`	Scheduling Search Procedures. J. Sched. Peter Damaschke
2003	A	`conf`	Distributed Soft Path Coloring. STACS Peter Damaschke
2003	B	`conf`	Fast Perfect Phylogeny Haplotype Inference. FCT Peter Damaschke
2003	J	`jnl`	Linear-time recognition of bipartite graphs plus two edges. Discret. Math. Peter Damaschke
2003	J	`jnl`	Nearly optimal strategies for special cases of on-line capital investment. Theor. Comput. Sci. Peter Damaschke
2003	J	`jnl`	On parallel attribute-efficient learning. J. Comput. Syst. Sci. Peter Damaschke
2003	J	`jnl`	Point placement on the line by distance data. Discret. Appl. Math. Peter Damaschke
2003	J	`jnl`	Powers of geometric intersection graphs and dispersion algorithms. Discret. Appl. Math. Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
2002	J	`jnl`	Online strategies for backups. Theor. Comput. Sci. Peter Damaschke
2002	J	`jnl`	Optimizing a mail-order with discount and shipping costs. Inf. Process. Lett. Peter Damaschke
2002	—	`conf`	Powers of Geometric Intersection Graphs and Dispersion Algorithms. SWAT Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
2002	A*	`conf`	Scheduling Search Procedures. ICALP Peter Damaschke
2002	J	`jnl`	Two short notes on the on-line travelling salesman: handling times and lookahead. Theor. Comput. Sci. Peter Damaschke
2001	—	`conf`	Approximate Location of Relevant Variables under the Crossover Distribution. SAGA Peter Damaschke
2001	J	`jnl`	Minus domination in small-degree graphs. Discret. Appl. Math. Peter Damaschke
2001	B	`conf`	Worst-case bounds for blind broadcasting in small-degree networks. SIROCCO Peter Damaschke
2000	J	`jnl`	Adaptive Versus Nonadaptive Attribute-Efficient Learning. Mach. Learn. Peter Damaschke
2000	J	`jnl`	Degree-preserving spanning trees in small-degree graphs. Discret. Math. Peter Damaschke
2000	B	`conf`	Efficient Dispersion Algorithms for Geometric Intersection Graphs. WG Peter Damaschke
2000	C	`conf`	Online Strategies for Backups. CIAC Peter Damaschke
2000	—	`conf`	Parallel Attribute-Efficient Learning of Monotone Boolean Functions. SWAT Peter Damaschke
1999	B	`conf`	Multiple Spin-Block Decisions. ISAAC Peter Damaschke
1998	B	`conf`	A Chip Search Problem on Binary Numbers. LATIN Peter Damaschke
1998	A*	`conf`	Adaptive versus Nonadaptive Attribute-Efficient Learning. STOC Peter Damaschke
1998	B	`conf`	Computational Aspects of Parallel Attribute-Efficient Learning. ALT Peter Damaschke
1998	—	`conf`	Delayed Correction - Binary Search with Errors Made Very Simple but Efficient. CATS Frank Albers, Peter Damaschke
1998	B	`conf`	Minus Domination in Small-Degree Graphs. WG Peter Damaschke
1998	J	`jnl`	Randomized Group Testing for Mutually Obscuring Defectives. Inf. Process. Lett. Peter Damaschke
1997	J	`jnl`	An Optimal Parallel Algorithm for Digital Curve Segmentation. Theor. Comput. Sci. Peter Damaschke
1997	—	`conf`	Finding a Pair on a Mesh with Multiple Broadcasting is Hard. Euro-Par Peter Damaschke
1997	C	`conf`	The Algorithmic Complexity of Chemical Threshold Testing. CIAC Peter Damaschke
1996	—	`conf`	Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses. IPPS Peter Damaschke
1995	J	`jnl`	A Parallel Algorithm for Nearly Optimal Edge Search. Inf. Process. Lett. Peter Damaschke
1995	A	`conf`	An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search. ESA Peter Damaschke
1995	A	`conf`	Line Segmentation of Digital Curves in Parallel. STACS Peter Damaschke
1995	B	`conf`	Searching for Faulty Leaves in Binary Trees. WG Peter Damaschke
1995	B	`conf`	Searching for a Monotone Function by Independent Threshold Queries. ISAAC Peter Damaschke
1995	J	`jnl`	The linear time recognition of digital arcs. Pattern Recognit. Lett. Peter Damaschke
1994	J	`jnl`	A Tight Upper Bound for Group Testing in Graphs. Discret. Appl. Math. Peter Damaschke
1994	—	`—`	Berechnungskomplexität der Erkennung der semantischen Unabhängigkeit von Relationen. Peter Damaschke
1994	J	`jnl`	Dominating cliques in chordal graphs. Discret. Math. Dieter Kratsch, Peter Damaschke, Anna Lubiw
1994	J	`jnl`	PLA Folding in Special Graph Classes. Discret. Appl. Math. Peter Damaschke
1994	J	`jnl`	The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. Discret. Appl. Math. Elias Dahlhaus, Peter Damaschke
1993	J	`jnl`	Paths in interval graphs and circular arc graphs. Discret. Math. Peter Damaschke
1992	J	`jnl`	Distances in cocomparability graphs and their powers. Discret. Appl. Math. Peter Damaschke
1991	J	`jnl`	Irredundance number versus domination number. Discret. Math. Peter Damaschke
1991	B	`conf`	Logic Arrays for Interval Indicator Functions. WG Peter Damaschke
1990	J	`jnl`	Domination in Convex and Chordal Bipartite Graphs. Inf. Process. Lett. Peter Damaschke, Haiko Müller, Dieter Kratsch
1990	B	`conf`	Induced Subgraph Isomorphism for Cographs in NP-Complete. WG Peter Damaschke
1990	J	`jnl`	Induced subgraphs and well-quasi-ordering. J. Graph Theory Peter Damaschke
1989	J	`jnl`	The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete. Inf. Process. Lett. Peter Damaschke