|
 |
|
 |
|
 |
|
|
|
Drawing and Embedded Graph in an Alternative SurfaceGelasio Salazar AnayaIICO, UASLP
The Polycromate and a Chord Diagram PolynomialIrasema Sarmiento LópezOxford University
Topological Subgraphs in Graphs of Given Average DegreeWolfgang MaderHannover University
A Coboundary Polynomial for Subspace ConfigurationsGeoff WhittleVictoria University of Wellington
Valores y Vectores Propios de Matrices 3x3: un Enfoque AlgoritmicoArturo Aguilar Vázquez y José C. Romero CotésUAM-Azcapotzalco
SeparoidesRucardo StrauszIMATE, UNAM
An Elementary Combinatorial Application to Algebraic GeometryJosé Matínez Bernal and Hector Díaz LealCINVESTAV-IPN
Signed Diagonal FlipsShalom EliahouUniversité du Littoral
Codes for MT-MFSK Signalling, and Configurations in DesignCharles ColbournUniversity of Vermont
Multimparametric Analysis on the Feasability in Bipartite CapacitedApolinar Zapata, Ada Alvarez and José Luis MártinezUANL
Iterated Clique Graphs and PosetsFrancisco Larrión and Victor Neumann-LaraIMATE, UNAM
Disjoint Paths and Routing: Results and ProblemsAlan P. SprageUAB
About the Dimention of Digital Quotients of R^nPetra Wiederhold and Richard G. WilsonCINVESTAV-IPN
From Minskowski to the Euclidean Distance TransformJuan L Díaz de León S and Cornelio Yáñez MárquezCIC-IPN
University Admissions Via GraphsMichel BalinskiC.N.R.S.
Hamiltonian and Forbidden SubgraphsGuatao ChenGeorgia State University
On the Intertwining Conjecture for MatroidsDirk VertiganLouisiana State University
Representation of Symplectic Type ConfigurationsRodolfo San Agustín ChiFacultad de Ciencias, UNAM
New Results on List PartitionsPavol HellSimon Fraser University
The Geometry of LJ Atomic ClustersDavid RomeroInstituto de Matemáticas, UNAM Cuernavaca
Unavoidable Minors of Graphs of Large TypeBogdan OporowskiLouisiana State University
Boolean MinorsKlaus TruemperComputer Science Program, University of Texas at Dallas
Tutte’s Edge 3-Coloring ConjectureRobin ThomasSchool of Mathematics, Georgia Institute of Technology
Maximum Mean Weigth Cycle in a Graph and Gigahertz ProcessorsBernhard KorteUniversity of Bonn
Using Integer Linear Programming to Clear PaymentsGilberto CalvilloBanco de México
Some Thoughts on the Hajos Calculus and Coloring Problems in Graphs and MatricesEnrique GarciaCINVESTAV-IPN
Several Approaches to the Assigment Problem in Distributed SystemsGuillermo Morales LunaCINVESTAV-IPN
Some Combinatorial Problems of Integral Quadratic FormJosé Antonio De la PeñaInstituto de Matemáticas, UNAM
Algorithms for the Compartment Problem of Small SizeRafael López BrachoUAM-Azcapotzalco
A Wait-Free Classification of Loop Agreement TasksSergio RajsbaumIMATE, UNAM
Corruptible GraphsAdolfo Sánchez FloresIIMAS, UNAM
Spin Models-Associations Schemes and Delta-Y TransformationIsaías LópezCINVESTAV-IPN
Fail-Stop SignaturesJosé Abel González SilvaCINVESTAV-IPN
Conectivity of Delta-MatroidsGuadalupe Rodríguez SánchezCINVESTAV-IPN
Structure of Graph ColoringsJaroslav NesetrilCharles University
On the Heterochromatic Number of StarsJuan José Montellano and Victor Neumann-LaraIMATE, UNAM
On the Structure of 2-FactorsRonald J. GouldEmory University
Embedding of Graphs and Hypergraphs in One-Dimentional and Two-Dimentional GridsGuy EvenTel-Aviv University
Unifying Synchronous and Asynchronous Message-Passing ModelsMaurice HerlyhiComputer Science Department. Brown University
On the Dichromatic Number of Digraphs and GraphsVíctor Neumann-LaraIMATE, UNAM
A new Proof of Three Terminal Delta-Y Reducibility for Planar GraphsIsidoro GitlerCINVESTAV-IPN
Anti-Ramsey Colorings in Several RoundsRalph FoudreeUniversity of Memphis
|
|