The following pages link to Nicolas Bousquet (Q512580):
Displaying 50 items.
- (Q402462) (redirect page) (← links)
- Clique versus independent set (Q402465) (← links)
- Eliciting vague but proper maximal entropy priors in Bayesian experiments (Q451441) (← links)
- Excluding cycles with a fixed number of chords (Q476296) (← links)
- Colorful paths for 3-chromatic graphs (Q512581) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Detecting and modeling critical dependence structures between random inputs of computer models (Q828054) (← links)
- An alternative competing risk model to the Weibull distribution for modelling aging in lifetime data analysis (Q878295) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- Token jumping in minor-closed classes (Q1679965) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Token sliding on chordal graphs (Q1687909) (← links)
- Computing maximum cliques in \(B_2\)-EPG graphs (Q1687910) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Reconfiguration of graphs with connectivity constraints (Q1757779) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Redefining the maximum sustainable yield for the Schaefer population model including multiplicative environmental noise (Q1797403) (← links)
- Estimating discrete Markov models from various incomplete data schemes (Q1927036) (← links)
- Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints (Q1931811) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Distributed algorithms for fractional coloring (Q2117704) (← links)
- A polynomial version of Cereceda's conjecture (Q2131856) (← links)
- Chordal directed graphs are not \(\chi\)-bounded (Q2138574) (← links)
- TS-reconfiguration of dominating sets in circle and circular-arc graphs (Q2140491) (← links)
- Recoloring graphs of treewidth 2 (Q2231701) (← links)
- Shortest reconfiguration of matchings (Q2301540) (← links)
- A note on the simultaneous edge coloring (Q2305899) (← links)
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture (Q2312612) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- The Erdős-Hajnal conjecture for paths and antipaths (Q2347853) (← links)
- A Vizing-like theorem for union vertex-distinguishing edge coloring (Q2410224) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Brooks' theorem on powers of graphs (Q2449134) (← links)
- VC-dimension and Erdős-Pósa property (Q2515568) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Improved square coloring of planar graphs (Q2685324) (← links)
- The Erdös--Hajnal Conjecture for Long Holes and Antiholes (Q2813338) (← links)
- Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs (Q2908125) (← links)
- A Near-Optimal Mechanism for Impartial Selection (Q2936981) (← links)
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098) (← links)
- Diagnostics of prior-data agreement in applied Bayesian analysis (Q3183825) (← links)
- Approximating Shortest Connected Graph Transformation for Trees (Q3297756) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction (Q3460790) (← links)
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (Q3564854) (← links)
