The following pages link to Nicolas Nisse (Q299057):
Displaying 33 items.
- On the monotonicity of process number (Q299059) (← links)
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- Data gathering and personalized broadcasting in radio grids with interference (Q476894) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- A unified approach for gathering and exclusive searching on rings under weak assumptions (Q518678) (← links)
- Exclusive graph searching (Q521823) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- Centroidal localization game (Q668034) (← links)
- Connected graph searching (Q690489) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Graph searching with advice (Q1008727) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Submodular partition functions (Q1045090) (← links)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- On improving matchings in trees, via bounded-length augmentations (Q1801054) (← links)
- On the hull number of some graph classes (Q1939271) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Further results on an equitable 1-2-3 conjecture (Q2022502) (← links)
- Subdivisions of oriented cycles in digraphs with large chromatic number (Q4646948) (← links)
- (Q5136239) (← links)
- (Q5282808) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
- From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows (Q6131788) (← links)
- Digraph redicolouring (Q6146501) (← links)
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs (Q6167856) (← links)
