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 |
|---|---|---|
| Nonlinear Index Coding Outperforming the Linear Optimum IEEE Transactions on Information Theory | 2017-08-08 | Paper |
| Can a graph have distinct regular partitions? SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
| Stability-type results for hereditary properties Journal of Graph Theory | 2009-12-18 | Paper |
| Hardness of edge-modification problems Theoretical Computer Science | 2009-11-06 | Paper |
| Can a Graph Have Distinct Regular Partitions? Lecture Notes in Computer Science | 2009-03-06 | Paper |
| What is the furthest graph from a hereditary property? Random Structures & Algorithms | 2008-09-04 | Paper |
| The maximum edit distance from hereditary graph properties Journal of Combinatorial Theory. Series B | 2008-07-24 | Paper |
| New Bounds on Parent-Identifying Codes: The Case of Multiple Parents Combinatorics, Probability and Computing | 2005-02-18 | Paper |
Research outcomes over time
This page was built for person: Uri Stav
