default search action
Omer Giménez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j22]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:
Corrections to "Jutge.org: Characteristics and Experiences". IEEE Trans. Learn. Technol. 12(2): 290 (2019) - 2018
- [j21]Jordi Petit
Jutge.org: Characteristics and Experiences. IEEE Trans. Learn. Technol. 11(3): 321-333 (2018) - 2016
- [j20]Omer Giménez, Dieter Mitsche, Marc Noy:
Maximum degree in minor-closed classes of graphs. Eur. J. Comb. 55: 41-61 (2016) - 2015
- [j19]Guillaume Chapuy, Éric Fusy, Omer Giménez, Marc Noy:
On the Diameter of Random Planar Graphs. Comb. Probab. Comput. 24(1): 145-178 (2015) - 2014
- [i5]Omer Giménez, Anders Jonsson:
Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard. CoRR abs/1401.3467 (2014) - 2013
- [j18]Guillem Godoy, Omer Giménez:
The HOM problem is decidable. J. ACM 60(4): 23:1-23:44 (2013) - [j17]Omer Giménez, Marc Noy, Juan José Rué
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs. Random Struct. Algorithms 42(4): 438-479 (2013) - 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
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. Comb. Probab. Comput. 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 A 118(3): 748-777 (2011) - [j12]Michael Drmota, Omer Giménez, Marc Noy:
Degree distribution in random planar graphs. J. Comb. Theory 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
2000 – 2009
- 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. 34: 675-706 (2009) - [c7]Omer Giménez, Anders Jonsson:
The Influence of k-Dependence on the Complexity of Planning. ICAPS 2009 - [c6]Hubie Chen, Omer Giménez:
On-the-Fly Macros. WoLLIC 2009: 155-169 - [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. Electron. J. Comb. 15(1) (2008) - [j6]Omer Giménez, Anders Jonsson:
The Complexity of Planning Problems With Simple Causal Graphs. J. Artif. Intell. Res. 31: 319-351 (2008) - [c5]Hubie Chen, Omer Giménez:
Causal Graphs and Structurally Restricted Planning. ICAPS 2008: 36-43 - [c4]Omer Giménez, Anders Jonsson:
In Search of the Tractability Boundary of Planning Problems. ICAPS 2008: 99-106 - [i2]Omer Giménez:
On-the-fly Macros. CoRR abs/0810.1186 (2008) - 2007
- [j5]Joseph E. Bonin
Multi-Path Matroids. Comb. Probab. Comput. 16(2): 193-217 (2007) - [j4]Manuel Bodirsky
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. Electron. Notes Discret. Math. 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. Comb. Probab. Comput. 15(3): 385-395 (2006) - [j1]Omer Giménez, Petr Hlinený
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. SIAM J. Discret. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: