BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
DTSTART:20250330T020000
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:BST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T010000
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:GMT
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20251021T181947Z
UID:C3C281F7-649E-403D-B6FA-983584C5EAB4
DTSTART;TZID=Europe/London:20251018T130000
DTEND;TZID=Europe/London:20251018T150000
DESCRIPTION:Workshop:Graph Theory\n\nGoals and objectives:\nThe main goal o
 f this workshop was to introduce participants to the core concepts of grap
 h theory\, a fundamental area in computer science and competitive programm
 ing. The session aimed to provide attendees with a solid understanding of 
 how graphs can model networks\, relationships\, and problem-solving scenar
 ios.\n\nFacilitator/Speaker: LETAIEF BOUKAMCHA ADEM\n\nDescription of the 
 session:\nThe workshop began with an overview of graphs\, including defini
 tions of vertices and edges\, and the differences between directed\, undir
 ected\, weighted\, and unweighted graphs. Participants learned about graph
  representations\, such as adjacency lists and matrices\, and explored imp
 ortant properties like connectivity and degree.\n\nThe session then moved 
 to practical algorithms\, covering Depth-First Search (DFS) and Breadth-Fi
 rst Search (BFS)\, with explanations on their implementation and applicati
 ons. Participants were shown how these algorithms can solve problems such 
 as detecting cycles\, finding connected components\, and computing shortes
 t paths.\n\nHands-on exercises allowed attendees to implement simple graph
 s and traversals\, reinforcing their understanding of the theoretical conc
 epts. The facilitator also highlighted real-world applications in networki
 ng\, social media analysis\, and competitive programming challenges.\n\nIn
 sights from feedback:\nParticipants reported gaining a clear understanding
  of graph theory fundamentals and valued the combination of theory and pra
 ctical coding. Many expressed interest in exploring more advanced algorith
 ms in the future.\n\nSummary:\nThe workshop was successful in providing bo
 th conceptual clarity and hands-on experience. The structured teaching and
  illustrative examples made complex ideas accessible to all participants.\
 n\nFuture recommendations:\nFuture sessions could include advanced graph a
 lgorithms such as Dijkstra’s\, Floyd-Warshall\, Minimum Spanning Trees\,
  and network flow\, to deepen participants’ skills.\n\nThe workshop took
  place as part of the IEEE Day activities.\n\nWritten by CS Chapter Genera
 l Secretary\,\nOns Sassi\n\nSpeaker(s): Adem Letaief Boukamcha\, \n\n676 C
 entre Urbain Nord BP\, Tunis 1080\,  Tunis\, Tunis\, Tunis\, Tunisia\, Tun
 isia 1080
LOCATION:676 Centre Urbain Nord BP\, Tunis 1080\,  Tunis\, Tunis\, Tunis\, 
 Tunisia\, Tunisia 1080
ORGANIZER:ieeeinsatsb.cs@gmail.com
SEQUENCE:21
SUMMARY:IEEEDAY: workshop:Graph Theory
URL;VALUE=URI:https://events.vtools.ieee.org/m/508520
X-ALT-DESC:Description: &lt;br /&gt;&lt;p dir=&quot;ltr&quot;&gt;&amp;nbsp\;Workshop:Graph Theory&lt;/p&gt;
 \n&lt;p dir=&quot;ltr&quot;&gt;Goals and objectives:&lt;br&gt;The main goal of this workshop was
  to introduce participants to the core concepts of graph theory\, a fundam
 ental area in computer science and competitive programming. The session ai
 med to provide attendees with a solid understanding of how graphs can mode
 l networks\, relationships\, and problem-solving scenarios.&lt;/p&gt;\n&lt;p dir=&quot;l
 tr&quot;&gt;Facilitator/Speaker: LETAIEF BOUKAMCHA ADEM&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Descript
 ion of the session:&lt;br&gt;The workshop began with an overview of graphs\, inc
 luding definitions of vertices and edges\, and the differences between dir
 ected\, undirected\, weighted\, and unweighted graphs. Participants learne
 d about graph representations\, such as adjacency lists and matrices\, and
  explored important properties like connectivity and degree.&lt;/p&gt;\n&lt;p dir=&quot;
 ltr&quot;&gt;The session then moved to practical algorithms\, covering Depth-First
  Search (DFS) and Breadth-First Search (BFS)\, with explanations on their 
 implementation and applications. Participants were shown how these algorit
 hms can solve problems such as detecting cycles\, finding connected compon
 ents\, and computing shortest paths.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Hands-on exercises 
 allowed attendees to implement simple graphs and traversals\, reinforcing 
 their understanding of the theoretical concepts. The facilitator also high
 lighted real-world applications in networking\, social media analysis\, an
 d competitive programming challenges.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Insights from feed
 back:&lt;br&gt;Participants reported gaining a clear understanding of graph theo
 ry fundamentals and valued the combination of theory and practical coding.
  Many expressed interest in exploring more advanced algorithms in the futu
 re.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Summary:&lt;br&gt;The workshop was successful in providing
  both conceptual clarity and hands-on experience. The structured teaching 
 and illustrative examples made complex ideas accessible to all participant
 s.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;Future recommendations:&lt;br&gt;Future sessions could incl
 ude advanced graph algorithms such as Dijkstra&amp;rsquo\;s\, Floyd-Warshall\,
  Minimum Spanning Trees\, and network flow\, to deepen participants&amp;rsquo\
 ; skills.&lt;/p&gt;\n&lt;p dir=&quot;ltr&quot;&gt;The workshop took place as part of the IEEE Da
 y activities.&lt;/p&gt;\n&lt;p&gt;&lt;strong id=&quot;docs-internal-guid-ca4d3817-7fff-acfa-0c
 2a-c11e18ef4acc&quot;&gt;Written by CS Chapter General Secretary\,&lt;br&gt;Ons Sassi&lt;/s
 trong&gt;&lt;/p&gt;
END:VEVENT
END:VCALENDAR