default search action
Stefan Dobrev
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
- [j43]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov
:
Exploration of High-Dimensional Grids by Finite State Machines. Algorithmica 86(5): 1700-1729 (2024) - 2023
- [j42]Stefan Dobrev, Paola Flocchini
Asynchronous Gathering in a Dangerous Ring. Algorithms 16(5): 222 (2023) - 2022
- [j41]Stefan Dobrev, Nikoleta Kircheva, Valya Nikolova, Silvia Angelova
Competition between Ag+ and Ni2+ in nickel enzymes: Implications for the Ag+ antibacterial activity. Comput. Biol. Chem. 101: 107785 (2022) - 2021
- [c63]Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Graph Exploration by Energy-Sharing Mobile Agents. SIROCCO 2021: 185-203 - [i6]Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Graph Exploration by Energy-Sharing Mobile Agents. CoRR abs/2102.13062 (2021) - 2020
- [j40]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny
Weak Coverage of a Rectangular Barrier. Algorithmica 82(4): 721-746 (2020) - [j39]Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro
Distributed exploration of dynamic rings. Distributed Comput. 33(1): 41-67 (2020) - [j38]Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia:
Searching for a non-adversarial, uncooperative agent on a cycle. Theor. Comput. Sci. 806: 531-542 (2020) - [c62]Stefan Dobrev, Rastislav Královic
Improved Lower Bounds for Shoreline Search. SIROCCO 2020: 80-90 - [c61]Stefan Dobrev, Rastislav Královic
Exploration of Time-Varying Connected Graphs with Silent Agents. SIROCCO 2020: 146-162
2010 – 2019
- 2019
- [c60]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
Exploration of High-Dimensional Grids by Finite Automata. ICALP 2019: 139:1-139:16 - [i5]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
Exploration of High-Dimensional Grids by Finite State Machines. CoRR abs/1902.03693 (2019) - 2018
- [j37]Jurek Czyzowicz, Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis
Evacuating two robots from multiple unknown exits in a circle. Theor. Comput. Sci. 709: 20-30 (2018) - 2017
- [j36]Stefan Dobrev, Rastislav Královic, Nicola Santoro:
On the Cost of Waking Up. Int. J. Netw. Comput. 7(2): 336-348 (2017) - [j35]Stefan Dobrev, Jeff Edmonds, Dennis Komm
Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689: 96-107 (2017) - [c59]Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis
Searching for a Non-adversarial, Uncooperative Agent on a Cycle. ALGOSENSORS 2017: 114-126 - [c58]Stefan Dobrev, Evangelos Kranakis
Weak Coverage of a Rectangular Barrier. CIAC 2017: 196-208 - [c57]Stefan Dobrev, Rastislav Královic
Treasure Hunt with Barely Communicating Agents. OPODIS 2017: 14:1-14:16 - [c56]Stefan Dobrev, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny:
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic. SPAA 2017: 265-274 - [i4]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Weak Coverage of a Rectangular Barrier. CoRR abs/1701.07294 (2017) - 2016
- [j34]Stefan Dobrev, Mohsen Eftekhari Hesari, Fraser MacQuarie, Ján Manuch, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Connectivity with directional antennas in the symmetric communication model. Comput. Geom. 55: 1-25 (2016) - [j33]Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Eduardo Pacheco:
Survivability of bouncing robots. Discret. Math. Algorithms Appl. 8(3): 1650042:1-1650042:17 (2016) - [j32]Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro
Exploring an unknown dangerous graph with a constant number of tokens. Theor. Comput. Sci. 610: 169-181 (2016) - [c55]Stefan Dobrev, Rastislav Kralovic
On the Complexity of Distributed Wake-Up. CANDAR 2016: 559-564 - [c54]Jurek Czyzowicz, Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis
Evacuating two robots from multiple unknown exits in a circle. ICDCN 2016: 28:1-28:8 - [c53]Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro
Live Exploration of Dynamic Rings. ICDCS 2016: 570-579 - [c52]Stefan Dobrev, Juraj Hromkovic, Dennis Komm
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM 2016: 265-276 - 2015
- [j31]Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis
Monitoring the Plane with Rotating Radars. Graphs Comb. 31(2): 393-405 (2015) - [j30]Stefan Dobrev, Rastislav Královic
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. Theory Comput. Syst. 56(1): 197-219 (2015) - [j29]Stefan Dobrev
Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579: 64-73 (2015) - [i3]Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Live Exploration of Dynamic Rings. CoRR abs/1512.05306 (2015) - 2014
- [j28]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny:
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors. Theory Comput. Syst. 54(4): 622-639 (2014) - [c51]Stefan Dobrev, Milan Plzík:
Improved Spanners in Networks with Symmetric Directional Antennas. ALGOSENSORS 2014: 103-121 - [c50]Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis
Survivability of Swarms of Bouncing Robots. LATIN 2014: 622-633 - 2013
- [j27]Stefan Dobrev, Rastislav Královic
Antibandwidth and cyclic antibandwidth of Hamming graphs. Discret. Appl. Math. 161(10-11): 1402-1408 (2013) - [j26]Stefan Dobrev, Rastislav Královic, Richard Královic:
Computing with Advice: when Knowledge Helps. Bull. EATCS 110: 35-51 (2013) - [j25]Stefan Dobrev, Paola Flocchini, Rastislav Královic
Exploring an unknown dangerous graph using tokens. Theor. Comput. Sci. 472: 28-45 (2013) - [j24]Brona Brejová
Efficient routing in carrier-based mobile networks. Theor. Comput. Sci. 509: 113-121 (2013) - [c49]Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis
Complexity of Barrier Coverage with Relocatable Sensors in the Plane. CIAC 2013: 170-182 - 2012
- [j23]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho:
Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle. Discret. Math. Algorithms Appl. 4(3) (2012) - [j22]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson
More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444: 60-76 (2012) - [c48]Stefan Dobrev, Evangelos Kranakis
Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs. CSR 2012: 112-124 - [c47]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny:
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors. FUN 2012: 94-106 - [c46]Stefan Dobrev, Evangelos Kranakis
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. LATIN 2012: 255-266 - [c45]Stefan Dobrev, Rastislav Královic
Online Graph Exploration with Advice. SIROCCO 2012: 267-278 - [c44]Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles. SIROCCO 2012: 279-290 - [c43]Stefan Dobrev, Rastislav Královic
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). WAOA 2012: 2-15 - 2011
- [j21]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic
Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. 412(18): 1696-1704 (2011) - [c42]Bronislava Brejová
Routing in Carrier-Based Mobile Networks. SIROCCO 2011: 222-233 - [i2]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho:
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. CoRR abs/1112.3523 (2011) - 2010
- [c41]Stefan Dobrev, Evangelos Kranakis
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle. COCOA (2) 2010: 72-86
2000 – 2009
- 2009
- [j20]Stefan Dobrev, Rastislav Královic
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electron. Notes Discret. Math. 34: 295-300 (2009) - [j19]Stefan Dobrev, Rastislav Královic
Measuring the problem-relevant information in input. RAIRO Theor. Informatics Appl. 43(3): 585-613 (2009) - [j18]Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs. Theor. Comput. Sci. 410(14): 1388-1400 (2009) - [c40]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson
More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO 2009: 167-181 - [c39]Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic
Black Hole Search in Directed Graphs. SIROCCO 2009: 182-194 - [i1]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung:
More efficient periodic traversal in anonymous undirected graphs. CoRR abs/0905.1737 (2009) - 2008
- [j17]Stefan Dobrev, Nicola Santoro
Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens. Int. J. Found. Comput. Sci. 19(6): 1355-1372 (2008) - [j16]Stefan Dobrev, Rastislav Kralovic
On fractional dynamic faults with thresholds. Theor. Comput. Sci. 399(1-2): 101-117 (2008) - [c38]Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernán González-Aguilar, Evangelos Kranakis
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. LATIN 2008: 158-169 - [c37]Stefan Dobrev, Rastislav Kralovic
Leader Election in Extremely Unreliable Rings and Complete Networks. OPODIS 2008: 512-526 - [c36]Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Danny Krizanc:
The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring. SOFSEM 2008: 234-246 - [c35]Stefan Dobrev, Rastislav Kralovic
How Much Information about the Future Is Needed? SOFSEM 2008: 247-258 - [c34]Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC 2008: 170-181 - 2007
- [j15]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe
Mobile Search for a Black Hole in an Anonymous Ring. Algorithmica 48(1): 67-90 (2007) - [c33]Stefan Dobrev, Nicola Santoro
Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents. Euro-Par 2007: 608-617 - [c32]Stefan Dobrev, Nicola Santoro, Wei Shi
Scattered Black Hole Search in an Oriented Ring using Tokens. IPDPS 2007: 1-8 - [c31]Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia:
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. SIROCCO 2007: 195-207 - 2006
- [j14]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe
Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distributed Comput. 19(1): 1-35 (2006) - [j13]Krzysztof Diks, Stefan Dobrev, Andrzej Pelc:
Exploring Planar Graphs Using Unoriented Maps. J. Interconnect. Networks 7(3): 353-373 (2006) - [j12]Stefan Dobrev, Paola Flocchini, Rastislav Kralovic
Black hole search in common interconnection networks. Networks 47(2): 61-71 (2006) - [j11]Edgar Chávez
Route discovery with constant memory in oriented planar geometric networks. Networks 48(1): 7-15 (2006) - [c30]Stefan Dobrev, Rastislav Kralovic
Black Hole Search in Asynchronous Rings Using Tokens. CIAC 2006: 139-150 - [c29]Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search. ICDCS 2006: 57 - [c28]Stefan Dobrev, Paola Flocchini, Rastislav Kralovic
Exploring an Unknown Graph to Locate a Black Hole Using Tokens. IFIP TCS 2006: 131-150 - [c27]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges. LATIN 2006: 286-297 - [c26]Stefan Dobrev, Rastislav Kralovic
On Fractional Dynamic Faults with Threshold. SIROCCO 2006: 197-211 - 2005
- [c25]Edgar Chávez
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. OPODIS 2005: 235-245 - [c24]Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane
Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005: 127-139 - 2004
- [j10]Stefan Dobrev, Imrich Vrto:
Dynamic faults have small effect on broadcasting in hypercubes. Discret. Appl. Math. 137(2): 155-158 (2004) - [j9]Stefan Dobrev, Andrzej Pelc:
Leader Election in Rings with Nonunique Labels. Fundam. Informaticae 59(4): 333-347 (2004) - [j8]Stefan Dobrev:
Computing input multiplicity in anonymous synchronous networks with dynamic faults. J. Discrete Algorithms 2(4): 425-438 (2004) - [j7]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Traversal of a quasi-planar subdivision without using mark bits. J. Interconnect. Networks 5(4): 395-407 (2004) - [c23]Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Route Discovery with Constant Memory in Oriented Planar Geometric Networks. ALGOSENSORS 2004: 147-156 - [c22]Edgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia:
Traversal of a Quasi-Planar Subdivision without Using Mark Bits. IPDPS 2004 - [c21]Stefan Dobrev, Paola Flocchini, Nicola Santoro
Improved Bounds for Optimal Black Hole Search with a Network Map. SIROCCO 2004: 111-122 - 2003
- [j6]Stefan Dobrev:
Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. Theory Comput. Syst. 36(6): 695-709 (2003) - [c20]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe
Multiple Agents RendezVous in a Ring in Spite of a Black Hole. OPODIS 2003: 34-46 - [c19]Stefan Dobrev, Andrzej Pelc:
Leader Election in Rings with Nonunique Labels. PDPTA 2003: 1400-1406 - 2002
- [j5]Stefan Dobrev, Imrich Vrto:
Optimal Broadcasting in Tori with Dynamic Faults. Parallel Process. Lett. 12(1): 17-22 (2002) - [c18]Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Giuseppe Prencipe, Peter Ruzicka, Nicola Santoro:
Black Hole Search by Mobile Agents in Hypercubes and Related Networks. OPODIS 2002: 169-180 - [c17]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
Searching for a black hole in arbitrary networks: optimal mobile agent protocols. PODC 2002: 153-161 - [c16]Stefan Dobrev:
Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. SIROCCO 2002: 101-113 - 2001
- [c15]Lali Barrière, Stefan Dobrev:
Leader Election in Abelian Cayley Graphs. SIROCCO 2001: 5-20 - [c14]Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman
Towards practical deteministic write-all algorithms. SPAA 2001: 271-280 - [c13]Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe
Mobile Search for a Black Hole in an Anonymous Ring. DISC 2001: 166-179 - 2000
- [j4]Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
Evolutionary graph colouring. Inf. Process. Lett. 76(1-2): 91-94 (2000) - [c12]Stefan Dobrev, Imrich Vrto:
Optimal Broadcasting in Even Tori with Dynamic Faults (Research Note). Euro-Par 2000: 927-930 - [c11]Stefan Dobrev:
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks. MFCS 2000: 314-322 - [c10]Stefan Dobrev:
Efficient wakeup in anonymous oriented complete graphs. SIROCCO 2000: 79-93 - [c9]Stefan Dobrev:
Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults. WG 2000: 137-148
1990 – 1999
- 1999
- [j3]Stefan Dobrev, Imrich Vrto:
Optimal Broadcasting in Hypercubes with Dynamic Faults. Inf. Process. Lett. 71(2): 81-85 (1999) - [c8]Stefan Dobrev:
Leader Election using Any Sense of Direction. SIROCCO 1999: 93-104 - [c7]Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
Evolutionary Graph Colouring. SIROCCO 1999: 105-110 - [c6]Stefan Dobrev, Imrich Vrto:
Two Broadcasting Problems in Faulty Hypercubes. WG 1999: 173-178 - 1998
- [j2]Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka:
Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. Inf. Process. Lett. 66(4): 181-186 (1998) - [j1]Stefan Dobrev, Peter Ruzicka:
On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. Nord. J. Comput. 5(2): 87-104 (1998) - [c5]Stefan Dobrev:
An Alternative View on Sense of Direction (Position paper). SIROCCO 1998: 114-128 - [c4]Stefan Dobrev, Peter Ruzicka, Gerard Tel:
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. SIROCCO 1998: 173-187 - [c3]Stefan Dobrev, Peter Ruzicka:
Yet Another Modular Technique for Efficient Leader Election. SOFSEM 1998: 312-321 - [c2]Stefan Dobrev, Peter Ruzicka:
Broadcasting on Anonymous Unoriented Tori. WG 1998: 50-62 - 1997
- [c1]Stefan Dobrev, Peter Ruzicka:
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. SIROCCO 1997: 53-68
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:21 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: