Omid Amini

According to our database1, Omid Amini authored at least 30 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Pyrus Base: An Open Source Python Framework for the RoboCup 2D Soccer Simulation.
CoRR, 2023

Observation Denoising in CYRUS Soccer Simulation 2D Team For RoboCup 2023.
CoRR, 2023

2022
CYRUS Soccer Simulation 2D Team Description Paper 2021.
CoRR, 2022

CYRUS Soccer Simulation 2D Team Description Paper 2022.
CoRR, 2022

Cyrus2D Base: Source Code Base for RoboCup 2D Soccer Simulation League.
Proceedings of the RoboCup 2022:, 2022

2021
Engineering Features to Improve Pass Prediction in Soccer Simulation 2D Games.
Proceedings of the RoboCup 2021: Robot World Cup XXIV, 2021

Improving Dribbling, Passing, and Marking Actions in Soccer Simulation 2D Games Using Machine Learning.
Proceedings of the RoboCup 2021: Robot World Cup XXIV, 2021

2015
Non-deterministic graph searching in trees.
Theor. Comput. Sci., 2015

2013
Geometric Tomography with Topological Guarantees.
Discret. Comput. Geom., 2013

A unified approach to distance-two colouring of graphs on surfaces.
Comb., 2013

2012
Counting Subgraphs via Homomorphisms.
SIAM J. Discret. Math., 2012

Parameterized complexity of finding small degree-constrained subgraphs.
J. Discrete Algorithms, 2012

On the approximability of some degree-constrained subgraph problems.
Discret. Appl. Math., 2012

2011
Subgraphs of Weakly Quasi-Random Oriented Graphs.
SIAM J. Discret. Math., 2011

Implicit branching and parameterized partial cover problems.
J. Comput. Syst. Sci., 2011

2010
Minimal selectors and fault tolerant networks.
Networks, 2010

WDM and Directed Star Arboricity.
Comb. Probab. Comput., 2010

Riemann-Roch for Sub-Lattices of the Root Lattice <i>A<sub>n</sub></i>.
Electron. J. Comb., 2010

2009
Hardness and approximation of traffic grooming.
Theor. Comput. Sci., 2009

On the Path-Width of Planar Graphs.
SIAM J. Discret. Math., 2009

Submodular partition functions.
Discret. Math., 2009

A unified approach to distance-two colouring of planar graphs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
List Colouring Constants of Triangle Free Graphs.
Electron. Notes Discret. Math., 2008

4-cycles in mixing digraphs.
Electron. Notes Discret. Math., 2008

Parameterized Algorithms for Partial Cover Problems
CoRR, 2008

Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Guarding Art Galleries: The Extra Cost for Sculptures Is Linear.
Proceedings of the Algorithm Theory, 2008

Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007
Frugal Colouring of Graphs
CoRR, 2007


  Loading...