default search action
Peter Damaschke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c63]Peter Damaschke:
Tandem Duplication Parameterized by the Length Difference. PSC 2023: 18-29 - 2021
- [c62]Peter Damaschke:
Distance-Based Solution of Patrolling Problems with Individual Waiting Times. ATMOS 2021: 14:1-14:14 - [c61]Peter Damaschke:
On an Ordering Problem in Weighted Hypergraphs. IWOCA 2021: 252-264 - 2020
- [j72]Peter Damaschke:
Equitable induced decompositions of twin graphs. Australas. J Comb. 76: 24-40 (2020) - [j71]Peter Damaschke:
Dividing Splittable Goods Evenly and With Limited Fragmentation. Algorithmica 82(5): 1298-1328 (2020) - [j70]Peter Damaschke:
Enumerating Grid Layouts of Graphs. J. Graph Algorithms Appl. 24(3): 433-460 (2020) - [j69]Raad Salman, Fredrik Ekstedt, Peter Damaschke:
Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem. Oper. Res. Lett. 48(2): 163-166 (2020) - [c60]Peter Damaschke:
Two Robots Patrolling on a Line: Integer Version and Approximability. IWOCA 2020: 211-223 - [c59]Peter Damaschke:
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges. IWOCA 2020: 224-236 - [c58]Raad Salman, Fredrik Ekstedt, Peter Damaschke:
Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem. SOCS 2020: 137-138
2010 – 2019
- 2019
- [j68]Peter Damaschke:
Parameterized Mixed Graph Coloring. J. Comb. Optim. 38(2): 362-374 (2019) - [j67]Peter Damaschke:
Optimal partial clique edge covering guided by potential energy minimization. Optim. Lett. 13(7): 1469-1481 (2019) - [j66]Peter Damaschke:
Combinatorial search in two and more rounds. Theor. Comput. Sci. 780: 1-11 (2019) - 2018
- [j65]Peter Damaschke:
The Solution Space of Sorting with Recurring Comparison Faults. Theory Comput. Syst. 62(6): 1427-1442 (2018) - [c57]Peter Damaschke, Alexander Schliep:
An Optimization Problem Related to Bloom Filters with Bit Patterns. SOFSEM 2018: 525-538 - [c56]Peter Damaschke:
Saving Probe Bits by Cube Domination. WG 2018: 139-151 - 2017
- [j64]Peter Damaschke:
Finding defectives on a line by random docking and interval group tests. Discret. Math. Algorithms Appl. 9(3): 1750029:1-1750029:11 (2017) - [j63]Peter Damaschke:
Refined algorithms for hitting many intervals. Inf. Process. Lett. 118: 117-122 (2017) - [j62]Peter Damaschke:
Calculating approximation guarantees for partial set cover of pairs. Optim. Lett. 11(7): 1293-1302 (2017) - [c55]Peter Damaschke:
Dividing Splittable Goods Evenly and With Limited Fragmentation. MFCS 2017: 9:1-9:13 - 2016
- [j61]Peter Damaschke:
Adaptive group testing with a constrained number of positive responses improved. Discret. Appl. Math. 205: 208-212 (2016) - [j60]Peter Damaschke:
Sufficient conditions for edit-optimal clusters. Inf. Process. Lett. 116(4): 267-272 (2016) - [j59]Peter Damaschke:
Deterministic versus randomized adaptive test cover. Theor. Comput. Sci. 653: 42-52 (2016) - [c54]Peter Damaschke:
Computing Giant Graph Diameters. IWOCA 2016: 373-384 - [c53]Peter Damaschke:
The Solution Space of Sorting with Recurring Comparison Faults. IWOCA 2016: 397-408 - [c52]Azam Sheikh Muhammad, Peter Damaschke, Olof Mogren:
Summarizing Online User Reviews Using Bicliques. SOFSEM 2016: 569-579 - 2015
- [j58]Peter Damaschke:
Parameterizations of hitting set of bundles and inverse scope. J. Comb. Optim. 29(4): 847-858 (2015) - [j57]Peter Damaschke:
Finding and enumerating large intersections. Theor. Comput. Sci. 580: 75-82 (2015) - [c51]Peter Damaschke:
Randomized Adaptive Test Cover. CIAC 2015: 182-193 - [c50]Peter Damaschke:
Pairs Covered by a Sequence of Sets. FCT 2015: 214-226 - 2014
- [j56]Peter Damaschke:
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences. Inf. Process. Lett. 114(6): 317-321 (2014) - [j55]Peter Damaschke, Azam Sheikh Muhammad, Gábor Wiener:
Strict group testing and the set basis problem. J. Comb. Theory A 126: 70-91 (2014) - [j54]Peter Damaschke, Olof Mogren:
Editing Simple Graphs. J. Graph Algorithms Appl. 18(4): 557-576 (2014) - [c49]Peter Damaschke, Olof Mogren:
Editing the Simplest Graphs. WALCOM 2014: 249-260 - 2013
- [j53]Peter Damaschke, Azam Sheikh Muhammad, Eberhard Triesch:
Two New Perspectives on Multi-Stage Group Testing. Algorithmica 67(3): 324-354 (2013) - [j52]Peter Damaschke:
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing. Theor. Comput. Sci. 511: 137-146 (2013) - [c48]Peter Damaschke, Azam Sheikh Muhammad:
A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies. COCOON 2013: 446-457 - [c47]Peter Damaschke:
Cluster Editing with Locally Bounded Modifications Revisited. IWOCA 2013: 433-437 - [c46]Peter Damaschke, Ömer Egecioglu, Leonid Molokov:
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. WALCOM 2013: 245-256 - 2012
- [j51]Sebastian Böcker, Peter Damaschke:
A note on the parameterized complexity of unordered maximum tree orientation. Discret. Appl. Math. 160(10-11): 1634-1638 (2012) - [j50]Peter Damaschke, Leonid Molokov:
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover. Theor. Comput. Sci. 452: 39-46 (2012) - [c45]Peter Damaschke, Leonid Molokov:
Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices. ISBRA 2012: 72-83 - [c44]Peter Damaschke, Azam Sheikh Muhammad:
Randomized Group Testing Both Query-Optimal and Minimal Adaptive. SOFSEM 2012: 214-225 - 2011
- [j49]Peter Damaschke:
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover. Discret. Optim. 8(1): 18-24 (2011) - [j48]Peter Damaschke, Azam Sheikh Muhammad:
Bounds for Nonadaptive Group Tests to estimate the Amount of Defectives. Discret. Math. Algorithms Appl. 3(4): 517-536 (2011) - [j47]Sebastian Böcker, Peter Damaschke:
Even faster parameterized cluster deletion and cluster editing. Inf. Process. Lett. 111(14): 717-721 (2011) - [j46]Peter Damaschke:
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries. Networks 57(4): 344-350 (2011) - [c43]Peter Damaschke:
Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing. IPEC 2011: 94-105 - [c42]Peter Damaschke, Leonid Molokov:
Parameterized Reductions and Algorithms for Another Vertex Cover Generalization. WADS 2011: 279-289 - 2010
- [j45]Peter Damaschke:
Homogeneous String Segmentation using Trees and Weighted Independent Sets. Algorithmica 57(4): 621-640 (2010) - [j44]Peter Damaschke, Azam Sheikh Muhammad:
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. Discret. Math. Algorithms Appl. 2(3): 291-312 (2010) - [j43]Peter Damaschke:
Fixed-Parameter Enumerability of Cluster Editing and Related Problems. Theory Comput. Syst. 46(2): 261-283 (2010) - [c41]Peter Damaschke, Azam Sheikh Muhammad:
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives. COCOA (2) 2010: 117-130
2000 – 2009
- 2009
- [j42]Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas:
Online Search with Time-Varying Price Bounds. Algorithmica 55(4): 619-642 (2009) - [j41]Peter Damaschke:
Ranking hypotheses to minimize the search cost in probabilistic inference models. Discret. Appl. Math. 157(6): 1218-1228 (2009) - [j40]Peter Damaschke:
Multiple hypernode hitting sets and smallest two-cores with targets. J. Comb. Optim. 18(3): 294-306 (2009) - [j39]Peter Damaschke, Leonid Molokov:
The union of minimal hitting sets: Parameterized combinatorial bounds and counting. J. Discrete Algorithms 7(4): 391-401 (2009) - [c40]Peter Damaschke, Azam Sheikh Muhammad:
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. FCT 2009: 84-95 - [c39]Peter Damaschke:
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. IWPEC 2009: 98-109 - [c38]Peter Damaschke:
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. IWPEC 2009: 110-121 - 2008
- [c37]Peter Damaschke:
Competitive Search for Longest Empty Intervals. CCCG 2008 - [c36]Peter Damaschke:
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets. COCOA 2008: 32-42 - [c35]Peter Damaschke:
Minimum Common String Partition Parameterized. WABI 2008: 87-98 - 2007
- [j38]Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth:
Overlaps help: Improved bounds for group testing with interval queries. Discret. Appl. Math. 155(3): 288-299 (2007) - [c34]Peter Damaschke:
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. STACS 2007: 332-343 - [c33]Peter Damaschke:
Segmenting Strings Homogeneously Via Trees. WG 2007: 214-225 - 2006
- [j37]Peter Damaschke:
Multiple Spin-Block Decisions. Algorithmica 44(1): 33-48 (2006) - [j36]Peter Damaschke:
Randomized vs. deterministic distance query strategies for point location on the line. Discret. Appl. Math. 154(3): 478-484 (2006) - [j35]Peter Damaschke:
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. Inf. Process. Lett. 100(2): 64-68 (2006) - [j34]Anders Bergkvist, Peter Damaschke, Marcel Lüthi:
Linear Programs for Hypotheses Selection in Probabilistic Inference Models. J. Mach. Learn. Res. 7: 1339-1355 (2006) - [j33]Anders Bergkvist, Peter Damaschke:
Fast algorithms for finding disjoint subsequences with extremal densities. Pattern Recognit. 39(12): 2281-2292 (2006) - [j32]Peter Damaschke:
Scheduling search procedures: The wheel of fortune. J. Sched. 9(6): 545-557 (2006) - [j31]Peter Damaschke:
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. 351(3): 337-350 (2006) - [c32]Peter Damaschke:
Fixed-Parameter Tractable Generalizations of Cluster Editing. CIAC 2006: 344-355 - [c31]Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas:
Competitive Freshness Algorithms for Wait-Free Data Objects. Euro-Par 2006: 811-820 - [c30]Peter Damaschke:
Threshold Group Testing. GTIT-C 2006: 707-718 - 2005
- [j30]Peter Damaschke:
Threshold Group Testing. Electron. Notes Discret. Math. 21: 265-271 (2005) - [j29]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): 363-388 (2005) - [j28]Peter Damaschke, Zhen Zhou:
On queuing lengths in on-line switching. Theor. Comput. Sci. 339(2-3): 333-343 (2005) - [c29]Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth:
Overlaps Help: Improved Bounds for Group Testing with Interval Queries. COCOON 2005: 935-944 - [c28]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: 1029-1037 - [c27]Anders Bergkvist, Peter Damaschke:
Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. ISAAC 2005: 714-723 - [c26]Peter Damaschke:
On the Fixed-Parameter Enumerability of Cluster Editing. WG 2005: 283-294 - 2004
- [j27]Peter Damaschke:
Approximate location of relevant variables under the crossover distribution. Discret. Appl. Math. 137(1): 47-67 (2004) - [j26]Peter Damaschke:
Scheduling Search Procedures. J. Sched. 7(5): 349-364 (2004) - [c25]Peter Damaschke:
Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. IWPEC 2004: 1-12 - 2003
- [j25]Peter Damaschke:
Point placement on the line by distance data. Discret. Appl. Math. 127(1): 53-62 (2003) - [j24]Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson:
Powers of geometric intersection graphs and dispersion algorithms. Discret. Appl. Math. 132(1-3): 3-16 (2003) - [j23]Peter Damaschke:
Linear-time recognition of bipartite graphs plus two edges. Discret. Math. 262(1-3): 99-112 (2003) - [j22]Peter Damaschke:
On parallel attribute-efficient learning. J. Comput. Syst. Sci. 67(1): 46-62 (2003) - [j21]Peter Damaschke:
Nearly optimal strategies for special cases of on-line capital investment. Theor. Comput. Sci. 302(1-3): 35-44 (2003) - [c24]Peter Damaschke:
Fast Perfect Phylogeny Haplotype Inference. FCT 2003: 183-194 - [c23]Peter Damaschke:
Distributed Soft Path Coloring. STACS 2003: 523-534 - 2002
- [j20]Peter Damaschke:
Optimizing a mail-order with discount and shipping costs. Inf. Process. Lett. 82(2): 93-97 (2002) - [j19]Peter Damaschke:
Online strategies for backups. Theor. Comput. Sci. 285(1): 43-53 (2002) - [j18]Peter Damaschke:
Two short notes on the on-line travelling salesman: handling times and lookahead. Theor. Comput. Sci. 289(1): 845-852 (2002) - [c22]Peter Damaschke:
Scheduling Search Procedures. ICALP 2002: 281-292 - [c21]Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson:
Powers of Geometric Intersection Graphs and Dispersion Algorithms. SWAT 2002: 140-149 - 2001
- [j17]Peter Damaschke:
Minus domination in small-degree graphs. Discret. Appl. Math. 108(1-2): 53-64 (2001) - [c20]Peter Damaschke:
Approximate Location of Relevant Variables under the Crossover Distribution. SAGA 2001: 189-202 - [c19]Peter Damaschke:
Worst-case bounds for blind broadcasting in small-degree networks. SIROCCO 2001: 105-116 - 2000
- [j16]Peter Damaschke:
Degree-preserving spanning trees in small-degree graphs. Discret. Math. 222(1-3): 51-60 (2000) - [j15]Peter Damaschke:
Adaptive Versus Nonadaptive Attribute-Efficient Learning. Mach. Learn. 41(2): 197-215 (2000) - [c18]Peter Damaschke:
Online Strategies for Backups. CIAC 2000: 63-71 - [c17]Peter Damaschke:
Parallel Attribute-Efficient Learning of Monotone Boolean Functions. SWAT 2000: 504-512 - [c16]Peter Damaschke:
Efficient Dispersion Algorithms for Geometric Intersection Graphs. WG 2000: 107-115
1990 – 1999
- 1999
- [c15]Peter Damaschke:
Multiple Spin-Block Decisions. ISAAC 1999: 27-36 - 1998
- [j14]Peter Damaschke:
Randomized Group Testing for Mutually Obscuring Defectives. Inf. Process. Lett. 67(3): 131-135 (1998) - [c14]Peter Damaschke:
Computational Aspects of Parallel Attribute-Efficient Learning. ALT 1998: 103-111 - [c13]Frank Albers, Peter Damaschke:
Delayed Correction - Binary Search with Errors Made Very Simple but Efficient. CATS 1998: 97-106 - [c12]Peter Damaschke:
A Chip Search Problem on Binary Numbers. LATIN 1998: 11-22 - [c11]Peter Damaschke:
Adaptive versus Nonadaptive Attribute-Efficient Learning. STOC 1998: 590-596 - [c10]Peter Damaschke:
Minus Domination in Small-Degree Graphs. WG 1998: 17-25 - 1997
- [j13]Peter Damaschke:
An Optimal Parallel Algorithm for Digital Curve Segmentation. Theor. Comput. Sci. 178(1-2): 225-236 (1997) - [c9]Peter Damaschke:
The Algorithmic Complexity of Chemical Threshold Testing. CIAC 1997: 205-216 - [c8]Peter Damaschke:
Finding a Pair on a Mesh with Multiple Broadcasting is Hard. Euro-Par 1997: 266-271 - 1996
- [c7]Peter Damaschke:
Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses. IPPS 1996: 682-686 - 1995
- [j12]Peter Damaschke:
A Parallel Algorithm for Nearly Optimal Edge Search. Inf. Process. Lett. 56(4): 233-236 (1995) - [j11]Peter Damaschke:
The linear time recognition of digital arcs. Pattern Recognit. Lett. 16(5): 543-548 (1995) - [c6]Peter Damaschke:
An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search. ESA 1995: 570-581 - [c5]Peter Damaschke:
Searching for a Monotone Function by Independent Threshold Queries. ISAAC 1995: 284-290 - [c4]Peter Damaschke:
Line Segmentation of Digital Curves in Parallel. STACS 1995: 539-549 - [c3]Peter Damaschke:
Searching for Faulty Leaves in Binary Trees. WG 1995: 265-274 - 1994
- [b1]Peter Damaschke:
Berechnungskomplexität der Erkennung der semantischen Unabhängigkeit von Relationen. FernUniv. Hagen, 1994, pp. 1-35 - [j10]Peter Damaschke:
A Tight Upper Bound for Group Testing in Graphs. Discret. Appl. Math. 48(2): 101-109 (1994) - [j9]Peter Damaschke:
PLA Folding in Special Graph Classes. Discret. Appl. Math. 51(1-2): 63-74 (1994) - [j8]Elias Dahlhaus, Peter Damaschke:
The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. Discret. Appl. Math. 52(3): 261-273 (1994) - [j7]Dieter Kratsch, Peter Damaschke, Anna Lubiw:
Dominating cliques in chordal graphs. Discret. Math. 128(1-3): 269-275 (1994) - 1993
- [j6]Peter Damaschke:
Paths in interval graphs and circular arc graphs. Discret. Math. 112(1-3): 49-64 (1993) - 1992
- [j5]Peter Damaschke:
Distances in cocomparability graphs and their powers. Discret. Appl. Math. 35(1): 67-72 (1992) - 1991
- [j4]Peter Damaschke:
Irredundance number versus domination number. Discret. Math. 89(1): 101-104 (1991) - [c2]Peter Damaschke:
Logic Arrays for Interval Indicator Functions. WG 1991: 219-225 - 1990
- [j3]Peter Damaschke, Haiko Müller, Dieter Kratsch:
Domination in Convex and Chordal Bipartite Graphs. Inf. Process. Lett. 36(5): 231-236 (1990) - [j2]Peter Damaschke:
Induced subgraphs and well-quasi-ordering. J. Graph Theory 14(4): 427-435 (1990) - [c1]Peter Damaschke:
Induced Subgraph Isomorphism for Cographs in NP-Complete. WG 1990: 72-78
1980 – 1989
- 1989
- [j1]Peter Damaschke:
The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete. Inf. Process. Lett. 32(1): 1-2 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint