The following pages link to Olgica Milenković (Q1801072):
Displayed 36 items.
- Paired threshold graphs (Q1801073) (← links)
- Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
- On the triangle clique cover and \(K_t\) clique cover problems (Q2279271) (← links)
- Computing similarity distances between rankings (Q2410235) (← links)
- Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping (Q2706002) (← links)
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← links)
- Codes for DNA Sequence Profiles (Q2976761) (← links)
- An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation (Q2986110) (← links)
- Hybrid Noncoherent Network Coding (Q2989176) (← links)
- Error-Correction in Flash Memories via Codes in the Ulam Metric (Q2989267) (← links)
- MaxMinSum Steiner Systems for Access Balancing in Distributed Storage (Q3174717) (← links)
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding (Q3547746) (← links)
- Shannon capacity of M-ary redundant multitrack runlength limited codes (Q4400287) (← links)
- Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction (Q4569203) (← links)
- Mutually Uncorrelated Primers for DNA-Based Data Storage (Q4682915) (← links)
- Repairing Reed-Solomon Codes With Multiple Erasures (Q4682937) (← links)
- (Q4969175) (← links)
- Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein” (Q5001709) (← links)
- Repairing Reed-Solomon Codes via Subspace Polynomials (Q5032504) (← links)
- Set-Codes with Small Intersections and Small Discrepancies (Q5112823) (← links)
- Motif and Hypergraph Correlation Clustering (Q5123914) (← links)
- Coded Trace Reconstruction (Q5138794) (← links)
- Unique Reconstruction of Coded Strings From Multiset Substring Spectra (Q5211529) (← links)
- Sorting of Permutations by Cost-Constrained Transpositions (Q5272144) (← links)
- On the Hardness of Approximating Stopping and Trapping Sets (Q5281524) (← links)
- Asymmetric Lee Distance Codes for DNA-Based Storage (Q5369848) (← links)
- Correlation Clustering and Biclustering With Locally Bounded Errors (Q5375565) (← links)
- Query-based selection of optimal candidates under the Mallows model (Q6057847) (← links)
- Novel Distance Measures for Vote Aggregation (Q6231931) (← links)
- Nonuniform Vote Aggregation Algorithms (Q6233896) (← links)
- Codes for DNA Storage Channels (Q6256002) (← links)
- Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations (Q6269649) (← links)
- Finding the Second-Best Candidate under the Mallows Model (Q6353801) (← links)
- Balanced and Swap-Robust Trades for Dynamical Distributed Storage (Q6388913) (← links)
- The Gapped $k$-Deck Problem (Q6389592) (← links)
- A combinatorial proof for the secretary problem with multiple choices (Q6428380) (← links)