Omer Giménez

37 papers A* 7A 1B 1C 1Journal 27
YearRankTypeTitle / Venue / Authors
2019 J jnl
Corrections to "Jutge.org: Characteristics and Experiences".
IEEE Trans. Learn. Technol.
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
2018 J jnl
Jutge.org: Characteristics and Experiences.
IEEE Trans. Learn. Technol.
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
2016 J jnl
Maximum degree in minor-closed classes of graphs.
Eur. J. Comb.
Omer Giménez, Dieter Mitsche, Marc Noy
2015 J jnl
On the Diameter of Random Planar Graphs.
Comb. Probab. Comput.
Guillaume Chapuy, Éric Fusy, Omer Giménez, Marc Noy
2014 J jnl
Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard.
CoRR
Omer Giménez, Anders Jonsson
2013 J jnl
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs.
Random Struct. Algorithms
Omer Giménez, Marc Noy, Juan José Rué
2013 J jnl
The HOM problem is decidable.
J. ACM
Guillem Godoy, Omer Giménez
2012 J jnl
A Linear Algorithm for the Random Sampling from Regular Languages.
Algorithmica
Olivier Bernardi, Omer Giménez
2012 A conf
Jutge.org: an educational programming judge.
SIGCSE
Jordi Petit, Omer Giménez, Salvador Roura
2012 J jnl
The influence of k-dependence on the complexity of planning.
Artif. Intell.
Omer Giménez, Anders Jonsson
2012 A* conf
The maximum degree of random planar graphs.
SODA
Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger
2011 J jnl
Asymptotic enumeration and limit laws for graphs of fixed genus.
J. Comb. Theory A
Guillaume Chapuy, Éric Fusy, Omer Giménez, Bojan Mohar, Marc Noy
2011 J jnl
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete.
SIAM J. Comput.
Omer Giménez, Guillem Godoy, Sebastian Maneth
2011 J jnl
Degree distribution in random planar graphs.
J. Comb. Theory A
Michael Drmota, Omer Giménez, Marc Noy
2011 J jnl
The Complexity of Planning Problems With Simple Causal Graphs
CoRR
Omer Giménez, Anders Jonsson
2011 J jnl
The Maximum Degree of Series-Parallel Graphs.
Comb. Probab. Comput.
Michael Drmota, Omer Giménez, Marc Noy
2010 J jnl
Causal graphs and structurally restricted planning.
J. Comput. Syst. Sci.
Hubie Chen, Omer Giménez
2010 A* conf
The HOM problem is decidable.
STOC
Guillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez
2010 J jnl
Vertices of given degree in series-parallel graphs.
Random Struct. Algorithms
Michael Drmota, Omer Giménez, Marc Noy
2009 J jnl
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
CoRR
Omer Giménez, Guillem Godoy, Sebastian Maneth
2009 C conf
On-the-Fly Macros.
WoLLIC
Hubie Chen, Omer Giménez
2009 J jnl
Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard.
J. Artif. Intell. Res.
Omer Giménez, Anders Jonsson
2009 A* conf
The Influence of
ICAPS
Omer Giménez, Anders Jonsson
2008 A* conf
Causal Graphs and Structurally Restricted Planning.
ICAPS
Hubie Chen, Omer Giménez
2008 A* conf
In Search of the Tractability Boundary of Planning Problems.
ICAPS
Omer Giménez, Anders Jonsson
2008 J jnl
On-the-fly Macros
CoRR
Omer Giménez
2008 J jnl
The Complexity of Planning Problems With Simple Causal Graphs.
J. Artif. Intell. Res.
Omer Giménez, Anders Jonsson
2008 J jnl
The Number of Graphs Not Containing K
Electron. J. Comb.
Stefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl
2007 A* conf
Act Local, Think Global: Width Notions for Tractable Planning.
ICAPS
Hubie Chen, Omer Giménez
2007 J jnl
Enumeration and limit laws for series-parallel graphs.
Eur. J. Comb.
Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy
2007 J jnl
Graph classes with given 3-connected components: asymptotic counting and critical phenomena.
Electron. Notes Discret. Math.
Omer Giménez, Marc Noy, Juan José Rué
2007 J jnl
Multi-Path Matroids.
Comb. Probab. Comput.
Joseph E. Bonin, Omer Giménez
2007 A* conf
On the Hardness of Planning Problems with Simple Causal Graphs.
ICAPS
Omer Giménez, Anders Jonsson
2006 J jnl
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.
SIAM J. Discret. Math.
Omer Giménez, Petr Hlinený, Marc Noy
2006 J jnl
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids.
Comb. Probab. Comput.
Omer Giménez, Marc Noy
2006 J jnl
Solving planning domains with polytree causal graphs is NP-complete
CoRR
Omer Giménez
2005 B conf
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.
WG
Omer Giménez, Petr Hlinený, Marc Noy