2008 |
74 | | Peter Damaschke:
Competitive Search for Longest Empty Intervals.
CCCG 2008 |
73 | EE | Peter Damaschke:
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets.
COCOA 2008: 32-42 |
72 | EE | Peter Damaschke:
Minimum Common String Partition Parameterized.
WABI 2008: 87-98 |
2007 |
71 | EE | Peter Damaschke:
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.
STACS 2007: 332-343 |
70 | EE | Peter Damaschke:
Segmenting Strings Homogeneously Via Trees.
WG 2007: 214-225 |
69 | EE | 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 |
68 | EE | Peter Damaschke:
Fixed-Parameter Tractable Generalizations of Cluster Editing.
CIAC 2006: 344-355 |
67 | EE | Peter Damaschke,
Phuong Hoai Ha,
Philippas Tsigas:
Competitive Freshness Algorithms for Wait-Free Data Objects.
Euro-Par 2006: 811-820 |
66 | EE | Peter Damaschke:
Threshold Group Testing.
GTIT-C 2006: 707-718 |
65 | EE | Peter Damaschke:
Multiple Spin-Block Decisions.
Algorithmica 44(1): 33-48 (2006) |
64 | EE | Peter Damaschke:
Randomized vs. deterministic distance query strategies for point location on the line.
Discrete Applied Mathematics 154(3): 478-484 (2006) |
63 | EE | Peter Damaschke:
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs.
Inf. Process. Lett. 100(2): 64-68 (2006) |
62 | EE | Peter Damaschke:
Scheduling search procedures: The wheel of fortune.
J. Scheduling 9(6): 545-557 (2006) |
61 | EE | 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) |
60 | EE | Anders Bergkvist,
Peter Damaschke:
Fast algorithms for finding disjoint subsequences with extremal densities.
Pattern Recognition 39(12): 2281-2292 (2006) |
59 | EE | Peter Damaschke:
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction.
Theor. Comput. Sci. 351(3): 337-350 (2006) |
2005 |
58 | EE | Ferdinando Cicalese,
Peter Damaschke,
Libertad Tansini,
Sören Werth:
Overlaps Help: Improved Bounds for Group Testing with Interval Queries.
COCOON 2005: 935-944 |
57 | EE | Anders Bergkvist,
Peter Damaschke:
Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities.
ISAAC 2005: 714-723 |
56 | EE | 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 |
55 | EE | Peter Damaschke:
On the Fixed-Parameter Enumerability of Cluster Editing.
WG 2005: 283-294 |
54 | EE | Peter Damaschke:
Threshold Group Testing.
Electronic Notes in Discrete Mathematics 21: 265-271 (2005) |
53 | EE | 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) |
52 | EE | Peter Damaschke,
Zhen Zhou:
On queuing lengths in on-line switching.
Theor. Comput. Sci. 339(2-3): 333-343 (2005) |
2004 |
51 | EE | Peter Damaschke:
Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction.
IWPEC 2004: 1-12 |
50 | EE | Peter Damaschke:
Approximate location of relevant variables under the crossover distribution.
Discrete Applied Mathematics 137(1): 47-67 (2004) |
49 | EE | Peter Damaschke:
Scheduling Search Procedures.
J. Scheduling 7(5): 349-364 (2004) |
2003 |
48 | EE | Peter Damaschke:
Fast Perfect Phylogeny Haplotype Inference.
FCT 2003: 183-194 |
47 | EE | Peter Damaschke:
Distributed Soft Path Coloring.
STACS 2003: 523-534 |
46 | | Peter Damaschke:
Point placement on the line by distance data.
Discrete Applied Mathematics 127(1): 53-62 (2003) |
45 | EE | 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) |
44 | EE | Peter Damaschke:
Linear-time recognition of bipartite graphs plus two edges.
Discrete Mathematics 262(1-3): 99-112 (2003) |
43 | EE | Peter Damaschke:
On parallel attribute-efficient learning.
J. Comput. Syst. Sci. 67(1): 46-62 (2003) |
42 | EE | Peter Damaschke:
Nearly optimal strategies for special cases of on-line capital investment.
Theor. Comput. Sci. 302(1-3): 35-44 (2003) |
2002 |
41 | EE | Peter Damaschke:
Scheduling Search Procedures.
ICALP 2002: 281-292 |
40 | EE | Geir Agnarsson,
Peter Damaschke,
Magnús M. Halldórsson:
Powers of Geometric Intersection Graphs and Dispersion Algorithms.
SWAT 2002: 140-149 |
39 | EE | Peter Damaschke:
Optimizing a mail-order with discount and shipping costs.
Inf. Process. Lett. 82(2): 93-97 (2002) |
38 | EE | Peter Damaschke:
Online strategies for backups.
Theor. Comput. Sci. 285(1): 43-53 (2002) |
37 | | Peter Damaschke:
Two short notes on the on-line travelling salesman: handling times and lookahead.
Theor. Comput. Sci. 289(1): 845-852 (2002) |
2001 |
36 | EE | Peter Damaschke:
Approximate Location of Relevant Variables under the Crossover Distribution.
SAGA 2001: 189-202 |
35 | | Peter Damaschke:
Worst-case bounds for blind broadcasting in small-degree networks.
SIROCCO 2001: 105-116 |
34 | | Peter Damaschke:
Minus domination in small-degree graphs.
Discrete Applied Mathematics 108(1-2): 53-64 (2001) |
2000 |
33 | EE | Peter Damaschke:
Online Strategies for Backups.
CIAC 2000: 63-71 |
32 | EE | Peter Damaschke:
Parallel Attribute-Efficient Learning of Monotone Boolean Functions.
SWAT 2000: 504-512 |
31 | EE | Peter Damaschke:
Efficient Dispersion Algorithms for Geometric Intersection Graphs.
WG 2000: 107-115 |
30 | EE | Peter Damaschke:
Degree-preserving spanning trees in small-degree graphs.
Discrete Mathematics 222(1-3): 51-60 (2000) |
29 | | Peter Damaschke:
Adaptive Versus Nonadaptive Attribute-Efficient Learning.
Machine Learning 41(2): 197-215 (2000) |
1999 |
28 | EE | Peter Damaschke:
Multiple Spin-Block Decisions.
ISAAC 1999: 27-36 |
1998 |
27 | EE | Peter Damaschke:
Computational Aspects of Parallel Attribute-Efficient Learning.
ALT 1998: 103-111 |
26 | | Frank Albers,
Peter Damaschke:
Delayed Correction - Binary Search with Errors Made Very Simple but Efficient.
CATS 1998: 97-106 |
25 | EE | Peter Damaschke:
A Chip Search Problem on Binary Numbers.
LATIN 1998: 11-22 |
24 | EE | Peter Damaschke:
Adaptive versus Nonadaptive Attribute-Efficient Learning.
STOC 1998: 590-596 |
23 | | Peter Damaschke:
Minus Domination in Small-Degree Graphs.
WG 1998: 17-25 |
22 | EE | Peter Damaschke:
Randomized Group Testing for Mutually Obscuring Defectives.
Inf. Process. Lett. 67(3): 131-135 (1998) |
1997 |
21 | | Peter Damaschke:
The Algorithmic Complexity of Chemical Threshold Testing.
CIAC 1997: 205-216 |
20 | | Peter Damaschke:
Finding a Pair on a Mesh with Multiple Broadcasting is Hard.
Euro-Par 1997: 266-271 |
19 | EE | Peter Damaschke:
An Optimal Parallel Algorithm for Digital Curve Segmentation.
Theor. Comput. Sci. 178(1-2): 225-236 (1997) |
1996 |
18 | EE | Peter Damaschke:
Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses.
IPPS 1996: 682-686 |
1995 |
17 | | Peter Damaschke:
An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search.
ESA 1995: 570-581 |
16 | | Peter Damaschke:
Searching for a Monotone Function by Independent Threshold Queries.
ISAAC 1995: 284-290 |
15 | | Peter Damaschke:
Line Segmentation of Digital Curves in Parallel.
STACS 1995: 539-549 |
14 | | Peter Damaschke:
Searching for Faulty Leaves in Binary Trees.
WG 1995: 265-274 |
13 | EE | Peter Damaschke:
A Parallel Algorithm for Nearly Optimal Edge Search.
Inf. Process. Lett. 56(4): 233-236 (1995) |
12 | EE | Peter Damaschke:
The linear time recognition of digital arcs.
Pattern Recognition Letters 16(5): 543-548 (1995) |
1994 |
11 | EE | Peter Damaschke:
A Tight Upper Bound for Group Testing in Graphs.
Discrete Applied Mathematics 48(2): 101-109 (1994) |
10 | EE | Peter Damaschke:
PLA Folding in Special Graph Classes.
Discrete Applied Mathematics 51(1-2): 63-74 (1994) |
9 | EE | Elias Dahlhaus,
Peter Damaschke:
The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs.
Discrete Applied Mathematics 52(3): 261-273 (1994) |
8 | EE | Dieter Kratsch,
Peter Damaschke,
Anna Lubiw:
Dominating cliques in chordal graphs.
Discrete Mathematics 128(1-3): 269-275 (1994) |
1993 |
7 | EE | Peter Damaschke:
Paths in interval graphs and circular arc graphs.
Discrete Mathematics 112(1-3): 49-64 (1993) |
1992 |
6 | EE | 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 | EE | 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) |