default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulien Moncel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j27]Marwane Bouznif
, Julien Darlay, Julien Moncel, Myriam Preissmann:
Exact values for three domination-like problems in circular and infinite grid graphs of small height. Discret. Math. Theor. Comput. Sci. 21(3) (2019)- [j26]Antoine Dailly, Julien Moncel, Aline Parreau:
Connected Subtraction Games on Subdivided Stars. Integers 19: G3 (2019) - 2018
- [j25]Paul Dorbec, Éric Duchêne, André Fabbri, Julien Moncel, Aline Parreau, Éric Sopena:
Ice sliding games. Int. J. Game Theory 47(2): 487-508 (2018) - [j24]Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena:
Octal games on graphs: The game 0.33 on subdivided stars and bistars. Theor. Comput. Sci. 746: 19-35 (2018) - [i5]Antoine Dailly, Julien Moncel, Aline Parreau:
Connected Subtraction Games on Subdivided Stars. CoRR abs/1807.10468 (2018) - 2017
- [i4]Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann:
Exact values for three domination-like problems in circular and infinite grid graphs of small height. CoRR abs/1708.00758 (2017) - 2016
- [j23]Marwane Bouznif, Julien Moncel, Myriam Preissmann:
A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs. Discret. Appl. Math. 208: 27-40 (2016) - [i3]Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena:
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. CoRR abs/1612.05772 (2016) - 2015
- [i2]Paul Dorbec, Éric Duchêne, André Fabbri, Julien Moncel, Aline Parreau, Éric Sopena:
Ice sliding games. CoRR abs/1507.00559 (2015) - 2014
- [j22]Julien Moncel, Jérémie Thiery, Ariel Waserhole:
Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint. Comput. Ind. Eng. 67: 216-222 (2014) - 2013
- [j21]Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau:
New results on variants of covering codes in Sierpiński graphs. Des. Codes Cryptogr. 69(2): 181-188 (2013) - 2012
- [j20]Julien Darlay, Nadia Brauner, Julien Moncel:
Dense and sparse graph partition. Discret. Appl. Math. 160(16-17): 2389-2396 (2012) - [j19]Marwane Bouznif, Julien Moncel, Myriam Preissmann:
Generic algorithms for some decision problems on fasciagraphs and rotagraphs. Discret. Math. 312(17): 2707-2719 (2012) - [i1]Sylvain Gravier, Matjaz Kovse, Michel Mollard, Julien Moncel, Aline Parreau:
New results on variants of covering codes in Sierpinski graphs. CoRR abs/1201.1202 (2012) - 2011
- [j18]Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel:
Adaptive Identification in Torii in the King Lattice. Electron. J. Comb. 18(1) (2011)
2000 – 2009
- 2009
- [j17]Éric Duchêne, Sylvain Gravier, Julien Moncel:
New results about impartial solitaire clobber. RAIRO Oper. Res. 43(4): 463-482 (2009) - 2008
- [j16]Tero Laihonen, Julien Moncel:
On graphs admitting t-ID codes. Australas. J Comb. 41: 81-92 (2008) - [j15]Sylvain Gravier, Ralf Klasing, Julien Moncel:
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Oper. Res. 3(1) (2008) - [j14]Sylvain Gravier, Julien Moncel, Ahmed Semri:
Identifying Codes of Cartesian Product of Two Cliques of the Same Size. Electron. J. Comb. 15(1) (2008) - [j13]Yael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel:
Adaptive identification in graphs. J. Comb. Theory A 115(7): 1114-1126 (2008) - 2007
- [j12]Mostafa Blidia, Mustapha Chellali, Frédéric Maffray, Julien Moncel, Ahmed Semri:
Locating-domination and identifying codes in trees. Australas. J Comb. 39: 219-232 (2007) - [j11]Sylvain Gravier, Julien Moncel:
On graphs having a V\{x} set as an identifying code. Discret. Math. 307(3-5): 432-434 (2007) - [j10]Sylvain Gravier, Julien Moncel, Charles Payan:
A generalization of the pentomino exclusion problem: Dislocation of graphs. Discret. Math. 307(3-5): 435-444 (2007) - [j9]Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth:
Codes identifying sets of vertices in random networks. Discret. Math. 307(9-10): 1094-1107 (2007) - 2006
- [j8]Julien Moncel:
Monotonicity of the minimum cardinality of an identifying code in the hypercube. Discret. Appl. Math. 154(6): 898-899 (2006) - [j7]Irène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel:
A linear algorithm for minimum 1-identifying codes in oriented trees. Discret. Appl. Math. 154(8): 1246-1253 (2006) - [j6]Julien Moncel:
On graphs on n vertices having an identifying code of cardinality [log2(n+1)]. Discret. Appl. Math. 154(14): 2032-2039 (2006) - [j5]Julien Moncel:
Constructing codes identifying sets of vertices. Des. Codes Cryptogr. 41(1): 23-31 (2006) - [j4]Sylvain Gravier, Julien Moncel, Ahmed Semri:
Identifying codes of cycles. Eur. J. Comb. 27(5): 767-776 (2006) - 2005
- [b1]Julien Moncel:
Codes Identifiants dans les Graphes. (Identifying Codes in Graphs). Joseph Fourier University, Grenoble, France, 2005 - [j3]Sylvain Gravier, Julien Moncel:
Construction of Codes Identifying Sets of Vertices. Electron. J. Comb. 12 (2005) - [j2]Julien Moncel:
Codes Identifying Vertices in Graphs. Electron. Notes Discret. Math. 22: 229-232 (2005) - [c1]Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth:
Identifying codes in random networks. ISIT 2005: 1464-1467 - 2004
- [j1]Marc Daniel, Sylvain Gravier, Julien Moncel:
Identifying codes in some subgraphs of the square lattice. Theor. Comput. Sci. 319(1-3): 411-421 (2004)
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-06-10 20:31 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:
