Drago Bokal

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 15

Top Topics

Bounded Treewidth

Desirable Properties

Top Venues

Ars Math. Contemp.

Central Eur. J. Oper. Res.

Publications

Spela Kajzer, Alexander Dobler, Janja Jerebic, Martin Nöllenburg, Joachim Orthaber, Drago Bokal
Graph drawing applications in combinatorial theory of maturity models. CoRR (2024)
Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera
Properties of Large 2-Crossing-Critical Graphs. J. Graph Algorithms Appl. 26 (1) (2022)
Drago Bokal, Gunnar Brinkmann, Carol T. Zamfirescu
The connectivity of the dual. J. Graph Theory 101 (2) (2022)
Drago Bokal, Janja Jerebic
Guarding a subgraph as a tool in pursuit-evasion games. Discuss. Math. Graph Theory 42 (1) (2022)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. Comb. 42 (5) (2022)
Andreja Smole, Timotej Jagric, Drago Bokal
Principal/Two-Agent model with internal signal. Central Eur. J. Oper. Res. 29 (3) (2021)
Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera
Properties of Large 2-Crossing-Critical Graphs. CoRR (2021)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG (2019)
Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený
On Degree Properties of Crossing-Critical Families of Graphs. Electron. J. Comb. 26 (1) (2019)
Drago Bokal, Mitja Steinbacher
Phases of psychologically optimal learning experience: task-based time allocation model. Central Eur. J. Oper. Res. 27 (3) (2019)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR (2019)
Drago Bokal, Jesús Leaños
Characterizing all graphs with 2-exceptional edges. Ars Math. Contemp. 15 (2) (2018)
Drago Bokal, Bojan Mohar, Jozef Sirán
Dan Archdeacon (11 May 1954 to 18 February 2015). Ars Math. Contemp. 12 (1) (2017)
Dan Archdeacon, Drago Bokal, Tanja Gologranc
A characterization of plane Gauss paragraphs. Ars Math. Contemp. 12 (1) (2017)
Drago Bokal, Bogdan Oporowski, R. Bruce Richter, Gelasio Salazar
Characterizing 2-crossing-critical graphs. Adv. Appl. Math. 74 (2016)
Drago Bokal, Sergio Cabello, David Eppstein
Finding All Maximal Subsequences with Hereditary Properties. SoCG (2015)
Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený
On Degree Properties of Crossing-Critical Families of Graphs. Graph Drawing (2015)
Drago Bokal, Markus Chimani, Jesús Leaños
Crossing number additivity over edge cuts. Eur. J. Comb. 34 (6) (2013)
Drago Bokal, Bostjan Bresar, Janja Jerebic
A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks. Discret. Appl. Math. 160 (4-5) (2012)
Andrej Kos, Damijan Pristov, Urban Sedlar, Janez Sterle, Mojca Volk, Tomaz Vidonja, Marko Bajec, Drago Bokal, Janez Bester
Open and Scalable IoT Platform and Its Applications for Real Time Access Line Monitoring and Alarm Correlation. NEW2AN (2012)
Drago Bokal, Matt DeVos, Sandi Klavzar, Aki Mimoto, Arne Ø. Mooers
Computing quadratic entropy in evolutionary trees. Comput. Math. Appl. 62 (10) (2011)
Laurent Beaudou, Drago Bokal
On the Sharpness of Some Results Relating Cuts and Crossing Numbers. Electron. J. Comb. 17 (1) (2010)
Drago Bokal
Infinite families of crossing-critical graphs with prescribed average degree and crossing number. J. Graph Theory 65 (2) (2010)
Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrt'o
General Lower Bounds for the Minor Crossing Number of Graphs. Discret. Comput. Geom. 44 (2) (2010)
Drago Bokal, Gasper Fijavz, David R. Wood
The Minor Crossing Number of Graphs with an Excluded Minor. Electron. J. Comb. 15 (1) (2008)
Drago Bokal
On the crossing numbers of Cartesian products with trees. J. Graph Theory 56 (4) (2007)
Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrto
Graph minors and the crossing number of graphs. Electron. Notes Discret. Math. 28 (2007)
Drago Bokal
On the crossing numbers of Cartesian products with paths. J. Comb. Theory, Ser. B 97 (3) (2007)
Drago Bokal, Gasper Fijavz, Bojan Mohar
The Minor Crossing Number. SIAM J. Discret. Math. 20 (2) (2006)
Drago Bokal, Gunnar Brinkmann, Stefan Grünewald
Chromatic-index-critical graphs of orders 13 and 14. Discret. Math. 300 (1-3) (2005)
Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar
The circular chromatic number of a digraph. J. Graph Theory 46 (3) (2004)
Drago Bokal, Martin Juvan, Bojan Mohar
A Spectral Approach to Graphical Representation of Data. Informatica (Slovenia) 28 (3) (2004)
Tomaz Pisanski, Matjaz Kaufman, Drago Bokal, Edward C. Kirby, Ante Graovac
Isoperimetric Quotient for Fullerenes and Other Polyhedral Cages. J. Chem. Inf. Comput. Sci. 37 (6) (1997)