 | 2009 |
|---|
| 16 |       | Omer Giménez,
Anders Jonsson:
The Influence of k-Dependence on the Complexity of Planning.
ICAPS 2009 |
| 15 |  | Hubie Chen,
Omer Giménez:
On-the-Fly Macros.
WoLLIC 2009: 155-169 |
| 14 | | 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 |
|---|
| 13 | | Hubie Chen,
Omer Giménez:
Causal Graphs and Structurally Restricted Planning.
ICAPS 2008: 36-43 |
| 12 | | Omer Giménez,
Anders Jonsson:
In Search of the Tractability Boundary of Planning Problems.
ICAPS 2008: 99-106 |
| 11 | | Omer Giménez:
On-the-fly Macros
CoRR abs/0810.1186: (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 |
