## Sahand Mozaffari

Ph.D. Candidate
in the Theory and Algorithms Group
of Computer Science Department
of University of Illinois at Urbana-Champaign
Room 3117, Thomas M. Siebel Center for Computer Science, Champaign, IL, USA.
You can contact me at "".
My vita can be found here.
Last update: Oct 8, 2018

My name is Sahand Mozaffari, natively written سهند مظفری and pronounced sæhænd mozæfæɾ. Currently, I am pursuing a Ph.D. in Computer Science at University of Illinois at Urbana-Champaign. Previously, I have received B.S. degrees in Computer Engineering and in Theoretical Mathematics from Sharif University of Technology.

### Research Interests

• Machine Learning
• Design and Analysis of Algorithms
• Combinatorial Optimization
• Graph Theory and Combinatorics

### Publications

I have a DBLP and a Google Scholar page. Here is the list of my publications in reverse chronological order:
• 2017

We investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of non-terminal nodes (edges) to delete so that the terminal nodes do not have an odd length path between them. In an earlier work, Lokshtanov and Ramanujan showed that both odd multiway node cut and odd multiway edge cut are fixed-parameter tractable (FPT) when parameterized by the size of the solution in undirected graphs. In this work, we focus on directed acyclic graphs (DAGs) and design a fixed-parameter algorithm. Our main contribution is an extension of the shadow-removal framework for parity problems in DAGs. We complement our FPT results with tight approximability as well as polyhedral results for 2 terminals in DAGs. Additionally, we show inapproximability results for odd multiway edge cut in undirected graphs even for 2 terminals.

Karthekeyan Chandrasekaran, Sahand Mozaffari
The 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
arXiv bib
• 2015

Let $$G$$ be a graph. A total dominating set of $$G$$ is a set $$S$$ of vertices of $$G$$ such that every vertex is adjacent to at least one vertex in $$S$$. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of $$G$$. In this paper we provide a criterion under which a cubic graph has total domatic number at least two.

Saieed Akbari, Mohammad Motiei, Sahand Mozaffari, Sina Yazdanbod
Discussiones Mathematicae Graph Theory 38.1
DMGT arXiv bib
• 2015

In this thesis, we discuss the facility location problem in two-dimensional space. Facility location problem, also known as k-center problem, is of great importance in computational geometry, operational research and data mining fields. The goal in this problem is to find an optimum placement for k facilities on the plane, such that the cost for clients traveling to the nearest facility is minimized. Solving this problem in presence of outlier points has interested many researchers in recent years.

In this article, having explained the previous works on this subject, we present new algorithms for k-center problem with weighted outliers.

Kiana Ehsani, Sahand Mozaffari
Bachelor thesis (in Farsi), Sharif University of Technology, under supervision of Hamid Zarrabi-Zadeh
bib

### Education

• Ph.D. in Computer Science August 2016 - Present
Department of Computer Science, University of Illinois at Urbana-Champaign
• B.S. in Software Engineering September 2011 - July 2016
Department of Computer Engineering, Sharif University of Technology
• B.S in Theoretical Mathematics September 2013 - July 2016
Department of Mathematical Sciences, Sharif University of Technology

### Teaching

• Teaching assistant in UIUC
• Algorithms and Models of Computation
• Discrete Structures Fall 2016
• Teaching assistant in SUT
• Compiler Design Fall 2014
• Data Structures and Introduction to Algorithms Spring 2014
• Design of Algorithms
• Digital Design Spring 2013
• Discrete Structures
• Fundamentals of Computer Programming Fall 2012
• Theory of Languages and Automata