![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Bertrand Jouve
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i6]Marc Demange, David Ellison, Bertrand Jouve:
Orienteering problem with time-windows and updating delay. CoRR abs/2201.00777 (2022) - 2021
- [j16]Marc Demange, David Ellison, Bertrand Jouve:
Orienteering problem with time-windows and updating delay. Theor. Comput. Sci. 863: 1-18 (2021) - [i5]Mehdi Djellabi, Bertrand Jouve:
Clustering of temporal nodes profiles in dynamic networks of contacts. CoRR abs/2104.05982 (2021) - 2020
- [j15]Mehdi Djellabi, Bertrand Jouve, Frédéric Amblard
:
Dense and sparse vertex connectivity in networks. J. Complex Networks 8(3) (2020) - [j14]Etienne Fieux, Bertrand Jouve:
A hierarchy of dismantlings in graphs. Discret. Math. 343(8): 111914 (2020) - [j13]Romain Boulet, Etienne Fieux, Bertrand Jouve:
Corrigendum to "Simplicial simple-homotopy of flag complexes in terms of graphs" [European J. Combin. 31 (2010) 161-176]. Eur. J. Comb. 86: 102974 (2020) - [j12]Jean-Gabriel Ganascia
, Bertrand Jouve, Pascale Kuntz:
Introduction (FR). Rev. Ouverte Intell. Artif. 1(1): 5-11 (2020) - [j11]Jean-Gabriel Ganascia, Bertrand Jouve, Pascale Kuntz:
Introduction (EN). Rev. Ouverte Intell. Artif. 1(1): 13-18 (2020) - [c7]Bertrand Jouve:
Graph Mining by Vertex Dismantlings. ICORES 2020: 17 - [i4]Mehdi Djellabi, Bertrand Jouve, Frédéric Amblard:
Dense and sparse vertex connectivity in networks. CoRR abs/2006.05679 (2020)
2010 – 2019
- 2019
- [j10]Pierre Coupechoux, Marc Demange, David Ellison
, Bertrand Jouve:
Firefighting on trees. Theor. Comput. Sci. 794: 69-84 (2019) - [i3]Pierre Coupechoux, Marc Demange, David Ellison, Bertrand Jouve:
Firefighting on Trees. CoRR abs/1902.02159 (2019) - 2018
- [c6]Pierre Coupechoux, Marc Demange, David Ellison, Bertrand Jouve:
Online Firefighting on Trees. ISCO 2018: 121-132 - [i2]Alberto Lumbreras, Julien Velcin, Marie Guégan, Bertrand Jouve:
Non-parametric clustering over user features and latent behavioral functions with dual-view mixture models. CoRR abs/1812.07360 (2018) - 2017
- [j9]Alberto Lumbreras
, Julien Velcin, Marie Guégan, Bertrand Jouve:
Non-parametric clustering over user features and latent behavioral functions with dual-view mixture models. Comput. Stat. 32(1): 145-177 (2017) - [j8]Alberto Lumbreras
, Bertrand Jouve, Julien Velcin, Marie Guégan:
Role detection in online forums based on growth models for trees. Soc. Netw. Anal. Min. 7(1): 49:1-49:13 (2017) - [c5]Mehdi Djellabi, Bertrand Jouve, Frédéric Amblard
:
Behind the Communities, a Focus on the Sparse Part of a Network. COMPLEX NETWORKS 2017: 216-228 - 2015
- [j7]Youssef Boudabbous, Pierre Ille, Bertrand Jouve, Abdeljelil Salhi:
Critically Twin Primitive 2-Structures. Graphs Comb. 31(5): 1223-1247 (2015) - 2013
- [i1]Alberto Lumbreras, James Lanagan, Julien Velcin, Bertrand Jouve:
Analyse des rôles dans les communautés virtuelles : définitions et premières expérimentations sur IMDb. CoRR abs/1309.7187 (2013) - 2011
- [c4]Laurent Lacomme, Valérie Camps
, Yves Demazeau, Florent Hautefeuille, Bertrand Jouve:
Middle Age Social Networks: A Dynamic Organizational Study. PAAMS 2011: 211-216 - 2010
- [j6]Romain Boulet
, Etienne Fieux, Bertrand Jouve:
Simplicial simple-homotopy of flag complexes in terms of graphs. Eur. J. Comb. 31(1): 161-176 (2010)
2000 – 2009
- 2009
- [j5]Jean-François Culus, Bertrand Jouve:
Convex circuit-free coloration of an oriented graph. Eur. J. Comb. 30(1): 43-52 (2009) - [c3]Romain Boulet, Pierre Mazzega, Bertrand Jouve:
Environmental, Social and Normative Networks in the MAELIA Platform. LDSS@ICAIL 2009 - 2008
- [j4]Romain Boulet, Bertrand Jouve:
The Lollipop Graph is Determined by its Spectrum. Electron. J. Comb. 15(1) (2008) - [j3]Romain Boulet
, Etienne Fieux, Bertrand Jouve:
s-homotopy for finite graphs. Electron. Notes Discret. Math. 31: 123-127 (2008) - [j2]Romain Boulet
, Bertrand Jouve, Fabrice Rossi
, Nathalie Villa:
Batch kernel SOM and related Laplacian methods for social network analysis. Neurocomputing 71(7-9): 1257-1273 (2008) - 2007
- [c2]Romain Boulet, Bertrand Jouve:
Partitionnement d'un réseau de sociabilité à fort coefficient de clustering. EGC 2007: 569-574 - 2005
- [j1]Bertrand Jouve:
Transitive convex subsets in large tournaments. Electron. Notes Discret. Math. 22: 433-437 (2005) - 2002
- [c1]Bertrand Jouve, Pascale Kuntz, François Velin:
Extraction de structures macroscopiques dans des grands graphes par une approche spectrale. EGC 2002: 173-184
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-19 18:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint