default search action
Omid Amini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i11]Nader Zare, Omid Amini, Aref Sayareh, Mahtab Sarvmaili, Arad Firouzkouhi, Stan Matwin, Amílcar Soares:
Improving Dribbling, Passing, and Marking Actions in Soccer Simulation 2D Games Using Machine Learning. CoRR abs/2401.03406 (2024) - [i10]Nader Zare, Mahtab Sarvmaili, Aref Sayareh, Omid Amini, Stan Matwin, Amílcar Soares:
Engineering Features to Improve Pass Prediction in Soccer Simulation 2D Games. CoRR abs/2401.03410 (2024) - 2023
- [i9]Aref Sayareh, Nader Zare, Omid Amini, Arad Firouzkouhi, Mahtab Sarvmaili, Stan Matwin:
Observation Denoising in CYRUS Soccer Simulation 2D Team For RoboCup 2023. CoRR abs/2305.19283 (2023) - [i8]Nader Zare, Aref Sayareh, Omid Amini, Mahtab Sarvmaili, Arad Firouzkouhi, Stan Matwin, Amílcar Soares:
Pyrus Base: An Open Source Python Framework for the RoboCup 2D Soccer Simulation. CoRR abs/2307.16875 (2023) - 2022
- [c11]Nader Zare, Omid Amini, Aref Sayareh, Mahtab Sarvmaili, Arad Firouzkouhi, Saba Ramezani Rad, Stan Matwin
, Amílcar Soares:
Cyrus2D Base: Source Code Base for RoboCup 2D Soccer Simulation League. RoboCup 2022: 140-151 - [i7]Nader Zare, Arad Firouzkouhi, Omid Amini, Mahtab Sarvmaili, Aref Sayareh, Saba Ramezani Rad, Stan Matwin, Amílcar Soares:
CYRUS Soccer Simulation 2D Team Description Paper 2022. CoRR abs/2205.10953 (2022) - [i6]Nader Zare, Aref Sayareh, Mahtab Sarvmaili, Omid Amini, Amílcar Soares, Stan Matwin:
CYRUS Soccer Simulation 2D Team Description Paper 2021. CoRR abs/2206.02310 (2022) - [i5]Nader Zare, Omid Amini, Aref Sayareh, Mahtab Sarvmaili, Arad Firouzkouhi, Saba Ramezani Rad, Stan Matwin, Amílcar Soares:
Cyrus2D base: Source Code Base for RoboCup 2D Soccer Simulation League. CoRR abs/2211.08585 (2022) - 2021
- [c10]Nader Zare, Mahtab Sarvmaili, Aref Sayareh, Omid Amini, Stan Matwin
Engineering Features to Improve Pass Prediction in Soccer Simulation 2D Games. RoboCup 2021: 140-152 - [c9]Nader Zare, Omid Amini, Aref Sayareh, Mahtab Sarvmaili, Arad Firouzkouhi, Stan Matwin
Improving Dribbling, Passing, and Marking Actions in Soccer Simulation 2D Games Using Machine Learning. RoboCup 2021: 340-351
2010 – 2019
- 2015
- [j16]Omid Amini, David Coudert
Non-deterministic graph searching in trees. Theor. Comput. Sci. 580: 101-121 (2015) - 2013
- [j15]Omid Amini, Louis Esperet
A unified approach to distance-two colouring of graphs on surfaces. Comb. 33(3): 253-296 (2013) - [j14]Omid Amini, Jean-Daniel Boissonnat, Pooran Memari
Geometric Tomography with Topological Guarantees. Discret. Comput. Geom. 50(4): 821-856 (2013) - 2012
- [j13]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau
On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. 160(12): 1661-1679 (2012) - [j12]Omid Amini, Ignasi Sau
Parameterized complexity of finding small degree-constrained subgraphs. J. Discrete Algorithms 10: 70-83 (2012) - [j11]Omid Amini, Fedor V. Fomin
Counting Subgraphs via Homomorphisms. SIAM J. Discret. Math. 26(2): 695-717 (2012) - 2011
- [j10]Omid Amini, Fedor V. Fomin
Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. 77(6): 1159-1171 (2011) - [j9]Omid Amini, Simon Griffiths, Florian Huc:
Subgraphs of Weakly Quasi-Random Oriented Graphs. SIAM J. Discret. Math. 25(1): 234-259 (2011) - 2010
- [j8]Omid Amini, Madhusudan Manjunath:
Riemann-Roch for Sub-Lattices of the Root Lattice An. Electron. J. Comb. 17(1) (2010) - [j7]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. Comb. Probab. Comput. 19(2): 161-182 (2010) - [j6]Omid Amini, Frédéric Giroire, Stéphane Pérennes, Florian Huc:
Minimal selectors and fault tolerant networks. Networks 55(4): 326-340 (2010) - [c8]Omid Amini, Jean-Daniel Boissonnat, Pooran Memari:
Geometric tomography with topological guarantees. SCG 2010: 287-296 - [i4]Omid Amini, Jean-Daniel Boissonnat, Pooran Memari:
Geometric Tomography With Topological Guarantees. CoRR abs/1007.2452 (2010)
2000 – 2009
- 2009
- [j5]Omid Amini, Frédéric Mazoit
Submodular partition functions. Discret. Math. 309(20): 6000-6008 (2009) - [j4]Omid Amini, Florian Huc, Stéphane Pérennes:
On the Path-Width of Planar Graphs. SIAM J. Discret. Math. 23(3): 1311-1316 (2009) - [j3]Omid Amini, Stéphane Pérennes, Ignasi Sau
Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38-40): 3751-3760 (2009) - [c7]Omid Amini, Fedor V. Fomin
Counting Subgraphs via Homomorphisms. ICALP (1) 2009: 71-82 - [c6]Omid Amini, Louis Esperet
A unified approach to distance-two colouring of planar graphs. SODA 2009: 273-282 - 2008
- [j2]Omid Amini, Simon Griffiths, Florian Huc:
4-cycles in mixing digraphs. Electron. Notes Discret. Math. 30: 63-68 (2008) - [j1]Omid Amini, Bruce A. Reed:
List Colouring Constants of Triangle Free Graphs. Electron. Notes Discret. Math. 30: 135-140 (2008) - [c5]Omid Amini, Fedor V. Fomin, Saket Saurabh:
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS 2008: 1-12 - [c4]Omid Amini, Ignasi Sau
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC 2008: 13-29 - [c3]Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. SWAT 2008: 41-52 - [c2]Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42 - [i3]Omid Amini, Fedor V. Fomin, Saket Saurabh:
Parameterized Algorithms for Partial Cover Problems. CoRR abs/0802.1722 (2008) - 2007
- [c1]Omid Amini, Stéphane Pérennes, Ignasi Sau:
Hardness and Approximation of Traffic Grooming. ISAAC 2007: 561-573 - [i2]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. CoRR abs/0705.0315 (2007) - [i1]Omid Amini, Louis Esperet, Jan van den Heuvel:
Frugal Colouring of Graphs. CoRR abs/0705.0422 (2007)
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-08-05 20:25 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: