Benjamin Lévêque Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKathie Cameron, Chính T. Hoàng, Benjamin Lévêque: Asteroids in rooted and directed path graphs. Electronic Notes in Discrete Mathematics 32: 67-74 (2009)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon: Coloring Artemis graphs. Theor. Comput. Sci. 410(21-23): 2234-2240 (2009)
2008
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Lévêque, Frédéric Maffray, Myriam Preissmann: Characterizing path graphs by forbidden induced subgraphs CoRR abs/0803.0956: (2008)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKathie Cameron, Chính T. Hoàng, Benjamin Lévêque: Asteroids in rooted and directed path graphs CoRR abs/0812.2734: (2008)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYannick Frein, Benjamin Lévêque, András Sebö: Generating All Sets With Bounded Unions. Combinatorics, Probability & Computing 17(5): 641-660 (2008)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-Claude Bermond, David Coudert, Benjamin Lévêque: Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. Journal of Interconnection Networks 9(4): 471-486 (2008)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Lévêque, Frédéric Maffray: Coloring Bull-Free Perfectly Contractile Graphs. SIAM J. Discrete Math. 21(4): 999-1018 (2008)
2007
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYannick Frein, Benjamin Lévêque, András Sebö: Optimizing diversity CoRR abs/0711.2998: (2007)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon: Detecting induced subgraphs. Electronic Notes in Discrete Mathematics 29: 207-211 (2007)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYannick Frein, Benjamin Lévêque, András Sebö: Optimizing diversity. Electronic Notes in Discrete Mathematics 29: 73-77 (2007)
2005
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon: Coloring Artemis graphs CoRR abs/cs/0504082: (2005)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVincent Jost, Benjamin Lévêque, Frédéric Maffray: Precoloring co-Meyniel graphs CoRR abs/cs/0509004: (2005)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray: Coloring vertices of a graph or finding a Meyniel obstruction CoRR abs/cs/0509023: (2005)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Lévêque, Frédéric Maffray: Coloring Meyniel graphs in linear time. Electronic Notes in Discrete Mathematics 22: 25-28 (2005)
2004
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Lévêque, Frédéric Maffray: Coloring Meyniel graphs in linear time CoRR cs.DM/0405059: (2004)

Coauthor Index

1Jean-Claude Bermond [10]
2Kathie Cameron [3] [12] [15]
3David Coudert [10]
4Jack Edmonds [3]
5Yannick Frein [6] [8] [11]
6Chính T. Hoàng [12] [15]
7Vincent Jost [4]
8David Y. Lin [7]
9Frédéric Maffray [1] [2] [3] [4] [5] [7] [9] [13] [14]
10Myriam Preissmann [13]
11Bruce A. Reed [5] [14]
12András Sebö [6] [8] [11]
13Nicolas Trotignon [5] [7] [14]

Colors in the list of coauthors

Copyright © Tue Dec 1 12:01:14 2009 by Michael Ley (ley@uni-trier.de)