default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMariusz Wozniak
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j100]Igor Grzelec
, Monika Pilsniak, Mariusz Wozniak:
A note on uniquely embeddable 2-factors. Appl. Math. Comput. 468: 128505 (2024)- [i7]Erik Schnaubelt, Mariusz Wozniak, Julien Dular, Idoia Cortes Garcia, Arjan Verweij, Sebastian Schöps:
Parallel-in-Time Integration of Transient Phenomena in No-Insulation Superconducting Coils Using Parareal. CoRR abs/2404.13333 (2024) - [i6]Robert Hahn, Erik Schnaubelt, Mariusz Wozniak, Christophe Geuzaine, Sebastian Schöps:
Mortar Thin Shell Approximation for Analysis of Superconducting Accelerator Magnets. CoRR abs/2405.01076 (2024) - [i5]Mariusz Wozniak, Erik Schnaubelt, Sina Atalay, Bernardo Bordini, Julien Dular, Tim Mulder, Emmanuele Ravaioli, Arjan Verweij:
Influence of Critical Current Distribution on Operation, Quench Detection and Protection of HTS Pancake Coils. CoRR abs/2411.18124 (2024) - 2023
- [j99]Igor Grzelec, Mariusz Wozniak:
On decomposing multigraphs into locally irregular submultigraphs. Appl. Math. Comput. 452: 128049 (2023) - [j98]Felix Bock, Rafal Kalinowski, Johannes Pardey, Monika Pilsniak, Dieter Rautenbach, Mariusz Wozniak:
Majority Edge-Colorings of Graphs. Electron. J. Comb. 30(1) (2023) - [i4]Erik Schnaubelt, Sina Atalay, Mariusz Wozniak, Julien Dular, Christophe Geuzaine, Benoit Vanderheyden, Nicolas Marsic, Arjan Verweij, Sebastian Schöps:
Magneto-Thermal Thin Shell Approximation for 3D Finite Element Analysis of No-Insulation Coils. CoRR abs/2310.03138 (2023) - 2022
- [j97]Éric Sopena, Mariusz Wozniak:
A note on the neighbour-distinguishing index of digraphs. Ars Math. Contemp. 23(1) (2022) - [j96]Jerzy Konarski, Mariusz Wozniak, Andrzej Zak:
A note on packing of uniform hypergraphs. Discuss. Math. Graph Theory 42(4): 1383-1388 (2022) - 2021
- [j95]Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
On Asymmetric Colourings of Claw-Free Graphs. Electron. J. Comb. 28(3): 3 (2021) - 2020
- [j94]Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
The distinguishing index of connected graphs without pendant edges. Ars Math. Contemp. 18(1): 117-126 (2020) - [j93]Agnieszka Görlich, Mariusz Wozniak:
A note on packing two copies of a tree into a graph with small maximum degree. Discret. Math. 343(10): 111991 (2020) - [j92]Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory 40(4): 1175-1186 (2020)
2010 – 2019
- 2019
- [j91]Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [i3]Éric Sopena, Mariusz Wozniak:
A note on the neighbour-distinguishing index of digraphs. CoRR abs/1909.10240 (2019) - 2018
- [j90]Mirko Hornák, Jakub Przybylo, Mariusz Wozniak:
A note on a directed version of the 1-2-3 Conjecture. Discret. Appl. Math. 236: 472-476 (2018) - [j89]Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
On locally irregular decompositions and the 1-2 Conjecture in digraphs. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - 2017
- [j88]Emma Barme, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
On a directed variation of the 1-2-3 and 1-2 Conjectures. Discret. Appl. Math. 217: 123-131 (2017) - [j87]Jakub Przybylo, André Raspaud, Mariusz Wozniak:
On weight choosabilities of graphs with bounded maximum average degree. Discret. Appl. Math. 217: 663-672 (2017) - [j86]Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. 222: 40-53 (2017) - [j85]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
A note on breaking small automorphisms in graphs. Discret. Appl. Math. 232: 221-225 (2017) - [j84]Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak:
The neighbour-sum-distinguishing edge-colouring game. Discret. Math. 340(7): 1564-1572 (2017) - [j83]Evelyne Flandrin, Hao Li, Antoni Marczyk, Jean-François Saclé, Mariusz Wozniak:
A note on neighbor expanded sum distinguishing index. Discuss. Math. Graph Theory 37(1): 29-37 (2017) - [j82]Éric Duchêne, Hamamache Kheddouci, Mohammed Amin Tahraoui, Mariusz Wozniak:
Labeled embedding of (n, n-2)-graphs in their complements. Discuss. Math. Graph Theory 37(4): 1015-1025 (2017) - [i2]Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
Equitable neighbour-sum-distinguishing edge and total colourings. CoRR abs/1701.04648 (2017) - 2016
- [j81]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Distinguishing graphs by total colourings. Ars Math. Contemp. 11(1): 79-89 (2016) - [j80]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Preface. Discret. Math. 339(7): 1827 (2016) - [j79]Rafal Kalinowski, Monika Pilsniak, Ingo Schiermeyer, Mariusz Wozniak:
Dense arbitrarily partitionable graphs. Discuss. Math. Graph Theory 36(1): 5-22 (2016) - [c1]Lukasz Apiecionek, Wojciech Makowski, Mariusz Wozniak:
AI Implementation in Military Combat Identification - A Practical Solution. BDAS 2016: 659-667 - 2015
- [j78]Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49: 90-104 (2015) - [j77]Monika Pilsniak, Mariusz Wozniak:
On the Total-Neighbor-Distinguishing Index by Sums. Graphs Comb. 31(3): 771-782 (2015) - 2014
- [j76]Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak:
On the structure of arbitrarily partitionable graphs with given connectivity. Discret. Appl. Math. 162: 381-385 (2014) - [j75]Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak:
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. Discret. Math. Theor. Comput. Sci. 16(1): 225-232 (2014) - [j74]Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
How to personalize the vertices of a graph? Eur. J. Comb. 40: 116-123 (2014) - [j73]Mirko Hornák, Rafal Kalinowski, Mariusz Meszka, Mariusz Wozniak:
Minimum Number of Palettes in Edge Colorings. Graphs Comb. 30(3): 619-626 (2014) - [j72]Rafal Kalinowski, Mariusz Wozniak:
Edge-Distinguishing Index of a Graph. Graphs Comb. 30(6): 1469-1477 (2014) - [j71]Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
Partitioning powers of traceable or hamiltonian graphs. Theor. Comput. Sci. 520: 133-137 (2014) - [i1]Mohammed Amin Tahraoui, Éric Duchêne, Hamamache Kheddouci, Mariusz Wozniak:
Labeled embedding of (n, n-2)-graphs in their complements. CoRR abs/1410.8694 (2014) - 2013
- [j70]Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
Can Colour-Blind Distinguish Colour Palettes? Electron. J. Comb. 20(3): 23 (2013) - [j69]Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak:
Rainbow connection in sparse graphs. Discuss. Math. Graph Theory 33(1): 181-192 (2013) - [j68]Justyna Otfinowska, Mariusz Wozniak:
A note on uniquely embeddable forests. Discuss. Math. Graph Theory 33(1): 193-201 (2013) - [j67]Evelyne Flandrin, Antoni Marczyk, Jakub Przybylo, Jean-François Saclé, Mariusz Wozniak:
Neighbor Sum Distinguishing Index. Graphs Comb. 29(5): 1329-1336 (2013) - 2012
- [j66]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Preface. Discret. Math. 312(14): 2091 (2012) - [j65]Leonid Plachta, Jakub Przybylo, Mariusz Wozniak:
Seifert graphs and the braid index of classical and singular links. Discret. Math. 312(18): 2819-2831 (2012) - [j64]Mirko Hornák, Mariusz Wozniak:
On neighbour-distinguishing colourings from lists. Discret. Math. Theor. Comput. Sci. 14(2): 21-28 (2012) - [j63]Mirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Dense Arbitrarily Vertex Decomposable Graphs. Graphs Comb. 28(6): 807-821 (2012) - [j62]Olivier Baudon, Jakub Przybylo, Mariusz Wozniak:
On minimal arbitrarily partitionable graphs. Inf. Process. Lett. 112(17-18): 697-700 (2012) - 2011
- [j61]Jakub Przybylo, Mariusz Wozniak:
Total Weight Choosability of Graphs. Electron. J. Comb. 18(1) (2011) - [j60]Monika Pilsniak, Mariusz Wozniak:
On packing of two copies of a hypergraph. Discret. Math. Theor. Comput. Sci. 13(3): 67-74 (2011) - 2010
- [j59]Hao Li, Mariusz Wozniak:
A note on graphs containing all trees of a given size. Ars Comb. 94 (2010) - [j58]Jakub Przybylo, Mariusz Wozniak:
On a 1, 2 Conjecture. Discret. Math. Theor. Comput. Sci. 12(1): 101-108 (2010)
2000 – 2009
- 2009
- [j57]Sylwia Cichacz, Yoshimi Egawa, Mariusz Wozniak:
Arbitrary decompositions into open and closed trails. Discret. Math. 309(6): 1511-1516 (2009) - [j56]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Arbitrarily vertex decomposable suns with few rays. Discret. Math. 309(11): 3726-3732 (2009) - [j55]Sylwia Cichacz, Jakub Przybylo, Mariusz Wozniak:
Decompositions of pseudographs into closed trails of even sizes. Discret. Math. 309(15): 4903-4908 (2009) - [j54]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
On-line arbitrarily vertex decomposable suns. Discret. Math. 309(22): 6328-6336 (2009) - 2008
- [j53]Sylwia Cichacz, Jakub Przybylo, Mariusz Wozniak:
Irregular edge-colorings of sums of cycles of even lengths. Australas. J Comb. 40: 41-56 (2008) - [j52]Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak:
General neighbour-distinguishing index of a graph. Discret. Math. 308(5-6): 827-831 (2008) - [j51]Mirko Hornák, Mariusz Wozniak:
On arbitrarily vertex decomposable trees. Discret. Math. 308(7): 1268-1281 (2008) - 2007
- [j50]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments II. Australas. J Comb. 37: 57-66 (2007) - [j49]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On Self-Complementary Cyclic Packing of Forests. Electron. J. Comb. 14(1) (2007) - [j48]Mirko Hornák, Zsolt Tuza, Mariusz Wozniak:
On-line arbitrarily vertex decomposable trees. Discret. Appl. Math. 155(11): 1420-1429 (2007) - [j47]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs. Discret. Math. 307(7-8): 878-884 (2007) - [j46]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments. Discret. Math. 307(7-8): 896-904 (2007) - [j45]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Fixed-point-free embeddings of digraphs with small size. Discret. Math. 307(11-12): 1332-1340 (2007) - [j44]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A Chvátal-Erdos type condition for pancyclability. Discret. Math. 307(11-12): 1463-1466 (2007) - [j43]Ingo Schiermeyer, Mariusz Wozniak:
New sufficient conditions for hamiltonian and pancyclic graphs. Discuss. Math. Graph Theory 27(1): 29-38 (2007) - [j42]Monika Pilsniak, Mariusz Wozniak:
A note on packing of two copies of a hypergraph. Discuss. Math. Graph Theory 27(1): 45-49 (2007) - 2006
- [j41]Sylwia Cichacz, Agnieszka Görlich, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak:
Arbitrarily vertex decomposable caterpillars with four or five leaves. Discuss. Math. Graph Theory 26(2): 291-305 (2006) - [j40]Evelyne Flandrin, Hao Li, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Chvátal-Erdös condition and pancyclism. Discuss. Math. Graph Theory 26(2): 335-342 (2006) - [j39]Mirko Hornák, Mariusz Wozniak:
On neighbour-distinguishing colourings from lists. Electron. Notes Discret. Math. 24: 295-297 (2006) - [j38]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
A Note on a Packing Problem in Transitive Tournaments. Graphs Comb. 22(2): 233-239 (2006) - [j37]Keith Edwards, Mirko Hornák, Mariusz Wozniak:
On the Neighbour-Distinguishing Index of a Graph. Graphs Comb. 22(3): 341-350 (2006) - 2005
- [j36]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On self-complementary supergraphs of (n, n)-graphs. Discret. Math. 292(1-3): 167-185 (2005) - [j35]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
Erratum to "On self-complementary supergraphs of (n, n)-graphs" [Discrete Math. 292(2005) 167-185]. Discret. Math. 301(2-3): 247 (2005) - [j34]Jozef Bucko, Peter Mihók, Jean-François Saclé, Mariusz Wozniak:
A note on maximal common subgraphs of the Dirac's family of graphs. Discuss. Math. Graph Theory 25(3): 385-390 (2005) - [j33]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Some families of arbitrarily vertex decomposable graphs. Electron. Notes Discret. Math. 22: 451-454 (2005) - [j32]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A Note on a Generalisation of Ore's Condition. Graphs Comb. 21(2): 213-216 (2005) - 2004
- [j31]Mariusz Wozniak:
Packing of graphs and permutations--a survey. Discret. Math. 276(1-3): 379-391 (2004) - [j30]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A note on pancyclism of highly connected graphs. Discret. Math. 286(1-2): 57-60 (2004) - [j29]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
A note on embedding graphs without short cycles. Discret. Math. 286(1-2): 75-77 (2004) - [j28]Mirko Hornák, Stefan Pcola, Mariusz Wozniak:
On the Achromatic Index of for a Prime q. Graphs Comb. 20(2): 191-203 (2004) - [j27]Stephan Brandt, Mariusz Wozniak:
On Cyclic Packing of a Tree. Graphs Comb. 20(4): 435-442 (2004) - 2003
- [j26]Antoni Marczyk, Mariusz Wozniak:
Cycles in hamiltonian graphs of prescribed maximum degree. Discret. Math. 266(1-3): 321-326 (2003) - [j25]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
On cyclically embeddable (n, n)-graphs. Discuss. Math. Graph Theory 23(1): 85-104 (2003) - 2002
- [j24]Mariusz Wozniak:
On cyclically embeddable (n, n-1)-graphs. Discret. Math. 251(1-3): 173-179 (2002) - 2001
- [j23]Mariusz Wozniak:
Note on compact packing of a graph. Discret. Math. 233(1-3): 205-210 (2001) - [j22]Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree. Discret. Math. 236(1-3): 37-42 (2001) - [j21]Hamamache Kheddouci, Susan Marshall, Jean-François Saclé, Mariusz Wozniak:
On the packing of three graphs. Discret. Math. 236(1-3): 197-225 (2001) - [j20]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A note on a new condition implying pancyclism. Discuss. Math. Graph Theory 21(1): 137-143 (2001) - [j19]Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
Partitioning vertices of 1-tough graphs into paths. Theor. Comput. Sci. 263(1-2): 255-261 (2001) - 2000
- [j18]Hamamache Kheddouci, Jean-François Saclé, Mariusz Wozniak:
Packing two copies of a tree into its fourth power. Discret. Math. 213(1-3): 169-178 (2000) - [j17]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On self-complementary supergraphs of (n, n)-graphs. Electron. Notes Discret. Math. 5: 307-310 (2000) - [j16]Mariusz Wozniak:
Packing of graphs and permutations. Electron. Notes Discret. Math. 5: 311-314 (2000) - [j15]Cristina Bazgan, Hao Li, Mariusz Wozniak:
On the Loebl-Komlós-Sós conjecture. J. Graph Theory 34(4): 269-276 (2000)
1990 – 1999
- 1999
- [j14]Mariusz Wozniak:
On cyclically embeddable graphs. Discuss. Math. Graph Theory 19(2): 241-248 (1999) - [j13]Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs. J. Comb. Theory B 75(2): 288-301 (1999) - 1998
- [j12]Mariusz Wozniak:
A note on uniquely embeddable graphs. Discuss. Math. Graph Theory 18(1): 15-21 (1998) - 1997
- [j11]Anna Rycerz, A. Pawel Wojda, Mariusz Wozniak:
Preface. Discret. Math. 164(1-3): 1-4 (1997) - [j10]Jean-François Saclé, Mariusz Wozniak:
A note on packing of three forests. Discret. Math. 164(1-3): 265-274 (1997) - [j9]Jean-François Saclé, Mariusz Wozniak:
On graphs which contain each tree of given size. Discret. Math. 165-166: 599-605 (1997) - [j8]Jean-François Saclé, Mariusz Wozniak:
The Erdös-Sós Conjecture for Graphs withoutC4. J. Comb. Theory B 70(2): 367-372 (1997) - 1996
- [j7]Mariusz Wozniak:
Packing three trees. Discret. Math. 150(1-3): 393-402 (1996) - [j6]Maryvonne Mahéo, Jean-François Saclé, Mariusz Wozniak:
Edge-disjoint Placement of Three Trees. Eur. J. Comb. 17(6): 543-563 (1996) - [j5]Mariusz Wozniak:
On the Erdös-Sós conjecture. J. Graph Theory 21(2): 229-234 (1996) - 1995
- [j4]Mariusz Wozniak:
A note on careful packing of a graph. Discuss. Math. Graph Theory 15(1): 43-50 (1995) - 1994
- [j3]Mariusz Wozniak:
Embedding Graphs of Small Size. Discret. Appl. Math. 51(1-2): 233-241 (1994) - 1993
- [j2]Mariusz Wozniak:
A note on minimal order of a bipartite graph with exactly q quadrilaterals. Discret. Math. 121(1-3): 229-233 (1993) - [j1]Mariusz Wozniak, A. Pawel Wojda:
Triple placement of graphs. Graphs Comb. 9(1): 85-91 (1993)
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 2025-01-02 18:12 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:
