default search action
Oleg V. Borodin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j114]Oleg V. Borodin, Anna O. Ivanova:
Light 3-faces in 3-polytopes without adjacent triangles. Discret. Math. 348(2): 114299 (2025) - 2024
- [j113]Anna O. Ivanova
, Oleg V. Borodin:
All tight descriptions of faces in plane triangulations with minimum degree 4. Discuss. Math. Graph Theory 44(3): 1037 (2024) - 2023
- [j112]Oleg V. Borodin, Anna O. Ivanova
Tight description of faces of triangulations on the torus. Discret. Math. 346(9): 113510 (2023) - 2022
- [j111]Oleg V. Borodin, Anna O. Ivanova
Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. Discret. Math. 345(2): 112678 (2022) - [j110]Oleg V. Borodin, Anna O. Ivanova
3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices. Discret. Math. 345(8): 112904 (2022) - [j109]Oleg V. Borodin, Anna O. Ivanova
Another tight description of faces in plane triangulations with minimum degree 4. Discret. Math. 345(9): 112964 (2022) - 2021
- [j108]Oleg V. Borodin, Anna O. Ivanova
All tight descriptions of 3-paths in plane graphs with girth at least 7. Discret. Math. 344(5): 112335 (2021) - 2020
- [j107]Oleg V. Borodin, Anna O. Ivanova
Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. Discuss. Math. Graph Theory 40(4): 985-994 (2020) - [j106]Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova
Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9. Discuss. Math. Graph Theory 40(4): 1025-1033 (2020)
2010 – 2019
- 2019
- [j105]Oleg V. Borodin, Anna O. Ivanova
An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations. Discret. Math. 342(6): 1820-1827 (2019) - [j104]Oleg V. Borodin, Anna O. Ivanova
Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8. Discret. Math. 342(8): 2439-2444 (2019) - [j103]Oleg V. Borodin, Anna O. Ivanova
Describing faces in 3-polytopes with no vertices of degree from 5 to 7. Discret. Math. 342(11): 3208-3215 (2019) - 2018
- [j102]Oleg V. Borodin, Anna O. Ivanova
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7. Discret. Math. 341(3): 825-829 (2018) - [j101]Oleg V. Borodin, Anna O. Ivanova
Low minor faces in 3-polytopes. Discret. Math. 341(12): 3415-3424 (2018) - [j100]Oleg V. Borodin, Anna O. Ivanova
All one-term tight descriptions of 3-paths in normal plane maps without K4-e. Discret. Math. 341(12): 3425-3433 (2018) - [j99]Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova
More about the height of faces in 3-polytopes. Discuss. Math. Graph Theory 38(2): 443-453 (2018) - [j98]Oleg V. Borodin, Anna O. Ivanova
Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11. Discuss. Math. Graph Theory 38(3): 615-625 (2018) - 2017
- [j97]Oleg V. Borodin, Anna O. Ivanova
Low 5-stars in normal plane maps with minimum degree 5. Discret. Math. 340(2): 18-22 (2017) - [j96]Oleg V. Borodin, Anna O. Ivanova
Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. Discret. Math. 340(7): 1612-1616 (2017) - [j95]Oleg V. Borodin, Anna O. Ivanova
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. Discret. Math. 340(9): 2234-2242 (2017) - [j94]Tsyndyma Chimit-Dordjievna Batueva, Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova
Refined weight of edges in normal plane maps. Discret. Math. 340(11): 2659-2664 (2017) - [j93]Oleg V. Borodin, Anna O. Ivanova
All tight descriptions of 3-stars in 3-polytopes with girth 5. Discuss. Math. Graph Theory 37(1): 5-12 (2017) - [j92]Tsyndyma Chimit-Dordjievna Batueva, Oleg V. Borodin, Anna O. Ivanova
All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5. Graphs Comb. 33(1): 53-62 (2017) - [j91]Oleg V. Borodin, Anna O. Ivanova
A Steinberg-Like Approach to Describing Faces in 3-Polytopes. Graphs Comb. 33(1): 63-71 (2017) - [j90]Oleg V. Borodin, Anna O. Ivanova
Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday. J. Graph Theory 85(1): 115-132 (2017) - 2016
- [j89]Oleg V. Borodin, Anna O. Ivanova
Every Triangulated 3-Polytope of Minimum Degree 4 has a 4-Path of Weight at Most 27. Electron. J. Comb. 23(3): 3 (2016) - [j88]Oleg V. Borodin, Anna O. Ivanova
Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices. Discret. Math. 339(2): 923-930 (2016) - [j87]Oleg V. Borodin, Anna O. Ivanova
Weight of edges in normal plane maps. Discret. Math. 339(5): 1507-1511 (2016) - [j86]Oleg V. Borodin, Anna O. Ivanova
An analogue of Franklin's Theorem. Discret. Math. 339(10): 2553-2556 (2016) - [j85]Oleg V. Borodin, Anna O. Ivanova
The weight of faces in normal plane maps. Discret. Math. 339(10): 2573-2580 (2016) - [j84]Oleg V. Borodin, Anna O. Ivanova
On the weight of minor faces in triangle-free polytopes. Discuss. Math. Graph Theory 36(3): 603-619 (2016) - [j83]V. A. Aksenov, Oleg V. Borodin, Anna O. Ivanova
An extension of Kotzig's Theorem. Discuss. Math. Graph Theory 36(4): 889-897 (2016) - 2015
- [j82]V. A. Aksenov, Oleg V. Borodin, Anna O. Ivanova
Weight of 3-Paths in Sparse Plane Graphs. Electron. J. Comb. 22(3): 3 (2015) - [j81]Oleg V. Borodin, Anna O. Ivanova
Describing tight descriptions of 3-paths in triangle-free normal plane maps. Discret. Math. 338(11): 1947-1952 (2015) - [j80]Oleg V. Borodin, Anna O. Ivanova
Low edges in 3-polytopes. Discret. Math. 338(12): 2234-2241 (2015) - 2014
- [j79]Oleg V. Borodin, Anna O. Ivanova
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11. Discret. Math. 315-316: 128-134 (2014) - [j78]Oleg V. Borodin, Anna O. Ivanova
Describing faces in plane triangulations. Discret. Math. 319: 47-61 (2014) - [j77]Oleg V. Borodin, Anna O. Ivanova
Light C4 and C5 in 3-polytopes with minimum degree 5. Discret. Math. 334: 63-69 (2014) - [j76]Oleg V. Borodin, Anna O. Ivanova
5-stars of low weight in normal plane maps with minimum degree 5. Discuss. Math. Graph Theory 34(3): 539-546 (2014) - [j75]Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický
Short proofs of coloring theorems on planar graphs. Eur. J. Comb. 36: 314-321 (2014) - [j74]Oleg V. Borodin, Zdenek Dvorák
Planar 4-critical graphs with four triangles. Eur. J. Comb. 41: 138-151 (2014) - [j73]Oleg V. Borodin, Alexandr V. Kostochka:
Defective 2-colorings of sparse graphs. J. Comb. Theory B 104: 72-80 (2014) - 2013
- [j72]Oleg V. Borodin:
Colorings of plane graphs: A survey. Discret. Math. 313(4): 517-539 (2013) - [j71]Oleg V. Borodin, Anna O. Ivanova
Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps. Discret. Math. 313(17): 1700-1709 (2013) - [j70]Oleg V. Borodin, Anna O. Ivanova
Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5. Discret. Math. 313(17): 1710-1714 (2013) - [j69]Oleg V. Borodin, Alexandr V. Kostochka, Matthew P. Yancey:
On 11-improper 22-coloring of sparse graphs. Discret. Math. 313(22): 2638-2649 (2013) - [j68]Oleg V. Borodin, Anna O. Ivanova
Describing 3-paths in normal plane maps. Discret. Math. 313(23): 2702-2711 (2013) - [j67]Oleg V. Borodin, Anna O. Ivanova
Describing 3-faces in normal plane maps with minimum degree 4. Discret. Math. 313(23): 2841-2847 (2013) - [j66]Oleg V. Borodin, Anna O. Ivanova
Precise upper bound for the strong edge chromatic number of sparse planar graphs. Discuss. Math. Graph Theory 33(4): 756-770 (2013) - [j65]Oleg V. Borodin, Anna O. Ivanova
Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles. J. Graph Theory 72(4): 374-397 (2013) - [i2]Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Planar 4-critical graphs with four triangles. CoRR abs/1306.1477 (2013) - 2012
- [j64]Oleg V. Borodin, Anna O. Ivanova
List 2-facial 5-colorability of plane graphs with girth at least 12. Discret. Math. 312(2): 306-314 (2012) - [j63]Oleg V. Borodin, Anna O. Ivanova
(k, 1)-coloring of sparse graphs. Discret. Math. 312(6): 1128-1135 (2012) - [j62]Oleg V. Borodin, Anna O. Ivanova
Acyclic 4-choosability of planar graphs without adjacent short cycles. Discret. Math. 312(22): 3335-3341 (2012) - [j61]Oleg V. Borodin, Anna O. Ivanova
2-distance 4-colorability of planar subcubic graphs with girth at least 22. Discuss. Math. Graph Theory 32(1): 141-151 (2012) - [j60]Oleg V. Borodin, Alexei N. Glebov, Tommy R. Jensen:
A step towards the strong version of Havel's three color conjecture. J. Comb. Theory B 102(6): 1295-1320 (2012) - [i1]Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Short proofs of coloring theorems on planar graphs. CoRR abs/1211.3981 (2012) - 2011
- [j59]Oleg V. Borodin, Anna O. Ivanova
(k, j)-coloring of sparse graphs. Discret. Appl. Math. 159(17): 1947-1953 (2011) - [j58]Oleg V. Borodin, Anna O. Ivanova
List injective colorings of planar graphs. Discret. Math. 311(2-3): 154-165 (2011) - [j57]Oleg V. Borodin, Alexei N. Glebov:
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable. J. Graph Theory 66(1): 1-31 (2011) - [j56]Oleg V. Borodin, Anna O. Ivanova
List strong linear 2-arboricity of sparse graphs. J. Graph Theory 67(2): 83-90 (2011) - [j55]Oleg V. Borodin, Anna O. Ivanova
Acyclic 5-choosability of planar graphs without adjacent short cycles. J. Graph Theory 68(2): 169-176 (2011) - 2010
- [j54]Oleg V. Borodin, Mickaël Montassier, André Raspaud:
Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discret. Math. 310(1): 167-173 (2010) - [j53]Oleg V. Borodin, Min Chen, Anna O. Ivanova
Acyclic 3-choosability of sparse graphs with girth at least 7. Discret. Math. 310(17-18): 2426-2434 (2010) - [j52]Oleg V. Borodin, Alexei N. Glebov, André Raspaud:
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Discret. Math. 310(20): 2584-2594 (2010) - [j51]Oleg V. Borodin, Anna O. Ivanova
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. Discret. Math. 310(21): 2946-2950 (2010) - [j50]Oleg V. Borodin, Anna O. Ivanova
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. J. Graph Theory 65(2): 83-93 (2010)
2000 – 2009
- 2009
- [j49]Oleg V. Borodin, Anna O. Ivanova
Planar graphs decomposable into a forest and a matching. Discret. Math. 309(1): 277-279 (2009) - [j48]Oleg V. Borodin, Anna O. Ivanova
2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18. Discret. Math. 309(23-24): 6496-6502 (2009) - [j47]Oleg V. Borodin, Anna O. Ivanova
Decompositions of quadrangle-free planar graphs. Discuss. Math. Graph Theory 29(1): 87-99 (2009) - [j46]Oleg V. Borodin, Anna O. Ivanova
List 2-distance (Delta+2)-coloring of planar graphs with girth six. Eur. J. Comb. 30(5): 1257-1262 (2009) - [j45]Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud:
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. J. Comb. Theory B 99(4): 668-673 (2009) - [j44]Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu:
M-degrees of quadrangle-free planar graphs. J. Graph Theory 60(1): 80-85 (2009) - [j43]Oleg V. Borodin, Anna O. Ivanova
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable. J. Graph Theory 62(3): 234-240 (2009) - 2008
- [j42]Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu:
Decomposing a planar graph with girth 9 into a forest and a matching. Eur. J. Comb. 29(5): 1235-1241 (2008) - 2007
- [j41]Oleg V. Borodin, Hajo Broersma
A new upper bound on the cyclic chromatic number. J. Graph Theory 54(1): 58-72 (2007) - 2006
- [j40]Oleg V. Borodin:
On acyclic colorings of planar graphs. Discret. Math. 306(10-11): 953-972 (2006) - 2005
- [j39]Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour:
Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory B 93(2): 303-311 (2005) - [j38]V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft:
Deeply asymmetric planar graphs. J. Comb. Theory B 95(1): 68-78 (2005) - 2004
- [j37]Oleg V. Borodin:
Preface: Russian Translations II. Discret. Appl. Math. 135(1-3): 1- (2004) - [j36]Oleg V. Borodin, D. V. Loparev:
Height of minor faces in plane normal maps. Discret. Appl. Math. 135(1-3): 31-39 (2004) - [j35]Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West:
Homomorphisms from sparse graphs with large girth. J. Comb. Theory B 90(1): 147-159 (2004) - 2003
- [j34]Oleg V. Borodin, André Raspaud:
A sufficient condition for planar graphs to be 3-colorable. J. Comb. Theory B 88(1): 17-27 (2003) - 2002
- [j33]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic list 7-coloring of planar graphs. J. Graph Theory 40(2): 83-90 (2002) - [j32]Oleg V. Borodin, Douglas R. Woodall:
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size. SIAM J. Discret. Math. 15(2): 143-154 (2002) - 2001
- [j31]Oleg V. Borodin:
Preface. Discret. Appl. Math. 114(1-3): 1 (2001) - [j30]Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic colouring of 1-planar graphs. Discret. Appl. Math. 114(1-3): 29-41 (2001) - [j29]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On Deeply Critical Oriented Graphs. J. Comb. Theory B 81(1): 150-155 (2001) - 2000
- [j28]Oleg V. Borodin, Alexandr V. Kostochka, Bjarne Toft:
Variable degeneracy: extensions of Brooks' and Gallai's theorems. Discret. Math. 214(1-3): 101-112 (2000)
1990 – 1999
- 1999
- [j27]Oleg V. Borodin, Daniel P. Sanders, Yue Zhao:
On cyclic colorings and their generalizations. Discret. Math. 203(1-3): 23-40 (1999) - [j26]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril
On the maximum average degree and the oriented chromatic number of a graph. Discret. Math. 206(1-3): 77-89 (1999) - [j25]Oleg V. Borodin, Douglas R. Woodall:
Cyclic Degrees of 3-Polytopes. Graphs Comb. 15(3): 267-277 (1999) - 1998
- [j24]Oleg V. Borodin:
Triangulated 3-polytopes without faces of low weight. Discret. Math. 186(1-3): 281-285 (1998) - [j23]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril
On universal graphs for planar oriented graphs of a given girth. Discret. Math. 188(1-3): 73-85 (1998) - [j22]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
On kernel-perfect orientations of line graphs. Discret. Math. 191(1-3): 45-49 (1998) - [j21]Oleg V. Borodin, Douglas R. Woodall:
Short cycles of low weight in normal plane maps with minimum degree 5. Discuss. Math. Graph Theory 18(2): 159-164 (1998) - [j20]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
Total Colourings of Planar Graphs with Large Girth. Eur. J. Comb. 19(1): 19-24 (1998) - 1997
- [j19]Oleg V. Borodin:
A new proof of Grünbaum's 3 color theorem. Discret. Math. 169(1-3): 177-183 (1997) - [j18]Oleg V. Borodin:
Minimal vertex degree sum of a 3-path in plane maps. Discuss. Math. Graph Theory 17(2): 279-284 (1997) - [j17]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
List Edge and List Total Colourings of Multigraphs. J. Comb. Theory B 71(2): 184-204 (1997) - [j16]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
Total colorings of planar graphs with large maximum degree. J. Graph Theory 26(1): 53-59 (1997) - 1996
- [j15]Oleg V. Borodin:
To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs. Ars Comb. 43 (1996) - [j14]Oleg V. Borodin:
Irreducible graphs in the Grünbaum-Havel 3-colour problem. Discret. Math. 159(1-3): 247-249 (1996) - [j13]Oleg V. Borodin:
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. J. Graph Theory 21(2): 183-186 (1996) - [j12]Oleg V. Borodin:
Cyclic degree and cyclic coloring of 3-polytopes. J. Graph Theory 23(3): 225-231 (1996) - [j11]Oleg V. Borodin:
Structural theorem on plane graphs with application to the entire coloring number. J. Graph Theory 23(3): 233-239 (1996) - 1995
- [j10]Oleg V. Borodin:
Triangles with restricted degree sum of their boundary vertices in plane graphs. Discret. Math. 137(1-3): 45-51 (1995) - [j9]Oleg V. Borodin:
A new proof of the 6 color theorem. J. Graph Theory 19(4): 507-521 (1995) - 1994
- [j8]Oleg V. Borodin:
Simultaneous coloring of edges and faces of plane graphs. Discret. Math. 128(1-3): 21-33 (1994) - 1993
- [j7]Oleg V. Borodin:
Joint extension of two theorems of Kotzig on 3-polytopes. Comb. 13(1): 121-125 (1993) - 1992
- [j6]Oleg V. Borodin:
Cyclic coloring of plane graphs. Discret. Math. 100(1-3): 281-289 (1992) - [j5]Oleg V. Borodin:
Diagonal coloring of the vertices of triangulations. Discret. Math. 102(1): 95-96 (1992) - [j4]Oleg V. Borodin, Jean Mayer:
Decomposition of K13 into a torus graph and a graph imbedded in the Klein bottle. Discret. Math. 102(1): 97-98 (1992) - 1991
- [c1]Oleg V. Borodin:
Four problems on plane graphs raised by Branko Grünbaum. Graph Structure Theory 1991: 149-156 - 1990
- [j3]Oleg V. Borodin:
Diagonal 11-coloring of plane triangulations. J. Graph Theory 14(6): 701-704 (1990)
1970 – 1979
- 1979
- [j2]Oleg V. Borodin:
On acyclic colorings of planar graphs. Discret. Math. 25(3): 211-236 (1979) - 1977
- [j1]Oleg V. Borodin, Alexandr V. Kostochka:
On an upper bound of a graph's chromatic number, depending on the graph's degree and density. J. Comb. Theory B 23(2-3): 247-250 (1977)
Coauthor Index
[j114] [j113] [j112] [j111] [j110] [j109] [j108] [j107] [j106] [j105] [j104] [j103] [j102] [j101] [j100] [j99] [j98] [j97] [j96] [j95] [j94] [j93] [j92] [j91] [j90] [j89] [j88] [j87] [j86] [j85] [j84] [j83] [j82] [j81] [j80] [j79] [j78] [j77] [j76] [j71] [j70] [j68] [j67] [j66] [j65] [j64] [j63] [j62] [j61] [j59] [j58] [j56] [j55] [j53] [j51] [j50] [j49] [j48] [j47] [j46] [j43]
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-11-04 21:42 CET 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: