#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2003

2017

- This year (0)
- Last 5 years (6)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Organism

Learn More

- Frédéric Herman, Peter Copeland, +9 authors Pierre Henry
- 2010

[1] Two end‐member kinematic models of crustal shortening across the Himalaya are currently debated: one assumes localized thrusting along a single major thrust fault, the Main Himalayan Thrust (MHT)… (More)

- Arnaud Pêcher, Annegret Wagler
- Math. Program.
- 2006

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]. Providing a… (More)

- Gerard J. Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud
- Discussiones Mathematicae Graph Theory
- 2014

Let ∆ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree ∆ and girth at least 10∆ + 46 is strong (2∆ − 1)-edge-colorable, that is best possible (in terms of number… (More)

- Cédric Joncour, Arnaud Pêcher
- Electronic Notes in Discrete Mathematics
- 2010

The multi-dimensional orthogonal packing problem (OPP) is a well studied optimization problem [3,9]. Given a set of items with rectangular shapes, the problem is to decide whether there is a… (More)

- Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler
- Math. Program.
- 2009

Perfect graphs constitute a well-studied graph class with a rich structure, reflected by many characterizations with respect to different concepts. Perfect graphs are, for instance, precisely those… (More)

- Arnaud Pêcher, Annegret Wagler
- Eur. J. Comb.
- 2006

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [9,14] and claw-free graphs [8,9]. Providing a… (More)

- Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler
- Discrete Mathematics
- 2009

Zhu [15] introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important χ-bound class of graphs with the smallest non-trivial χ-binding function χ(G) ≤… (More)

- Arnaud Pêcher, Annegret Wagler
- Electronic Notes in Discrete Mathematics
- 2006

- Cédric Joncour, Arnaud Pêcher, Petru Valicov
- Electronic Notes in Discrete Mathematics
- 2010

Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a ”big” rectangular container… (More)

- Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu
- Discrete Mathematics
- 2010

Let k be a nonnegative integer, and let mk = 4(k+1)(k+3) k+6k+6 . We prove that every simple graph with maximum average degree less than mk decomposes into a forest and a subgraph with maximum degree… (More)