Abstract is missing.
- A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten YearsMario Vento. 1-10 [doi]
- A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism DetectionNicholas Dahm, Horst Bunke, Terry Caelli, Yongsheng Gao. 11-20 [doi]
- On the Complexity of Submap IsomorphismChristine Solnon, Guillaume Damiand, Colin de la Higuera, Jean-Christophe Janodet. 21-30 [doi]
- Flooding Edge Weighted GraphsFernand Meyer. 31-40 [doi]
- Graph Matching with Nonnegative Sparse ModelBo Jiang, Jin Tang, Bin Luo. 41-50 [doi]
- TurboTensors for Entropic Image ComparisonFrancisco Escolano, Edwin R. Hancock, Boyan Bonev 0001, Miguel Angel Lozano. 51-60 [doi]
- Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph LabellingXavier Cortés, Francesc Serratosa. 61-70 [doi]
- GMTE: A Tool for Graph Transformation and Exact/Inexact Graph MatchingMohamed Amine Hannachi, Ismael Bouassida Rodriguez, Khalil Drira, Saúl E. Pomares Hernández. 71-80 [doi]
- A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern RecognitionDonatello Conte, Jean-Yves Ramel, Nicolas Sidere, Muhammad Muzzamil Luqman, Benoit Gaüzère, Jaume Gibert, Luc Brun, Mario Vento. 81-90 [doi]
- Adjunctions on the Lattice of DendrogramsFernand Meyer. 91-100 [doi]
- A Continuous-Time Quantum Walk Kernel for Unattributed GraphsLuca Rossi 0004, Andrea Torsello, Edwin R. Hancock. 101-110 [doi]
- Relevant Cycle Hypergraph Representation for MoleculesBenoit Gaüzère, Luc Brun, Didier Villemin. 111-120 [doi]
- A Quantum Jensen-Shannon Graph Kernel Using the Continuous-Time Quantum WalkLu Bai, Edwin R. Hancock, Andrea Torsello, Luca Rossi 0004. 121-131 [doi]
- Treelet Kernel Incorporating Chiral InformationPierre-Anthony Grenier, Luc Brun, Didier Villemin. 132-141 [doi]
- A Novel Software Toolkit for Graph Edit Distance ComputationKaspar Riesen, Sandro Emmenegger, Horst Bunke. 142-151 [doi]
- Map Edit Distance vs. Graph Edit Distance for Matching ImagesCamille Combier, Guillaume Damiand, Christine Solnon. 152-161 [doi]
- An Algorithm for Maximum Common Subgraph of Planar Triangulation GraphsYao Lu, Horst Bunke, Cheng-Lin Liu. 162-171 [doi]
- Graph Characteristics from the Schrödinger OperatorPablo Suau, Edwin R. Hancock, Francisco Escolano. 172-181 [doi]
- Persistent Homology in Image ProcessingHerbert Edelsbrunner. 182-183 [doi]
- Towards Minimal BarcodesRocío González-Díaz, María José Jiménez, Hamid Krim. 184-193 [doi]
- A Fast Matching Algorithm for Graph-Based Handwriting RecognitionAndreas Fischer, Ching Y. Suen, Volkmar Frinken, Kaspar Riesen, Horst Bunke. 194-203 [doi]
- On the Evaluation of Graph Centrality for Shape MatchingSamuel de Sousa, Nicole M. Artner, Walter G. Kropatsch. 204-213 [doi]
- Shape Recognition as a Constraint Satisfaction ProblemAline Deruyver, Yann Hodé. 214-223 [doi]
- Gaussian Wave Packet on a GraphFurqan Aziz, Richard C. Wilson, Edwin R. Hancock. 224-233 [doi]
- Exact Computation of Median Surfaces Using Optimal 3D Graph SearchZhengwang Wu, Xiaoyi Jiang, Nanning Zheng, Yuehu Liu, Da-Chuan Cheng. 234-243 [doi]
- Estimation of Distribution Algorithm for the Max-Cut ProblemSamuel de Sousa, Yll Haxhimusa, Walter G. Kropatsch. 244-253 [doi]