 | 2012 |
| 30 |  | Jordi Petit,
Omer Giménez,
Salvador Roura:
Jutge.org: an educational programming judge.
SIGCSE 2012: 445-450 |
| 29 |  | Michael Drmota,
Omer Giménez,
Marc Noy,
Konstantinos Panagiotou,
Angelika Steger:
The maximum degree of random planar graphs.
SODA 2012: 281-287 |
| 28 |  | Olivier Bernardi,
Omer Giménez:
A Linear Algorithm for the Random Sampling from Regular Languages.
Algorithmica 62(1-2): 130-145 (2012) |
| 27 |  | Omer Giménez,
Anders Jonsson:
The influence of k-dependence on the complexity of planning.
Artif. Intell. 177-179: 25-45 (2012) |
| 2011 |
| 26 |  | Omer Giménez,
Anders Jonsson:
The Complexity of Planning Problems With Simple Causal Graphs
CoRR abs/1111.0056: (2011) |
| 25 |  | Michael Drmota,
Omer Giménez,
Marc Noy:
The Maximum Degree of Series-Parallel Graphs.
Combinatorics, Probability & Computing 20(4): 529-570 (2011) |
| 24 |  | Guillaume Chapuy,
Éric Fusy,
Omer Giménez,
Bojan Mohar,
Marc Noy:
Asymptotic enumeration and limit laws for graphs of fixed genus.
J. Comb. Theory, Ser. A 118(3): 748-777 (2011) |
| 23 |  | Michael Drmota,
Omer Giménez,
Marc Noy:
Degree distribution in random planar graphs.
J. Comb. Theory, Ser. A 118(7): 2102-2130 (2011) |
| 22 |  | Omer Giménez,
Guillem Godoy,
Sebastian Maneth:
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete.
SIAM J. Comput. 40(2): 446-464 (2011) |
| 2010 |
| 21 |  | Guillem Godoy,
Omer Giménez,
Lander Ramos,
Carme Àlvarez:
The HOM problem is decidable.
STOC 2010: 485-494 |
| 20 |  | Hubie Chen,
Omer Giménez:
Causal graphs and structurally restricted planning.
J. Comput. Syst. Sci. 76(7): 579-592 (2010) |
| 19 |  | Michael Drmota,
Omer Giménez,
Marc Noy:
Vertices of given degree in series-parallel graphs.
Random Struct. Algorithms 36(3): 273-314 (2010) |
| 2009 |
| 18 |  | Omer Giménez,
Anders Jonsson:
The Influence of k-Dependence on the Complexity of Planning.
ICAPS 2009 |
| 17 |  | Hubie Chen,
Omer Giménez:
On-the-Fly Macros.
WoLLIC 2009: 155-169 |
| 16 |  | Omer Giménez,
Guillem Godoy,
Sebastian Maneth:
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
CoRR abs/0911.3674: (2009) |
| 15 |  | Omer Giménez,
Anders Jonsson:
Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard.
J. Artif. Intell. Res. (JAIR) 34: 675-706 (2009) |
| 2008 |
| 14 |  | Hubie Chen,
Omer Giménez:
Causal Graphs and Structurally Restricted Planning.
ICAPS 2008: 36-43 |
| 13 |  | Omer Giménez,
Anders Jonsson:
In Search of the Tractability Boundary of Planning Problems.
ICAPS 2008: 99-106 |
| 12 |  | Omer Giménez:
On-the-fly Macros
CoRR abs/0810.1186: (2008) |
| 11 |  | Stefanie Gerke,
Omer Giménez,
Marc Noy,
Andreas Weißl:
The Number of Graphs Not Containing K3, 3 as a Minor.
Electr. J. Comb. 15(1): (2008) |
| 10 |  | Omer Giménez,
Anders Jonsson:
The Complexity of Planning Problems With Simple Causal Graphs.
J. Artif. Intell. Res. (JAIR) 31: 319-351 (2008) |
| 2007 |
| 9 |  | Omer Giménez,
Anders Jonsson:
On the Hardness of Planning Problems with Simple Causal Graphs.
ICAPS 2007: 152-159 |
| 8 |  | Hubie Chen,
Omer Giménez:
Act Local, Think Global: Width Notions for Tractable Planning.
ICAPS 2007: 73-80 |
| 7 |  | Joseph E. Bonin,
Omer Giménez:
Multi-Path Matroids.
Combinatorics, Probability & Computing 16(2): 193-217 (2007) |
| 6 |  | Omer Giménez,
Marc Noy,
Juan José Rué:
Graph classes with given 3-connected components: asymptotic counting and critical phenomena.
Electronic Notes in Discrete Mathematics 29: 521-529 (2007) |
| 5 |  | Manuel Bodirsky,
Omer Giménez,
Mihyun Kang,
Marc Noy:
Enumeration and limit laws for series-parallel graphs.
Eur. J. Comb. 28(8): 2091-2105 (2007) |
| 2006 |
| 4 |  | Omer Giménez:
Solving planning domains with polytree causal graphs is NP-complete
CoRR abs/cs/0610095: (2006) |
| 3 |  | Omer Giménez,
Marc Noy:
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids.
Combinatorics, Probability & Computing 15(3): 385-395 (2006) |
| 2 |  | Omer Giménez,
Petr Hlinený,
Marc Noy:
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.
SIAM J. Discrete Math. 20(4): 932-946 (2006) |
| 2005 |
| 1 |  | Omer Giménez,
Petr Hlinený,
Marc Noy:
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.
WG 2005: 59-68 |