Goran Konjevod
Loading Google Thumbnails...
from Google Images |
- Sorted by Year/Conf, Year/Citation, Citation
| 2010 | ||
|---|---|---|
| 5 | Storage Capacity of Labeled Graphs. Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod. SSS 2010, 573-587. Web SearchBibTeXDownload | |
| 2009 | ||
| 4 | Folding a Better Checkerboard. Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang. ISAAC 2009, 1074-1083. Web SearchBibTeXDownload | |
| 2007 | ||
| 3 | Compact routing with slack in low doubling dimension. Goran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu. PODC 2007, 71-80. Web SearchBibTeXDownload | |
| 2000 | ||
| 2 | Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala. Theor. Comput. Sci. (235): 25-42 (2000). Web SearchBibTeXDownload | |
| 1998 | ||
| 1 | Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala. STOC 1998, 100-105. Web SearchBibTeXDownload | |
from DBLP and Google Scholar