default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Nisse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2014
[b2]Nicolas Nisse:
Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help. (Complexité algorithmique: entre structure et connaissance. Comment les jeux de poursuite peuvent apporter des solutions). University of Nice Sophia Antipolis, France, 2014- 2007
- [b1]Nicolas Nisse:
Jeux des gendarmes et du voleur dans les graphes. Mineurs de graphes, stratgies connexes, et approche distribue. (Graph searching and related problems. Graph Minors, connected search strategies, and distributed approach). University of Paris-Sud, Orsay, France, 2007
Journal Articles
- 2024
- [j66]Nicolas Nisse, Lucas Picasarri-Arrieta
, Ignasi Sau:
Redicolouring digraphs: Directed treewidth and cycle-degeneracy. Discret. Appl. Math. 356: 191-208 (2024) - [j65]Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald:
Digraph redicolouring. Eur. J. Comb. 116: 103876 (2024) - [j64]Fabricio Benevides, Jean-Claude Bermond, Hicham Lesfari, Nicolas Nisse:
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation. Eur. J. Comb. 119: 103801 (2024) - [j63]Spyros Angelopoulos, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Preface to special issue on theory and applications of Graph Searching. Theor. Comput. Sci. 1016: 114759 (2024) - 2023
- [j62]Júlio Araújo, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva:
On Finding the Best and Worst Orientations for the Metric Dimension. Algorithmica 85(10): 2962-3002 (2023) - [j61]Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle:
Treelength of series-parallel graphs. Discret. Appl. Math. 341: 16-30 (2023) - [j60]Nicolas Nisse, Alexandre Salch, Valentin Weber:
Recovery of disrupted airline operations using k-maximum matching in graphs. Eur. J. Oper. Res. 309(3): 1061-1072 (2023) - [j59]Ali Al Zoobi, David Coudert, Nicolas Nisse:
Finding the k Shortest Simple Paths: Time and Space Trade-offs. ACM J. Exp. Algorithmics 28: 1.11:1-1.11:23 (2023) - [j58]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid:
The Maker-Breaker Largest Connected Subgraph game. Theor. Comput. Sci. 943: 102-120 (2023) - 2022
- [j57]Julien Bensmail, Foivos Fioravantes, Nicolas Nisse:
On Proper Labellings of Graphs with Minimum Label Sum. Algorithmica 84(4): 1030-1063 (2022) - [j56]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. Algorithmica 84(9): 2533-2555 (2022) - [j55]Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse:
Metric dimension: From graphs to oriented graphs. Discret. Appl. Math. 323: 28-42 (2022) - [j54]Frédéric Giroire, Nicolas Nisse, Thibaud Trolliet, Malgorzata Sulkowska:
Preferential attachment hypergraph with high modularity. Netw. Sci. 10(4): 400-429 (2022) - 2021
- [j53]Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. Algorithmica 83(5): 1459-1492 (2021) - [j52]Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse:
On minimizing the maximum color for the 1-2-3 Conjecture. Discret. Appl. Math. 289: 32-51 (2021) - [j51]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
Further results on an equitable 1-2-3 Conjecture. Discret. Appl. Math. 297: 1-20 (2021) - 2020
- [j50]Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica 82(2): 212-244 (2020) - [j49]Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse:
On the Complexity of Computing Treebreadth. Algorithmica 82(6): 1574-1600 (2020) - [j48]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. Algorithmica 82(10): 2867-2901 (2020) - [j47]Julien Bensmail, François Dross, Nicolas Nisse:
Decomposing Degenerate Graphs into Locally Irregular Subgraphs. Graphs Comb. 36(6): 1869-1889 (2020) - 2019
- [j46]Kolja Knauer, Nicolas Nisse:
Computing metric hulls in graphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j45]Frédéric Havet, Nicolas Nisse:
Constrained ear decompositions in graphs and digraphs. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j44]Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos:
Preface to special issue on Theory and Applications of Graph Searching. Theor. Comput. Sci. 794: 1-2 (2019) - 2018
- [j43]Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Centroidal Localization Game. Electron. J. Comb. 25(4): 4 (2018) - [j42]David Coudert, Guillaume Ducoffe, Nicolas Nisse, Mauricio Soto:
On distance-preserving elimination orderings in graphs: Complexity and algorithms. Discret. Appl. Math. 243: 140-153 (2018) - [j41]Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan:
Minimum size tree-decompositions. Discret. Appl. Math. 245: 109-127 (2018) - [j40]Julien Bensmail, Valentin Garnero, Nicolas Nisse:
On improving matchings in trees, via bounded-length augmentations. Discret. Appl. Math. 250: 110-129 (2018) - [j39]Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Localization game on geometric and planar graphs. Discret. Appl. Math. 251: 30-39 (2018) - [j38]Júlio Araújo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan:
On interval number in cycle convexity. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j37]Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse:
Subdivisions of oriented cycles in digraphs with large chromatic number. J. Graph Theory 89(4): 439-456 (2018) - [j36]Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio:
Spy-game on graphs: Complexity and simple topologies. Theor. Comput. Sci. 725: 1-15 (2018) - 2017
- [j35]Lélia Blin, Janna Burman, Nicolas Nisse:
Exclusive Graph Searching. Algorithmica 77(3): 942-969 (2017) - [j34]Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes:
Maintaining balanced trees for structured distributed streaming systems. Discret. Appl. Math. 232: 176-188 (2017) - [j33]Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse:
A unified approach for gathering and exclusive searching on rings under weak assumptions. Distributed Comput. 30(1): 17-48 (2017) - [j32]Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch, Valentin Weber:
Recovery of disrupted airline operations using k-Maximum Matching in graphs. Electron. Notes Discret. Math. 62: 3-8 (2017) - [j31]Euripides Markou, Nicolas Nisse, Stéphane Pérennes:
Exclusive graph searching vs. pathwidth. Inf. Comput. 252: 243-260 (2017) - [j30]Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, Davide Careglio, Alok Kumar, Christian Glacet, David Coudert, Nicolas Nisse, Lluís Fàbrega, Pere Vilà, Miguel Camelo, Pieter Audenaert, Didier Colle, Piet Demeester:
Routing at Large Scale: Advances and Challenges for Complex Networks. IEEE Netw. 31(4): 108-118 (2017) - 2016
- [j29]Nicolas Nisse, Ronan Pardo Soares:
On the monotonicity of process number. Discret. Appl. Math. 210: 103-111 (2016) - [j28]David Coudert, Dorian Mazauric, Nicolas Nisse:
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth. ACM J. Exp. Algorithmics 21(1): 1.3:1-1.3:23 (2016) - [j27]David Coudert, Guillaume Ducoffe, Nicolas Nisse:
To Approximate Treewidth, Use Treelength! SIAM J. Discret. Math. 30(3): 1424-1436 (2016) - [j26]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Forewords: Special issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 655: 1 (2016) - 2015
- [j25]Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan:
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Algorithmica 72(3): 758-777 (2015) - [j24]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan:
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica 72(4): 1055-1096 (2015) - [j23]Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca:
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28(3): 189-200 (2015) - [j22]Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan:
Minimum Size Tree-decompositions. Electron. Notes Discret. Math. 50: 21-27 (2015) - [j21]Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, Min-Li Yu:
Data gathering and personalized broadcasting in radio grids with interference. Theor. Comput. Sci. 562: 453-475 (2015) - [j20]Omid Amini, David Coudert, Nicolas Nisse:
Non-deterministic graph searching in trees. Theor. Comput. Sci. 580: 101-121 (2015) - [j19]Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, R. Soares:
Connected surveillance game. Theor. Comput. Sci. 584: 131-143 (2015) - 2014
- [j18]Júlio Araújo, Nicolas Nisse, Stéphane Pérennes:
Weighted Coloring in Trees. SIAM J. Discret. Math. 28(4): 2029-2041 (2014) - [j17]Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse:
To satisfy impatient Web surfers is hard. Theor. Comput. Sci. 526: 1-17 (2014) - 2013
- [j16]Nicolas Nisse, Ronan Pardo Soares:
On the Monotonicity of Process Number. Electron. Notes Discret. Math. 44: 141-147 (2013) - [j15]Júlio Araújo, Victor A. Campos, Frédéric Giroire, Nicolas Nisse, Leonardo Sampaio Rocha, R. Soares:
On the hull number of some graph classes. Theor. Comput. Sci. 475: 1-12 (2013) - 2012
- [j14]Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos:
Connected graph searching. Inf. Comput. 219: 1-16 (2012) - [j13]Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Distributed computing of efficient routing schemes in generalized chordal graphs. Theor. Comput. Sci. 444: 17-27 (2012) - 2011
- [j12]Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès:
Cop and Robber Games When the Robber Can Hide and Ride. SIAM J. Discret. Math. 25(1): 333-359 (2011) - [j11]Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse:
Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theor. Comput. Sci. 412(35): 4675-4687 (2011) - 2010
- [j10]Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan:
Pursuing a fast robber on a graph. Theor. Comput. Sci. 411(7-9): 1167-1181 (2010) - 2009
- [j9]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53(3): 358-373 (2009) - [j8]Nicolas Nisse:
Connected graph searching in chordal graphs. Discret. Appl. Math. 157(12): 2603-2610 (2009) - [j7]David Ilcinkas, Nicolas Nisse, David Soguet:
The cost of monotonicity in distributed graph searching. Distributed Comput. 22(2): 117-127 (2009) - [j6]Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé:
Submodular partition functions. Discret. Math. 309(20): 6000-6008 (2009) - [j5]David Coudert, Dorian Mazauric, Nicolas Nisse:
On Rerouting Connection Requests in Networks with Shared Bandwidth. Electron. Notes Discret. Math. 32: 109-116 (2009) - [j4]Nicolas Nisse, David Soguet:
Graph searching with advice. Theor. Comput. Sci. 410(14): 1307-1318 (2009) - 2008
- [j3]Pierre Fraigniaud, Nicolas Nisse:
Monotony properties of connected visible graph searching. Inf. Comput. 206(12): 1383-1393 (2008) - [j2]Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial:
Distributed chasing of network intruders. Theor. Comput. Sci. 399(1-2): 12-37 (2008) - [j1]Frédéric Mazoit, Nicolas Nisse:
Monotonicity of non-deterministic graph searching. Theor. Comput. Sci. 399(3): 169-178 (2008)
Conference and Workshop Papers
- 2023
- [c44]J. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan:
Semi-proper orientations of dense graphs. LAGOS 2023: 231-240 - [c43]Frédéric Giroire, Nicolas Nisse, Kostiantyn Ohulchanskyi, Malgorzata Sulkowska, Thibaud Trolliet:
Preferential Attachment Hypergraph with Vertex Deactivation. MASCOTS 2023: 1-8 - [c42]Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse:
Recontamination Helps a Lot to Hunt a Rabbit. MFCS 2023: 42:1-42:14 - [c41]Cinzia Di Giusto, Davide Ferré, Étienne Lozes, Nicolas Nisse:
Weakly Synchronous Systems with Three Machines Are Turing Powerful. RP 2023: 28-41 - [c40]Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva:
Deciding the Erdős-Pósa Property in 3-Connected Digraphs. WG 2023: 59-71 - 2022
- [c39]Thomas Dissaux, Nicolas Nisse:
Pathlength of Outerplanar Graphs. LATIN 2022: 172-187 - 2021
- [c38]Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle:
Treelength of Series-parallel Graphs. LAGOS 2021: 30-38 - [c37]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. WG 2021: 296-307 - 2020
- [c36]Julien Bensmail, Foivos Fioravantes, Nicolas Nisse:
On Proper Labellings of Graphs with Minimum Label Sum. IWOCA 2020: 56-68 - [c35]Ali Al Zoobi, David Coudert, Nicolas Nisse:
Space and Time Trade-Off for the k Shortest Simple Paths Problem. SEA 2020: 18:1-18:13 - 2019
- [c34]Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Eternal Domination in Grids. CIAC 2019: 311-322 - [c33]Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse:
Metric Dimension: from Graphs to Oriented Graphs. LAGOS 2019: 111-123 - 2018
- [c32]Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Sequential Metric Dimension. WAOA 2018: 36-50 - 2017
- [c31]Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. ISAAC 2017: 22:1-22:13 - 2016
- [c30]Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes:
Spy-Game on Graphs. FUN 2016: 10:1-10:16 - [c29]Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse:
On the Complexity of Computing Treebreadth. IWOCA 2016: 3-15 - 2015
- [c28]Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse:
Finding Paths in Grids with Forbidden Transitions. WG 2015: 154-168 - 2014
- [c27]Gianlorenzo D'Angelo, Xavier Défago, Nicolas Nisse:
Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments. CANDAR 2014: 50-59 - [c26]Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse:
Gathering and Exclusive Searching on Rings under Minimal Assumptions. ICDCN 2014: 149-164 - [c25]Júlio Araújo, Nicolas Nisse, Stéphane Pérennes:
Weighted Coloring in Trees. STACS 2014: 75-86 - [c24]David Coudert, Dorian Mazauric, Nicolas Nisse:
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth. SEA 2014: 46-58 - 2013
- [c23]Lélia Blin, Janna Burman, Nicolas Nisse:
Exclusive Graph Searching. ESA 2013: 181-192 - [c22]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan:
A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. IPDPS Workshops 2013: 667-676 - [c21]Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares:
Connected Surveillance Game. SIROCCO 2013: 68-79 - [c20]Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes:
Maintaining Balanced Trees for Structured Distributed Streaming Systems. SIROCCO 2013: 177-188 - 2012
- [c19]Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse:
To Satisfy Impatient Web Surfers Is Hard. FUN 2012: 166-176 - [c18]Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan:
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. ICALP (2) 2012: 610-622 - [c17]Sonia Belhareth, David Coudert, Dorian Mazauric, Nicolas Nisse, Issam Tahiri:
Reconfiguration with physical constraints in WDM networks. ICC 2012: 6257-6261 - [c16]Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Allowing each node to communicate only once in a distributed system: shared whiteboard models. SPAA 2012: 11-17 - [c15]Lélia Blin, Janna Burman, Nicolas Nisse:
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching. DISC 2012: 403-404 - 2011
- [c14]Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca:
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. IPDPS 2011: 508-514 - 2010
- [c13]Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse:
Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem. FUN 2010: 121-132 - [c12]Christelle Caillouet, Florian Huc, Nicolas Nisse, Stéphane Pérennes, Hervé Rivano:
Stability of a localized and greedy routing algorithm. IPDPS Workshops 2010: 1-8 - [c11]Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse:
Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? PODC 2010: 355-364 - 2009
- [c10]Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano:
Minimum Delay Data Gathering in Radio Networks. ADHOC-NOW 2009: 69-82 - [c9]Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs. SIROCCO 2009: 252-265 - 2008
- [c8]Nicolas Nisse, Karol Suchan:
Fast Robber in Planar Graphs. WG 2008: 312-323 - 2007
- [c7]David Ilcinkas, Nicolas Nisse, David Soguet:
The Cost of Monotonicity in Distributed Graph Searching. OPODIS 2007: 415-428 - [c6]Nicolas Nisse, David Soguet:
Graph Searching with Advice. SIROCCO 2007: 51-65 - [c5]Frédéric Mazoit, Nicolas Nisse:
Monotonicity of Non-deterministic Graph Searching. WG 2007: 33-44 - 2006
- [c4]Pierre Fraigniaud, Nicolas Nisse:
Connected Treewidth and Connected Graph Searching. LATIN 2006: 479-490 - [c3]Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial:
Distributed Chasing of Network Intruders. SIROCCO 2006: 70-84 - [c2]Pierre Fraigniaud, Nicolas Nisse:
Monotony Properties of Connected Visible Graph Searching. WG 2006: 229-240 - 2005
- [c1]Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS 2005: 364-375
Parts in Books or Collections
- 2019
- [p1]Nicolas Nisse:
Network Decontamination. Distributed Computing by Mobile Entities 2019: 516-548
Editorship
- 2013
- [e1]Roberto Baldoni, Nicolas Nisse, Maarten van Steen:
Principles of Distributed Systems - 17th International Conference, OPODIS 2013, Nice, France, December 16-18, 2013. Proceedings. Lecture Notes in Computer Science 8304, Springer 2013, ISBN 978-3-319-03849-0 [contents]
Informal and Other Publications
- 2023
- [i16]Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald:
Digraph redicolouring. CoRR abs/2301.03417 (2023) - [i15]Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Complexity of Maker-Breaker Games on Edge Sets of Graphs. CoRR abs/2302.10972 (2023) - [i14]Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau:
Redicolouring digraphs: directed treewidth and cycle-degeneracy. CoRR abs/2307.06700 (2023) - [i13]Cinzia Di Giusto, Davide Ferré, Étienne Lozes, Nicolas Nisse:
Weakly synchronous systems with three machines are Turing powerful. CoRR abs/2308.10578 (2023) - [i12]Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse:
Further results on the Hunters and Rabbit game through monotonicity. CoRR abs/2309.16533 (2023) - 2022
- [i11]Frédéric Giroire, Nicolas Nisse, Kostiantyn Ohulchanskyi, Malgorzata Sulkowska, Thibaud Trolliet:
Preferential attachment hypergraph with vertex deactivation. CoRR abs/2205.00071 (2022) - [i10]Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande:
Problems, proofs, and disproofs on the inversion number. CoRR abs/2212.09188 (2022) - 2021
- [i9]Frédéric Giroire, Nicolas Nisse, Thibaud Trolliet, Malgorzata Sulkowska:
Preferential attachment hypergraph with high modularity. CoRR abs/2103.01751 (2021) - 2017
- [i8]Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Localization game on geometric and planar graphs. CoRR abs/1709.05904 (2017) - [i7]Kolja Knauer, Nicolas Nisse:
Computing metric hulls in graphs. CoRR abs/1710.02958 (2017) - [i6]Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Centroidal localization game. CoRR abs/1711.08836 (2017) - 2016
- [i5]Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse:
On computing tree and path decompositions with metric constraints on the bags. CoRR abs/1601.01958 (2016) - [i4]Seong-Gyun Jeong, Yuliya Tarabalka, Nicolas Nisse, Josiane Zerubia:
Progressive Tree-like Curvilinear Structure Reconstruction with Structured Ranking Learning and Graph Algorithm. CoRR abs/1612.02631 (2016) - 2011
- [i3]Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power. CoRR abs/1109.6534 (2011) - 2010
- [i2]Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès:
Cop and robber games when the robber can hide and ride. CoRR abs/1001.4457 (2010) - [i1]Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca:
Adding a referee to an interconnection network: What can(not) be computed in one round. CoRR abs/1009.4447 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
