Nicolas Bousquet

According to our database1, Nicolas Bousquet authored at least 56 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A note on the simultaneous edge coloring.
Discret. Math., 2020

On girth and the parameterized complexity of token sliding and token jumping.
CoRR, 2020

Linear transformations between dominating sets in the TAR-model.
CoRR, 2020

Packing and covering balls in graphs excluding a minor.
CoRR, 2020

Parameterized Complexity of Independent Set in H-Free Graphs.
Algorithmica, 2020

Approximating Shortest Connected Graph Transformation for Trees.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Reconfiguration of Spanning Trees with Many or Few Leaves.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
A proof of the Erdős-Sands-Sauer-Woodrow conjecture.
J. Comb. Theory, Ser. B, 2019

On a conjecture of Mohar concerning Kempe equivalence of regular graphs.
J. Comb. Theory, Ser. B, 2019

Exact Distance Colouring in Trees.
Comb. Probab. Comput., 2019

A polynomial version of Cereceda's conjecture.
CoRR, 2019

Distributed Coloring in Sparse Graphs with Fewer Colors.
Electron. J. Comb., 2019

Shortest Reconfiguration of Matchings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

The Perfect Matching Reconfiguration Problem.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

When Maximum Stable Set Can Be Solved in FPT Time.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Linear Transformations Between Colorings in Chordal Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Multicut Is FPT.
SIAM J. Comput., 2018

Approximation of Limit State Surfaces in Monotonic Monte Carlo Settings, with Applications to Classification.
SIAM/ASA J. Uncertain. Quantification, 2018

χ-bounded families of oriented graphs.
J. Graph Theory, 2018

Frozen colourings of bounded degree graphs.
Electron. Notes Discret. Math., 2018

Recoloring graphs via tree decompositions.
Eur. J. Comb., 2018

Decomposition techniques applied to the Clique-Stable set separation problem.
Discret. Math., 2018

Reconfiguration of Graphs with Connectivity Constraints.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

EPTAS for Max Clique on Disks and Unit Balls.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Functional Weibull-based models of steel fracture toughness for structural risk analysis: estimation and selection.
Reliab. Eng. Syst. Saf., 2017

Colorful paths for 3-chromatic graphs.
Discret. Math., 2017

A Vizing-like theorem for union vertex-distinguishing edge coloring.
Discret. Appl. Math., 2017

An innovative solution for breast cancer textual big data analysis.
CoRR, 2017

Computing Maximum Cliques in B_2 -EPG Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Token Sliding on Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Token Jumping in Minor-Closed Classes.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
The Erdös-Hajnal Conjecture for Long Holes and Antiholes.
SIAM J. Discret. Math., 2016

Fast recoloring of sparse graphs.
Eur. J. Comb., 2016

On the Economic Efficiency of the Combinatorial Clock Auction.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension.
SIAM J. Discret. Math., 2015

On the Practical Interest of Discrete Inverse Pólya and Weibull-1 Models in Industrial Reliability Studies.
Qual. Reliab. Eng. Int., 2015

The Erdős-Hajnal conjecture for paths and antipaths.
J. Comb. Theory, Ser. B, 2015

VC-dimension and Erdős-Pósa property.
Discret. Math., 2015

Excluding cycles with a fixed number of chords.
Discret. Appl. Math., 2015

Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Coalition Games on Interaction Graphs: A Horticultural Perspective.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
Parameterized Domination in Circle Graphs.
Theory Comput. Syst., 2014

Clique versus independent set.
Eur. J. Comb., 2014

Brooks' theorem on powers of graphs.
Discret. Math., 2014

The Erdős-Hajnal Conjecture for Long Holes and Anti-holes.
CoRR, 2014

Reconfiguring Independent Sets in Cographs.
CoRR, 2014

A Near-Optimal Mechanism for Impartial Selection.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

2013
Hitting sets : VC-dimension and Multicut. (Hitting sets : VC-dimension et Multicut).
PhD thesis, 2013

Recoloring bounded treewidth graphs.
Electron. Notes Discret. Math., 2013

Graph coloring, communication complexity and the stubborn problem (Invited talk).
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012
Estimating discrete Markov models from various incomplete data schemes.
Comput. Stat. Data Anal., 2012

Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs.
Comb. Probab. Comput., 2012

Security of Mobile Devices, Applications and Transactions.
Proceedings of the ISSE 2012, 2012

2010
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
A Polynomial Kernel for Multicut in Trees.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009


  Loading...