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="Joret, Gwena{\"e}l"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on the Cops and Robber game on graphs embedded in non-orientable surfaces
Nancy E. Clarke
,
Samuel Fiorini
,
Gwenaël Joret
,
Dirk Oliver Theis
Graphs and Combinatorics
30
(1), 2014, pp. 119-124
Hitting and harvesting pumpkins
Gwenaël Joret
,
Christophe Paul
,
Ignasi Sau
,
Saket Saurabh
,
Stéphan Thomassé
SIAM Journal on Discrete Mathematics
28
(3), 2014, pp. 1363-1390
Sorting under partial information (without the ellipsoid algorithm)
Jean Cardinal
,
Samuel Fiorini
,
Gwenaël Joret
,
Raphaël M. Jungers
,
J. Ian Munro
Combinatorica
33
(6), 2013, pp. 655-697
A linear-time algorithm for finding a complete graph minor in a dense graph
Vida Dujmović
,
Daniel J. Harvey
,
Gwenaël Joret
,
Bruce Reed
,
David R. Wood
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 1770-1774
Boxicity of graphs on surfaces
Louis Esperet
,
Gwenaël Joret
Graphs and Combinatorics
29
(3), 2013, pp. 417-427
Complete graph minors and the graph minor structure theorem
Gwenaël Joret
,
David R. Wood
Journal of Combinatorial Theory Series B
103
(1), 2013, pp. 61-74
Trees with given stability number and minimum number of stable sets
Véronique Bruy`ere
,
Gwenaël Joret
,
Hadrien Mélot
Graphs and Combinatorics
28
(2), 2012, pp. 167-187
Minimum entropy combinatorial optimization problems
Jean Cardinal
,
Samuel Fiorini
,
Gwenaël Joret
Theory of Computing Systems
51
(1), 2012, pp. 4-21
An improved bound for first-fit on posets without two long incomparable chains
Vida Dujmović
,
Gwenaël Joret
,
David R. Wood
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1068-1075
The Stackelberg minimum spanning tree game
Jean Cardinal
,
Erik D. Demaine
,
Samuel Fiorini
,
Gwenaël Joret
,
Stefan Langerman
,
Ilan Newman
,
Oren Weimann
Algorithmica
59
(2), 2011, pp. 129-144
Hitting and harvesting pumpkins
Gwenaël Joret
,
Christophe Paul
,
Ignasi Sau
,
Saket Saurabh
,
Stéphan Thomassé
Lecture Notes in Computer Science
6942
, 2011, pp. 394-407
An efficient algorithm for partial order production
Jean Cardinal
,
Samuel Fiorini
,
Gwenaël Joret
,
Raphaël M. Jungers
,
J. Ian Munro
SIAM Journal on Computing
39
(7), 2010, pp. 2927-2940
Hitting diamonds and growing cacti
Samuel Fiorini
,
Gwenaël Joret
,
Ugo Pietropaoli
Lecture Notes in Computer Science
6080
, 2010, pp. 191-204
Irreducible triangulations are small
Gwenaël Joret
,
David R. Wood
Journal of Combinatorial Theory Series B
100
(5), 2010, pp. 446-455
Well-balanced orientations of mixed graphs
Attila Bernáth
,
Gwenaël Joret
Information Processing Letters
106
(4), 2008, pp. 149-151
Tight results on minimum entropy set cover
Jean Cardinal
,
Samuel Fiorini
,
Gwenaël Joret
Algorithmica
51
(1), 2008, pp. 49-60
The Stackelberg Minimum Spanning Tree game
Jean Cardinal
,
Erik D. Demaine
,
Samuel Fiorini
,
Gwenaël Joret
,
Stefan Langerman
,
Ilan Newman
,
Oren Weimann
Lecture Notes in Computer Science
4619
, 2007, pp. 64-76
Minimum entropy coloring
Jean Cardinal
,
Samuel Fiorini
,
Gwenaël Joret
Lecture Notes in Computer Science
3827
, 2005, pp. 819-828