default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalázs Keszegh
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
[j59]Eyal Ackerman, Balázs Keszegh:
On the number of tangencies among 1-intersecting x-monotone curves. Eur. J. Comb. 118: 103929 (2024)- [j58]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
On tangencies among planar curves with an application to coloring L-shapes. Eur. J. Comb. 121: 103837 (2024) - [c21]Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay:
On the Number of Digons in Arrangements of Pairwise Intersecting Circles. SoCG 2024: 3:1-3:14 - [i31]Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth:
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR abs/2404.05045 (2024) - [i30]Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay:
On the number of digons in arrangements of pairwise intersecting circles. CoRR abs/2406.02276 (2024) - [i29]Balázs Keszegh, Dömötör Pálvölgyi:
On dual-ABAB-free and related hypergraphs. CoRR abs/2406.13321 (2024) - 2023
- [j57]Balázs Keszegh, Dömötör Pálvölgyi:
The Number of Tangencies Between Two Families of Curves. Comb. 43(5): 939-952 (2023) - [j56]Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy
, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341: 196-203 (2023) - [j55]Balázs Keszegh:
Coloring directed hypergraphs. Discret. Math. 346(9): 113526 (2023) - [j54]Vladimir Boskovic, Balázs Keszegh:
Saturation of Ordered Graphs. SIAM J. Discret. Math. 37(2): 1118-1141 (2023) - [i28]Eyal Ackerman, Balázs Keszegh:
On the number of tangencies among 1-intersecting curves. CoRR abs/2305.13807 (2023) - [i27]Balázs Keszegh, Dániel Simon:
Convex Hull Thrackles. CoRR abs/2307.03252 (2023) - [i26]Eyal Ackerman, Balázs Keszegh:
The maximum size of adjacency-crossing graphs. CoRR abs/2309.06507 (2023) - [i25]Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy, Kartal Nagy, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Query complexity of Boolean functions on the middle slice of the cube. CoRR abs/2309.13678 (2023) - 2022
- [j53]Chaya Keller, Balázs Keszegh, Dömötör Pálvölgyi:
On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs. Electron. J. Comb. 29(3) (2022) - [j52]Eyal Ackerman, Balázs Keszegh, Günter Rote:
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. Discret. Comput. Geom. 68(4): 1049-1077 (2022) - [j51]Balázs Keszegh:
Discrete Helly-type theorems for pseudohalfplanes. Eur. J. Comb. 101: 103469 (2022) - [i24]Balázs Keszegh:
A new discrete theory of pseudoconvexity. CoRR abs/2202.07697 (2022) - 2021
- [j50]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
Coloring Delaunay-edges and their generalizations. Comput. Geom. 96: 101745 (2021) - [j49]Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288: 235-245 (2021) - [j48]Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, Oscar Zamora:
Saturation problems in the Ramsey theory of graphs, posets and point sets. Eur. J. Comb. 95: 103321 (2021) - [j47]Balázs Keszegh, Nathan Lemons, Ryan R. Martin, Dömötör Pálvölgyi, Balázs Patkós:
Induced and non-induced poset saturation problems. J. Comb. Theory A 184: 105497 (2021) - [j46]Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. SIAM J. Discret. Math. 35(2): 915-927 (2021) - [j45]Radoslav Fulek, Balázs Keszegh:
Saturation Problems about Forbidden 0-1 Submatrices. SIAM J. Discret. Math. 35(3): 1964-1977 (2021) - [i23]Balázs Keszegh:
Discrete Helly-type theorems for pseudohalfplanes. CoRR abs/2103.11142 (2021) - [i22]Balázs Keszegh, Dömötör Pálvölgyi:
The number of tangencies between two families of curves. CoRR abs/2111.08787 (2021) - 2020
- [j44]Balázs Keszegh, Xuding Zhu:
A note about online nonrepetitive coloring k-trees. Discret. Appl. Math. 285: 108-112 (2020) - [j43]Balázs Keszegh:
Coloring Intersection Hypergraphs of Pseudo-Disks. Discret. Comput. Geom. 64(3): 942-964 (2020) - [j42]Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, Chuanqi Xiao:
Set systems related to a house allocation problem. Discret. Math. 343(7): 111886 (2020) - [j41]Balázs Keszegh:
Two-Coloring Triples such that in Each Color Class Every Element is Missed at Least Once. Graphs Comb. 36(6): 1783-1795 (2020) - [j40]Balázs Keszegh, Dömötör Pálvölgyi:
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks. J. Comput. Geom. 11(1): 354-370 (2020) - [j39]Dániel Gerbner, Balázs Keszegh, Balázs Patkós:
Generalized Forbidden Subposet Problems. Order 37(2): 389-410 (2020) - [j38]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs. SIAM J. Discret. Math. 34(4): 2250-2269 (2020) - [c20]Eyal Ackerman, Balázs Keszegh, Günter Rote:
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. SoCG 2020: 1:1-1:18 - [i21]Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. CoRR abs/2001.06367 (2020) - [i20]Eyal Ackerman, Balázs Keszegh, Günter Rote:
An almost optimal bound on the number of intersections of two simple polygons. CoRR abs/2002.05680 (2020)
2010 – 2019
- 2019
- [j37]Balázs Keszegh, Dömötör Pálvölgyi:
Proper Coloring of Geometric Hypergraphs. Discret. Comput. Geom. 62(3): 674-689 (2019) - [j36]Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Balázs Patkós, Máté Vizer:
An improvement on the maximum number of k?dominating independent sets. J. Graph Theory 91(1): 88-97 (2019) - [j35]Balázs Keszegh, Dömötör Pálvölgyi:
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. J. Comput. Geom. 10(1): 1-26 (2019) - [i19]Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR abs/1903.08383 (2019) - 2018
- [j34]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms. Algorithmica 80(8): 2400-2421 (2018) - [j33]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the size of planarly connected crossing graphs. J. Graph Algorithms Appl. 22(1): 11-22 (2018) - [j32]Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós:
On the Number of Cycles in a Graph with Restricted Cycle Lengths. SIAM J. Discret. Math. 32(1): 266-279 (2018) - [j31]Dániel Gerbner, Balázs Keszegh, Gábor Mészáros, Balázs Patkós, Máté Vizer:
Line Percolation in Finite Projective Planes. SIAM J. Discret. Math. 32(2): 864-881 (2018) - [c19]Balázs Keszegh:
Coloring Intersection Hypergraphs of Pseudo-Disks. SoCG 2018: 52:1-52:15 - [i18]Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
Coloring Delaunay-Edges and their Generalizations. CoRR abs/1806.03931 (2018) - [i17]Balázs Keszegh, Dömötör Pálvölgyi:
Plane drawings of the generalized Delaunay-graphs for pseudo-disks. CoRR abs/1806.04217 (2018) - 2017
- [j30]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. Ars Math. Contemp. 12(2): 301-314 (2017) - [j29]Ervin Györi, Balázs Keszegh:
On the Number of Edge-Disjoint Triangles in K 4-Free Graphs. Comb. 37(6): 1113-1124 (2017) - [j28]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener:
Finding a non-minority ball with majority answers. Discret. Appl. Math. 219: 18-31 (2017) - [j27]Balázs Keszegh, Xuding Zhu:
Choosability and paintability of the lexicographic product of graphs. Discret. Appl. Math. 223: 84-90 (2017) - [j26]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
Coloring Points with Respect to Squares. Discret. Comput. Geom. 58(4): 757-784 (2017) - [j25]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) - [c18]Balázs Keszegh, Dömötör Pálvölgyi:
Proper Coloring of Geometric Hypergraphs. SoCG 2017: 47:1-47:15 - [i16]Balázs Keszegh:
Coloring intersection hypergraphs of pseudo-disks. CoRR abs/1711.05473 (2017) - 2016
- [j24]Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting houses of Pareto optimal matchings in the house allocation problem. Discret. Math. 339(12): 2919-2932 (2016) - [j23]Dániel Gerbner, Balázs Keszegh, Cory Palmer, Dömötör Pálvölgyi:
Topological orderings of weighted directed acyclic graphs. Inf. Process. Lett. 116(9): 564-568 (2016) - [j22]Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi:
Online and Quasi-online Colorings of Wedges and Intervals. Order 33(3): 389-409 (2016) - [j21]Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the tree search problem with non-uniform costs. Theor. Comput. Sci. 647: 22-32 (2016) - [c17]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
Coloring Points with Respect to Squares. SoCG 2016: 5:1-5:16 - [c16]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the Size of Planarly Connected Crossing Graphs. GD 2016: 311-320 - [i15]Balázs Keszegh, Dömötör Pálvölgyi:
Proper Coloring of Geometric Hypergraphs. CoRR abs/1612.02158 (2016) - 2015
- [j20]Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener:
Finding a majority ball with majority answers. Electron. Notes Discret. Math. 49: 345-351 (2015) - [j19]Balázs Keszegh, Dömötör Pálvölgyi:
More on decomposing coverings by octants. J. Comput. Geom. 6(1): 300-315 (2015) - [c15]Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the Tree Search Problem with Non-uniform Costs. WG 2015: 90-102 - [c14]Balázs Keszegh, Dömötör Pálvölgyi:
An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes. WG 2015: 266-280 - [i14]Balázs Keszegh, Dömötör Pálvölgyi:
More on Decomposing Coverings by Octants. CoRR abs/1503.01669 (2015) - [i13]Eyal Ackerman, Balázs Keszegh, Máté Vizer:
On the size of planarly connected crossing graphs. CoRR abs/1509.02475 (2015) - 2014
- [j18]Balázs Keszegh, Dömötör Pálvölgyi:
Octants are cover-decomposable into many coverings. Comput. Geom. 47(5): 585-588 (2014) - [j17]Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth:
Covering Paths for Planar Point Sets. Discret. Comput. Geom. 51(2): 462-484 (2014) - [j16]Balázs Keszegh, Dömötör Pálvölgyi:
Convex Polygons are Self-Coverable. Discret. Comput. Geom. 51(4): 885-895 (2014) - [j15]Balázs Keszegh, Balázs Patkós, Xuding Zhu:
Nonrepetitive colorings of lexicographic product of graphs. Discret. Math. Theor. Comput. Sci. 16(2): 97-110 (2014) - [c13]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. ESA 2014: 100-111 - [c12]Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting Houses of Pareto Optimal Matchings in the House Allocation Problem. FUN 2014: 301-312 - [i12]Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting One-sided Exchange Stable Matchings. CoRR abs/1401.5354 (2014) - [i11]Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla:
On the Tree Search Problem with Non-uniform Costs. CoRR abs/1404.4504 (2014) - [i10]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms. CoRR abs/1411.7273 (2014) - 2013
- [j14]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Saturating Sperner Families. Graphs Comb. 29(5): 1355-1364 (2013) - [j13]Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic:
On Polygons Excluding Point Sets. Graphs Comb. 29(6): 1741-1753 (2013) - [j12]Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing Planar Graphs of Bounded Degree with Few Slopes. SIAM J. Discret. Math. 27(2): 1171-1183 (2013) - [j11]Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi:
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SIAM J. Discret. Math. 27(4): 1775-1787 (2013) - [c11]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Density-Based Group Testing. Information Theory, Combinatorics, and Search Theory 2013: 543-556 - [c10]Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi:
Online and Quasi-online Colorings of Wedges and Intervals. SOFSEM 2013: 292-306 - [i9]Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth:
Covering Paths for Planar Point Sets. CoRR abs/1303.0262 (2013) - [i8]Balázs Keszegh, Dömötör Pálvölgyi:
Convex Polygons are Self-Coverable. CoRR abs/1307.2411 (2013) - 2012
- [j10]Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth:
Graphs that admit right angle crossing drawings. Comput. Geom. 45(4): 169-177 (2012) - [j9]Balázs Keszegh:
Coloring half-planes and bottomless rectangles. Comput. Geom. 45(9): 495-507 (2012) - [j8]Balázs Keszegh, Dömötör Pálvölgyi:
Octants Are Cover-Decomposable. Discret. Comput. Geom. 47(3): 598-609 (2012) - [j7]Dániel Gerbner, Balázs Keszegh, Cory Palmer:
Generalizations of the tree packing conjecture. Discuss. Math. Graph Theory 32(3): 569-582 (2012) - [c9]Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi:
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SOFSEM 2012: 190-201 - [i7]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Density-based group testing. CoRR abs/1204.1464 (2012) - [i6]Balázs Keszegh, Dömötör Pálvölgyi:
Octants are Cover-Decomposable into Many Coverings. CoRR abs/1207.0672 (2012) - [i5]Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi:
Online and quasi-online colorings of wedges and intervals. CoRR abs/1207.4415 (2012) - [i4]Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener:
Search for the end of a path in the d-dimensional grid and in other graphs. CoRR abs/1211.3000 (2012) - 2011
- [j6]Balázs Keszegh, Dömötör Pálvölgyi:
Octants are Cover Decomposable. Electron. Notes Discret. Math. 38: 499-504 (2011) - [i3]Balázs Keszegh, Dömötör Pálvölgyi:
Octants are Cover Decomposable. CoRR abs/1101.3773 (2011) - [i2]Dániel Gerbner, Balázs Keszegh:
Path-search in the pyramid and in other graphs. CoRR abs/1104.5098 (2011) - 2010
- [j5]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Polychromatic colorings of arbitrary rectangular partitions. Discret. Math. 310(1): 21-30 (2010) - [j4]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl. 14(1): 5-17 (2010) - [c8]Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic:
On polygons excluding point sets. CCCG 2010: 273-276 - [c7]Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing Planar Graphs of Bounded Degree with Few Slopes. GD 2010: 293-304 - [c6]Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth:
Graphs that Admit Right Angle Crossing Drawings. WG 2010: 135-146 - [i1]Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing planar graphs of bounded degree with few slopes. CoRR abs/1009.1315 (2010)
2000 – 2009
- 2009
- [j3]Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh:
Improved upper bounds on the reflexivity of point sets. Comput. Geom. 42(3): 241-249 (2009) - [j2]Balázs Keszegh:
On linear forbidden submatrices. J. Comb. Theory A 116(1): 232-241 (2009) - 2008
- [j1]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Drawing cubic graphs with at most five slopes. Comput. Geom. 40(2): 138-147 (2008) - [c5]Balázs Keszegh:
Polychromatic Colorings of n-Dimensional Guillotine-Partitions. COCOON 2008: 110-118 - [c4]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Cubic Graphs Have Bounded Slope Parameter. GD 2008: 50-60 - 2007
- [c3]Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh:
Improved Upper Bounds on the Reflexivity of Point Sets. CCCG 2007: 29-32 - [c2]Balázs Keszegh:
Weak Conflict-Free Colorings of Point Sets and Simple Regions. CCCG 2007: 97-100 - 2006
- [c1]Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
Drawing Cubic Graphs with at Most Five Slopes. GD 2006: 114-125
Coauthor Index
[j58] [i31] [i29] [j57] [j56] [i25] [j53] [j50] [j49] [j47] [i22] [j40] [j38] [j37] [j35] [i19] [i18] [i17] [j30] [j28] [c18] [j23] [j22] [j21] [i15] [j20] [j19] [c15] [c14] [i14] [j18] [j16] [i11] [j14] [j12] [j11] [c11] [c10] [i8] [j8] [c9] [i7] [i6] [i5] [i4] [j6] [i3] [j5] [j4] [c7] [i1] [j1] [c4] [c1]
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-15 21:34 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:
