Omer Giménez

Available identifiers

zbMath Open gimenez.omerMaRDI QIDQ268258

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5743399	2019-05-10	Paper
On the Diameter of Random Planar Graphs	2017-10-04	Paper
On the diameter of random planar graphs	2017-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q2959860	2017-02-10	Paper
Maximum degree in minor-closed classes of graphs	2016-04-14	Paper
The maximum degree of random planar graphs	2014-11-18	Paper
The HOM problem is decidable	2014-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q5395720	2014-02-17	Paper
Graph classes with given 3-connected components: asymptotic enumeration and random graphs	2013-07-26	Paper
The influence of \(k\)-dependence on the complexity of planning	2012-05-23	Paper
A linear algorithm for the random sampling from regular languages	2012-04-26	Paper
The Maximum Degree of Series-Parallel Graphs	2011-08-16	Paper
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete	2011-07-29	Paper
Degree distribution in random planar graphs	2011-07-07	Paper
Asymptotic enumeration and limit laws for graphs of fixed genus	2011-04-11	Paper
Asymptotic enumeration and limit laws of planar graphs	2011-03-02	Paper
Vertices of given degree in series-parallel graphs	2010-11-10	Paper
The maximum degree of planar graphs I. Series-parallel graphs	2010-08-31	Paper
Causal graphs and structurally restricted planning	2010-08-18	Paper
On the number of series parallel and outerplanar graphs	2010-07-30	Paper
Counting planar graphs and related families of graphs	2010-01-13	Paper
On-the-Fly Macros	2009-07-02	Paper
Asymptotic enumeration of series-parallel graphs	2009-05-22	Paper
The complexity of planning problems with simple causal graphs	2009-04-28	Paper
Planning over chain causal graphs for variables with domains of size 5 is NP-hard	2009-04-28	Paper
The number of graphs not containing \(K_{3,3}\) as a minor	2009-04-07	Paper
Graph classes with given 3-connected components: asymptotic counting and critical phenomena	2008-06-05	Paper
Enumeration and limit laws for series-parallel graphs	2007-11-21	Paper
Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width	2007-11-16	Paper
Multi-Path Matroids	2007-07-30	Paper
Graph-Theoretic Concepts in Computer Science	2006-11-01	Paper
The number of planar graphs and properties of random planar graphs	2006-08-29	Paper
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids	2006-07-06	Paper
On the number of bases of bicircular matroids	2005-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q3154669	2005-01-14	Paper

Research outcomes over time

This page was built for person: Omer Giménez