Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Nisse, Nicolas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Non-deterministic graph searching in trees
Omid Amini
,
David Coudert
,
Nicolas Nisse
Theoretical Computer Science
580
, 2015, pp. 101-121
Weighted coloring in trees
Julio Araujo
,
Nicolas Nisse
,
Stéphane Pérennes
SIAM Journal on Discrete Mathematics
28
(4), 2014, pp. 2029-2041
Weighted coloring in trees
Julio Araujo
,
Nicolas Nisse
,
Stéphane Pérennes
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 75-86
Data gathering and personalized broadcasting in radio grids with interference
Jean-Claude Bermond
,
Bi Li
,
Nicolas Nisse
,
Hervé Rivano
,
Min-Li Yu
Theoretical Computer Science
562
, 2014, pp. 453-475
To satisfy impatient Web surfers is hard
Fedor V. Fomin
,
Frédéric Giroire
,
Alain Jean-Marie
,
Dorian Mazauric
,
Nicolas Nisse
Theoretical Computer Science
526
, 2014, pp. 1-17
Exclusive graph searching
Lélia Blin
,
Janna Burman
,
Nicolas Nisse
Lecture Notes in Computer Science
8125
, 2013, pp. 181-192
Connected graph searching
Lali Barrière
,
Paola Flocchini
,
Fedor V. Fomin
,
Pierre Fraigniaud
,
Nicolas Nisse
,
Nicola Santoro
,
Dimitrios M. Thilikos
Information and Computation
219
, 2012, pp. 1-16
Allowing each node to communicate only once in a distributed system: Shared whiteboard models
Florent Becker
,
Adrian Kosowski
,
Nicolas Nisse
,
Ivan Rapaport
,
Karol Suchan
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2012 (Pittsburgh, Pennsylvania, USA, June 25-27, 2012)
, 2012, pp. 11-17
k
-chordal graphs: From cops and robber to compact routing via treewidth
Adrian Kosowski
,
Bi Li
,
Nicolas Nisse
,
Karol Suchan
Lecture Notes in Computer Science
7392
, 2012, pp. 610-622
Distributed computing of efficient routing schemes in generalized chordal graphs
Nicolas Nisse
,
Ivan Rapaport
,
Karol Suchan
Theoretical Computer Science
444
, 2012, pp. 17-27
Cop and robber games when the robber can hide and ride
Jérémie Chalopin
,
Victor Chepoi
,
Nicolas Nisse
,
Yann Vaxès
SIAM Journal on Discrete Mathematics
25
(1), 2011, pp. 333-359
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Nathann Cohen
,
David Coudert
,
Dorian Mazauric
,
Napoleão Nepomuceno
,
Nicolas Nisse
Theoretical Computer Science
412
(35), 2011, pp. 4675-4687
Pursuing a fast robber on a graph
Fedor V. Fomin
,
Petr A. Golovach
,
Jan Kratochvíl
,
Nicolas Nisse
,
Karol Suchan
Theoretical Computer Science
411
(7-9), 2010, pp. 1167-1181
Nondeterministic graph searching: From pathwidth to treewidth
Fedor V. Fomin
,
Pierre Fraigniaud
,
Nicolas Nisse
Algorithmica
53
(3), 2009, pp. 358-373
Graph searching with advice
Nicolas Nisse
,
David Soguet
Theoretical Computer Science
410
(14), 2009, pp. 1307-1318
Distributed chasing of network intruders
Lélia Blin
,
Pierre Fraigniaud
,
Nicolas Nisse
,
Sandrine Vial
Theoretical Computer Science
399
(1-2), 2008, pp. 12-37
Monotony properties of connected visible graph searching
Pierre Fraigniaud
,
Nicolas Nisse
Information and Computation
206
(12), 2008, pp. 1383-1393
Monotonicity of non-deterministic graph searching
Frédéric Mazoit
,
Nicolas Nisse
Theoretical Computer Science
399
(3), 2008, pp. 169-178
Fast robber in planar graphs
Nicolas Nisse
,
Karol Suchan
Lecture Notes in Computer Science
5344
, 2008, pp. 312-323
Monotonicity of non-deterministic graph searching
Frédéric Mazoit
,
Nicolas Nisse
Lecture Notes in Computer Science
4769
, 2007, pp. 33-44
Monotony properties of connected visible graph searching
Pierre Fraigniaud
,
Nicolas Nisse
Lecture Notes in Computer Science
4271
, 2006, pp. 229-240
Nondeterministic graph searching: From pathwidth to treewidth
Fedor V. Fomin
,
Pierre Fraigniaud
,
Nicolas Nisse
Lecture Notes in Computer Science
3618
, 2005, pp. 364-375