| Publication | Date of Publication | Type |
|---|
| Optimal stopping methodology for the secretary problem with random queries | 2024-05-10 | Paper |
| Query-based selection of optimal candidates under the Mallows model | 2023-10-26 | Paper |
| A combinatorial proof for the secretary problem with multiple choices | 2023-03-04 | Paper |
| Repairing Reed-Solomon Codes via Subspace Polynomials | 2022-02-17 | Paper |
| The Gapped $k$-Deck Problem | 2022-01-29 | Paper |
| Balanced and Swap-Robust Trades for Dynamical Distributed Storage | 2022-01-22 | Paper |
| Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein” | 2021-07-23 | Paper |
| Coded Trace Reconstruction | 2020-12-04 | Paper |
| Finding the Second-Best Candidate under the Mallows Model | 2020-11-15 | Paper |
| Access balancing in storage systems by labeling partial Steiner systems | 2020-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4969175 | 2020-10-05 | Paper |
| Motif and Hypergraph Correlation Clustering | 2020-09-29 | Paper |
| Set-Codes with Small Intersections and Small Discrepancies | 2020-06-09 | Paper |
| Unique Reconstruction of Coded Strings From Multiset Substring Spectra | 2020-01-28 | Paper |
| On the triangle clique cover and \(K_t\) clique cover problems | 2019-12-12 | Paper |
| Paired threshold graphs | 2018-10-26 | Paper |
| Mutually Uncorrelated Primers for DNA-Based Data Storage | 2018-09-19 | Paper |
| Repairing Reed-Solomon Codes With Multiple Erasures | 2018-09-19 | Paper |
| Correlation Clustering and Biclustering With Locally Bounded Errors | 2018-09-14 | Paper |
| MaxMinSum Steiner Systems for Access Balancing in Distributed Storage | 2018-07-18 | Paper |
| Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction | 2018-06-27 | Paper |
| Asymmetric Lee Distance Codes for DNA-Based Storage | 2017-10-19 | Paper |
| Computing similarity distances between rankings | 2017-10-17 | Paper |
| On the Hardness of Approximating Stopping and Trapping Sets | 2017-07-27 | Paper |
| Sorting of Permutations by Cost-Constrained Transpositions | 2017-07-12 | Paper |
| Hybrid Noncoherent Network Coding | 2017-06-08 | Paper |
| Error-Correction in Flash Memories via Codes in the Ulam Metric | 2017-06-08 | Paper |
| An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation | 2017-05-16 | Paper |
| Codes for DNA Sequence Profiles | 2017-04-28 | Paper |
| Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations | 2016-01-23 | Paper |
| Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds | 2015-09-22 | Paper |
| Codes for DNA Storage Channels | 2014-10-31 | Paper |
| Nonuniform Vote Aggregation Algorithms | 2012-06-22 | Paper |
| Novel Distance Measures for Vote Aggregation | 2012-03-28 | Paper |
| Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding | 2008-12-21 | Paper |
| Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping | 2001-03-19 | Paper |
| Shannon capacity of M-ary redundant multitrack runlength limited codes | 1998-10-27 | Paper |
