| Publication | Date of Publication | Type |
|---|
| On constrained intersection representations of graphs and digraphs | 2024-09-11 | Paper |
Hardness and approximation of multiple sequence alignment with column score
Theoretical Computer Science | 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
(available as arXiv preprint) | 2022-03-22 | Paper |
| On the complexity of directed intersection representation of DAGs | 2021-04-21 | Paper |
Information Theoretical Clustering Is Hard to Approximate
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
On infinite prefix normal words
Theoretical Computer Science | 2021-02-15 | Paper |
On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem
Discrete Applied Mathematics | 2020-12-29 | Paper |
On infinite prefix normal words
SOFSEM 2019: Theory and Practice of Computer Science | 2020-10-22 | Paper |
| Optimal strategies for a model of combinatorial two-sided search | 2020-03-12 | Paper |
On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
Theoretical Computer Science | 2020-01-29 | Paper |
Minimum-Entropy Couplings and Their Applications
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| scientific article; zbMATH DE number 7034309 (Why is no real title available?) | 2019-03-11 | Paper |
Correction to: ``Trading off worst and expected cost in decision tree problems
Algorithmica | 2019-01-11 | Paper |
Bubble-flip -- a new generation algorithm for prefix normal words
Theoretical Computer Science | 2018-08-23 | Paper |
A Combinatorial Model of Two-Sided Search
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Bounds on the Entropy of a Function of a Random Variable and Their Applications
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Bubble-flip -- a new generation algorithm for prefix normal words
Language and Automata Theory and Applications | 2018-06-26 | Paper |
Decision trees for function evaluation: simultaneous optimization of worst and expected cost
Algorithmica | 2017-11-09 | Paper |
Trading off worst and expected cost in decision tree problems
Algorithmica | 2017-11-09 | Paper |
Two Batch Search With Lie Cost
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On the tree search problem with non-uniform costs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
On the tree search problem with non-uniform costs
Theoretical Computer Science | 2016-09-01 | Paper |
Trading off worst and expected cost in decision tree problems
Algorithms and Computation | 2016-01-11 | Paper |
On the complexity of the vector connectivity problem
Theoretical Computer Science | 2015-07-13 | Paper |
Spread of influence in weighted networks under time and budget constraints
Theoretical Computer Science | 2015-05-26 | Paper |
Approximating decision trees with value dependent testing costs
Information Processing Letters | 2015-05-21 | Paper |
Recent developments of feedback coding and its relations with many-valued logic
Proof, Computation and Agency | 2015-04-17 | Paper |
Perfect strategies for the Ulam-Rényi game with multi-interval questions
Theory of Computing Systems | 2015-01-21 | Paper |
Improved approximation algorithms for the average-case tree searching problem
Algorithmica | 2014-12-02 | Paper |
Latency-bounded target set selection in social networks
Theoretical Computer Science | 2014-04-29 | Paper |
Approximating the maximum consecutive subsums of a sequence
Theoretical Computer Science | 2014-03-13 | Paper |
Latency-bounded target set selection in social networks
Lecture Notes in Computer Science | 2013-08-05 | Paper |
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics | 2013-04-18 | Paper |
On approximate jumbled pattern matching in strings
Theory of Computing Systems | 2012-12-06 | Paper |
The binary identification problem for weighted trees
Theoretical Computer Science | 2012-11-08 | Paper |
A linear algorithm for string reconstruction in the reverse complement equivalence model
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Algorithms for jumbled pattern matching in strings
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Graphs of separability at most 2
Discrete Applied Mathematics | 2012-05-11 | Paper |
On the complexity of searching in trees and partially ordered structures
Theoretical Computer Science | 2011-12-07 | Paper |
Competitive evaluation of threshold functions in the priced information model
Annals of Operations Research | 2011-11-17 | Paper |
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Binary identification problems for weighted trees
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
Discrete Applied Mathematics | 2011-08-10 | Paper |
On the competitive ratio of evaluating priced functions
Journal of the ACM | 2011-07-14 | Paper |
Graphs of separability at most two: structural characterizations and their consequences
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Efficient Reconstruction of RC-Equivalent Strings
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Fault-tolerant search algorithms. Reliable computation with unreliable information
Monographs in Theoretical Computer Science. An EATCS Series | 2011-02-14 | Paper |
On greedy algorithms for decision trees
Algorithms and Computation | 2010-12-09 | Paper |
On the complexity of searching in trees: average-case minimization
Automata, Languages and Programming | 2010-09-07 | Paper |
Superselectors: efficient constructions and applications
Algorithms – ESA 2010 | 2010-09-06 | Paper |
A new strategy for querying priced information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the competitive ratio of evaluating priced functions
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Faster deterministic communication in radio networks
Algorithmica | 2009-06-22 | Paper |
Binary search with delayed and missing answers
Information Processing Letters | 2009-03-23 | Paper |
Computing with Priced Information: When the Value Makes the Price
Algorithms and Computation | 2009-01-29 | Paper |
Q-Ary Ulam-Renyi Game with Constrained Lies
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Bounding the Average Length of Optimal Source Codes Via Majorization Theory
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Searching with lies under error cost constraints
Discrete Applied Mathematics | 2008-09-29 | Paper |
Function Evaluation Via Linear Programming in the Priced Information Model
Automata, Languages and Programming | 2008-08-28 | Paper |
2-Stage Fault Tolerant Interval Group Testing
Algorithms and Computation | 2008-05-27 | Paper |
Faster Centralized Communication in Radio Networks
Algorithms and Computation | 2008-04-24 | Paper |
Q-ary Ulam-Rényi game with constrained lies
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Searching with lies under error transition cost constraints
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Overlaps help: Improved bounds for group testing with interval queries
Discrete Applied Mathematics | 2007-03-02 | Paper |
Perfect minimally adaptive \(q\)-ary search with unreliable tests
Journal of Statistical Planning and Inference | 2006-10-30 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Supermodularity and subadditivity properties of the entropy on the majorization lattice
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On searching strategies, parallel questions, and delayed answers
Discrete Applied Mathematics | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2080238 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1696632 (Why is no real title available?) | 2002-10-22 | Paper |
An improved heuristic for the ``Ulam-Rényi game
Information Processing Letters | 2002-07-25 | Paper |
Least adaptive optimal search with unreliable tests
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1577986 (Why is no real title available?) | 2002-01-31 | Paper |
| scientific article; zbMATH DE number 1617287 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1405795 (Why is no real title available?) | 2000-11-27 | Paper |
Perfect two-fault tolerant search with minimum adaptiveness
Advances in Applied Mathematics | 2000-11-16 | Paper |
Optimal strategies against a liar
Theoretical Computer Science | 2000-06-04 | Paper |
Classifying through a fuzzy algebraic structure
Fuzzy Sets and Systems | 1997-06-09 | Paper |
