Peter Damaschke

Optim. Lett., 2017

Refined algorithms for hitting many intervals.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Finding defectives on a line by random docking and interval group tests.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2017

2016

Deterministic versus randomized adaptive test cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Sufficient conditions for edit-optimal clusters.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Adaptive group testing with a constrained number of positive responses improved.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Summarizing Online User Reviews Using Bicliques.

[BibT_eX]

[DOI]

Olof Mogren

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Computing Giant Graph Diameters.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

Finding and enumerating large intersections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Parameterizations of hitting set of bundles and inverse scope.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Pairs Covered by a Sequence of Sets.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Randomized Adaptive Test Cover.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Editing Simple Graphs.

[BibT_eX]

[DOI]

Olof Mogren

J. Graph Algorithms Appl., 2014

Strict group testing and the set basis problem.

[BibT_eX]

[DOI]

Gábor Wiener

J. Comb. Theory A, 2014

Enumerating maximal bicliques in bipartite graphs with favorable degree sequences.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Editing the Simplest Graphs.

[BibT_eX]

[DOI]

Olof Mogren

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013

Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Two New Perspectives on Multi-Stage Group Testing.

[BibT_eX]

[DOI]

Eberhard Triesch

Algorithmica, 2013

Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems.

[BibT_eX]

[DOI]

Ömer Egecioglu

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Cluster Editing with Locally Bounded Modifications Revisited.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

A note on the parameterized complexity of unordered maximum tree orientation.

[BibT_eX]

[DOI]

Sebastian Böcker

Discret. Appl. Math., 2012

Randomized Group Testing Both Query-Optimal and Minimal Adaptive.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Networks, 2011

Even faster parameterized cluster deletion and cluster editing.

[BibT_eX]

[DOI]

Sebastian Böcker

Inf. Process. Lett., 2011

Bounds for Nonadaptive Group Tests to estimate the Amount of Defectives.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2011

Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Parameterized Reductions and Algorithms for Another Vertex Cover Generalization.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

2010

Fixed-Parameter Enumerability of Cluster Editing and Related Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

Homogeneous String Segmentation using Trees and Weighted Independent Sets.

[BibT_eX]

[DOI]

Algorithmica, 2010

2009

The union of minimal hitting sets: Parameterized combinatorial bounds and counting.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Multiple hypernode hitting sets and smallest two-cores with targets.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Ranking hypotheses to minimize the search cost in probabilistic inference models.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Online Search with Time-Varying Price Bounds.

[BibT_eX]

[DOI]

Phuong Hoai Ha

Philippas Tsigas

Algorithmica, 2009

Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008

Minimum Common String Partition Parameterized.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Competitive Search for Longest Empty Intervals.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Overlaps help: Improved bounds for group testing with interval queries.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Segmenting Strings Homogeneously Via Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

2006

Parameterized enumeration, transversals, and imperfect phylogeny reconstruction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Scheduling search procedures: The wheel of fortune.

[BibT_eX]

[DOI]

J. Sched., 2006

Fast algorithms for finding disjoint subsequences with extremal densities.

[BibT_eX]

[DOI]

Anders Bergkvist

Pattern Recognit., 2006

Linear Programs for Hypotheses Selection in Probabilistic Inference Models.

[BibT_eX]

[DOI]

Anders Bergkvist

Marcel Lüthi

J. Mach. Learn. Res., 2006

A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Randomized vs. deterministic distance query strategies for point location on the line.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Multiple Spin-Block Decisions.

[BibT_eX]

[DOI]

Algorithmica, 2006

Competitive Freshness Algorithms for Wait-Free Data Objects.

[BibT_eX]

[DOI]

Phuong Hoai Ha

Philippas Tsigas

Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

Fixed-Parameter Tractable Generalizations of Cluster Editing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

On queuing lengths in on-line switching.

[BibT_eX]

[DOI]

Zhen Zhou

