Guillaume Fertin Coauthor index pubzone.org

Facets and more with CompleteSearch

Listing of the DBLP Bibliography Server - FAQ
Other views (modern): by type - by year
Other mirrors: Trier I - Trier II


Ask others: ACM DL/Guide - CiteSeerx - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2017
j44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Joseph G. Peters, Lynette Raabe, Charlie Xu: Odd gossiping. Discrete Applied Mathematics 216: 550-561 (2017)
2016
j43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Eric Tannier: Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinformatics 17(S-14): 225-231 (2016)
j42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Christian Komusiewicz: (Prefix) reversal distance for (signed) strings with few blocks or small alphabets. J. Discrete Algorithms 37: 44-55 (2016)
c49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu: Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON 2016: 393-404
c48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Christian Komusiewicz: Graph Motif Problems Parameterized by Dual. CPM 2016: 7:1-7:12
c47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthieu David, Guillaume Fertin, Dominique Tessier: SpecTrees: An Efficient Without a Priori Data Structure for MS/MS Spectra Identification. WABI 2016: 65-76
c46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Géraldine Jean, Eric Tannier: Genome Rearrangements on Both Gene Order and Intergenic Regions. WABI 2016: 162-173
e1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRiccardo Dondi, Guillaume Fertin, Giancarlo Mauri: Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings .Lecture Notes in Computer Science 9778, Springer 2016, ISBN 978-3-319-41167-5
2015
j41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Christian Komusiewicz, Hafedh Mohamed-Babou, Irena Rusu: Finding Supported Paths in Heterogeneous Networks. Algorithms 8(4): 810-831 (2015)
j40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu: Path-driven orientation of mixed graphs. Discrete Applied Mathematics 181: 98-108 (2015)
j39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. 115(1): 1-5 (2015)
j38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Pancake Flipping is hard. J. Comput. Syst. Sci. 81(8): 1556-1574 (2015)
j37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz: Towards an algorithmic guide to Spiral Galaxies. Theor. Comput. Sci. 586: 26-39 (2015)
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias: Approximation algorithms for sorting by length-weighted prefix and suffix operations. Theor. Comput. Sci. 593: 26-41 (2015)
c45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Irena Rusu, Stéphane Vialette: Obtaining a Triangular Matrix by Independent Row-Column Permutations. ISAAC 2015: 165-175
c44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Irena Rusu, Stéphane Vialette: Algorithmic Aspects of the S-Labeling Problem. IWOCA 2015: 173-184
c43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Loïc Jankowiak, Géraldine Jean: Prefix and Suffix Reversals on Strings. SPIRE 2015: 165-176
2014
c42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Géraldine Jean, Andreea Radulescu, Irena Rusu: DExTaR: Detection of exact tandem repeats based on the de Bruijn graph. BIBM 2014: 90-93
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Christian Komusiewicz: Reversal Distances for Strings with Few Blocks or Small Alphabets. CPM 2014: 50-59
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz: Towards an Algorithmic Guide to Spiral Galaxies. FUN 2014: 171-182
2013
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Maximal strip recovery problem with gaps: Hardness and approximation algorithms. J. Discrete Algorithms 19: 1-22 (2013)
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRiccardo Dondi, Guillaume Fertin, Stéphane Vialette: Finding approximate and constrained motifs in graphs. Theor. Comput. Sci. 483: 10-21 (2013)
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Revisiting the Minimum Breakpoint Linearization Problem. Theor. Comput. Sci. 494: 122-133 (2013)
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu: A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. WABI 2013: 244-258
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu: A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. CoRR abs/1307.7842 (2013)
2012
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions Is Difficult. SIAM J. Discrete Math. 26(3): 1148-1180 (2012)
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu: Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. 440-441: 14-28 (2012)
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Pancake Flipping Is Hard. MFCS 2012: 247-258
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu: Algorithms for Subnetwork Mining in Heterogeneous Networks. SEA 2012: 184-194
2011
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4): 799-811 (2011)
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRiccardo Dondi, Guillaume Fertin, Stéphane Vialette: Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms 9(1): 82-99 (2011)
c36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette: Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011: 272-286
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu: Tractability and Approximability of Maximal Strip Recovery. CPM 2011: 336-349
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRiccardo Dondi, Guillaume Fertin, Stéphane Vialette: Finding Approximate and Constrained Motifs in Graphs. CPM 2011: 388-401
c33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions Is Difficult. ICALP (1) 2011: 654-665
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Pancake Flipping is Hard .CoRR abs/1111.0434 (2011)
2010
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411(26-28): 2475-2486 (2010)
c32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFreddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier: Proper Alignment of MS/MS Spectra from Unsequenced Species. BIOCOMP 2010: 766-772
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Revisiting the Minimum Breakpoint Linearization Problem. TAMC 2010: 163-174
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions is Difficult .CoRR abs/1011.1157 (2010)
2009
b1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette: Combinatorics of Genome Rearrangements. Computational molecular biology, MIT Press 2009, ISBN 978-0-262-06282-4, pp. I-XI, 1-288
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Stéphane Vialette: On the S-Labeling problem. Electronic Notes in Discrete Mathematics 34: 273-277 (2009)
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Romeo Rizzi, Stéphane Vialette: Finding occurrences of protein complexes in protein-protein interaction graphs. J. Discrete Algorithms 7(1): 90-101 (2009)
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: On the Approximability of Comparing Genomes with Duplicates. J. Graph Algorithms Appl. 13(1): 19-53 (2009)
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu: Comparing Bacterial Genomes by Searching Their Common Intervals. BICoB 2009: 102-113
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIsabelle Fagnot, Guillaume Fertin, Stéphane Vialette: On Finding Small 2-Generating Sets. COCOON 2009: 378-387
c28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRiccardo Dondi, Guillaume Fertin, Stéphane Vialette: Maximum Motif Problem in Vertex-Colored Graphs. CPM 2009: 221-235
c27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC 2009: 710-719
c26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette: Pseudo Boolean Programming for Partially Ordered Genomes. RECOMB-CG 2009: 126-137
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette: The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM 2009: 357-368
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFreddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier: Comparison of Spectra in Unsequenced Species. BSB 2009: 24-35
2008
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud: Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Inf. Process. Lett. 105(2): 65-72 (2008)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. Journal of Computational Biology 15(8): 1093-1115 (2008)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms 6(4): 618-626 (2008)
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSébastien Angibaud, Guillaume Fertin, Irena Rusu: On the Approximability of Comparing Genomes with Duplicates. WALCOM 2008: 34-45
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: On the Approximability of Comparing Genomes with Duplicates .CoRR abs/0806.1103 (2008)
2007
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud: L(p, q) labeling of d-dimensional grids. Discrete Mathematics 307(16): 2132-2140 (2007)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette: A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. Journal of Computational Biology 14(4): 379-393 (2007)
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 523-534 (2007)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette: Exemplar Longest Common Subsequence. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 535-543 (2007)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Stéphane Vialette: Extracting constrained 2-interval subsets in 2-interval sets. Theor. Comput. Sci. 385(1-3): 241-263 (2007)
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet: Extending the Hardness of RNA Secondary Structure Comparison. ESCAPE 2007: 140-151
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP 2007: 340-351
c19no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRiccardo Dondi, Guillaume Fertin, Stéphane Vialette: Weak pattern matching in colored graphs: Minimizing the number of connected components. ICTCS 2007: 27-38
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette: A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. RECOMB-CG 2007: 16-29
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette: Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. BSB 2007: 101-112
2006
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Exemplar Longest Common Subsequence. International Conference on Computational Science (2) 2006: 622-629
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Genomes Containing Duplicates Are Hard to Compare. International Conference on Computational Science (2) 2006: 783-790
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette: How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. Comparative Genomics 2006: 75-86
2005
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Edge-disjoint spanners in Cartesian products of graphs. Discrete Mathematics 296(2-3): 167-186 (2005)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: What Makes the Arc-Preserving Subsequence Problem Hard? Trans. Computational Systems Biology 2: 1-36 (2005)
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: What Makes the Arc-Preserving Subsequence Problem Hard? International Conference on Computational Science (2) 2005: 860-868
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Romeo Rizzi, Stéphane Vialette: Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS 2005: 328-339
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Cédric Chauve, Guillaume Fertin: Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. Comparative Genomics 2005: 11-20
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282
2004
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud: A survey on Knödel graphs. Discrete Applied Mathematics 137(2): 173-195 (2004)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud, Bruce A. Reed: Star coloring of graphs. Journal of Graph Theory 47(3): 163-182 (2004)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCédric Chauve, Guillaume Fertin: On maximal instances for the original syntenic distance. Theor. Comput. Sci. 326(1-3): 29-43 (2004)
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Blin, Guillaume Fertin, Stéphane Vialette: New Results for the 2-Interval Pattern Problem. CPM 2004: 311-322
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud, Ondrej Sýkora: No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. SIROCCO 2004: 138-148
2003
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho: Factor d-domatic colorings of graphs. Discrete Mathematics 262(1-3): 17-25 (2003)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud, Arup Roychowdhury: On the oriented chromatic number of grids. Inf. Process. Lett. 85(5): 261-266 (2003)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Emmanuel Godard, André Raspaud: Acyclic and k-distance coloring of the grid. Inf. Process. Lett. 87(1): 51-58 (2003)
c7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesc Comellas, Guillaume Fertin, André Raspaud: Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. SIROCCO 2003: 73-87
2002
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Emmanuel Godard, André Raspaud: Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84(3): 131-139 (2002)
2001
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOlivier Baudon, Guillaume Fertin, Ivan Havel: Routing permutations and 2-1 routing requests in the hypercube. Discrete Applied Mathematics 113(1): 43-58 (2001)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud: Neighborhood Communications in Networks. Electronic Notes in Discrete Mathematics 10: 103-108 (2001)
c6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud: k-Neighborhood Broadcasting. SIROCCO 2001: 133-146
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud, Bruce A. Reed: On Star Coloring of Graphs. WG 2001: 140-153
2000
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin: A study of minimum gossip graphs. Discrete Mathematics 215: 33-57 (2000)
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud: Recognizing Recursive Circulant Graphs (Extended Abstract). Electronic Notes in Discrete Mathematics 5: 112-115 (2000)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin: Hierarchical broadcast and gossip networks. Inf. Process. Lett. 73(3-4): 131-136 (2000)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, Roger Labahn: Compounding of gossip graphs. Networks 36(2): 126-137 (2000)
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin: On the structure of minimum broadcast digraphs. Theor. Comput. Sci. 245(2): 203-216 (2000)
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Diameter of the Knödel Graph. WG 2000: 149-160
1999
c3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin: Trade-Offs for Add Gossiping. SIROCCO 1999: 137-152
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOlivier Baudon, Guillaume Fertin, Ivan Havel: Routing Permutations in the Hypercube. WG 1999: 179-190
1998
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume Fertin, André Raspaud: Families of Graphs Having Broadcasting and Gossiping Properties. WG 1998: 63-77

