The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Criel Merino: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Criel Merino, M. L. Luis-Garcia, S. E. Hernandez, F. A. Martin, O. Casanova, D. Gomez, M. A. Castellano, J. L. González-Mora
    Application of a Digital Deconvolution Technique to Brain Temperature Measurement and Its Correlation with Other Physiological Parameters. [Citation Graph (0, 0)][DBLP]
    CBMS, 2005, pp:47-53 [Conf]
  2. Criel Merino
    The Chip Firing Game and Matroid Complexes. [Citation Graph (0, 0)][DBLP]
    DM-CCG, 2001, pp:245-256 [Conf]
  3. J. Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia
    Spanning Trees of Multicoloured Point Sets with Few Intersections. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:113-122 [Conf]
  4. Neil J. Calkin, Criel Merino, S. Noble, Marc Noy
    Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  5. Criel Merino
    The chip-firing game. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:302, n:1-3, pp:188-210 [Journal]
  6. Criel Merino, Gelasio Salazar, Jorge Urrutia
    On the length of longest alternating paths for multicoloured point sets in convex position. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:15, pp:1791-1797 [Journal]
  7. Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia
    A Problem on Hinged Dissections with Colours. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:145-159 [Journal]
  8. Criel Merino, Gelasio Salazar, Jorge Urrutia
    On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:3, pp:333-341 [Journal]
  9. Mikio Kano, Criel Merino, Jorge Urrutia
    On plane spanning trees and cycles of multicolored point sets with few intersections. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:6, pp:301-306 [Journal]
  10. Criel Merino, Anna de Mier, Marc Noy
    Irreducibility of the Tutte Polynomial of a Connected Matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:298-304 [Journal]

  11. The Equivalence of Two Graph Polynomials and a Symmetric Function. [Citation Graph (, )][DBLP]


  12. Simple Euclidean Arrangements with No (>= 5)-Gons. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002