Omer Giménez

According to our database, Omer Giménez authored at least 32 papers between 2006 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Corrections to "Jutge.org: Characteristics and Experiences".

Jordi Petit, Salvador Roura, Josep Carmona, 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

2018

Jutge.org: Characteristics and Experiences.

Jordi Petit, Salvador Roura, Josep Carmona, 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

2016

Maximum degree in minor-closed classes of graphs.

Omer Giménez, Dieter Mitsche, Marc Noy

Eur. J. Comb., 2016

2015

On the Diameter of Random Planar Graphs.

Guillaume Chapuy, Éric Fusy, Omer Giménez, Marc Noy

Comb. Probab. Comput., 2015

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

The HOM problem is decidable.

Guillem Godoy, Omer Giménez

J. ACM, 2013

2012

A Linear Algorithm for the Random Sampling from Regular Languages.

Olivier Bernardi, Omer Giménez

Algorithmica, 2012

The influence of k-dependence on the complexity of planning.

Omer Giménez, Anders Jonsson

Artif. Intell., 2012

The maximum degree of random planar graphs.

Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Jutge.org: an educational programming judge.

Jordi Petit, Omer Giménez, Salvador Roura

Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

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

Degree distribution in random planar graphs.

Michael Drmota, Omer Giménez, Marc Noy

J. Comb. Theory, Ser. A, 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, Ser. A, 2011

The Maximum Degree of Series-Parallel Graphs.

Michael Drmota, Omer Giménez, Marc Noy

Comb. Probab. Comput., 2011

2010

Vertices of given degree in series-parallel graphs.

Michael Drmota, Omer Giménez, Marc Noy

Random Struct. Algorithms, 2010

Causal graphs and structurally restricted planning.

Hubie Chen, Omer Giménez

J. Comput. Syst. Sci., 2010

The HOM problem is decidable.

Guillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009

Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard.

Omer Giménez, Anders Jonsson

J. Artif. Intell. Res., 2009

On-the-Fly Macros.

Hubie Chen, Omer Giménez

Proceedings of the Logic, 2009

The Influence of <i>k-</i>Dependence on the Complexity of Planning.

Omer Giménez, Anders Jonsson

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008

The Complexity of Planning Problems With Simple Causal Graphs.

Omer Giménez, Anders Jonsson

J. Artif. Intell. Res., 2008

On-the-fly Macros

Omer Giménez

CoRR, 2008

The Number of Graphs Not Containing K_{3, 3} as a Minor.

Stefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl

Electron. J. Comb., 2008

In Search of the Tractability Boundary of Planning Problems.

Omer Giménez, Anders Jonsson

Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

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

Enumeration and limit laws for series-parallel graphs.

Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy

Eur. J. Comb., 2007

Multi-Path Matroids.

Joseph E. Bonin, Omer Giménez

Comb. Probab. Comput., 2007

On the Hardness of Planning Problems with Simple Causal Graphs.

Omer Giménez, Anders Jonsson

Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

Act Local, Think Global: Width Notions for Tractable Planning.

Hubie Chen, Omer Giménez

Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

2006

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.

Omer Giménez, Petr Hlinený, Marc Noy

SIAM J. Discret. Math., 2006

On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids.

Omer Giménez, Marc Noy

Comb. Probab. Comput., 2006

Solving planning domains with polytree causal graphs is NP-complete

Omer Giménez

CoRR, 2006