| 2026 | SODA | Three-edge-coloring (Tait coloring) cubic graphs and nowhere-zero 4-flow for graphs on the torus. | Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe |
| 2024 | FOCS | Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem. | Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe |
| 2024 | ISAAC | Exact Algorithms for Clustered Planarity with Linear Saturators. | Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi |
| 2024 | SODA | Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. | Jesse Campion Loth, Kevin Halasz, Toms Masark, Bojan Mohar, Robert Smal |
| 2021 | ICALP | Automorphisms and Isomorphisms of Maps in Linear Time. | Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman |
| 2020 | GD | Limiting Crossing Numbers for Geodesic Drawings on the Sphere. | Marthe Bonamy, Bojan Mohar, Alexandra Wesolek |
| 2018 | FOCS | Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs. | Bojan Mohar, Yifan Jing |
| 2018 | SODA | A submodular measure and approximate Gomory-Hu theorem for packing odd trails. | Ross Churchley, Bojan Mohar |
| 2017 | STACS | Graphic TSP in Cubic Graphs. | Zdenek Dvork, Daniel Krl, Bojan Mohar |
| 2016 | GD | The Crossing Number of the Cone of a Graph. | Carlos A. Alfaro, Alan Arroyo, Marek Dernr, Bojan Mohar |
| 2016 | SODA | Weak duality for packing edge-disjoint odd ( | Ross Churchley, Bojan Mohar, Hehui Wu |
| 2015 | SODA | Four terminal planar Delta-Wye reducibility via rooted | Lino Demasi, Bojan Mohar |
| 2014 | ESA | Ordering without Forbidden Patterns. | Pavol Hell, Bojan Mohar, Arash Rafiey |
| 2011 | IWOCA | On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph. | Bojan Mohar, Petr Skoda |
| 2010 | MFCS | Do We Really Understand the Crossing Numbers? | Bojan Mohar |
| 2009 | SODA | List-color-critical graphs on a fixed surface. | Ken-ichi Kawarabayashi, Bojan Mohar |
| 2008 | FOCS | 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 |
| 2008 | GD | Crossing and Weighted Crossing Number of Near-Planar Graphs. | Sergio Cabello, Bojan Mohar |
| 2008 | GD | Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. | Vladimir P. Korzhik, Bojan Mohar |
| 2008 | SODA | Finding one tight cycle. | Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar |
| 2008 | STOC | Graph and map isomorphism and all polyhedral embeddings in linear time. | Ken-ichi Kawarabayashi, Bojan Mohar |
| 2007 | SODA | Approximation algorithms via contraction decomposition. | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar |
| 2006 | STOC | Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. | Ken-ichi Kawarabayashi, Bojan Mohar |
| 2005 | ESA | Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. | Sergio Cabello, Bojan Mohar |
| 1999 | GD | Drawing Graphs in the Hyperbolic Plane. | Bojan Mohar |
| 1996 | STOC | Embedding Graphs in an Arbitrary Surface in Linear Time. | Bojan Mohar |
| 1995 | IPCO | Embedding Graphs in the Torus in Linear Time. | Martin Juvan, Joze Marincek, Bojan Mohar |
| 1994 | GD | A Flow Approach to Upward Drawings of Toroidal Maps. | Bojan Mohar, Pierre Rosenstiehl |
| 1993 | IPCO | A spectral approach to bandwidth and separator problems in graphs. | Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl |