| Publication | Date of Publication | Type |
|---|
| On central placements of new vertices in a planar point set | 2024-12-12 | Paper |
| A linear-time optimal broadcasting algorithm in stars of cliques | 2024-11-12 | Paper |
| Distance-based solution of patrolling problems with individual waiting times | 2024-08-13 | Paper |
| Searching for faulty leaves in binary trees | 2024-02-28 | Paper |
| An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search | 2023-05-08 | Paper |
| Searching for a monotone function by independent threshold queries | 2023-03-21 | Paper |
| Two Robots Patrolling on a Line: Integer Version and Approximability | 2022-10-13 | Paper |
| Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges | 2022-10-13 | Paper |
| On an ordering problem in weighted hypergraphs | 2022-03-22 | Paper |
| An Optimization Problem Related to Bloom Filters with Bit Patterns | 2020-10-21 | Paper |
| Enumerating Grid Layouts of Graphs | 2020-09-04 | Paper |
| Dividing splittable goods evenly and with limited fragmentation | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5109048 | 2020-05-07 | Paper |
| Branch-and-bound for the precedence constrained generalized traveling salesman problem | 2020-04-07 | Paper |
| Dividing splittable goods evenly and with limited fragmentation | 2020-04-01 | Paper |
| Optimal partial clique edge covering guided by potential energy minimization | 2019-10-18 | Paper |
| Parameterized mixed graph coloring | 2019-06-25 | Paper |
| Combinatorial search in two and more rounds | 2019-06-06 | Paper |
| Saving probe bits by cube domination | 2018-11-22 | Paper |
| The solution space of sorting with recurring comparison faults | 2018-08-03 | Paper |
| Line segmentation of digital curves in parallel | 2017-12-04 | Paper |
| Calculating approximation guarantees for partial set cover of pairs | 2017-11-09 | Paper |
| Finding defectives on a line by random docking and interval group tests | 2017-10-20 | Paper |
| Refined algorithms for hitting many intervals | 2016-11-23 | Paper |
| Deterministic versus randomized adaptive test cover | 2016-10-21 | Paper |
| Computing Giant Graph Diameters | 2016-09-29 | Paper |
| The Solution Space of Sorting with Recurring Comparison Faults | 2016-09-29 | Paper |
| Randomized group testing for mutually obscuring defectives | 2016-06-09 | Paper |
| Adaptive group testing with a constrained number of positive responses improved | 2016-04-07 | Paper |
| Sufficient conditions for edit-optimal clusters | 2016-01-05 | Paper |
| Pairs Covered by a Sequence of Sets | 2015-09-29 | Paper |
| Randomized Adaptive Test Cover | 2015-09-21 | Paper |
| Finding and enumerating large intersections | 2015-05-18 | Paper |
| Parameterizations of hitting set of bundles and inverse scope | 2015-05-11 | Paper |
| Editing Simple Graphs | 2015-01-15 | Paper |
| Strict group testing and the set basis problem | 2014-06-03 | Paper |
| Enumerating maximal bicliques in bipartite graphs with favorable degree sequences | 2014-04-17 | Paper |
| Editing the Simplest Graphs | 2014-02-18 | Paper |
| Cluster Editing with Locally Bounded Modifications Revisited | 2014-01-17 | Paper |
| Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing | 2014-01-13 | Paper |
| Two new perspectives on multi-stage group testing | 2013-11-11 | Paper |
| A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies | 2013-06-11 | Paper |
| Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems | 2013-04-12 | Paper |
| Even faster parameterized cluster deletion and cluster editing | 2013-04-04 | Paper |
| Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover | 2012-10-16 | Paper |
| Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover | 2012-10-11 | Paper |
| Bounds for nonadaptive group tests to estimate the amount of defectives | 2012-08-27 | Paper |
| A note on the parameterized complexity of unordered maximum tree orientation | 2012-06-18 | Paper |
| Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing | 2012-06-15 | Paper |
| Randomized Group Testing Both Query-Optimal and Minimal Adaptive | 2012-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093394 | 2011-10-12 | Paper |
| Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries | 2011-08-16 | Paper |
| Parameterized Reductions and Algorithms for Another Vertex Cover Generalization | 2011-08-12 | Paper |
| Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives | 2011-01-10 | Paper |
| COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY | 2010-12-15 | Paper |
| Homogeneous string segmentation using trees and weighted independent sets | 2010-05-28 | Paper |
| Fixed-parameter enumerability of cluster editing and related problems | 2010-05-10 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs | 2010-01-29 | Paper |
| Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms | 2010-01-14 | Paper |
| Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover | 2010-01-14 | Paper |
| The union of minimal hitting sets: parameterized combinatorial bounds and counting | 2009-12-10 | Paper |
| Multiple hypernode hitting sets and smallest two-cores with targets | 2009-12-02 | Paper |
| Online search with time-varying price bounds | 2009-10-23 | Paper |
| Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity | 2009-10-20 | Paper |
| Ranking hypotheses to minimize the search cost in probabilistic inference models | 2009-06-23 | Paper |
| Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets | 2009-01-27 | Paper |
| Threshold Group Testing | 2009-01-22 | Paper |
| Segmenting Strings Homogeneously Via Trees | 2008-07-01 | Paper |
| Scheduling search procedures | 2007-12-20 | Paper |
| The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting | 2007-09-03 | Paper |
| Threshold Group Testing | 2007-05-29 | Paper |
| Scheduling search procedures: The wheel of fortune | 2007-05-15 | Paper |
| Fixed-Parameter Tractable Generalizations of Cluster Editing | 2007-05-02 | Paper |
| Overlaps help: Improved bounds for group testing with interval queries | 2007-03-02 | Paper |
| Fast algorithms for finding disjoint subsequences with extremal densities | 2006-11-15 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Multiple spin-block decisions | 2006-06-14 | Paper |
| Randomized vs. deterministic distance query strategies for point location on the line | 2006-04-28 | Paper |
| Parameterized enumeration, transversals, and imperfect phylogeny reconstruction | 2006-04-06 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| On queuing lengths in on-line switching | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046486 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737164 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739611 | 2004-08-06 | Paper |
| Approximate location of relevant variables under the crossover distribution. | 2004-02-14 | Paper |
| Powers of geometric intersection graphs and dispersion algorithms | 2003-12-04 | Paper |
| On parallel attribute-efficient learning. | 2003-08-19 | Paper |
| Nearly optimal strategies for special cases of on-line capital investment. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418678 | 2003-08-11 | Paper |
| Linear-time recognition of bipartite graphs plus two edges | 2003-04-28 | Paper |
| Point placement on the line by distance data. | 2003-04-28 | Paper |
| Two short notes on the on-line travelling salesman: handling times and lookahead. | 2003-01-21 | Paper |
| Online strategies for backups | 2002-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542580 | 2002-08-01 | Paper |
| Optimizing a mail-order with discount and shipping costs | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766674 | 2002-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536938 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728892 | 2001-11-06 | Paper |
| Minus domination in small-degree graphs | 2001-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729102 | 2001-10-23 | Paper |
| Degree-preserving spanning trees in small-degree graphs | 2001-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722007 | 2001-07-11 | Paper |
| Adaptive versus nonadaptive attribute-efficient learning | 2001-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953350 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232774 | 1999-04-28 | Paper |
| An optimal parallel algorithm for digital curve segmentation | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126759 | 1997-04-01 | Paper |
| A parallel algorithm for nearly optimal edge search | 1997-02-27 | Paper |
| The linear time recognition of digital arcs | 1996-04-16 | Paper |
| The parallel solution of domination problems on chordal and strongly chordal graphs | 1994-09-27 | Paper |
| Dominating cliques in chordal graphs | 1994-09-15 | Paper |
| PLA folding in special graph classes | 1994-07-31 | Paper |
| A tight upper bound for group testing in graphs | 1994-05-15 | Paper |
| Paths in interval graphs and circular arc graphs | 1993-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694735 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028103 | 1993-03-28 | Paper |
| Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm | 1993-01-16 | Paper |
| Distances in cocomparability graphs and their powers | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971999 | 1992-06-25 | Paper |
| Irredundance number versus domination number | 1992-06-25 | Paper |
| Domination in convex and chordal bipartite graphs | 1990-01-01 | Paper |
| Induced subgraphs and well‐quasi‐ordering | 1990-01-01 | Paper |
| The Hamiltonian circuit problem for circle graphs is NP-complete | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4724678 | 1985-01-01 | Paper |
