Most of these publications are copyright protected. Here is the copyright notice for ACM publications:
Other publishers, such as IEEE and Springer, have similar copyright notices
Talks based on the two previous results were given at:
Here are some pdf slides for these results.
Talks based on the two previous results were given at:
Here are some pdf slides for these results.
Talks based on the two previous results were given at:
Here are some pdf slides for these results.
Here are some pdf slides for these results (from the talk at 25th LSD & LAW).
Here are some pdf slides for these results (from the talk at BCTCS-2016).
Here are some pdf slides for these results (from the talk at the 8th Slovenian International Conference on Graph Theory, Kranjska Gora, Slovenia, 2015).
, John Wiley & Sons, Inc., 2016
Here are some pdf slides for these results.
(this paper was also be presented at the ICALP 2011 workshop on Graph algorithms and Applications, Zurich, Switzerland, July 3, 2011).
(this paper was also presented in 1st RECOMB Satellite Workshop on Computational Cancer Biology, September 18-20, 2007)
(this paper was also presented at the 2007 Microsoft eScience Workshop at RENCI, Chapel Hill, NC, October 21-23, 2007)
(A complete version of the paper with all the proofs is here)
(A revised journal version with somewhat improved bounds is available here)
(This was one of the top 10 most downloaded article from Journal of Algorithms in 2003)
, John Wiley & Sons, Inc., 2016
Here are some pdf slides for these results (from the talk at 25th LSD & LAW).
Here are some pdf slides for these results (from the talk at the 8th Slovenian International Conference on Graph Theory, Kranjska Gora, Slovenia, 2015).
Here are some pdf slides for these results (from the talk at BCTCS-2016).
Here are some pdf slides for these results.
(this paper was also be presented at the ICALP 2011 workshop on Graph algorithms and Applications, Zurich, Switzerland, July 3, 2011).
(This was one of the top 10 most downloaded article from Journal of Algorithms in 2003)
(this paper was also presented in 1st RECOMB Satellite Workshop on Computational Cancer Biology, September 18-20, 2007)
(this paper was also presented at the 2007 Microsoft eScience Workshop at RENCI, Chapel Hill, NC, October 21-23, 2007)
(A complete version of the paper with all the proofs is here)
(A revised journal version with somewhat improved bounds is available here)
Computational finance
Computational economics
Social networks
Privacy and Security
Learning theory, Neural nets and circuit complexity
Set covering / multi-covering
Clustering
Graph theory
Here are some pdf slides for these results (from the talk at 25th LSD & LAW).
Here are some pdf slides for these results.
(this paper was also be presented at the ICALP 2011 workshop on Graph algorithms and Applications, Zurich, Switzerland, July 3, 2011).
Here are some pdf slides for these results (from the talk at 25th LSD & LAW).
(A complete version of the paper with all the proofs is here)
, John Wiley & Sons, Inc., 2016
Here are some pdf slides for these results.
(this paper was also presented at the 2007 Microsoft eScience Workshop at RENCI, Chapel Hill, NC, October 21-23, 2007)
(A revised journal version with somewhat improved bounds is available here)
, John Wiley & Sons, Inc., 2016
(this paper was also presented in 1st RECOMB Satellite Workshop on Computational Cancer Biology, September 18-20, 2007)
(This was one of the top 10 most downloaded article from Journal of Algorithms in 2003)
(A complete version of the paper with all the proofs is here)
(A revised journal version with somewhat improved bounds is available here)
Here are some pdf slides for these results (from the talk at the 8th Slovenian International Conference on Graph Theory, Kranjska Gora, Slovenia, 2015).
(this paper was also be presented at the ICALP 2011 workshop on Graph algorithms and Applications, Zurich, Switzerland, July 3, 2011).
Here are some pdf slides for these results (from the talk at BCTCS-2016).
(this paper was also be presented at the ICALP 2011 workshop on Graph algorithms and Applications, Zurich, Switzerland, July 3, 2011).