Ignacio García-Marco

Orcid: 0000-0003-4993-7577

According to our database1, Ignacio García-Marco authored at least 22 papers between 2007 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On sensitivity in bipartite Cayley graphs.
J. Comb. Theory, Ser. B, 2022

Free Resolutions and Generalized Hamming Weights of binary linear codes.
CoRR, 2022

Beyond symmetry in generalized Petersen graphs.
CoRR, 2022

Computing generalized hamming weights of binary linear codes via free resolutions.
ACM Commun. Comput. Algebra, 2022

2021
Chomp on generalized Kneser graphs and others.
Int. J. Game Theory, 2021

On decoding hyperbolic codes.
CoRR, 2021

2020
Reconstruction algorithms for sums of affine powers.
J. Symb. Comput., 2020

High dimensional affine codes whose square has a designed minimum distance.
Des. Codes Cryptogr., 2020

2018
On the linear independence of shifted powers.
J. Complex., 2018

Noether resolutions in dimension 2.
ACM Commun. Comput. Algebra, 2018

Polynomial Equivalence Problems for Sum of Affine Powers.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017
Algebraic invariants of projective monomial curves associated to generalized arithmetic sequences.
J. Symb. Comput., 2017

Lower bounds by Birkhoff interpolation.
J. Complex., 2017

Chomp on numerical semigroups.
CoRR, 2017

On the Complexity of Partial Derivatives.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016
Drawing graphs with vertices and edges in convex position.
Comput. Geom., 2016

2015
Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators.
SIAM J. Discret. Math., 2015

Complete intersections in simplicial toric varieties.
J. Symb. Comput., 2015

Möbius function of semigroup posets through Hilbert series.
J. Comb. Theory, Ser. A, 2015

Log-Concavity and Lower Bounds for Arithmetic Circuits.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2010
An algorithm for checking whether a simplicial toric ideal is a complete intersection.
ACM Commun. Comput. Algebra, 2010

2007
An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection.
J. Symb. Comput., 2007


  Loading...