 | 2012 |
|---|
| 93 |       | Peter Damaschke,
Leonid Molokov:
Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices.
ISBRA 2012: 72-83 |
| 92 | | Peter Damaschke,
Azam Sheikh Muhammad:
Randomized Group Testing Both Query-Optimal and Minimal Adaptive.
SOFSEM 2012: 214-225 |
| 91 | | Sebastian Böcker,
Peter Damaschke:
A note on the parameterized complexity of unordered maximum tree orientation.
Discrete Applied Mathematics 160(10-11): 1634-1638 (2012) |
| 2011 |
|---|
| 90 | | Peter Damaschke:
Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing.
IPEC 2011: 94-105 |
| 89 | | Peter Damaschke,
Leonid Molokov:
Parameterized Reductions and Algorithms for Another Vertex Cover Generalization.
WADS 2011: 279-289 |
| 88 | | Peter Damaschke:
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover.
Discrete Optimization 8(1): 18-24 (2011) |
| 87 | | Sebastian Böcker,
Peter Damaschke:
Even faster parameterized cluster deletion and cluster editing.
Inf. Process. Lett. 111(14): 717-721 (2011) |
| 86 | | Peter Damaschke:
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries.
Networks 57(4): 344-350 (2011) |
| 2010 |
|---|
| 85 | | Peter Damaschke,
Azam Sheikh Muhammad:
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives.
COCOA (2) 2010: 117-130 |
| 84 | | Peter Damaschke:
Homogeneous String Segmentation using Trees and Weighted Independent Sets.
Algorithmica 57(4): 621-640 (2010) |
| 83 | | Peter Damaschke:
Fixed-Parameter Enumerability of Cluster Editing and Related Problems.
Theory Comput. Syst. 46(2): 261-283 (2010) |
| 2009 |
|---|
| 82 | | Peter Damaschke,
Azam Sheikh Muhammad:
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity.
FCT 2009: 84-95 |
| 81 | | Peter Damaschke:
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover.
IWPEC 2009: 110-121 |
| 80 | | Peter Damaschke:
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.
IWPEC 2009: 98-109 |
| 79 | | Peter Damaschke,
Phuong Hoai Ha,
Philippas Tsigas:
Online Search with Time-Varying Price Bounds.
Algorithmica 55(4): 619-642 (2009) |
| 78 | | Peter Damaschke:
Ranking hypotheses to minimize the search cost in probabilistic inference models.
Discrete Applied Mathematics 157(6): 1218-1228 (2009) |
| 77 | | Peter Damaschke:
Multiple hypernode hitting sets and smallest two-cores with targets.
J. Comb. Optim. 18(3): 294-306 (2009) |
| 76 | | Peter Damaschke,
Leonid Molokov:
The union of minimal hitting sets: Parameterized combinatorial bounds and counting.
J. Discrete Algorithms 7(4): 391-401 (2009) |
| 2008 |
|---|
| 75 |  | Peter Damaschke:
Competitive Search for Longest Empty Intervals.
CCCG 2008 |
| 74 | | Peter Damaschke:
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets.
COCOA 2008: 32-42 |
| 73 | | Peter Damaschke:
Minimum Common String Partition Parameterized.
WABI 2008: 87-98 |
| 2007 |
|---|
| 72 | | Peter Damaschke:
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.
STACS 2007: 332-343 |
| 71 | | Peter Damaschke:
Segmenting Strings Homogeneously Via Trees.
WG 2007: 214-225 |
| 70 | | Ferdinando Cicalese,
Peter Damaschke,
Libertad Tansini,
Sören Werth:
Overlaps help: Improved bounds for group testing with interval queries.
Discrete Applied Mathematics 155(3): 288-299 (2007) |
| 2006 |
|---|
| 69 | | Peter Damaschke:
Fixed-Parameter Tractable Generalizations of Cluster Editing.
CIAC 2006: 344-355 |
| 68 | | Peter Damaschke,
Phuong Hoai Ha,
Philippas Tsigas:
Competitive Freshness Algorithms for Wait-Free Data Objects.
Euro-Par 2006: 811-820 |
| 67 | | Peter Damaschke:
Threshold Group Testing.
GTIT-C 2006: 707-718 |
| 66 | | Peter Damaschke:
Multiple Spin-Block Decisions.
Algorithmica 44(1): 33-48 (2006) |
| 65 | | Peter Damaschke:
Randomized vs. deterministic distance query strategies for point location on the line.
Discrete Applied Mathematics 154(3): 478-484 (2006) |
| 64 | | Peter Damaschke:
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs.
Inf. Process. Lett. 100(2): 64-68 (2006) |
| 63 | | Peter Damaschke:
Scheduling search procedures: The wheel of fortune.
J. Scheduling 9(6): 545-557 (2006) |
| 62 | | Anders Bergkvist,
Peter Damaschke,
Marcel Lüthi:
Linear Programs for Hypotheses Selection in Probabilistic Inference Models.
Journal of Machine Learning Research 7: 1339-1355 (2006) |
| 61 | | Anders Bergkvist,
Peter Damaschke:
Fast algorithms for finding disjoint subsequences with extremal densities.
Pattern Recognition 39(12): 2281-2292 (2006) |
| 60 | | Peter Damaschke:
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction.
Theor. Comput. Sci. 351(3): 337-350 (2006) |
| 2005 |
|---|
| 59 | | Ferdinando Cicalese,
Peter Damaschke,
Libertad Tansini,
Sören Werth:
Overlaps Help: Improved Bounds for Group Testing with Interval Queries.
COCOON 2005: 935-944 |
| 58 | | Anders Bergkvist,
Peter Damaschke:
Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities.
ISAAC 2005: 714-723 |
| 57 | | 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 |
| 56 | | Peter Damaschke:
On the Fixed-Parameter Enumerability of Cluster Editing.
WG 2005: 283-294 |
| 55 | | Peter Damaschke:
Threshold Group Testing.
Electronic Notes in Discrete Mathematics 21: 265-271 (2005) |
| 54 | | Ferdinando Cicalese,
Peter Damaschke,
Ugo Vaccaro:
Optimal group testing algorithms with interval queries and their application to splice site detection.
IJBRA 1(4): 363-388 (2005) |
| 53 | | Peter Damaschke,
Zhen Zhou:
On queuing lengths in on-line switching.
Theor. Comput. Sci. 339(2-3): 333-343 (2005) |
| 2004 |
|---|
| 52 | | Peter Damaschke:
Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction.
IWPEC 2004: 1-12 |
| 51 | | Peter Damaschke:
Approximate location of relevant variables under the crossover distribution.
Discrete Applied Mathematics 137(1): 47-67 (2004) |
| 50 | | Peter Damaschke:
Scheduling Search Procedures.
J. Scheduling 7(5): 349-364 (2004) |
| 2003 |
|---|
| 49 | | Peter Damaschke:
Fast Perfect Phylogeny Haplotype Inference.
FCT 2003: 183-194 |
| 48 | | Peter Damaschke:
Distributed Soft Path Coloring.
STACS 2003: 523-534 |
| 47 | | Peter Damaschke:
Point placement on the line by distance data.
Discrete Applied Mathematics 127(1): 53-62 (2003) |
| 46 | | Geir Agnarsson,
Peter Damaschke,
Magnús M. Halldórsson:
Powers of geometric intersection graphs and dispersion algorithms.
Discrete Applied Mathematics 132(1-3): 3-16 (2003) |
| 45 | | Peter Damaschke:
Linear-time recognition of bipartite graphs plus two edges.
Discrete Mathematics 262(1-3): 99-112 (2003) |
| 44 | | Peter Damaschke:
On parallel attribute-efficient learning.
J. Comput. Syst. Sci. 67(1): 46-62 (2003) |
| 43 | | Peter Damaschke:
Nearly optimal strategies for special cases of on-line capital investment.
Theor. Comput. Sci. 302(1-3): 35-44 (2003) |
| 2002 |
|---|
| 42 | | Peter Damaschke:
Scheduling Search Procedures.
ICALP 2002: 281-292 |
| 41 | | Geir Agnarsson,
Peter Damaschke,
Magnús M. Halldórsson:
Powers of Geometric Intersection Graphs and Dispersion Algorithms.
SWAT 2002: 140-149 |
| 40 | | Peter Damaschke:
Optimizing a mail-order with discount and shipping costs.
Inf. Process. Lett. 82(2): 93-97 (2002) |
| 39 | | Peter Damaschke:
Online strategies for backups.
Theor. Comput. Sci. 285(1): 43-53 (2002) |
| 38 | | Peter Damaschke:
Two short notes on the on-line travelling salesman: handling times and lookahead.
Theor. Comput. Sci. 289(1): 845-852 (2002) |
| 2001 |
|---|
| 37 | | Peter Damaschke:
Approximate Location of Relevant Variables under the Crossover Distribution.
SAGA 2001: 189-202 |
| 36 | | Peter Damaschke:
Worst-case bounds for blind broadcasting in small-degree networks.
SIROCCO 2001: 105-116 |
| 35 | | Peter Damaschke:
Minus domination in small-degree graphs.
Discrete Applied Mathematics 108(1-2): 53-64 (2001) |
| 2000 |
|---|
| 34 | | Peter Damaschke:
Online Strategies for Backups.
CIAC 2000: 63-71 |
| 33 | | Peter Damaschke:
Parallel Attribute-Efficient Learning of Monotone Boolean Functions.
SWAT 2000: 504-512 |
| 32 | | Peter Damaschke:
Efficient Dispersion Algorithms for Geometric Intersection Graphs.
WG 2000: 107-115 |
| 31 | | Peter Damaschke:
Degree-preserving spanning trees in small-degree graphs.
Discrete Mathematics 222(1-3): 51-60 (2000) |
| 30 | | Peter Damaschke:
Adaptive Versus Nonadaptive Attribute-Efficient Learning.
Machine Learning 41(2): 197-215 (2000) |
| 1999 |
|---|
| 29 | | Peter Damaschke:
Multiple Spin-Block Decisions.
ISAAC 1999: 27-36 |
| 1998 |
|---|
| 28 | | Peter Damaschke:
Computational Aspects of Parallel Attribute-Efficient Learning.
ALT 1998: 103-111 |
| 27 | | Frank Albers,
Peter Damaschke:
Delayed Correction - Binary Search with Errors Made Very Simple but Efficient.
CATS 1998: 97-106 |
| 26 | | Peter Damaschke:
A Chip Search Problem on Binary Numbers.
LATIN 1998: 11-22 |
| 25 | | Peter Damaschke:
Adaptive versus Nonadaptive Attribute-Efficient Learning.
STOC 1998: 590-596 |
| 24 | | Peter Damaschke:
Minus Domination in Small-Degree Graphs.
WG 1998: 17-25 |
| 23 | | Peter Damaschke:
Randomized Group Testing for Mutually Obscuring Defectives.
Inf. Process. Lett. 67(3): 131-135 (1998) |
| 1997 |
|---|
| 22 | | Peter Damaschke:
The Algorithmic Complexity of Chemical Threshold Testing.
CIAC 1997: 205-216 |
| 21 | | Peter Damaschke:
Finding a Pair on a Mesh with Multiple Broadcasting is Hard.
Euro-Par 1997: 266-271 |
| 20 | | Peter Damaschke:
An Optimal Parallel Algorithm for Digital Curve Segmentation.
Theor. Comput. Sci. 178(1-2): 225-236 (1997) |
| 1996 |
|---|
| 19 | | Peter Damaschke:
Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses.
IPPS 1996: 682-686 |
| 1995 |
|---|
| 18 | | Peter Damaschke:
An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search.
ESA 1995: 570-581 |
| 17 | | Peter Damaschke:
Searching for a Monotone Function by Independent Threshold Queries.
ISAAC 1995: 284-290 |
| 16 | | Peter Damaschke:
Line Segmentation of Digital Curves in Parallel.
STACS 1995: 539-549 |
| 15 | | Peter Damaschke:
Searching for Faulty Leaves in Binary Trees.
WG 1995: 265-274 |
| 14 | | Peter Damaschke:
A Parallel Algorithm for Nearly Optimal Edge Search.
Inf. Process. Lett. 56(4): 233-236 (1995) |
| 13 | | Peter Damaschke:
The linear time recognition of digital arcs.
Pattern Recognition Letters 16(5): 543-548 (1995) |
| 1994 |
|---|
| 12 | | Peter Damaschke:
A Tight Upper Bound for Group Testing in Graphs.
Discrete Applied Mathematics 48(2): 101-109 (1994) |
| 11 | | Peter Damaschke:
PLA Folding in Special Graph Classes.
Discrete Applied Mathematics 51(1-2): 63-74 (1994) |
| 10 | | Elias Dahlhaus,
Peter Damaschke:
The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs.
Discrete Applied Mathematics 52(3): 261-273 (1994) |
| 9 | | Dieter Kratsch,
Peter Damaschke,
Anna Lubiw:
Dominating cliques in chordal graphs.
Discrete Mathematics 128(1-3): 269-275 (1994) |
| 8 | | Peter Damaschke:
Berechnungskomplexität der Erkennung der semantischen Unabhängigkeit von Relationen.
FernUniv. Hagen 1994: 1-35 |
| 1993 |
|---|
| 7 | | Peter Damaschke:
Paths in interval graphs and circular arc graphs.
Discrete Mathematics 112(1-3): 49-64 (1993) |
| 1992 |
|---|
| 6 | | Peter Damaschke:
Distances in cocomparability graphs and their powers.
Discrete Applied Mathematics 35(1): 67-72 (1992) |
| 1991 |
|---|
| 5 | | Peter Damaschke:
Logic Arrays for Interval Indicator Functions.
WG 1991: 219-225 |
| 4 | | Peter Damaschke:
Irredundance number versus domination number.
Discrete Mathematics 89(1): 101-104 (1991) |
| 1990 |
|---|
| 3 | | Peter Damaschke:
Induced Subgraph Isomorphism for Cographs in NP-Complete.
WG 1990: 72-78 |
| 2 | | Peter Damaschke,
Haiko Müller,
Dieter Kratsch:
Domination in Convex and Chordal Bipartite Graphs.
Inf. Process. Lett. 36(5): 231-236 (1990) |
| 1989 |
|---|
| 1 | | Peter Damaschke:
The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete.
Inf. Process. Lett. 32(1): 1-2 (1989) |
Data released under the ODC-BY 1.0 license — See also our legal information page