Chp 1 - Planarity
Network Theory
Satelites Naturales
Something for almost nothing: Advances in sublinear time algorithms Ronitt Rubinfeld MIT and Tel Aviv U.
1 Bart Jansen Polynomial Kernels for Hard Problems on Disk Graphs Accepted for presentation at SWAT 2010.
Online Node-weighted Steiner Connectivity Problems Vahid Liaghat University of Maryland MohammadTaghi Hajiaghayi (UMD) Debmalya Panigrahi (Duke) 1.
The Dissertation
Graph Exploration Algorithm- Term Paper Presentation
Hicatee Schools Presentation
Baocaoseminar2012
csom_phdthesis
Dynamic Programming Over Graphs of Bounded Treewidth
