default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIoan Todinca
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
[j39]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. Algorithmica 86(2): 585-612 (2024)- [j38]Maël Dumas, Florent Foucaud
, Anthony Perez, Ioan Todinca:
On Graphs Coverable by k Shortest Paths. SIAM J. Discret. Math. 38(2): 1840-1862 (2024) - [j37]Pierre Fraigniaud, Maël Luce, Ioan Todinca:
On the power of threshold-based algorithms for detecting cycles in the CONGEST model. Theor. Comput. Sci. 996: 114500 (2024) - [c46]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC 2024: 205-208 - [c45]Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca:
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. PODC 2024: 209-219 - [c44]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. DISC 2024: 25:1-25:20 - [i24]Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca:
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. CoRR abs/2402.12018 (2024) - [i23]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. CoRR abs/2405.03321 (2024) - 2023
- [j36]Maël Dumas, Anthony Perez, Ioan Todinca:
A Cubic Vertex-Kernel for Trivially Perfect Editing. Algorithmica 85(4): 1091-1110 (2023) - [j35]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Local certification of graphs with bounded genus. Discret. Appl. Math. 325: 9-36 (2023) - [c43]Pierre Fraigniaud, Maël Luce, Ioan Todinca:
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. SIROCCO 2023: 459-481 - [c42]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Energy-Efficient Distributed Algorithms for Synchronous Networks. SIROCCO 2023: 482-501 - [c41]Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. DISC 2023: 20:1-20:17 - [i22]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Energy-Efficient Distributed Algorithms for Synchronous Networks. CoRR abs/2301.11988 (2023) - [i21]Pierre Fraigniaud, Maël Luce, Ioan Todinca:
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. CoRR abs/2304.02360 (2023) - [i20]Arthur Braida, Simon Martiel, Ioan Todinca:
Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing. CoRR abs/2304.12872 (2023) - [i19]Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. CoRR abs/2307.14292 (2023) - [i18]Arthur Braida, Simon Martiel, Ioan Todinca:
Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing. CoRR abs/2311.12732 (2023) - 2022
- [c40]Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca:
On Graphs Coverable by k Shortest Paths. ISAAC 2022: 40:1-40:15 - [c39]Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca:
Computing Power of Hybrid Models in Synchronous Networks. OPODIS 2022: 20:1-20:18 - [c38]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. SIROCCO 2022: 116-134 - [c37]Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca:
Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks. DISC 2022: 43:1-43:3 - [i17]Maël Dumas, Anthony Perez, Mathis Rocton, Ioan Todinca:
Polynomial kernels for edge modification problems towards block and strictly chordal graphs. CoRR abs/2201.13140 (2022) - [i16]Arthur Braida, Simon Martiel, Ioan Todinca:
On constant-time quantum annealing and guaranteed approximations for graph optimization problems. CoRR abs/2202.01636 (2022) - [i15]Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca:
On graphs coverable by k shortest paths. CoRR abs/2206.15088 (2022) - [i14]Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca:
Computing Power of Hybrid Models in Synchronous Networks. CoRR abs/2208.02640 (2022) - 2021
- [j34]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. Algorithmica 83(7): 2215-2244 (2021) - [j33]Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The role of randomness in the broadcast congested clique model. Inf. Comput. 281: 104669 (2021) - [c36]Maël Dumas, Anthony Perez, Ioan Todinca:
Polynomial Kernels for Strictly Chordal Edge Modification Problems. IPEC 2021: 17:1-17:16 - [c35]Maël Dumas, Anthony Perez, Ioan Todinca:
A Cubic Vertex-Kernel for Trivially Perfect Editing. MFCS 2021: 45:1-45:14 - [i13]Maël Dumas, Anthony Perez, Ioan Todinca:
A cubic vertex-kernel for Trivially Perfect Editing. CoRR abs/2105.08549 (2021) - [i12]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. CoRR abs/2112.03195 (2021) - 2020
- [j32]János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate, Ioan Todinca:
On the heapability of finite partial orders. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j31]Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca:
Graph reconstruction in the congested clique. J. Comput. Syst. Sci. 113: 1-17 (2020) - [j30]Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The Impact of Locality in the Broadcast Congested Clique Model. SIAM J. Discret. Math. 34(1): 682-700 (2020) - [c34]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. PODC 2020: 319-328 - [i11]Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. CoRR abs/2005.05863 (2020) - [i10]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca:
Local Certification of Graphs with Bounded Genus. CoRR abs/2007.08084 (2020)
2010 – 2019
- 2019
- [j29]Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. Algorithmica 81(3): 986-1005 (2019) - [j28]Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n2) time algorithm for the minimal permutation completion problem. Discret. Appl. Math. 254: 80-95 (2019) - [c33]Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
On Distributed Merlin-Arthur Decision Protocols. SIROCCO 2019: 230-245 - 2018
- [j27]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. Algorithmica 80(4): 1146-1169 (2018) - [c32]Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. LATIN 2018: 134-145 - [c31]Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca:
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. SIROCCO 2018: 134-148 - 2017
- [j26]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Treewidth and Pathwidth parameterized by the vertex cover number. Discret. Appl. Math. 216: 114-129 (2017) - [c30]Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
Three Notes on Distributed Property Testing. DISC 2017: 15:1-15:30 - [i9]Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca:
Graph Reconstruction in the Congested Clique. CoRR abs/1706.03107 (2017) - [i8]Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca:
Distributed Subgraph Detection. CoRR abs/1706.03996 (2017) - 2016
- [j25]Dieter Kratsch, Ioan Todinca:
Guest Editorial: Selected Papers from WG 2014. Algorithmica 75(1): 186 (2016) - [c29]Pedro Montealegre, Ioan Todinca:
Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique. PODC 2016: 245-247 - [c28]Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca:
Distributed Testing of Excluded Subgraphs. DISC 2016: 342-356 - [c27]Pedro Montealegre, Ioan Todinca:
On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. WG 2016: 183-194 - [r1]Ioan Todinca:
Exact Algorithms for Treewidth. Encyclopedia of Algorithms 2016: 688-690 - [i7]Pedro Montealegre, Ioan Todinca:
Deterministic graph connectivity in the broadcast congested clique. CoRR abs/1602.04095 (2016) - [i6]Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca:
Distributed Testing of Excluded Subgraphs. CoRR abs/1605.03719 (2016) - [i5]Pedro Montealegre, Ioan Todinca:
On Distance-d Independent Set and other problems in graphs with few minimal separators. CoRR abs/1607.04545 (2016) - 2015
- [j24]Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca:
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28(3): 189-200 (2015) - [j23]Natacha Astromujoff, Mathieu Chapelle, Martín Matamala, Ioan Todinca, José Zamora:
Injective Colorings with Arithmetic Constraints. Graphs Comb. 31(6): 2003-2017 (2015) - [j22]Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Large Induced Subgraphs via Triangulations and CMSO. SIAM J. Comput. 44(1): 54-87 (2015) - [c26]Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem. WG 2015: 103-115 - [c25]Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. WG 2015: 499-512 - 2014
- [j21]Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. Discret. Appl. Math. 168: 60-68 (2014) - [j20]Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca:
(Circular) backbone colouring: Forest backbones in planar graphs. Discret. Appl. Math. 169: 119-134 (2014) - [c24]Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. SIROCCO 2014: 83-95 - [c23]Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Large induced subgraphs via triangulations and CMSO. SODA 2014: 582-583 - [c22]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca:
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques. SWAT 2014: 182-193 - [e1]Dieter Kratsch, Ioan Todinca:
Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8747, Springer 2014, ISBN 978-3-319-12339-4 [contents] - [i4]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca:
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. CoRR abs/1404.3882 (2014) - 2013
- [j19]Christophe Crespelle, Ioan Todinca:
An O(n2)O(n2)-time algorithm for the minimal interval completion problem. Theor. Comput. Sci. 494: 75-85 (2013) - [j18]Eric Goles Ch., Pedro Montealegre-Barba, Ioan Todinca:
The complexity of the bootstraping percolation and other problems. Theor. Comput. Sci. 504: 73-82 (2013) - [c21]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Treewidth and Pathwidth Parameterized by the Vertex Cover Number. WADS 2013: 232-243 - [i3]Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
TREEWIDTH and PATHWIDTH parameterized by vertex cover. CoRR abs/1305.0433 (2013) - [i2]Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Large induced subgraphs via triangulations and CMSO. CoRR abs/1309.1559 (2013) - 2012
- [j17]Alexander Grigoriev, Bert Marchal, Natalya Usotskaya, Ioan Todinca:
A note on planar graphs with large width parameters and small grid-minors. Discret. Appl. Math. 160(7-8): 1262-1269 (2012) - 2011
- [j16]Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte:
On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica 59(1): 16-34 (2011) - [c20]Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Exact Algorithm for the Maximum Induced Planar Subgraph Problem. ESA 2011: 287-298 - [c19]Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca:
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. IPDPS 2011: 508-514 - 2010
- [c18]Christophe Crespelle, Ioan Todinca:
An O(n2){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. TAMC 2010: 175-186 - [c17]Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. WG 2010: 88-99 - [i1]Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca:
Adding a referee to an interconnection network: What can(not) be computed in one round. CoRR abs/1009.4447 (2010)
2000 – 2009
- 2009
- [j15]Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca:
Computing branchwidth via efficient triangulations and blocks. Discret. Appl. Math. 157(12): 2726-2736 (2009) - [j14]Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca:
Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Trans. Algorithms 6(1): 9:1-9:21 (2009) - [j13]Karol Suchan, Ioan Todinca:
Minimal interval completion through graph exploration. Theor. Comput. Sci. 410(1): 35-43 (2009) - [c16]Rodica Mihai, Ioan Todinca:
Pathwidth is NP-Hard for Weighted Trees. FAW 2009: 181-195 - [c15]Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca:
Constructing Brambles. MFCS 2009: 223-234 - 2008
- [j12]Dieter Kratsch, Haiko Müller, Ioan Todinca:
Feedback vertex set on AT-free graphs. Discret. Appl. Math. 156(10): 1936-1947 (2008) - [j11]Ivan Rapaport, Karol Suchan, Ioan Todinca:
Minimal proper interval completions. Inf. Process. Lett. 106(5): 195-202 (2008) - [j10]Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger:
Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008) - [c14]Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte:
On Dissemination Thresholds in Regular and Irregular Graph Classes. LATIN 2008: 24-35 - 2007
- [j9]Karol Suchan, Ioan Todinca:
On powers of graphs of bounded NLC-width (clique-width). Discret. Appl. Math. 155(14): 1885-1893 (2007) - [c13]Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger:
Characterizing Minimal Interval Completions. STACS 2007: 236-247 - [c12]Karol Suchan, Ioan Todinca:
Pathwidth of Circular-Arc Graphs. WG 2007: 258-269 - 2006
- [b1]Ioan Todinca:
Décompositions arborescentes de graphes : calcul, approximations, heuristiques. (Tree decompositions of graphs: computation, approximations, heuristics). University of Orléans, France, 2006 - [c11]Karol Suchan, Ioan Todinca:
Minimal Interval Completion Through Graph Exploration. ISAAC 2006: 517-526 - [c10]Ivan Rapaport, Karol Suchan, Ioan Todinca:
Minimal Proper Interval Completions. WG 2006: 217-228 - 2005
- [j8]Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca:
Connected Graph Searching in Outerplanar Graphs. Electron. Notes Discret. Math. 22: 213-216 (2005) - [c9]Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger:
Minimal Interval Completions. ESA 2005: 403-414 - [c8]Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca:
Computing Branchwidth Via Efficient Triangulations and Blocks. WG 2005: 374-384 - 2004
- [j7]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. Discret. Appl. Math. 136(2-3): 183-196 (2004) - [c7]Fedor V. Fomin, Dieter Kratsch, Ioan Todinca:
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP 2004: 568-580 - 2003
- [j6]Vincent Bouchitté, Ioan Todinca:
Approximating the treewidth of AT-free graphs. Discret. Appl. Math. 131(1): 11-37 (2003) - [j5]Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca:
Chordal embeddings of planar graphs. Discret. Math. 273(1-3): 85-102 (2003) - [c6]Dieter Kratsch, Haiko Müller, Ioan Todinca:
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG 2003: 309-321 - [c5]Ioan Todinca:
Coloring Powers of Graphs of Bounded Clique-Width. WG 2003: 370-382 - 2002
- [j4]Vincent Bouchitté, Ioan Todinca:
Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276(1-2): 17-32 (2002) - 2001
- [j3]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. Electron. Notes Discret. Math. 8: 98-101 (2001) - [j2]Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca:
Treewidth of planar graphs: connections with duality. Electron. Notes Discret. Math. 10: 34-38 (2001) - [j1]Vincent Bouchitté, Ioan Todinca:
Treewidth and Minimum Fill-in: Grouping the Minimal Separators. SIAM J. Comput. 31(1): 212-232 (2001) - 2000
- [c4]Vincent Bouchitté, Ioan Todinca:
Listing All Potential Maximal Cliques of a Graph. STACS 2000: 503-515 - [c3]Vincent Bouchitté, Ioan Todinca:
Approximating the Treewidth of AT-Free Graphs. WG 2000: 59-70
1990 – 1999
- 1999
- [c2]Vincent Bouchitté, Ioan Todinca:
Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. STACS 1999: 197-206 - 1998
- [c1]Vincent Bouchitté, Ioan Todinca:
Minimal Triangulations for Graphs with "Few" Minimal Separators. ESA 1998: 344-355
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-25 20: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:
