default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgnacio García-Marco
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Sara Asensio, Ignacio García-Marco, Kolja Knauer:
Sensitivity of m-ary functions and low degree partitions of Hamming graphs. CoRR abs/2409.16141 (2024)- 2022
- [j15]Ignacio García-Marco, Irene Márquez-Corbella, Edgar Martínez-Moro, Yuriko Pitones:
Computing generalized hamming weights of binary linear codes via free resolutions. ACM Commun. Comput. Algebra 56(2): 19-24 (2022) - [j14]Ignacio García-Marco
, Kolja Knauer:
On sensitivity in bipartite Cayley graphs. J. Comb. Theory B 154: 211-238 (2022) - [i12]Ignacio García-Marco, Kolja Knauer:
Beyond symmetry in generalized Petersen graphs. CoRR abs/2202.06785 (2022) - [i11]Ignacio García-Marco, Irene Márquez-Corbella, Edgar Martínez-Moro, Yuriko Pitones:
Free Resolutions and Generalized Hamming Weights of binary linear codes. CoRR abs/2203.17194 (2022) - 2021
- [j13]Ignacio García-Marco, Kolja Knauer, Luis Pedro Montejano:
Chomp on generalized Kneser graphs and others. Int. J. Game Theory 50(3): 603-621 (2021) - [i10]Eduardo Camps-Moreno, Ignacio García-Marco, Hiram H. López, Irene Márquez-Corbella, Edgar Martínez-Moro, Eliseo Sarmiento:
On decoding hyperbolic codes. CoRR abs/2107.12594 (2021) - 2020
- [j12]Ignacio García-Marco, Irene Márquez-Corbella, Diego Ruano:
High dimensional affine codes whose square has a designed minimum distance. Des. Codes Cryptogr. 88(8): 1653-1672 (2020) - [j11]Ignacio García-Marco, Pascal Koiran, Timothée Pecatte:
Reconstruction algorithms for sums of affine powers. J. Symb. Comput. 98: 284-318 (2020) - [i9]Ignacio García-Marco, Kolja Knauer:
On sensitivity in bipartite Cayley graphs. CoRR abs/2009.00554 (2020)
2010 – 2019
- 2019
- [i8]Ignacio García-Marco, Irene Márquez-Corbella, Diego Ruano:
High dimensional affine codes whose square has a designed minimum distance. CoRR abs/1907.13068 (2019) - 2018
- [j10]Isabel Bermejo, Eva García-Llorente, Ignacio García-Marco, Marcel Morales:
Noether resolutions in dimension 2. ACM Commun. Comput. Algebra 52(4): 114-116 (2018) - [j9]Pascal Koiran, Timothée Pecatte, Ignacio García-Marco:
On the linear independence of shifted powers. J. Complex. 45: 67-82 (2018) - [c5]Ignacio García-Marco, Pascal Koiran, Timothée Pecatte:
Polynomial Equivalence Problems for Sum of Affine Powers. ISSAC 2018: 303-310 - 2017
- [j8]Ignacio García-Marco, Pascal Koiran:
Lower bounds by Birkhoff interpolation. J. Complex. 39: 38-50 (2017) - [j7]Isabel Bermejo, Eva García-Llorente, Ignacio García-Marco:
Algebraic invariants of projective monomial curves associated to generalized arithmetic sequences. J. Symb. Comput. 81: 1-19 (2017) - [c4]Ignacio García-Marco, Pascal Koiran, Timothée Pecatte:
Reconstruction Algorithms for Sums of Affine Powers. ISSAC 2017: 317-324 - [c3]Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé:
On the Complexity of Partial Derivatives. STACS 2017: 37:1-37:13 - [i7]Ignacio García-Marco, Pascal Koiran, Timothée Pecatte:
On the linear independence of shifted powers. CoRR abs/1705.03842 (2017) - [i6]Ignacio García-Marco, Kolja Knauer:
Chomp on numerical semigroups. CoRR abs/1705.11034 (2017) - 2016
- [j6]Ignacio García-Marco, Kolja Knauer:
Drawing graphs with vertices and edges in convex position. Comput. Geom. 58: 25-33 (2016) - [i5]Ignacio García-Marco, Pascal Koiran, Timothée Pecatte:
Reconstruction Algorithms for Sums of Affine Powers. CoRR abs/1607.05420 (2016) - [i4]Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé:
On the complexity of partial derivatives. CoRR abs/1607.05494 (2016) - 2015
- [j5]Jonathan Chappelon, Ignacio García-Marco, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín:
Möbius function of semigroup posets through Hilbert series. J. Comb. Theory A 136: 238-251 (2015) - [j4]Isabel Bermejo, Ignacio García-Marco:
Complete intersections in simplicial toric varieties. J. Symb. Comput. 68: 265-286 (2015) - [j3]Ignacio García-Marco, Jorge Luis Ramírez Alfonsín:
Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators. SIAM J. Discret. Math. 29(4): 2267-2276 (2015) - [c2]Ignacio García-Marco, Kolja Knauer:
Drawing Graphs with Vertices and Edges in Convex Position. GD 2015: 348-359 - [c1]Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas:
Log-Concavity and Lower Bounds for Arithmetic Circuits. MFCS (2) 2015: 361-371 - [i3]Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas:
Log-concavity and lower bounds for arithmetic circuits. CoRR abs/1503.07705 (2015) - [i2]Ignacio García-Marco, Pascal Koiran:
Lower Bounds by Birkhoff Interpolation. CoRR abs/1507.02015 (2015) - [i1]Ignacio García-Marco, Kolja Knauer:
Drawing graphs with vertices and edges in convex position. CoRR abs/1509.01981 (2015) - 2010
- [j2]Isabel Bermejo, Ignacio García-Marco:
An algorithm for checking whether a simplicial toric ideal is a complete intersection. ACM Commun. Comput. Algebra 44(3/4): 93-94 (2010)
2000 – 2009
- 2007
- [j1]Isabel Bermejo, Ignacio García-Marco, Juan José Salazar González:
An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection. J. Symb. Comput. 42(10): 971-991 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
