default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMinghui Jiang 0001
Person information
- affiliation: Utah State University, Logan, UT, USA
Other persons with the same name
- Minghui Jiang — disambiguation page
- Minghui Jiang 0002 — Three Gorges University, Yichang, China (and 1 more)
- Minghui Jiang 0003
![[0000-0002-5043-3547]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5043-3547")
— Harbin Institute of Technology, School of Management, China - Minghui Jiang 0004 — Xiamen University, School of Information Science and Engineering, Fujian Key Laboratory of Sensing and Computing for Smart City, Fujian, China
- Minghui Jiang 0005 — Huazhong University of Science and Technology, Tongji Medical College, School of Public Health, Wuhan, China
- Minghui Jiang 0006 — University of Science and Technology Beijing, Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[i24]Rain Jiang, Kai Jiang, Minghui Jiang:
On universal covers for carpenter's rule folding. CoRR abs/2108.09832 (2021)- [i23]Rain Jiang, Kai Jiang, Minghui Jiang:
Linking disjoint segments into a simple polygon is hard. CoRR abs/2108.12812 (2021) - [i22]Rain Jiang, Kai Jiang, Minghui Jiang:
Moving intervals for packing and covering. CoRR abs/2109.00579 (2021) - [i21]Rain Jiang, Kai Jiang, Minghui Jiang:
Linking disjoint axis-parallel segments into a simple polygon is hard too. CoRR abs/2109.02156 (2021) - [i20]Rain Jiang, Kai Jiang, Minghui Jiang:
Disjoint axis-parallel segments without a circumscribing polygon. CoRR abs/2109.02617 (2021) - [i19]Rain Jiang, Kai Jiang, Minghui Jiang:
Caterpillars and alternating paths. CoRR abs/2109.05630 (2021) - [i18]Rain Jiang, Kai Jiang, Minghui Jiang:
Partitioning an interval graph into subgraphs with small claws. CoRR abs/2109.11498 (2021) - [i17]Rain Jiang, Kai Jiang, Minghui Jiang:
Vertebrate interval graphs. CoRR abs/2109.12140 (2021) - [i16]Rain Jiang, Kai Jiang, Minghui Jiang:
Decomposing a graph into subgraphs with small components. CoRR abs/2110.00692 (2021) - [i15]Rain Jiang, Kai Jiang, Minghui Jiang:
Partial order alignment by adjacencies and breakpoints. CoRR abs/2110.02809 (2021)
2010 – 2019
- 2019
- [j65]Adrian Dumitrescu, Minghui Jiang:
Computational Geometry Column 69. SIGACT News 50(3): 75-90 (2019) - 2018
- [j64]Minghui Jiang:
Trees, Paths, Stars, Caterpillars and Spiders. Algorithmica 80(6): 1964-1982 (2018) - [j63]Adrian Dumitrescu, Minghui Jiang:
Minimum rectilinear Steiner tree of n points in the unit square. Comput. Geom. 68: 253-261 (2018) - [j62]Adrian Dumitrescu, Minghui Jiang:
On the Number of Maximum Empty Boxes Amidst n Points. Discret. Comput. Geom. 59(3): 742-756 (2018) - [j61]Minghui Jiang:
Periodicity of identifying codes in strips. Inf. Process. Lett. 135: 77-84 (2018) - 2017
- [j60]Minghui Jiang, Yong Zhang:
Perfect domination and small cycles. Discret. Math. Algorithms Appl. 9(3): 1750030:1-1750030:11 (2017) - 2016
- [j59]Minghui Jiang, Yong Zhang:
Kernelization of edge perfect code and its variants. Discret. Appl. Math. 214: 145-152 (2016) - [j58]Minghui Jiang, Haitao Wang:
Shortest color-spanning intervals. Theor. Comput. Sci. 609: 561-568 (2016) - [j57]Minghui Jiang, Ge Xia, Yong Zhang:
Edge-disjoint packing of stars and cycles. Theor. Comput. Sci. 640: 61-69 (2016) - [c53]Adrian Dumitrescu, Minghui Jiang:
On the Number of Maximum Empty Boxes Amidst n Points. SoCG 2016: 36:1-36:13 - [i14]Minghui Jiang:
Periodicity of identifying codes in strips. CoRR abs/1607.03848 (2016) - [i13]Adrian Dumitrescu, Minghui Jiang:
Perfect vector sets, properly overlapping partitions, and largest empty box. CoRR abs/1608.06874 (2016) - 2015
- [j56]Adrian Dumitrescu, Minghui Jiang:
On the approximability of covering points by lines and related problems. Comput. Geom. 48(9): 703-717 (2015) - [j55]Minghui Jiang:
On Covering Points with Minimum Turns. Int. J. Comput. Geom. Appl. 25(1): 1-10 (2015) - [j54]Adrian Dumitrescu, Minghui Jiang:
Systems of distant representatives in Euclidean space. J. Comb. Theory A 134: 36-50 (2015) - [j53]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
Computing Opaque Interior Barriers à la Shermer. SIAM J. Discret. Math. 29(3): 1372-1386 (2015) - [j52]Minghui Jiang, Pedro J. Tejada, Haitao Wang:
Quell. Theor. Comput. Sci. 593: 70-78 (2015) - [j51]Francis Y. L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, Diwei Zhou:
Competitive algorithms for unbounded one-way trading. Theor. Comput. Sci. 607: 35-48 (2015) - [c52]Minghui Jiang:
Trees, Paths, Stars, Caterpillars and Spiders. COCOA 2015: 551-565 - [c51]Minghui Jiang, Ge Xia, Yong Zhang:
Edge-Disjoint Packing of Stars and Cycles. COCOA 2015: 676-687 - 2014
- [j50]Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. Algorithmica 69(2): 315-334 (2014) - [j49]Adrian Dumitrescu, Minghui Jiang:
Computational Geometry Column 60. SIGACT News 45(4): 76-82 (2014) - [c50]Francis Y. L. Chin, Bin Fu, Minghui Jiang, Hing-Fung Ting, Yong Zhang:
Competitive Algorithms for Unbounded One-Way Trading. AAIM 2014: 32-43 - [c49]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
Computing Opaque Interior Barriers à la Shermer. APPROX-RANDOM 2014: 128-143 - [c48]Minghui Jiang, Haitao Wang:
Shortest Color-Spanning Intervals. COCOON 2014: 288-299 - [c47]Adrian Dumitrescu, Minghui Jiang:
The Opaque Square. SoCG 2014: 529 - [c46]Minghui Jiang, Pedro J. Tejada, Haitao Wang:
Quell. FUN 2014: 240-251 - 2013
- [j48]Adrian Dumitrescu, Minghui Jiang:
On the Largest Empty Axis-Parallel Box Amidst n Points. Algorithmica 66(2): 225-248 (2013) - [j47]Minghui Jiang:
Recognizing d-Interval Graphs and d-Track Interval Graphs. Algorithmica 66(3): 541-563 (2013) - [j46]Adrian Dumitrescu, Minghui Jiang:
On reconfiguration of disks in the plane and related problems. Comput. Geom. 46(3): 191-202 (2013) - [j45]Adrian Dumitrescu, Minghui Jiang:
Maximal Empty Boxes Amidst Random Points. Comb. Probab. Comput. 22(4): 477-498 (2013) - [j44]Minghui Jiang:
Flipping triangles and rectangles. J. Comb. Optim. 26(4): 755-769 (2013) - [j43]Adrian Dumitrescu, Minghui Jiang:
Computational geometry column 56. SIGACT News 44(2): 80-87 (2013) - [j42]Adrian Dumitrescu, Minghui Jiang:
Computational geometry column 58. SIGACT News 44(4): 73-78 (2013) - [j41]Laurent Bulteau, Minghui Jiang:
Inapproximability of (1, 2)-Exemplar Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 10(6): 1384-1390 (2013) - [c45]Adrian Dumitrescu, Minghui Jiang:
Systems of distant representatives in euclidean space. SoCG 2013: 441-448 - [i12]Adrian Dumitrescu, Minghui Jiang:
The opaque square. CoRR abs/1311.3323 (2013) - [i11]Adrian Dumitrescu, Minghui Jiang:
On the approximability of covering points by lines and related problems. CoRR abs/1312.2549 (2013) - 2012
- [j40]Adrian Dumitrescu, Minghui Jiang:
Minimum-Perimeter Intersecting Polygons. Algorithmica 63(3): 602-615 (2012) - [j39]Minghui Jiang:
Approximability of constrained LCS. J. Comput. Syst. Sci. 78(3): 689-697 (2012) - [j38]Adrian Dumitrescu, Minghui Jiang:
Dispersion in Disks. Theory Comput. Syst. 51(2): 125-142 (2012) - [j37]Minghui Jiang, Vincent Pilaud, Pedro J. Tejada:
On a Dispersion Problem in Grid Labeling. SIAM J. Discret. Math. 26(1): 39-51 (2012) - [j36]Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu:
Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. 440-441: 14-28 (2012) - [j35]Minghui Jiang, Yong Zhang:
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy. Theor. Comput. Sci. 461: 27-44 (2012) - [c44]Minghui Jiang:
On Covering Points with Minimum Turns. FAW-AAIM 2012: 58-69 - [c43]Adrian Dumitrescu, Minghui Jiang:
Maximal Empty Boxes Amidst Random Points. APPROX-RANDOM 2012: 529-540 - [c42]Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette:
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. CPM 2012: 138-148 - [c41]Laurent Bulteau, Minghui Jiang:
Inapproximability of (1, 2)-Exemplar Distance. ISBRA 2012: 13-23 - [c40]Guillaume Blin, Minghui Jiang, Stéphane Vialette:
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE 2012: 130-142 - [i10]Minghui Jiang:
Clique in 3-track interval graphs is APX-hard. CoRR abs/1204.2202 (2012) - 2011
- [j34]Adrian Dumitrescu, Minghui Jiang:
Sweeping Points. Algorithmica 60(3): 703-717 (2011) - [j33]Adrian Dumitrescu, Minghui Jiang:
Piercing Translates and Homothets of a Convex Body. Algorithmica 61(1): 94-115 (2011) - [j32]Minghui Jiang:
An inequality on the edge lengths of triangular meshes. Comput. Geom. 44(2): 100-103 (2011) - [j31]Adrian Dumitrescu, Minghui Jiang:
Constrained k-center and movement to independence. Discret. Appl. Math. 159(8): 859-865 (2011) - [j30]Adrian Dumitrescu, Minghui Jiang:
Sweeping an oval to a vanishing point. Discret. Appl. Math. 159(14): 1436-1442 (2011) - [j29]Adrian Dumitrescu, Minghui Jiang:
The Forest Hiding Problem. Discret. Comput. Geom. 45(3): 529-552 (2011) - [j28]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
New bounds on the average distance from the Fermat-Weber center of a planar convex body. Discret. Optim. 8(3): 417-427 (2011) - [j27]Minghui Jiang:
The Zero Exemplar Distance Problem. J. Comput. Biol. 18(9): 1077-1086 (2011) - [j26]Minghui Jiang, Xiaojun Qi, Pedro J. Tejada:
A Computational-Geometry Approach to Digital Image Contour Extraction. Trans. Comput. Sci. 13: 13-43 (2011) - [j25]Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu:
On the red/blue spanning tree problem. Theor. Comput. Sci. 412(23): 2459-2467 (2011) - [j24]Minghui Jiang:
Inapproximability of maximal strip recovery. Theor. Comput. Sci. 412(29): 3759-3774 (2011) - [c39]Adrian Dumitrescu, Minghui Jiang, János Pach:
Opaque Sets. APPROX-RANDOM 2011: 194-205 - [c38]Minghui Jiang, Yong Zhang:
Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy. COCOON 2011: 62-73 - [c37]Minghui Jiang:
Flipping Triangles and Rectangles. COCOON 2011: 543-554 - [c36]Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu:
Tractability and Approximability of Maximal Strip Recovery. CPM 2011: 336-349 - [c35]Minghui Jiang, Yong Zhang:
Parameterized Complexity in Multiple-Interval Graphs: Domination. IPEC 2011: 27-40 - [i9]Adrian Dumitrescu, Minghui Jiang:
Sweeping an oval to a vanishing point. CoRR abs/1101.4667 (2011) - [i8]Minghui Jiang, Yong Zhang:
Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy. CoRR abs/1110.0187 (2011) - 2010
- [j23]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. Algorithmica 57(3): 538-561 (2010) - [j22]Adrian Dumitrescu, Minghui Jiang:
Monochromatic simplices of any volume. Discret. Math. 310(4): 956-960 (2010) - [j21]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geom. Appl. 20(2): 105-118 (2010) - [j20]Minghui Jiang, Pedro J. Tejada, Ramoni O. Lasisi, Shanhong Cheng, D. Scott Fechser:
K-Partite RNA Secondary Structures. J. Comput. Biol. 17(7): 915-925 (2010) - [j19]Minghui Jiang:
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots. IEEE ACM Trans. Comput. Biol. Bioinform. 7(2): 323-332 (2010) - [j18]Minghui Jiang:
On the parameterized complexity of some optimization problems related to multiple-interval graphs. Theor. Comput. Sci. 411(49): 4253-4262 (2010) - [c34]Minghui Jiang, Vincent Pilaud, Pedro J. Tejada:
On a dispersion problem in grid labeling. CCCG 2010: 75-78 - [c33]Adrian Dumitrescu, Minghui Jiang:
Constrained k-center and movement to independence. CCCG 2010: 233-236 - [c32]Minghui Jiang:
On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs. CPM 2010: 125-137 - [c31]Minghui Jiang:
Inapproximability of Maximal Strip Recovery: II. FAW 2010: 53-64 - [c30]Minghui Jiang:
Recognizing d-Interval Graphs and d-Track Interval Graphs. FAW 2010: 160-171 - [c29]Minghui Jiang:
Approximability of Constrained LCS. ISAAC (2) 2010: 180-191 - [c28]Adrian Dumitrescu, Minghui Jiang:
Minimum-Perimeter Intersecting Polygons. LATIN 2010: 433-445 - [c27]Minghui Jiang:
The Zero Exemplar Distance Problem. RECOMB-CG 2010: 74-82 - [c26]Adrian Dumitrescu, Minghui Jiang:
The Forest Hiding Problem. SODA 2010: 1566-1579 - [c25]Adrian Dumitrescu, Minghui Jiang:
Dispersion in Unit Disks. STACS 2010: 299-310 - [i7]Minghui Jiang:
The zero exemplar distance problem. CoRR abs/1003.1991 (2010) - [i6]Adrian Dumitrescu, Minghui Jiang:
Coloring translates and homothets of a convex body. CoRR abs/1008.1360 (2010)
2000 – 2009
- 2009
- [j17]Sergey Bereg, Ovidiu Daescu, Minghui Jiang:
A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009) - [j16]Joel Gillespie, Martin Mayne, Minghui Jiang:
RNA folding on the 3D triangular lattice. BMC Bioinform. 10: 369 (2009) - [j15]Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu:
On recovering syntenic blocks from comparative maps. J. Comb. Optim. 18(3): 307-318 (2009) - [j14]Minghui Jiang:
A Linear-Time Algorithm for Hamming Distance with Shifts. Theory Comput. Syst. 44(3): 349-355 (2009) - [c24]Pedro J. Tejada, Xiaojun Qi, Minghui Jiang:
Computational Geometry of Contour Extraction. CCCG 2009: 25-28 - [c23]Minghui Jiang:
An Inequality on the Edge Lengths of Triangular Meshes. CCCG 2009: 141-144 - [c22]Adrian Dumitrescu, Minghui Jiang:
Piercing Translates and Homothets of a Convex Body. ESA 2009: 131-142 - [c21]Minghui Jiang:
Inapproximability of Maximal Strip Recovery. ISAAC 2009: 616-625 - [c20]Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu:
On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127 - [c19]Minghui Jiang, Pedro J. Tejada, Ramoni O. Lasisi, Shanhong Cheng, D. Scott Fechser:
K-Partite RNA Secondary Structures. WABI 2009: 157-168 - [c18]Adrian Dumitrescu, Minghui Jiang:
On Reconfiguration of Disks in the Plane and Related Problems. WADS 2009: 254-265 - [i5]Minghui Jiang, Pedro J. Tejada:
Spreading grid cells. CoRR abs/0908.3911 (2009) - [i4]Adrian Dumitrescu, Minghui Jiang:
On the largest empty axis-parallel box amidst n points. CoRR abs/0909.3127 (2009) - [i3]Adrian Dumitrescu, Minghui Jiang:
Piercing translates and homothets of a convex body. CoRR abs/0910.4172 (2009) - [i2]Adrian Dumitrescu, Minghui Jiang:
Dispersion in unit disks. CoRR abs/0912.2125 (2009) - [i1]Minghui Jiang:
Inapproximability of maximal strip recovery. CoRR abs/0912.4935 (2009) - 2008
- [j13]Minghui Jiang, James Anderson, Joel Gillespie, Martin Mayne:
uShuffle: A useful tool for shuffling biological sequences while preserving the k-let counts. BMC Bioinform. 9 (2008) - [j12]Adrian Dumitrescu, Minghui Jiang:
On a Covering Problem for Equilateral Triangles. Electron. J. Comb. 15(1) (2008) - [j11]Minghui Jiang:
On the sum of distances along a circle. Discret. Math. 308(10): 2038-2045 (2008) - [j10]Minghui Jiang, Ying Xu, Binhai Zhu:
Protein Structure-structure Alignment with Discrete FrÉchet Distance. J. Bioinform. Comput. Biol. 6(1): 51-64 (2008) - [c17]Adrian Dumitrescu, Minghui Jiang:
Sweeping Points. APPROX-RANDOM 2008: 63-76 - [c16]Adrian Dumitrescu, Minghui Jiang:
Monochromatic simplices of any volume. CCCG 2008 - [c15]Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu:
On Recovering Syntenic Blocks from Comparative Maps. COCOA 2008: 319-327 - [c14]Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu:
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641 - [c13]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. SWAT 2008: 294-305 - 2007
- [j9]Minghui Jiang:
On finding a large number of 3D points with a small diameter. Discret. Appl. Math. 155(17): 2355-2361 (2007) - [j8]Minghui Jiang:
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem. J. Comb. Optim. 13(3): 217-221 (2007) - [j7]Minghui Jiang, Joel Gillespie:
Engineering the Divide-and-Conquer Closest Pair Algorithm. J. Comput. Sci. Technol. 22(4): 532-540 (2007) - [c12]Minghui Jiang:
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots. AAIM 2007: 399-410 - [c11]Minghui Jiang, Ying Xu, Binhai Zhu:
Protein Structure-Structure Alignment with Discrete Fr'echet Distance. APBC 2007: 131-141 - [c10]Minghui Jiang, James Anderson, Joel Gillespie, Martin Mayne:
uShuffle: a Useful Tool for Shuffling Biological Sequences While Preserving the K-let Counts. BIOCOMP 2007: 605-613 - [c9]Minghui Jiang:
A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model. COCOA 2007: 378-387 - [c8]Minghui Jiang, Martin Mayne, Joel Gillespie:
Delta: A Toolset for the Structural Analysis of Biological Sequences on a 3D Triangular Lattice. ISBRA 2007: 518-529 - [c7]Vladimir A. Kulyukin, Aliasgar Kutiyanawala, Minghui Jiang:
Surface-Embedded Passive RF Exteroception: Kepler, Greed, and Buffon's Needle. UIC 2007: 33-42 - 2006
- [j6]Minghui Jiang:
Approximating minimum coloring and maximum independent set in dotted interval graphs. Inf. Process. Lett. 98(1): 29-33 (2006) - [j5]Minghui Jiang:
A new approximation algorithm for labeling points with circle pairs. Inf. Process. Lett. 99(4): 125-129 (2006) - [j4]Binhai Zhu, Minghui Jiang:
A combinatorial theorem on labeling squares with points and its application. J. Comb. Optim. 11(4): 411-420 (2006) - [c6]Minghui Jiang:
Subsequence Packing: Complexity, Approximation, and Application. AAIM 2006: 314-323 - [c5]Sergey Bereg, Ovidiu Daescu, Minghui Jiang:
A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185 - [c4]Chaitanya Gharpure, Vladimir A. Kulyukin, Minghui Jiang, Aliasgar Kutiyanawala:
Passive Radio Frequency Exteroception in Robot Assisted Shopping for the Blind. UIC 2006: 51-60 - 2005
- [j3]Minghui Jiang:
UPS-k: a set partitioning problem with applications in UPS pickup-delivery system. Inf. Process. Lett. 93(4): 173-175 (2005) - [j2]Minghui Jiang, Binhai Zhu:
Protein Folding on the Hexagonal Lattice in the Hp Model. J. Bioinform. Comput. Biol. 3(1): 19-34 (2005) - 2004
- [c3]Minghui Jiang, Brendan Mumey, Zhongping Qin, Andrew Tomascak, Binhai Zhu:
Approximations for Two Decomposition-Based Geometric Optimization Problems. ICCSA (3) 2004: 90-98 - [c2]Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu:
New Bounds on Map Labeling with Circular Labels. ISAAC 2004: 606-617 - [c1]Sergey Bereg, Minghui Jiang, Binhai Zhu:
Contour interpolation with bounded dihedral angles. Symposium on Solid Modeling and Applications 2004: 303-308 - 2003
- [j1]Minghui Jiang, Jianbo Qian, Zhongping Qin, Binhai Zhu, Robert J. Cimikowski:
A simple factor-3 approximation for labeling points with circles. Inf. Process. Lett. 87(2): 101-105 (2003)
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-21 00:03 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:
