Stefan Kilyeni

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 Florin Solomonesc

> Home > Persons > Stefan Kilyeni

Publications

2013
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/hsi/SolomonescBKL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hsi/SolomonescBKL13
Florin Solomonesc, Constantin Barbulescu, Stefan Kilyeni, Marcela Litcanu:
Genetic algorithms. Power systems applications. HSI 2013: 407-414
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/saci/CristianBKPS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/saci/CristianBKPS13
Petru Dan Cristian, Constantin Barbulescu, Stefan Kilyeni, Oana Pop, Florin Solomonesc:
Artificial intelligence based TNEP. Part 1: Mathematical models. SACI 2013: 391-394
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/saci/SolomonescBKPC13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/saci/SolomonescBKPC13
Florin Solomonesc, Constantin Barbulescu, Stefan Kilyeni, Oana Pop, Petru Dan Cristian:
Artificial intelligence based TNEP. Part 2: Case studies. SACI 2013: 395-398
2011
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/eurocon/BarbulescuKPCSU11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurocon/BarbulescuKPCSU11
Constantin Barbulescu, Stefan Kilyeni, Gabriela Prostean, Petru Dan Cristian, Florin Solomonesc, Dan Ungureanu:
Deregulated environment transmission expansion planning. EUROCON 2011: 1-4

a service of

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.