default search action
Jérôme Galtier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j15]Jérôme Galtier:
Fast approximation of matroid packing and covering. Ann. Oper. Res. 271(2): 575-598 (2018) - [j14]Jérôme Galtier:
Computing Weighted Strength and Applications to Partitioning. SIAM J. Discret. Math. 32(4): 2747-2782 (2018) - 2016
- [j13]Bio Mikaila Toko Worou, Jérôme Galtier:
Fast approximation for computing the fractional arboricity and extraction of communities of a graph. Discret. Appl. Math. 213: 179-195 (2016) - 2012
- [c15]Zhipeng Zhao, Bruno Rouvio, Roxana Ojeda, Jérôme Galtier, Patrick Brown:
Enhanced QoS 802.11n prototype including a Tournament Contention Function. WCNC 2012: 1502-1507 - 2010
- [j12]Jérôme Galtier, Igor Pesek, Katja Prnaver, Janez Zerovnik:
Oriented Networks Design Problem. J. Inf. Sci. Eng. 26(4): 1231-1242 (2010) - [p1]Jérôme Galtier:
Tournament Methods for WLAN: Analysis and Efficiency. Graphs and Algorithms in Communication Networks 2010: 379-400
2000 – 2009
- 2009
- [j11]Jérôme Galtier:
Real-time resource allocation for LEO satellite constellations. Wirel. Networks 15(6): 791-803 (2009) - [c14]Cristiana Gomes, Jérôme Galtier:
Optimal and Fair Transmission Rate Allocation Problem in Multi-hop Cellular Networks. ADHOC-NOW 2009: 327-340 - [c13]Jean-Marc Kelif, Jérôme Galtier:
Network Elasticity to the Mobility in a Fair Cellular Radio System. VTC Spring 2009 - 2007
- [j10]Jérôme Galtier, Alexandre Laugier:
Flow on Data Network and a Positive Semidefinite Representable Delay Function. J. Interconnect. Networks 8(1): 29-43 (2007) - [j9]Jérôme Galtier, Alexandre Laugier:
Erratum: "flow on Data Network and a Positive Semidefinite Representable Delay Function". J. Interconnect. Networks 8(2): 179 (2007) - [c12]Jérôme Galtier:
Analysis and optimization of MAC with constant size congestion window for WLAN. ICSNC 2007: 25 - [i1]Jérôme Galtier:
Tournament MAC with Constant Size Congestion Window for WLAN. CoRR abs/0712.1803 (2007) - 2006
- [j8]Corinne Touati, Eitan Altman, Jérôme Galtier:
Generalized Nash Bargaining Solution for bandwidth allocation. Comput. Networks 50(17): 3242-3263 (2006) - [j7]Johanna Becker, Zsolt Csizmadia, Jérôme Galtier, Alexandre Laugier, Jácint Szabó, László Szegö:
An integer programming approach to routing in daisy networks. Networks 47(2): 116-121 (2006) - [j6]Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes:
Hardness and Approximation of Gathering in Static Radio Networks. Parallel Process. Lett. 16(2): 165-184 (2006) - [c11]Jérôme Galtier:
Adaptive Power and Transmission Rate Control in Cellular CDMA Networks. GLOBECOM 2006 - [c10]Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing:
Hardness and approximation of Gathering in static radio networks. PerCom Workshops 2006: 75-79 - 2005
- [c9]Jérôme Galtier, Alexandre Laugier, Pascal Pons:
Algorithms to evaluate the reliability of a network. DRCN 2005: 93-102 - [c8]Sara Alouf, Eitan Altman, Jérôme Galtier, Jean-François Lalande, Corinne Touati:
Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites. INFOCOM 2005: 560-571 - 2003
- [j5]Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia:
Simultaneous Edge Flipping in Triangulations. Int. J. Comput. Geom. Appl. 13(2): 113-133 (2003) - 2002
- [c7]Corinne Touati, Eitan Altman, Jérôme Galtier:
Fair power and transmission rate control in wireless networks. GLOBECOM 2002: 1229-1233 - 2001
- [j4]Afonso Ferreira, Jérôme Galtier, Jean-Noël Petit, Hervé Rivano:
Re-routing algorithms in a meshed satellite constellation. Ann. des Télécommunications 56(3-4): 169-174 (2001) - [j3]Jérôme Galtier:
Geographical Reservation for Guaranteed Handover and Routing in Low Earth Orbit Constellations. Telecommun. Syst. 18(1-3): 101-121 (2001) - [j2]Patrick Bergé, Afonso Ferreira, Jérôme Galtier, Jean-Noël Petit:
A Probabilistic Study of Inter-Satellite Links Load in Polar Orbit Satellite Constellations. Telecommun. Syst. 18(1-3): 123-135 (2001) - 2000
- [j1]Jérôme Galtier:
Load Balancing Issues in the Prepartitioning Methods. Comput. Artif. Intell. 19(4): 351-371 (2000) - [c6]Jérôme Galtier, Stéphane Lanteri:
On Overlapping Partitions. ICPP 2000: 461-468 - [c5]Afonso Ferreira, Jérôme Galtier, P. Mahey, G. Mateus, A. Oliveira, M. Pichereau:
An Optimization Model for Routing in Low Earth Orbit Satellite Constellations. ISPAN 2000: 161-166
1990 – 1999
- 1997
- [c4]Jérôme Galtier:
Load Balancing Issues in the Prepartitioning Method. Euro-Par 1997: 922-936 - [c3]Jérôme Galtier, Philippe Klein:
A Parallel Preprocessor Applied to Fluid Dynamics Problems. HPCN Europe 1997: 1006-1007 - 1996
- [c2]Jérôme Galtier:
Automatic Partitioning Techniques for Solving Partial Differential Equations on Irregular Adaptive Meshes. International Conference on Supercomputing 1996: 157-164 - 1994
- [c1]Jérôme Galtier:
Deepness Analysis: Bringing Optimal Fronts to Triangular Finite Element Methods. Canada-France Conference on Parallel and Distributed Computing 1994: 181-196
Coauthor Index
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-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint