List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The complexity of the matroid-greedoid partition problem Theoretical Computer Science | 2009-03-17 | Paper |
| Tracing Many Users With Almost No Rate Penalty IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| Edge Colouring with Delays Combinatorics, Probability and Computing | 2007-07-30 | Paper |
| Tracing a single user European Journal of Combinatorics | 2006-11-15 | Paper |
| Learning a Hidden Subgraph SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Lecture Notes in Computer Science | 2005-08-25 | Paper |
| Automata, Languages and Programming Lecture Notes in Computer Science | 2005-08-24 | Paper |
| Sparse universal graphs Journal of Computational and Applied Mathematics | 2002-08-22 | Paper |
Research outcomes over time
This page was built for person: Vera Asodi