Coauthor Index

1Noga Alon[j11]
2Sébastien Angibaud[j25] [c30] [c26] [j23] [c23] [i1] [j20] [c18] [c14]
3Olivier Baudon[j7] [c2]
4Guillaume Blin[c36] [c25] [j22] [j19] [j17] [c21] [c17] [j15] [c13] [c11] [c10] [c9]
5Paola Bonizzoni[j18] [c16]
6Laurent Bulteau[j43] [j42] [c49] [j39] [j38] [c41] [j35] [j33] [c39] [i4] [j32] [j31] [c38] [c35] [c33] [i3] [c31] [i2] [c27]
7Cédric Chauve[j19] [c15] [c11] [j12]
8Freddy Cliquet[c32] [c24]
9Francesc Comellas[c7]
10Matthieu David[c47]
11Zanoni Dias[j36]
12Riccardo Dondi[e1] [j34] [j29] [c34] [c28] [j18] [c19] [c16]
13Damien Eveillard[c30]
14Isabelle Fagnot[c29]
15Michael R. Fellows[j30] [c20]
16Emmanuel Godard[j9] [j8]
17Ivan Havel[j7] [c2]
18Danny Hermelin[j30] [j28] [j22] [c22] [c20] [c10]
19Gaël Herry[c17]
20Shahrad Jamshidi[j37] [c40]
21Loïc Jankowiak[c43]
22Géraldine Jean[c46] [c43] [c42]
23Minghui Jiang 0001[j31] [c35]
24Christian Komusiewicz[j42] [c48] [j41] [j37] [c41] [c40] [c39] [i4]
25Roger Labahn[j2]
26Anthony Labarre[c49] [b1]
27Arthur L. Liestman[j16] [j11]
28Carla Negri Lintzmayer[j36]
29Giancarlo Mauri[e1]
30Hafedh Mohamed-Babou[j41] [j40] [c37] [c36]
31Joseph G. Peters[j44]
32Lynette Raabe[j44]
33Andreea Radulescu[c42]
34André Raspaud[j24] [j21] [j14] [j13] [c8] [j10] [j9] [c7] [j8] [j6] [c6] [c5] [j4] [c4] [c1]
35Bruce A. Reed[j13] [c5]
36Raffaella Rizzi[j18]
37Romeo Rizzi[c49] [j39] [j28] [j26] [j19] [c22] [c15] [j15] [c13] [c12]
38Arup Roychowdhury[j10]
39Irena Rusu[c49] [j41] [j40] [j38] [c45] [c44] [c42] [j35] [j33] [c39] [i4] [j32] [j31] [c38] [c37] [c36] [c35] [c33] [i3] [c32] [c31] [i2] [b1] [j25] [c30] [c27] [c24] [j23] [c23] [i1] [j20] [c21] [c18] [c14]
40Heiko Schröder[c4]
41Thomas C. Shermer[j16] [j11]
42Florian Sikora[c36] [c25]
43Christine Sinoquet[c21]
44Ladislav Stacho[j16] [j11]
45Ondrej Sýkora[c8] [c4]
46Eric Tannier[j43] [c46] [b1]
47Dominique Tessier[c47] [c32] [c24]
48Annelyse Thévenin[j25] [c26] [j23] [i1] [c18]
49Gianluca Della Vedova[j18] [c16]
50Stéphane Vialette[j39] [c45] [c44] [j34] [j30] [j29] [c36] [c34] [j28] [b1] [j27] [j26] [j25] [c29] [c28] [c26] [c25] [j23] [j22] [i1] [j20] [j19] [j18] [j17] [c22] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [j15] [c13] [c12] [c10] [c9]
51Imrich Vrto[c4]
52Charlie Xu[j44]

 

Last update 2017-02-03 04:44 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page