Search the dblp DataBase
Peter Damaschke :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Peter Damaschke Computational Aspects of Parallel Attribute-Efficient Learning. [Citation Graph (0, 0)][DBLP ] ALT, 1998, pp:103-111 [Conf ] Peter Damaschke Online Strategies for Backups. [Citation Graph (0, 0)][DBLP ] CIAC, 2000, pp:63-71 [Conf ] Peter Damaschke Fixed-Parameter Tractable Generalizations of Cluster Editing. [Citation Graph (0, 0)][DBLP ] CIAC, 2006, pp:344-355 [Conf ] Peter Damaschke The Algorithmic Complexity of Chemical Threshold Testing. [Citation Graph (0, 0)][DBLP ] CIAC, 1997, pp:205-216 [Conf ] Ferdinando Cicalese , Peter Damaschke , Libertad Tansini , Sören Werth Overlaps Help: Improved Bounds for Group Testing with Interval Queries. [Citation Graph (0, 0)][DBLP ] COCOON, 2005, pp:935-944 [Conf ] Peter Damaschke An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search. [Citation Graph (0, 0)][DBLP ] ESA, 1995, pp:570-581 [Conf ] Peter Damaschke Finding a Pair on a Mesh with Multiple Broadcasting is Hard. [Citation Graph (0, 0)][DBLP ] Euro-Par, 1997, pp:266-271 [Conf ] Peter Damaschke , Phuong Hoai Ha , Philippas Tsigas Competitive Freshness Algorithms for Wait-Free Data Objects. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2006, pp:811-820 [Conf ] Peter Damaschke Fast Perfect Phylogeny Haplotype Inference. [Citation Graph (0, 0)][DBLP ] FCT, 2003, pp:183-194 [Conf ] Peter Damaschke Scheduling Search Procedures. [Citation Graph (0, 0)][DBLP ] ICALP, 2002, pp:281-292 [Conf ] Ferdinando Cicalese , Peter Damaschke , Ugo Vaccaro Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. [Citation Graph (0, 0)][DBLP ] International Conference on Computational Science (2), 2005, pp:1029-1037 [Conf ] Peter Damaschke Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses. [Citation Graph (0, 0)][DBLP ] IPPS, 1996, pp:682-686 [Conf ] Anders Bergkvist , Peter Damaschke Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. [Citation Graph (0, 0)][DBLP ] ISAAC, 2005, pp:714-723 [Conf ] Peter Damaschke Searching for a Monotone Function by Independent Threshold Queries. [Citation Graph (0, 0)][DBLP ] ISAAC, 1995, pp:284-290 [Conf ] Peter Damaschke Multiple Spin-Block Decisions. [Citation Graph (0, 0)][DBLP ] ISAAC, 1999, pp:27-36 [Conf ] Peter Damaschke Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. [Citation Graph (0, 0)][DBLP ] IWPEC, 2004, pp:1-12 [Conf ] Peter Damaschke A Chip Search Problem on Binary Numbers. [Citation Graph (0, 0)][DBLP ] LATIN, 1998, pp:11-22 [Conf ] Peter Damaschke Approximate Location of Relevant Variables under the Crossover Distribution. [Citation Graph (0, 0)][DBLP ] SAGA, 2001, pp:189-202 [Conf ] Peter Damaschke Worst-case bounds for blind broadcasting in small-degree networks. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2001, pp:105-116 [Conf ] Peter Damaschke Distributed Soft Path Coloring. [Citation Graph (0, 0)][DBLP ] STACS, 2003, pp:523-534 [Conf ] Peter Damaschke Line Segmentation of Digital Curves in Parallel. [Citation Graph (0, 0)][DBLP ] STACS, 1995, pp:539-549 [Conf ] Peter Damaschke The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. [Citation Graph (0, 0)][DBLP ] STACS, 2007, pp:332-343 [Conf ] Peter Damaschke Adaptive versus Nonadaptive Attribute-Efficient Learning. [Citation Graph (0, 0)][DBLP ] STOC, 1998, pp:590-596 [Conf ] Peter Damaschke Parallel Attribute-Efficient Learning of Monotone Boolean Functions. [Citation Graph (0, 0)][DBLP ] SWAT, 2000, pp:504-512 [Conf ] Geir Agnarsson , Peter Damaschke , Magnús M. Halldórsson Powers of Geometric Intersection Graphs and Dispersion Algorithms. [Citation Graph (0, 0)][DBLP ] SWAT, 2002, pp:140-149 [Conf ] Peter Damaschke Efficient Dispersion Algorithms for Geometric Intersection Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2000, pp:107-115 [Conf ] Peter Damaschke On the Fixed-Parameter Enumerability of Cluster Editing. [Citation Graph (0, 0)][DBLP ] WG, 2005, pp:283-294 [Conf ] Peter Damaschke Induced Subgraph Isomorphism for Cographs in NP-Complete. [Citation Graph (0, 0)][DBLP ] WG, 1990, pp:72-78 [Conf ] Peter Damaschke Logic Arrays for Interval Indicator Functions. [Citation Graph (0, 0)][DBLP ] WG, 1991, pp:219-225 [Conf ] Peter Damaschke Searching for Faulty Leaves in Binary Trees. [Citation Graph (0, 0)][DBLP ] WG, 1995, pp:265-274 [Conf ] Peter Damaschke Minus Domination in Small-Degree Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:17-25 [Conf ] Peter Damaschke Threshold Group Testing. [Citation Graph (0, 0)][DBLP ] GTIT-C, 2006, pp:707-718 [Conf ] Peter Damaschke Multiple Spin-Block Decisions. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2006, v:44, n:1, pp:33-48 [Journal ] Geir Agnarsson , Peter Damaschke , Magnús M. Halldórsson Powers of geometric intersection graphs and dispersion algorithms. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:3-16 [Journal ] Elias Dahlhaus , Peter Damaschke The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:52, n:3, pp:261-273 [Journal ] Peter Damaschke Minus domination in small-degree graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:53-64 [Journal ] Peter Damaschke Point placement on the line by distance data. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:127, n:1, pp:53-62 [Journal ] Peter Damaschke Approximate location of relevant variables under the crossover distribution. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:137, n:1, pp:47-67 [Journal ] Peter Damaschke Randomized vs. deterministic distance query strategies for point location on the line. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:3, pp:478-484 [Journal ] Peter Damaschke A Tight Upper Bound for Group Testing in Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:48, n:2, pp:101-109 [Journal ] Peter Damaschke PLA Folding in Special Graph Classes. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:63-74 [Journal ] Ferdinando Cicalese , Peter Damaschke , Libertad Tansini , Sören Werth Overlaps help: Improved bounds for group testing with interval queries. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:3, pp:288-299 [Journal ] Peter Damaschke Degree-preserving spanning trees in small-degree graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:222, n:1-3, pp:51-60 [Journal ] Peter Damaschke Linear-time recognition of bipartite graphs plus two edges. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:262, n:1-3, pp:99-112 [Journal ] Peter Damaschke Optimizing a mail-order with discount and shipping costs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:82, n:2, pp:93-97 [Journal ] Peter Damaschke The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:1, pp:1-2 [Journal ] Peter Damaschke A Parallel Algorithm for Nearly Optimal Edge Search. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:56, n:4, pp:233-236 [Journal ] Peter Damaschke Randomized Group Testing for Mutually Obscuring Defectives. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:67, n:3, pp:131-135 [Journal ] Peter Damaschke , Haiko Müller , Dieter Kratsch Domination in Convex and Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:36, n:5, pp:231-236 [Journal ] Peter Damaschke A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:100, n:2, pp:64-68 [Journal ] Peter Damaschke On parallel attribute-efficient learning. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2003, v:67, n:1, pp:46-62 [Journal ] Anders Bergkvist , Peter Damaschke , Marcel Lüthi Linear Programs for Hypotheses Selection in Probabilistic Inference Models. [Citation Graph (0, 0)][DBLP ] Journal of Machine Learning Research, 2006, v:7, n:, pp:1339-1355 [Journal ] Peter Damaschke Adaptive Versus Nonadaptive Attribute-Efficient Learning. [Citation Graph (0, 0)][DBLP ] Machine Learning, 2000, v:41, n:2, pp:197-215 [Journal ] Anders Bergkvist , Peter Damaschke Fast algorithms for finding disjoint subsequences with extremal densities. [Citation Graph (0, 0)][DBLP ] Pattern Recognition, 2006, v:39, n:12, pp:2281-2292 [Journal ] Peter Damaschke The linear time recognition of digital arcs. [Citation Graph (0, 0)][DBLP ] Pattern Recognition Letters, 1995, v:16, n:5, pp:543-548 [Journal ] Peter Damaschke Scheduling Search Procedures. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2004, v:7, n:5, pp:349-364 [Journal ] Peter Damaschke Scheduling search procedures: The wheel of fortune. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2006, v:9, n:6, pp:545-557 [Journal ] Peter Damaschke Online strategies for backups. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:285, n:1, pp:43-53 [Journal ] Peter Damaschke Two short notes on the on-line travelling salesman: handling times and lookahead. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:289, n:1, pp:845-852 [Journal ] Peter Damaschke Nearly optimal strategies for special cases of on-line capital investment. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:302, n:1-3, pp:35-44 [Journal ] Peter Damaschke Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:351, n:3, pp:337-350 [Journal ] Peter Damaschke An Optimal Parallel Algorithm for Digital Curve Segmentation. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:178, n:1-2, pp:225-236 [Journal ] Peter Damaschke , Zhen Zhou On queuing lengths in on-line switching. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:339, n:2-3, pp:333-343 [Journal ] Peter Damaschke Irredundance number versus domination number. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:89, n:1, pp:101-104 [Journal ] Peter Damaschke Paths in interval graphs and circular arc graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:112, n:1-3, pp:49-64 [Journal ] Dieter Kratsch , Peter Damaschke , Anna Lubiw Dominating cliques in chordal graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:128, n:1-3, pp:269-275 [Journal ] Delayed Correction - Binary Search with Errors Made Very Simple but Efficient. [Citation Graph (, )][DBLP ] Competitive Search for Longest Empty Intervals. [Citation Graph (, )][DBLP ] Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. [Citation Graph (, )][DBLP ] Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. [Citation Graph (, )][DBLP ] Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. [Citation Graph (, )][DBLP ] Minimum Common String Partition Parameterized. [Citation Graph (, )][DBLP ] Segmenting Strings Homogeneously Via Trees. [Citation Graph (, )][DBLP ] Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets. [Citation Graph (, )][DBLP ] Online Search with Time-Varying Price Bounds. [Citation Graph (, )][DBLP ] Distances in cocomparability graphs and their powers. [Citation Graph (, )][DBLP ] Ranking hypotheses to minimize the search cost in probabilistic inference models. [Citation Graph (, )][DBLP ] Search in 0.009secs, Finished in 0.425secs