|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
238 | Ken-ichi Kawarabayashi, Bojan Mohar |
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 401-416, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring |
41 | Siamak Tazari |
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1004.3392, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
41 | Siamak Tazari |
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings, pp. 641-652, 2010, Springer, 978-3-642-15154-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Raphael Steiner |
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 155, pp. 45-51, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Raphael Steiner |
Asymptotic Equivalence of Hadwiger's Conjecture and its Odd Minor-Variant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.02302, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
27 | Ken-ichi Kawarabayashi, David R. Wood |
Cliques in Odd-Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATS ![In: Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012, pp. 133-138, 2012, Australian Computer Society, 978-1-921770-09-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
27 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pp. 329-344, 2010, SIAM, 978-0-89871-701-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta |
On the odd-minor variant of Hadwiger's conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 99(1), pp. 20-29, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #8 of 8 (100 per page; Change: )
|
|