Peter Damaschke
Orcid: 0000000340477594
According to our database^{1},
Peter Damaschke
authored at least 118 papers
between 1989 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2023
Proceedings of the Prague Stringology Conference 2023, 2023
2021
Proceedings of the Combinatorial Algorithms  32nd International Workshop, 2021
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021
2020
Branchandbound for the Precedence Constrained Generalized Traveling Salesman Problem.
Oper. Res. Lett., 2020
J. Graph Algorithms Appl., 2020
Algorithmica, 2020
Australas. J Comb., 2020
Proceedings of the Combinatorial Algorithms  31st International Workshop, 2020
Proceedings of the Combinatorial Algorithms  31st International Workshop, 2020
2019
Theor. Comput. Sci., 2019
Optim. Lett., 2019
J. Comb. Optim., 2019
2018
Theory Comput. Syst., 2018
Proceedings of the GraphTheoretic Concepts in Computer Science, 2018
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science  44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018
2017
Optim. Lett., 2017
Inf. Process. Lett., 2017
Discret. Math. Algorithms Appl., 2017
2016
Theor. Comput. Sci., 2016
Inf. Process. Lett., 2016
Discret. Appl. Math., 2016
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016
Proceedings of the Combinatorial Algorithms  27th International Workshop, 2016
2015
Theor. Comput. Sci., 2015
J. Comb. Optim., 2015
Proceedings of the Fundamentals of Computation Theory  20th International Symposium, 2015
Proceedings of the Algorithms and Complexity  9th International Conference, 2015
2014
J. Graph Algorithms Appl., 2014
J. Comb. Theory A, 2014
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences.
Inf. Process. Lett., 2014
Proceedings of the Algorithms and Computation  8th International Workshop, 2014
2013
Sparse solutions of sparse linear systems: Fixedparameter tractability and an application of complex group testing.
Theor. Comput. Sci., 2013
Algorithmica, 2013
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013
Proceedings of the Combinatorial Algorithms  24th International Workshop, 2013
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
2012
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover.
Theor. Comput. Sci., 2012
Discret. Appl. Math., 2012
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012
Error Propagation in Sparse Linear Systems with PeptideProtein Incidence Matrices.
Proceedings of the Bioinformatics Research and Applications  8th International Symposium, 2012
2011
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries.
Networks, 2011
Inf. Process. Lett., 2011
Discret. Math. Algorithms Appl., 2011
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover.
Discret. Optim., 2011
Proceedings of the Algorithms and Data Structures  12th International Symposium, 2011
2010
Theory Comput. Syst., 2010
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity.
Discret. Math. Algorithms Appl., 2010
Algorithmica, 2010
2009
The union of minimal hitting sets: Parameterized combinatorial bounds and counting.
J. Discrete Algorithms, 2009
J. Comb. Optim., 2009
Discret. Appl. Math., 2009
Algorithmica, 2009
Pareto Complexity of TwoParameter FPT Problems: A Case Study for Partial Vertex Cover.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009
2008
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008
Competitive Search for Longest Empty Intervals.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
2007
Discret. Appl. Math., 2007
Proceedings of the GraphTheoretic Concepts in Computer Science, 2007
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.
Proceedings of the STACS 2007, 2007
2006
Theor. Comput. Sci., 2006
J. Sched., 2006
Pattern Recognit., 2006
J. Mach. Learn. Res., 2006
A remark on the subsequence problem for arcannotated sequences with pairwise nested arcs.
Inf. Process. Lett., 2006
Randomized vs. deterministic distance query strategies for point location on the line.
Discret. Appl. Math., 2006
Algorithmica, 2006
Proceedings of the EuroPar 2006, Parallel Processing, 12th International EuroPar Conference, Dresden, Germany, August 28, 2006
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006
2005
Theor. Comput. Sci., 2005
Optimal group testing algorithms with interval queries and their application to splice site detection.
Int. J. Bioinform. Res. Appl., 2005
Electron. Notes Discret. Math., 2005
Proceedings of the GraphTheoretic Concepts in Computer Science, 2005
Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection.
Proceedings of the Computational Science, 2005
2004
J. Sched., 2004
Discret. Appl. Math., 2004
2003
Theor. Comput. Sci., 2003
J. Comput. Syst. Sci., 2003
Discret. Math., 2003
Discret. Appl. Math., 2003
Discret. Appl. Math., 2003
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003
2002
Theor. Comput. Sci., 2002
Theor. Comput. Sci., 2002
Inf. Process. Lett., 2002
2001
Discret. Appl. Math., 2001
Worstcase bounds for blind broadcasting in smalldegree networks.
Proceedings of the SIROCCO 8, 2001
2000
Mach. Learn., 2000
Discret. Math., 2000
Proceedings of the GraphTheoretic Concepts in Computer Science, 2000
Proceedings of the Algorithm Theory, 2000
1998
Inf. Process. Lett., 1998
Proceedings of the LATIN '98: Theoretical Informatics, 1998
Delayed Correction  Binary Search with Errors Made Very Simple but Efficient.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998
1997
Theor. Comput. Sci., 1997
Proceedings of the EuroPar '97 Parallel Processing, 1997
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997
1996
Coping with Sparse Inputs on Enhanced Meshes  Semigroup Computation with COMMON CRCW Buses.
Proceedings of IPPS '96, 1996
1995
Pattern Recognit. Lett., 1995
Inf. Process. Lett., 1995
Proceedings of the GraphTheoretic Concepts in Computer Science, 1995
Proceedings of the STACS 95, 1995
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search.
Proceedings of the Algorithms, 1995
1994
Discret. Math., 1994
Discret. Appl. Math., 1994
Discret. Appl. Math., 1994
The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs.
Discret. Appl. Math., 1994
Berechnungskomplexität der Erkennung der semantischen Unabhängigkeit von Relationen.
PhD thesis, 1994
1993
Discret. Math., 1993
1992
Discret. Appl. Math., 1992
1991
Discret. Math., 1991
Proceedings of the 17th International Workshop, 1991
1990
J. Graph Theory, 1990
Inf. Process. Lett., 1990
Proceedings of the GraphTheoretic Concepts in Computer Science, 1990
1989
Inf. Process. Lett., 1989