default search action
Janez Zerovnik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j106]Janez Zerovnik
:
Rainbow domination regular graphs that are not vertex transitive. Discret. Appl. Math. 349: 144-147 (2024) - [j105]Marianna E.-Nagy
Sufficient Matrices: Properties, Generating and Testing. J. Optim. Theory Appl. 202(1): 204-236 (2024) - 2023
- [j104]Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik:
60 years of OR in Slovenia: development from a first conference to a vibrant community. Central Eur. J. Oper. Res. 31(3): 681-690 (2023) - [j103]Bostjan Gabrovsek
On the 2-rainbow independent domination numbers of some graphs. Central Eur. J. Oper. Res. 31(3): 817-831 (2023) - 2022
- [j102]Barbara Ikica
Clustering as a dual problem to colouring. Comput. Appl. Math. 41(4) (2022) - [j101]Tina Novak, Janez Zerovnik
A Linear Time Algorithm for Weighted k-Fair Domination Problem in Cactus Graphs. Oper. Res. Forum 3(3) (2022) - [j100]Darja Rupnik Poklukar
Double Roman Domination in Generalized Petersen Graphs P(ck, k). Symmetry 14(6): 1121 (2022) - [j99]Darja Rupnik Poklukar
On Three-Rainbow Dominationof Generalized Petersen Graphs P(ck, k). Symmetry 14(10): 2086 (2022) - 2021
- [j98]Andrej Kastrin
Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR. Central Eur. J. Oper. Res. 29(3): 773-790 (2021) - [j97]Janez Povh
On sufficient properties of sufficient matrices. Central Eur. J. Oper. Res. 29(3): 809-822 (2021) - [j96]Tina Novak, Janez Zerovnik
Real forms of the complex Neumann system: A method for finding real roots of polynomial US(λ). J. Comput. Appl. Math. 390: 113362 (2021) - [j95]Rija Erves, Janez Zerovnik
On 2-Rainbow Domination Number of Generalized Petersen Graphs P(5k, k). Symmetry 13(5): 809 (2021) - [j94]Rija Erves
On 3-Rainbow Domination Number of Generalized Petersen Graphs P(6k, k). Symmetry 13(10): 1860 (2021) - 2020
- [j93]Iztok Banic, Janez Zerovnik
On median and quartile sets of ordered random variables. Art Discret. Appl. Math. 3(2) (2020)
2010 – 2019
- 2019
- [j92]Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
Editorial. Central Eur. J. Oper. Res. 27(3): 597-599 (2019) - [j91]Zehui Shao
On 2-rainbow domination of generalized Petersen graphs. Discret. Appl. Math. 257: 370-384 (2019) - [j90]Darja Rupnik Poklukar
Networks with Extremal Closeness. Fundam. Informaticae 167(3): 219-234 (2019) - [j89]Tea Vizinger, Janez Zerovnik
A stochastic model for better planning of product flow in retail supply chains. J. Oper. Res. Soc. 70(11): 1900-1914 (2019) - 2018
- [j88]Zehui Shao
Discharging Approach for Double Roman Domination in Graphs. IEEE Access 6: 63345-63351 (2018) - [j87]Polona Repolusk, Janez Zerovnik:
Formulas for various domination numbers of products of paths and cycles. Ars Comb. 137: 177-202 (2018) - [j86]Tina Novak, Darja Rupnik Poklukar
The Hosoya polynomial of double weighted graphs. Ars Math. Contemp. 15(2): 441-466 (2018) - 2017
- [j85]Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik
Editorial. Central Eur. J. Oper. Res. 25(3): 521-523 (2017) - [j84]Maja Cevnik
Broadcasting on cactus graphs. J. Comb. Optim. 33(1): 292-316 (2017) - [c20]Hugo Zupan, Janez Zerovnik
Local Search with Discrete Event Simulation for the Job Shop Scheduling Problem. SOHOMA 2017: 371-380 - 2016
- [j83]Rija Erves, Janez Zerovnik:
Mixed connectivity of Cartesian graph products and bundles. Ars Comb. 124: 49-64 (2016) - [j82]Petra Sparl, Rafal Witkowski, Janez Zerovnik
Multicoloring of cannonball graphs. Ars Math. Contemp. 10(1): 31-44 (2016) - [j81]Janez Zerovnik:
Petra Šparl (1975-2016). Ars Math. Contemp. 11(1) (2016) - [j80]Darja Rupnik Poklukar
Reliability Hosoya-Wiener Polynomial of Double Weighted Trees. Fundam. Informaticae 147(4): 447-456 (2016) - [i4]David Kaljun, Joze Petrisic, Janez Zerovnik:
Using Newton's method to model a spatial light distribution of a LED with attached secondary optics. CoRR abs/1603.01090 (2016) - [i3]Tina Novak, Janez Zerovnik:
Weighted domination number of cactus graphs. CoRR abs/1604.06452 (2016) - 2015
- [j79]Rija Erves, Janez Zerovnik
Mixed fault diameter of Cartesian graph bundles II. Ars Math. Contemp. 8(2): 245-258 (2015) - [j78]Tibor Csendes, Lidija Zadnik Stirn, Janez Zerovnik
Editorial. Central Eur. J. Oper. Res. 23(3): 523-525 (2015) - [j77]Rija Erves, Janez Zerovnik
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles. Discret. Appl. Math. 181: 90-97 (2015) - [j76]David Kaljun, Darja Rupnik Poklukar, Janez Zerovnik:
Heuristics for Optimization of LED Spatial Light Distribution Model. Informatica (Slovenia) 39(2) (2015) - [j75]Irena Hrastnik Ladinek
Perfect codes in direct graph bundles. Inf. Process. Lett. 115(9): 707-711 (2015) - 2014
- [j74]Zehui Shao
On rainbow domination numbers of graphs. Inf. Sci. 254: 225-234 (2014) - 2013
- [j73]Tibor Csendes, Lidija Zadnik Stirn, Janez Zerovnik
Editorial. Central Eur. J. Oper. Res. 21(Supplement-1): 1-2 (2013) - [j72]Tomaz Kramberger, Janez Zerovnik
GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance. Central Eur. J. Oper. Res. 21(Supplement-1): 59-73 (2013) - [j71]Rija Erves, Janez Zerovnik
Mixed fault diameter of Cartesian graph bundles. Discret. Appl. Math. 161(12): 1726-1733 (2013) - [j70]Rafal Witkowski, Janez Zerovnik:
1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs. Discret. Math. Theor. Comput. Sci. 15(3): 127-138 (2013) - [j69]Rija Erves, Janez Zerovnik
Wide-diameter of Product Graphs. Fundam. Informaticae 125(2): 153-160 (2013) - 2012
- [j68]Petra Sparl, Rafal Witkowski, Janez Zerovnik
1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs. Algorithmica 64(4): 564-583 (2012) - [j67]Polona Pavlic, Janez Zerovnik
Roman Domination Number of the Cartesian Products of Paths and Cycles. Electron. J. Comb. 19(3): 19 (2012) - [j66]Ignasi Sau
Simpler multicoloring of triangle-free hexagonal graphs. Discret. Math. 312(1): 181-187 (2012) - [j65]Irena Hrastnik Ladinek, Janez Zerovnik
Cyclic bundle Hamiltonicity. Int. J. Comput. Math. 89(2): 129-136 (2012) - [j64]Petra Sparl, Rafal Witkowski, Janez Zerovnik
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs. Inf. Process. Lett. 112(14-15): 567-571 (2012) - [j63]Shay Kutten, Janez Zerovnik
Preface. Theor. Comput. Sci. 444: 1-2 (2012) - [c19]Polona Pavlic, Janez Zerovnik:
A Constant Time Algorithm for Domination Problems on Polygraphs. CTW 2012: 205-209 - [i2]Janez Zerovnik, Rija Erves:
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles. CoRR abs/1212.4670 (2012) - 2011
- [j62]Tibor Csendes, Janez Povh
Editorial. Central Eur. J. Oper. Res. 19(3): 251-252 (2011) - [j61]Gasper Zerovnik, Janez Zerovnik
Constructive heuristics for the canister filling problem. Central Eur. J. Oper. Res. 19(3): 371-389 (2011) - [c18]Rafal Witkowski, Janez Zerovnik
1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs. WAW 2011: 74-84 - 2010
- [j60]Iztok Banic
Wide diameter of Cartesian graph bundles. Discret. Math. 310(12): 1697-1701 (2010) - [j59]Rafal Witkowski, Janez Zerovnik
1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs. Electron. Notes Discret. Math. 36: 375-382 (2010) - [j58]Petra Sparl, Janez Zerovnik
2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs. Int. J. Comput. Math. 87(9): 2003-2013 (2010) - [j57]Jérôme Galtier, Igor Pesek, Katja Prnaver, Janez Zerovnik:
Oriented Networks Design Problem. J. Inf. Sci. Eng. 26(4): 1231-1242 (2010) - [c17]Rija Erves, Janez Zerovnik:
Mixed Connectivity of Cartesian Graph Products and Bundles. CTW 2010: 141-144 - [c16]Maja Rotovnik, Janez Zerovnik:
Wide - Sense Nonblocking logd(N; 0; p) Networks. CTW 2010: 145-148 - [p1]Ignasi Sau, Janez Zerovnik:
Permutation Routing and (ℓ, k)-Routing on Plane Grids. Graphs and Algorithms in Communication Networks 2010: 265-279 - [e1]Shay Kutten, Janez Zerovnik:
Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5869, Springer 2010, ISBN 978-3-642-11475-5 [contents]
2000 – 2009
- 2009
- [j56]Iztok Banic
Edge, vertex and mixed fault diameters. Adv. Appl. Math. 43(3): 231-238 (2009) - [j55]Tomaz Pisanski, Janez Zerovnik:
Edge-contributions of some topological indices and arboreality of molecular graphs. Ars Math. Contemp. 2(1): 49-58 (2009) - [j54]Tomaz Pisanski, Janez Zerovnik
Hamilton cycles in graph bundles over a cycle with tree as a fibre. Discret. Math. 309(17): 5432-5436 (2009) - [j53]Iztok Banic
The edge fault-diameter of Cartesian graph bundles. Eur. J. Comb. 30(5): 1054-1061 (2009) - [j52]Florian Huc, Ignasi Sau, Janez Zerovnik
(l, k)-ROUTING ON PLANE GRIDS. J. Interconnect. Networks 10(1-2): 27-57 (2009) - 2008
- [j51]Iztok Banic
The fault-diameter of Cartesian products. Adv. Appl. Math. 40(1): 98-106 (2008) - [j50]Janez Zerovnik
Perfect codes in direct products of cycles - a complete characterization. Adv. Appl. Math. 41(2): 197-205 (2008) - [j49]Melita Gorse Pihler, Janez Zerovnik
Partial cubes are distance graphs. Discret. Math. 308(5-6): 820-826 (2008) - [j48]Janez Zerovnik, Ignasi Sau
An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [c15]Iztok Banic, Rija Erves, Janez Zerovnik:
Edge fault-diameter of Cartesian graph bundles. CTW 2008: 144-147 - 2007
- [j47]Blaz Zmazek, Janez Zerovnik
Weak reconstruction of strong product graphs. Discret. Math. 307(3-5): 641-649 (2007) - [j46]Petra Sparl, Janez Zerovnik
A note on n-tuple colourings and circular colourings of planar graphs with large odd girth. Int. J. Comput. Math. 84(12): 1743-1746 (2007) - [c14]Igor Pesek
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem. Hybrid Metaheuristics 2007: 57-68 - [c13]Iztok Banic, Janez Zerovnik
Edge Fault-Diameter of Cartesian Product of Graphs. SIROCCO 2007: 234-245 - [i1]Igor Pesek, Janez Zerovnik:
Best insertion algorithm for resource-constrained project scheduling problem. CoRR abs/0705.2137 (2007) - 2006
- [j45]Sandi Klavzar
An almost complete description of perfect codes in direct products of cycles. Adv. Appl. Math. 37(1): 2-18 (2006) - [j44]Janez Zerovnik:
New formulas for the pentomino exclusion problem. Australas. J Comb. 36: 197-212 (2006) - [j43]Iztok Banic
Fault-diameter of Cartesian graph bundles. Inf. Process. Lett. 100(2): 47-51 (2006) - [j42]Tomaz Dobravec, Janez Zerovnik
An optimal message routing algorithm for circulant networks. J. Syst. Archit. 52(5): 298-306 (2006) - [c12]Iztok Banic
Fault-diameter of generalized Cartesian products. ICDCS Workshops 2006: 3 - 2005
- [j41]Petra Sparl, Janez Zerovnik
2-local distributed algorithms for generalized coloring of hexagonal graphs. Electron. Notes Discret. Math. 22: 321-325 (2005) - [j40]Petra Sparl, Janez Zerovnik
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. J. Algorithms 55(1): 29-41 (2005) - [c11]Matthew Henderson
Mixture of Vector Experts. ALT 2005: 386-398 - [c10]Blaz Zmazek, Janez Zerovnik
Estimating the Traffic on Weighted Cactus Networks in Linear Time. IV 2005: 536-541 - 2004
- [j39]Blaz Zmazek, Janez Zerovnik
The obnoxious center problem on weighted cactus graphs. Discret. Appl. Math. 136(2-3): 377-386 (2004) - [j38]Petra Sparl, Janez Zerovnik
Homomorphisms of hexagonal graphs to odd cycles. Discret. Math. 283(1-3): 273-277 (2004) - [j37]Blaz Zmazek, Janez Zerovnik
Behzad-Vizing conjecture and Cartesian product graphs. Electron. Notes Discret. Math. 17: 297-300 (2004) - [j36]Petra Sparl, Janez Zerovnik
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. Inf. Process. Lett. 90(5): 239-246 (2004) - [c9]Blaz Zmazek, Janez Zerovnik:
Behzad-Vizing Conjecture and Cartesian Product Graphs. CTW 2004: 257-260 - [c8]Claude Chaudet, Isabelle Guérin Lassous, Janez Zerovnik:
A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks. WONS 2004: 101-115 - 2003
- [j35]Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik:
Preface. Discuss. Math. Graph Theory 23(2): 205 (2003) - [j34]Wilfried Imrich, Blaz Zmazek, Janez Zerovnik:
Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 23(2): 273-285 (2003) - [j33]Blaz Zmazek, Janez Zerovnik
On the Weak Reconstruction of Strong Product Graphs. Electron. Notes Discret. Math. 13: 123-127 (2003) - [j32]Tomaz Dobravec, Borut Robic, Janez Zerovnik:
Permutation routing in double-loop networks: design and empirical evaluation. J. Syst. Archit. 48(13-15): 387-402 (2003) - 2002
- [j31]Blaz Zmazek, Janez Zerovnik
Behzad-Vizing conjecture and Cartesian-product graphs. Appl. Math. Lett. 15(6): 781-784 (2002) - [j30]Sangho Shim, Jozef Sirán, Janez Zerovnik
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. Discret. Appl. Math. 119(3): 281-286 (2002) - [j29]Blaz Zmazek, Janez Zerovnik
Algorithm for recognizing Cartesian graph bundles. Discret. Appl. Math. 120(1-3): 275-302 (2002) - [j28]Frédéric Havet, Janez Zerovnik
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Discret. Math. 244(1-3): 103-108 (2002) - [j27]Blaz Zmazek, Janez Zerovnik
Unique square property and fundamental factorizations of graph bundles. Discret. Math. 244(1-3): 551-561 (2002) - [j26]Janez Zerovnik
Chromatic numbers of the strong product of odd cycles. Electron. Notes Discret. Math. 11: 647-652 (2002) - [j25]Alain Bretto
A polynomial algorithm for the strong Helly property. Inf. Process. Lett. 81(1): 55-57 (2002) - [j24]Aleksander Vesel, Janez Zerovnik
Improved lower bound on the Shannon capacity of C7. Inf. Process. Lett. 81(5): 277-282 (2002) - 2001
- [j23]Blaz Zmazek, Janez Zerovnik
On recognizing Cartesian graph bundles. Discret. Math. 233(1-3): 381-391 (2001) - [j22]Blaz Zmazek, Janez Zerovnik
The obnoxious center problem on weighted cactus graphs (Extended Abstract). Electron. Notes Discret. Math. 8: 133-136 (2001) - [j21]Wilfried Imrich
Weak k-reconstruction of cartesian product graphs. Electron. Notes Discret. Math. 10: 297-300 (2001) - [j20]Tomaz Pisanski, Blaz Zmazek, Janez Zerovnik:
An algorithm for K-convex closure and an application. Int. J. Comput. Math. 78(1): 1-11 (2001) - 2000
- [j19]Borut Robic, Janez Zerovnik:
Minimum 2-terminal Routing in 2-jump Circulant Graphs. Comput. Artif. Intell. 19(1): 37-46 (2000) - [j18]Blaz Zmazek, Janez Zerovnik:
Recognizing weighted directed cartesian graph bundles. Discuss. Math. Graph Theory 20(1): 39-56 (2000) - [j17]Aleksander Vesel, Janez Zerovnik
On the linear K-arboricity of cubic graphs. Int. J. Comput. Math. 75(4): 431-444 (2000) - [c7]Barry Rising, John Shawe-Taylor
Graph Colouring by Maximal Evidence Edge Adding. PATAT 2000: 294-308
1990 – 1999
- 1999
- [j16]Blaz Zmazek, Janez Zerovnik
Algorithm for Recognizing Cartesian Graph Bundles. Electron. Notes Discret. Math. 3: 217-221 (1999) - [j15]Janez Zerovnik
Szeged Index of Symmetric Graphs. J. Chem. Inf. Comput. Sci. 39(1): 77-80 (1999) - [c6]Janez Zerovnik
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs. FCT 1999: 559-568 - 1998
- [j14]Aleksander Vesel, Janez Zerovnik
The independence number of the strong product of odd cycles. Discret. Math. 182(1-3): 333-336 (1998) - [c5]Patrick W. Fowler, Tomaz Pisanski, Ante Graovac, Janez Zerovnik:
A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra. Discrete Mathematical Chemistry 1998: 175-187 - [c4]Barry Rising, Max van Daalen, John Shawe-Taylor, Peter Burge, Janez Zerovnik:
A Neural Accelerator for Graph Colouring Based on an Edge Adding Technique. NC 1998: 652-656 - 1997
- [j13]Martin Juvan, Bojan Mohar, Janez Zerovnik
Distance-related Invariants on Polygraphs. Discret. Appl. Math. 80(1): 57-71 (1997) - [j12]Wilfried Imrich
Recognizing Cartesian graph bundles. Discret. Math. 167-168: 393-403 (1997) - 1996
- [j11]Sandi Klavzar
Algebraic Approach to Fasciagraphs and Rotagraphs. Discret. Appl. Math. 68(1-2): 93-100 (1996) - [j10]Wilfried Imrich
On the weak reconstruction of Cartesian-product graphs. Discret. Math. 150(1-3): 167-178 (1996) - [c3]Janez Zerovnik
Recognizing Graph Products and Bundles. SOFSEM 1996: 467-474 - 1995
- [j9]Martin Juvan, Bojan Mohar, Ante Graovac, Sandi Klavzar, Janez Zerovnik
Fast computation of the Wiener index of fasciagraphs and rotagraphs. J. Chem. Inf. Comput. Sci. 35(5): 834-840 (1995) - 1994
- [j8]Janez Zerovnik
A randomized algorithm for k-colorability. Discret. Math. 131(1-3): 379-393 (1994) - [j7]Tomaz Pisanski, Janez Zerovnik
Weights on Edges of Chemical Graphs Determined by Paths. J. Chem. Inf. Comput. Sci. 34(2): 395-397 (1994) - 1993
- [j6]Janez Zerovnik
A counterexample to conjecture of Barefoot, Harary, and Jones. Graphs Comb. 9(2-4): 205-207 (1993) - [j5]Janez Zerovnik:
Regular Graphs Are 'Difficult' For Colouring. Informatica (Slovenia) 17(1) (1993) - [j4]Janez Zerovnik
Computing the Diameter in Multiple-Loop Networks. J. Algorithms 14(2): 226-243 (1993) - 1992
- [j3]Janez Zerovnik
A parallel variant of a heuristical algorithm for graph coloring - Corrigendum (Short communication). Parallel Comput. 18(8): 897-900 (1992) - 1991
- [c2]Janez Zerovnik
On the Existence of an Efficient Parallel Algorithm for a Graph Theoretic Problem. ACPC 1991: 359-368 - [c1]Milan E. Soklic, Janez Zerovnik
Distributed simulation of coloring graph vertices. Annual Simulation Symposium 1991: 118-122 - 1990
- [j2]Janez Zerovnik
A parallel variant of a heuristical algorithm for graph colouring. Parallel Comput. 13(1): 95-100 (1990)
1980 – 1989
- 1989
- [j1]Janez Zerovnik
A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph. Inf. Process. Lett. 33(4): 213-219 (1989)
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-08-05 20:21 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: