|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11 occurrences of 9 keywords
|
|
|
|
|
Results
Found 23 publication records. Showing 23 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Omid Amini, Ignasi Sau, Saket Saurabh |
Parameterized complexity of finding small degree-constrained subgraphs.  |
J. Discrete Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Simon Griffiths, Florian Huc |
Subgraphs of Weakly Quasi-Random Oriented Graphs. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Fedor V. Fomin, Saket Saurabh |
Implicit branching and parameterized partial cover problems. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Frédéric Giroire, Stéphane Pérennes, Florian Huc |
Minimal selectors and fault tolerant networks. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Madhusudan Manjunath |
Riemann-Roch for Sub-Lattices of the Root Lattice An. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé |
WDM and Directed Star Arboricity. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Jean-Daniel Boissonnat, Pooran Memari |
Geometric Tomography With Topological Guarantees |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Omid Amini, Jean-Daniel Boissonnat, Pooran Memari |
Geometric tomography with topological guarantees. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
homotopy theory, reconstruction from cross sections, thopological guarantees |
| 1 | Omid Amini, Stéphane Pérennes, Ignasi Sau |
Hardness and approximation of traffic grooming. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé |
Submodular partition functions. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Florian Huc, Stéphane Pérennes |
On the Path-Width of Planar Graphs. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Louis Esperet, Jan van den Heuvel |
A unified approach to distance-two colouring of planar graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Fedor V. Fomin, Saket Saurabh |
Counting Subgraphs via Homomorphisms. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Bruce A. Reed |
List Colouring Constants of Triangle Free Graphs. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Simon Griffiths, Florian Huc |
4-cycles in mixing digraphs. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Fedor V. Fomin, Saket Saurabh |
Parameterized Algorithms for Partial Cover Problems |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Omid Amini, Ignasi Sau, Saket Saurabh |
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé |
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
Pseudo-triangulation, Art Gallery |
| 1 | Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh |
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS |
| 1 | Omid Amini, Fedor V. Fomin, Saket Saurabh |
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé |
WDM and Directed Star Arboricity |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Omid Amini, Louis Esperet, Jan van den Heuvel |
Frugal Colouring of Graphs |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Omid Amini, Stéphane Pérennes, Ignasi Sau |
Hardness and Approximation of Traffic Grooming. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
SONET ADM, Approximation Algorithms, Optical Networks, PTAS, inapproximability, Traffic Grooming, APX-hardness |
Displaying result #1 - #23 of 23 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")