Skip to Main content Skip to Navigation


...
hal-03648321v1  Conference papers
Julien BensmailFoivos FioravantesFionn Mc InerneyNicolas NisseNacim Oijid. Une version Maker-Breaker du jeu du plus grand sous-graphe connexe
AlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France
...
hal-03655647v1  Conference papers
Thomas DissauxNicolas Nisse. Longueur linéaire des graphes planaires extérieurs
AlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France
...
hal-03010346v1  Reports
Thomas DissauxGuillaume DucoffeNicolas NisseSimon Nivelle. Treelength of Series-parallel graphs
[Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2020
...
hal-02118847v1  Conference papers
Julien BensmailFionn Mc InerneyNicolas Nisse. Dimension Métrique des Graphes Orientés
AlgoTel 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
...
hal-01798795v3  Journal articles
Frédéric HavetNicolas Nisse. Constrained ear decompositions in graphs and digraphs
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2019, vol. 21 no. 4, ⟨10.23638/DMTCS-21-4-3⟩
...
hal-02835953v1  Conference papers
Ali Al ZoobiDavid CoudertNicolas Nisse. Compromis espace-temps pour le problème de k plus courts chemins simples
ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France. pp.4
...
hal-01534596v1  Journal articles
Euripides MarkouNicolas NisseStéphane Pérennes. Exclusive graph searching vs. pathwidth
Information and Computation, Elsevier, 2017, 252, pp.243 - 260. ⟨10.1016/j.ic.2016.11.007⟩
...
hal-00704202v1  Conference papers
Adrian KosowskiBi LiNicolas NisseKarol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
ICALP - 39th International Colloquium on Automata, Languages and Programming, track C, 2012, United Kingdom. pp.610-622
inria-00482115v1  Conference papers
Nicolas Nisse. Graph Searching and Graph Decompositions
24th European Conference on Operational Research (EURO) (2010), Jul 2010, Lisbon, Portugal
...
hal-01411115v1  Conference papers
Nathann CohenFrédéric HavetWilliam LochetNicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number
Bordeaux Graph Wokshop 2016, Nov 2016, Bordeaux, France. pp.85-88
...
hal-01790130v1  Journal articles
Julien BensmailValentin GarneroNicolas Nisse. On improving matchings in trees, via bounded-length augmentations
Discrete Applied Mathematics, Elsevier, 2018, 250 (11), pp.110-129
...
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-01790322v3  Reports
Fionn Mc InerneyNicolas NisseStéphane Pérennes. Eternal Domination in Grids
[Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2018
...
hal-01326446v1  Conference papers
Nathann CohenMathieu HilaireNicolas MartinsNicolas NisseStéphane Pérennes. Spy-Game on graphs
8th International Conference on Fun with Algorithms, FUN 2016, 2016, La Maddalena, Maddalena Islands, Italy. ⟨10.4230/LIPIcs.FUN.2016.10⟩
...
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-00421414v1  Journal articles
Nicolas Nisse. Connected Graph Searching in Chordal Graphs
Discrete Applied Mathematics, Elsevier, 2009, 157 (12), pp.2603-2610. ⟨10.1016/j.dam.2008.08.007⟩
...
hal-01162695v1  Conference papers
Bi LiFatima Zahra MoatazNicolas NisseKarol Suchan. Minimum Size Tree-decompositions
LAGOS 2015 – VIII Latin-American Algorithms, Graphs and Optimization Symposium, May 2015, Beberibe, Ceará, Brazil
...
hal-01023904v1  Conference papers
Bi LiFatima Zahra MoatazNicolas Nisse. Minimum Size Tree-Decompositions
9th International colloquium on graph theory and combinatorics (ICGT), 2014, Grenoble, France
...
hal-03500888v1  Reports
Julien BensmailFoivos FioravantesFionn Mc InerneyNicolas NisseNacim Oijid. The Maker-Breaker Largest Connected Subgraph Game
[Research Report] Université Côte d’Azur, CNRS, Inria, I3S, Biot, France. 2021