Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Philippe J. Giabbanelli

◀ ▶ joint publications with Alexander J. Freund

> Home > Persons > Philippe J. Giabbanelli

Publications

2022
[j32]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/fdata/FreundG22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fdata/FreundG22
Alexander J. Freund, Philippe J. Giabbanelli:
An Experimental Study on the Scalability of Recent Node Centrality Metrics in Sparse Complex Networks. Frontiers Big Data 5: 797584 (2022)
2021
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/annsim/FreundG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/annsim/FreundG21
Alexander J. Freund, Philippe J. Giabbanelli:
Are We Modeling the Evidence or Our Own Biases? A Comparison of Conceptual Models Created from Reports. ANNSIM 2021: 1-12
[c42]
- view
  authority control:
- export record
  dblp key:
  - conf/annsim/FreundG21a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/annsim/FreundG21a
Alexander J. Freund, Philippe J. Giabbanelli:
Automatically Combining Conceptual Models Using Semantic and Structural Information. ANNSIM 2021: 1-12
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/iccS/FreundG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccS/FreundG21
Alexander J. Freund, Philippe J. Giabbanelli:
The Necessity and Difficulty of Navigating Uncertainty to Develop an Individual-Level Computational Model. ICCS (6) 2021: 407-421

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.