| Dividing Splittable Goods Evenly and With Limited Fragmentation | 0 | 0.34 | 2020 |
| Combinatorial search in two and more rounds | 0 | 0.34 | 2019 |
| Optimal partial clique edge covering guided by potential energy minimization. | 0 | 0.34 | 2019 |
| Parameterized Mixed Graph Coloring | 0 | 0.34 | 2019 |
| An Optimization Problem Related to Bloom Filters with Bit Patterns. | 0 | 0.34 | 2018 |
| The Solution Space of Sorting with Recurring Comparison Faults. | 0 | 0.34 | 2018 |
| Saving Probe Bits by Cube Domination. | 0 | 0.34 | 2018 |
| Calculating approximation guarantees for partial set cover of pairs. | 1 | 0.36 | 2017 |
| Finding Defectives On A Line By Random Docking And Interval Group Tests | 0 | 0.34 | 2017 |
| Refined algorithms for hitting many intervals. | 0 | 0.34 | 2017 |
| Adaptive group testing with a constrained number of positive responses improved. | 0 | 0.34 | 2016 |
| Computing Giant Graph Diameters | 0 | 0.34 | 2016 |
| Sufficient conditions for edit-optimal clusters. | 1 | 0.35 | 2016 |
| Deterministic versus randomized adaptive test cover. | 0 | 0.34 | 2016 |
| Pairs covered by a sequence of sets | 1 | 0.39 | 2015 |
| Randomized Adaptive Test Cover | 0 | 0.34 | 2015 |
| Editing the Simplest Graphs. | 1 | 0.42 | 2014 |
| Enumerating maximal bicliques in bipartite graphs with favorable degree sequences | 2 | 0.37 | 2014 |
| A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies. | 1 | 0.36 | 2013 |
| Cluster Editing with Locally Bounded Modifications Revisited. | 1 | 0.36 | 2013 |
| Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. | 0 | 0.34 | 2013 |
| Two New Perspectives on Multi-Stage Group Testing. | 4 | 0.43 | 2013 |
| Error propagation in sparse linear systems with peptide-protein incidence matrices | 1 | 0.36 | 2012 |
| A note on the parameterized complexity of unordered maximum tree orientation. | 0 | 0.34 | 2012 |
| Randomized group testing both query-optimal and minimal adaptive | 11 | 0.51 | 2012 |
| Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover | 2 | 0.45 | 2012 |
| Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries | 0 | 0.34 | 2011 |
| Even faster parameterized cluster deletion and cluster editing | 20 | 0.78 | 2011 |
| Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing | 4 | 0.57 | 2011 |
| Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover | 0 | 0.34 | 2011 |
| Parameterized reductions and algorithms for another vertex cover generalization | 1 | 0.40 | 2011 |
| Bounds for nonadaptive group tests to estimate the amount of defectives | 5 | 0.47 | 2010 |
| Homogeneous String Segmentation using Trees and Weighted Independent Sets | 0 | 0.34 | 2010 |
| Fixed-Parameter Enumerability of Cluster Editing and Related Problems | 14 | 0.66 | 2010 |
| Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets | 2 | 0.39 | 2009 |
| Competitive group testing and learning hidden vertex covers with minimum adaptivity | 9 | 0.71 | 2009 |
| Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover | 2 | 0.40 | 2009 |
| Ranking hypotheses to minimize the search cost in probabilistic inference models | 0 | 0.34 | 2009 |
| Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms | 8 | 0.56 | 2009 |
| Online Search with Time-Varying Price Bounds | 9 | 0.74 | 2009 |
| Competitive Search for Longest Empty Intervals | 0 | 0.34 | 2008 |
| Minimum Common String Partition Parameterized | 12 | 0.85 | 2008 |
| The union of minimal hitting sets: Parameterized combinatorial bounds and counting | 11 | 0.66 | 2007 |
| Segmenting strings homogeneously via trees | 0 | 0.34 | 2007 |
| Overlaps help: Improved bounds for group testing with interval queries | 3 | 0.41 | 2007 |
| Scheduling search procedures: The wheel of fortune | 1 | 0.36 | 2006 |
| Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities | 7 | 0.52 | 2006 |
| Randomized vs. deterministic distance query strategies for point location on the line | 3 | 0.54 | 2006 |
| Parameterized enumeration, transversals, and imperfect phylogeny reconstruction | 34 | 1.47 | 2006 |
| Linear Programs for Hypotheses Selection in Probabilistic Inference Models | 2 | 0.39 | 2006 |
