|
+
PDF
Chat
|
Shallow brambles
|
2025
|
Nicolás Bousquet
Wouter Cames van Batenburg
Louis Esperet
Gwenaël Joret
Piotr Micek
|
|
+
PDF
Chat
|
Planar Graphs in Blowups of Fans
|
2025
|
Vida Dujmović
Gwenaël Joret
Piotr Micek
Pat Morin
David R. Wood
|
|
+
PDF
Chat
|
Integer programs with nearly totally unimodular matrices: the cographic case
|
2025
|
Manuel Aprile
Samuel Fiorini
Gwenaël Joret
Stefan Kober
Miehał T. Seweryn
Stefan Weltge
Yelena Yuditsky
|
|
+
PDF
Chat
|
Erd\H{o}s-P\'{o}sa property of cycles that are far apart
|
2024
|
Vida Dujmović
Gwenaël Joret
Piotr Micek
Pat Morin
|
|
+
PDF
Chat
|
Tight bound for the Erdős–Pósa property of tree minors
|
2024
|
Vida Dujmović
Gwenaël Joret
Piotr Micek
Pat Morin
|
|
+
PDF
Chat
|
Integer programs with bounded subdeterminants and two nonzeros per row
|
2024
|
Samuel Fiorini
Gwenaël Joret
Stefan Weltge
Yelena Yuditsky
|
|
+
PDF
Chat
|
Integer programs with nearly totally unimodular matrices: the cographic
case
|
2024
|
Manuel Aprile
Samuel Fiorini
Gwenaël Joret
Stefan Kober
Michał T. Seweryn
Stefan Weltge
Yelena Yuditsky
|
|
+
PDF
Chat
|
Product Structure Extension of the Alon–Seymour–Thomas Theorem
|
2024
|
Marc Distel
Vida Dujmović
David Eppstein
Robert Hickingbotham
Gwenaël Joret
Piotr Micek
Pat Morin
Michał T. Seweryn
David R. Wood
|
|
+
PDF
Chat
|
Planar graphs in blowups of fans
|
2024
|
Vida Dujmović
Gwenaël Joret
Piotr Micek
Pat Morin
David R. Wood
|
|
+
|
Neighborhood Complexity of Planar Graphs
|
2024
|
Gwenaël Joret
Clément Rambaud
|
|
+
PDF
Chat
|
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
|
2024
|
Vida Dujmović
Gwenaël Joret
Piotr Micek
Pat Morin
David R. Wood
|
|
+
PDF
Chat
|
A Caro-Wei bound for induced linear forests in graphs
|
2024
|
Gwenaël Joret
Robin Petit
|
|
+
PDF
Chat
|
Tight bound for the Erd\H{o}s-P\'osa property of tree minors
|
2024
|
Vida Dujmović
Gwenaël Joret
Piotr Micek
Pat Morin
|
|
+
|
Pathwidth vs Cocircumference
|
2024
|
Marcin Briański
Gwenaël Joret
Michał T. Seweryn
|
|
+
PDF
Chat
|
The Grid-Minor Theorem Revisited
|
2024
|
Vida Dujmović
Robert Hickingbotham
Jędrzej Hodor
Gwenaël Joret
Hoang La
Piotr Micek
Pat Morin
Clément Rambaud
David R. Wood
|
|
+
PDF
Chat
|
Cliquewidth and Dimension
|
2024
|
Gwenaël Joret
Piotr Micek
Michał Pilipczuk
Bartosz Walczak
|
|
+
PDF
Chat
|
Edge Separators for Graphs Excluding a Minor
|
2023
|
Gwenaël Joret
William Lochet
Michał T. Seweryn
|
|
+
PDF
Chat
|
The Excluded Tree Minor Theorem Revisited
|
2023
|
Vida Dujmović
Robert Hickingbotham
Gwenaël Joret
Piotr Micek
Pat Morin
David R. Wood
|
|
+
PDF
Chat
|
Sparse universal graphs for planarity
|
2023
|
Louis Esperet
Gwenaël Joret
Pat Morin
|
|
+
PDF
Chat
|
Treedepth vs Circumference
|
2023
|
Marcin Briański
Gwenaël Joret
Konrad Majewski
Piotr Micek
Michał T. Seweryn
Roohani Sharma
|
|
+
|
Tight bound on treedepth in terms of pathwidth and longest path
|
2023
|
Meike Hatzel
Gwenaël Joret
Piotr Micek
Marcin Pilipczuk
Torsten Ueckerdt
Bartosz Walczak
|
|
+
|
Neighborhood complexity of planar graphs
|
2023
|
Gwenaël Joret
Clément Rambaud
|
|
+
|
The Excluded Tree Minor Theorem Revisited
|
2023
|
Vida Dujmović
Robert Hickingbotham
Gwenaël Joret
Piotr Micek
Pat Morin
David R. Wood
|
|
+
|
Pathwidth vs cocircumference
|
2023
|
Marcin Briański
Gwenaël Joret
Michał T. Seweryn
|
|
+
|
Cliquewidth and dimension
|
2023
|
Gwenaël Joret
Piotr Micek
Michał Pilipczuk
Bartosz Walczak
|
|
+
|
Approximating Pathwidth for Graphs of Small Treewidth
|
2022
|
Carla Groenland
Gwenaël Joret
Wojciech Nadara
Bartosz Walczak
|
|
+
PDF
Chat
|
Improved Bounds for Weak Coloring Numbers
|
2022
|
Gwenaël Joret
Piotr Micek
|
|
+
PDF
Chat
|
Integer programs with bounded subdeterminants and two nonzeros per row
|
2022
|
Samuel Fiorini
Gwenaël Joret
Stefan Weltge
Yelena Yuditsky
|
|
+
PDF
Chat
|
Subgraph densities in a surface
|
2022
|
Tony Huynh
Gwenaël Joret
David R. Wood
|
|
+
|
Treedepth vs circumference
|
2022
|
Marcin Briański
Gwenaël Joret
Konrad Majewski
Piotr Micek
Michał T. Seweryn
Roohani Sharma
|
|
+
|
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
|
2022
|
Vida Dujmović
Gwenaël Joret
Piotr Micek
Pat Morin
David R. Wood
|
|
+
|
Product structure extension of the Alon--Seymour--Thomas theorem
|
2022
|
Marc Distel
Vida Dujmović
David Eppstein
Robert Hickingbotham
Gwenaël Joret
Pat Morin
Michał T. Seweryn
David R. Wood
|
|
+
|
Edge separators for graphs excluding a minor
|
2022
|
Gwenaël Joret
William Lochet
Michał T. Seweryn
|
|
+
PDF
Chat
|
Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond
|
2021
|
Manuel Aprile
Samuel Fiorini
Tony Huynh
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
Excluding a Ladder
|
2021
|
Tony Huynh
Gwenaël Joret
Piotr Micek
Michał T. Seweryn
Paul Wollan
|
|
+
PDF
Chat
|
Tight Bounds on the Clique Chromatic Number
|
2021
|
Gwenaël Joret
Piotr Micek
Bruce Reed
Michiel Smid
|
|
+
PDF
Chat
|
Unavoidable Minors for Graphs with Large $$\ell _p$$-Dimension
|
2021
|
Samuel Fiorini
Tony Huynh
Gwenaël Joret
Carole Muller
|
|
+
PDF
Chat
|
Packing and Covering Balls in Graphs Excluding a Minor
|
2021
|
Nicolás Bousquet
Wouter Cames van Batenburg
Louis Esperet
Gwenaël Joret
William Lochet
Carole Muller
François Pirot
|
|
+
PDF
Chat
|
Approximating Pathwidth for Graphs of Small Treewidth
|
2021
|
Carla Groenland
Gwenaël Joret
Wojciech Nadara
Bartosz Walczak
|
|
+
PDF
Chat
|
Notes on Graph Product Structure Theory
|
2021
|
Zdeněk Dvořák
Tony Huynh
Gwenaël Joret
Chun‐Hung Liu
David R. Wood
|
|
+
|
Integer programs with bounded subdeterminants and two nonzeros per row
|
2021
|
Samuel Fiorini
Gwenaël Joret
Stefan Weltge
Yelena Yuditsky
|
|
+
PDF
Chat
|
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth
|
2020
|
Tony Huynh
Gwenaël Joret
Piotr Micek
David R. Wood
|
|
+
|
Two lower bounds for $p$-centered colorings
|
2020
|
Loïc Dubois
Gwenaël Joret
Guillem Perarnau
Marcin Pilipczuk
François Pitois
|
|
+
PDF
Chat
|
Adjacency Labelling for Planar Graphs (and Beyond)
|
2020
|
Vida Dujmović
Louis Esperet
Cyril Gavoille
Gwenaël Joret
Piotr Micek
Pat Morin
|
|
+
PDF
Chat
|
Large independent sets in triangle-free cubic graphs: beyond planarity
|
2020
|
Wouter Cames van Batenburg
Gwenaël Joret
Jan Goedgebeur
|
|
+
PDF
Chat
|
Planar Graphs Have Bounded Queue-Number
|
2020
|
Vida Dujmović
Gwenaël Joret
Piotr Micek
Pat Morin
Torsten Ueckerdt
David R. Wood
|
|
+
|
Two lower bounds for $p$-centered colorings
|
2020
|
Loïc Dubois
Gwenaël Joret
Guillem Perarnau
Marcin Pilipczuk
François Pitois
|
|
+
|
Subgraph densities in a surface.
|
2020
|
Tony Huynh
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
Subgraph densities in a surface
|
2020
|
Tony Huynh
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
Revisiting a Theorem by Folkman on Graph Colouring
|
2020
|
Marthe Bonamy
Pierre Charbit
Oscar Defrain
Gwenaël Joret
Aurélie Lagoutte
Vincent Limouzy
Lucas Pastor
Jean‐Sébastien Sereni
|
|
+
PDF
Chat
|
Planar graphs have bounded nonrepetitive chromatic number
|
2020
|
Vida Dujmović
Louis Esperet
Gwenaël Joret
Bartosz Walczak
David R. Wood
|
|
+
|
Excluding a ladder
|
2020
|
Tony Huynh
Gwenaël Joret
Piotr Micek
Michał T. Seweryn
Paul Wollan
|
|
+
PDF
Chat
|
Minor-Closed Graph Classes with Bounded Layered Pathwidth
|
2020
|
Vida Dujmović
David Eppstein
Gwenaël Joret
Pat Morin
David R. Wood
|
|
+
PDF
Chat
|
Erdös--Pósa from Ball Packing
|
2020
|
Wouter Cames van Batenburg
Gwenaël Joret
Arthur Ulmer
|
|
+
PDF
Chat
|
Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture
|
2020
|
Gwenaël Joret
William Lochet
|
|
+
|
Approximating pathwidth for graphs of small treewidth
|
2020
|
Carla Groenland
Gwenaël Joret
Wojciech Nadara
Bartosz Walczak
|
|
+
|
Two lower bounds for $p$-centered colorings
|
2020
|
L. Dubois
Gwenaël Joret
Guillem Perarnau
Marcin Pilipczuk
François Pitois
|
|
+
|
Excluding a ladder
|
2020
|
Tony Huynh
Gwenaël Joret
Piotr Micek
Michał T. Seweryn
Paul Wollan
|
|
+
|
Sparse universal graphs for planarity
|
2020
|
Louis Esperet
Gwenaël Joret
Pat Morin
|
|
+
PDF
Chat
|
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
|
2019
|
Michele Conforti
Samuel Fiorini
Tony Huynh
Gwenaël Joret
Stefan Weltge
|
|
+
PDF
Chat
|
Planar Graphs have Bounded Queue-Number
|
2019
|
Vida Dujmović
Gwenaël Joret
Piotr Micek
Pat Morin
Torsten Ueckerdt
David R. Wood
|
|
+
PDF
Chat
|
A tight Erdős-Pósa function for planar minors
|
2019
|
Wouter Cames van Batenburg
Tony Huyn
Gwenaël Joret
Jean‐Florent Raymond
|
|
+
PDF
Chat
|
Nowhere Dense Graph Classes and Dimension
|
2019
|
Gwenaël Joret
Piotr Micek
Patrice Ossona de Mendez
Veit Wiechert
|
|
+
|
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
|
2019
|
Michele Conforti
Samuel Fiorin
Tony Huynh
Gwenaël Joret
Stefan Weltge
|
|
+
PDF
Chat
|
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
|
2019
|
Gerardo Berbeglia
Gwenaël Joret
|
|
+
PDF
Chat
|
Improved approximation algorithms for hitting 3-vertex paths
|
2019
|
Samuel Fiorini
Gwenaël Joret
Oliver Schaudt
|
|
+
|
Unavoidable minors for graphs with large $\ell_p$-dimension
|
2019
|
Samuel Fiorini
Tony Huynh
Gwenaël Joret
Carole Muller
|
|
+
|
A tight Erdos-Pósa function for planar minors
|
2019
|
Wouter Cames van Batenburg
Tony Huyn
Gwenaël Joret
Jean‐Florent Raymond
|
|
+
|
Information-theoretic lower bounds for quantum sorting
|
2019
|
Jean Cardinal
Gwenaël Joret
Jérémie Roland
|
|
+
|
Unavoidable minors for graphs with large 𝓁 p -dimension.
|
2019
|
Samuel Fiorini
Tony Huynh
Gwenaël Joret
Carole Muller
|
|
+
PDF
Chat
|
A tight Erdős-Pósa function for planar minors
|
2019
|
Wouter Cames van Batenburg
Tony Huynh
Gwenaël Joret
Jean‐Florent Raymond
|
|
+
|
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
|
2019
|
Michele Conforti
Samuel Fiorin
Tony Huynh
Gwenaël Joret
Stefan Weltge
|
|
+
|
Unavoidable minors for graphs with large $\ell_p$-dimension
|
2019
|
Samuel Fiorini
Tony Huynh
Gwenaël Joret
Carole Muller
|
|
+
|
Improved approximation algorithms for hitting 3-vertex paths
|
2018
|
Samuel Fiorini
Gwenaël Joret
Oliver Schaudt
|
|
+
|
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions
|
2018
|
Stefan Felsner
Gwenaël Joret
Piotr Micek
William T. Trotter
Veit Wiechert
|
|
+
PDF
Chat
|
$K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs
|
2018
|
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
A Tight Erdös--Pósa Function for Wheel Minors
|
2018
|
Pierre Aboulker
Samuel Fiorini
Tony Huynh
Gwenaël Joret
Jean‐Florent Raymond
Ignasi Sau
|
|
+
PDF
Chat
|
Orthogonal Tree Decompositions of Graphs
|
2018
|
Vida Dujmović
Gwenaël Joret
Pat Morin
Sergey Norin
David R. Wood
|
|
+
|
Improved approximation algorithms for hitting 3-vertex paths
|
2018
|
Samuel Fiorini
Gwenaël Joret
Oliver Schaudt
|
|
+
|
Nowhere Dense Graph Classes and Dimension
|
2017
|
Gwenaël Joret
Piotr Micek
Patrice Ossona de Mendez
Veit Wiechert
|
|
+
PDF
Chat
|
Sparsity and Dimension
|
2017
|
Gwenaël Joret
Piotr Micek
Veit Wiechert
|
|
+
PDF
Chat
|
Burling graphs, chromatic number, and orthogonal tree-decompositions
|
2017
|
Stefan Felsner
Gwenaël Joret
Piotr Micek
William T. Trotter
Veit Wiechert
|
|
+
PDF
Chat
|
Assortment Optimisation under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
|
2017
|
Gerardo Berbeglia
Gwenaël Joret
|
|
+
PDF
Chat
|
Assortment Optimisation under a General Discrete Choice Model
|
2017
|
Gerardo Berbeglia
Gwenaël Joret
|
|
+
|
Burling graphs, chromatic number, and orthogonal tree-decompositions
|
2017
|
Stefan Felsner
Gwenaël Joret
Piotr Micek
William T. Trotter
Veit Wiechert
|
|
+
PDF
Chat
|
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs
|
2017
|
Samuel Fiorini
Tony Huynh
Gwenaël Joret
Kanstantsin Pashkovich
|
|
+
PDF
Chat
|
The Excluded Minors for Isometric Realizability in the Plane
|
2017
|
Samuel Fiorini
Tony Huynh
Gwenaël Joret
Antonios Varvitsiotis
|
|
+
PDF
Chat
|
Planar Posets Have Dimension at Most Linear in Their Height
|
2017
|
Gwenaël Joret
Piotr Micek
Veit Wiechert
|
|
+
|
Nowhere Dense Graph Classes and Dimension
|
2017
|
Gwenaël Joret
Piotr Micek
Patrice Ossona de Mendez
Veit Wiechert
|
|
+
|
Pathwidth and Nonrepetitive List Coloring
|
2016
|
Adam Gągol
Gwenaël Joret
Jakub Kozik
Piotr Micek
|
|
+
PDF
Chat
|
Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments
|
2016
|
Gerardo Berbeglia
Gwenaël Joret
|
|
+
PDF
Chat
|
On the Dimension of Posets with Cover Graphs of Treewidth 2
|
2016
|
Gwenaël Joret
Piotr Micek
William T. Trotter
Ruidong Wang
Veit Wiechert
|
|
+
|
Sparsity and dimension
|
2016
|
Gwenaël Joret
Piotr Micek
Veit Wiechert
|
|
+
|
Pathwidth and nonrepetitive list coloring
|
2016
|
Adam Gągol
Gwenaël Joret
Jakub Kozik
Piotr Micek
|
|
+
PDF
Chat
|
Improved Approximation Algorithms for Hitting 3-Vertex Paths
|
2016
|
Samuel Fiorini
Gwenaël Joret
Oliver Schaudt
|
|
+
|
Sparsity and dimension
|
2015
|
Gwenaël Joret
Piotr Micek
Veit Wiechert
|
|
+
PDF
Chat
|
Reducing the rank of a matroid
|
2015
|
Gwenaël Joret
Adrian Vetta
|
|
+
PDF
Chat
|
Reducing the rank of a matroid
|
2015
|
Gwenaël Joret
Adrian Vetta
|
|
+
|
Reducing the rank of a matroid
|
2015
|
Gwenaël Joret
Adrian Vetta
|
|
+
|
Reducing the rank of a matroid
|
2015
|
Gwenaël Joret
Adrian Vetta
|
|
+
PDF
Chat
|
Reducing the rank of a matroid
|
2015
|
Gwenaël Joret
Adrian Vetta
|
|
+
PDF
Chat
|
Reducing the rank of a matroid
|
2015
|
Gwenaël Joret
Adrian Vetta
|
|
+
PDF
Chat
|
Reducing the rank of a matroid
|
2015
|
Gwenaël Joret
Adrian Vetta
|
|
+
PDF
Chat
|
Nonrepetitive colouring via entropy compression
|
2015
|
Vida Dujmović
Gwenaël Joret
Jakub Kozik
David R. Wood
|
|
+
PDF
Chat
|
Tree-width and dimension
|
2015
|
Gwenaël Joret
Piotr Micek
Kevin G. Milans
William T. Trotter
Bartosz Walczak
Ruidong Wang
|
|
+
PDF
Chat
|
Empty Pentagons in Point Sets with Collinearities
|
2015
|
János Barát
Vida Dujmović
Gwenaël Joret
Michael S. Payne
Ludmila Scharf
Daria Schymura
Pável Valtr
David R. Wood
|
|
+
PDF
Chat
|
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
|
2015
|
Gerardo Berbeglia
Gwenaël Joret
|
|
+
|
On the dimension of posets with cover graphs of treewidth $2$
|
2014
|
Gwenaël Joret
Piotr Micek
William T. Trotter
Ruidong Wang
Veit Wiechert
|
|
+
PDF
Chat
|
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
|
2014
|
Louis Esperet
Gwenaël Joret
|
|
+
PDF
Chat
|
Hitting All Maximal Independent Sets of a Bipartite Graph
|
2014
|
Jean Cardinal
Gwenaël Joret
|
|
+
PDF
Chat
|
Hitting and Harvesting Pumpkins
|
2014
|
Gwenaël Joret
Christophe Paul
Ignasi Sau
Saket Saurabh
Stéphan Thomassé
|
|
+
|
On the dimension of posets with cover graphs of treewidth $2$
|
2014
|
Gwenaël Joret
Piotr Micek
William T. Trotter
Ruidong Wang
Veit Wiechert
|
|
+
PDF
Chat
|
Sorting under partial information (without the ellipsoid algorithm)
|
2013
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
Raphaël M. Jungers
J. Ian Munro
|
|
+
PDF
Chat
|
Excluded Forest Minors and the Erdős–Pósa Property
|
2013
|
Samuel Fiorini
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours
|
2013
|
Vida Dujmović
Gwenaël Joret
Fabrizio Frati
David R. Wood
|
|
+
PDF
Chat
|
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
|
2013
|
Vida Dujmović
Daniel J. Harvey
Gwenaël Joret
Bruce Reed
David R. Wood
|
|
+
|
Reducing the rank of a matroid
|
2012
|
Gwenaël Joret
Adrian Vetta
|
|
+
PDF
Chat
|
A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces
|
2012
|
Nancy E. Clarke
Samuel Fiorini
Gwenaël Joret
Dirk Oliver Theis
|
|
+
|
Complete graph minors and the graph minor structure theorem
|
2012
|
Gwenaël Joret
David R. Wood
|
|
+
|
Excluded Forest Minors and the Erdős-Pósa Property
|
2012
|
Samuel Fiorini
Gwenaël Joret
David R. Wood
|
|
+
|
Small minors in dense graphs
|
2012
|
Samuel Fiorini
Gwenaël Joret
Dirk Oliver Theis
David R. Wood
|
|
+
|
Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours
|
2012
|
Vida Dujmović
Fabrizio Frati
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
Boxicity of Graphs on Surfaces
|
2012
|
Louis Esperet
Gwenaël Joret
|
|
+
|
Nordhaus–Gaddum for treewidth
|
2012
|
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains
|
2012
|
Vida Dujmović
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
Disproof of the List Hadwiger Conjecture
|
2011
|
János Barát
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
Minimum Entropy Combinatorial Optimization Problems
|
2011
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
|
|
+
PDF
Chat
|
Approximating the balanced minimum evolution problem
|
2011
|
Samuel Fiorini
Gwenaël Joret
|
|
+
|
Disproof of the List Hadwiger Conjecture
|
2011
|
János Barát
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
|
2011
|
Jean Cardinal
Erik D. Demaine
Samuel Fiorini
Gwenaël Joret
Ilan Newman
Oren Weimann
|
|
+
PDF
Chat
|
On the maximum number of cliques in a graph embedded in a surface
|
2011
|
Vida Dujmović
Gašper Fijavž
Gwenaël Joret
T. Sulanke
David R. Wood
|
|
+
PDF
Chat
|
Trees with Given Stability Number and Minimum Number of Stable Sets
|
2011
|
Véronique Bruyère
Gwenaël Joret
Hadrien Mélot
|
|
+
PDF
Chat
|
Hitting and Harvesting Pumpkins
|
2011
|
Gwenaël Joret
Christophe Paul
Ignasi Sau
Saket Saurabh
Stéphan Thomassé
|
|
+
PDF
Chat
|
First-Fit is Linear on Posets Excluding Two Long Incomparable Chains
|
2010
|
Gwenaël Joret
Kevin G. Milans
|
|
+
PDF
Chat
|
Stackelberg network pricing is hard to approximate
|
2010
|
Gwenaël Joret
|
|
+
PDF
Chat
|
Sorting under partial information (without the ellipsoid algorithm)
|
2010
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
Raphaël M. Jungers
J. Ian Munro
|
|
+
PDF
Chat
|
Irreducible triangulations are small
|
2010
|
Gwenaël Joret
David R. Wood
|
|
+
PDF
Chat
|
Hitting Diamonds and Growing Cacti
|
2010
|
Samuel Fiorini
Gwenaël Joret
Ugo Pietropaoli
|
|
+
PDF
Chat
|
An Efficient Algorithm for Partial Order Production
|
2010
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
Raphaël M. Jungers
J. Ian Munro
|
|
+
|
Sorting under Partial Information (without the Ellipsoid Algorithm)
|
2009
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
Raphaël M. Jungers
J. Ian Munro
|
|
+
PDF
Chat
|
An efficient algorithm for partial order production
|
2009
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
Raphaël M. Jungers
J. Ian Munro
|
|
+
PDF
Chat
|
The Stackelberg Minimum Spanning Tree Game
|
2009
|
Jean Cardinal
Erik D. Demaine
Samuel Fiorini
Gwenaël Joret
Stefan Langerman
Ilan Newman
Oren Weimann
|
|
+
PDF
Chat
|
Minimum Entropy Combinatorial Optimization Problems
|
2009
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
|
|
+
|
Sorting under Partial Information (without the Ellipsoid Algorithm)
|
2009
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
Raphaël M. Jungers
J. Ian Munro
|
|
+
PDF
Chat
|
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
|
2008
|
Jean‐Paul Doignon
Samuel Fiorini
Gwenaël Joret
|
|
+
PDF
Chat
|
On a theorem of Sewell and Trotter
|
2008
|
Samuel Fiorini
Gwenaël Joret
|
|
+
PDF
Chat
|
Minimum entropy orientations
|
2008
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
|
|
+
|
The Cops and Robber game on graphs with forbidden (induced) subgraphs
|
2008
|
Gwenaël Joret
Marcin Kamiński
Dirk Oliver Theis
|
|
+
|
Minimum entropy coloring
|
2008
|
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
|
|
+
|
Turán's theorem and <i>k</i>‐connected graphs
|
2008
|
Nicolas Bougard
Gwenaël Joret
|
|
+
|
The Cops and Robber game on graphs with forbidden (induced) subgraphs
|
2008
|
Gwenaël Joret
Marcin Kamiński
Dirk Oliver Theis
|
|
+
|
Entropy and stability in graphs
|
2007
|
Gwenaël Joret
Jean Cardinal
Jean‐Paul Doignon
|
|
+
|
Well-balanced orientations of mixed graphs
|
2007
|
Attila Bernáth
Gwenaël Joret
|
|
+
|
Erratum to “Facets of the linear ordering polytope: A unification for the fence family through weighted graphs”
|
2007
|
Jean‐Paul Doignon
Samuel Fiorini
Gwenaël Joret
|
|
+
|
On a weighted generalization of α-critical graphs
|
2005
|
Jean‐Paul Doignon
Samuel Fiorini
Gwenaël Joret
|