default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud Pêcher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j34]Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot:
On the density of sets of the Euclidean plane avoiding distance 1. Discret. Math. Theor. Comput. Sci. 23(1) (2021)- [j33]Arnaud Pêcher, Annegret Katrin Wagler:
On circular-perfect graphs: A survey. Eur. J. Comb. 91: 103224 (2021)
2010 – 2019
- 2019
- [j32]Christine Bachoc
, Thomas Bellitto, Philippe Moustrou, Arnaud Pêcher:
On the Density of Sets Avoiding Parallelohedron Distance 1. Discret. Comput. Geom. 62(3): 497-524 (2019) - 2018
- [i1]Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot:
On the density of sets of the Euclidean plane avoiding distance 1. CoRR abs/1810.00960 (2018) - 2014
- [j31]Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud:
Strong chromatic index of planar graphs with large girth. Discuss. Math. Graph Theory 34(4): 723-733 (2014) - [j30]Arnaud Pêcher, Annegret Wagler:
Computing the clique number of aa-perfect graphs in polynomial time. Eur. J. Comb. 35: 449-458 (2014) - 2013
- [j29]Christine Bachoc, Arnaud Pêcher, Alain Thiéry:
On the theta number of powers of cycle graphs. Comb. 33(3): 297-317 (2013) - [j28]Arnaud Pêcher, Annegret Katrin Wagler:
Computing clique and chromatic number of circular-perfect graphs in polynomial time. Math. Program. 141(1-2): 121-133 (2013) - 2012
- [j27]Arnaud Pêcher, Annegret Katrin Wagler:
Polynomial time computability of some graph parameters for superclasses of perfect graphs. Int. J. Math. Oper. Res. 4(3): 263-275 (2012) - [j26]Cédric Joncour, Arnaud Pêcher, Petru Valicov:
MPQ-trees for the Orthogonal Packing Problem. J. Math. Model. Algorithms 11(1): 3-22 (2012) - [j25]Cédric Joncour, Arnaud Pêcher:
Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems. J. Math. Model. Algorithms 11(1): 23-44 (2012) - 2011
- [j24]Arnaud Pêcher, Annegret Katrin Wagler:
Computing the clique number of a-perfect graphs in polynomial time. Electron. Notes Discret. Math. 38: 705-710 (2011) - 2010
- [j23]Arnaud Pêcher, Annegret Katrin Wagler:
On facets of stable set polytopes of claw-free graphs with stability number 3. Discret. Math. 310(3): 493-498 (2010) - [j22]Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu:
Decomposition of sparse graphs, with application to game coloring number. Discret. Math. 310(10-11): 1520-1523 (2010) - [j21]Arnaud Pêcher, Annegret Katrin Wagler:
Clique and chromatic number of circular-perfect graphs. Electron. Notes Discret. Math. 36: 199-206 (2010) - [j20]Cédric Joncour, Arnaud Pêcher:
Consecutive ones matrices for multi-dimensional orthogonal packing problems. Electron. Notes Discret. Math. 36: 327-334 (2010) - [j19]Cédric Joncour, Arnaud Pêcher, Petru Valicov:
MPQ-trees for orthogonal packing problem. Electron. Notes Discret. Math. 36: 423-429 (2010) - [j18]Arnaud Pêcher, Xuding Zhu:
Claw-free circular-perfect graphs. J. Graph Theory 65(2): 163-172 (2010)
2000 – 2009
- 2009
- [j17]Sylvain Coulonges, Arnaud Pêcher, Annegret Katrin Wagler:
Triangle-free strongly circular-perfect graphs. Discret. Math. 309(11): 3632-3643 (2009) - [j16]Arnaud Pêcher, Annegret Katrin Wagler:
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs. Electron. Notes Discret. Math. 35: 53-58 (2009) - [j15]Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler:
Characterizing and bounding the imperfection ratio for some classes of graphs. Math. Program. 118(1): 37-46 (2009) - 2008
- [b1]Arnaud Pêcher:
Des multiples facettes des graphes circulants. University of Bordeaux, France, 2008 - [j14]Arnaud Pêcher, Annegret Wagler:
On classes of minimal circular-imperfect graphs. Discret. Appl. Math. 156(7): 998-1010 (2008) - 2007
- [j13]Arnaud Pêcher, Pierre Pesneau, Annegret Wagler:
On facets of stable set polytopes of claw-free graphs with stability number three. Electron. Notes Discret. Math. 28: 185-190 (2007) - [j12]Arnaud Pêcher, Xuding Zhu:
Claw-free circular-perfect graphs. Electron. Notes Discret. Math. 29: 451-455 (2007) - [j11]Arnaud Pêcher, Annegret Wagler:
A note on the Chvátal-rank of clique family inequalities. RAIRO Oper. Res. 41(3): 289-294 (2007) - 2006
- [j10]Arnaud Pêcher, Annegret Wagler:
On non-rank facets of stable set polytopes of webs with clique number four. Discret. Appl. Math. 154(9): 1408-1415 (2006) - [j9]Arnaud Pêcher, Annegret Wagler:
A construction for non-rank facets of stable set polytopes of webs. Eur. J. Comb. 27(7): 1172-1185 (2006) - [j8]Arnaud Pêcher, Annegret Wagler:
Generalized clique family inequalities for claw-free graphs. Electron. Notes Discret. Math. 25: 117-121 (2006) - [j7]Arnaud Pêcher, Xuding Zhu:
On the circular chromatic number of circular partitionable graphs. J. Graph Theory 52(4): 294-306 (2006) - [j6]Arnaud Pêcher, Annegret Wagler:
Almost all webs are not rank-perfect. Math. Program. 105(2-3): 311-328 (2006) - 2005
- [j5]Arnaud Pêcher, Annegret Wagler, Xuding Zhu:
Three classes of minimal circular-imperfect graphs. Electron. Notes Discret. Math. 19: 9-15 (2005) - [j4]Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler:
On strongly circular-perfectness. Electron. Notes Discret. Math. 22: 369-374 (2005) - 2004
- [j3]Arnaud Pêcher:
Cayley partitionable graphs and near-factorizations of finite groups. Discret. Math. 276(1-3): 295-311 (2004) - 2003
- [j2]Arnaud Pêcher:
Partitionable graphs arising from near-factorizations of finite groups. Discret. Math. 269(1-3): 191-218 (2003) - [j1]Arnaud Pêcher, Annegret Wagler:
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-. Electron. Notes Discret. Math. 13: 93-96 (2003)
Coauthor Index
aka: Annegret Katrin Wagler
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
