| Publication | Date of Publication | Type |
|---|
| Minimizing the alphabet size in codes with restricted error sets | 2024-07-23 | Paper |
| Competitive channel-capacity | 2024-07-23 | Paper |
| Reduced-Rank L1-Norm Principal-Component Analysis With Performance Guarantees | 2022-09-23 | Paper |
| Latency and Alphabet Size in the Context of Multicast Network Coding | 2022-07-13 | Paper |
| The Birthday Problem and Zero-Error List Codes | 2021-09-07 | Paper |
| Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases | 2021-09-07 | Paper |
| Minimizing the alphabet size of erasure codes with restricted decoding sets | 2020-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5212563 | 2020-01-29 | Paper |
| Sufficiently Myopic Adversaries Are Blind | 2020-01-28 | Paper |
| The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding | 2020-01-28 | Paper |
| The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels | 2019-07-19 | Paper |
| The Unbounded Benefit of Encoder Cooperation for the k-User MAC | 2018-09-14 | Paper |
| Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding | 2018-09-14 | Paper |
| Can Negligible Rate Increase Network Reliability? | 2018-09-14 | Paper |
| Constructing cospectral graphs via a new form of graph product | 2018-08-13 | Paper |
| Tight Network Topology Dependent Bounds on Rounds of Communication | 2018-07-16 | Paper |
| Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel | 2018-06-27 | Paper |
| Network Coding: A Computational Perspective | 2017-08-08 | Paper |
| On the Hardness of Approximating the Network Coding Capacity | 2017-07-27 | Paper |
| Constant-Weight Gray Codes for Local Rank Modulation | 2017-07-12 | Paper |
| Trajectory Codes for Flash Memory | 2017-06-08 | Paper |
| Generalized Gray Codes for Local Rank Modulation | 2017-06-08 | Paper |
| Upper Bounds on the Capacity of Binary Channels With Causal Adversaries | 2017-06-08 | Paper |
| H-wise independence | 2017-05-16 | Paper |
| Communication Efficient Secret Sharing | 2017-04-28 | Paper |
| A Characterization of the Number of Subsequences Obtained via the Deletion Channel | 2017-04-28 | Paper |
| Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes | 2017-04-28 | Paper |
| Coded Cooperative Data Exchange Problem for General Topologies | 2017-04-28 | Paper |
| An Equivalence Between Network Coding and Index Coding | 2017-04-28 | Paper |
| Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound | 2017-01-04 | Paper |
| A Characterization of the Capacity of Online (causal) Binary Channels | 2015-08-21 | Paper |
| Fault-tolerant spanners for general graphs | 2015-02-04 | Paper |
| A unified framework for approximating and clustering data | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417651 | 2014-05-22 | Paper |
| Distributed broadcasting and mapping protocols in directed anonymous networks | 2014-03-13 | Paper |
| \(f\)-sensitivity distance oracles and routing schemes | 2012-12-06 | Paper |
| Edge distribution in generalized graph products | 2012-11-07 | Paper |
| Fault Tolerant Spanners for General Graphs | 2011-04-04 | Paper |
| Approximating Maximum Subgraphs without Short Cycles | 2011-03-15 | Paper |
| f-Sensitivity Distance Oracles and Routing Schemes | 2010-09-06 | Paper |
| Correct Hardware Design and Verification Methods | 2010-02-05 | Paper |
| Contraction and expansion of convex sets | 2009-12-14 | Paper |
| Resilient Network Coding in the Presence of Byzantine Adversaries | 2009-02-24 | Paper |
| Optimal Universal Schedules for Discrete Broadcast | 2009-02-24 | Paper |
| Oblivious Communication Channels and Their Capacity | 2009-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3547208 | 2008-12-21 | Paper |
| Approximating Maximum Subgraphs without Short Cycles | 2008-11-27 | Paper |
| Approximation Algorithms for Graph Homomorphism Problems | 2007-08-28 | Paper |
| The multi-multiway cut problem | 2007-06-06 | Paper |
| The RPR2 rounding technique for semidefinite programs | 2006-08-14 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers | 2005-02-21 | Paper |
| Improved approximation of Max-Cut on graphs of bounded degree | 2002-09-30 | Paper |
| A note on approximating Max-Bisection on regular graphs | 2002-07-14 | Paper |
| Approximation algorithms for maximization problems arising in graph partitioning | 2002-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535020 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753732 | 2001-11-11 | Paper |
