| Publication | Date of Publication | Type |
|---|
| Hardness and approximation of multiple sequence alignment with column score | 2023-02-01 | Paper |
| On the intractability landscape of digraph intersection representations | 2022-08-30 | Paper |
| On the redundancy of \(D\)-ary Fano codes | 2022-03-24 | Paper |
| The tandem duplication distance problem is hard over bounded alphabets | 2022-03-22 | Paper |
| On the complexity of directed intersection representation of DAGs | 2021-04-21 | Paper |
| Information Theoretical Clustering Is Hard to Approximate | 2021-02-22 | Paper |
| On infinite prefix normal words | 2021-02-15 | Paper |
| On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem | 2020-12-29 | Paper |
| On infinite prefix normal words | 2020-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5219835 | 2020-03-12 | Paper |
| On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice | 2020-01-29 | Paper |
| Minimum-Entropy Couplings and Their Applications | 2019-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4627751 | 2019-03-11 | Paper |
| Correction to: ``Trading off worst and expected cost in decision tree problems | 2019-01-11 | Paper |
| Bubble-flip -- a new generation algorithm for prefix normal words | 2018-08-23 | Paper |
| A Combinatorial Model of Two-Sided Search | 2018-07-24 | Paper |
| Bounds on the Entropy of a Function of a Random Variable and Their Applications | 2018-06-27 | Paper |
| Bubble-flip -- a new generation algorithm for prefix normal words | 2018-06-26 | Paper |
| Decision trees for function evaluation: simultaneous optimization of worst and expected cost | 2017-11-09 | Paper |
| Trading off worst and expected cost in decision tree problems | 2017-11-09 | Paper |
| Two Batch Search With Lie Cost | 2017-08-08 | Paper |
| On the Tree Search Problem with Non-uniform Costs | 2016-10-21 | Paper |
| On the tree search problem with non-uniform costs | 2016-09-01 | Paper |
| A Combinatorial Model of Two-Sided Search | 2016-03-10 | Paper |
| Trading off Worst and Expected Cost in Decision Tree Problems | 2016-01-11 | Paper |
| On the complexity of the vector connectivity problem | 2015-07-13 | Paper |
| Spread of influence in weighted networks under time and budget constraints | 2015-05-26 | Paper |
| Approximating decision trees with value dependent testing costs | 2015-05-21 | Paper |
| Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic | 2015-04-17 | Paper |
| Perfect strategies for the Ulam-Rényi game with multi-interval questions | 2015-01-21 | Paper |
| Improved approximation algorithms for the average-case tree searching problem | 2014-12-02 | Paper |
| Latency-bounded target set selection in social networks | 2014-04-29 | Paper |
| Approximating the maximum consecutive subsums of a sequence | 2014-03-13 | Paper |
| Latency-Bounded Target Set Selection in Social Networks | 2013-08-05 | Paper |
| On the approximability and exact algorithms for vector domination and related problems in graphs | 2013-04-18 | Paper |
| On approximate jumbled pattern matching in strings | 2012-12-06 | Paper |
| The binary identification problem for weighted trees | 2012-11-08 | Paper |
| A linear algorithm for string reconstruction in the reverse complement equivalence model | 2012-09-13 | Paper |
| ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS | 2012-08-30 | Paper |
| Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence | 2012-08-14 | Paper |
| Graphs of separability at most 2 | 2012-05-11 | Paper |
| On the complexity of searching in trees and partially ordered structures | 2011-12-07 | Paper |
| Competitive evaluation of threshold functions in the priced information model | 2011-11-17 | Paper |
| Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs | 2011-08-19 | Paper |
| Binary Identification Problems for Weighted Trees | 2011-08-12 | Paper |
| Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case | 2011-08-10 | Paper |
| On the competitive ratio of evaluating priced functions | 2011-07-14 | Paper |
| Graphs of Separability at Most Two: Structural Characterizations and Their Consequences | 2011-05-19 | Paper |
| Efficient Reconstruction of RC-Equivalent Strings | 2011-05-19 | Paper |
| Fault-tolerant search algorithms. Reliable computation with unreliable information | 2011-02-14 | Paper |
| On Greedy Algorithms for Decision Trees | 2010-12-09 | Paper |
| On the Complexity of Searching in Trees: Average-Case Minimization | 2010-09-07 | Paper |
| Superselectors: Efficient Constructions and Applications | 2010-09-06 | Paper |
| A new strategy for querying priced information | 2010-08-16 | Paper |
| On the competitive ratio of evaluating priced functions | 2010-08-16 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Faster deterministic communication in radio networks | 2009-06-22 | Paper |
| Binary search with delayed and missing answers | 2009-03-23 | Paper |
| Computing with Priced Information: When the Value Makes the Price | 2009-01-29 | Paper |
| Q-Ary Ulam-Renyi Game with Constrained Lies | 2009-01-22 | Paper |
| Bounding the Average Length of Optimal Source Codes Via Majorization Theory | 2008-12-21 | Paper |
| A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes | 2008-12-21 | Paper |
| Searching with lies under error cost constraints | 2008-09-29 | Paper |
| Function Evaluation Via Linear Programming in the Priced Information Model | 2008-08-28 | Paper |
| 2-Stage Fault Tolerant Interval Group Testing | 2008-05-27 | Paper |
| Faster Centralized Communication in Radio Networks | 2008-04-24 | Paper |
| Searching with lies under error transition cost constraints | 2007-05-29 | Paper |
| Q-ary Ulam-Rényi game with constrained lies | 2007-05-29 | Paper |
| Overlaps help: Improved bounds for group testing with interval queries | 2007-03-02 | Paper |
| Perfect minimally adaptive \(q\)-ary search with unreliable tests | 2006-10-30 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Supermodularity and subadditivity properties of the entropy on the majorization lattice | 2005-05-11 | Paper |
| On searching strategies, parallel questions, and delayed answers | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472483 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766824 | 2002-10-22 | Paper |
| An improved heuristic for the ``Ulam-Rényi game | 2002-07-25 | Paper |
| Least adaptive optimal search with unreliable tests | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2704221 | 2002-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722011 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938780 | 2000-11-27 | Paper |
| Perfect two-fault tolerant search with minimum adaptiveness | 2000-11-16 | Paper |
| Optimal strategies against a liar | 2000-06-04 | Paper |
| Classifying through a fuzzy algebraic structure | 1997-06-09 | Paper |
