- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j16 |      | Omer Giménez, Anders Jonsson: The influence of k-dependence on the complexity of planning. Artif. Intell. 177-179: 25-45 (2012) |
| j15 | | Olivier Bernardi, Omer Giménez: A Linear Algorithm for the Random Sampling from Regular Languages. Algorithmica 62(1-2): 130-145 (2012) |
| c10 | | Jordi Petit, Omer Giménez, Salvador Roura: Jutge.org: an educational programming judge. SIGCSE 2012: 445-450 |
| c9 | | Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger: The maximum degree of random planar graphs. SODA 2012: 281-287 |
| 2011 | ||
| j14 | | Michael Drmota, Omer Giménez, Marc Noy: The Maximum Degree of Series-Parallel Graphs. Combinatorics, Probability & Computing 20(4): 529-570 (2011) |
| j13 | | 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) |
| j12 | | Michael Drmota, Omer Giménez, Marc Noy: Degree distribution in random planar graphs. J. Comb. Theory, Ser. A 118(7): 2102-2130 (2011) |
| j11 | | 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) |
| i4 | | Omer Giménez, Anders Jonsson: The Complexity of Planning Problems With Simple Causal Graphs. CoRR abs/1111.0056 (2011) |
| 2010 | ||
| j10 | | Hubie Chen, Omer Giménez: Causal graphs and structurally restricted planning. J. Comput. Syst. Sci. 76(7): 579-592 (2010) |
| j9 | | Michael Drmota, Omer Giménez, Marc Noy: Vertices of given degree in series-parallel graphs. Random Struct. Algorithms 36(3): 273-314 (2010) |
| c8 | | Guillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez: The HOM problem is decidable. STOC 2010: 485-494 |
| 2009 | ||
| j8 | | 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) |
| c7 | | Omer Giménez, Anders Jonsson: The Influence of k-Dependence on the Complexity of Planning. ICAPS 2009 |
| c6 | | |
| i3 | | 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) |
| 2008 | ||
| j7 | | 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) |
| j6 | | Omer Giménez, Anders Jonsson: The Complexity of Planning Problems With Simple Causal Graphs. J. Artif. Intell. Res. (JAIR) 31: 319-351 (2008) |
| c5 | | |
| c4 | | Omer Giménez, Anders Jonsson: In Search of the Tractability Boundary of Planning Problems. ICAPS 2008: 99-106 |
| i2 | | |
| 2007 | ||
| j5 | | Joseph E. Bonin, Omer Giménez: Multi-Path Matroids. Combinatorics, Probability & Computing 16(2): 193-217 (2007) |
| j4 | | 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) |
| j3 | | 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) |
| c3 | | Hubie Chen, Omer Giménez: Act Local, Think Global: Width Notions for Tractable Planning. ICAPS 2007: 73-80 |
| c2 | | Omer Giménez, Anders Jonsson: On the Hardness of Planning Problems with Simple Causal Graphs. ICAPS 2007: 152-159 |
| 2006 | ||
| j2 | | Omer Giménez, Marc Noy: On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids. Combinatorics, Probability & Computing 15(3): 385-395 (2006) |
| j1 | | 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) |
| i1 | | Omer Giménez: Solving planning domains with polytree causal graphs is NP-complete. CoRR abs/cs/0610095 (2006) |
| 2005 | ||
| c1 | | Omer Giménez, Petr Hlinený, Marc Noy: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. WG 2005: 59-68 |
Colors in the list of coauthors
Last update Thu May 23 22:51:30 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page