Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Damaschke, Peter"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding and enumerating large intersections
Peter Damaschke
Theoretical Computer Science
580
, 2015, pp. 75-82
Strict group testing and the set basis problem
Peter Damaschke
,
Azam Sheikh Muhammad
,
Gábor Wiener
Journal of Combinatorial Theory Series A
126
, 2014, pp. 70-91
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
Peter Damaschke
Information Processing Letters
114
(6), 2014, pp. 317-321
Two new perspectives on multi-stage group testing
Peter Damaschke
,
Azam Sheikh Muhammad
,
Eberhard Triesch
Algorithmica
67
(3), 2013, pp. 324-354
A toolbox for provably optimal multistage strict group testing strategies
Peter Damaschke
,
Azam Sheikh Muhammad
Lecture Notes in Computer Science
7936
, 2013, pp. 446-457
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing
Peter Damaschke
Theoretical Computer Science
511
, 2013, pp. 137-146
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
Peter Damaschke
,
Leonid Molokov
Theoretical Computer Science
452
, 2012, pp. 39-46
Even faster parameterized cluster deletion and cluster editing
Sebastian Bócker
,
Peter Damaschke
Information Processing Letters
111
(14), 2011, pp. 717-721
Parameterized reductions and algorithms for another vertex cover generalization
Peter Damaschke
,
Leonid Molokov
Lecture Notes in Computer Science
6844
, 2011, pp. 279-289
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
Peter Damaschke
Networks
57
(4), 2011, pp. 344-350
Homogeneous string segmentation using trees and weighted independent sets
Peter Damaschke
Algorithmica
57
(4), 2010, pp. 621-640
Fixed-parameter enumerability of cluster editing and related problems
Peter Damaschke
Theory of Computing Systems
46
(2), 2010, pp. 261-283
Online search with time-varying price bounds
Peter Damaschke
,
Phuong Hoai Ha
,
Philippas Tsigas
Algorithmica
55
(4), 2009, pp. 619-642
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Peter Damaschke
Lecture Notes in Computer Science
4393
, 2007, pp. 332-343
Segmenting strings homogeneously via trees
Peter Damaschke
Lecture Notes in Computer Science
4769
, 2007, pp. 214-225
Multiple spin-block decisions
Peter Damaschke
Algorithmica
44
(1), 2006, pp. 33-48
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
Peter Damaschke
Information Processing Letters
100
(2), 2006, pp. 64-68
Fixed-parameter tractable generalizations of cluster editing
Peter Damaschke
Lecture Notes in Computer Science
3998
, 2006, pp. 344-355
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Peter Damaschke
Theoretical Computer Science
351
(3), 2006, pp. 337-350
Fast algorithms for finding disjoint subsequences with extremal densities
Anders Bergkvist
,
Peter Damaschke
Lecture Notes in Computer Science
3827
, 2005, pp. 714-723
Overlaps help: Improved bounds for group testing with interval queries
Ferdinando Cicalese
,
Peter Damaschke
,
Libertad Tansini
,
Sören Werth
Lecture Notes in Computer Science
3595
, 2005, pp. 935-944
On queuing lengths in on-line switching
Peter Damaschke
,
Zhen Zhou
Theoretical Computer Science
339
(2-3), 2005, pp. 333-343
On the fixed-parameter enumerability of cluster editing
Peter Damaschke
Lecture Notes in Computer Science
3787
, 2005, pp. 283-294
On parallel attribute-efficient learning
Peter Damaschke
Journal of Computer and System Sciences
67
(1), 2003, pp. 46-62
Distributed soft path coloring
Peter Damaschke
Lecture Notes in Computer Science
2607
, 2003, pp. 523-534
Seiten 1
2
3
>