Nicolas Bousquet

From MaRDI portal
Person:512580

Available identifiers

zbMath Open bousquet.nicolasMaRDI QIDQ512580

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61285812024-04-15Paper
Local Certification of Graph Decompositions and Applications to Minor-Free Classes2024-04-15Paper
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs2024-03-26Paper
On the coalitional decomposition of parameters of interest2024-03-01Paper
https://portal.mardi4nfdi.de/entity/Q61924762024-02-12Paper
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters2024-02-12Paper
PACE Solver Description: µSolver - Heuristic Track *2024-02-12Paper
Digraph redicolouring2024-02-05Paper
Token sliding on graphs of girth five2024-01-25Paper
Square Coloring Planar Graphs with Automatic Discharging2024-01-23Paper
https://portal.mardi4nfdi.de/entity/Q61793442023-12-16Paper
https://portal.mardi4nfdi.de/entity/Q60834302023-12-08Paper
Linear transformations between dominating sets in the TAR-model2023-11-14Paper
https://portal.mardi4nfdi.de/entity/Q60872162023-11-14Paper
Feedback vertex set reconfiguration in planar graphs2023-10-26Paper
The smallest 5-chromatic tournament2023-10-23Paper
Reconfiguration of spanning trees with degree constraints or diameter constraints2023-09-27Paper
Extremal independent set reconfiguration2023-08-18Paper
Galactic token sliding2023-06-12Paper
Token sliding on graphs of girth five2023-05-05Paper
Recoloring Planar Graphs of Girth at Least Five2023-03-30Paper
Improved square coloring of planar graphs2023-02-21Paper
Reconfiguration of Spanning Trees with Many or Few Leaves2023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58756132023-02-03Paper
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs2022-12-08Paper
BAYESIAN INFERENCE FOR INVERSE PROBLEMS OCCURRING IN UNCERTAINTY ANALYSIS2022-11-24Paper
Locating-dominating sets: from graphs to oriented graphs2022-11-02Paper
(Sub)linear kernels for edge modification problems toward structured graph classes2022-10-27Paper
The Perfect Matching Reconfiguration Problem2022-07-21Paper
TS-reconfiguration of dominating sets in circle and circular-arc graphs2022-05-20Paper
Chordal directed graphs are not \(\chi\)-bounded2022-05-12Paper
https://portal.mardi4nfdi.de/entity/Q50757612022-05-11Paper
A polynomial version of Cereceda's conjecture2022-04-27Paper
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems2022-04-22Paper
Distributed algorithms for fractional coloring2022-03-22Paper
Short and local transformations between ($\Delta+1$)-colorings2022-03-16Paper
Improved square coloring of planar graphs2021-12-23Paper
Recolouring planar graphs of girth at least five2021-12-01Paper
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs2021-11-17Paper
Metric dimension on sparse graphs and its applications to zero forcing sets2021-11-15Paper
Recoloring graphs of treewidth 22021-09-30Paper
On girth and the parameterized complexity of token sliding and Token Jumping2021-09-02Paper
Parameterized Complexity of Independent Set in H-Free Graphs.2021-08-04Paper
Packing and covering balls in graphs excluding a minor2021-08-03Paper
Frozen (Δ + 1)-colourings of bounded degree graphs2021-06-15Paper
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy2021-04-08Paper
TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs2021-02-21Paper
Detecting and modeling critical dependence structures between random inputs of computer models2021-01-14Paper
Recoloring graphs of treewidth 22020-12-21Paper
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces2020-12-04Paper
Distributed algorithms for fractional coloring2020-12-03Paper
Parameterized complexity of independent set in H-free graphs2020-08-12Paper
Approximating Shortest Connected Graph Transformation for Trees2020-07-20Paper
Surfaces have (asymptotic) dimension 22020-07-07Paper
A note on the simultaneous edge coloring2020-03-20Paper
Exact Distance Colouring in Trees2020-03-11Paper
Shortest reconfiguration of matchings2020-02-24Paper
Distributed coloring in sparse graphs with fewer colors2019-11-15Paper
Distributed Coloring in Sparse Graphs with Fewer Colors2019-09-19Paper
A proof of the Erdös-Sands-Sauer-Woodrow conjecture2019-07-17Paper
Linear transformations between colorings in chordal graphs2019-07-03Paper
On a conjecture of Mohar concerning Kempe equivalence of regular graphs2019-02-08Paper
Reconfiguration of graphs with connectivity constraints2019-01-15Paper
χ‐bounded families of oriented graphs2019-01-03Paper
Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy2018-11-29Paper
Redefining the maximum sustainable yield for the Schaefer population model including multiplicative environmental noise2018-10-22Paper
Frozen colourings of bounded degree graphs2018-10-11Paper
Reconfiguration of graphs with connectivity constraints2018-09-14Paper
On the Economic Efficiency of the Combinatorial Clock Auction2018-07-16Paper
Covariance constraints for stochastic inverse problems of computer models2018-06-09Paper
Approximation of Limit State Surfaces in Monotonic Monte Carlo Settings, with Applications to Classification2018-04-19Paper
Decomposition techniques applied to the clique-stable set separation problem2018-04-05Paper
Multicut Is FPT2018-02-22Paper
Token sliding on chordal graphs2018-01-04Paper
Computing maximum cliques in \(B_2\)-EPG graphs2018-01-04Paper
Recoloring graphs via tree decompositions2017-12-21Paper
Token jumping in minor-closed classes2017-11-22Paper
A Vizing-like theorem for union vertex-distinguishing edge coloring2017-10-17Paper
Colorful paths for 3-chromatic graphs2017-02-27Paper
The Erdös--Hajnal Conjecture for Long Holes and Antiholes2016-06-23Paper
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction2016-01-08Paper
Fast recoloring of sparse graphs2015-12-11Paper
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension2015-10-30Paper
VC-dimension and Erdős-Pósa property2015-08-05Paper
The Erdős-Hajnal conjecture for paths and antipaths2015-06-10Paper
Coalition Games on Interaction Graphs: A Horticultural Perspective2015-02-26Paper
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs2015-01-13Paper
A Near-Optimal Mechanism for Impartial Selection2015-01-07Paper
Excluding cycles with a fixed number of chords2014-11-28Paper
Clique versus independent set2014-08-28Paper
https://portal.mardi4nfdi.de/entity/Q54199832014-06-11Paper
Multicut is FPT2014-06-05Paper
Reconfiguring Independent Sets in Cographs2014-06-05Paper
Brooks' theorem on powers of graphs2014-05-06Paper
Parameterized domination in circle graphs2014-03-25Paper
Recoloring bounded treewidth graphs2013-02-14Paper
Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints2013-01-16Paper
Estimating discrete Markov models from various incomplete data schemes2012-12-30Paper
Parameterized Domination in Circle Graphs2012-11-06Paper
Eliciting vague but proper maximal entropy priors in Bayesian experiments2012-09-23Paper
Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs2012-09-04Paper
A POLYNOMIAL KERNEL FOR MULTICUT IN TREES2012-04-24Paper
Reference priors of nuisance parameters in Bayesian sequential population analysis2010-07-30Paper
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata2010-05-26Paper
Diagnostics of prior-data agreement in applied Bayesian analysis2009-10-21Paper
An alternative competing risk model to the Weibull distribution for modelling aging in lifetime data analysis2007-04-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Nicolas Bousquet