Skip to Main content Skip to Navigation


...
hal-00687102v1  Conference papers
Fedor V. FominFrédéric GiroireAlain Jean-MarieDorian MazauricNicolas Nisse. Satisfaire un internaute impatient est difficile
14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France
...
hal-00687120v1  Conference papers
Adrian KosowskiBi LiNicolas NisseKarol Suchan. $k$-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
AlgoTel - 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 2012, La Grande Motte, France
...
hal-00794622v2  Reports
Julio AraujoNicolas NisseStéphane Pérennes. Weighted Coloring in Trees
[Research Report] RR-8249, INRIA. 2013
...
hal-00741948v1  Journal articles
Lali BarrièrePaola FlocchiniFedor V. FominPierre FraigniaudNicolas Nisse et al.  Connected Graph Searching
Information and Computation, Elsevier, 2012, 219, pp.1-16
...
hal-00845536v1  Conference papers
Frédéric GiroireRemigiusz ModrzejewskiNicolas NisseStéphane Pérennes. Maintaining Balanced Trees For Structured Distributed Streaming Systems
20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Jul 2013, Ischia, Italy. pp.177-188, ⟨10.1007/978-3-319-03578-9_15⟩
hal-00931481v1  Directions of work or proceedings
Yann BusnelNicolas NisseFranck Rousseau. Actes des 15es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel)
Yann Busnel and Nicolas Nisse and Franck Rousseau. France. Univ. Nantes, pp.130, 2013
...
hal-01534598v1  Conference papers
Julien BensmailValentin GarneroNicolas NisseAlexandre SalchValentin Weber. Recovery of disrupted airline operations using k-Maximum Matching in graphs
IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Sep 2017, Marseille, France. pp.3-8
...
hal-01394201v4  Journal articles
Julio AraujoGuillaume DucoffeNicolas NisseKarol Suchan. On interval number in cycle convexity
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2018, Vol. 20 no. 1 (1), pp.1-28
...
hal-01163494v1  Journal articles
Adrian KosowskiBi LiNicolas NisseKarol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
Algorithmica, Springer Verlag, 2015, 72 (3), pp.758-777
...
hal-00845531v1  Conference papers
Frédéric GiroireDorian MazauricNicolas NisseStéphane PérennesRonan Soares. Connected Surveillance Game
20th Colloquium on Structural Information and Communication Complexity (SIROCCO), Jul 2013, Ischia, Italy. pp.68-79
...
inria-00482117v1  Conference papers
Jérémie ChalopinVictor ChepoiNicolas NisseYann Vaxès. Cop and robber games when the robber can hide and ride
8th French Combinatorial Conference, Jun 2010, Orsay, France
inria-00423448v1  Conference papers
Pierre FraigniaudNicolas Nisse. Connected Treewidth and Connected Graph Searching
Latin American Theoretical Informatics Symposium (LATIN), 2006, Valdivia, Chile
inria-00482115v1  Conference papers
Nicolas Nisse. Graph Searching and Graph Decompositions
24th European Conference on Operational Research (EURO) (2010), Jul 2010, Lisbon, Portugal
...
hal-00745587v1  Reports
Nicolas NisseRonan Soares. On The Monotonicity of Process Number
[Research Report] RR-8132, INRIA. 2012, pp.17
inria-00423449v1  Conference papers
Pierre FraigniaudNicolas Nisse. Monotony Properties of Connected Visible Graph Searching
International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2006, Bergen, Norway
inria-00423454v1  Conference papers
Nicolas NisseIvan RapaportKarol Suchan. Distributed computing of efficient routing schemes in generalized chordal graphs
International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2009, Piran, Slovenia
inria-00423451v1  Conference papers
Nicolas NisseKarol Suchan. Fast Robber in Planar Graphs
International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2008, Durham, United Kingdom
...
inria-00587250v1  Conference papers
Becker FlorentMartin MatamalaNicolas NisseIvan RapaportKarol Suchan et al.  Reconstruire un graphe en une ronde
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France
hal-00931478v1  Directions of work or proceedings
Roberto BaldoniNicolas NisseMaarten van Steen. Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)
Roberto Baldoni and Nicolas Nisse and Maarten van Steen. 8304, Springer, pp.280, 2013, Lecture Notes in Computer Science, 978-3-319-03849-0
...
hal-00931523v1  Conference papers
Julio AraújoNicolas NisseStéphane Pérennes. Weighted Coloring in Trees
31st Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2014, Lyon, France. pp.75-86
...
hal-01072723v1  Conference papers
Gianlorenzo d'AngeloXavier DéfagoNicolas Nisse. Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments
Second International Symposium on Computing and Networking (CANDAR), Dec 2014, Mt. Fuji, Shizuoka, Japan