The following pages link to Nicolas Nisse (Q299057):
Displaying 50 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)
- On proper labellings of graphs with minimum label sum (Q2118389) (← links)
- On minimizing the maximum color for the 1-2-3 conjecture (Q2217460) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- Eternal domination in grids (Q2294061) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- Connected surveillance game (Q2345464) (← links)
- Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- Maintaining balanced trees for structured distributed streaming systems (Q2410236) (← links)
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs (Q2413142) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- Decomposing degenerate graphs into locally irregular subgraphs (Q2657056) (← links)
- Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between (Q2663714) (← links)
- The maker-breaker largest connected subgraph game (Q2680987) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- Finding Paths in Grids with Forbidden Transitions (Q2827809) (← links)
- On Rerouting Connection Requests in Networks with Shared Bandwidth (Q2839218) (← links)
- Exclusive Graph Searching (Q2849309) (← links)
- Connected Surveillance Game (Q2868632) (← links)
- Maintaining Balanced Trees for Structured Distributed Streaming Systems (Q2868643) (← links)
- Weighted Coloring in Trees (Q2965473) (← links)
- Cop and Robber Games When the Robber Can Hide and Ride (Q3094914) (← links)
- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth (Q3167048) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- Monotonicity of Non-deterministic Graph Searching (Q3508552) (← links)
