Dr. Maria Kandyba-Chimani (geb. Kandyba)

Address   Chair of Algorithm Engineering
Department of Computer Science
Dortmund University of Technology
Otto-Hahnstr. 14
44227 Dortmund
Room   233
e-mail   maria.kandyba@tu-dortmund.de
Phone   +49(0)231-755-7704
Fax   +49(0)231-755-7740

Research Interests

Combinatorial Optimization, in particular Steiner Networks, Survivable Network Design, Multicommodity Flows, Planarization
Integer Linear Programming, Branch-and-Cut
Stochastic Integer Programming
Hybridization of exact and heuristic methods
Graph Drawing

Current research

Efficient exact algorithms for:
k-Cardinality Tree Problem
{0,1,2}-Survivable Network Design Problem

Current teaching

Wintersemester 2008/2009: Proseminar Algorithmen und Datenstrukturen

Publications

Journal articles:

M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Orientation-based Models for {0,1,2}-Survivable Network Design: Theory and Practice. Mathematical Probramming, Series B. Vol. 124, pp. 413-439, Springer, 2010
M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Obtaining Optimal k-Cardinality Trees Fast. Journal of Experimental Algorithms (accepted). Vol. 14(2), pp. 5.1-5.23, 2009

Refereed conferece papers:

M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Strong Formulations for 2-Node-Connected Steiner Network Problems. 2nd Annual International Conference on Combinatorial Optimization and Applications, St. John's, Newfoundland (COCOA 2008), Vol. 5165 of LNCS, pp. 190-200. Springer 2008
M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Obtaining Optimal k-Cardinality Trees Fast. Proceedings of Workshop on Algorithm Engineering & Experiments, San Francisco, USA (ALENEX'08), pp. 27-36. SIAM 2008.
M. Chimani, M. Kandyba, and M. Preuss. Hybrid Numerical Optimization for Combinatorial Network Problems. 4th International Workshop on Hybrid Metaheuristics (HM'07), Vol. 4771 of LNCS, pp. 185-200. Springer 2007.
M. Chimani, M. Kandyba, and P. Mutzel. A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. 15th Annual European Symposium on Algorithms (ESA'07), Vol. 4698 of LNCS, pp. 681-692. Springer 2007.

Book chapters:

D. Delling, R. Hoffmann, M. Kandyba, and A. Schulze. Case Studies. Chapter in: Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice. M. Müller-Hannemann and S. Schirra (eds.). Springer, 2010.

Technical reports:

M. Chimani, M. Kandyba, M. Martens. 2-InterConnected Facility Location: Specifications, Complexity Results, and Exact Solutions
M. Chimani, M. Kandyba, I. Ljubic, P. Mutzel. Strong Formulations for 2-Node-Connected Steiner Network Problems (TR)
M. Chimani, M. Kandyba, P. Mutzel. A New ILP Formulation for the 2-Root-Connected Prize-Collecting Steiner Networks (TR)
C. Buchheim, M. Jünger, M. Kandyba, M. Percan, M. Schulz. Planarization With Fixed Subgraph Embedding

Projects

B10 Project "Application of Computational Intelligence in Combinatorial Optimization"
of Sonderforschungsbereich Computational Intelligence (SFB 531)

Short CV

january 2009   Scholarship holder of Deutsche Telekom Stiftung
april 2006   PhD Student and Research Assistant at Chair of Algorithm Engineering, Department of Computer Science, Dortmund University of Technology
sep.2003 - mar.2004   Studies of mathematics at Universita Roma Tre, Rome
oct.2000 - feb.2006   Studies of mathematics (diploma) at the University of Cologne, Germany
Title of diploma thesis: "Planarisierung unter Berücksichtung fest eingebetteter Untergraphen" (in German)
This thesis was written at the Chair of Prof. Dr. Jünger , Department of Computer Science, University of Cologne
june 2000   Abitur at Hildegardis-Gymnasium in Bochum, Germany

hier geht's zurück