Christophe Picouleau

Discret. Appl. Math., 2024

2022

Complexity and algorithms for constant diameter augmentation problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

2021

New sufficient conditions on the degree sequences of uniform hypergraphs.

[BibT_eX]

[DOI]

Simone Rinaldi

Theor. Comput. Sci., 2021

On the vertices belonging to all, some, none minimum dominating set.

[BibT_eX]

[DOI]

Valentin Bouquet

François Delbot

Discret. Appl. Math., 2021

2020

Minimal graphs for 2-factor extension.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

On Minimum Dominating Sets in cubic and (claw, H)-free graphs.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Critical vertices and edges in H-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2019

2018

Contraction and deletion blockers for perfect graphs and <i>H</i>-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Minimal graphs for matching extensions.

[BibT_eX]

[DOI]

Marie Milliet de Faverges

Discret. Appl. Math., 2018

Estimating Long-Term Delay Risk with Generalized Linear Models.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Intelligent Transportation Systems, 2018

2017

Reducing the Chromatic Number by Vertex or Edge Deletions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Adaptive Network Flow with k-Arc Destruction.

[BibT_eX]

[DOI]

CoRR, 2017

Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2017

2016

Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Blockers for the Stability Number and the Chromatic Number.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Foreword.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Contraction Blockers for Graphs with Forbidden Induced Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2013

GO VII Meeting, Ovronnaz (CH), June 13-17, 2010.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

On the Degree Sequences of Uniform Hypergraphs.

[BibT_eX]

[DOI]

Simone Rinaldi

Proceedings of the Discrete Geometry for Computer Imagery, 2013

How to Decompose a Binary Matrix into Three hv-convex Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2013

2012

On the NP-completeness of the perfect matching free subgraph problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

d-Transversals of stable sets and vertex covers in weighted bipartite graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Minimum decomposition into convex binary matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Minimum d-blockers and d-transversals in graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.

[BibT_eX]

[DOI]

Rico Zenklusen

Discret. Math., 2010

A note on a conjecture on maximum matching in almost regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Locally bounded <i>k</i>-colorings of trees.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2009

Degree-constrained edge partitioning in graphs arising from discrete tomography.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

The Four-in-a-Tree Problem in Triangle-Free Graphs.

[BibT_eX]

[DOI]

Nicolas Derhy

Nicolas Trotignon

Graphs Comb., 2009

Blockers and transversals.

[BibT_eX]

[DOI]

Discret. Math., 2009

Graph coloring with cardinality constraints on the neighborhoods.

[BibT_eX]

[DOI]

Discret. Optim., 2009

Finding induced trees.

[BibT_eX]

[DOI]

Nicolas Derhy

Discret. Appl. Math., 2009

2008

Reconstruction of binary matrices under fixed size neighborhood constraints.

[BibT_eX]

[DOI]

Stefano Brocchi

Theor. Comput. Sci., 2008

On a graph coloring problem arising from discrete tomography.

[BibT_eX]

[DOI]

Networks, 2008

Complexity results for the horizontal bar packing problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Addendum to "Bicolored Matchings in Some Classes of Graphs".

[BibT_eX]

[DOI]

Graphs Comb., 2008

On the use of graphs in discrete tomography.

[BibT_eX]

[DOI]

4OR, 2008

Approximating hv-Convex Binary Matrices and Images from Discrete Projections.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2008

Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem.

[BibT_eX]

[DOI]

Simone Rinaldi

Proceedings of the Discrete Geometry for Computer Imagery, 2008

2007

The shortest multipaths problem in a capacitated dense channel.

[BibT_eX]

[DOI]

Maria Zrikem

Eur. J. Oper. Res., 2007

2006

Using graphs for some discrete tomography problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

An acyclic days-off scheduling problem.

[BibT_eX]

[DOI]

4OR, 2006

2005

Reconstruction of convex polyominoes from orthogonal projections of their contours.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Reconstructing a binary matrix under timetabling constraints.

[BibT_eX]

[DOI]

Sara Brunetti

Electron. Notes Discret. Math., 2005

Bicolored matchings in some classes of graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Reconstruction of binary matrices under adjacency constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

A solvable case of image reconstruction in discrete tomography.

[BibT_eX]

[DOI]

David Schindl

Discret. Appl. Math., 2005

Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2001

Reconstruction of domino tiling from its two orthogonal projections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

1996

Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

1995

New Complexity Results on Scheduling with Small Communication Delays.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

Complexity of the Hamiltonian Cycle in Regular Graph Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

1992

Etude de problemes d'optimisation dans les systemes distribues.

[BibT_eX]