Théorie graphe And NotPinar Heggemes
List of bibliographic references
Number of relevant bibliographic references: 26.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000028 | Hyacinthe J. Ramaroson [Madagascar, France] ; Florence Le Ber [France] ; Bertin O. Ramamonjisoa [Madagascar] ; Dominique Herve [France] | Treillis de Galois pour la fusion de connaissances spatiales sur des territoires villageois malgaches |
| 000056 | Giuseppe Patane [Italie] | Multi-resolutive sparse approximations of d-dimensional data |
| 000081 | Didier Galmiche [France] ; Daniel Mery [France] | A Connection-based Characterization of Bi-intuitionistic Validity |
| 000107 | Salim Jouili [Belgique] ; Salvatore Tabbone [France] | Hypergraph-based image retrieval for graph-based representation |
| 000175 | Frédéric Pennerath [France] ; Gilles Niel [France] ; Philippe Vismara [France] ; Philippe Jauffret [France] ; Claude Laurenco [France] ; Amedeo Napoli [France] | Graph-Mining Algorithm for the Evaluation of Bond Formability |
| 000390 | Olivier Devillers [France] ; Hazel Everett [France] ; Sylvain Lazard [France] ; Maria Pentcheva [France] ; Stephen K. Wismath [Canada] | Drawing Kn in three dimensions with one bend per edge |
| 000406 | Gaurav Goel [France, Inde] ; Jens Gustedt [France] | Bounded arboricity to determine the local structure of sparse graphs |
| 000431 | Florence Le Ber [France] ; Amedeo Napoli [France] | Relations, structures et objets : quelques variations |
| 000449 | Clara Bertolissi [France] | The graph rewriting calculus : Confluence and expressiveness |
| 000514 | Mathilde Bouvel [France] ; Vladimir Grebinski [États-Unis] ; Gregory Kucherov [France] | Combinatorial search on graphs motivated by bioinformatics applications : A brief survey |
| 000516 | Didier Galmiche [France] ; Daniel Mery [France] | Characterizing provability in BI's pointer logic through resource graphs |
| 000662 | Karell Bertet [France] ; Jens Gustedt [France] ; Michel Morvan [France] | Weak-order extensions of an order |
| 000697 | Assefaw Hadish Gebremedhin [Norvège] ; Isabelle Guerin Lassous [France] ; Jens Gustedt [France] ; Jan Arne Telle [Norvège] | Graph coloring on coarse grained multicomputers |
| 000713 | Robert Cori [France] ; Gilles Schaeffer [France] | Description trees and Tutte formulas |
| 000735 | N. N. Pisaruk [France] | A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time |
| 000738 | Dominique Poulalhon [France] ; Gilles Schaeffer [France] | A bijection for triangulations of a polygon with interior points and multiple edges |
| 000776 | Johanne Cohen [France] ; Pierre Fraigniaud [France] ; Cyril Gavoille [France] | Recognizing Knödel graphs |
| 000892 | Laurent Alonso [France] ; René Schott [France] | On the tree inclusion problem |
| 000906 | Elias Dahlhaus [Allemagne] ; Jens Gustedt [France] ; Ross M. Mcconnell [États-Unis] | Efficient and practical algorithms for sequential modular decomposition |
| 000B27 | F. Bertault [France] ; G. Kucherov [France] | Visualization of dynamic automata using Padnon |
| 000B52 | M. Mouhoub [France] ; F. Charpillet [France] ; J. P. Haton [France] | Experimental analysis of numeric and symbolic constraint satisfaction techniques for temporal reasoning |
| 000B72 | P.-E. Moreau [France] ; H. Kirchner [France] | A compiler for rewrite programs in associative-commutative theories |
| 000C00 | L. Alonso [France] ; J. L. Remy [France] ; R. Schott [France] | Uniform generation of a Schröder tree |
| 000C49 | D. Bechet [France] ; P. De Groote [France] ; C. Retore [France] | A complete axiomatisation for the inclusion of series-parallel partial orders |
| 000C84 | C. Lynch [France] ; P. Strogova [France] | PATCH graphs : An efficient data structure for complementation of finitely presented groups |
| 000C92 | C. Kirchner [France] ; C. Lynch [France] ; C. Scharff [France] | Fine-grained concurrent completion |
| This area was generated with Dilib version V0.6.33. |  |