Natasa Jonoska

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mark Harman

> Home > Persons > Natasa Jonoska

Publications

2003
[e4]
- view
  authority control:
- export record
  dblp key:
  - conf/gecco/2003-1
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gecco/2003-1
Erick Cantú-Paz, James A. Foster, Kalyanmoy Deb, Lawrence Davis, Rajkumar Roy, Una-May O'Reilly, Hans-Georg Beyer, Russell K. Standish, Graham Kendall, Stewart W. Wilson, Mark Harman, Joachim Wegener, Dipankar Dasgupta, Mitchell A. Potter, Alan C. Schultz, Kathryn A. Dowsland, Natasa Jonoska, Julian F. Miller:
Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part I. Lecture Notes in Computer Science 2723, Springer 2003, ISBN 3-540-40602-6 [contents]
[e3]
- view
  authority control:
- export record
  dblp key:
  - conf/gecco/2003-2
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gecco/2003-2
Erick Cantú-Paz, James A. Foster, Kalyanmoy Deb, Lawrence Davis, Rajkumar Roy, Una-May O'Reilly, Hans-Georg Beyer, Russell K. Standish, Graham Kendall, Stewart W. Wilson, Mark Harman, Joachim Wegener, Dipankar Dasgupta, Mitchell A. Potter, Alan C. Schultz, Kathryn A. Dowsland, Natasa Jonoska, Julian F. Miller:
Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part II. Lecture Notes in Computer Science 2724, Springer 2003, ISBN 3-540-40603-4 [contents]

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.