default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDrago Bokal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Spela Kajzer, Alexander Dobler, Janja Jerebic, Martin Nöllenburg, Joachim Orthaber, Drago Bokal:
Graph drawing applications in combinatorial theory of maturity models. CoRR abs/2403.02026 (2024)- 2022
- [j26]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): 701-728 (2022) - [j25]Drago Bokal, Janja Jerebic:
Guarding a subgraph as a tool in pursuit-evasion games. Discuss. Math. Graph Theory 42(1): 123-138 (2022) - [j24]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): 111-147 (2022) - [j23]Drago Bokal, Gunnar Brinkmann, Carol T. Zamfirescu:
The connectivity of the dual. J. Graph Theory 101(2): 182-209 (2022) - 2021
- [j22]Andreja Smole, Timotej Jagric, Drago Bokal:
Principal/Two-Agent model with internal signal. Central Eur. J. Oper. Res. 29(3): 791-808 (2021) - [i2]Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera:
Properties of Large 2-Crossing-Critical Graphs. CoRR abs/2112.04854 (2021)
2010 – 2019
- 2019
- [j21]Drago Bokal, Mitja Steinbacher:
Phases of psychologically optimal learning experience: task-based time allocation model. Central Eur. J. Oper. Res. 27(3): 863-885 (2019) - [j20]Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený:
On Degree Properties of Crossing-Critical Families of Graphs. Electron. J. Comb. 26(1): 1 (2019) - [c4]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: 14:1-14:15 - [i1]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 abs/1903.05363 (2019) - 2018
- [j19]Drago Bokal, Jesús Leaños:
Characterizing all graphs with 2-exceptional edges. Ars Math. Contemp. 15(2): 383-406 (2018) - 2017
- [j18]Dan Archdeacon, Drago Bokal, Tanja Gologranc:
A characterization of plane Gauss paragraphs. Ars Math. Contemp. 12(1): 31-36 (2017) - [j17]Drago Bokal, Bojan Mohar, Jozef Sirán:
Dan Archdeacon (11 May 1954 to 18 February 2015). Ars Math. Contemp. 12(1) (2017) - 2016
- [j16]Drago Bokal, Bogdan Oporowski, R. Bruce Richter, Gelasio Salazar:
Characterizing 2-crossing-critical graphs. Adv. Appl. Math. 74: 23-208 (2016) - 2015
- [c3]Drago Bokal, Sergio Cabello, David Eppstein:
Finding All Maximal Subsequences with Hereditary Properties. SoCG 2015: 240-254 - [c2]Drago Bokal, Mojca Bracic, Marek Dernár, Petr Hlinený:
On Degree Properties of Crossing-Critical Families of Graphs. GD 2015: 75-86 - 2013
- [j15]Drago Bokal, Markus Chimani, Jesús Leaños:
Crossing number additivity over edge cuts. Eur. J. Comb. 34(6): 1010-1018 (2013) - 2012
- [j14]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): 460-470 (2012) - [c1]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: 27-38 - 2011
- [j13]Drago Bokal, Matt DeVos, Sandi Klavzar, Aki Mimoto, Arne Ø. Mooers:
Computing quadratic entropy in evolutionary trees. Comput. Math. Appl. 62(10): 3821-3828 (2011) - 2010
- [j12]Laurent Beaudou, Drago Bokal:
On the Sharpness of Some Results Relating Cuts and Crossing Numbers. Electron. J. Comb. 17(1) (2010) - [j11]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): 463-483 (2010) - [j10]Drago Bokal:
Infinite families of crossing-critical graphs with prescribed average degree and crossing number. J. Graph Theory 65(2): 139-162 (2010)
2000 – 2009
- 2008
- [j9]Drago Bokal, Gasper Fijavz, David R. Wood:
The Minor Crossing Number of Graphs with an Excluded Minor. Electron. J. Comb. 15(1) (2008) - 2007
- [j8]Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrto:
Graph minors and the crossing number of graphs. Electron. Notes Discret. Math. 28: 169-175 (2007) - [j7]Drago Bokal:
On the crossing numbers of Cartesian products with paths. J. Comb. Theory B 97(3): 381-384 (2007) - [j6]Drago Bokal:
On the crossing numbers of Cartesian products with trees. J. Graph Theory 56(4): 287-300 (2007) - 2006
- [j5]Drago Bokal, Gasper Fijavz, Bojan Mohar:
The Minor Crossing Number. SIAM J. Discret. Math. 20(2): 344-356 (2006) - 2005
- [j4]Drago Bokal, Gunnar Brinkmann, Stefan Grünewald:
Chromatic-index-critical graphs of orders 13 and 14. Discret. Math. 300(1-3): 16-29 (2005) - 2004
- [j3]Drago Bokal, Martin Juvan, Bojan Mohar:
A Spectral Approach to Graphical Representation of Data. Informatica (Slovenia) 28(3): 233-238 (2004) - [j2]Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar:
The circular chromatic number of a digraph. J. Graph Theory 46(3): 227-240 (2004)
1990 – 1999
- 1997
- [j1]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): 1028-1032 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
