default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErvin Györi
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
[j106]Csilla Bujtás
, Akbar Davoodi, Laihao Ding, Ervin Györi, Zsolt Tuza, Donglei Yang:
Covering the edges of a graph with triangles. Discret. Math. 348(1): 114226 (2025)- 2024
- [j105]Zhen He, Peter Frankl, Ervin Györi, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu:
Extremal Results for Graphs Avoiding a Rainbow Subgraph. Electron. J. Comb. 31(1) (2024) - [j104]Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu:
Generalized Turán numbers for the edge blow-up of a graph. Discret. Math. 347(1): 113682 (2024) - [j103]Debarun Ghosh, Ervin Györi, Judit Nagy-György, Addisu Paulos, Chuanqi Xiao, Oscar Zamora:
Book free 3-uniform hypergraphs. Discret. Math. 347(3): 113828 (2024) - [j102]Fangfang Zhang, Yaojun Chen, Ervin Györi, Xiutao Zhu:
Maximum cliques in a graph without disjoint given subgraph. Discret. Math. 347(4): 113863 (2024) - [j101]Emily Eckels, Ervin Györi, Junsheng Liu, Sohaib Nasir:
Set-sequential labelings of odd trees. Discuss. Math. Graph Theory 44(1): 151 (2024) - [j100]Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Xiutao Zhu:
The maximum number of copies of an even cycle in a planar graph. J. Comb. Theory B 167: 15-22 (2024) - 2023
- [j99]Andrzej Grzesik, Ervin Györi, Nika Salia, Casey Tompkins:
Subgraph Densities in $K_r$-Free Graphs. Electron. J. Comb. 30(1) (2023) - [j98]Chunqiu Fang, Ervin Györi, Chuanqi Xiao, Jimeng Xiao:
Turán Numbers and Anti-Ramsey Numbers for Short Cycles in Complete $3$-Partite Graphs. Electron. J. Comb. 30(2) (2023) - [j97]Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins:
On $3$-uniform hypergraphs avoiding a cycle of length four. Electron. J. Comb. 30(4) (2023) - [j96]Ervin Györi, Addisu Paulos, Chuanqi Xiao:
Generalized outerplanar Turán number of short paths. Discret. Math. 346(1): 113205 (2023) - [j95]Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora:
Turán numbers of Berge trees. Discret. Math. 346(4): 113286 (2023) - [j94]Xiutao Zhu, Yaojun Chen, Dániel Gerbner, Ervin Györi, Hilal Hama Karim:
The maximum number of triangles in Fk-free graphs. Eur. J. Comb. 114: 103793 (2023) - [j93]Xiutao Zhu, Ervin Györi, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga:
Edges Not Covered by Monochromatic Bipartite Graph. SIAM J. Discret. Math. 37(4): 2508-2522 (2023) - [i5]Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn:
On the Small Quasi-kernel conjecture. CoRR abs/2307.04112 (2023) - 2022
- [j92]Debarun Ghosh, Ervin Györi, Addisu Paulos, Chuanqi Xiao, Oscar Zamora:
The Turán number of the triangular pyramid of 3-layers. Discret. Appl. Math. 317: 75-85 (2022) - [j91]Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora:
Inverse Turán numbers. Discret. Math. 345(5): 112779 (2022) - [j90]Lucas Colucci, Ervin Györi:
On L(2, 1)-labelings of oriented graphs. Discuss. Math. Graph Theory 42(1): 39-46 (2022) - [j89]Debarun Ghosh, Ervin Györi, Oliver Janzer, Addisu Paulos, Nika Salia, Oscar Zamora:
The maximum number of induced C 5 's in a planar graph. J. Graph Theory 99(3): 378-398 (2022) - [j88]Andrzej Grzesik, Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora:
The maximum number of paths of length three in a planar graph. J. Graph Theory 101(3): 493-510 (2022) - [j87]Lucas Colucci, Ervin Györi:
On L(2, 1)-labelings of some products of oriented cycles. Math. Found. Comput. 5(1): 67 (2022) - [j86]Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Chuanqi Xiao:
Planar Turán Number of the 6-Cycle. SIAM J. Discret. Math. 36(3): 2028-2050 (2022) - 2021
- [j85]Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész:
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain. Electron. J. Comb. 28(3): 3 (2021) - [j84]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
The Exact Linear Turán Number of the Sail. Electron. J. Comb. 28(4) (2021) - [j83]Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora:
Generalized Planar Turán Numbers. Electron. J. Comb. 28(4) (2021) - [j82]Ervin Györi, Addisu Paulos, Chuanqi Xiao:
Wiener index of quadrangulation graphs. Discret. Appl. Math. 289: 262-269 (2021) - [j81]Chunqiu Fang, Ervin Györi, Mei Lu, Jimeng Xiao:
On the anti-Ramsey number of forests. Discret. Appl. Math. 291: 129-142 (2021) - [j80]Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Nika Salia, Chuanqi Xiao, Oscar Zamora:
The maximum number of paths of length four in a planar graph. Discret. Math. 344(5): 112317 (2021) - [j79]Chunqiu Fang, Ervin Györi, Binlong Li, Jimeng Xiao:
The anti-Ramsey numbers of C3 and C4 in complete r-partite graphs. Discret. Math. 344(11): 112540 (2021) - [j78]Ervin Györi, Nika Salia, Oscar Zamora:
Connected hypergraphs without long Berge-paths. Eur. J. Comb. 96: 103353 (2021) - [j77]Chunqiu Fang, Ervin Györi, Jimeng Xiao:
On the Maximal Colorings of Complete Graphs Without Some Small Properly Colored Subgraphs. Graphs Comb. 37(6): 2287-2304 (2021) - [j76]Ervin Györi, Nathan Lemons, Nika Salia, Oscar Zamora:
The structure of hypergraphs without long Berge cycles. J. Comb. Theory B 148: 239-250 (2021) - 2020
- [j75]Ervin Györi, Michael D. Plummer, Dong Ye, Xiaoya Zha:
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps. Comb. 40(3): 405-433 (2020) - [j74]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-Uniform Hypergraphs without a Cycle of Length Five. Electron. J. Comb. 27(2): 2 (2020) - [j73]Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora:
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2. Comb. Probab. Comput. 29(3): 423-435 (2020) - [j72]Lucas Colucci, Ervin Györi, Abhishek Methuku:
Edge colorings of graphs without monochromatic stars. Discret. Math. 343(12): 112140 (2020) - [j71]Csilla Bujtás, Akbar Davoodi, Ervin Györi, Zsolt Tuza:
Clique coverings and claw-free graphs. Eur. J. Comb. 88: 103114 (2020) - [j70]Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal Pebbling Number of the Square Grid. Graphs Comb. 36(3): 803-829 (2020) - [j69]Debarun Ghosh, Ervin Györi, Addisu Paulos, Nika Salia, Oscar Zamora:
The maximum Wiener index of maximal planar graphs. J. Comb. Optim. 40(4): 1121-1135 (2020) - [j68]Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer:
Generalized Turán problems for even cycles. J. Comb. Theory B 145: 169-213 (2020)
2010 – 2019
- 2019
- [j67]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
On the Rainbow Turán number of paths. Electron. J. Comb. 26(1): 1 (2019) - [j66]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. Comb. Probab. Comput. 28(2): 241-252 (2019) - [j65]Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal pebbling and rubbling of graphs with given diameter. Discret. Appl. Math. 266: 340-345 (2019) - [j64]Ervin Györi, Tamás Róbert Mezei:
Mobile versus Point Guards. Discret. Comput. Geom. 61(2): 421-451 (2019) - [j63]Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins:
The optimal pebbling number of staircase graphs. Discret. Math. 342(7): 2148-2157 (2019) - [j62]Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora:
The maximum number of Pℓ copies in Pk-free graphs. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j61]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. J. Comb. Theory A 163: 163-181 (2019) - [j60]Beka Ergemlidze, Abhishek Methuku, Nika Salia, Ervin Györi:
A note on the maximum number of triangles in a C5-free graph. J. Graph Theory 90(3): 227-230 (2019) - [j59]Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei:
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. Theor. Comput. Sci. 775: 16-25 (2019) - [i4]Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész:
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing. CoRR abs/1909.02308 (2019) - 2018
- [j58]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy. Electron. J. Comb. 25(2): 2 (2018) - [j57]Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei:
Terminal-pairability in complete bipartite graphs. Discret. Appl. Math. 236: 459-463 (2018) - [j56]Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Máté Vizer:
On the maximum size of connected hypergraphs without a path of given length. Discret. Math. 341(9): 2602-2605 (2018) - [j55]Akbar Davoodi, Ervin Györi, Abhishek Methuku, Casey Tompkins:
An Erdős-Gallai type theorem for uniform hypergraphs. Eur. J. Comb. 69: 159-162 (2018) - [j54]Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer:
On the Turán number of some ordered even cycles. Eur. J. Comb. 73: 81-88 (2018) - [j53]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-Uniform Hypergraphs and Linear Cycles. SIAM J. Discret. Math. 32(2): 933-950 (2018) - 2017
- [j52]Ervin Györi, Balázs Keszegh:
On the Number of Edge-Disjoint Triangles in K 4-Free Graphs. Comb. 37(6): 1113-1124 (2017) - [j51]Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros:
Note on terminal-pairability in complete grid graphs. Discret. Math. 340(5): 988-990 (2017) - [j50]Ervin Györi, Gyula Y. Katona, László F. Papp:
Constructions for the Optimal Pebbling of Grids. Period. Polytech. Electr. Eng. Comput. Sci. 61(2): 217-223 (2017) - [j49]Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-uniform hypergraphs and linear cycles. Electron. Notes Discret. Math. 61: 391-394 (2017) - [j48]Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia:
A note on the maximum number of triangles in a C5-free graph. Electron. Notes Discret. Math. 61: 395-398 (2017) - [j47]Ervin Györi, Balázs Keszegh:
On the number of edge-disjoint triangles in K4-free graphs. Electron. Notes Discret. Math. 61: 557-560 (2017) - [i3]Ervin Györi, Tamás Róbert Mezei:
Mobile vs. point guards. CoRR abs/1706.02619 (2017) - 2016
- [j46]Ervin Györi, Tamás Róbert Mezei:
Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem. Comput. Geom. 59: 13-25 (2016) - [j45]Ervin Györi, Scott Kensell, Casey Tompkins:
Making a C6-free graph C4-free and bipartite. Discret. Appl. Math. 209: 133-136 (2016) - [j44]Ervin Györi, Alexandr V. Kostochka, Andrew McConvey, Derrek Yager:
A list version of graph packing. Discret. Math. 339(8): 2178-2185 (2016) - [j43]Ervin Györi, Gyula Y. Katona, Nathan Lemons:
Hypergraph extensions of the Erdős-Gallai Theorem. Eur. J. Comb. 58: 238-246 (2016) - 2015
- [i2]Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal pebbling of grids. CTW 2015: 213-216 - [i1]Ervin Györi, Tamás Róbert Mezei:
Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem. CoRR abs/1509.05227 (2015) - 2014
- [j42]Ervin Györi, Jaroslav Nesetril, Attila Sali:
Preface. Eur. J. Comb. 35: 1 (2014) - 2012
- [j41]Ervin Györi, Nathan Lemons:
3-uniform hypergraphs avoiding a given odd cycle. Comb. 32(2): 187-203 (2012) - [j40]Ervin Györi, Hao Li:
The Maximum Number of Triangles in C2k+1-Free Graphs. Comb. Probab. Comput. 21(1-2): 187-191 (2012) - [j39]Ervin Györi, Nathan Lemons:
Hypergraphs with No Cycle of a Given Length. Comb. Probab. Comput. 21(1-2): 193-201 (2012) - [j38]Ervin Györi, Nathan Lemons:
Hypergraphs with no cycle of length 4. Discret. Math. 312(9): 1518-1520 (2012) - [j37]Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi:
Efficient algorithms for the periodic subgraphs mining problem. J. Discrete Algorithms 17: 24-30 (2012) - 2011
- [j36]Paul N. Balister, Ervin Györi, Richard H. Schelp:
Coloring vertices and edges of a graph by nonempty subsets of a set. Eur. J. Comb. 32(4): 533-537 (2011) - [j35]Jarik Nesetril, Ervin Györi, Attila Sali:
Preface. Electron. Notes Discret. Math. 38: 1-3 (2011) - 2010
- [j34]Evelyne Flandrin, Ervin Györi, Hao Li, Jinlong Shu:
Cyclability in k-connected K1, 4-free graphs. Discret. Math. 310(20): 2735-2741 (2010) - [j33]Tsz Ho Chan, Ervin Györi, András Sárközy:
On a problem of Erdos on integers, none of which divides the product of k others. Eur. J. Comb. 31(1): 260-269 (2010) - [j32]Ervin Györi, Gyula Y. Katona, Nathan Lemons:
Hypergraph Extensions of the Erdos-Gallai Theorem. Electron. Notes Discret. Math. 36: 655-662 (2010)
2000 – 2009
- 2009
- [j31]Ervin Györi, Cory Palmer:
A new type of edge-derived vertex coloring. Discret. Math. 309(22): 6344-6352 (2009) - [j30]Ervin Györi, Nathan Lemons:
Hypergraphs with no odd cycle of given length. Electron. Notes Discret. Math. 34: 359-362 (2009) - 2008
- [j29]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) - [j28]Zoltán Füredi, Ervin Györi, János Pach, Attila Sali:
Guest Editors' Foreword. Discret. Math. 308(19): 4305 (2008) - [j27]Béla Bollobás, Ervin Györi:
Pentagons vs. triangles. Discret. Math. 308(19): 4332-4336 (2008) - [j26]Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Connected graphs without long paths. Discret. Math. 308(19): 4487-4494 (2008) - 2007
- [j25]Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. 21(1): 237-250 (2007) - 2006
- [j24]Ervin Györi:
Triangle-Free Hypergraphs. Comb. Probab. Comput. 15(1-2): 185-191 (2006) - 2005
- [j23]Ervin Györi, Yoomi Rho:
An extremal problem concerning graphs not containing Kt and Kt, t, t. Discret. Math. 303(1-3): 56-64 (2005) - 2004
- [j22]Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. 13(3): 311-317 (2004) - 2003
- [j21]Ervin Györi, Vladimir Nikiforov, Richard H. Schelp:
Nearly bipartite graphs. Discret. Math. 272(2-3): 187-196 (2003) - 2002
- [j20]Ervin Györi, Richard H. Schelp:
Two-edge colorings of graphs with bounded degree in both colors. Discret. Math. 249(1-3): 105-110 (2002) - 2001
- [j19]Ervin Györi, Wilfried Imrich:
On the Strong Product of a k-Extendable and an l-Extendable Graph. Graphs Comb. 17(2): 245-253 (2001) - 2000
- [j18]Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang:
Vertex-Disjoint Cycles Containing Specified Edges. Graphs Comb. 16(1): 81-92 (2000)
1990 – 1999
- 1999
- [j17]Ervin Györi, Tibor Jordán:
How to make a graph four-connected. Math. Program. 84(3): 555-563 (1999) - 1997
- [j16]Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak:
Graphs without short odd cycles are nearly bipartite. Discret. Math. 163(1-3): 279-284 (1997) - [j15]Ervin Györi:
C6-free bipartite graphs and product representation of squares. Discret. Math. 165-166: 371-375 (1997) - 1996
- [j14]Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6: 21-44 (1996) - 1994
- [c1]Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer:
Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307 - 1992
- [j13]Ervin Györi, Michael D. Plummer:
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. Discret. Math. 101(1-3): 87-96 (1992) - 1991
- [j12]Ervin Györi:
On the number of edge disjoint cliques in graphs of given size. Comb. 11(3): 231-243 (1991) - [j11]Ervin Györi, János Pach, Miklós Simonovits:
On the maximal number of certain subgraphs inKr-free graphs. Graphs Comb. 7(1): 31-37 (1991) - [j10]Daniel Bienstock, Ervin Györi:
An Extremal Problem on Sparse 0-1 Matrices. SIAM J. Discret. Math. 4(1): 17-27 (1991)
1980 – 1989
- 1989
- [j9]Ervin Györi:
On the number of C5's in a triangle-free graph. Comb. 9(1): 101-102 (1989) - 1988
- [j8]Daniel Bienstock, Ervin Györi:
Average distance in graphs with removed elements. J. Graph Theory 12(3): 375-390 (1988) - 1986
- [j7]Noga Alon, Ervin Györi:
The number of small semispaces of a finite set of points in the plane. J. Comb. Theory A 41(1): 154-157 (1986) - 1985
- [j6]Ervin Györi:
Covering simply connected regions by rectangles. Comb. 5(1): 53-55 (1985) - 1984
- [j5]Ervin Györi:
A minimax theorem on intervals. J. Comb. Theory B 37(1): 1-9 (1984) - 1981
- [j4]Ervin Györi:
Partition conditions and vertex-connectivity of graphs. Comb. 1(3): 263-273 (1981) - [j3]Ervin Györi:
An n-dimensional search problem with restricted questions. Comb. 1(4): 377-380 (1981)
1970 – 1979
- 1978
- [j2]Ervin Györi:
On the structures induced by bipartite graphs and infinite matroids. Discret. Math. 22(3): 257-261 (1978) - [j1]Ervin Györi, Eric C. Milner:
A theorem of the transversal theory for matroids of finite character. Discret. Math. 23(3): 235-240 (1978)
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-10-07 21:24 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:
