The following pages link to Julien Moncel (Q442400):
Displayed 27 items.
- (Q284832) (redirect page) (← links)
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs (Q284833) (← links)
- Generic algorithms for some decision problems on fasciagraphs and rotagraphs (Q442402) (← links)
- Adaptive identification in Torii in the King lattice (Q540127) (← links)
- Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
- Dense and sparse graph partition (Q714027) (← links)
- Constructing codes identifying sets of vertices (Q851780) (← links)
- On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130) (← links)
- A generalization of the pentomino exclusion problem: dislocation of graphs (Q864131) (← links)
- Codes identifying sets of vertices in random networks (Q870971) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- Identifying codes of Cartesian product of two cliques of the same size (Q1010656) (← links)
- Construction of codes identifying sets of vertices (Q1773205) (← links)
- Octal games on graphs: the game 0.33 on subdivided stars and bistars (Q1784739) (← links)
- Ice sliding games (Q1791286) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- Identifying codes of cycles (Q2488842) (← links)
- Monotonicity of the minimum cardinality of an identifying code in the hypercube (Q2492191) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367) (← links)
- (Q2867320) (← links)
- Codes Identifying Vertices in Graphs (Q3439339) (← links)
- (Q3517160) (← links)
- New results about impartial solitaire clobber (Q3644818) (← links)
- Connected Subtraction Games on Subdivided Stars (Q5207818) (← links)
- (Q5377234) (← links)
- (Q5442540) (← links)