default search action
Sheldon H. Jacobson
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
- [j101]Kiera W. Dobbs
, Rahul Swamy
An Optimization Case Study in Analyzing Missouri Redistricting. INFORMS J. Appl. Anal. 54(2): 162-187 (2024) - [i4]Rahul Swamy, Douglas M. King, Sheldon H. Jacobson:
Highly Connected Graph Partitioning: Exact Formulation and Solution Methods. CoRR abs/2406.08329 (2024) - [i3]Sanyukta Deshpande, Nikhil Garg, Sheldon H. Jacobson:
Optimal Strategies in Ranked Choice Voting. CoRR abs/2407.13661 (2024) - 2023
- [j100]Sheldon H. Jacobson:
On Being a Computer Science Communicator. Commun. ACM 66(11): 20-22 (2023) - [j99]Wenda Zhang
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm. Comput. Optim. Appl. 85(2): 369-407 (2023) - [j98]Kiera W. Dobbs
Redistricting optimization with recombination: A local search case study. Comput. Oper. Res. 160: 106369 (2023) - [j97]Ian G. Ludden
3D geo-graphs: Efficient flip verification for the spherical zoning problem. Discret. Appl. Math. 338: 329-346 (2023) - [j96]Ian G. Ludden
A Bisection Protocol for Political Redistricting. INFORMS J. Optim. 5(3): 233-255 (2023) - [j95]Rahul Swamy
Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach. Oper. Res. 71(2): 536-562 (2023) - [j94]Meghan Shanks
Approximation algorithms for stochastic online matching with reusable resources. Math. Methods Oper. Res. 98(1): 43-56 (2023) - [i2]Sanyukta Deshpande, Ian G. Ludden, Sheldon H. Jacobson:
Votemandering: Strategies and Fairness in Political Redistricting. CoRR abs/2308.07414 (2023) - 2022
- [j93]John Pavlik
Iterative Deepening Dynamically Improved Bounds Bidirectional Search. INFORMS J. Comput. 34(2): 974-989 (2022) - [j92]Meghan Shanks
Online total bipartite matching problem. Optim. Lett. 16(5): 1411-1426 (2022) - 2021
- [j91]Edward C. Sewell, Sheldon H. Jacobson:
Dynamically improved bounds bidirectional search. Artif. Intell. 291: 103405 (2021) - [j90]John Pavlik
Two new bidirectional search algorithms. Comput. Optim. Appl. 80(2): 377-409 (2021) - [j89]Wenda Zhang
Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search. Comput. Oper. Res. 126: 105129 (2021) - [j88]Laura A. Albert
A review of risk-based security and its impact on TSA PreCheck. IISE Trans. 53(6): 657-670 (2021) - [j87]Wenda Zhang
An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints. INFORMS J. Comput. 33(3): 1091-1102 (2021) - 2020
- [j86]Hee Youn Kwon
Duality in balance optimization subset selection. Ann. Oper. Res. 289(2): 277-289 (2020) - [j85]Ge Yu
Approximation algorithms for scheduling C-benevolent jobs on weighted machines. IISE Trans. 52(4): 432-443 (2020) - [j84]Sheldon H. Jacobson
Using Risk-Based Security to Quantify the Number of Firearms Missed at Airport Security Checkpoints. INFORMS J. Appl. Anal. 50(3): 190-196 (2020) - [j83]Ge Yu
Primal-dual analysis for online interval scheduling problems. J. Glob. Optim. 77(3): 575-602 (2020)
2010 – 2019
- 2019
- [j82]Ge Yu, Sheldon H. Jacobson, Negar Kiyavash:
A bi-criteria multiple-choice secretary problem. IISE Trans. 51(6): 577-588 (2019) - [j81]Hee Youn Kwon
Bias in Balance Optimization Subset Selection: Exploration through examples. J. Oper. Res. Soc. 70(1): 67-80 (2019) - [c18]Edward C. Sewell, John Pavlik, Sheldon H. Jacobson:
An Improved Meet in the Middle Algorithm for Graphs with Unit Costs. SOCS 2019: 145-149 - 2018
- [j80]Sheldon H. Jacobson:
Push versus pull. Commun. ACM 61(4): 25-27 (2018) - [j79]Douglas M. King, Sheldon H. Jacobson
The geo-graph in practice: creating United States Congressional Districts from census blocks. Comput. Optim. Appl. 69(1): 25-49 (2018) - [j78]Ge Yu, Sheldon H. Jacobson
Online C-benevolent job scheduling on multiple machines. Optim. Lett. 12(2): 251-263 (2018) - 2017
- [c17]Sally C. Brailsford
Five decades of healthcare simulation. WSC 2017: 365-384 - 2016
- [j77]David R. Morrison, Sheldon H. Jacobson
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discret. Optim. 19: 79-102 (2016) - [j76]David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson
Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams. INFORMS J. Comput. 28(1): 67-82 (2016) - [j75]Golshid Baharian, Arash Khatibi, Sheldon H. Jacobson
Sequential stochastic assignment problem with time-dependent random success rates. J. Appl. Probab. 53(4): 1052-1063 (2016) - 2015
- [j74]Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson
Assigning Panels to Meeting Rooms at the National Science Foundation. Interfaces 45(6): 529-542 (2015) - [j73]Arash Khatibi, Golshid Baharian, Banafsheh Behzad, Sheldon H. Jacobson
Extensions of the sequential stochastic assignment problem. Math. Methods Oper. Res. 82(3): 317-340 (2015) - [j72]Douglas M. King, Sheldon H. Jacobson
Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning. Math. Program. 149(1-2): 425-457 (2015) - 2014
- [j71]David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson
An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset. Eur. J. Oper. Res. 236(2): 403-409 (2014) - [j70]Matthew J. Robbins
The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization. INFORMS J. Comput. 26(1): 183-198 (2014) - [j69]Jason J. Sauppe, Sheldon H. Jacobson
Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies. INFORMS J. Comput. 26(3): 547-566 (2014) - [j68]David R. Morrison, Jason J. Sauppe, Edward C. Sewell, Sheldon H. Jacobson
A Wide Branching Strategy for the Graph Coloring Problem. INFORMS J. Comput. 26(4): 704-717 (2014) - [j67]Golshid Baharian, Sheldon H. Jacobson:
Limiting Behavior of the Target-Dependent Stochastic Sequential Assignment Problem. J. Appl. Probab. 51(4): 943-953 (2014) - [j66]David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson
Characteristics of the maximal independent set ZDD. J. Comb. Optim. 28(1): 121-139 (2014) - [j65]David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson
An algorithm to solve the proportional network flow problem. Optim. Lett. 8(3): 801-809 (2014) - [j64]Jiayi Guo, David R. Morrison, Sheldon H. Jacobson
Complexity results for the basic residency scheduling problem. J. Sched. 17(3): 211-223 (2014) - [i1]David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson:
Solving the Pricing Problem in a Generic Branch-and-Price Algorithm using Zero-Suppressed Binary Decision Diagrams. CoRR abs/1401.5820 (2014) - 2013
- [j63]David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network. INFORMS J. Comput. 25(1): 2-12 (2013) - [j62]Alexander G. Nikolaev, Sheldon H. Jacobson
Balance Optimization Subset Selection (BOSS): An Alternative Approach for Causal Inference with Observational Data. Oper. Res. 61(2): 398-412 (2013) - 2012
- [j61]Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson
New dominance rules and exploration strategies for the 1|ri|∑Ui scheduling problem. Comput. Optim. Appl. 51(3): 1253-1274 (2012) - [j60]Edward C. Sewell, Sheldon H. Jacobson
A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem. INFORMS J. Comput. 24(3): 433-442 (2012) - [j59]Douglas M. King, Sheldon H. Jacobson
Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning. Oper. Res. 60(5): 1213-1228 (2012) - [j58]Edward C. Sewell, Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson
A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times. J. Glob. Optim. 54(4): 791-812 (2012) - [j57]Alexander G. Nikolaev, Adrian J. Lee, Sheldon H. Jacobson
Optimal Aviation Security Screening Strategies With Dynamic Passenger Risk Updates. IEEE Trans. Intell. Transp. Syst. 13(1): 203-212 (2012) - [j56]Adrian J. Lee, Sheldon H. Jacobson
Addressing Passenger Risk Uncertainty for Aviation Security Screening. Transp. Sci. 46(2): 189-203 (2012) - [c16]Shane G. Henderson, Sheldon H. Jacobson
Teaching an advanced simulation topic. WSC 2012: 2:1-2:9 - 2011
- [j55]Edward C. Sewell, Sheldon H. Jacobson, Hemanshu Kaul:
Reductions for the Stable Set Problem. Algorithmic Oper. Res. 6(1): 40-55 (2011) - [j54]Alexander G. Nikolaev, Sheldon H. Jacobson
A framework for analyzing sub-optimal performance of local search algorithms. Comput. Optim. Appl. 49(3): 407-433 (2011) - [j53]Alexander G. Nikolaev, Sheldon H. Jacobson
Using Markov chains to analyze the effectiveness of local search algorithms. Discret. Optim. 8(2): 160-173 (2011) - [j52]Adrian J. Lee, Sheldon H. Jacobson
The impact of aviation checkpoint queues on optimizing security screening effectiveness. Reliab. Eng. Syst. Saf. 96(8): 900-911 (2011) - 2010
- [j51]Alexander G. Nikolaev, Sheldon H. Jacobson
Technical Note - Stochastic Sequential Decision-Making with a Random Number of Jobs. Oper. Res. 58(4-Part-1): 1023-1027 (2010) - [j50]Laura A. McLay
Risk-Based Policies for Airport Security Checkpoint Screening. Transp. Sci. 44(3): 333-349 (2010)
2000 – 2009
- 2009
- [j49]Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson
A branch, bound, and remember algorithm for the 1| r i | Sigma t i scheduling problem. J. Sched. 12(2): 163-175 (2009) - [j48]Adrian J. Lee, Laura A. McLay
Designing Aviation Security Passenger Screening Systems Using Nonlinear Control. SIAM J. Control. Optim. 48(4): 2085-2105 (2009) - [c15]Wai Kin (Victor) Chan, Lee W. Schruben, Barry L. Nelson, Sheldon H. Jacobson
Simulation Fusion. WSC 2009: 686-695 - 2008
- [j47]Gio K. Kao, Sheldon H. Jacobson
Finding preferred subsets of Pareto optimal solutions. Comput. Optim. Appl. 40(1): 73-95 (2008) - [j46]Derek E. Armstrong, Sheldon H. Jacobson
An analysis of neighborhood functions on generic solution spaces. Eur. J. Oper. Res. 186(2): 529-541 (2008) - [j45]Shane N. Hall
An Analysis of Pediatric Vaccine Formulary Selection Problems. Oper. Res. 56(6): 1348-1365 (2008) - [j44]Sheldon H. Jacobson
Application of Information Technology: A Web-based Tool for Designing Vaccine Formularies for Childhood Immunization in the United States. J. Am. Medical Informatics Assoc. 15(5): 611-619 (2008) - 2007
- [j43]Laura A. McLay
Integer knapsack problems with set-up weights. Comput. Optim. Appl. 37(1): 35-47 (2007) - [j42]Diane E. Vaughan, Sheldon H. Jacobson
Analyzing the performance of simultaneous generalized hill climbing algorithms. Comput. Optim. Appl. 37(1): 103-119 (2007) - [j41]Laura A. McLay
Algorithms for the bounded set-up knapsack problem. Discret. Optim. 4(2): 206-212 (2007) - [j40]Alexander G. Nikolaev, Sheldon H. Jacobson
A Sequential Stochastic Security System Design Problem for Aviation Security. Transp. Sci. 41(2): 182-194 (2007) - 2006
- [j39]Derek E. Armstrong, Sheldon H. Jacobson
Analyzing the Complexity of Finding Good Neighborhood Functions for Local Search Algorithms. J. Glob. Optim. 36(2): 219-236 (2006) - [j38]Sheldon H. Jacobson
Optimal search strategies using simultaneous generalized hill climbing algorithms. Math. Comput. Model. 43(9-10): 1061-1073 (2006) - [j37]Hemanshu Kaul
Global optima results for the Kauffman NK model. Math. Program. 106(2): 319-338 (2006) - [j36]Hemanshu Kaul
New global optima results for the Kauffman NK model: handling dependency. Math. Program. 108(2-3): 475-494 (2006) - [j35]Derek E. Armstrong, Sheldon H. Jacobson
Order preserving reductions and polynomial improving paths. Oper. Res. Lett. 34(1): 9-16 (2006) - 2005
- [j34]Derek E. Armstrong, Sheldon H. Jacobson
Data-independent neighborhood functions and strict local optima. Discret. Appl. Math. 146(3): 233-243 (2005) - [j33]J. Cole Smith
An Analysis of the Alias Method for Discrete Random-Variate Generation. INFORMS J. Comput. 17(3): 321-327 (2005) - [j32]Diane E. Vaughan, Sheldon H. Jacobson
Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization Problems. INFORMS J. Comput. 17(4): 438-450 (2005) - [j31]I. Shyryayev, Sheldon H. Jacobson
A sensitivity analysis of matching coin game strategies. Math. Comput. Model. 41(6-7): 735-747 (2005) - 2004
- [j30]Vandana Venkat, Sheldon H. Jacobson
A Post-Optimality Analysis Algorithm for Multi-Objective Optimization. Comput. Optim. Appl. 28(3): 357-372 (2004) - [j29]Thomas J. Candalino Jr., John E. Kobza
Designing optimal aviation baggage screening strategies using simulated annealing. Comput. Oper. Res. 31(10): 1753-1767 (2004) - [j28]Derek E. Armstrong, Sheldon H. Jacobson
Polynomial transformations and data-independent neighborhood functions. Discret. Appl. Math. 143(1-3): 272-284 (2004) - [j27]Sheldon H. Jacobson
Analyzing the Performance of Generalized Hill Climbing Algorithms. J. Heuristics 10(4): 387-405 (2004) - [j26]Sheldon H. Jacobson
Global Optimization Performance Measures for Generalized Hill Climbing Algorithms. J. Glob. Optim. 29(2): 173-190 (2004) - 2003
- [j25]Edward C. Sewell, Sheldon H. Jacobson
Using an Integer Programming Model to Determine the Price of Combination Vaccines for Childhood Immunization. Ann. Oper. Res. 119(1-4): 261-284 (2003) - [j24]Darrall Henderson, Diane E. Vaughan, Sheldon H. Jacobson
Solving the shortest route cut and fill problem using simulated annealing. Eur. J. Oper. Res. 145(1): 72-84 (2003) - [j23]Derek E. Armstrong, Sheldon H. Jacobson
Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems. J. Glob. Optim. 27(1): 83-96 (2003) - [j22]James R. Swisher, Sheldon H. Jacobson
Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures: A survey. ACM Trans. Model. Comput. Simul. 13(2): 134-154 (2003) - [p1]Darrall Henderson, Sheldon H. Jacobson, Alan W. Johnson:
The Theory and Practice of Simulated Annealing. Handbook of Metaheuristics 2003: 287-319 - 2002
- [j21]Alan W. Johnson, Sheldon H. Jacobson
A class of convergent generalized hill climbing algorithms. Appl. Math. Comput. 125(2-3): 359-373 (2002) - [j20]Jeffrey E. Orosz, Sheldon H. Jacobson
Finite-Time Performance Analysis of Static Simulated Annealing Algorithms. Comput. Optim. Appl. 21(1): 21-53 (2002) - [j19]Alan W. Johnson, Sheldon H. Jacobson
On the convergence of generalized hill climbing algorithms. Discret. Appl. Math. 119(1-2): 37-57 (2002) - [j18]Julie Virta, Sheldon H. Jacobson
Outgoing selectee rates at hub airports. Reliab. Eng. Syst. Saf. 76(2): 155-165 (2002) - [j17]Sheldon H. Jacobson
Common issues in discrete optimization and discrete-event simulation. IEEE Trans. Autom. Control. 47(2): 341-345 (2002) - 2001
- [j16]James R. Swisher, Sheldon H. Jacobson
Modeling and analyzing a physician clinic environment using discrete-event (visual) simulation. Comput. Oper. Res. 28(2): 105-125 (2001) - [j15]Felisa J. Vázquez-Abad, Sheldon H. Jacobson:
Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems. INFORMS J. Comput. 13(4): 345-359 (2001) - [j14]Kelly A. Sullivan, Sheldon H. Jacobson
A convergence analysis of generalized hill climbing algorithms. IEEE Trans. Autom. Control. 46(8): 1288-1293 (2001) - [c14]Sheldon H. Jacobson, Edward C. Sewell, Bruce G. Weniger:
Using Monte Carlo simulation to assess the value of combination vaccines for pediatric immunization. WSC 2001: 1421-1428 - 2000
- [j13]Kelly A. Sullivan, Sheldon H. Jacobson
Ordinal Hill Climbing Algorithms for Discrete Manufacturing Process Design Optimization Problems. Discret. Event Dyn. Syst. 10(4): 307-324 (2000) - [j12]Sheldon H. Jacobson
A sampling procedure to estimate risk probabilities in access-control security systems. Eur. J. Oper. Res. 122(1): 123-132 (2000) - [j11]Ashok Kumar, Sheldon H. Jacobson
Computational analysis of a flexible assembly system design problem. Eur. J. Oper. Res. 123(3): 453-472 (2000) - [c13]James R. Swisher, Paul Hyden, Sheldon H. Jacobson, Lee Schruben:
Simulation optimization: a survey of simulation optimization techniques and procedures. WSC 2000: 119-128
1990 – 1999
- 1999
- [j10]Mark A. Fleischer, Sheldon H. Jacobson:
Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results. INFORMS J. Comput. 11(1): 35-43 (1999) - [j9]Sheldon H. Jacobson, Enver Yücesan:
On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models. Oper. Res. 47(3): 476-481 (1999) - [j8]J. Brian Jun, Sheldon H. Jacobson
Application of discrete-event simulation in health care clinics: A survey. J. Oper. Res. Soc. 50(2): 109-123 (1999) - [c12]James R. Swisher, Sheldon H. Jacobson:
A survey of ranking, selection, and multiple comparison procedures for discrete-event simulation. WSC 1999: 492-501 - 1998
- [c11]Sheldon H. Jacobson, Enver Yücesan:
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms. WSC 1998: 761-770 - 1997
- [j7]Sheldon H. Jacobson, Alan W. Johnson, Kelly A. Sullivan, Mark A. Fleischer, Ashok Kumar:
Metaheuristics for a Flexible Assembly System Design Problem. J. Heuristics 3(2): 139-159 (1997) - [c10]James R. Swisher, J. Brian Jun, Sheldon H. Jacobson, Osman Balci:
Simulation of the Queston Physician Network. WSC 1997: 1146-1154 - 1996
- [j6]Enver Yücesan, Sheldon H. Jacobson
Computational Issues for Accessibility in Discrete Event Simulation. ACM Trans. Model. Comput. Simul. 6(1): 53-75 (1996) - [c9]Sheldon H. Jacobson, Douglas J. Morrice:
Analyzing the temporal association between health disorders and medical treatments using probability models and Monte Carlo simulation. WSC 1996: 1176-1182 - 1995
- [j5]Sheldon H. Jacobson
How difficult is the frequency selection problem? Oper. Res. Lett. 17(3): 139-147 (1995) - [c8]Douglas J. Morrice, Sheldon H. Jacobson:
Amplitude Selection in Transient Sensitivity Analysis. WSC 1995: 330-335 - [c7]Enver Yücesan, Sheldon H. Jacobson:
On the Simultaneous Construction of Sample Paths. WSC 1995: 357-361 - 1994
- [j4]Sheldon H. Jacobson
Second derivative estimation using harmonic analysis. Ann. Oper. Res. 53(1): 507-531 (1994) - [j3]Sheldon H. Jacobson:
Convergence Results for Harmonic Gradient Estimators. INFORMS J. Comput. 6(4): 381-397 (1994) - [c6]Felisa J. Vázquez-Abad, Sheldon H. Jacobson:
Application of RPA and the harmonic gradient estimators to a priority queueing system. WSC 1994: 369-376 - [c5]Sheldon H. Jacobson, Douglas J. Morrice, David H. Withers, Enver Yücesan, W. David Kelton:
Teaching simulation: a panel discussion. WSC 1994: 1378-1381 - 1993
- [j2]Sheldon H. Jacobson
The effectiveness of finite improvement algorithms for finding global optima. ZOR Methods Model. Oper. Res. 37(3): 257-272 (1993) - 1992
- [c4]Enver Yücesan, Sheldon H. Jacobson:
Building Correct Simulation Models is Difficult. WSC 1992: 783-790 - 1991
- [j1]Sheldon H. Jacobson, Arnold H. Buss, Lee W. Schruben:
Driving Frequency Selection for Frequency Domain Simulation Experiments. Oper. Res. 39(6): 917-924 (1991) - 1990
- [c3]Douglas J. Morrice, Lee W. Schruben, Sheldon H. Jacobson:
Initial transient effects in the frequency domain. WSC 1990: 357-359
1980 – 1989
- 1989
- [c2]Sheldon H. Jacobson:
Oscillation amplitude considerations in frequency domain experiments. WSC 1989: 406-410 - 1988
- [c1]Sheldon H. Jacobson, Douglas J. Morrice, Lee W. Schruben:
The global simulation clock as the frequency domain experiment index. WSC 1988: 558-563
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:15 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: