Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Omer Giménez
@article{DBLP:journals/tlt/PetitRCCDGMMRRP19,
author = {Jordi Petit and
Salvador Roura and
Josep Carmona and
Jordi Cortadella and
Jordi Duch and
Omer Gim{\'{e}}nez and
Anaga Mani and
Jan Mas and
Enric Rodr{\'{\i}}guez{-}Carbonell and
Enric Rubio and
Enric de San Pedro and
Divya Venkataramani},
title = {Corrections to "Jutge.org: Characteristics and Experiences"},
journal = {{IEEE} Trans. Learn. Technol.},
volume = {12},
number = {2},
pages = {290},
year = {2019},
url = {https://doi.org/10.1109/TLT.2019.2902762},
doi = {10.1109/TLT.2019.2902762},
timestamp = {Thu, 09 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tlt/PetitRCCDGMMRRP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tlt/PetitRCCDGMMRRP18,
author = {Jordi Petit and
Salvador Roura and
Josep Carmona and
Jordi Cortadella and
Jordi Duch and
Omer Gim{\'{e}}nez and
Anaga Mani and
Jan Mas and
Enric Rodr{\'{\i}}guez{-}Carbonell and
Enric Rubio and
Enric de San Pedro and
Divya Venkataramani},
title = {Jutge.org: Characteristics and Experiences},
journal = {{IEEE} Trans. Learn. Technol.},
volume = {11},
number = {3},
pages = {321--333},
year = {2018},
url = {https://doi.org/10.1109/TLT.2017.2723389},
doi = {10.1109/TLT.2017.2723389},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tlt/PetitRCCDGMMRRP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GimenezMN16,
author = {Omer Gim{\'{e}}nez and
Dieter Mitsche and
Marc Noy},
title = {Maximum degree in minor-closed classes of graphs},
journal = {Eur. J. Comb.},
volume = {55},
pages = {41--61},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2016.02.001},
doi = {10.1016/J.EJC.2016.02.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GimenezMN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ChapuyFGN15,
author = {Guillaume Chapuy and
{\'{E}}ric Fusy and
Omer Gim{\'{e}}nez and
Marc Noy},
title = {On the Diameter of Random Planar Graphs},
journal = {Comb. Probab. Comput.},
volume = {24},
number = {1},
pages = {145--178},
year = {2015},
url = {https://doi.org/10.1017/S0963548314000467},
doi = {10.1017/S0963548314000467},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ChapuyFGN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GimenezJ14,
author = {Omer Gim{\'{e}}nez and
Anders Jonsson},
title = {Planning over Chain Causal Graphs for Variables with Domains of Size
5 Is NP-Hard},
journal = {CoRR},
volume = {abs/1401.3467},
year = {2014},
url = {http://arxiv.org/abs/1401.3467},
eprinttype = {arXiv},
eprint = {1401.3467},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GimenezJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GodoyG13,
author = {Guillem Godoy and
Omer Gim{\'{e}}nez},
title = {The {HOM} problem is decidable},
journal = {J. {ACM}},
volume = {60},
number = {4},
pages = {23:1--23:44},
year = {2013},
url = {https://doi.org/10.1145/2508028.2501600},
doi = {10.1145/2508028.2501600},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GodoyG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GimenezNR13,
author = {Omer Gim{\'{e}}nez and
Marc Noy and
Juan Jos{\'{e}} Ru{\'{e}}},
title = {Graph classes with given 3-connected components: Asymptotic enumeration
and random graphs},
journal = {Random Struct. Algorithms},
volume = {42},
number = {4},
pages = {438--479},
year = {2013},
url = {https://doi.org/10.1002/rsa.20421},
doi = {10.1002/RSA.20421},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GimenezNR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/GimenezJ12,
author = {Omer Gim{\'{e}}nez and
Anders Jonsson},
title = {The influence of k-dependence on the complexity of planning},
journal = {Artif. Intell.},
volume = {177-179},
pages = {25--45},
year = {2012},
url = {https://doi.org/10.1016/j.artint.2011.12.002},
doi = {10.1016/J.ARTINT.2011.12.002},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/GimenezJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BernardiG12,
author = {Olivier Bernardi and
Omer Gim{\'{e}}nez},
title = {A Linear Algorithm for the Random Sampling from Regular Languages},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {130--145},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9446-5},
doi = {10.1007/S00453-010-9446-5},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BernardiG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcse/PetitGR12,
author = {Jordi Petit and
Omer Gim{\'{e}}nez and
Salvador Roura},
editor = {Laurie A. Smith King and
David R. Musicant and
Tracy Camp and
Paul T. Tymann},
title = {Jutge.org: an educational programming judge},
booktitle = {Proceedings of the 43rd {ACM} technical symposium on Computer science
education, {SIGCSE} 2012, Raleigh, NC, USA, February 29 - March 3,
2012},
pages = {445--450},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2157136.2157267},
doi = {10.1145/2157136.2157267},
timestamp = {Wed, 10 Mar 2021 13:17:16 +0100},
biburl = {https://dblp.org/rec/conf/sigcse/PetitGR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DrmotaGNPS12,
author = {Michael Drmota and
Omer Gim{\'{e}}nez and
Marc Noy and
Konstantinos Panagiotou and
Angelika Steger},
editor = {Yuval Rabani},
title = {The maximum degree of random planar graphs},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {281--287},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.26},
doi = {10.1137/1.9781611973099.26},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/DrmotaGNPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DrmotaGN11,
author = {Michael Drmota and
Omer Gim{\'{e}}nez and
Marc Noy},
title = {The Maximum Degree of Series-Parallel Graphs},
journal = {Comb. Probab. Comput.},
volume = {20},
number = {4},
pages = {529--570},
year = {2011},
url = {https://doi.org/10.1017/S0963548311000198},
doi = {10.1017/S0963548311000198},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DrmotaGN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ChapuyFGMN11,
author = {Guillaume Chapuy and
{\'{E}}ric Fusy and
Omer Gim{\'{e}}nez and
Bojan Mohar and
Marc Noy},
title = {Asymptotic enumeration and limit laws for graphs of fixed genus},
journal = {J. Comb. Theory, Ser. {A}},
volume = {118},
number = {3},
pages = {748--777},
year = {2011},
url = {https://doi.org/10.1016/j.jcta.2010.11.014},
doi = {10.1016/J.JCTA.2010.11.014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ChapuyFGMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DrmotaGN11,
author = {Michael Drmota and
Omer Gim{\'{e}}nez and
Marc Noy},
title = {Degree distribution in random planar graphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {118},
number = {7},
pages = {2102--2130},
year = {2011},
url = {https://doi.org/10.1016/j.jcta.2011.04.010},
doi = {10.1016/J.JCTA.2011.04.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/DrmotaGN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GimenezGM11,
author = {Omer Gim{\'{e}}nez and
Guillem Godoy and
Sebastian Maneth},
title = {Deciding Regularity of the Set of Instances of a Set of Terms with
Regular Constraints is EXPTIME-Complete},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {2},
pages = {446--464},
year = {2011},
url = {https://doi.org/10.1137/090777669},
doi = {10.1137/090777669},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GimenezGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0056,
author = {Omer Gim{\'{e}}nez and
Anders Jonsson},
title = {The Complexity of Planning Problems With Simple Causal Graphs},
journal = {CoRR},
volume = {abs/1111.0056},
year = {2011},
url = {http://arxiv.org/abs/1111.0056},
eprinttype = {arXiv},
eprint = {1111.0056},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-0056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChenG10,
author = {Hubie Chen and
Omer Gim{\'{e}}nez},
title = {Causal graphs and structurally restricted planning},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {7},
pages = {579--592},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2009.10.013},
doi = {10.1016/J.JCSS.2009.10.013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChenG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrmotaGN10,
author = {Michael Drmota and
Omer Gim{\'{e}}nez and
Marc Noy},
title = {Vertices of given degree in series-parallel graphs},
journal = {Random Struct. Algorithms},
volume = {36},
number = {3},
pages = {273--314},
year = {2010},
url = {https://doi.org/10.1002/rsa.20290},
doi = {10.1002/RSA.20290},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DrmotaGN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GodoyGRA10,
author = {Guillem Godoy and
Omer Gim{\'{e}}nez and
Lander Ramos and
Carme {\`{A}}lvarez},
editor = {Leonard J. Schulman},
title = {The {HOM} problem is decidable},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {485--494},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806757},
doi = {10.1145/1806689.1806757},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GodoyGRA10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/GimenezJ09,
author = {Omer Gim{\'{e}}nez and
Anders Jonsson},
title = {Planning over Chain Causal Graphs for Variables with Domains of Size
5 Is NP-Hard},
journal = {J. Artif. Intell. Res.},
volume = {34},
pages = {675--706},
year = {2009},
url = {https://doi.org/10.1613/jair.2742},
doi = {10.1613/JAIR.2742},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/GimenezJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/GimenezJ09,
author = {Omer Gim{\'{e}}nez and
Anders Jonsson},
editor = {Alfonso Gerevini and
Adele E. Howe and
Amedeo Cesta and
Ioannis Refanidis},
title = {The Influence of \emph{k-}Dependence on the Complexity of Planning},
booktitle = {Proceedings of the 19th International Conference on Automated Planning
and Scheduling, {ICAPS} 2009, Thessaloniki, Greece, September 19-23,
2009},
publisher = {{AAAI}},
year = {2009},
url = {http://aaai.org/ocs/index.php/ICAPS/ICAPS09/paper/view/704},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aips/GimenezJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wollic/ChenG09,
author = {Hubie Chen and
Omer Gim{\'{e}}nez},
editor = {Hiroakira Ono and
Makoto Kanazawa and
Ruy J. G. B. de Queiroz},
title = {On-the-Fly Macros},
booktitle = {Logic, Language, Information and Computation, 16th International Workshop,
WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5514},
pages = {155--169},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02261-6\_13},
doi = {10.1007/978-3-642-02261-6\_13},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wollic/ChenG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-3674,
author = {Omer Gim{\'{e}}nez and
Guillem Godoy and
Sebastian Maneth},
title = {Deciding Regularity of the Set of Instances of a Set of Terms with
Regular Constraints is EXPTIME-Complete},
journal = {CoRR},
volume = {abs/0911.3674},
year = {2009},
url = {http://arxiv.org/abs/0911.3674},
eprinttype = {arXiv},
eprint = {0911.3674},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-3674.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GerkeGNW08,
author = {Stefanie Gerke and
Omer Gim{\'{e}}nez and
Marc Noy and
Andreas Wei{\ss}l},
title = {The Number of Graphs Not Containing K\({}_{\mbox{3, 3}}\) as a Minor},
journal = {Electron. J. Comb.},
volume = {15},
number = {1},
year = {2008},
url = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r114.html},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GerkeGNW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/GimenezJ08,
author = {Omer Gim{\'{e}}nez and
Anders Jonsson},
title = {The Complexity of Planning Problems With Simple Causal Graphs},
journal = {J. Artif. Intell. Res.},
volume = {31},
pages = {319--351},
year = {2008},
url = {https://doi.org/10.1613/jair.2432},
doi = {10.1613/JAIR.2432},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/GimenezJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/ChenG08,
author = {Hubie Chen and
Omer Gim{\'{e}}nez},
editor = {Jussi Rintanen and
Bernhard Nebel and
J. Christopher Beck and
Eric A. Hansen},
title = {Causal Graphs and Structurally Restricted Planning},
booktitle = {Proceedings of the Eighteenth International Conference on Automated
Planning and Scheduling, {ICAPS} 2008, Sydney, Australia, September
14-18, 2008},
pages = {36--43},
publisher = {{AAAI}},
year = {2008},
url = {http://www.aaai.org/Library/ICAPS/2008/icaps08-005.php},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aips/ChenG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/GimenezJ08,
author = {Omer Gim{\'{e}}nez and
Anders Jonsson},
editor = {Jussi Rintanen and
Bernhard Nebel and
J. Christopher Beck and
Eric A. Hansen},
title = {In Search of the Tractability Boundary of Planning Problems},
booktitle = {Proceedings of the Eighteenth International Conference on Automated
Planning and Scheduling, {ICAPS} 2008, Sydney, Australia, September
14-18, 2008},
pages = {99--106},
publisher = {{AAAI}},
year = {2008},
url = {http://www.aaai.org/Library/ICAPS/2008/icaps08-013.php},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aips/GimenezJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0810-1186,
author = {Omer Gim{\'{e}}nez},
title = {On-the-fly Macros},
journal = {CoRR},
volume = {abs/0810.1186},
year = {2008},
url = {http://arxiv.org/abs/0810.1186},
eprinttype = {arXiv},
eprint = {0810.1186},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0810-1186.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BoninG07,
author = {Joseph E. Bonin and
Omer Gim{\'{e}}nez},
title = {Multi-Path Matroids},
journal = {Comb. Probab. Comput.},
volume = {16},
number = {2},
pages = {193--217},
year = {2007},
url = {https://doi.org/10.1017/S0963548306007942},
doi = {10.1017/S0963548306007942},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BoninG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BodirskyGKN07,
author = {Manuel Bodirsky and
Omer Gim{\'{e}}nez and
Mihyun Kang and
Marc Noy},
title = {Enumeration and limit laws for series-parallel graphs},
journal = {Eur. J. Comb.},
volume = {28},
number = {8},
pages = {2091--2105},
year = {2007},
url = {https://doi.org/10.1016/j.ejc.2007.04.011},
doi = {10.1016/J.EJC.2007.04.011},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BodirskyGKN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GimenezNR07,
author = {Omer Gim{\'{e}}nez and
Marc Noy and
Juan Jos{\'{e}} Ru{\'{e}}},
title = {Graph classes with given 3-connected components: asymptotic counting
and critical phenomena},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {521--529},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.080},
doi = {10.1016/J.ENDM.2007.07.080},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GimenezNR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/ChenG07,
author = {Hubie Chen and
Omer Gim{\'{e}}nez},
editor = {Mark S. Boddy and
Maria Fox and
Sylvie Thi{\'{e}}baux},
title = {Act Local, Think Global: Width Notions for Tractable Planning},
booktitle = {Proceedings of the Seventeenth International Conference on Automated
Planning and Scheduling, {ICAPS} 2007, Providence, Rhode Island, USA,
September 22-26, 2007},
pages = {73--80},
publisher = {{AAAI}},
year = {2007},
url = {http://www.aaai.org/Library/ICAPS/2007/icaps07-010.php},
timestamp = {Tue, 02 Nov 2021 15:59:05 +0100},
biburl = {https://dblp.org/rec/conf/aips/ChenG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/GimenezJ07,
author = {Omer Gim{\'{e}}nez and
Anders Jonsson},
editor = {Mark S. Boddy and
Maria Fox and
Sylvie Thi{\'{e}}baux},
title = {On the Hardness of Planning Problems with Simple Causal Graphs},
booktitle = {Proceedings of the Seventeenth International Conference on Automated
Planning and Scheduling, {ICAPS} 2007, Providence, Rhode Island, USA,
September 22-26, 2007},
pages = {152--159},
publisher = {{AAAI}},
year = {2007},
url = {http://www.aaai.org/Library/ICAPS/2007/icaps07-020.php},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aips/GimenezJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GimenezN06,
author = {Omer Gim{\'{e}}nez and
Marc Noy},
title = {On the Complexity of Computing the Tutte Polynomial of Bicircular
Matroids},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {3},
pages = {385--395},
year = {2006},
url = {https://doi.org/10.1017/S0963548305007327},
doi = {10.1017/S0963548305007327},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GimenezN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GimenezHN06,
author = {Omer Gim{\'{e}}nez and
Petr Hlinen{\'{y}} and
Marc Noy},
title = {Computing the Tutte Polynomial on Graphs of Bounded Clique-Width},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {4},
pages = {932--946},
year = {2006},
url = {https://doi.org/10.1137/050645208},
doi = {10.1137/050645208},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GimenezHN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0610095,
author = {Omer Gim{\'{e}}nez},
title = {Solving planning domains with polytree causal graphs is NP-complete},
journal = {CoRR},
volume = {abs/cs/0610095},
year = {2006},
url = {http://arxiv.org/abs/cs/0610095},
eprinttype = {arXiv},
eprint = {cs/0610095},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0610095.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GimenezHN05,
author = {Omer Gim{\'{e}}nez and
Petr Hlinen{\'{y}} and
Marc Noy},
editor = {Dieter Kratsch},
title = {Computing the Tutte Polynomial on Graphs of Bounded Clique-Width},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {59--68},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_6},
doi = {10.1007/11604686\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GimenezHN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-01-25 19:54 CET 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:
