Directory Profile

Goran Konjevod

Assistant Professor
Department of Computer Science and Engineering

 

Goran Konjevod has been at ASU since 2000.

Konjevod's main research interests are theoretical computer science and discrete mathematics, in particular the design of efficient algorithms for difficult computational problems. He has also been collaborating with the Los Alamos National Laboratory since 1998 on research in transportation and simulation science.

Education

Ph.D. Carnegie Mellon University 2000

Contact Info

Office Location: BYENG 450
Phone: 480.965.2783
Email: goran@asu.edu
Website: http://thrackle.eas.asu.edu/users/goran

Research/Areas of Expertise

- Design and analysis of algorithms
- Combinatorial optimization
- Graph theory
- Discrete mathematics

Research Center Involvement

- Consortium for Embedded Systems
- Institute for Computing and Information Science and Engineering (InCISE)

Courses Taught

- CSE 450/598 Design and Analysis of Algorithms

Honors and Distinctions

- NSF CCR-Theory of Computing Grant for research on Set-covering problems in combinatorial optimization, 2002

Selected Publications

N. Garg, G. Konjevod and R. Ravi, “A polylogarithmic approximation algorithm for the group Steiner problem,” Journal of Algorithms, vol. 37, 2000, pp. 66-84.

G. Konjevod, R. Ravi and A. Srinivasan, “Approximation algorithms for the covering Steiner problem,” Random Structures and Algorithms, vol. 20, 2002, pp. 465-482.

C. Barrett, K. Bissett, R. Jacob, G. Konjevod and M. Marathe, “Classical and contemporary shortest path problems in road networks: implementation and experimental analysis of the TRANSIMS router,” Proc. 10th European Symp. Algorithms (ESA 2002), LNCS vol. 2461, pp. 126-138.

R. Carr, T. Fujito, G. Konjevod and O. Parekh, “A 2.1-approximation algorithm for a generalization of the weighted edge-dominating set problem,” Journal of Combinatorial Optimization, vol. 5, 2001, pp. 317-326.

G. Konjevod, R. Ravi and F. S. Salman, “On approximating planar metrics by trees,” Information Processing Letters, vol. 80, 2001, pp. 213-219.

Back to Directory Home