default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValentin E. Brimkov
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
[j45]Valentin E. Brimkov:
Combinatorial and geometric problems in imaging sciences. Ann. Math. Artif. Intell. 92(1): 5-6 (2024)- [j44]Boris Brimkov, Valentin E. Brimkov:
Graphs with degree sequence {(m-1)m,(n-1)n} and {mn,nm}. Discret. Appl. Math. 358: 477-486 (2024) - [e17]Reneta P. Barneva, Valentin E. Brimkov, Claudio Gentile, Aldo Pacchiano:
Artificial Intelligence and Image Analysis - 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, Fort Lauderdale, FL, USA, January 8-10, 2024, Revised Selected Papers. Lecture Notes in Computer Science 14494, Springer 2024, ISBN 978-3-031-63734-6 [contents] - 2023
- [e16]Reneta P. Barneva, Valentin E. Brimkov, Giorgio Nordo:
Combinatorial Image Analysis - 21st International Workshop, IWCIA 2022, Messina, Italy, July 13-15, 2022, Proceedings. Lecture Notes in Computer Science 13348, Springer 2023, ISBN 978-3-031-23611-2 [contents] - 2022
- [j43]Boris Brimkov, Valentin E. Brimkov:
Optimal conditions for connectedness of discretized sets. J. Comb. Optim. 43(5): 1493-1506 (2022) - 2020
- [c39]Boris Brimkov, Valentin E. Brimkov:
On Connectedness of Discretized Sets. IWCIA 2020: 20-28 - [c38]Valentin E. Brimkov, Reneta P. Barneva, Kamen Kanev:
Dealing with Noise in Cluster Pattern Interface. IWCIA 2020: 236-244 - [e15]Tibor Lukic, Reneta P. Barneva, Valentin E. Brimkov, Lidija Comic, Natasa Sladoje:
Combinatorial Image Analysis - 20th International Workshop, IWCIA 2020, Novi Sad, Serbia, July 16-18, 2020, Proceedings. Lecture Notes in Computer Science 12148, Springer 2020, ISBN 978-3-030-51001-5 [contents]
2010 – 2019
- 2019
- [j42]Valentin E. Brimkov, Reneta P. Barneva:
Digital Manifolds in Computer Modeling. Inf. Sci. 499: 45-46 (2019) - [c37]Reneta P. Barneva, Valentin E. Brimkov:
Teaching Data Analytics to Sport Management Majors: A Practical Approach. LTEC 2019: 408-417 - [e14]Reneta P. Barneva, Valentin E. Brimkov, Piotr Kulczycki, João Manuel R. S. Tavares:
Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications - 6th International Conference, CompIMAGE 2018, Cracow, Poland, July 2-5, 2018, Revised Selected Papers. Lecture Notes in Computer Science 10986, Springer 2019, ISBN 978-3-030-20804-2 [contents] - 2018
- [j41]Valentin E. Brimkov, Konstanty Junosza-Szaniawski
, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic polygons and beyond: Maximal cliques in intersection graphs. Discret. Appl. Math. 247: 263-277 (2018) - [j40]Valentin E. Brimkov, Reneta P. Barneva:
Discrete geometry and topology and their applications to imaging sciences. J. Comput. Syst. Sci. 95: 132-133 (2018) - [e13]Reneta P. Barneva, Valentin E. Brimkov, João Manuel R. S. Tavares:
Combinatorial Image Analysis - 19th International Workshop, IWCIA 2018, Porto, Portugal, November 22-24, 2018, Proceedings. Lecture Notes in Computer Science 11255, Springer 2018, ISBN 978-3-030-05287-4 [contents] - [i8]Boris Brimkov, Valentin E. Brimkov:
Optimal conditions for connectedness of discretized sets. CoRR abs/1808.03053 (2018) - 2017
- [j39]Valentin E. Brimkov, Reneta P. Barneva:
Graph-theoretic and polyhedral combinatorics issues and approaches in imaging sciences. Discret. Appl. Math. 216: 321-322 (2017) - [j38]Ranita Biswas, Partha Bhowmick, Valentin E. Brimkov:
On the polyhedra of graceful spheres and circular geodesics. Discret. Appl. Math. 216: 362-375 (2017) - [e12]Reneta P. Barneva, Valentin E. Brimkov, João Manuel R. S. Tavares:
Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications - 5th International Symposium, CompIMAGE 2016, Niagara Falls, NY, USA, September 21-23, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10149, 2017, ISBN 978-3-319-54608-7 [contents] - [e11]Valentin E. Brimkov, Reneta P. Barneva:
Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Plovdiv, Bulgaria, June 19-21, 2017, Proceedings. Lecture Notes in Computer Science 10256, Springer 2017, ISBN 978-3-319-59107-0 [contents] - 2016
- [j37]Valentin E. Brimkov:
Editorial. Trans. Mass Data Anal. Images Signals 7(1): 1-2 (2016) - [e10]Reneta P. Barneva, Bhargab B. Bhattacharya, Valentin E. Brimkov, Partha Bhowmick, Arindam Biswas:
Methods and Applications in Image Analysis, Special Track on Applications of the 17th International Workshop on Combinatorial Image Analysis, IWCIA 2015, Indian Statistical Institute, Kolkata, November 24-27, 2015. Research Publishing 2016, ISBN 978-981-09-7518-0 [contents] - 2015
- [j36]Reneta P. Barneva, Valentin E. Brimkov:
Combinatorial and discrete geometric problems in image analysis. Ann. Math. Artif. Intell. 75(1-2): 1-3 (2015) - [c36]Ranita Biswas, Partha Bhowmick, Valentin E. Brimkov:
On the Connectivity and Smoothness of Discrete Spherical Circles. IWCIA 2015: 86-100 - [e9]Reneta P. Barneva, Bhargab B. Bhattacharya, Valentin E. Brimkov:
Combinatorial Image Analysis - 17th International Workshop, IWCIA 2015, Kolkata, India, November 24-27, 2015. Proceedings. Lecture Notes in Computer Science 9448, Springer 2015, ISBN 978-3-319-26144-7 [contents] - 2014
- [c35]Valentin E. Brimkov:
Knapsack Intersection Graphs and Efficient Computation of Their Maximal Cliques. CompIMAGE 2014: 176-187 - [c34]Valentin E. Brimkov:
Parallel Algorithms for Combinatorial Pattern Matching. IWCIA 2014: 8-16 - [c33]Valentin E. Brimkov, Sean Kafer, Matthew Szczepankiewicz, Joshua Terhaar:
On Intersection Graphs of Convex Polygons. IWCIA 2014: 25-36 - [c32]Boris Brimkov, Valentin E. Brimkov:
Geometric Approach to Biosequence Analysis. PACBB 2014: 97-104 - [e8]Reneta P. Barneva, Valentin E. Brimkov, Josef Slapal:
Combinatorial Image Analysis - 16th International Workshop, IWCIA 2014, Brno, Czech Republic, May 28-30, 2014. Proceedings. Lecture Notes in Computer Science 8466, Springer 2014, ISBN 978-3-319-07147-3 [contents] - [i7]Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. CoRR abs/1411.2928 (2014) - 2013
- [j35]Valentin E. Brimkov, Reneta P. Barneva:
Selected topics of combinatorial image analysis. Int. J. Comput. Math. 90(8): 1568-1570 (2013) - [j34]Valentin E. Brimkov:
Approximability issues of guarding a set of segments. Int. J. Comput. Math. 90(8): 1653-1667 (2013) - [c31]Valentin E. Brimkov:
On Connectedness of Discretized Objects. ISVC (1) 2013: 246-254 - 2012
- [j33]Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni:
Approximation algorithms for a geometric set cover problem. Discret. Appl. Math. 160(7-8): 1039-1052 (2012) - [e7]Reneta P. Barneva, Valentin E. Brimkov, Jake K. Aggarwal:
Combinatorial Image Analysis - 15th International Workshop, IWCIA 2012, Austin, TX, USA, November 28-30, 2012. Proceedings. Lecture Notes in Computer Science 7655, Springer 2012, ISBN 978-3-642-34731-3 [contents] - 2011
- [j32]Valentin E. Brimkov, Reneta P. Barneva:
Computational modeling of objects represented in images. Graph. Model. 73(6): 311-312 (2011) - [j31]Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov:
Connected distance-based rasterization of objects in arbitrary dimension. Graph. Model. 73(6): 323-334 (2011) - [j30]Valentin E. Brimkov, Reneta P. Barneva, Petra Wiederhold:
Preface. Theor. Comput. Sci. 412(15): 1299-1300 (2011) - [j29]Valentin E. Brimkov, Andrew Leach, Michael Mastroianni, Jimmy Wu:
Guarding a set of line segments in the plane. Theor. Comput. Sci. 412(15): 1313-1324 (2011) - [c30]Valentin E. Brimkov:
Complexity and Approximability Issues in Combinatorial Image Analysis. IWCIA 2011: 5-8 - [e6]Jake K. Aggarwal, Reneta P. Barneva, Valentin E. Brimkov, Kostadin Koroutchev, Elka Korutcheva:
Combinatorial Image Analysis - 14th International Workshop, IWCIA 2011, Madrid, Spain, May 23-25, 2011. Proceedings. Lecture Notes in Computer Science 6636, Springer 2011, ISBN 978-3-642-21072-3 [contents] - [e5]Reneta P. Barneva, Valentin E. Brimkov, Kostadin Koroutchev, Elka Korutcheva:
Advances in Image Analysis and Applications. Proceedings of IWCIA 2011 Special Track on Applications, Madrid, Spain, May 23-25, 2011. Research Publishing 2011 [contents] - [i6]Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni:
On the Approximability of a Geometric Set Cover Problem. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c29]Valentin E. Brimkov, Reneta P. Barneva:
Digital Stars and Visibility of Digital Objects. CompIMAGE 2010: 11-23 - [c28]Valentin E. Brimkov:
Connectedness of Offset Digitizations in Higher Dimensions. CompIMAGE 2010: 36-46 - [c27]Valentin E. Brimkov, Andrew Leach, Michael Mastroianni, Jimmy Wu:
Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments. ISVC (1) 2010: 592-601 - [e4]Reneta P. Barneva, Valentin E. Brimkov, Herbert A. Hauptman, Renato M. Natal Jorge, João Manuel R. S. Tavares:
Computational Modeling of Objects Represented in Images, Second International Symposium, CompIMAGE 2010, Buffalo, NY, USA, May 5-7, 2010. Proceedings. Lecture Notes in Computer Science 6026, Springer 2010, ISBN 978-3-642-12711-3 [contents] - [e3]Reneta P. Barneva, Valentin E. Brimkov, Renato M. Natal Jorge, João Manuel R. S. Tavares:
Computational Modeling of Objects Represented in Images, Second International Symposium, CompIMAGE 2010, Buffalo, NY, USA, May 5-7, 2010. Special Track on Object Modeling, Algorithms and Applications. Research Publishing 2010, ISBN 9789810854652 [contents] - [i5]Valentin E. Brimkov:
Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures. CoRR abs/1004.0744 (2010)
2000 – 2009
- 2009
- [j28]Valentin E. Brimkov:
Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension. Discret. Appl. Math. 157(3): 452-463 (2009) - [j27]Valentin E. Brimkov, Reneta P. Barneva:
Combinatorial approach to image analysis. Discret. Appl. Math. 157(16): 3359-3361 (2009) - [j26]Tetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva:
Some theoretical challenges in digital geometry: A perspective. Discret. Appl. Math. 157(16): 3362-3371 (2009) - [j25]Reneta P. Barneva, Valentin E. Brimkov:
Guest editorial: Contemporary challenges in combinatorial image analysis. Int. J. Imaging Syst. Technol. 19(2): 37-38 (2009) - [j24]Reneta P. Barneva, Valentin E. Brimkov, Kamen Kanev:
Combining ubiquitous direction-sensitive digitizing with a multimedia electronic dictionary for enhanced understanding. Int. J. Imaging Syst. Technol. 19(2): 39-49 (2009) - [j23]Valentin E. Brimkov, Reneta P. Barneva:
Advances in combinatorial image analysis. Pattern Recognit. 42(8): 1623-1625 (2009) - [j22]Valentin E. Brimkov:
Digitization scheme that assures faithful reconstruction of plane figures. Pattern Recognit. 42(8): 1637-1649 (2009) - [c26]Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov:
Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD. DGCI 2009: 337-349 - [c25]Kamen Kanev, Reneta P. Barneva, Valentin E. Brimkov, Dimitrina Kaneva:
Print-based Interaction Interfaces for Multilingual Multimedia and Sign Language Electronic Resource Integration. ICSOFT (2) 2009: 223-228 - [c24]Valentin E. Brimkov:
On the Convex Hull of the Integer Points in a Bi-circular Region. IWCIA 2009: 16-29 - [c23]Reneta P. Barneva, Valentin E. Brimkov, Kamen Kanev:
Theoretical Issues of Cluster Pattern Interfaces. IWCIA 2009: 302-315 - 2008
- [j21]Valentin E. Brimkov, Giorgio Nordo, Reneta P. Barneva, Angelo Maimone:
Genus and Dimension of Digital Images and their Time- and Space-Efficient Computation. Int. J. Shape Model. 14(2): 147-168 (2008) - [j20]Valentin E. Brimkov, Reinhard Klette:
Border and SurfaceTracing - Theoretical Foundations. IEEE Trans. Pattern Anal. Mach. Intell. 30(4): 577-590 (2008) - [j19]Valentin E. Brimkov, Reneta P. Barneva:
On the polyhedral complexity of the integer points in a hyperball. Theor. Comput. Sci. 406(1-2): 24-30 (2008) - [c22]Valentin E. Brimkov, Reneta P. Barneva:
Linear Time Constant-Working Space Algorithm for Computing the Genus of a Digital Object. ISVC (1) 2008: 669-677 - [c21]Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov, François de Vieilleville:
Offset Approach to Defining 3D Digital Lines. ISVC (1) 2008: 678-687 - [c20]Reneta P. Barneva, Valentin E. Brimkov, Kamen Kanev:
Electronic Multimedia Dictionary with Direct-Access Printed Interface. IWCIA Special Track on Applications 2008: 39-46 - [c19]Valentin E. Brimkov:
Scaling of Plane Figures That Assures Faithful Digitization. IWCIA 2008: 87-98 - [e2]Valentin E. Brimkov, Reneta P. Barneva, Herbert A. Hauptman:
Combinatorial Image Analysis, 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008. Proceedings. Lecture Notes in Computer Science 4958, Springer 2008, ISBN 978-3-540-78274-2 [contents] - [e1]Reneta P. Barneva, Valentin E. Brimkov:
Image Analysis - From Theory to Applications. Proceedings of IWCIA 2008 Special Track on Applications, Buffalo, NY, USA, April 7-9, 2008. Research Publishing 2008 [contents] - 2007
- [j18]Valentin E. Brimkov, David Coeurjolly, Reinhard Klette:
Digital planarity - A review. Discret. Appl. Math. 155(4): 468-495 (2007) - [j17]Valentin E. Brimkov:
Algorithmic and explicit determination of the Lovász number for certain circulant graphs. Discret. Appl. Math. 155(14): 1812-1825 (2007) - [j16]Valentin E. Brimkov, Stefan S. Dantchev:
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. Image Vis. Comput. 25(10): 1631-1643 (2007) - 2006
- [c18]Valentin E. Brimkov:
Digital geometry for image analysis and processing. CompIMAGE 2006: 9-15 - [c17]Valentin E. Brimkov:
Discrete volume polyhedrization : complexity and bounds on performance. CompIMAGE 2006: 117-122 - [c16]Valentin E. Brimkov, Davide Moroni, Reneta P. Barneva:
Combinatorial Relations for Digital Pictures. DGCI 2006: 189-198 - [c15]Valentin E. Brimkov, Reneta P. Barneva:
Polyhedrization of Discrete Convex Volumes. ISVC (1) 2006: 548-557 - [c14]Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo:
Counting Gaps in Binary Pictures. IWCIA 2006: 16-24 - [c13]Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo:
On the Notion of Dimension in Digital Spaces. IWCIA 2006: 241-252 - [c12]David Coeurjolly, Valentin E. Brimkov:
Computational Aspects of Digital Plane and Hyperplane Recognition. IWCIA 2006: 291-306 - 2005
- [j15]Valentin E. Brimkov, Reneta P. Barneva:
Analytical Honeycomb Geometry for Raster and Volume Graphics. Comput. J. 48(2): 180-199 (2005) - [j14]Valentin E. Brimkov, Reneta P. Barneva:
Plane digitization and related combinatorial problems. Discret. Appl. Math. 147(2-3): 169-186 (2005) - [j13]Alberto Apostolico, Valentin E. Brimkov:
Optimal discovery of repetitions in 2D. Discret. Appl. Math. 151(1-3): 5-20 (2005) - [j12]Valentin E. Brimkov, Reneta P. Barneva:
Exact Image Reconstruction from a Single Projection through Real Computation. Electron. Notes Discret. Math. 20: 233-246 (2005) - [c11]Valentin E. Brimkov, Stefan S. Dantchev:
Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. DGCI 2005: 287-298 - [c10]Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo, Reneta P. Barneva, Reinhard Klette:
The Number of Gaps in Binary Pictures. ISVC 2005: 35-42 - [i4]Valentin E. Brimkov, Angelo Maimone, Giorgio Nordo:
An explicit formula for the number of tunnels in digital objects. CoRR abs/cs/0505084 (2005) - 2004
- [j11]Valentin E. Brimkov:
Clique, chromatic, and Lovász numbers of certain circulant graphs. Electron. Notes Discret. Math. 17: 63-67 (2004) - [j10]Valentin E. Brimkov, Reneta P. Barneva:
Connectivity of discrete planes. Theor. Comput. Sci. 319(1-3): 203-227 (2004) - [c9]Valentin E. Brimkov:
Clique, Chromatic, and Lovász Numbers of Certain Circulant Graphs. CTW 2004: 61-65 - [c8]Valentin E. Brimkov, Reinhard Klette:
Curves, Hypersurfaces, and Good Pairs of Adjacency Relations. IWCIA 2004: 276-290 - [c7]Valentin E. Brimkov, Reneta P. Barneva, Reinhard Klette, Joseph Straight:
Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs. WG 2004: 285-295 - 2003
- [j9]Valentin E. Brimkov:
Optimal Parallel Searching an Array for Certain Repetitions. Electron. Notes Discret. Math. 12: 82-93 (2003) - [c6]Valentin E. Brimkov, Reneta P. Barneva:
Digital Flatness. DGCI 2003: 72-81 - [i3]Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Reneta P. Barneva, Mauro Leoncini:
Computation of the Lovász Theta Function for Circulant Graphs. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j8]Valentin E. Brimkov, Stefan S. Dantchev:
An alternative to Ben-Or's lower bound for the knapsack problem complexity. Appl. Math. Lett. 15(2): 187-191 (2002) - [j7]Valentin E. Brimkov, Eric Andres, Reneta P. Barneva:
Object discretizations in higher dimensions. Pattern Recognit. Lett. 23(6): 623-636 (2002) - [j6]Valentin E. Brimkov, Reneta P. Barneva:
Graceful planes and lines. Theor. Comput. Sci. 283(1): 151-170 (2002) - 2001
- [j5]Valentin E. Brimkov:
Optimally Fast CRCW-PRAM Testing 2D-Arrays for Existence of Repetitive Patterns. Int. J. Pattern Recognit. Artif. Intell. 15(7): 1167-1182 (2001) - [c5]Valentin E. Brimkov, Reneta P. Barneva:
Honeycomb vs square and cubic models. IWCIA 2001: 321-338 - 2000
- [j4]Alberto Apostolico, Valentin E. Brimkov:
Fibonacci arrays and their two-dimensional repetitions. Theor. Comput. Sci. 237(1-2): 263-273 (2000) - [j3]Reneta P. Barneva, Valentin E. Brimkov, Philippe Nehlig:
Thin discrete triangular meshes. Theor. Comput. Sci. 246(1-2): 73-105 (2000) - [c4]Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini:
On the Lovász Number of Certain Circulant Graphs. CIAC 2000: 291-305 - [c3]Valentin E. Brimkov, Eric Andres, Reneta P. Barneva:
Object Discretization in Higher Dimensions. DGCI 2000: 210-221 - [c2]Valentin E. Brimkov, Stefan S. Dantchev:
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. IFIP TCS 2000: 286-300 - [p1]Valentin E. Brimkov, Reneta P. Barneva, Philippe Nehlig:
Minimally Thin Discrete Triangulation. Volume Graphics (Graphics) 2000: 51-70 - [i2]Valentin E. Brimkov, Stefan S. Dantchev:
On the Algebraic Complexity of Integer Programming. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c1]Valentin E. Brimkov, Reneta P. Barneva:
Graceful Planes and Thin Tunnel-Free Meshes. DGCI 1999: 53-64 - 1998
- [i1]Valentin E. Brimkov, Stefan S. Dantchev:
Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j2]Valentin E. Brimkov, Stefan S. Dantchev:
Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. J. Complex. 13(2): 279-300 (1997) - 1996
- [j1]Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Strong NP-Completeness of a Matrix Similarity Problem. Theor. Comput. Sci. 165(2): 483-490 (1996)
Coauthor Index
[e17] [e16] [c38] [e15] [j42] [c37] [e14] [j40] [e13] [j39] [e12] [e11] [e10] [j36] [e9] [e8] [j35] [e7] [j32] [j31] [j30] [e6] [e5] [c29] [e4] [e3] [j27] [j26] [j25] [j24] [j23] [c26] [c25] [c23] [j21] [j19] [c22] [c21] [c20] [e2] [e1] [c16] [c15] [j15] [j14] [j12] [c10] [j10] [c7] [c6] [i3] [j7] [j6] [c5] [j3] [c3] [p1] [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-09-02 01:03 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:
