| 2012 |
|---|
| 20 | Linkless and Flat Embeddings in 3-Space. Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar. Discrete & Computational Geometry (47): 731-755 (2012). Web SearchBibTeXDownload |
| 2011 |
|---|
| 19 | Toughness of Ka,t-Minor-Free Graphs. Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota. Electr. J. Comb. (18) (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 18 | Finding one tight cycle. Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload |
| 17 | Approximation algorithms via contraction decomposition. Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar. Combinatorica (30): 533-552 (2010). Web SearchBibTeXDownload |
| 16 | Star Coloring and Acyclic Coloring of Locally Planar Graphs. Ken-ichi Kawarabayashi, Bojan Mohar. SIAM J. Discrete Math. (24): 56-71 (2010). Web SearchBibTeXDownload |
| 15 | Linkless and flat embeddings in 3-space and the unknot problem. Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar. Symposium on Computational Geometry 2010, 97-106. Web SearchBibTeXDownload |
| 2009 |
|---|
| 14 | Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]. Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar. J. Comb. Theory, Ser. B (99): 323 (2009). Web SearchBibTeXDownload |
| 13 | Linear connectivity forces large complete bipartite minors. Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar. J. Comb. Theory, Ser. B (99): 557-582 (2009). Web SearchBibTeXDownload |
| 12 | List-color-critical graphs on a fixed surface. Ken-ichi Kawarabayashi, Bojan Mohar. SODA 2009, 1156-1165. Web SearchBibTeXDownload |
| 2008 |
|---|
| 11 | A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed. FOCS 2008, 771-780. Web SearchBibTeXDownload |
| 10 | Locally planar graphs are 5-choosable. Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar. J. Comb. Theory, Ser. B (98): 1215-1232 (2008). Web SearchBibTeXDownload |
| 9 | Finding one tight cycle. Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar. SODA 2008, 527-531. Web SearchBibTeXDownload |
| 8 | Graph and map isomorphism and all polyhedral embeddings in linear time. Ken-ichi Kawarabayashi, Bojan Mohar. STOC 2008, 471-480. Web SearchBibTeXDownload |
| 7 | Improved upper bounds on the crossing number. Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood. Symposium on Computational Geometry 2008, 375-384. Web SearchBibTeXDownload |
| 2007 |
|---|
| 6 | Some Recent Progress and Applications in Graph Minor Theory. Ken-ichi Kawarabayashi, Bojan Mohar. Graphs and Combinatorics (23): 1-46 (2007). Web SearchBibTeXDownload |
| 5 | A relaxed Hadwiger's Conjecture for list colorings. Ken-ichi Kawarabayashi, Bojan Mohar. J. Comb. Theory, Ser. B (97): 647-651 (2007). Web SearchBibTeXDownload |
| 4 | Approximation algorithms via contraction decomposition. Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar. SODA 2007, 278-287. Web SearchBibTeXDownload |
| 2006 |
|---|
| 3 | Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. Ken-ichi Kawarabayashi, Bojan Mohar. STOC 2006, 401-416. Web SearchBibTeXDownload |
| 2003 |
|---|
| 2 | Acyclic Homomorphisms and Circular Colorings of Digraphs. Tomás Feder, Pavol Hell, Bojan Mohar. SIAM J. Discrete Math. (17): 161-169 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 1 | The Chromatic Number Of Graph Powers. Noga Alon, Bojan Mohar. Combinatorics, Probability & Computing (11): 1-10 (2002). Web SearchBibTeXDownload |
