Nicolas Nisse

From MaRDI portal
Revision as of 08:31, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:299057

Available identifiers

zbMath Open nisse.nicolasMaRDI QIDQ299057

List of research outcomes





PublicationDate of PublicationType
Complexity of maker-breaker games on edge sets of graphs2025-01-06Paper
Recontamination helps a lot to hunt a rabbit2024-12-03Paper
Weakly synchronous systems with three machines are Turing powerful2024-10-23Paper
Redicolouring digraphs: directed treewidth and cycle-degeneracy2024-08-09Paper
Finding the \(k\) shortest simple paths: time and space trade-offs2024-07-26Paper
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation2024-06-28Paper
Deciding the Erdős-Pósa Property in 3-Connected Digraphs2024-05-03Paper
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows2024-04-18Paper
Digraph redicolouring2024-02-05Paper
Treelength of series-parallel graphs2023-11-13Paper
Further results on the Hunters and Rabbit game through monotonicity2023-09-28Paper
Pathlength of outerplanar graphs2023-07-26Paper
Redicolouring digraphs: directed treewidth and cycle-degeneracy2023-07-13Paper
Recovery of disrupted airline operations using \(k\)-maximum matching in graphs2023-07-10Paper
The maker-breaker largest connected subgraph game2023-01-05Paper
Problems, proofs, and disproofs on the inversion number2022-12-18Paper
Metric dimension: from graphs to oriented graphs2022-11-02Paper
On Proper Labellings of Graphs with Minimum Label Sum2022-10-13Paper
The largest connected subgraph game2022-08-18Paper
The largest connected subgraph game2022-06-08Paper
Metric dimension: from graphs to oriented graphs2022-04-27Paper
On proper labellings of graphs with minimum label sum2022-03-22Paper
Further results on an equitable 1-2-3 conjecture2021-04-29Paper
Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between2021-04-19Paper
Decomposing degenerate graphs into locally irregular subgraphs2021-03-17Paper
Preferential attachment hypergraph with high modularity2021-03-01Paper
On minimizing the maximum color for the 1-2-3 conjecture2020-12-29Paper
https://portal.mardi4nfdi.de/entity/Q51362392020-11-25Paper
Sequential metric dimension2020-10-12Paper
On the complexity of computing treebreadth2020-04-14Paper
Study of a combinatorial game in graphs through linear programming2020-04-09Paper
Eternal domination in grids2020-02-06Paper
https://portal.mardi4nfdi.de/entity/Q52078412020-01-13Paper
Computing metric hulls in graphs2019-08-01Paper
Centroidal localization game2019-03-05Paper
Sequential metric dimension2019-01-15Paper
Subdivisions of oriented cycles in digraphs with large chromatic number2019-01-03Paper
https://portal.mardi4nfdi.de/entity/Q45602362018-12-10Paper
Localization game on geometric and planar graphs2018-12-03Paper
On improving matchings in trees, via bounded-length augmentations2018-10-26Paper
On distance-preserving elimination orderings in graphs: complexity and algorithms2018-05-24Paper
Minimum size tree-decompositions2018-05-24Paper
Spy-game on graphs: complexity and simple topologies2018-05-15Paper
Recovery of disrupted airline operations using \(k\)-maximum matching in graphs2018-04-09Paper
Maintaining balanced trees for structured distributed streaming systems2017-10-17Paper
https://portal.mardi4nfdi.de/entity/Q52828082017-07-17Paper
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth2017-06-16Paper
Exclusive graph searching2017-04-12Paper
A unified approach for gathering and exclusive searching on rings under weak assumptions2017-03-29Paper
Weighted Coloring in Trees2017-03-03Paper
Exclusive graph searching vs. pathwidth2016-12-22Paper
Finding Paths in Grids with Forbidden Transitions2016-10-21Paper
Minimum size tree-decompositions2016-10-17Paper
On the Complexity of Computing Treebreadth2016-09-29Paper
To Approximate Treewidth, Use Treelength!2016-07-22Paper
On the monotonicity of process number2016-06-22Paper
Computing on rings by oblivious robots: a unified approach for different tasks2015-09-02Paper
Allowing each node to communicate only once in a distributed system: shared whiteboard models2015-07-22Paper
Connected surveillance game2015-05-22Paper
Non-deterministic graph searching in trees2015-05-18Paper
Weighted Coloring in Trees2015-04-17Paper
Locating a target with an agent guided by unreliable local advice2015-03-02Paper
Data gathering and personalized broadcasting in radio grids with interference2014-12-02Paper
To satisfy impatient web surfers is hard2014-03-13Paper
Connected Surveillance Game2013-12-17Paper
Maintaining Balanced Trees for Structured Distributed Streaming Systems2013-12-17Paper
Exclusive Graph Searching2013-09-17Paper
On Rerouting Connection Requests in Networks with Shared Bandwidth2013-07-04Paper
The cost of monotonicity in distributed graph searching2013-06-28Paper
On the hull number of some graph classes2013-03-04Paper
Connected graph searching2012-11-27Paper
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth2012-11-01Paper
Distributed computing of efficient routing schemes in generalized chordal graphs2012-08-10Paper
Cop and Robber Games When the Robber Can Hide and Ride2011-10-27Paper
Tradeoffs in process strategy games with application in the WDM reconfiguration problem2011-09-12Paper
Connected graph searching in chordal graphs2010-04-28Paper
Pursuing a fast robber on a graph2010-03-09Paper
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs2010-02-24Paper
Submodular partition functions2009-12-15Paper
Nondeterministic graph searching: from pathwidth to treewidth2009-06-17Paper
Graph searching with advice2009-03-30Paper
Distributed Chasing of Network Intruders2009-03-12Paper
Monotony properties of connected visible graph searching2009-02-03Paper
Fast Robber in Planar Graphs2009-01-20Paper
Connected Treewidth and Connected Graph Searching2008-09-18Paper
Monotony Properties of Connected Visible Graph Searching2008-09-04Paper
Monotonicity of Non-deterministic Graph Searching2008-07-01Paper
Monotonicity of non-deterministic graph searching2008-06-24Paper
Distributed chasing of network intruders2008-06-24Paper
Graph Searching with Advice2007-11-15Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
The Maker-Breaker Largest Connected Subgraph GameN/APaper

Research outcomes over time

This page was built for person: Nicolas Nisse