dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Omer Giménez Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJordi Petit, Omer Giménez, Salvador Roura: Jutge.org: an educational programming judge. SIGCSE 2012: 445-450
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger: The maximum degree of random planar graphs. SODA 2012: 281-287
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOlivier Bernardi, Omer Giménez: A Linear Algorithm for the Random Sampling from Regular Languages. Algorithmica 62(1-2): 130-145 (2012)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez, Anders Jonsson: The influence of k-dependence on the complexity of planning. Artif. Intell. 177-179: 25-45 (2012)
2011
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez, Anders Jonsson: The Complexity of Planning Problems With Simple Causal Graphs CoRR abs/1111.0056: (2011)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Drmota, Omer Giménez, Marc Noy: The Maximum Degree of Series-Parallel Graphs. Combinatorics, Probability & Computing 20(4): 529-570 (2011)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillaume 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)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Drmota, Omer Giménez, Marc Noy: Degree distribution in random planar graphs. J. Comb. Theory, Ser. A 118(7): 2102-2130 (2011)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer 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
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez: The HOM problem is decidable. STOC 2010: 485-494
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHubie Chen, Omer Giménez: Causal graphs and structurally restricted planning. J. Comput. Syst. Sci. 76(7): 579-592 (2010)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Drmota, Omer Giménez, Marc Noy: Vertices of given degree in series-parallel graphs. Random Struct. Algorithms 36(3): 273-314 (2010)
2009
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez, Anders Jonsson: The Influence of k-Dependence on the Complexity of Planning. ICAPS 2009
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHubie Chen, Omer Giménez: On-the-Fly Macros. WoLLIC 2009: 155-169
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer 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)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer 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
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHubie Chen, Omer Giménez: Causal Graphs and Structurally Restricted Planning. ICAPS 2008: 36-43
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez, Anders Jonsson: In Search of the Tractability Boundary of Planning Problems. ICAPS 2008: 99-106
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez: On-the-fly Macros CoRR abs/0810.1186: (2008)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefanie 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)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez, Anders Jonsson: The Complexity of Planning Problems With Simple Causal Graphs. J. Artif. Intell. Res. (JAIR) 31: 319-351 (2008)
2007
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez, Anders Jonsson: On the Hardness of Planning Problems with Simple Causal Graphs. ICAPS 2007: 152-159
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHubie Chen, Omer Giménez: Act Local, Think Global: Width Notions for Tractable Planning. ICAPS 2007: 73-80
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoseph E. Bonin, Omer Giménez: Multi-Path Matroids. Combinatorics, Probability & Computing 16(2): 193-217 (2007)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer 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)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManuel 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
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez: Solving planning domains with polytree causal graphs is NP-complete CoRR abs/cs/0610095: (2006)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez, Marc Noy: On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids. Combinatorics, Probability & Computing 15(3): 385-395 (2006)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Giménez, Petr Hlinený, Marc Noy: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. WG 2005: 59-68

Coauthor Index

1Carme Àlvarez [21]
2Olivier Bernardi [28]
3Manuel Bodirsky [5]
4Joseph E. Bonin [7]
5Guillaume Chapuy [24]
6Hubie Chen [8] [14] [17] [20]
7Michael Drmota [19] [23] [25] [29]
8Éric Fusy [24]
9Stefanie Gerke [11]
10Guillem Godoy [16] [21] [22]
11Petr Hlinený [1] [2]
12Anders Jonsson [9] [10] [13] [15] [18] [26] [27]
13Mihyun Kang [5]
14Sebastian Maneth [16] [22]
15Bojan Mohar [24]
16Marc Noy [1] [2] [3] [5] [6] [11] [19] [23] [24] [25] [29]
17Konstantinos Panagiotou [29]
18Jordi Petit [30]
19Lander Ramos [21]
20Salvador Roura [30]
21Juan José Rué [6]
22Angelika Steger [29]
23Andreas Weißl [11]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page