CSGSA

Hi guys, small update due to some reasons we has been Rescheduled Coffee Hour from Thursday, Feb 11 to Friday, February 19 and timings/ place will be same

so, No Coffee Hour on Thursday, February 11

Hi Friends, It has been long time to meet you all, However I am seeing all your happiness on my wall, hope you guys are doing great!!

Please join for this coffee hour and share your experience with your friends and stay warm!!

Address:
Date: Thursday, February 11
Time: 2:30 to 4:00 p.m.
Location: MSB, Third floor lounge

There are some more pics from parade!!!!

Hi friends these are the projects placed in parade and the winner is TEAM NASA!!!
Thanks for making it BIG success.
TEAM CSGSA!!!

Hey flocks, please see the pic attached below is about Robot Parade and machine learning!!! Let's come on and join parade, You to have some fun with robots.

Day: Thursday,
Date: 12/03/2015,
Time: 2:30 PM to 4:30 PM,
In: MSB 160 &162

Thank you,
CSGSA,Kent.

Congratulations Dr. Ghazinour!!!!
https://www.facebook.com/KSUCSDept/photos/a.444988289711.247345.35301834711/10153696169339712/?type=3&theater

Congratulations Dr. Ghazinour on receiving a Faculty Recognition Award!!

Hey Flocks, Don't forget to come for coffee hours tomorrow, we will just share our ideas, jokes and soon like what is new with you!! we will wait for you.

Date: 10/23/2015.
Place: MSB, Third floor lounge.
Time: 2:00 - 3:30 p.m

Our Department stall during Grad Orientation!!!!

Dear CS faculty members and CS grad students,

It is time for Coffee Hour, Please join us today for coffee hour, we will just share our ideas, problems and soon like what is new with you!! we are waiting for you at.
Friday, April 17th, 2015,
2:00 - 3:30 p.m.,
MSB, Third floor lounge

Thank you,
CSGSA.

Hi Friends

Tomorrow one of our friend name Muslem Al-Saidi defining Thesis, I request you to please come and know about new topic.

More details:

Topic: Balanced Disk Separators and Hierarchical Tree Decomposition of Real-life Networks

Date: Wednesday, April 1, 2015
Time: 1:00
Place: 274 MSB

Committee Members:
Feodor Dragan, Advisor
Hassan Peyravi
Mikhail Nesterenko

Abstract:

Recently in few papers, a balanced disk separator of graphs were recursively used to construct one or a small set of spanning trees that sharply approximate distances in a given graph. The best up to date approximation algorithms were obtained for multiplicative tree spanners and for collective additive tree spanners of graphs. In this thesis, we analyze a number of real-life networks, arising in Internet measurements, social and biological sciences, and demonstrate that they all admit small radius balanced disk separators. As a consequence, the one-to-one distances in those networks can be sharply approximated by the tree metrics. Furthermore, all those networks admit very simple distance and routing labeling schemes.

Thank you,
CSGSA.