personal page created

_people/akyildiz.md

@@ -0,0 +1,61 @@
+---
+# !!!!
+# The NAME of the file should be your LASTNAME (e.g. houben.md)
+# Do NOT delete any field, only fill in the required information
+# !!!! 
+
+# Your full name (Firstname, Lastname)
+name: Taha Atahan Akyildiz
+
+# The members are displayed in a hierarchical way, so please choose the role (e.g. Full Professor, Assistant Professor etc) 
+# and filter number (e.g. 1, 2, 3) from this list and fill in the role and filter from below:
+
+# (Affiliated) Full Professor - 1
+# Associate Professor - 2
+# Assistant Professor - 3
+# Postdoctoral Researcher - 4
+# PhD Candidate - 5
+# Research Engineer - 6 
+# Guest Researcher - 7
+# Secretary - 8
+role: PhD Candidate
+filter: 5
+
+# same as filter
+theme-filter: 5
+
+# choose your team(s) from the following list: delta, kappa, epsilon, lambda, cel
+team: [sgl]
+
+# provide social URLs (if any)
+linkedin: https://www.linkedin.com/in/taha-atahan-aky%C4%B1ld%C4%B1z-8b2321123/
+twitter: 
+github: https://github.com/Atahanak/
+
+# look for your image here: https://github.com/dis-delft/dis-delft.github.io/tree/master/assets/img/people 
+# if your image doesn't exist, upload it in assets/img/people 
+# write the exact name of the image as it appears in GitHub  
+image: akyildiz.jpg
+
+# the TUD email address
+email: [email protected]
+
+# Room number (e.g., 840 West 4rd floor)
+office: 1.E.030
+
+# The name of this file with .html extension instead of .md (If the filename is ionescu.md, the "back" field will be ionescu.html)
+back: akyildiz.html
+
+# Go to https://purexml-open.ewi.tudelft.nl 
+# choose Query Type = Person, search term = your name, Style = as a list
+# generate url and copy the link in the publications_link field below
+publications_link: https://purexml-open.ewi.tudelft.nl/convert/li/persons/5a873e09-a978-4540-a5cb-820d86927fdb 
+
+---
+
+## About
+
+I am a PhD candidate working with Dr. Kubilay Atasu and Dr. Lydia Y. Chen in the Data-Intensive Systems Group. My research focuses on graph learning, and scalable solutions for graph algorithms.
+
+
+