The following pages link to Christophe Picouleau (Q411243):
Displaying 50 items.
- (Q197745) (redirect page) (← links)
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
- Minimum decomposition into convex binary matrices (Q423930) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- A note on a conjecture on maximum matching in almost regular graphs (Q607026) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- The four-in-a-tree problem in triangle-free graphs (Q844235) (← links)
- The shortest multipaths problem in a capacitated dense channel (Q859708) (← links)
- An acyclic days-off scheduling problem (Q862817) (← links)
- Addendum to ``Bicolored matchings in some classes of graphs'' (Q937244) (← links)
- Reconstruction of binary matrices under fixed size neighborhood constraints (Q952456) (← links)
- Finding induced trees (Q967418) (← links)
- Complexity results for the horizontal bar packing problem (Q975490) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Complexity of the hamiltonian cycle in regular graph problem (Q1331931) (← links)
- Worst-case analysis of fast heuristics for packing squares into a square (Q1365944) (← links)
- Minimal graphs for matching extensions (Q1686047) (← links)
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- New complexity results on scheduling with small communication delays (Q1894375) (← links)
- Minimal graphs for 2-factor extension (Q2185731) (← links)
- On the vertices belonging to all, some, none minimum dominating set (Q2208334) (← links)
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794) (← links)
- Reducing the chromatic number by vertex or edge deletions (Q2413179) (← links)
- A solvable case of image reconstruction in discrete tomography (Q2486067) (← links)
- Reconstruction of convex polyominoes from orthogonal projections of their contours (Q2581356) (← links)
- Using graphs for some discrete tomography problems (Q2581557) (← links)
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
- Minimum \(d\)-transversals of maximum-weight stable sets in trees (Q2857332) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions (Q2988844) (← links)
- (Q3059309) (← links)
- (Q3109939) (← links)
- Reconstructing a binary matrix under timetabling constraints (Q3439178) (← links)
- Reconstruction of binary matrices under adjacency constraints (Q3439193) (← links)
- On a graph coloring problem arising from discrete tomography (Q3515882) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- Degree-constrained edge partitioning in graphs arising from discrete tomography (Q3627968) (← links)
- On the Degree Sequences of Uniform Hypergraphs (Q4924480) (← links)
- How to Decompose a Binary Matrix into Three hv-convex Polyominoes (Q4924481) (← links)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) (← links)
- Theoretical Computer Science (Q5395070) (← links)
- (Q5434302) (← links)
- Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem (Q5458907) (← links)
- Approximating hv-Convex Binary Matrices and Images from Discrete Projections (Q5458909) (← links)
- Bicolored matchings in some classes of graphs (Q5899324) (← links)
- Bicolored matchings in some classes of graphs (Q5899373) (← links)
