Omid Amini

38 papers A* 1B 2C 3Journal 27Unranked 5
YearRankTypeTitle / Venue / Authors
2024 J jnl
Engineering Features to Improve Pass Prediction in Soccer Simulation 2D Games.
CoRR
Nader Zare, Mahtab Sarvmaili, Aref Sayareh, Omid Amini, Stan Matwin, Amílcar Soares
2024 J jnl
Improving Dribbling, Passing, and Marking Actions in Soccer Simulation 2D Games Using Machine Learning.
CoRR
Nader Zare, Omid Amini, Aref Sayareh, Mahtab Sarvmaili, Arad Firouzkouhi, Stan Matwin, Amílcar Soares
2023 J jnl
Observation Denoising in CYRUS Soccer Simulation 2D Team For RoboCup 2023.
CoRR
Aref Sayareh, Nader Zare, Omid Amini, Arad Firouzkouhi, Mahtab Sarvmaili, Stan Matwin
2023 J jnl
Pyrus Base: An Open Source Python Framework for the RoboCup 2D Soccer Simulation.
CoRR
Nader Zare, Aref Sayareh, Omid Amini, Mahtab Sarvmaili, Arad Firouzkouhi, Stan Matwin, Amílcar Soares
2022 J jnl
CYRUS Soccer Simulation 2D Team Description Paper 2021.
CoRR
Nader Zare, Aref Sayareh, Mahtab Sarvmaili, Omid Amini, Amílcar Soares, Stan Matwin
2022 J jnl
CYRUS Soccer Simulation 2D Team Description Paper 2022.
CoRR
Nader Zare, Arad Firouzkouhi, Omid Amini, Mahtab Sarvmaili, Aref Sayareh, Saba Ramezani Rad, Stan Matwin, Amílcar Soares
2022 C conf
Cyrus2D Base: Source Code Base for RoboCup 2D Soccer Simulation League.
RoboCup
Nader Zare, Omid Amini, Aref Sayareh, Mahtab Sarvmaili, Arad Firouzkouhi, Saba Ramezani Rad, Stan Matwin, Amílcar Soares
2022 J jnl
Cyrus2D base: Source Code Base for RoboCup 2D Soccer Simulation League.
CoRR
Nader Zare, Omid Amini, Aref Sayareh, Mahtab Sarvmaili, Arad Firouzkouhi, Saba Ramezani Rad, Stan Matwin, Amílcar Soares
2021 C conf
Engineering Features to Improve Pass Prediction in Soccer Simulation 2D Games.
RoboCup
Nader Zare, Mahtab Sarvmaili, Aref Sayareh, Omid Amini, Stan Matwin, Amílcar Soares
2021 C conf
Improving Dribbling, Passing, and Marking Actions in Soccer Simulation 2D Games Using Machine Learning.
RoboCup
Nader Zare, Omid Amini, Aref Sayareh, Mahtab Sarvmaili, Arad Firouzkouhi, Stan Matwin, Amílcar Soares
2015 J jnl
Non-deterministic graph searching in trees.
Theor. Comput. Sci.
Omid Amini, David Coudert, Nicolas Nisse
2013 J jnl
A unified approach to distance-two colouring of graphs on surfaces.
Comb.
Omid Amini, Louis Esperet, Jan van den Heuvel
2013 J jnl
Geometric Tomography with Topological Guarantees.
Discret. Comput. Geom.
Omid Amini, Jean-Daniel Boissonnat, Pooran Memari
2012 J jnl
Counting Subgraphs via Homomorphisms.
SIAM J. Discret. Math.
Omid Amini, Fedor V. Fomin, Saket Saurabh
2012 J jnl
On the approximability of some degree-constrained subgraph problems.
Discret. Appl. Math.
Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
2012 J jnl
Parameterized complexity of finding small degree-constrained subgraphs.
J. Discrete Algorithms
Omid Amini, Ignasi Sau, Saket Saurabh
2011 J jnl
Implicit branching and parameterized partial cover problems.
J. Comput. Syst. Sci.
Omid Amini, Fedor V. Fomin, Saket Saurabh
2011 J jnl
Subgraphs of Weakly Quasi-Random Oriented Graphs.
SIAM J. Discret. Math.
Omid Amini, Simon Griffiths, Florian Huc
2010 J jnl
Geometric Tomography With Topological Guarantees
CoRR
Omid Amini, Jean-Daniel Boissonnat, Pooran Memari
2010 — conf
Geometric tomography with topological guarantees.
SCG
Omid Amini, Jean-Daniel Boissonnat, Pooran Memari
2010 J jnl
Minimal selectors and fault tolerant networks.
Networks
Omid Amini, Frédéric Giroire, Stéphane Pérennes, Florian Huc
2010 J jnl
Riemann-Roch for Sub-Lattices of the Root Lattice
Electron. J. Comb.
Omid Amini, Madhusudan Manjunath
2010 J jnl
WDM and Directed Star Arboricity.
Comb. Probab. Comput.
Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé
2009 A* conf
A unified approach to distance-two colouring of planar graphs.
SODA
Omid Amini, Louis Esperet, Jan van den Heuvel
2009 — conf
Counting Subgraphs via Homomorphisms.
ICALP (1)
Omid Amini, Fedor V. Fomin, Saket Saurabh
2009 J jnl
Hardness and approximation of traffic grooming.
Theor. Comput. Sci.
Omid Amini, Stéphane Pérennes, Ignasi Sau
2009 J jnl
On the Path-Width of Planar Graphs.
SIAM J. Discret. Math.
Omid Amini, Florian Huc, Stéphane Pérennes
2009 J jnl
Submodular partition functions.
Discret. Math.
Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé
2008 J jnl
4-cycles in mixing digraphs.
Electron. Notes Discret. Math.
Omid Amini, Simon Griffiths, Florian Huc
2008 B conf
Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
WAOA
Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
2008 — conf
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear.
SWAT
Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé
2008 — conf
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract).
FSTTCS
Omid Amini, Fedor V. Fomin, Saket Saurabh
2008 J jnl
List Colouring Constants of Triangle Free Graphs.
Electron. Notes Discret. Math.
Omid Amini, Bruce A. Reed
2008 J jnl
Parameterized Algorithms for Partial Cover Problems
CoRR
Omid Amini, Fedor V. Fomin, Saket Saurabh
2008 — conf
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
IWPEC
Omid Amini, Ignasi Sau, Saket Saurabh
2007 J jnl
Frugal Colouring of Graphs
CoRR
Omid Amini, Louis Esperet, Jan van den Heuvel
2007 B conf
Hardness and Approximation of Traffic Grooming.
ISAAC
Omid Amini, Stéphane Pérennes, Ignasi Sau
2007 J jnl
WDM and Directed Star Arboricity
CoRR
Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé