Assistant Professor,
Department of Computer Science and Engineering

School of Computing and Informatics, Ira A. Fulton School of Engineering,

Arizona State University, Tempe, AZ 85287-5406

Phone: (480)965-2783 Fax: (480)965-2783, E-mail: my first name dot my last name at gmail.com

School of Computing and Informatics, Ira A. Fulton School of Engineering,

Arizona State University, Tempe, AZ 85287-5406

Phone: (480)965-2783 Fax: (480)965-2783, E-mail: my first name dot my last name at gmail.com

(spring 2010) CSE450/598 Design and Analysis of Algorithms.

(fall 2009) CSE550 Combinatorial Algorithms and Intractability.

(spring 2009) HON394 Origami: Mathematics, Art, Science and Engineering.

(fall 2008) CSE310 Algorithms and Data Structures.

(fall 2008) CSE591 Randomized and Approximation Algorithms.

(spring 2008) CSE555 Theory of Computation.

(fall 2007) CSE450/598 Design and Analysis of Algorithms.

(fall 2007) CSE550 Combinatorial Algorithms and Intractability.

(spring 2007) CSE555 Theory of Computation.

(spring 2007) CSE591 Randomized and Approximation Algorithms.

(fall 2006) CSE310 Algorithms and Data Structures.

(spring 2006) CSE555 Theory of Computation.

(fall 2005) CSE450/598 Design and Analysis of Algorithms.

(fall 2005) CSE355 Introduction to Theory of Computation.

(spring 2005) CSE591 Randomized and Approximation Algorithms.

(fall 2004) CSE355 Introduction to Theory of Computation.

(spring 2004) CSE591 Randomized and Approximation Algorithms.

(fall 2003) CSE355 Introduction to Theory of Computation.

(spring 2003) CSE355 Introduction to Theory of Computation.

(spring 2003) ECE100 Introduction to Engineering Design.

(fall 2002) CSE450/598 Design and Analysis of Algorithms.

(spring 2002) CSE591 Randomized and Approximation Algorithms.

(fall 2001) CSE450/598 Design and Analysis of Algorithms.

(spring 2001) CSE355 Introduction to Theory of Computation.

(fall 2000) CSE310 Algorithms and Data Structures.

mathematics (mostly discrete),

operations research.

(By area: approximation algorithms,
finite metric spaces,
distributed algorithms,
polyhedral combinatorics,
CAD,
Ramsey theory,
shortest paths,
other).

(By publication status: journals, conference proceedings, book chapters, submitted).

(By publication status: journals, conference proceedings, book chapters, submitted).

Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal-stretch name-independent compact routing in doubling metrics. Invited for publication in special issue of ACM Transactions on Algorithms dedicated to best papers of SODA 2007; combination of papers from PODC 2006 and SODA 2007; submitted, 2007. [ bib | .pdf ]

Robert D. Carr, Goran Konjevod, Danny Greg Little, Venkatesh Natarajan, and Ojas D. Parekh. Compacting cuts: a new linear formulation for minimum cut. Invited for publication in special issue of ACM Transactions on Algorithms dedicated to best papers of SODA 2007; submitted, 2007. [ bib | .pdf ]

Rida A. Bazzi and Goran Konjevod.
On the establishment of distinct identities in overlay networks.
*Distributed Computing*, 19:4(267-287), 2007.
Special issue with best papers of PODC 2005.
[ bib |
.pdf ]

Henry A. Kierstead and Goran Konjevod. Coloring number and on-line Ramsey theory for graphs and hypergraphs, 2005. Accepted for publication in Combinatorica, September 2007. 11 pages. [ bib | .ps.gz ]

Robert D. Carr and Goran Konjevod.
Polyhedral combinatorics.
In Harvey Greenberg, editor, *Tutorials on emerging methodologies
and applications in Operations Research*, chapter 2, pages (2-1)-(2-48).
Springer, 2004.
[ bib |
.pdf ]

Goran Konjevod, R. Ravi, and Aravind Srinivasan.
Approximation algorithms for the covering steiner problem.
*Random Struct. Algorithms*, 20(3):465-482, 2002.
[ bib |
.ps.gz ]

Robert D. Carr, Srinivas Doddi, Goran Konjevod, and Madhav V. Marathe.
On the red-blue set cover problem.
In *Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete
Algorithms*, pages 345-353, 2000.
[ bib |
.ps.gz ]

Naveen Garg, Goran Konjevod, and R. Ravi.
A polylogarithmic approximation algorithm for the group Steiner
tree problem.
*J. Algorithms*, 37:66-84, 2000.
[ bib |
.ps.gz ]

**Ph.D.** students:

Donglin Xia (Ph.D. 2008, coadvised with A. Richa)

Peyman Nayeri (in progress)

Antonio Cardenas Haro (in progress)

Wade Huber (in progress)

Oleg Bakun (in progress)

**M.S.** students:

Karthikeyan Karuppasamy (2003)

Mahesh Kamath (2003),

Prathima Donapudi (2004),

Shanti Kemburu (2004),

Venu Madhav Viyyapu (2004),

Thanigaivelu Elangovan (2004)

Oleg Bakun (2007)

Gaurav Kumar (in progress)

Betim Deva (in progress)

**M.C.S.** students:

Murali Garlapati (2004),

Pandarinath Sabhapati (2004)

**Undergraduate** students:

Eric Fikus (Fulton Undergraduate Research Initiative Scholarship, 2005)

Greg Little (2005)

B.S. University of Zagreb, (Math) 1995

Erik Demaine's List of Events, DBLP, Computer Science bibliographies, CiteSeer, Metamath, PlanetMath, Graph Theory links.

sci.math.research,