default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGilles Simonin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2009
[b1]Gilles Simonin:
Impact de la contrainte d'incompatibilité sur la complexité et l'approximation des problèmes d'ordonnancement en présence de tâches-couplées. (Impact of the compatibility constraint on the complexity and approximation of the scheduling problems according to coupled-tasks). Montpellier 2 University, France, 2009
Journal Articles
- 2019
- [j7]Begum Genc, Mohamed Siala
, Gilles Simonin, Barry O'Sullivan:
Complexity Study for the Robust Stable Marriage Problem. Theor. Comput. Sci. 775: 76-92 (2019) - 2016
- [j6]Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin:
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. RAIRO Oper. Res. 50(4-5): 781-795 (2016) - 2015
- [j5]Gilles Simonin, Christian Artigues, Emmanuel Hebrard, Pierre Lopez:
Scheduling scientific experiments for comet exploration. Constraints An Int. J. 20(1): 77-99 (2015) - 2012
- [j4]Gilles Simonin, Rodolphe Giroudeau, Benoît Darties, Jean-Claude König:
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. Algorithmic Oper. Res. 7(1): 1-12 (2012) - 2011
- [j3]Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
Complexity and approximation for scheduling problem for a torpedo. Comput. Ind. Eng. 61(2): 352-356 (2011) - [j2]Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. J. Sched. 14(5): 501-509 (2011) - 2010
- [j1]Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks. Electron. Notes Discret. Math. 36: 647-654 (2010)
Conference and Workshop Papers
- 2024
- [c14]Sulian Le Bozec-Chiffoleau, Charles Prud'homme, Gilles Simonin:
Polynomial Time Presolve Algorithms for Rotation-Based Models Solving the Robust Stable Matching Problem. IJCAI 2024: 2860-2867 - 2020
- [c13]Arthur Godet, Xavier Lorca, Emmanuel Hebrard, Gilles Simonin:
Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources. AAAI 2020: 1512-1519 - 2019
- [c12]Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
An Approach to Robustness in the Stable Roommates Problem and Its Comparison with the Stable Marriage Problem. CPAIOR 2019: 320-336 - 2017
- [c11]Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin:
Robust Stable Marriage. AAAI 2017: 4925-4926 - [c10]Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
On the Complexity of Robust Stable Marriage. COCOA (2) 2017: 441-448 - [c9]Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
New Models for Two Variants of Popular Matching. ICTAI 2017: 752-759 - [c8]Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin:
Finding Robust Solutions to Stable Marriage. IJCAI 2017: 631-637 - 2016
- [c7]Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
A CP-Based Approach for Popular Matching. AAAI 2016: 4202-4203 - [c6]Gilles Simonin, Barry O'Sullivan:
Requests Management for Smartphone-Based Matching Applications Using a Multi-agent Approach. LION 2016: 173-186 - 2014
- [c5]Gilles Simonin, Benoît Darties, Jean-Claude König, Rodolphe Giroudeau:
Approximation algorithm for constrained coupled-tasks scheduling problem. CoDIT 2014: 110-112 - [c4]Gilles Simonin, Barry O'Sullivan:
Optimisation for the Ride-Sharing Problem: a Complexity-based Approach. ECAI 2014: 831-836 - [c3]Benoît Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO 2014: 161-172 - 2012
- [c2]Gilles Simonin, Christian Artigues, Emmanuel Hebrard, Pierre Lopez:
Scheduling Scientific Experiments on the Rosetta/Philae Mission. CP 2012: 23-37 - 2011
- [c1]Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König, Benoît Darties:
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph. ICAPS 2011
Informal and Other Publications
- 2017
- [i5]Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin:
Finding Robust Solutions to Stable Marriage. CoRR abs/1705.09218 (2017) - [i4]Rodolphe Giroudeau, Jean-Claude König, Benoît Darties, Gilles Simonin:
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints. CoRR abs/1706.02200 (2017) - [i3]Gilles Simonin, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor. CoRR abs/1706.02202 (2017) - [i2]Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin:
Some complexity and approximation results for coupled-tasks scheduling problem according to topology. CoRR abs/1706.02214 (2017) - [i1]Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan:
On the Complexity of Robust Stable Marriage. CoRR abs/1709.06172 (2017)
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-21 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
