Julien Moncel

According to our database1, Julien Moncel authored at least 29 papers between 2004 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Connected Subtraction Games on Subdivided Stars.
Integers, 2019

Exact values for three domination-like problems in circular and infinite grid graphs of small height.
Discret. Math. Theor. Comput. Sci., 2019

2018
Octal games on graphs: The game 0.33 on subdivided stars and bistars.
Theor. Comput. Sci., 2018

Ice sliding games.
Int. J. Game Theory, 2018

2016
A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs.
Discret. Appl. Math., 2016

2014
Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint.
Comput. Ind. Eng., 2014

2013
New results on variants of covering codes in Sierpiński graphs.
Des. Codes Cryptogr., 2013

2012
Generic algorithms for some decision problems on fasciagraphs and rotagraphs.
Discret. Math., 2012

Dense and sparse graph partition.
Discret. Appl. Math., 2012

2011
Adaptive Identification in Torii in the King Lattice.
Electron. J. Comb., 2011

2009
New results about impartial solitaire clobber.
RAIRO Oper. Res., 2009

2008
Adaptive identification in graphs.
J. Comb. Theory, Ser. A, 2008

Identifying Codes of Cartesian Product of Two Cliques of the Same Size.
Electron. J. Comb., 2008

Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs.
Algorithmic Oper. Res., 2008

On graphs admitting t-ID codes.
Australas. J Comb., 2008

2007
A generalization of the pentomino exclusion problem: Dislocation of graphs.
Discret. Math., 2007

On graphs having a V\{x} set as an identifying code.
Discret. Math., 2007

Codes identifying sets of vertices in random networks.
Discret. Math., 2007

Locating-domination and identifying codes in trees.
Australas. J Comb., 2007

2006
Identifying codes of cycles.
Eur. J. Comb., 2006

Constructing codes identifying sets of vertices.
Des. Codes Cryptogr., 2006

On graphs on n vertices having an identifying code of cardinality [log<sub>2</sub>(n+1)].
Discret. Appl. Math., 2006

Monotonicity of the minimum cardinality of an identifying code in the hypercube.
Discret. Appl. Math., 2006

A linear algorithm for minimum 1-identifying codes in oriented trees.
Discret. Appl. Math., 2006

2005
Codes Identifiants dans les Graphes. (Identifying Codes in Graphs).
PhD thesis, 2005

Codes Identifying Vertices in Graphs.
Electron. Notes Discret. Math., 2005

Construction of Codes Identifying Sets of Vertices.
Electron. J. Comb., 2005

Identifying codes in random networks.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Identifying codes in some subgraphs of the square lattice.
Theor. Comput. Sci., 2004


  Loading...