Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Giménez, Omer
80  Ergebnisse:
Personensuche X
?
1

Maximum degree in minor-closed classes of graphs:

Giménez, Omer ; Mitsche, Dieter ; Noy, Marc
European Journal of Combinatorics.  55 (2016)  - p. 41-61 , 2016
Link: https://doi.org/10.1016/..
 
?
2

On the Diameter of Random Planar Graphs:

CHAPUY, GUILLAUME ; FUSY, ÉRIC ; GIMÉNEZ, OMER.
Combinatorics, Probability and Computing.  24 (2014)  1 - p. 145-178 , 2014
Link: https://doi.org/10.1017/..
 
?
3

The HOM problem is decidable:

Godoy, Guillem ; Giménez, Omer
Journal of the ACM.  60 (2013)  4 - p. 1-44 , 2013
Link: https://doi.org/10.1145/..
 
?
4

The HOM problem is decidable:

Godoy, Guillem ; Giménez, Omer
Journal of the ACM (JACM).  60 (2013)  4 - p. 1-44 , 2013
Link: https://dl.acm.org/doi/1..
 
?
5

Graph classes with given 3‐connected components: Asymptotic..:

Giménez, Omer ; Noy, Marc ; Rué, Juanjo
Random Structures & Algorithms.  42 (2012)  4 - p. 438-479 , 2012
Link: https://doi.org/10.1002/..
 
?
6

The maximum degree of random planar graphs:

, In: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms,
Drmota, Michael ; Giménez, Omer ; Noy, Marc.. - p. 281-287 , 2012
Link: https://dl.acm.org/doi/1..
 
?
7

The influence of k-dependence on the complexity of planning:

Giménez, Omer ; Jonsson, Anders
Artificial Intelligence.  177-179 (2012)  - p. 25-45 , 2012
Link: https://doi.org/10.1016/..
 
?
8

Jutge.org : an educational programming judge:

, In: Proceedings of the 43rd ACM technical symposium on Computer Science Education,
Petit, Jordi ; Giménez, Omer ; Roura, Salvador - p. 445-450 , 2012
Link: https://dl.acm.org/doi/1..
 
?
9

Asymptotic enumeration and limit laws for graphs of fixed g..:

Chapuy, Guillaume ; Fusy, Éric ; Giménez, Omer..
Journal of Combinatorial Theory, Series A.  118 (2011)  3 - p. 748-777 , 2011
Link: https://doi.org/10.1016/..
 
?
10

Deciding Regularity of the Set of Instances of a Set of Ter..:

Giménez, Omer ; Godoy, Guillem ; Maneth, Sebastian
SIAM Journal on Computing.  40 (2011)  2 - p. 446-464 , 2011
Link: https://doi.org/10.1137/..
 
?
11

Degree distribution in random planar graphs:

Drmota, Michael ; Giménez, Omer ; Noy, Marc
Journal of Combinatorial Theory, Series A.  118 (2011)  7 - p. 2102-2130 , 2011
Link: https://doi.org/10.1016/..
 
?
12

The Maximum Degree of Series-Parallel Graphs:

DRMOTA, MICHAEL ; GIMÉNEZ, OMER ; NOY, MARC
Combinatorics, Probability and Computing.  20 (2011)  4 - p. 529-570 , 2011
Link: https://doi.org/10.1017/..
 
?
13

A Linear Algorithm for the Random Sampling from Regular Lan..:

Bernardi, Olivier ; Giménez, Omer
Algorithmica.  62 (2010)  1-2 - p. 130-145 , 2010
Link: https://doi.org/10.1007/..
 
?
14

The HOM problem is decidable:

, In: Proceedings of the forty-second ACM symposium on Theory of computing,
Godoy, Guillem ; Giménez, Omer ; Ramos, Lander. - p. 485-494 , 2010
Link: https://dl.acm.org/doi/1..
 
?
15

Causal graphs and structurally restricted planning:

Chen, Hubie ; Giménez, Omer
Journal of Computer and System Sciences.  76 (2010)  7 - p. 579-592 , 2010
Link: https://doi.org/10.1016/..
 
1-15