Solving planning domains with polytree causal graphs is NP-complete - Omer Giménez (CoRR, 2006)

On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids. - Omer Giménez; Marc Noy (Comb. Probab. Comput., 2006)

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. - Omer Giménez; Petr Hlinený; Marc Noy (SIAM J. Discret. Math., 2006)

Act Local, Think Global: Width Notions for Tractable Planning. - Hubie Chen; Omer Giménez (ICAPS, 2007)

On the Hardness of Planning Problems with Simple Causal Graphs. - Omer Giménez; Anders Jonsson 001 (ICAPS, 2007)

Multi-Path Matroids. - Joseph E. Bonin; Omer Giménez (Comb. Probab. Comput., 2007)

Enumeration and limit laws for series-parallel graphs. - Manuel Bodirsky; Omer Giménez; Mihyun Kang; Marc Noy (Eur. J. Comb., 2007)

Graph classes with given 3-connected components: asymptotic counting and critical phenomena. - Omer Giménez; Marc Noy; Juan José Rué (Electron. Notes Discret. Math., 2007)

In Search of the Tractability Boundary of Planning Problems. - Omer Giménez; Anders Jonsson 001 (ICAPS, 2008)

The Number of Graphs Not Containing K3, 3 as a Minor. - Stefanie Gerke; Omer Giménez; Marc Noy; Andreas Weißl (Electron. J. Comb., 2008)

On-the-fly Macros - Omer Giménez (CoRR, 2008)

The Complexity of Planning Problems With Simple Causal Graphs. - Omer Giménez; Anders Jonsson 001 (J. Artif. Intell. Res., 2008)

The Influence of k-Dependence on the Complexity of Planning. - Omer Giménez; Anders Jonsson 001 (ICAPS, 2009)

On-the-Fly Macros. - Hubie Chen; Omer Giménez (WoLLIC, 2009)

Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard. - Omer Giménez; Anders Jonsson 001 (J. Artif. Intell. Res., 2009)

The HOM problem is decidable. - Guillem Godoy; Omer Giménez; Lander Ramos; Carme Àlvarez (STOC, 2010)

Causal graphs and structurally restricted planning. - Hubie Chen; Omer Giménez (J. Comput. Syst. Sci., 2010)

Vertices of given degree in series-parallel graphs. - Michael Drmota; Omer Giménez; Marc Noy (Random Struct. Algorithms, 2010)

The Maximum Degree of Series-Parallel Graphs. - Michael Drmota; Omer Giménez; Marc Noy (Comb. Probab. Comput., 2011)

Asymptotic enumeration and limit laws for graphs of fixed genus. - Guillaume Chapuy; Éric Fusy; Omer Giménez; Bojan Mohar; Marc Noy (J. Comb. Theory A, 2011)

Degree distribution in random planar graphs. - Michael Drmota; Omer Giménez; Marc Noy (J. Comb. Theory A, 2011)

Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete. - Omer Giménez; Guillem Godoy; Sebastian Maneth (SIAM J. Comput., 2011)

Jutge.org: an educational programming judge. - Jordi Petit; Omer Giménez; Salvador Roura (SIGCSE, 2012)

The maximum degree of random planar graphs. - Michael Drmota; Omer Giménez; Marc Noy; Konstantinos Panagiotou; Angelika Steger (SODA, 2012)

The influence of k-dependence on the complexity of planning. - Omer Giménez; Anders Jonsson 001 (Artif. Intell., 2012)

A Linear Algorithm for the Random Sampling from Regular Languages. - Olivier Bernardi; Omer Giménez (Algorithmica, 2012)

The HOM problem is decidable. - Guillem Godoy; Omer Giménez (J. ACM, 2013)

Graph classes with given 3-connected components: Asymptotic enumeration and random graphs. - Omer Giménez; Marc Noy; Juan José Rué (Random Struct. Algorithms, 2013)

On the Diameter of Random Planar Graphs. - Guillaume Chapuy; Éric Fusy; Omer Giménez; Marc Noy (Comb. Probab. Comput., 2015)

Maximum degree in minor-closed classes of graphs. - Omer Giménez; Dieter Mitsche; Marc Noy (Eur. J. Comb., 2016)

Jutge.org: Characteristics and Experiences. - Jordi Petit; Salvador Roura; Josep Carmona 001; Jordi Cortadella; Jordi Duch; Omer Giménez; Anaga Mani; Jan Mas; Enric Rodríguez-Carbonell; Enric Rubio; Enric de San Pedro; Divya Venkataramani (IEEE Trans. Learn. Technol., 2018)

Corrections to "Jutge.org: Characteristics and Experiences". - Jordi Petit; Salvador Roura; Josep Carmona 001; Jordi Cortadella; Jordi Duch; Omer Giménez; Anaga Mani; Jan Mas; Enric Rodríguez-Carbonell; Enric Rubio; Enric de San Pedro; Divya Venkataramani (IEEE Trans. Learn. Technol., 2019)