Theor. Comput. Sci., 2005

Optimal group testing algorithms with interval queries and their application to splice site detection.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Ugo Vaccaro

Int. J. Bioinform. Res. Appl., 2005

Threshold Group Testing.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On the Fixed-Parameter Enumerability of Cluster Editing.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Ugo Vaccaro

Proceedings of the Computational Science, 2005

2004

Scheduling Search Procedures.

[BibT_eX]

[DOI]

J. Sched., 2004

Approximate location of relevant variables under the crossover distribution.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

Nearly optimal strategies for special cases of on-line capital investment.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On parallel attribute-efficient learning.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Linear-time recognition of bipartite graphs plus two edges.

[BibT_eX]

[DOI]

Discret. Math., 2003

Point placement on the line by distance data.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Powers of geometric intersection graphs and dispersion algorithms.

[BibT_eX]

[DOI]

Geir Agnarsson

Magnús M. Halldórsson

Discret. Appl. Math., 2003

Distributed Soft Path Coloring.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Fast Perfect Phylogeny Haplotype Inference.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Two short notes on the on-line travelling salesman: handling times and lookahead.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Online strategies for backups.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Optimizing a mail-order with discount and shipping costs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2001

Minus domination in small-degree graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Worst-case bounds for blind broadcasting in small-degree networks.

[BibT_eX]

Proceedings of the SIROCCO 8, 2001

2000

Adaptive Versus Nonadaptive Attribute-Efficient Learning.

[BibT_eX]

[DOI]

Mach. Learn., 2000

Degree-preserving spanning trees in small-degree graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

Efficient Dispersion Algorithms for Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Parallel Attribute-Efficient Learning of Monotone Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

1998

Randomized Group Testing for Mutually Obscuring Defectives.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

A Chip Search Problem on Binary Numbers.

[BibT_eX]

[DOI]

Proceedings of the LATIN '98: Theoretical Informatics, 1998

Delayed Correction - Binary Search with Errors Made Very Simple but Efficient.

[BibT_eX]

Frank Albers

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

Computational Aspects of Parallel Attribute-Efficient Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997

An Optimal Parallel Algorithm for Digital Curve Segmentation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Finding a Pair on a Mesh with Multiple Broadcasting is Hard.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '97 Parallel Processing, 1997

The Algorithmic Complexity of Chemical Threshold Testing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses.

[BibT_eX]

[DOI]

Proceedings of IPPS '96, 1996

1995

The linear time recognition of digital arcs.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1995

A Parallel Algorithm for Nearly Optimal Edge Search.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Searching for Faulty Leaves in Binary Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Line Segmentation of Digital Curves in Parallel.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Searching for a Monotone Function by Independent Threshold Queries.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Dominating cliques in chordal graphs.

[BibT_eX]

[DOI]

Dieter Kratsch

Anna Lubiw

Discret. Math., 1994

PLA Folding in Special Graph Classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

A Tight Upper Bound for Group Testing in Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs.

[BibT_eX]

[DOI]

Elias Dahlhaus

Discret. Appl. Math., 1994

Berechnungskomplexität der Erkennung der semantischen Unabhängigkeit von Relationen.

[BibT_eX]

PhD thesis, 1994

1993

Paths in interval graphs and circular arc graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

1992

Distances in cocomparability graphs and their powers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

Irredundance number versus domination number.

[BibT_eX]

[DOI]

Discret. Math., 1991

Logic Arrays for Interval Indicator Functions.

[BibT_eX]

[DOI]

Proceedings of the 17th International Workshop, 1991

1990

Induced subgraphs and well-quasi-ordering.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

Domination in Convex and Chordal Bipartite Graphs.

[BibT_eX]

[DOI]

Haiko Müller

Dieter Kratsch

Inf. Process. Lett., 1990

Induced Subgraph Isomorphism for Cographs in NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

1989

The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete.

[BibT_eX]

[DOI]