|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 30 publication records. Showing 30 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Olivier Bernardi, Omer Giménez |
A Linear Algorithm for the Random Sampling from Regular Languages.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Giménez, Anders Jonsson |
The influence of k-dependence on the complexity of planning. |
Artif. Intell. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger |
The maximum degree of random planar graphs. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jordi Petit, Omer Giménez, Salvador Roura |
Jutge.org: an educational programming judge. |
SIGCSE |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Omer Giménez, Marc Noy |
Degree distribution in random planar graphs. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Omer Giménez, Marc Noy |
The Maximum Degree of Series-Parallel Graphs. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Giménez, Anders Jonsson |
The Complexity of Planning Problems With Simple Causal Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Omer Giménez, Marc Noy |
Vertices of given degree in series-parallel graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Omer Giménez |
Causal graphs and structurally restricted planning. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez |
The HOM problem is decidable. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Omer Giménez |
On-the-Fly Macros. |
WoLLIC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Giménez, Anders Jonsson |
The Influence of k-Dependence on the Complexity of Planning. |
ICAPS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl |
The Number of Graphs Not Containing K3, 3 as a Minor. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Omer Giménez |
On-the-fly Macros |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Omer Giménez, Anders Jonsson |
The Complexity of Planning Problems With Simple Causal Graphs. |
J. Artif. Intell. Res. (JAIR) |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Omer Giménez |
Causal Graphs and Structurally Restricted Planning. |
ICAPS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Omer Giménez, Anders Jonsson |
In Search of the Tractability Boundary of Planning Problems. |
ICAPS |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy |
Enumeration and limit laws for series-parallel graphs. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph E. Bonin, Omer Giménez |
Multi-Path Matroids. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Omer Giménez |
Act Local, Think Global: Width Notions for Tractable Planning. |
ICAPS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Omer Giménez, Anders Jonsson |
On the Hardness of Planning Problems with Simple Causal Graphs. |
ICAPS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Omer Giménez, Marc Noy |
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Giménez |
Solving planning domains with polytree causal graphs is NP-complete |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Omer Giménez, Petr Hlinený, Marc Noy |
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Giménez, Petr Hlinený, Marc Noy |
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. |
WG |
2005 |
DBLP DOI BibTeX RDF |
subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial |
Displaying result #1 - #30 of 30 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")